Modifier and Type | Method and Description |
---|---|
IRBTNode<E> |
SimpleTreeOp.getRootNode() |
IRBTNode<String> |
RBTree.getRootNode() |
IRBTNode<String> |
RBTree.newSentinel() |
Modifier and Type | Method and Description |
---|---|
void |
SimpleTreeOp.setRootNode(IRBTNode<E> rootNode) |
void |
RBTree.setRootNode(IRBTNode<String> rootNode) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractHeapRBTNode<E extends Comparable<E>>
heap file Red Black Tree Node for used and free heap file area management
is implementation of IRBTNode where an association is made between
this node and its image in heap file |
class |
HeapFreeNode
free node
the node identification value is take from HeapRecord implement the data size comparison implement reading of root free node from HeapRecord |
class |
HeapIdNode
record identifier node
the node identification value is take from HeapRecord implement the identification value comparison implement reading of root identification node from HeapRecord |
Modifier and Type | Method and Description |
---|---|
IRBTNode<Integer> |
HeapRecord.getFreeNode() |
IRBTNode<DataRecordIdentifier> |
HeapRecord.getIdNode() |
IRBTNode<E> |
AbstractHeapRBTNode.getLeft() |
IRBTNode<E> |
AbstractHeapRBTNode.getParent() |
IRBTNode<E> |
AbstractHeapRBTNode.getRight() |
Modifier and Type | Method and Description |
---|---|
void |
AbstractHeapRBTNode.setLeft(IRBTNode<E> node) |
void |
AbstractHeapRBTNode.setParent(IRBTNode<E> node) |
void |
AbstractHeapRBTNode.setRight(IRBTNode<E> node) |
Modifier and Type | Method and Description |
---|---|
IRBTNode<E> |
AbstractHeapNodeManager.getRootNode() |
protected IRBTNode<DataRecordIdentifier> |
HeapIdNodeManager.getRootNode(HeapHeader heapHeader) |
protected IRBTNode<Integer> |
HeapFreeNodeManager.getRootNode(HeapHeader heapHeader) |
protected abstract IRBTNode<E> |
AbstractHeapNodeManager.getRootNode(HeapHeader heapHeader)
the get root node implementation
|
IRBTNode<DataRecordIdentifier> |
HeapIdNodeManager.newSentinel() |
IRBTNode<Integer> |
HeapFreeNodeManager.newSentinel() |
Modifier and Type | Method and Description |
---|---|
protected void |
HeapIdNodeManager.setRootNode(HeapHeader heapHeader,
IRBTNode<DataRecordIdentifier> heapIdRootNode) |
protected abstract void |
AbstractHeapNodeManager.setRootNode(HeapHeader heapHeader,
IRBTNode<E> rootNode) |
protected void |
HeapFreeNodeManager.setRootNode(HeapHeader heapHeader,
IRBTNode<Integer> heapFreeRootNode) |
void |
AbstractHeapNodeManager.setRootNode(IRBTNode<E> rootNode) |
Modifier and Type | Class and Description |
---|---|
class |
TreeSupportNode<E>
extend red black tree node adding reference to previous and next node
|
Modifier and Type | Method and Description |
---|---|
IRBTNode<E> |
TreeSupport.closestGreaterOrEqualNode(E element) |
IRBTNode<E> |
TreeSupport.closestLessOrEqualNode(E element) |
IRBTNode<E> |
TreeSupport.strictlyGreaterNode(E element) |
IRBTNode<E> |
TreeSupport.strictlyLessNode(E element) |
Modifier and Type | Method and Description |
---|---|
protected void |
TreeSupport.fireAdded(IRBTNode<E> toAdd) |
protected void |
TreeSupport.fireRemoved(IRBTNode<E> toRemove) |
int |
TreeSupport.indexOfNode(IRBTNode<E> node) |
boolean |
TreeSupport.isNodeAttachedToTree(IRBTNode<E> node)
to know if a node is attached to the tree
|
E |
TreeSupport.remove(IRBTNode<E> toRemove)
remove existing node
|
Modifier and Type | Class and Description |
---|---|
class |
RBTSentinel<E> |
Modifier and Type | Method and Description |
---|---|
IRBTNode<E> |
RBTSentinel.getLeft() |
IRBTNode<E> |
IRBTNode.getLeft()
get left child of this node
|
IRBTNode<E> |
RBTSentinel.getParent() |
IRBTNode<E> |
IRBTNode.getParent()
get parent node
|
IRBTNode<E> |
RBTSentinel.getRight() |
IRBTNode<E> |
IRBTNode.getRight()
get right child of this node
|
Modifier and Type | Method and Description |
---|---|
void |
RBTSentinel.setLeft(IRBTNode<E> node) |
void |
IRBTNode.setLeft(IRBTNode<E> node)
set left child of this node
|
void |
RBTSentinel.setParent(IRBTNode<E> node) |
void |
IRBTNode.setParent(IRBTNode<E> node)
set parent node
|
void |
RBTSentinel.setRight(IRBTNode<E> node) |
void |
IRBTNode.setRight(IRBTNode<E> node)
set right child of this node
|
Modifier and Type | Class and Description |
---|---|
class |
RBTNode<E>
red black tree node
|
Modifier and Type | Method and Description |
---|---|
IRBTNode<E> |
RBTNode.getLeft() |
IRBTNode<E> |
RBTNode.getParent() |
IRBTNode<E> |
RBTNode.getRight() |
Modifier and Type | Method and Description |
---|---|
void |
RBTNode.setLeft(IRBTNode<E> node) |
void |
RBTNode.setParent(IRBTNode<E> node) |
void |
RBTNode.setRight(IRBTNode<E> node) |
Modifier and Type | Method and Description |
---|---|
IRBTNode<E> |
RBTNodeManager.getRootNode() |
IRBTNode<E> |
RBTNodeManager.newSentinel() |
Modifier and Type | Method and Description |
---|---|
void |
RBTNodeManager.setRootNode(IRBTNode<E> rootNode) |
Modifier and Type | Method and Description |
---|---|
IRBTNode<E> |
RedBlackTree.appendOrReplace(IRBTNode<E> nodeToAppendOrSubstitute)
append or replace node if exist
the replaced node is detached from the tree |
IRBTNode<E> |
RedBlackTree.closestGreaterOrEqual(E referenceElement)
search node by reference element or closest greater if not exist
closest is the smaller greater than reference element the found node is attached to the tree |
IRBTNode<E> |
RedBlackTree.closestLessOrEqual(E referenceElement)
search for node by reference element or closest less if not exist
closest is the greater smaller than reference element the found node is attached to the tree |
IRBTNode<E> |
RedBlackTree.deleteByIndex(int index)
delete a node at position
after deletion the node to delete is in detached to the tree state |
IRBTNode<E> |
RedBlackTree.deleteGetRemoved(E referenceElement)
delete record if found it, returning deleted node if any
delete the first value of group of same value after deletion the node to delete returned is in detached to the tree state |
IRBTNode<E> |
RedBlackTree.deleteLastGetRemoved(E referenceElement)
delete record if found it, returning deleted node if any
delete the last value of group of same value after deletion the node to delete returned is in detached to the tree state |
IRBTNode<E> |
RedBlackTree.first()
get the first node ( smallest value )
the found node is attached to the tree |
IRBTNode<E> |
IRBTNodeManager.getRootNode() |
IRBTNode<E> |
RedBlackTree.last()
get the last node ( greater value )
the found node is attached to the tree |
IRBTNode<E> |
IRBTNodeManager.newSentinel()
to get a new sentinel
|
IRBTNode<E> |
RBTNodeListIterator.next() |
IRBTNode<E> |
RedBlackTree.next(IRBTNode<E> node)
to obtains the next node of a node
the reference node must be attached to the tree |
IRBTNode<E> |
RedBlackTree.nodeAtIndex(int index)
to obtains node at position in the sorted list view of this tree
|
IRBTNode<E> |
RedBlackTree.pollFirst()
Retrieves and removes the first (lowest) element, or returns
null
if the tree is empty. |
IRBTNode<E> |
RedBlackTree.pollLast()
Retrieves and removes the last (highest) element, or returns
null
if the tree is empty. |
IRBTNode<E> |
RBTNodeListIterator.previous() |
IRBTNode<E> |
RedBlackTree.previous(IRBTNode<E> node)
to obtains the previous node of a node
the reference node must be attached to the tree |
IRBTNode<E> |
RedBlackTree.search(E referenceElement)
search for a node referencing element equals to reference element, return
the first of group of same value
the found node is attached to the tree |
IRBTNode<E> |
RedBlackTree.searchLast(E referenceElement)
search for a node referencing element equals to reference element, return
the last of group of same value
the found node is attached to the tree |
IRBTNode<E> |
RedBlackTree.strictlyGreater(E referenceElement)
search for node by reference element strictly greater
the found node is attached to the tree |
IRBTNode<E> |
RedBlackTree.strictlyLess(E referenceElement)
search for node by reference element strictly less
the found node is attached to the tree |
Modifier and Type | Method and Description |
---|---|
Iterator<IRBTNode<E>> |
RedBlackTree.iterator() |
ListIterator<IRBTNode<E>> |
RedBlackTree.listIterator() |
ListIterator<IRBTNode<E>> |
RedBlackTree.listIterator(int index) |
Modifier and Type | Method and Description |
---|---|
void |
RBTNodeListIterator.add(IRBTNode<E> element) |
void |
RedBlackTree.append(IRBTNode<E> nodeToAppend)
append a node in the tree
if same value exist node is add at end of the existing value(s) set the node to append must be detached to the tree |
void |
RedBlackTree.appendAfterLast(IRBTNode<E> nodeToAppend)
append node after last node
|
void |
RedBlackTree.appendBeforeFirst(IRBTNode<E> nodeToInsert)
insert node before first node
|
boolean |
RedBlackTree.appendIfNotexist(IRBTNode<E> nodeToAppend)
append a node in the tree if value not already store in it
the node to append must be detached to the tree |
IRBTNode<E> |
RedBlackTree.appendOrReplace(IRBTNode<E> nodeToAppendOrSubstitute)
append or replace node if exist
the replaced node is detached from the tree |
void |
IRBTVisitor.beginVisit(IRBTNode<E> node) |
void |
RedBlackTree.deleteExistingNode(IRBTNode<E> nodeToDelete)
delete a node attached to the tree
the node to delete must be attached to the tree after deletion the node to delete is in detached to the tree state |
void |
IRBTVisitor.endVisit(IRBTNode<E> node) |
int |
RedBlackTree.index(IRBTNode<E> node)
obtains the position of the node in list view of this tree
|
void |
RedBlackTree.insertAfter(IRBTNode<E> nodeToInsert,
int index)
insert a node after the node at position, the inserted node index will be
the insert position + 1
|
void |
RedBlackTree.insertBefore(IRBTNode<E> nodeToInsert,
int index)
insert a node before the node at position, the inserted node index will
be the insert position
|
boolean |
RedBlackTree.isNodeAttachedToTree(IRBTNode<E> node)
to know if a node is attached to the tree
|
IRBTNode<E> |
RedBlackTree.next(IRBTNode<E> node)
to obtains the next node of a node
the reference node must be attached to the tree |
IRBTNode<E> |
RedBlackTree.previous(IRBTNode<E> node)
to obtains the previous node of a node
the reference node must be attached to the tree |
void |
RBTNodeListIterator.set(IRBTNode<E> element) |
void |
IRBTNodeManager.setRootNode(IRBTNode<E> rootNode)
set the root red black tree node
|
Modifier and Type | Class and Description |
---|---|
class |
DataRecordIdentifierRBTNode
red black tree node for garbage trees: to garbage, garbage candidate, visited
for garbage, to visit for garbage
element is data record identifier of persistent object referenced by this node |
class |
GarbageReferenceLinkRBTNode
red black tree node for garbage reference link tree
element is ReferenceLinkMap |
Modifier and Type | Class and Description |
---|---|
class |
AbstractHeapRecordableRBTNode<E>
red black tree heap recordable node
|
Modifier and Type | Method and Description |
---|---|
IRBTNode<E> |
AbstractHeapRecordableRBTNode.getLeft() |
IRBTNode<E> |
AbstractHeapRecordableRBTNode.getParent() |
IRBTNode<E> |
AbstractHeapRecordableRBTNode.getRight() |
Modifier and Type | Method and Description |
---|---|
void |
AbstractHeapRecordableRBTNode.setLeft(IRBTNode<E> node) |
void |
AbstractHeapRecordableRBTNode.setParent(IRBTNode<E> node) |
void |
AbstractHeapRecordableRBTNode.setRight(IRBTNode<E> node) |
Modifier and Type | Method and Description |
---|---|
IRBTNode<E> |
AbstractGarbageRBTNodeManager.getRootNode() |
IRBTNode<ReferenceLink> |
GarbageReferenceLinkRBTNodeManager.newSentinel() |
IRBTNode<DataRecordIdentifier> |
AbstractDataRecordIdentifierRBTNodeManager.newSentinel() |
Modifier and Type | Method and Description |
---|---|
void |
AbstractGarbageRBTNodeManager.setRootNode(IRBTNode<E> rootNode) |
Copyright © 2007-2012 Luc Peuvrier. All Rights Reserved.