SortedRun.pairwise_disjoint: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/SortedRun.bend as SortedRun
Lines 196-202 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=196&end_line=202

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

# Handle pairwise disjoint in the sorted-run operations.
def pairwise_disjoint(runs: List<&2, List<&2, MemTable.Entry>>) -> Bool:
  match runs:
    case Nil{}:
      True{}
    case Con{+h, +t}:
      bool_and(disjoint_with(h, t), pairwise_disjoint(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_and
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/SortedRun.bend&name=disjoint_with