SortedRun.contains_key: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/SortedRun.bend as SortedRun
Lines 48-56 of mylsm-lsm-store@0.6.0.1/src/SortedRun.bend: https://jend.leeeet.dev/read.txt?path=mylsm-lsm-store@0.6.0.1/src/SortedRun.bend&start_line=48&end_line=56

import Base
import mylsm-lsm-store@0.6.0.1/src/MemTable.bend as MemTable

# Check membership for whether key holds for the sorted-run operations.
def contains_key(+entry: MemTable.Entry, entries: List<&2, MemTable.Entry>) -> Bool:
  match entry:
    case MemTable.Entry{+key, val}:
      match entries:
        case Nil{}:
          False{}
        case Con{h, t}:
          bool_or(entry_key_eq(h, key), contains_key(MemTable.Entry{key, val}, t))

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/MemTable.bend&name=Entry
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/SortedRun.bend&name=bool_or
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/SortedRun.bend&name=entry_key_eq