aboutsummaryrefslogtreecommitdiff
path: root/src/algebra/tree.spad.pamphlet
diff options
context:
space:
mode:
authordos-reis <gdr@axiomatics.org>2008-11-21 04:54:55 +0000
committerdos-reis <gdr@axiomatics.org>2008-11-21 04:54:55 +0000
commit49727ef97a25730307fdb9622be726e92a41a875 (patch)
tree5c6fbb86ff4e49c7ed0d510e76f42d7352005c88 /src/algebra/tree.spad.pamphlet
parent0b97ae7365e5ba3d3e078147124e096f7cccde4b (diff)
downloadopen-axiom-49727ef97a25730307fdb9622be726e92a41a875.tar.gz
* algebra/alql.spad.pamphlet (Database): Now CoercibleFrom List S.
* algebra/asp.spad.pamphlet (Asp20): Now CoercibleFrom MAT FEXPR. (Asp6): Now CoercibleFrom Vector FEXPR. * algebra/catdef.spad.pamphlet (Algebra): Extend CoercibleFrom R. (Ring): Extend CoercibleFrom Integer. * algebra/formula.spad.pamphlet (ScriptFormulaFormat): Now CoercibleFrom E. * algebra/fortran.spad.pamphlet (FortranCode): Remove redundant signature. * algebra/fs2ups.spad.pamphlet (FunctionSpaceToUnivariatePowerSeries): Tidy parameter. * algebra/laurent.spad.pamphlet (UnivariateLaurentSeriesConstructorCategory): Extend CoercibleFrom UTS. * algebra/manip.spad.pamphlet (PolynomialRoots): Tidy parameter. * algebra/modmon.spad.pamphlet (ModMonic): Now CoercibleFrom Rep. * algebra/ore.spad.pamphlet (UnivariateSkewPolynomial): Now CoercibleFrom Variable x.
Diffstat (limited to 'src/algebra/tree.spad.pamphlet')
-rw-r--r--src/algebra/tree.spad.pamphlet5
1 files changed, 1 insertions, 4 deletions
diff --git a/src/algebra/tree.spad.pamphlet b/src/algebra/tree.spad.pamphlet
index c574d9a4..5b573f8f 100644
--- a/src/algebra/tree.spad.pamphlet
+++ b/src/algebra/tree.spad.pamphlet
@@ -615,14 +615,11 @@ BalancedBinaryTree(S: SetCategory): Exports == Implementation where
++ A PendantTree(S)is either a leaf? and is an S or has
++ a left and a right both PendantTree(S)'s
PendantTree(S: SetCategory): T == C where
- T == BinaryRecursiveAggregate(S) with
+ T == Join(BinaryRecursiveAggregate(S),CoercibleTo Tree S) with
ptree : S->%
++ ptree(s) is a leaf? pendant tree
ptree:(%, %)->%
++ ptree(x,y) \undocumented
- coerce:%->Tree S
- ++ coerce(x) \undocumented
-
C == add
Rep := Tree S