Sorted.count: def of bend-lawful-stdlib@0.1.0.0
Import: import bend-lawful-stdlib@0.1.0.0/src/sorted.bend as Sorted
Lines 169-175 of bend-lawful-stdlib@0.1.0.0/src/sorted.bend: https://jend.leeeet.dev/read.txt?path=bend-lawful-stdlib@0.1.0.0/src/sorted.bend&start_line=169&end_line=175

import Base

# how many elements of xs ~eq calls equal to y
def count(~A: Data, ~eq: A -> A -> Bool, +y: A, xs: List<&2, A>) -> Nat:
  match xs:
    case Nil{}:
      0n
    case h <> t:
      bump(eq(y, h), count(~A, ~eq, y, t))

Uses (4):
  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=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/sorted.bend&name=bump