~/bend-docscommunity

spec/containers/binary_heap.bend checks

raw source on the hub · import bend-collections-laws-containers@1.0.0.0/spec/containers/binary_heap.bend as Binary_heap

4 imports
import Base
import ../lib/common.bend as C
import ../../src/containers/types/binary_heap.bend as E
import ../lib/order.bend as SO

Definitions

def item source · line 31 · raw

@-A:Data -> @x:Maybe<&2, A> -> Result<&2, &2, 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Error, A>

def pop source · line 38 · raw

@-A:Data -> @xs:List<&2, A> -> Pair(List<&2, A>, 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Obs<A>)

def cons_obs source · line 60 · raw

@-A:Data -> @o:0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Obs<A> -> @r:Pair(List<&2, A>, List<&2, 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Obs<A>>) -> Pair(List<&2, A>, List<&2, 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Obs<A>>)

Templates

template le source · line 12 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @x:A -> @y:A -> Bool

template ins source · line 16 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+x:A -> @xs:List<&2, A> -> List<&2, A>

Insert into a sorted list, before the first element not smaller than x.

template from_list source · line 24 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @xs:List<&2, A> -> @acc:List<&2, A> -> List<&2, A>

The multiset of a list, left to right.

template step source · line 45 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+xs:List<&2, A> -> @op:0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Op<A> -> Pair(List<&2, A>, 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Obs<A>)

template run source · line 64 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @ops:List<&2, 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Op<A>> -> @+xs:List<&2, A> -> Pair(List<&2, A>, List<&2, 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Obs<A>>)

template all_ge source · line 73 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+z:A -> @xs:List<&2, A> -> Bool

template sorted source · line 80 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @xs:List<&2, A> -> Bool

template eq_head source · line 87 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+z:A -> @xs:List<&2, A> -> Bool

template del source · line 94 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+z:A -> @xs:List<&2, A> -> @b:Bool -> List<&2, A>

template delf source · line 103 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+z:A -> @+xs:List<&2, A> -> List<&2, A>

template nx source · line 139 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+xs:List<&2, A> -> @+op:0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Op<A> -> List<&2, A>

template ob source · line 142 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+xs:List<&2, A> -> @+op:0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Op<A> -> 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Obs<A>

template Length.length_result source · line 146 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+xs:List<&2, A> -> Type

Length (ordered_sets 112)

template Length.length_frame source · line 150 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+xs:List<&2, A> -> Type

Length (ordered_sets 112)

template Insert.push_length source · line 154 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+xs:List<&2, A> -> @+x:A -> Type

Insert, with multiplicity (777)

template Insert.push_bag source · line 158 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @-o:0x5c489f5d9646d7cc9aa3dd8137e9dc07/spec/lib/order.Order(A, cmp) -> @+xs:List<&2, A> -> @+x:A -> Type

Insert, with multiplicity (777)

template Insert.push_sorted source · line 162 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @-o:0x5c489f5d9646d7cc9aa3dd8137e9dc07/spec/lib/order.Order(A, cmp) -> @+xs:List<&2, A> -> @+x:A -> @+hs:{sorted(A, cmp, xs) == True{} : Bool} -> Type

Insert, with multiplicity (777)

template First_Element.peek_min source · line 166 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+h:A -> @+t:List<&2, A> -> @+hs:{sorted(A, cmp, h <> t) == True{} : Bool} -> Type

First_Element: the minimum (1534)

template First_Element.peek_frame source · line 170 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+xs:List<&2, A> -> Type

First_Element: the minimum (1534)

template First_Element.peek_empty source · line 174 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> Type

First_Element: the minimum (1534)

template Delete_First.pop_length source · line 178 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+h:A -> @+t:List<&2, A> -> Type

Delete_First (1105)

template Delete_First.pop_result source · line 182 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+h:A -> @+t:List<&2, A> -> Type

Delete_First (1105)

template Delete_First.pop_min source · line 186 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+h:A -> @+t:List<&2, A> -> @+hs:{sorted(A, cmp, h <> t) == True{} : Bool} -> Type

Delete_First (1105)

template Delete_First.pop_bag source · line 190 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @-o:0x5c489f5d9646d7cc9aa3dd8137e9dc07/spec/lib/order.Order(A, cmp) -> @+h:A -> @+t:List<&2, A> -> @+hs:{sorted(A, cmp, h <> t) == True{} : Bool} -> Type

Delete_First (1105)

template Delete_First.pop_empty source · line 194 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> Type

Delete_First (1105)

template To_Set.from_list_model source · line 198 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+xs:List<&2, A> -> @+ys:List<&2, A> -> Type

To_Set (559)

template To_Set.from_list_length source · line 202 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+xs:List<&2, A> -> @+ys:List<&2, A> -> Type

To_Set (559)

template To_Set.from_list_sorted source · line 206 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @-o:0x5c489f5d9646d7cc9aa3dd8137e9dc07/spec/lib/order.Order(A, cmp) -> @+xs:List<&2, A> -> @+ys:List<&2, A> -> Type

To_Set (559)

template Elements.to_sorted_result source · line 210 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+xs:List<&2, A> -> Type

Elements / iteration (ordered)

template Elements.to_sorted_frame source · line 214 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @+xs:List<&2, A> -> Type

Elements / iteration (ordered)