~/bend-docscommunity

spec/containers/priority_queue.bend checks

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

3 imports
import Base
import ../lib/order.bend as SO
import ./binary_heap.bend as HS

Templates

template Length.length_result source · line 30 · raw

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

template Length.length_frame source · line 33 · raw

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

template Insert.push_length source · line 36 · raw

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

template Insert.push_bag source · line 39 · raw

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

template Insert.push_sorted source · line 42 · raw

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

template First_Element.peek_min source · line 45 · raw

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

template First_Element.peek_frame source · line 48 · raw

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

template First_Element.peek_empty source · line 51 · raw

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

template Delete_First.pop_length source · line 54 · raw

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

template Delete_First.pop_result source · line 57 · raw

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

template Delete_First.pop_min source · line 60 · raw

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

template Delete_First.pop_bag source · line 63 · raw

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

template Delete_First.pop_empty source · line 66 · raw

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

template To_Set.from_list_model source · line 69 · raw

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

template To_Set.from_list_length source · line 72 · raw

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

template To_Set.from_list_sorted source · line 75 · raw

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

template Elements.to_sorted_result source · line 78 · raw

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

template Elements.to_sorted_frame source · line 81 · raw

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