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.
> Sure, but that makes it better (IMO) to have separate code for linear
> searching the jump table.

You mean to have a copy of the search in bytecode.c?  I guess that's
fine, I'm talking about the behavior of `gethash` only.

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

No, it's an optimisation to avoid calling Fequal unnecessarily.


        Stefan