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

Class Methods

flagsFor: permissions with: endorsements with: isNotPartializable with: isSensorWaiting


isNotPartializableFlag

Flag bit for active Editions

isSensorWaitingFlag

Flag bit for active Editions

make


staticTimeNonInherited



Overrides: Abraham class

Instance Methods

another

BertCrum create verify2.

Overrides: CanopyCrum

canopyCache

should have one per Ent

Overrides: CanopyCrum

create

Make a canopyCrum for a root: it has no children.

Overrides: Abraham

create: first with: second

Create a new parent for two BertCrums.
My client must bring my properties up to date. This constructor just makes a new parent whose properties are empty

Overrides: Abraham

createRcvr: receiver



Overrides: CanopyCrum

fullChange



Overrides: CanopyCrum

inspectHCrums


inspectMenuArray


isNotPartializable


isSensorWaiting


makeNew



Overrides: CanopyCrum

makeNewParent: first with: second



Overrides: CanopyCrum

printOn: aStream



Overrides: Object

sendSelfTo: xmtr



Overrides: CanopyCrum

showOn: oo




Index - All Packages - All Categories - All Classes