bend-kit-collections
Releases (6)
Definitions (620)
nat_order.bend
- def rhs.w1
- def rld.c0a.k
- def rld.c0a
- def rld.c0b.k
- def rld.c0b
- def rld.w0
- def rld.c1a.k
- def rld.c1a
- def rld.c1b.k
- def rld.c1b
- def rld.w1
- def rld.c2a.k
- def rld.c2a
- def rld.c2b.k
- def rld.c2b
- def rld.w2
- def rhd.c0a.k
- def rhd.c0a
- def rhd.c0b.k
- def rhd.c0b
- def rhd.w0
- def rhd.c1a.k
- def rhd.c1a
- def rhd.c1b.k
- def rhd.c1b
- def rhd.w1
- def rhd.c2a.k
- def rhd.c2a
- def rhd.c2b.k
- def rhd.c2b
- def rhd.w2
- def tiph
- def dtip
- def almlo.c0a.k
- def almlo.c0a
- def almlo.c0b.k
- def almlo.c0b
- def almlo.w0
- def almhi.c0a.k
- def almhi.c0a
- def almhi.c0b.k
- def almhi.c0b
- def almhi.w0
- def nearlo.c0a.k
- def nearlo.c0a
- def nearlo.c0b.k
- def nearlo.c0b
- def nearlo.w0
- def nearhi.c0a.k
- def nearhi.c0a
- def nearhi.c0b.k
- def nearhi.c0b
- def nearhi.w0
- def nearrf.c0a.k
- def nearrf.c0a
- def nearrf.c0b.k
- def nearrf.c0b
- def nearrf.w0
- def nearpm.c0a.k
- def nearpm.c0a
- def nearpm.c0b.k
- def nearpm.c0b
- def nearpm.w0
- def neargt.c0a.k
- def neargt.c0a
- def neargt.c0b.k
- def neargt.c0b
- def neargt.w0
omap.bend
- type OMap
- def OMap.new
- def OMap.size
- def Cmp.caseThe recursion on cmp's result: a match cannot scrutinize cmp(k, key), and a template cannot call a law filled below it, so each branch is a closure.
- def OMap.bin
- def OMap.rot_lo.double
- def OMap.rot_lo.pick
- def OMap.rot_loThe hi side is too heavy: move weight toward lo.
- def OMap.rot_hi.double
- def OMap.rot_hi.pick
- def OMap.rot_hiThe lo side is too heavy: move weight toward hi.
- def OMap.balance.if
- def OMap.balanceA node whose sides were balanced before one insertion or deletion.
- def OMap.put
- def OMap.get
- def OMap.has
- def OMap.pop_min.fin
- def OMap.pop_minThe least entry of the node lo < (k, v) < hi, and the node without it.
- def OMap.glue.fin
- def OMap.glueJoins two sides of a deleted node.
- def OMap.del
- def OMap.keys.go
- def OMap.keysThe keys in ascending order.
- def OMap.to_list.go
- def OMap.to_listThe entries in ascending key order.
- def OSet
- def OSet.new
- def OSet.size
- def OSet.add
- def OSet.has
- def OSet.del
- def OSet.to_listThe elements in ascending order.