mirror of
https://github.com/neondatabase/neon.git
synced 2026-07-04 12:40:37 +00:00
Use a two pointer algorithm to collect all the layers that intersect a given range. The trailing pointer tracks the start of the current range (current location in the key space) and the forward pointer tracks the next coverage change. The result of the collection is an map from layer to range which is ordered by LSN. The ordering will come in handy to the rest of the read path for figuring out where to continue from.