It may seem daunting because of the amount of rows, but it shouldn't take very long since its a binary search the complexity is O(log n) at worst.
-- You are receiving this because you are subscribed to this thread. Reply to this email directly or view it on GitHub: https://github.com/geany/geany/issues/1540#issuecomment-317491704
