Uses of Class
net.sf.joafip.redblacktree.service.RBTException

Packages that use RBTException

Package	Description
net.sf.joafip.autosave.rbtree
net.sf.joafip.bugtree
net.sf.joafip.heapfile.record.entity
net.sf.joafip.heapfile.record.service
net.sf.joafip.java.util.support.tree
net.sf.joafip.redblacktree.entity
net.sf.joafip.redblacktree.impl.memory.entity
net.sf.joafip.redblacktree.service
net.sf.joafip.store.entity.heaprecordable
net.sf.joafip.store.service.garbage.rbt

Uses of RBTException in net.sf.joafip.autosave.rbtree

Methods in net.sf.joafip.autosave.rbtree that throw RBTException

Modifier and Type	Method and Description
void	RBTree.append(String value)
IRBTNode<String>	RBTree.getRootNode()
void	RBTree.remove(String value)
void	SimpleTreeOp.rotateLeft()
void	SimpleTreeOp.rotateRight()
void	RBTree.setRootNode(IRBTNode<String> rootNode)

Uses of RBTException in net.sf.joafip.bugtree

Methods in net.sf.joafip.bugtree that throw RBTException

Modifier and Type	Method and Description
void	TreeMem.append(E element)
void	Tree.append(E element)
protected void	AbstractBugTree.appendLoop(Tree<String> tree)
protected Tree<String>	MainTreeHeapFileNoAutoSave.treeAppend(Tree<String> tree, int count, String element)
protected Tree<String>	AbstractBugTree.treeAppend(Tree<String> tree, int count, String element)

Uses of RBTException in net.sf.joafip.heapfile.record.entity

Methods in net.sf.joafip.heapfile.record.entity that throw RBTException

Modifier and Type	Method and Description
void	AbstractHeapRBTNode.accept(IRBTVisitor<E> visitor)
int	HeapIdNode.compareTo(DataRecordIdentifier element)
int	HeapFreeNode.compareTo(Integer element)
int	HeapFreeNode.compareTo(IRBTComparableNode<Integer> node)
void	AbstractHeapRBTNode.decrementNumberOfChild()
boolean	AbstractHeapRBTNode.getColor()
Integer	HeapFreeNode.getElement()
IRBTNode<E>	AbstractHeapRBTNode.getLeft()
long	AbstractHeapRBTNode.getLeftPositionInFile() get this node left son node mirroring in heap file position should be used only by HeapRecord to save it in heap file
int	AbstractHeapRBTNode.getNumberOfChild()
IRBTNode<E>	AbstractHeapRBTNode.getParent()
IRBTNode<E>	AbstractHeapRBTNode.getRight()
long	AbstractHeapRBTNode.getRightPositionInFile() get this node right son node mirroring in heap file position should be used only by HeapRecord to save it in heap file
protected AbstractHeapRBTNode<DataRecordIdentifier>	HeapIdNode.heapNode(HeapRecord heapRecord)
protected AbstractHeapRBTNode<Integer>	HeapFreeNode.heapNode(HeapRecord heapRecord)
protected abstract AbstractHeapRBTNode<E>	AbstractHeapRBTNode.heapNode(HeapRecord heapRecord) get the heap node from the heap record from heap file, depending of heap tree it is not at same location on heap record.
void	AbstractHeapRBTNode.incrementNumberOfChild()
boolean	AbstractHeapRBTNode.isBlack()
boolean	AbstractHeapRBTNode.isRed()
boolean	AbstractHeapRBTNode.isValueChanged() to know if state of this changed
void	AbstractHeapRBTNode.setBlack()
void	AbstractHeapRBTNode.setColor(boolean color)
void	HeapIdNode.setElement(DataRecordIdentifier element)
void	HeapFreeNode.setElement(Integer element)
void	AbstractHeapRBTNode.setLeft(IRBTNode<E> node)
void	AbstractHeapRBTNode.setLeftPositionInFile(long leftPositionInFile) set this node left son node mirroring in heap file position should be used only by HeapRecord to load it from heap file
void	AbstractHeapRBTNode.setNumberOfChild(int numberOfChild)
void	AbstractHeapRBTNode.setParent(IRBTNode<E> node)
void	AbstractHeapRBTNode.setRed()
void	AbstractHeapRBTNode.setRight(IRBTNode<E> node)
void	AbstractHeapRBTNode.setRightPositionInFile(long rightPositionInFile) set this node right son node mirroring in heap file position should be used only by HeapRecord to load it from heap file
void	AbstractHeapRBTNode.valueSetted()

