Commits on Jan 30, 2023

1. Improve table search speed through lookups …

   Prior to this change table search would have to do a binary search over
   about 1000 entries which resulted in around 10 memory loads on average.
   In this commit we reduce the search space by doing a pre-lookup in a
   generated table to get a smaller (often zero-length) slice of the full
   sorted range list. On average this gives us just one entry of the range
   list to perform binary search on, which reduces the average number of
   memory loads to 2.

   

   indutny committed Jan 30, 2023
   Copy the full SHA

   b4c9ce1 View commit details

   Browse the repository at this point in the history