mirror of
https://github.com/neovim/neovim.git
synced 2025-09-06 11:28:22 +00:00

This commit replaces the usage of math.floor((lo + hi) / 2) with the faster and equivalent bit.rshift(lo + hi, 1) for calculating the midpoint in binary search.