Uses of Class
org.apache.directory.server.core.avltree.LinkedAvlNode

Packages that use LinkedAvlNode

Package	Description
org.apache.directory.server.core.avltree

Uses of LinkedAvlNode in org.apache.directory.server.core.avltree

Fields in org.apache.directory.server.core.avltree declared as LinkedAvlNode

Modifier and Type	Field and Description
private LinkedAvlNode<K>	AvlTreeImpl.first node representing the start of the doubly linked list formed with the tree nodes
private LinkedAvlNode<K>	AvlTreeImpl.last node representing the end of the doubly linked list formed with the tree nodes
(package private) LinkedAvlNode<T>	LinkedAvlNode.left The left child
(package private) LinkedAvlNode<T>	LinkedAvlNode.next The next node, superior to the current node
private LinkedAvlNode<E>	AvlTreeCursor.node The current node
(package private) LinkedAvlNode<T>	LinkedAvlNode.previous The previous node, inferior to the current node
(package private) LinkedAvlNode<T>	LinkedAvlNode.right The right child
private LinkedAvlNode<K>	AvlTreeImpl.root the root of the tree
private LinkedAvlNode<K>	AvlTreeSingleton.singleton

Methods in org.apache.directory.server.core.avltree that return LinkedAvlNode

Modifier and Type	Method and Description
private LinkedAvlNode<K>	AvlTreeImpl.fetchNonNullNode(K key, LinkedAvlNode<K> startNode, LinkedAvlNode<K> parent)
LinkedAvlNode<K>	AvlTreeImpl.find(K key)
LinkedAvlNode<K>	AvlTreeSingleton.find(K key) Find a LinkedAvlNode with the given key value in the tree.
LinkedAvlNode<K>	AvlTree.find(K key) Find a LinkedAvlNode with the given key value in the tree.
private LinkedAvlNode<K>	AvlTreeImpl.find(K key, LinkedAvlNode<K> startNode)
LinkedAvlNode<K>	AvlTreeImpl.findGreater(K key)
LinkedAvlNode<K>	AvlTreeSingleton.findGreater(K key) Finds a LinkedAvlNode whose key is higher than the given key.
LinkedAvlNode<K>	AvlTree.findGreater(K key) Finds a LinkedAvlNode whose key is higher than the given key.
LinkedAvlNode<K>	AvlTreeImpl.findGreaterOrEqual(K key)
LinkedAvlNode<K>	AvlTreeSingleton.findGreaterOrEqual(K key) Finds a LinkedAvlNode whose key is higher than the given key.
LinkedAvlNode<K>	AvlTree.findGreaterOrEqual(K key) Finds a LinkedAvlNode whose key is higher than the given key.
LinkedAvlNode<K>	AvlTreeImpl.findLess(K key)
LinkedAvlNode<K>	AvlTreeSingleton.findLess(K key) Finds a LinkedAvlNode whose key is lower than the given key.
LinkedAvlNode<K>	AvlTree.findLess(K key) Finds a LinkedAvlNode whose key is lower than the given key.
LinkedAvlNode<K>	AvlTreeImpl.findLessOrEqual(K key)
LinkedAvlNode<K>	AvlTreeSingleton.findLessOrEqual(K key) Finds a LinkedAvlNode whose key is lower than the given key.
LinkedAvlNode<K>	AvlTree.findLessOrEqual(K key) Finds a LinkedAvlNode whose key is lower than the given key.
LinkedAvlNode<K>	AvlTreeImpl.getFirst()
LinkedAvlNode<K>	AvlTreeSingleton.getFirst()
LinkedAvlNode<K>	AvlTree.getFirst()
LinkedAvlNode<K>	AvlTreeImpl.getLast()
LinkedAvlNode<K>	AvlTreeSingleton.getLast()
LinkedAvlNode<K>	AvlTree.getLast()
LinkedAvlNode<T>	LinkedAvlNode.getLeft()
LinkedAvlNode<T>	LinkedAvlNode.getNext()
LinkedAvlNode<T>	LinkedAvlNode.getPrevious()
LinkedAvlNode<T>	LinkedAvlNode.getRight()
LinkedAvlNode<K>	AvlTreeImpl.getRoot()
LinkedAvlNode<K>	AvlTreeSingleton.getRoot()
LinkedAvlNode<K>	AvlTree.getRoot()
LinkedAvlNode<E>	AvlTreeMarshaller.readTree(java.io.DataInputStream in, LinkedAvlNode<E> node, LinkedAvlNode[] nodes) Reads the data from given InputStream and creates the LinkedAvlNodes to form the tree node = [size] [data-length] [data] [index] [child-marker] [node] [child-marker] [node].

Methods in org.apache.directory.server.core.avltree that return types with arguments of type LinkedAvlNode

Modifier and Type	Method and Description
private java.util.List<LinkedAvlNode<K>>	AvlTreeImpl.find(K key, LinkedAvlNode<K> startNode, java.util.List<LinkedAvlNode<K>> path) Find a LinkedAvlNode with the given key value in the tree starting from the startNode.
private java.util.List<LinkedAvlNode<K>>	AvlTreeImpl.findMax(LinkedAvlNode<K> startNode) Find the LinkedAvlNode having the max key value in the tree starting from the startNode.
private java.util.List<LinkedAvlNode<K>>	AvlTreeImpl.findMin(LinkedAvlNode<K> startNode) Find the LinkedAvlNode having the min key value in the tree starting from the startNode.

Methods in org.apache.directory.server.core.avltree with parameters of type LinkedAvlNode

