Re: scm_bits_t / scm_ubits_t

[Michael Livshin]

"Jacques A. Vidrine" <address@hidden> writes:

> On Sun, Jun 10, 2001 at 09:48:31PM +0300, Michael Livshin wrote:
> > list length is bounded thusly:
> > [ 0 : 1 << (sizeof (cell *) * sizeof (char) - sizeof (cell)) ]
>                                 ^^^^^^^^^^^^^
>                                 sizeof(char) == 1, always
> 
> Can that be  right?  I think something must have  been left out.  This
> gives a range that is way too small (less than [0:16]).

[ [0:0], to be precise. ]

duh.

s/sizeof(char)/8/

sorry.

I might still have got the math wrong, but the idea is that ..., well
never mind, Dirk already explained my point much more coherently than
I ever could.  (happens to me all the time.  I should take a coherence
writing course or something.  coherent thinking would not be bad
either).

[ I know char doesn't have to be 8 bits, but I hope you get the idea. ]

-- 
Look, would it save you all this bother if I just gave up and went mad now?
                -- Arthur Dent