| Accept(IVisitor4) |
void |
|
| Add(Tree, int) |
Tree |
On adding a node to a tree, if it already exists, and if
Tree#duplicates() returns false, #isDuplicateOf() will be
called.
|
| Add(Tree, Tree) |
Tree |
static
|
| Add(Tree) |
Tree |
|
| Add(TreeInt, int) |
TreeInt |
static
|
| AddAll(Tree, IIntIterator4) |
Tree |
static
|
| AddDependant(IInternalCandidate) |
void |
|
| AddedOrExisting() |
Tree |
On adding a node to a tree, if it already exists, and if
Tree#duplicates() returns false, #onAttemptToAddDuplicate()
will be called and the existing node will be stored in
this._preceding.
|
| Balance() |
Tree |
|
| BalanceCheckNulls() |
Tree |
|
| CalculateSize() |
void |
|
| Candidates() |
QCandidates |
|
| ClassMetadata() |
ClassMetadata |
|
| Compare(Tree) |
int |
|
| DeepClone(Object) |
Object |
|
| DeepClone(Tree, Object) |
Tree |
static
|
| Depth(Tree) |
int |
static
|
| DoNotInclude() |
void |
|
| Duplicates() |
bool |
|
| Equals(Object) |
bool |
|
| Evaluate(QConObject, QE) |
bool |
|
| Evaluate(QPending) |
bool |
|
| FieldIsAvailable() |
bool |
|
| Filter(IPredicate4) |
Tree |
|
| Find(int) |
TreeInt |
|
| Find(Tree, int) |
TreeInt |
static
|
| Find(Tree, Tree) |
Tree |
static
|
| Find(Tree) |
Tree |
|
| FindGreaterOrEqual(Tree, Tree) |
Tree |
static
|
| FindSmaller(Tree, Tree) |
Tree |
static
|
| First() |
Tree |
|
| GetObject() |
Object |
|
| GetRoot() |
IInternalCandidate |
|
| Id() |
int |
|
| Include() |
bool |
|
| Include(bool) |
void |
For external interface use only.
|
| Key() |
Object |
|
| Last() |
Tree |
|
| Last(Tree) |
Tree |
static
|
| MarshalledLength() |
int |
|
| MarshalledLength(int) |
int |
|
| MarshalledLength(TreeInt) |
int |
static
|
| Nodes() |
int |
|
| ObjectContainer() |
IObjectContainer |
|
| OnAttemptToAddDuplicate(Tree) |
Tree |
|
| OwnLength() |
int |
|
| OwnSize() |
int |
|
| PendingJoins() |
Tree |
|
| PrepareComparison(ObjectContainerBase, Object) |
IPreparedComparison |
|
| Read(ByteArrayBuffer) |
Object |
|
| Remove() |
Tree |
|
| RemoveChildren() |
void |
|
| RemoveFirst() |
Tree |
|
| RemoveLike(Tree, Tree) |
Tree |
static
|
| RemoveLike(Tree) |
Tree |
|
| RemoveLike(TreeInt, int) |
TreeInt |
static
|
| RemoveNode(Tree) |
Tree |
|
| Root() |
Object |
|
| Root(IInternalCandidate) |
void |
|
| RotateLeft() |
Tree |
|
| RotateRight() |
Tree |
|
| SetSizeOwn() |
void |
|
| SetSizeOwnPlus(Tree, Tree) |
void |
|
| SetSizeOwnPlus(Tree) |
void |
|
| SetSizeOwnPreceding() |
void |
|
| SetSizeOwnPrecedingSubsequent() |
void |
|
| SetSizeOwnSubsequent() |
void |
|
| ShallowClone() |
Object |
|
| ShallowCloneInternal(Tree) |
Tree |
|
| Size() |
int |
|
| Size(Tree) |
int |
static
|
| ToString() |
string |
|
| Transaction() |
LocalTransaction |
|
| Traverse(IVisitor4) |
void |
|
| Traverse(Tree, IVisitor4) |
void |
static
|
| Traverse(Tree, Tree, ICancellableVisitor4) |
void |
Traverses a tree with a starting point node.
static
|
| TraverseFromLeaves(IVisitor4) |
void |
|
| WasAddedToTree() |
bool |
|
| Write(ByteArrayBuffer, TreeInt, int) |
void |
static
|
| Write(ByteArrayBuffer, TreeInt) |
void |
static
|
| Write(ByteArrayBuffer) |
void |
|