src/containers/priority_queue.bend checks

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

3 imports

import Base
import ./binary_heap.bend as K
import ./types/binary_heap.bend as E

Templates

template new source · line 6 · raw

@-A:Data -> 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/binary_heap.Heap<A>

Single-threaded queue API; storage and algorithms are shared with binary_heap.

template qsize source · line 9 · raw

@-A:Data -> @h:0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/binary_heap.Heap<A> -> Pair(0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/binary_heap.Heap<A>, Nat)

template put source · line 12 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @h:0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/binary_heap.Heap<A> -> @x:A -> 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/binary_heap.Heap<A>

template peek source · line 15 · raw

@-A:Data -> @h:0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/binary_heap.Heap<A> -> Pair(0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/binary_heap.Heap<A>, Result<&2, &2, 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Error, A>)

template get source · line 18 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @h:0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/binary_heap.Heap<A> -> Pair(0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/binary_heap.Heap<A>, Result<&2, &2, 0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/types/binary_heap.Error, A>)

template from_list source · line 21 · raw

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

template to_sorted_list source · line 24 · raw

@-A:Data -> @-cmp:(@_:A -> @_:A -> Cmp) -> @h:0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/binary_heap.Heap<A> -> Pair(0x5c489f5d9646d7cc9aa3dd8137e9dc07/src/containers/binary_heap.Heap<A>, List<&2, A>)