|
From: | Clément Pit-Claudel |
Subject: | Re: [PATCH]: Add new bytecode op `switch' for implementing branch tables. |
Date: | Thu, 9 Feb 2017 23:17:29 -0500 |
User-agent: | Mozilla/5.0 (X11; Linux x86_64; rv:45.0) Gecko/20100101 Thunderbird/45.7.0 |
On 2017-02-09 23:12, Vibhav Pant wrote: > The linear search code has been shifted to bytecode.c, since there > are a couple of assumptions about the jump table that we can't make > for a regular hash table, so regular gethash shouldn't be affected. That's unfortunate: linear scans for small hash tables sounded like a neat optimization. What are the assumptions that make this unsuitable for regular gethash?
[Prev in Thread] | Current Thread | [Next in Thread] |