MultiDictionary SΒΆ

aggcat.spad line 503 [edit on github]

A multi-dictionary is a dictionary which may contain duplicates. As for any dictionary, its size is assumed large so that copying (non-destructive) operations are generally to be avoided.

#: % -> NonNegativeInteger if % has finiteAggregate

from Aggregate

=: (%, %) -> Boolean

from BasicType

~=: (%, %) -> Boolean

from BasicType

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

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 if % has finiteAggregate

from HomogeneousAggregate S

count: (S, %) -> NonNegativeInteger if % has finiteAggregate

from HomogeneousAggregate S

dictionary: () -> %

from DictionaryOperations S

dictionary: List S -> %

from DictionaryOperations S

duplicates: % -> List Record(entry: S, count: NonNegativeInteger)

duplicates(d) returns a list of values which have duplicates in d

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 if % has finiteAggregate

from HomogeneousAggregate S

extract!: % -> S

from BagAggregate S

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

from Collection S

insert!: (S, %) -> %

from BagAggregate S

insert!: (S, %, NonNegativeInteger) -> %

insert!(x, d, n) destructively inserts n copies of x into dictionary d.

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 if S has OrderedSet and % has finiteAggregate

from HomogeneousAggregate S

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

from HomogeneousAggregate S

member?: (S, %) -> Boolean if % 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: ((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 % has finiteAggregate

from Collection S

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

from DictionaryOperations S

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

from DictionaryOperations S

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

from Collection S

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

from Collection S

removeDuplicates!: % -> %

removeDuplicates!(d) destructively removes any duplicate values in dictionary d.

removeDuplicates: % -> % if % 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

CoercibleTo OutputForm

Collection S

ConvertibleTo InputForm if S has ConvertibleTo InputForm

DictionaryOperations S

Evalable S if S has Evalable S

HomogeneousAggregate S

InnerEvalable(S, S) if S has Evalable S

SetCategory

shallowlyMutable