Marc Nieper-Wißkirchen wrote:
> For a bucket, in the worst case, we need the full size_t range for
> position
Right. I missed that. When the hash function is very bad (maps everything
to a single hash code), the bucket is very large.
Bruno
Am So., 11. Okt. 2020 um 12:29 Uhr schrieb Bruno Haible :
> The recursion across hamt_do_while / entry_do_while / subtrie_do_while /
> bucket_do_while builds up a stack whose essential contents is a set of
> indices, each at most 5 bits large, with a total of SIZE_WIDTH bits.
> In other words, the
Hi Marc,
> > You can see that there is an initial function call
> > HASH-TABLE-ITERATOR
> > upfront, and then a function call to HASH-TABLE-ITERATE in each
> > round
> > of the loop.
> >
> > This principle makes it possible to iterate e.g. through a hash
> >
