| java.lang.Object
 com.db4o.foundation.Tree
All known Subclasses: com.db4o.foundation.TreeObject, com.db4o.internal.query.processor.QPending, com.db4o.internal.query.processor.QOrder, com.db4o.internal.ix.IxTree, com.db4o.internal.TreeString, com.db4o.internal.TreeInt,
| Inner Class :final public static class ByRef | |
| Method Summary | |
| final public static Tree | add(Tree a_old, Tree a_new)
| | public Tree | add(Tree a_new)
| | public Tree | add(Tree a_new, int a_cmp)
On adding a node to a tree, if it already exists, and if
Tree#duplicates() returns false, #isDuplicateOf() will be
called. | | public Tree | addedOrExisting()
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.
This node node can then be asked for the node that prevails
in the tree on adding, using the #addedOrExisting() method. | | final public Tree | balance()
| | public Tree | balanceCheckNulls()
| | public void | calculateSize()
| | abstract public int | compare(Tree a_to)
| | public static Tree | deepClone(Tree a_tree, Object a_param)
| | public Object | deepClone(Object a_param)
| | public boolean | duplicates()
| | final public Tree | filter(Predicate4 a_filter)
| | final public static Tree | find(Tree a_in, Tree a_tree)
| | final public Tree | find(Tree a_tree)
| | final public static Tree | findGreaterOrEqual(Tree a_in, Tree a_finder)
| | final public static Tree | findSmaller(Tree a_in, Tree a_node)
| | final public Tree | first()
| | abstract public Object | key()
| | public static Tree | last(Tree tree)
| | final public Tree | last()
| | public int | nodes()
| | public void | onAttemptToAddDuplicate(Tree a_tree)
| | public int | ownSize()
| | public Tree | remove()
| | public void | removeChildren()
| | public Tree | removeFirst()
| | public static Tree | removeLike(Tree from, Tree a_find)
| | final public Tree | removeLike(Tree a_find)
| | final public Tree | removeNode(Tree a_tree)
| | public Object | root()
| | final public Tree | rotateLeft()
| | final public Tree | rotateRight()
| | public void | setSizeOwn()
| | public void | setSizeOwnPlus(Tree tree)
| | public void | setSizeOwnPlus(Tree tree1, Tree tree2)
| | public void | setSizeOwnPreceding()
| | public void | setSizeOwnPrecedingSubsequent()
| | public void | setSizeOwnSubsequent()
| | public Object | shallowClone()
| | protected Tree | shallowCloneInternal(Tree tree)
| | public static int | size(Tree a_tree)
| | public int | size()
| | final public static void | traverse(Tree tree, Visitor4 visitor)
| | final public void | traverse(Visitor4 a_visitor)
| | final public void | traverseFromLeaves(Visitor4 a_visitor)
| | public boolean | wasAddedToTree()
|
| add | | public Tree add(Tree a_new, int a_cmp)(Code) | | On adding a node to a tree, if it already exists, and if
Tree#duplicates() returns false, #isDuplicateOf() will be
called. The added node can then be asked for the node that
prevails in the tree using #duplicateOrThis(). This mechanism
allows doing find() and add() in one run.
|
| addedOrExisting | | public Tree addedOrExisting()(Code) | | 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.
This node node can then be asked for the node that prevails
in the tree on adding, using the #addedOrExisting() method.
This mechanism allows doing find() and add() in one run.
|
| balanceCheckNulls | | public Tree balanceCheckNulls()(Code) | | |
| calculateSize | | public void calculateSize()(Code) | | |
| compare | | abstract public int compare(Tree a_to)(Code) | | returns 0, if keys are equal
uses this - other
returns positive if this is greater than a_to
returns negative if this is smaller than a_to
|
| duplicates | | public boolean duplicates()(Code) | | |
| findGreaterOrEqual | | final public static Tree findGreaterOrEqual(Tree a_in, Tree a_finder)(Code) | | |
| nodes | | public int nodes()(Code) | | the number of nodes in this tree for balancing |
| onAttemptToAddDuplicate | | public void onAttemptToAddDuplicate(Tree a_tree)(Code) | | |
| ownSize | | public int ownSize()(Code) | | |
| removeChildren | | public void removeChildren()(Code) | | |
| setSizeOwn | | public void setSizeOwn()(Code) | | |
| setSizeOwnPlus | | public void setSizeOwnPlus(Tree tree)(Code) | | |
| setSizeOwnPlus | | public void setSizeOwnPlus(Tree tree1, Tree tree2)(Code) | | |
| setSizeOwnPreceding | | public void setSizeOwnPreceding()(Code) | | |
| setSizeOwnPrecedingSubsequent | | public void setSizeOwnPrecedingSubsequent()(Code) | | |
| setSizeOwnSubsequent | | public void setSizeOwnSubsequent()(Code) | | |
| shallowCloneInternal | | protected Tree shallowCloneInternal(Tree tree)(Code) | | |
| size | | public int size()(Code) | | the number of objects represented. |
| traverseFromLeaves | | final public void traverseFromLeaves(Visitor4 a_visitor)(Code) | | |
| wasAddedToTree | | public boolean wasAddedToTree()(Code) | | |
|
|