This may help in understanding the allocation/insertion times:
A hash preallocates a chunk of memory (into 'bins'). When
you insert an item, a special value (hash value) is calculated
for the item to determine which bin to place it in. This is
all done for fast access when dealing with large n
[EMAIL PROTECTED] wrote:
> >List!s are actually stored differently from blocks, paths and hashes,
> >so any operation on them requires special code that has not been
> >implemented for all action types.
> > - jim
>
>Maybe the list also uses slightly less storage overhead per element?
Lists use m
At the present time, both the head and tail of a list! are quick to access
as well as next and back of the current index.
- jim
At 12:50 PM 6/12/2000 -0400, you wrote:
> >List!s are actually stored differently from blocks, paths and hashes,
> >so any operation on them requires special code
>List!s are actually stored differently from blocks, paths and hashes,
>so any operation on them requires special code that has not been
>implemented for all action types.
> - jim
It makes sense, of course.
If you need random access by position number then don't use a list.
That is almost by
Hi Petr,
List!s are actually stored differently from blocks, paths and hashes, so
any operation on them requires special code that has not been implemented
for all action types.
- jim
At 12:57 PM 6/10/2000 +0200, you wrote:
>Hi,
>
>I today looked at hash and list datatypes and found out fol
