PendantTree SΒΆ
tree.spad line 411 [edit on github]
S: SetCategory
A PendantTree(S) is either a leaf? and is an S or has a left and a right are both PendantTree(S).
- child?: (%, %) -> Boolean
from RecursiveAggregate S
- children: % -> List %
from RecursiveAggregate S
- coerce: % -> OutputForm
from CoercibleTo OutputForm
- coerce: % -> Tree S
coerce(x)undocumented
- cyclic?: % -> Boolean
from RecursiveAggregate S
- distance: (%, %) -> Integer
from RecursiveAggregate S
- elt: (%, left) -> %
from BinaryRecursiveAggregate S
- elt: (%, right) -> %
from BinaryRecursiveAggregate S
- elt: (%, value) -> S
from RecursiveAggregate 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)
- latex: % -> String
from SetCategory
- leaf?: % -> Boolean
from RecursiveAggregate S
- leaves: % -> List S
from RecursiveAggregate S
- left: % -> %
from BinaryRecursiveAggregate S
- less?: (%, NonNegativeInteger) -> Boolean
from Aggregate
- map: (S -> S, %) -> %
from HomogeneousAggregate S
- max: % -> S if S has OrderedSet and % has finiteAggregate
from HomogeneousAggregate S
- min: % -> S if S has OrderedSet and % has finiteAggregate
from HomogeneousAggregate S
- more?: (%, NonNegativeInteger) -> Boolean
from Aggregate
- node?: (%, %) -> Boolean
from RecursiveAggregate S
- nodes: % -> List %
from RecursiveAggregate S
- ptree: (%, %) -> %
ptree(x, y)undocumented
- ptree: S -> %
ptree(s)is a leaf? pendant tree
- right: % -> %
from BinaryRecursiveAggregate S
- size?: (%, NonNegativeInteger) -> Boolean
from Aggregate
- value: % -> S
from RecursiveAggregate S
Evalable S if S has Evalable S
InnerEvalable(S, S) if S has Evalable S