Index - All Packages - All Categories - All Classes
Class BertCrum
This implementation tracks the endorsement information with
a strictly binary tree. The tree gets heuristically balanced
upon insertion of new elements in such a way that the ocrums
pointing at a particular canopyCrum need not be updated.
Therefore we should not bother storing backpointers. I'm
doing so currently in case we change algorithms.
Deletion may require backpointers to eliminate joins
with the deleted crums.
Package: Udanax-Gold
All Superclasses: Object Heaper Abraham CanopyCrum
Protocols: Object
Categories: Xanadu-Be-Canopy