def ordered.strict.counted
import mylsm-lsm-store@0.6.0.1/src/ByteMemTable.bend as ByteMemTableimport Base
548# Unpacks an ordered list and its preserved recursion bound.
549def ordered.strict.counted(measured: List<&1, Entry> & Nat) -> Bool:
550 match measured:
551 case (entries, count):
552 ordered.strict.go(Nat.add(count, 1n), entries)