FreeMagma VarSetΒΆ
xlpoly.spad line 1 [edit on github]
VarSet: OrderedSet
This type is the basic representation of parenthesized words (binary trees over arbitrary symbols) useful in LiePolynomial.
- *: (%, %) -> %
x*yreturns the tree[x, y].
- <=: (%, %) -> Boolean
from PartialOrder
- <: (%, %) -> Boolean
from PartialOrder
- >=: (%, %) -> Boolean
from PartialOrder
- >: (%, %) -> Boolean
from PartialOrder
- coerce: % -> FreeMonoid VarSet
coerce(x)returns the element of FreeMonoid(VarSet) corresponding toxby removing parentheses.- coerce: % -> OutputForm
from CoercibleTo OutputForm
- coerce: VarSet -> %
from CoercibleFrom VarSet
- first: % -> VarSet
first(x)returns the first entry of the treex.
- latex: % -> String
from SetCategory
- left: % -> %
left(x)returns left subtree ofxor error if retractable?(x) istrue.
- length: % -> PositiveInteger
length(x)returns the number of entries inx.
- lexico: (%, %) -> Boolean
lexico(x, y)returnstrueiffxis smaller thanywith respect to the lexicographical ordering induced byVarSet.N.B. This operation does not take into account the tree structure of its arguments. Thus this is not a total ordering.
- max: (%, %) -> %
from OrderedSet
- min: (%, %) -> %
from OrderedSet
- mirror: % -> %
mirror(x)returns the reversed word ofx. That isxitself if retractable?(x) istrueandmirror(z) * mirror(y)ifxisy*z.
- rest: % -> %
rest(x)returnxwithout the first entry or error if retractable?(x) istrue.
- retract: % -> VarSet
from RetractableTo VarSet
- retractable?: % -> Boolean
retractable?(x)tests ifxis a tree with only one entry.
- retractIfCan: % -> Union(VarSet, failed)
from RetractableTo VarSet
- right: % -> %
right(x)returns right subtree ofxor error if retractable?(x) istrue.
- smaller?: (%, %) -> Boolean
from Comparable
- varList: % -> List VarSet
varList(x)returns the list of distinct entries ofx.
CoercibleFrom VarSet
RetractableTo VarSet