Dictionary SΒΆ

aggcat.spad line 433

A dictionary is an aggregate in which entries can be inserted, searched for and removed. Duplicates are thrown away on insertion. This category models the usual notion of dictionary which involves large amounts of data where copying is impractical. Principal operations are thus destructive (non-copying) ones.

#: % -> NonNegativeInteger if % has finiteAggregate
from Aggregate
=: (%, %) -> Boolean if S has SetCategory or S has BasicType and % has finiteAggregate
from BasicType
~=: (%, %) -> Boolean if S has SetCategory or S has BasicType and % has finiteAggregate
from BasicType
any?: (S -> Boolean, %) -> Boolean if % has finiteAggregate
from HomogeneousAggregate S
coerce: % -> OutputForm if S has CoercibleTo 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 if % has finiteAggregate
from HomogeneousAggregate S
count: (S, %) -> NonNegativeInteger if S has BasicType and % has finiteAggregate
from HomogeneousAggregate S
dictionary: () -> %
from DictionaryOperations S
dictionary: List S -> %
from DictionaryOperations S
empty: () -> %
from Aggregate
empty?: % -> Boolean
from Aggregate
eq?: (%, %) -> Boolean
from Aggregate
eval: (%, Equation S) -> % if S has Evalable S and S has SetCategory
from Evalable S
eval: (%, List Equation S) -> % if S has Evalable S and S has SetCategory
from Evalable S
eval: (%, List S, List S) -> % if S has Evalable S and S has SetCategory
from InnerEvalable(S, S)
eval: (%, S, S) -> % if S has Evalable S and S has SetCategory
from InnerEvalable(S, S)
every?: (S -> Boolean, %) -> Boolean if % has finiteAggregate
from HomogeneousAggregate S
extract!: % -> S
from BagAggregate S
find: (S -> Boolean, %) -> Union(S, failed)
from Collection S
hash: % -> SingleInteger if S has SetCategory
from SetCategory
hashUpdate!: (HashState, %) -> HashState if S has SetCategory
from SetCategory
insert!: (S, %) -> %
from BagAggregate S
inspect: % -> S
from BagAggregate S
latex: % -> String if S has SetCategory
from SetCategory
less?: (%, NonNegativeInteger) -> Boolean
from Aggregate
map!: (S -> S, %) -> %
from HomogeneousAggregate S
map: (S -> S, %) -> %
from HomogeneousAggregate S
member?: (S, %) -> Boolean if S has BasicType and % has finiteAggregate
from HomogeneousAggregate S
members: % -> List S if % has finiteAggregate
from HomogeneousAggregate S
more?: (%, NonNegativeInteger) -> Boolean
from Aggregate
parts: % -> List S if % has finiteAggregate
from HomogeneousAggregate S
reduce: ((S, S) -> S, %) -> S if % has finiteAggregate
from Collection S
reduce: ((S, S) -> S, %, S) -> S if % has finiteAggregate
from Collection S
reduce: ((S, S) -> S, %, S, S) -> S if S has BasicType and % has finiteAggregate
from Collection S
remove!: (S -> Boolean, %) -> % if % has finiteAggregate
from DictionaryOperations S
remove!: (S, %) -> % if S has BasicType and % has finiteAggregate
from DictionaryOperations S
remove: (S -> Boolean, %) -> % if % has finiteAggregate
from Collection S
remove: (S, %) -> % if S has BasicType and % has finiteAggregate
from Collection S
removeDuplicates: % -> % if S has BasicType and % has finiteAggregate
from Collection S
sample: %
from Aggregate
select!: (S -> Boolean, %) -> % if % has finiteAggregate
from DictionaryOperations S
select: (S -> Boolean, %) -> % if % has finiteAggregate
from Collection S
size?: (%, NonNegativeInteger) -> Boolean
from Aggregate

Aggregate

BagAggregate S

BasicType if S has SetCategory or S has BasicType and % has finiteAggregate

CoercibleTo OutputForm if S has CoercibleTo OutputForm

Collection S

ConvertibleTo InputForm if S has ConvertibleTo InputForm

DictionaryOperations S

Evalable S if S has Evalable S and S has SetCategory

HomogeneousAggregate S

InnerEvalable(S, S) if S has Evalable S and S has SetCategory

SetCategory if S has SetCategory

shallowlyMutable