Modifier and Type	Method and Description
private void	AvlTreeImpl.detachNodes(LinkedAvlNode<K> node, LinkedAvlNode<K> parentNode) Detach a LinkedAvlNode from its parent
private void	AvlTreeImpl.detachNodes(LinkedAvlNode<K> node, LinkedAvlNode<K> parentNode) Detach a LinkedAvlNode from its parent
private LinkedAvlNode<K>	AvlTreeImpl.fetchNonNullNode(K key, LinkedAvlNode<K> startNode, LinkedAvlNode<K> parent)
private LinkedAvlNode<K>	AvlTreeImpl.fetchNonNullNode(K key, LinkedAvlNode<K> startNode, LinkedAvlNode<K> parent)
private LinkedAvlNode<K>	AvlTreeImpl.find(K key, LinkedAvlNode<K> startNode)
private java.util.List<LinkedAvlNode<K>>	AvlTreeImpl.find(K key, LinkedAvlNode<K> startNode, java.util.List<LinkedAvlNode<K>> path) Find a LinkedAvlNode with the given key value in the tree starting from the startNode.
private java.util.List<LinkedAvlNode<K>>	AvlTreeImpl.findMax(LinkedAvlNode<K> startNode) Find the LinkedAvlNode having the max key value in the tree starting from the startNode.
private java.util.List<LinkedAvlNode<K>>	AvlTreeImpl.findMin(LinkedAvlNode<K> startNode) Find the LinkedAvlNode having the min key value in the tree starting from the startNode.
private int	AvlTreeImpl.getBalance(LinkedAvlNode<K> node) Get balance-factor of the given LinkedAvlNode.
private void	AvlTreeImpl.insertInList(LinkedAvlNode<K> node, LinkedAvlNode<K> parentNode, int pos)
private void	AvlTreeImpl.insertInList(LinkedAvlNode<K> node, LinkedAvlNode<K> parentNode, int pos)
LinkedAvlNode<E>	AvlTreeMarshaller.readTree(java.io.DataInputStream in, LinkedAvlNode<E> node, LinkedAvlNode[] nodes) Reads the data from given InputStream and creates the LinkedAvlNodes to form the tree node = [size] [data-length] [data] [index] [child-marker] [node] [child-marker] [node].
LinkedAvlNode<E>	AvlTreeMarshaller.readTree(java.io.DataInputStream in, LinkedAvlNode<E> node, LinkedAvlNode[] nodes) Reads the data from given InputStream and creates the LinkedAvlNodes to form the tree node = [size] [data-length] [data] [index] [child-marker] [node] [child-marker] [node].
private void	AvlTreeImpl.removeFromList(LinkedAvlNode<K> node)
private void	AvlTreeImpl.replaceNode(LinkedAvlNode<K> deleteNode, LinkedAvlNode<K> replaceNode, LinkedAvlNode<K> parentNode) Replace a LinkedAvlNode to be removed with a new existing LinkedAvlNode
private void	AvlTreeImpl.replaceNode(LinkedAvlNode<K> deleteNode, LinkedAvlNode<K> replaceNode, LinkedAvlNode<K> parentNode) Replace a LinkedAvlNode to be removed with a new existing LinkedAvlNode
private void	AvlTreeImpl.replaceNode(LinkedAvlNode<K> deleteNode, LinkedAvlNode<K> replaceNode, LinkedAvlNode<K> parentNode) Replace a LinkedAvlNode to be removed with a new existing LinkedAvlNode
private void	AvlTreeImpl.rotateSingleLeft(LinkedAvlNode<K> node, LinkedAvlNode<K> parentNode) Rotate the node left side once.
private void	AvlTreeImpl.rotateSingleLeft(LinkedAvlNode<K> node, LinkedAvlNode<K> parentNode) Rotate the node left side once.
private void	AvlTreeImpl.rotateSingleRight(LinkedAvlNode<K> node, LinkedAvlNode<K> parentNode) Rotate the node right side once.
private void	AvlTreeImpl.rotateSingleRight(LinkedAvlNode<K> node, LinkedAvlNode<K> parentNode) Rotate the node right side once.
(package private) void	AvlTreeImpl.setFirst(LinkedAvlNode<K> first) Set the first element of the tree Note : this method is used by the deserialization method
(package private) void	AvlTreeImpl.setLast(LinkedAvlNode<K> last) Set the last element of the tree Note : this method is used by the deserialization method
void	LinkedAvlNode.setLeft(LinkedAvlNode<T> left)
void	LinkedAvlNode.setNext(LinkedAvlNode<T> next)
void	LinkedAvlNode.setPrevious(LinkedAvlNode<T> previous)
void	LinkedAvlNode.setRight(LinkedAvlNode<T> right)
(package private) void	AvlTreeImpl.setRoot(LinkedAvlNode<K> root) Set the root of the tree.
private void	AvlTreeImpl.visit(LinkedAvlNode<K> node, LinkedAvlNode<K> parentNode)
private void	AvlTreeImpl.visit(LinkedAvlNode<K> node, LinkedAvlNode<K> parentNode)
private void	AvlTreeMarshaller.writeTree(LinkedAvlNode<E> node, java.io.DataOutputStream out) writes the content of the AVLTree to an output stream.

Method parameters in org.apache.directory.server.core.avltree with type arguments of type LinkedAvlNode

Modifier and Type	Method and Description
private void	AvlTreeImpl.balance(java.util.List<LinkedAvlNode<K>> treePath) Balances the tree by visiting the nodes present in the List of nodes present in the treePath parameter. This really does the balancing if the height of the tree is greater than 2 and the balance factor is greater than +1 or less than -1. For an excellent info please read the Wikipedia article on AVL tree.
private java.util.List<LinkedAvlNode<K>>	AvlTreeImpl.find(K key, LinkedAvlNode<K> startNode, java.util.List<LinkedAvlNode<K>> path) Find a LinkedAvlNode with the given key value in the tree starting from the startNode.