Sorted.insert_sorted: law of bend-lawful-stdlib@0.1.0.0 Import: import bend-lawful-stdlib@0.1.0.0/src/sorted.bend as Sorted Lines 116-121 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=116&end_line=121 import Base import bend-lawful-stdlib@0.1.0.0/src/class.bend as C law insert_sorted: for ~A: Data for ~o: C.Ord for +x: A for xs: List<&2, A> Sorted(~A, ~o, xs) -> Sorted(~A, ~o, insert(~A, ~o, x, xs)) Uses (8): https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List 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.dec https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/sorted.bend&name=Sorted https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/sorted.bend&name=insert https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/sorted.bend&name=insert_from https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/sorted.bend&name=insert_sorted.go