Dequeue SΒΆ

bags.spad line 140

Linked list implementation of a Dequeue

#: % -> NonNegativeInteger
from Aggregate
=: (%, %) -> Boolean
from BasicType
~=: (%, %) -> Boolean
from BasicType
any?: (S -> Boolean, %) -> Boolean
from HomogeneousAggregate S
back: % -> S
from QueueAggregate S
bottom: % -> S
from DequeueAggregate 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
dequeue!: % -> S
from QueueAggregate S
dequeue: List S -> %
dequeue([x, y, ..., z]) creates a dequeue with first (top or front) element x, second element y, ..., and last (bottom or back) element z.
empty: () -> %
from Aggregate
empty?: % -> Boolean
from Aggregate
enqueue!: (S, %) -> S
from QueueAggregate S
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
extractBottom!: % -> S
from DequeueAggregate S
extractTop!: % -> S
from DequeueAggregate S
find: (S -> Boolean, %) -> Union(S, failed)
from Collection S
front: % -> S
from QueueAggregate S
hash: % -> SingleInteger
from SetCategory
hashUpdate!: (HashState, %) -> HashState
from SetCategory
insert!: (S, %) -> %
from BagAggregate S
insertBottom!: (S, %) -> S
from DequeueAggregate S
insertTop!: (S, %) -> S
from DequeueAggregate 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
member?: (S, %) -> Boolean
from HomogeneousAggregate S
members: % -> List S
from HomogeneousAggregate S
more?: (%, NonNegativeInteger) -> Boolean
from Aggregate
parts: % -> List S
from HomogeneousAggregate S
pop!: % -> S
from StackAggregate S
push!: (S, %) -> S
from StackAggregate 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
reverse!: % -> %
from DequeueAggregate S
rotate!: % -> %
from QueueAggregate S
sample: %
from Aggregate
select: (S -> Boolean, %) -> %
from Collection S
size?: (%, NonNegativeInteger) -> Boolean
from Aggregate
top: % -> S
from StackAggregate S

Aggregate

BagAggregate S

BasicType

CoercibleTo OutputForm

Collection S

ConvertibleTo InputForm if S has ConvertibleTo InputForm

DequeueAggregate S

Evalable S if S has Evalable S

finiteAggregate

HomogeneousAggregate S

InnerEvalable(S, S) if S has Evalable S

QueueAggregate S

SetCategory

shallowlyMutable

StackAggregate S