Frame.arr.min: def of bend-toon-codec@0.1.0.0
Import: import bend-toon-codec@0.1.0.0/src/frame.bend as Frame
Lines 215-221 of bend-toon-codec@0.1.0.0/src/frame.bend: https://jend.leeeet.dev/read.txt?path=bend-toon-codec@0.1.0.0/src/frame.bend&start_line=215&end_line=221

import Base
import bend-toon-codec@0.1.0.0/src/split.bend as S

# Shallowest array frame that already has an item or row.
def arr.min(+stk: List<&2, Fr>) -> U32:
  match stk:
    case Nil{}:
      S.none()
    case Con{top, rest}:
      U32.min(arr.depth(top), arr.min(rest))

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=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.min
  https://jend.leeeet.dev/definition.txt?path=bend-toon-codec@0.1.0.0/src/frame.bend&name=Fr
  https://jend.leeeet.dev/definition.txt?path=bend-toon-codec@0.1.0.0/src/frame.bend&name=arr.depth
  https://jend.leeeet.dev/definition.txt?path=bend-toon-codec@0.1.0.0/src/split.bend&name=none