FiniteLinearAggregate(S)
aggcat.spad line 1890
[edit on github]
A finite linear aggregate is a linear aggregate of finite length.
- # : % -> NonNegativeInteger
- from Aggregate
- < : (%, %) -> Boolean if S has OrderedSet
- from PartialOrder
- <= : (%, %) -> Boolean if S has OrderedSet
- from PartialOrder
- = : (%, %) -> Boolean if S has BasicType
- from BasicType
- > : (%, %) -> Boolean if S has OrderedSet
- from PartialOrder
- >= : (%, %) -> Boolean if S has OrderedSet
- from PartialOrder
- any? : (Mapping(Boolean, S), %) -> Boolean
- from HomogeneousAggregate(S)
- coerce : % -> OutputForm if S has CoercibleTo(OutputForm)
- from CoercibleTo(OutputForm)
- concat : (%, %) -> %
- from LinearAggregate(S)
- concat : (%, S) -> %
- from LinearAggregate(S)
- concat : (S, %) -> %
- from LinearAggregate(S)
- concat : List(%) -> %
- from LinearAggregate(S)
- construct : List(S) -> %
- from Collection(S)
- convert : % -> InputForm if S has ConvertibleTo(InputForm)
- from ConvertibleTo(InputForm)
- copy : % -> %
- from Aggregate
- copyInto! : (%, %, Integer) -> % if % has shallowlyMutable
- from LinearAggregate(S)
- count : (S, %) -> NonNegativeInteger if S has BasicType
- from HomogeneousAggregate(S)
- count : (Mapping(Boolean, S), %) -> NonNegativeInteger
- from HomogeneousAggregate(S)
- delete : (%, Integer) -> %
- from LinearAggregate(S)
- delete : (%, UniversalSegment(Integer)) -> %
- from LinearAggregate(S)
- elt : (%, UniversalSegment(Integer)) -> %
- from Eltable(UniversalSegment(Integer), %)
- elt : (%, Integer) -> S
- from Eltable(Integer, S)
- elt : (%, Integer, S) -> S
- from EltableAggregate(Integer, S)
- empty : () -> %
- from Aggregate
- empty? : % -> Boolean
- from Aggregate
- entries : % -> List(S)
- from IndexedAggregate(Integer, S)
- entry? : (S, %) -> Boolean if S has BasicType
- from IndexedAggregate(Integer, S)
- 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
- from HomogeneousAggregate(S)
- fill! : (%, S) -> % if % has shallowlyMutable
- from IndexedAggregate(Integer, S)
- find : (Mapping(Boolean, S), %) -> Union(S, "failed")
- from Collection(S)
- first : (%, NonNegativeInteger) -> %
- from LinearAggregate(S)
- first : % -> S
- from IndexedAggregate(Integer, S)
- hash : % -> SingleInteger if S has Hashable
- from Hashable
- hashUpdate! : (HashState, %) -> HashState if S has Hashable
- from Hashable
- index? : (Integer, %) -> Boolean
- from IndexedAggregate(Integer, S)
- indices : % -> List(Integer)
- from IndexedAggregate(Integer, S)
- insert : (%, %, Integer) -> %
- from LinearAggregate(S)
- insert : (S, %, Integer) -> %
- from LinearAggregate(S)
- latex : % -> String if S has SetCategory
- from SetCategory
- leftTrim : (%, S) -> % if S has BasicType
- from LinearAggregate(S)
- less? : (%, NonNegativeInteger) -> Boolean
- from Aggregate
- map : (Mapping(S, S), %) -> %
- from HomogeneousAggregate(S)
- map : (Mapping(S, S, S), %, %) -> %
- from LinearAggregate(S)
- map! : (Mapping(S, S), %) -> % if % has shallowlyMutable
- from HomogeneousAggregate(S)
- max : (%, %) -> % if S has OrderedSet
- from OrderedSet
- max : % -> S if S has OrderedSet
- from HomogeneousAggregate(S)
- max : (Mapping(Boolean, S, S), %) -> S
- from HomogeneousAggregate(S)
- maxIndex : % -> Integer
- from IndexedAggregate(Integer, S)
- member? : (S, %) -> Boolean if S has BasicType
- from HomogeneousAggregate(S)
- members : % -> List(S)
- from HomogeneousAggregate(S)
- merge : (%, %) -> % if S has OrderedSet
- from LinearAggregate(S)
- merge : (Mapping(Boolean, S, S), %, %) -> %
- from LinearAggregate(S)
- min : (%, %) -> % if S has OrderedSet
- from OrderedSet
- min : % -> S if S has OrderedSet
- from HomogeneousAggregate(S)
- minIndex : % -> Integer
- from IndexedAggregate(Integer, S)
- more? : (%, NonNegativeInteger) -> Boolean
- from Aggregate
- new : (NonNegativeInteger, S) -> %
- from LinearAggregate(S)
- parts : % -> List(S)
- from HomogeneousAggregate(S)
- position : (S, %) -> Integer if S has BasicType
- from LinearAggregate(S)
- position : (S, %, Integer) -> Integer if S has BasicType
- from LinearAggregate(S)
- position : (Mapping(Boolean, S), %) -> Integer
- from LinearAggregate(S)
- qelt : (%, Integer) -> S
- from EltableAggregate(Integer, S)
- qsetelt! : (%, Integer, S) -> S if % has shallowlyMutable
- from EltableAggregate(Integer, 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 if S has BasicType
- from Collection(S)
- remove : (S, %) -> % if S has BasicType
- from Collection(S)
- remove : (Mapping(Boolean, S), %) -> %
- from Collection(S)
- removeDuplicates : % -> % if S has BasicType
- from Collection(S)
- reverse : % -> %
- from LinearAggregate(S)
- reverse! : % -> % if % has shallowlyMutable
- from LinearAggregate(S)
- rightTrim : (%, S) -> % if S has BasicType
- from LinearAggregate(S)
- sample : () -> %
- from Aggregate
- select : (Mapping(Boolean, S), %) -> %
- from Collection(S)
- setelt! : (%, Integer, S) -> S if % has shallowlyMutable
- from EltableAggregate(Integer, S)
- setelt! : (%, UniversalSegment(Integer), S) -> S if % has shallowlyMutable
- from LinearAggregate(S)
- size? : (%, NonNegativeInteger) -> Boolean
- from Aggregate
- smaller? : (%, %) -> Boolean if S has Comparable
- from Comparable
- sort : % -> % if S has OrderedSet
- from LinearAggregate(S)
- sort : (Mapping(Boolean, S, S), %) -> %
- from LinearAggregate(S)
- sort! : % -> % if S has OrderedSet and % has shallowlyMutable
- from LinearAggregate(S)
- sort! : (Mapping(Boolean, S, S), %) -> % if % has shallowlyMutable
- from LinearAggregate(S)
- sorted? : % -> Boolean if S has OrderedSet
- from LinearAggregate(S)
- sorted? : (Mapping(Boolean, S, S), %) -> Boolean
- from LinearAggregate(S)
- swap! : (%, Integer, Integer) -> Void if % has shallowlyMutable
- from IndexedAggregate(Integer, S)
- trim : (%, S) -> % if S has BasicType
- from LinearAggregate(S)
- ~= : (%, %) -> Boolean if S has BasicType
- from BasicType
Comparable
ConvertibleTo(InputForm)
InnerEvalable(S, S)
Aggregate
BasicType
LinearAggregate(S)
IndexedAggregate(Integer, S)
OrderedSet
SetCategory
HomogeneousAggregate(S)
Evalable(S)
PartialOrder
CoercibleTo(OutputForm)
Collection(S)
finiteAggregate
Eltable(UniversalSegment(Integer), %)
EltableAggregate(Integer, S)
Hashable
Eltable(Integer, S)