Uses of RBTException in net.sf.joafip.heapfile.record.service

Methods in net.sf.joafip.heapfile.record.service that throw RBTException

Modifier and Type	Method and Description
IRBTNode<E>	AbstractHeapNodeManager.getRootNode()
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)

Uses of RBTException in net.sf.joafip.java.util.support.tree

Methods in net.sf.joafip.java.util.support.tree that throw RBTException

Modifier and Type	Method and Description
IRBTNode<E>	TreeSupport.closestGreaterOrEqualNode(E element)
IRBTNode<E>	TreeSupport.closestLessOrEqualNode(E element)
protected void	TreeSupport.fireAdded(IRBTNode<E> toAdd)
protected void	TreeSupport.fireRemoved(IRBTNode<E> toRemove)
IRBTNode<E>	TreeSupport.strictlyGreaterNode(E element)
IRBTNode<E>	TreeSupport.strictlyLessNode(E element)

Uses of RBTException in net.sf.joafip.redblacktree.entity

Methods in net.sf.joafip.redblacktree.entity that throw RBTException

Modifier and Type	Method and Description
void	RBTSentinel.accept(IRBTVisitor<E> visitor)
int	RBTSentinel.compareTo(E element)
int	IRBTComparableNode.compareTo(E element)
int	IRBTComparableNode.compareTo(IRBTComparableNode<E> node)
void	RBTSentinel.decrementNumberOfChild()
void	IRBTNode.decrementNumberOfChild()
boolean	RBTSentinel.getColor()
boolean	IRBTNode.getColor() get node color color definition: RedBlackTree#BLACK and RedBlackTree#RED
E	IRBTNode.getElement() get the element of this node
IRBTNode<E>	RBTSentinel.getLeft()
IRBTNode<E>	IRBTNode.getLeft() get left child of this node
int	IRBTNode.getNumberOfChild() get the number of node in right and left tree node, sentinel excluded
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
void	RBTSentinel.incrementNumberOfChild()
void	IRBTNode.incrementNumberOfChild()
boolean	RBTSentinel.isBlack()
boolean	IRBTNode.isBlack() to know if node is black
boolean	IRBTNode.isColorSetted()
boolean	RBTSentinel.isRed()
boolean	IRBTNode.isRed() to know if node is red
boolean	RBTSentinel.isSentinel()
boolean	IRBTNode.isSentinel() to know if this node is a sentinel ( a black leaf marker ), if not a sentinel it is a valued node with right and left child
void	IRBTNode.setBlack() set node color to black
void	IRBTNode.setColor(boolean color) set node color color definition: RedBlackTree#BLACK and RedBlackTree#RED
void	IRBTNode.setElement(E element) set this node element
void	RBTSentinel.setLeft(IRBTNode<E> node)
void	IRBTNode.setLeft(IRBTNode<E> node) set left child of this node
void	IRBTNode.setNumberOfChild(int numberOfChild) set the number of node in right and left tree node, sentinel excluded
void	IRBTNode.setParent(IRBTNode<E> node) set parent node
void	IRBTNode.setRed() set node color to red
void	RBTSentinel.setRight(IRBTNode<E> node)
void	IRBTNode.setRight(IRBTNode<E> node) set right child of this node

Uses of RBTException in net.sf.joafip.redblacktree.impl.memory.entity

Methods in net.sf.joafip.redblacktree.impl.memory.entity that throw RBTException

