RangeCursor.seek: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/scan/RangeCursor.bend as RangeCursor
Lines 114-119 of mylsm-lsm-store@0.6.0.1/src/scan/RangeCursor.bend: https://jend.leeeet.dev/read.txt?path=mylsm-lsm-store@0.6.0.1/src/scan/RangeCursor.bend&start_line=114&end_line=119

import Base
import mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend as ByteMemTable
import bend-kit-bytes@0.3.2.0/bytes.bend as Bytes

# Drops ordered entries below the inclusive lower bound.
def seek(
  entries: List<&1, ByteMemTable.Entry>,
  lower: Maybe<&1, Bytes.Bytes>
) -> List<&1, ByteMemTable.Entry>:
  seek.counted(ByteMemTable.count.keep(entries), lower)

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=bend-kit-bytes@0.3.3.0/bytes.bend&name=Bytes
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend&name=Entry
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend&name=count.keep
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/scan/RangeCursor.bend&name=seek.counted