Heap S

bags.spad line 193 [edit on github]

• S: OrderedSet

Heap implemented in a flexible array to allow for insertions

#: % -> NonNegativeInteger

from Aggregate

=: (%, %) -> Boolean

from BasicType

~=: (%, %) -> Boolean

from BasicType

any?: (S -> Boolean, %) -> Boolean

from HomogeneousAggregate S

coerce: % -> OutputForm

from CoercibleTo OutputForm

construct: List S -> %

from Collection S

convert: % -> InputForm if S has ConvertibleTo InputForm

from ConvertibleTo InputForm

copy: % -> %

from Aggregate

count: (S -> Boolean, %) -> NonNegativeInteger

from HomogeneousAggregate S

count: (S, %) -> NonNegativeInteger

from HomogeneousAggregate S

empty?: % -> Boolean

from Aggregate

empty: () -> %

from Aggregate

eq?: (%, %) -> Boolean

from Aggregate

eval: (%, Equation S) -> % if S has Evalable S

from Evalable S

eval: (%, List Equation S) -> % if S has Evalable S

from Evalable S

eval: (%, List S, List S) -> % if S has Evalable S

from InnerEvalable(S, S)

eval: (%, S, S) -> % if S has Evalable S

from InnerEvalable(S, S)

every?: (S -> Boolean, %) -> Boolean

from HomogeneousAggregate S

extract!: % -> S

from BagAggregate S

find: (S -> Boolean, %) -> Union(S, failed)

from Collection S

hash: % -> SingleInteger if S has Hashable

from Hashable

hashUpdate!: (HashState, %) -> HashState if S has Hashable

from Hashable

heap: List S -> %

heap(ls) creates a heap of elements consisting of the elements of ls.

insert!: (S, %) -> %

from BagAggregate S

inspect: % -> S

from BagAggregate S

latex: % -> String

from SetCategory

less?: (%, NonNegativeInteger) -> Boolean

from Aggregate

map!: (S -> S, %) -> %

from HomogeneousAggregate S

map: (S -> S, %) -> %

from HomogeneousAggregate S

max: % -> S

from PriorityQueueAggregate S

max: ((S, S) -> Boolean, %) -> S

from HomogeneousAggregate S

member?: (S, %) -> Boolean

from HomogeneousAggregate S

members: % -> List S

from HomogeneousAggregate S

merge!: (%, %) -> %

from PriorityQueueAggregate S

merge: (%, %) -> %

from PriorityQueueAggregate S

min: % -> S

from HomogeneousAggregate S

more?: (%, NonNegativeInteger) -> Boolean

from Aggregate

parts: % -> List S

from HomogeneousAggregate S

reduce: ((S, S) -> S, %) -> S

from Collection S

reduce: ((S, S) -> S, %, S) -> S

from Collection S

reduce: ((S, S) -> S, %, S, S) -> S

from Collection S

remove: (S -> Boolean, %) -> %

from Collection S

remove: (S, %) -> %

from Collection S

removeDuplicates: % -> %

from Collection S

sample: %

from Aggregate

select: (S -> Boolean, %) -> %

from Collection S

size?: (%, NonNegativeInteger) -> Boolean

from Aggregate

Aggregate

BagAggregate S

BasicType

CoercibleTo OutputForm

Collection S

ConvertibleTo InputForm if S has ConvertibleTo InputForm

Evalable S if S has Evalable S

finiteAggregate

Hashable if S has Hashable

HomogeneousAggregate S

InnerEvalable(S, S) if S has Evalable S

PriorityQueueAggregate S

SetCategory

shallowlyMutable