Optimize lookup functions by caching array accesses #296
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Reduced redundant array accesses in tableValue, lookupTable, and
lookupArray functions. Each iteration now caches the lookup result
in a local variable instead of accessing the same array element
twice (once for keyHash and once for key).
This reduces array subscript overhead in hot paths during table
and key lookups, particularly beneficial for documents with many
nested tables.