2010/7/11 james anderson <james.anderson@...>:
> good evening,
> if one tries to gauge list operations against the limits for array
> lengths, the significant branch of code which depends on the list
> length result is eliminated as unreachable.
I'm not sure I understand what you're trying to say above, but ...
> * (describe 'length)
> LENGTH names a compiled function:
> Lambda-list: (SEQUENCE)
> Declared type: (FUNCTION (SEQUENCE)
> (VALUES (MOD 536870909) &OPTIONAL))
> Return an integer that is the length of SEQUENCE.
> Source file: SYS:SRC;CODE;SEQ.LISP
> * (lisp-implementation-version)
> * (lisp-implementation-type)
> is this an artifact of some other intent, or does this declaration
> reflect fact?
... as far as I know, this is fact. On a 64-bit build that's (mod
#.(expt 2 60)),
and on a 32-bit build, it's (mod #.(expt 2 29)). Because you're
limited by the amount
of memory you can access, your lists will never be even that long.