Dictionary(S)

aggcat.spad line 457 [edit on github]

• S : Type

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 BasicType and % has finiteAggregate or S has SetCategory

from BasicType

any? : (Mapping(Boolean, S), %) -> 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, %) -> NonNegativeInteger if S has BasicType and % has finiteAggregate

from HomogeneousAggregate(S)

count : (Mapping(Boolean, S), %) -> NonNegativeInteger if % 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 : (%, S, S) -> % if S has Evalable(S) and S has SetCategory

from InnerEvalable(S, S)

eval : (%, 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 : (%, List(Equation(S))) -> % if S has Evalable(S) and S has SetCategory

from Evalable(S)

every? : (Mapping(Boolean, S), %) -> Boolean if % has finiteAggregate

from HomogeneousAggregate(S)

extract! : % -> S

from BagAggregate(S)

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

from Collection(S)

insert! : (S, %) -> %

from BagAggregate(S)

inspect : % -> S

from BagAggregate(S)

latex : % -> String if S has SetCategory

from SetCategory

less? : (%, NonNegativeInteger) -> Boolean

from Aggregate

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

from HomogeneousAggregate(S)

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

from HomogeneousAggregate(S)

max : % -> S if S has OrderedSet and % has finiteAggregate

from HomogeneousAggregate(S)

max : (Mapping(Boolean, S, S), %) -> S if % has finiteAggregate

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)

min : % -> S if S has OrderedSet and % has finiteAggregate

from HomogeneousAggregate(S)

more? : (%, NonNegativeInteger) -> Boolean

from Aggregate

parts : % -> List(S) if % has finiteAggregate

from HomogeneousAggregate(S)

reduce : (Mapping(S, S, S), %) -> S if % has finiteAggregate

from Collection(S)

reduce : (Mapping(S, S, S), %, S) -> S if % has finiteAggregate

from Collection(S)

reduce : (Mapping(S, S, S), %, S, S) -> S if S has BasicType and % has finiteAggregate

from Collection(S)

remove : (S, %) -> % if S has BasicType and % has finiteAggregate

from Collection(S)

remove : (Mapping(Boolean, S), %) -> % if % has finiteAggregate

from Collection(S)

remove! : (S, %) -> % if S has BasicType and % has finiteAggregate

from DictionaryOperations(S)

remove! : (Mapping(Boolean, S), %) -> % if % has finiteAggregate

from DictionaryOperations(S)

removeDuplicates : % -> % if S has BasicType and % has finiteAggregate

from Collection(S)

sample : () -> %

from Aggregate

select : (Mapping(Boolean, S), %) -> % if % has finiteAggregate

from Collection(S)

select! : (Mapping(Boolean, S), %) -> % if % has finiteAggregate

from DictionaryOperations(S)

size? : (%, NonNegativeInteger) -> Boolean

from Aggregate

~= : (%, %) -> Boolean if S has BasicType and % has finiteAggregate or S has SetCategory

from BasicType

BagAggregate(S)

BasicType

shallowlyMutable

DictionaryOperations(S)

Collection(S)

SetCategory

HomogeneousAggregate(S)

Evalable(S)

CoercibleTo(OutputForm)

Aggregate

ConvertibleTo(InputForm)

InnerEvalable(S, S)