Details
-
Suggestion
-
Resolution: Out of scope
-
P3: Somewhat important
-
4.2.0
-
None
Description
I guess we could remove the request for a binary search on each key comparison by lazily initializing a list of possible matches. This should be faster since the common case would be a list of one or zero elements.