Multiset(S)

mset.spad line 1 [edit on github]

• S : SetCategory

A multiset is a set with multiplicities.

# : % -> NonNegativeInteger

from Aggregate

< : (%, %) -> Boolean

from PartialOrder

<= : (%, %) -> Boolean

from PartialOrder

= : (%, %) -> Boolean

from BasicType

> : (%, %) -> Boolean

from PartialOrder

>= : (%, %) -> Boolean

from PartialOrder

any? : (Mapping(Boolean, S), %) -> Boolean

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, %) -> NonNegativeInteger

from HomogeneousAggregate(S)

count : (Mapping(Boolean, S), %) -> NonNegativeInteger

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)

empty : () -> %

from Aggregate

empty? : % -> Boolean

from Aggregate

eq? : (%, %) -> Boolean

from Aggregate

eval : (%, S, S) -> % if S has Evalable(S)

from InnerEvalable(S, S)

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

from Evalable(S)

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

from HomogeneousAggregate(S)

extract! : % -> S

from BagAggregate(S)

find : (Mapping(Boolean, S), %) -> 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 : (Mapping(S, S), %) -> %

from HomogeneousAggregate(S)

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

from HomogeneousAggregate(S)

max : % -> S if S has OrderedSet

from HomogeneousAggregate(S)

max : (Mapping(Boolean, S, S), %) -> S

from HomogeneousAggregate(S)

member? : (S, %) -> Boolean

from HomogeneousAggregate(S)

members : % -> List(S)

from HomogeneousAggregate(S)

min : % -> S if S has OrderedSet

from HomogeneousAggregate(S)

more? : (%, NonNegativeInteger) -> Boolean

from Aggregate

multiset : () -> %

multiset()$D creates an empty multiset of domain D.

multiset : S -> %

multiset(s) creates a multiset with singleton s.

multiset : List(S) -> %

multiset(ls) creates a multiset with elements from ls.

parts : % -> List(S)

from HomogeneousAggregate(S)

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

from Collection(S)

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

from Collection(S)

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

from Collection(S)

remove : (S, %) -> %

from Collection(S)

remove : (S, %, Integer) -> %

remove(x, ms, number) removes at most number copies of element x if number is positive, all of them if number equals zero, and all but at most -number if number is negative.

remove : (Mapping(Boolean, S), %) -> %

from Collection(S)

remove : (Mapping(Boolean, S), %, Integer) -> %

remove(p, ms, number) removes at most number copies of elements x such that p(x) is true if number is positive, all of them if number equals zero, and all but at most -number if number is negative.

remove! : (S, %) -> %

from DictionaryOperations(S)

remove! : (S, %, Integer) -> %

remove!(x, ms, number) removes destructively at most number copies of element x if number is positive, all of them if number equals zero, and all but at most -number if number is negative.

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

from DictionaryOperations(S)

remove! : (Mapping(Boolean, S), %, Integer) -> %

remove!(p, ms, number) removes destructively at most number copies of elements x such that p(x) is true if number is positive, all of them if number equals zero, and all but at most -number if number is negative.

removeDuplicates : % -> %

from Collection(S)

removeDuplicates! : % -> %

from MultiDictionary(S)

sample : () -> %

from Aggregate

select : (Mapping(Boolean, S), %) -> %

from Collection(S)

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

from DictionaryOperations(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)

~= : (%, %) -> Boolean

from BasicType

ConvertibleTo(InputForm)

InnerEvalable(S, S)

Aggregate

BasicType

DictionaryOperations(S)

PartialOrder

SetCategory

Evalable(S)

HomogeneousAggregate(S)

BagAggregate(S)

MultiDictionary(S)

Collection(S)

CoercibleTo(OutputForm)

SetAggregate(S)

finiteAggregate

shallowlyMutable

MultisetAggregate(S)