Netip.zeros.best: def of bend-kit-netip@0.1.0.0
Import: import bend-kit-netip@0.1.0.0/netip.bend as Netip
Lines 290-300 of bend-kit-netip@0.1.0.0/netip.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-netip@0.1.0.0/netip.bend&start_line=290&end_line=300

import Base

# Keep the first run when two longest zero runs tie.
def zeros.best(xs: List<&2, U32>, +i: U32, +run: U32, +start: U32, +best: U32, +length: U32) -> U32 & U32:
  match xs:
    case Nil{}:
      (best, length)
    case Con{h, t}:
      +next = Bool.pick(U32, U32.is_zero(h), (run + 1 : U32), 0)
      +begin = Bool.pick(U32, U32.is_zero(run), i, start)
      +longer = U32.is_gt(next, length)
      zeros.best(t, (i + 1 : U32), next, begin, Bool.pick(U32, longer, begin, best),
        Bool.pick(U32, longer, next, length))

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.pick
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Sigma
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.is_gt
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.is_zero