Modifier and Type	Method and Description
void	RBTNode.accept(IRBTVisitor<E> visitor)
int	RBTNode.compareTo(E element)
int	RBTNode.compareTo(IRBTComparableNode<E> node)
void	RBTNode.decrementNumberOfChild()
boolean	RBTNode.getColor()
IRBTNode<E>	RBTNode.getLeft()
int	RBTNode.getNumberOfChild()
IRBTNode<E>	RBTNode.getParent()
IRBTNode<E>	RBTNode.getRight()
void	RBTNode.incrementNumberOfChild()
boolean	RBTNode.isBlack()
boolean	RBTNode.isRed()
boolean	RBTNode.isSentinel()
void	RBTNode.setBlack()
void	RBTNode.setColor(boolean color)
void	RBTNode.setLeft(IRBTNode<E> node)
void	RBTNode.setNumberOfChild(int numberOfChild)
void	RBTNode.setParent(IRBTNode<E> node)
void	RBTNode.setRed()
void	RBTNode.setRight(IRBTNode<E> node)

Uses of RBTException in net.sf.joafip.redblacktree.service

Methods in net.sf.joafip.redblacktree.service that throw RBTException

Modifier and Type	Method and Description
void	RedBlackTree.accept(IRBTVisitor<E> visitor)
void	IRBTVisitable.accept(IRBTVisitor<E> visitor) accept red black tree visitor
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)
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
boolean	RedBlackTree.delete(E referenceElement) delete record if found it, returning deletion operation status delete the first value of group of same value
IRBTNode<E>	RedBlackTree.deleteByIndex(int index) delete a node at position after deletion the node to delete is in detached to the tree state
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
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
boolean	RedBlackTree.deleteLast(E referenceElement) delete record if found it, returning deletion operation status delete the last value of group of same value
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
void	IRBTVisitor.endVisit(IRBTNode<E> node)
IRBTNode<E>	RedBlackTree.first() get the first node ( smallest value ) the found node is attached to the tree
int	RedBlackTree.getNumberOfElement() to obtains number of elements of this tree
IRBTNode<E>	IRBTNodeManager.getRootNode()
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.last() get the last node ( greater value ) the found 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.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>	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
void	IRBTNodeManager.setRootNode(IRBTNode<E> rootNode) set the root red black tree node
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

Uses of RBTException in net.sf.joafip.store.entity.heaprecordable

Methods in net.sf.joafip.store.entity.heaprecordable that throw RBTException

Modifier and Type	Method and Description
void	AbstractHeapRecordableRBTNode.accept(IRBTVisitor<E> visitor)
protected void	AbstractHeapRecordableRBTNode.checkNotSentinel()
int	AbstractHeapRecordableRBTNode.compareTo(E element)
int	AbstractHeapRecordableRBTNode.compareTo(IRBTComparableNode<E> node)
void	AbstractHeapRecordableRBTNode.decrementNumberOfChild()
boolean	AbstractHeapRecordableRBTNode.getColor()
E	AbstractHeapRecordableRBTNode.getElement()
IRBTNode<E>	AbstractHeapRecordableRBTNode.getLeft()
int	AbstractHeapRecordableRBTNode.getNumberOfChild()
IRBTNode<E>	AbstractHeapRecordableRBTNode.getParent()
IRBTNode<E>	AbstractHeapRecordableRBTNode.getRight()
void	AbstractHeapRecordableRBTNode.incrementNumberOfChild()
boolean	AbstractHeapRecordableRBTNode.isBlack()
boolean	AbstractHeapRecordableRBTNode.isColorSetted()
boolean	AbstractHeapRecordableRBTNode.isRed()
boolean	AbstractHeapRecordableRBTNode.isSentinel()
void	AbstractHeapRecordableRBTNode.setBlack()
void	AbstractHeapRecordableRBTNode.setColor(boolean color)
void	AbstractHeapRecordableRBTNode.setElement(E element)
void	AbstractHeapRecordableRBTNode.setLeft(IRBTNode<E> node)
void	AbstractHeapRecordableRBTNode.setNumberOfChild(int numberOfChild)
void	AbstractHeapRecordableRBTNode.setParent(IRBTNode<E> node)
void	AbstractHeapRecordableRBTNode.setRed()
void	AbstractHeapRecordableRBTNode.setRight(IRBTNode<E> node)

Uses of RBTException in net.sf.joafip.store.service.garbage.rbt

Methods in net.sf.joafip.store.service.garbage.rbt that throw RBTException

Modifier and Type	Method and Description
IRBTNode<E>	AbstractGarbageRBTNodeManager.getRootNode()
void	AbstractGarbageRBTNodeManager.setRootNode(IRBTNode<E> rootNode)