Re: [PATCH]: Add new bytecode op `switch' for implementing branch tables.

[Stefan Monnier]

> 1. For jump tables, HASH_TABLE_SIZE (h) == h->count, so using h->count
> directly saves the cost of an array lookup.

That doesn't invalidate the usefulness of a linear search.

> 2. Since the size equals the count, we don't need to check whether
> HASH_HASH (h, i) (the hash code) is non nil in every pass of the
> linear search loop (maphash needs to do this, before calling the
> providing function).

The linear search should compare HASH_HASH(h, i) to the search key's
hash anyway, so this comparison against nil is not needed.


        Stefan