# SortedExponentVectorΒΆ

Domain for storing information about structure of polynomials as vectors of exponents

#: % -> NonNegativeInteger

from Aggregate

<=: (%, %) -> Boolean

from PartialOrder

<: (%, %) -> Boolean

from PartialOrder

=: (%, %) -> Boolean

from BasicType

>=: (%, %) -> Boolean

from PartialOrder

>: (%, %) -> Boolean

from PartialOrder

~=: (%, %) -> Boolean

from BasicType

any?: (Integer -> Boolean, %) -> Boolean
coerce: % -> OutputForm
concat: (%, %) -> %
concat: (%, Integer) -> %
concat: (Integer, %) -> %
concat: List % -> %
construct: List Integer -> %
convert: % -> InputForm
copy: % -> %

from Aggregate

copyInto!: (%, %, Integer) -> %
count: (Integer -> Boolean, %) -> NonNegativeInteger
count: (Integer, %) -> NonNegativeInteger
delete: (%, Integer) -> %
delete: (%, UniversalSegment Integer) -> %
elt: (%, Integer) -> Integer

from Eltable(Integer, Integer)

elt: (%, Integer, Integer) -> Integer
elt: (%, UniversalSegment Integer) -> %

from Eltable(UniversalSegment Integer, %)

empty?: % -> Boolean

from Aggregate

empty: () -> %

from Aggregate

entries: % -> List Integer
entry?: (Integer, %) -> Boolean
eq?: (%, %) -> Boolean

from Aggregate

eval: (%, Equation Integer) -> % if Integer has Evalable Integer

from Evalable Integer

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

from InnerEvalable(Integer, Integer)

eval: (%, List Equation Integer) -> % if Integer has Evalable Integer

from Evalable Integer

eval: (%, List Integer, List Integer) -> % if Integer has Evalable Integer

from InnerEvalable(Integer, Integer)

every?: (Integer -> Boolean, %) -> Boolean
fill!: (%, Integer) -> %
find: (Integer -> Boolean, %) -> Union(Integer, failed)
first: % -> Integer
first: (%, NonNegativeInteger) -> %
hash: % -> SingleInteger

from Hashable

hashUpdate!: (HashState, %) -> HashState

from Hashable

index?: (Integer, %) -> Boolean
indices: % -> List Integer
insert: (%, %, Integer) -> %
insert: (Integer, %, Integer) -> %
latex: % -> String

from SetCategory

leftTrim: (%, Integer) -> %
less?: (%, NonNegativeInteger) -> Boolean

from Aggregate

map!: (Integer -> Integer, %) -> %
map: ((Integer, Integer) -> Integer, %, %) -> %
map: (Integer -> Integer, %) -> %
max: % -> Integer
max: (%, %) -> %

from OrderedSet

max: ((Integer, Integer) -> Boolean, %) -> Integer
maxIndex: % -> Integer
member?: (Integer, %) -> Boolean
members: % -> List Integer
merge: (%, %) -> %
merge: ((Integer, Integer) -> Boolean, %, %) -> %
min: % -> Integer
min: (%, %) -> %

from OrderedSet

minIndex: % -> Integer
more?: (%, NonNegativeInteger) -> Boolean

from Aggregate

new: (NonNegativeInteger, Integer) -> %
parts: % -> List Integer
position: (Integer -> Boolean, %) -> Integer
position: (Integer, %) -> Integer
position: (Integer, %, Integer) -> Integer
qelt: (%, Integer) -> Integer
qsetelt!: (%, Integer, Integer) -> Integer
reduce: ((Integer, Integer) -> Integer, %) -> Integer
reduce: ((Integer, Integer) -> Integer, %, Integer) -> Integer
reduce: ((Integer, Integer) -> Integer, %, Integer, Integer) -> Integer
remove: (Integer -> Boolean, %) -> %
remove: (Integer, %) -> %
removeDuplicates: % -> %
reverse!: % -> %
reverse: % -> %
rightTrim: (%, Integer) -> %
sample: %

from Aggregate

select: (Integer -> Boolean, %) -> %
setelt!: (%, Integer, Integer) -> Integer
setelt!: (%, UniversalSegment Integer, Integer) -> Integer
size?: (%, NonNegativeInteger) -> Boolean

from Aggregate

smaller?: (%, %) -> Boolean

from Comparable

sort!: % -> %
sort!: ((Integer, Integer) -> Boolean, %) -> %
sort: % -> %
sort: ((Integer, Integer) -> Boolean, %) -> %
sorted?: % -> Boolean
sorted?: ((Integer, Integer) -> Boolean, %) -> Boolean
swap!: (%, Integer, Integer) -> Void
trim: (%, Integer) -> %

Aggregate

BasicType

Comparable

finiteAggregate

Hashable

OrderedSet

PartialOrder

SetCategory

shallowlyMutable