MultisetAggregate SΒΆ
aggcat.spad line 693 [edit on github]
S: SetCategory
A multi-set aggregate is a set which keeps track of the multiplicity of its elements.
- #: % -> NonNegativeInteger if % has finiteAggregate
from Aggregate
- <=: (%, %) -> Boolean
from PartialOrder
- <: (%, %) -> Boolean
from PartialOrder
- >=: (%, %) -> Boolean
from PartialOrder
- >: (%, %) -> Boolean
from PartialOrder
- 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
- 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
- difference: (%, %) -> %
from SetAggregate S
- difference: (%, S) -> %
from SetAggregate S
- duplicates: % -> List Record(entry: S, count: NonNegativeInteger)
from MultiDictionary S
- 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) -> %
from MultiDictionary S
- inspect: % -> S
from BagAggregate S
- intersect: (%, %) -> %
from SetAggregate 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!: % -> %
from MultiDictionary S
- removeDuplicates: % -> % if % has finiteAggregate
from Collection S
- select!: (S -> Boolean, %) -> % if % has finiteAggregate
from DictionaryOperations S
- select: (S -> Boolean, %) -> % if % has finiteAggregate
from Collection S
- set: () -> %
from SetAggregate S
- set: List S -> %
from SetAggregate S
- size?: (%, NonNegativeInteger) -> Boolean
from Aggregate
- subset?: (%, %) -> Boolean
from SetAggregate S
- symmetricDifference: (%, %) -> %
from SetAggregate S
- union: (%, %) -> %
from SetAggregate S
- union: (%, S) -> %
from SetAggregate S
- union: (S, %) -> %
from SetAggregate S
ConvertibleTo InputForm if S has ConvertibleTo InputForm
Evalable S if S has Evalable S
InnerEvalable(S, S) if S has Evalable S