Sorted.insert.go: def of bend-lawful-stdlib@0.1.0.0
Import: import bend-lawful-stdlib@0.1.0.0/src/sorted.bend as Sorted
Lines 33-40 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=33&end_line=40

import Base
import bend-lawful-stdlib@0.1.0.0/src/class.bend as C

# insert's step after comparing x with h. The recursive insert is passed
# as a thunk so that the x-first branch does not run it.
def insert.go(-A: Data, -o: C.Ord<A>, x: A, h: A, t: List<&2, A>, rec: Unit -> List<&2, A>, c: Or(C.Ord.R(A, o, x, h), C.Ord.R(A, o, h, x))) -> List<&2, A>:
  match c:
    case Inl{e}:
      x <> h <> t
    case Inr{e}:
      h <> rec(Unit{})

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Either
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Or
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Unit
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/class.bend&name=Ord
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/class.bend&name=Ord.R