BitTree.plan_go: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/BitTree.bend as BitTree
Lines 31-43 of mylsm-lsm-store@0.6.0.1/src/BitTree.bend: https://jend.leeeet.dev/read.txt?path=mylsm-lsm-store@0.6.0.1/src/BitTree.bend&start_line=31&end_line=43

import Base

# Find the least power of two >= need. `fuel = need` is a conservative
# termination bound; each non-final step doubles capacity.
def plan_go(fuel: Nat, +need: Nat, +capacity: Nat, +height: Nat, done: Bool) -> Plan:
  match fuel:
    case 0n:
      Plan{capacity, height}
    case 1n+f:
      match done:
        case True{}:
          Plan{capacity, height}
        case False{}:
          +next = Nat.double(capacity)
          plan_go(f, need, next, Nat.add(height, 1n), Nat.is_le(need, next))

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.double
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.is_le
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/BitTree.bend&name=Plan