diff options
| author | dos-reis <gdr@axiomatics.org> | 2013-05-16 20:17:37 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2013-05-16 20:17:37 +0000 |
| commit | 1b0bb495c53cbd98069caeb30089c5ff778aceb3 (patch) | |
| tree | c855466ba24bdcc1dde24db340c0407d963bce73 /src/algebra/newdata.spad.pamphlet | |
| parent | 0520bd59f6b9d9294a73cc88a1fa34a32678d7e5 (diff) | |
| download | open-axiom-1b0bb495c53cbd98069caeb30089c5ff778aceb3.tar.gz | |
* algebra/aggcat.spad.pamphlet (FiniteAggregate): Temporarily
include attribute finiteAggregate.
(StackAggregate): Extend category FiniteAggregate instead of
attribute finiteAggregate.
(QueueAggregate): Likewise.
(PriorityQueueAggregate): Likewise.
(FiniteSetAggregate): Likewise.
* algebra/lmdict.spad.pamphlet (ListMultiDictionary): Likewise.
* algebra/matcat.spad.pamphlet (MatrixCategory): Likewise.
* algebra/mset.spad.pamphlet (Multiset): Likewise.
* algebra/newdata.spad.pamphlet (SplittingTree): Likewise.
* algebra/polset.spad.pamphlet (PolynomialSetCategory): Likewise.
* algebra/tree.spad.pamphlet (Tree): Likewise.
(BinaryTreeCategory): Likewise.
* algebra/triset.spad.pamphlet (TriangularSetCategory): Likewise.
* algebra/vector.spad.pamphlet (DirectProductCategory): Likewise.
Diffstat (limited to 'src/algebra/newdata.spad.pamphlet')
| -rw-r--r-- | src/algebra/newdata.spad.pamphlet | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/src/algebra/newdata.spad.pamphlet b/src/algebra/newdata.spad.pamphlet index 071fc497..d53ed96b 100644 --- a/src/algebra/newdata.spad.pamphlet +++ b/src/algebra/newdata.spad.pamphlet @@ -316,7 +316,7 @@ SplittingNode(V,C) : Exports == Implementation where )abbrev domain SPLTREE SplittingTree ++ Author: Marc Moereno Maza ++ Date Created: 07/05/1996 -++ Date Last Updated: 07/19/1996 +++ Date Last Updated: May 16, 2013 ++ Basic Functions: ++ Related Constructors: ++ Also See: @@ -361,9 +361,8 @@ SplittingTree(V,C) : Exports == Implementation where S ==> SplittingNode(V,C) A ==> Record(root:S,subTrees:List(%)) - Exports == RecursiveAggregate(S) with + Exports == Join(RecursiveAggregate S,FiniteAggregate S) with shallowlyMutable - finiteAggregate extractSplittingLeaf : % -> Union(%,"failed") ++ \axiom{extractSplittingLeaf(a)} returns the left ++ most leaf (as a tree) whose status is false |