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

Packages that use LinkedAvlMapNode

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

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

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

Modifier and Type	Field and Description
private LinkedAvlMapNode<K,V>	AvlTreeMapImpl.first node representing the start of the doubly linked list formed with the tree nodes
private LinkedAvlMapNode<K,V>	AvlTreeMapImpl.last node representing the end of the doubly linked list formed with the tree nodes
(package private) LinkedAvlMapNode<K,V>	LinkedAvlMapNode.left The left child
(package private) LinkedAvlMapNode<K,V>	LinkedAvlMapNode.next The next node, superior to the current node
private LinkedAvlMapNode<K,V>	AvlSingletonOrOrderedSetCursor.node The current node
(package private) LinkedAvlMapNode<K,V>	LinkedAvlMapNode.previous The previous node, inferior to the current node
(package private) LinkedAvlMapNode<K,V>	LinkedAvlMapNode.right The right child
private LinkedAvlMapNode<K,V>	AvlTreeMapImpl.root the root of the tree

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

Modifier and Type	Method and Description
private LinkedAvlMapNode<K,V>	AvlTreeMapImpl.fetchNonNullNode(K key, LinkedAvlMapNode<K,V> startNode, LinkedAvlMapNode<K,V> parent)
LinkedAvlMapNode<K,V>	AvlTreeMapImpl.find(K key) Find a LinkedAvlMapNode with the given key value in the tree.
LinkedAvlMapNode<K,V>	AvlTreeMap.find(K key) Find a LinkedAvlMapNode with the given key value in the tree.
private LinkedAvlMapNode<K,V>	AvlTreeMapImpl.find(K key, LinkedAvlMapNode<K,V> startNode)
LinkedAvlMapNode<K,V>	AvlTreeMapImpl.find(K key, V value) Find a LinkedAvlMapNode with the given key and value in the tree.
LinkedAvlMapNode<K,V>	AvlTreeMap.find(K key, V value) Find a LinkedAvlMapNode with the given key and value in the tree.
LinkedAvlMapNode<K,V>	AvlTreeMapImpl.findGreater(K key) Finds a LinkedAvlMapNode whose key is higher than the given key.
LinkedAvlMapNode<K,V>	AvlTreeMap.findGreater(K key) Finds a LinkedAvlMapNode whose key is higher than the given key.
LinkedAvlMapNode<K,V>	AvlTreeMapImpl.findGreaterOrEqual(K key) Finds a LinkedAvlMapNode whose key is higher than the given key.
LinkedAvlMapNode<K,V>	AvlTreeMap.findGreaterOrEqual(K key) Finds a LinkedAvlMapNode whose key is higher than the given key.
LinkedAvlMapNode<K,V>	AvlTreeMapImpl.findLess(K key) Finds a LinkedAvlMapNode whose key is lower than the given key.
LinkedAvlMapNode<K,V>	AvlTreeMap.findLess(K key) Finds a LinkedAvlMapNode whose key is lower than the given key.
LinkedAvlMapNode<K,V>	AvlTreeMapImpl.findLessOrEqual(K key) Finds a LinkedAvlMapNode whose key is lower than the given key.
LinkedAvlMapNode<K,V>	AvlTreeMap.findLessOrEqual(K key) Finds a LinkedAvlMapNode whose key is lower than the given key.
LinkedAvlMapNode<K,V>	AvlTreeMapImpl.getFirst()
LinkedAvlMapNode<K,V>	AvlTreeMap.getFirst()
LinkedAvlMapNode<K,V>	AvlTreeMapImpl.getLast()
LinkedAvlMapNode<K,V>	AvlTreeMap.getLast()
LinkedAvlMapNode<K,V>	LinkedAvlMapNode.getLeft()
LinkedAvlMapNode<K,V>	LinkedAvlMapNode.getNext()
LinkedAvlMapNode<K,V>	LinkedAvlMapNode.getPrevious()
LinkedAvlMapNode<K,V>	LinkedAvlMapNode.getRight()
LinkedAvlMapNode<K,V>	AvlTreeMapImpl.getRoot()
LinkedAvlMapNode<K,V>	AvlTreeMap.getRoot()

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

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

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

Modifier and Type	Method and Description
private void	AvlTreeMapImpl.balanceNodesAfterRemove(java.util.List<LinkedAvlMapNode<K,V>> treePath, LinkedAvlMapNode<K,V> delNode) changes the order of nodes after a delete operation and then balances the tree
private void	AvlTreeMapImpl.detachNodes(LinkedAvlMapNode<K,V> node, LinkedAvlMapNode<K,V> parentNode) Detach a LinkedAvlMapNode from its parent
private void	AvlTreeMapImpl.detachNodes(LinkedAvlMapNode<K,V> node, LinkedAvlMapNode<K,V> parentNode) Detach a LinkedAvlMapNode from its parent
private LinkedAvlMapNode<K,V>	AvlTreeMapImpl.fetchNonNullNode(K key, LinkedAvlMapNode<K,V> startNode, LinkedAvlMapNode<K,V> parent)
private LinkedAvlMapNode<K,V>	AvlTreeMapImpl.fetchNonNullNode(K key, LinkedAvlMapNode<K,V> startNode, LinkedAvlMapNode<K,V> parent)
private LinkedAvlMapNode<K,V>	AvlTreeMapImpl.find(K key, LinkedAvlMapNode<K,V> startNode)
private java.util.List<LinkedAvlMapNode<K,V>>	AvlTreeMapImpl.find(K key, LinkedAvlMapNode<K,V> startNode, java.util.List<LinkedAvlMapNode<K,V>> path) Find a LinkedAvlMapNode with the given key value in the tree starting from the startNode.
private java.util.List<LinkedAvlMapNode<K,V>>	AvlTreeMapImpl.findMax(LinkedAvlMapNode<K,V> startNode) Find the LinkedAvlMapNode having the max key value in the tree starting from the startNode.
private java.util.List<LinkedAvlMapNode<K,V>>	AvlTreeMapImpl.findMin(LinkedAvlMapNode<K,V> startNode) Find the LinkedAvlMapNode having the min key value in the tree starting from the startNode.
private int	AvlTreeMapImpl.getBalance(LinkedAvlMapNode<K,V> node) Get balance-factor of the given LinkedAvlMapNode.
private V	AvlTreeMapImpl.insertDupKey(V value, LinkedAvlMapNode<K,V> existingNode)
private void	AvlTreeMapImpl.insertInList(LinkedAvlMapNode<K,V> node, LinkedAvlMapNode<K,V> parentNode, int pos)
private void	AvlTreeMapImpl.insertInList(LinkedAvlMapNode<K,V> node, LinkedAvlMapNode<K,V> parentNode, int pos)
private void	AvlTreeMapImpl.removeFromList(LinkedAvlMapNode<K,V> node)
private void	AvlTreeMapImpl.replaceNode(LinkedAvlMapNode<K,V> deleteNode, LinkedAvlMapNode<K,V> replaceNode, LinkedAvlMapNode<K,V> parentNode) Replace a LinkedAvlMapNode to be removed with a new existing LinkedAvlMapNode
private void	AvlTreeMapImpl.replaceNode(LinkedAvlMapNode<K,V> deleteNode, LinkedAvlMapNode<K,V> replaceNode, LinkedAvlMapNode<K,V> parentNode) Replace a LinkedAvlMapNode to be removed with a new existing LinkedAvlMapNode
private void	AvlTreeMapImpl.replaceNode(LinkedAvlMapNode<K,V> deleteNode, LinkedAvlMapNode<K,V> replaceNode, LinkedAvlMapNode<K,V> parentNode) Replace a LinkedAvlMapNode to be removed with a new existing LinkedAvlMapNode
private void	AvlTreeMapImpl.rotateSingleLeft(LinkedAvlMapNode<K,V> node, LinkedAvlMapNode<K,V> parentNode) Rotate the node left side once.
private void	AvlTreeMapImpl.rotateSingleLeft(LinkedAvlMapNode<K,V> node, LinkedAvlMapNode<K,V> parentNode) Rotate the node left side once.
private void	AvlTreeMapImpl.rotateSingleRight(LinkedAvlMapNode<K,V> node, LinkedAvlMapNode<K,V> parentNode) Rotate the node right side once.
private void	AvlTreeMapImpl.rotateSingleRight(LinkedAvlMapNode<K,V> node, LinkedAvlMapNode<K,V> parentNode) Rotate the node right side once.
(package private) void	AvlTreeMapImpl.setFirst(LinkedAvlMapNode<K,V> first) Set the first element of the tree Note : this method is used by the deserialization method
(package private) void	AvlTreeMapImpl.setLast(LinkedAvlMapNode<K,V> last) Set the last element of the tree Note : this method is used by the deserialization method
void	LinkedAvlMapNode.setLeft(LinkedAvlMapNode<K,V> left)
void	LinkedAvlMapNode.setNext(LinkedAvlMapNode<K,V> next)
void	LinkedAvlMapNode.setPrevious(LinkedAvlMapNode<K,V> previous)
void	LinkedAvlMapNode.setRight(LinkedAvlMapNode<K,V> right)
(package private) void	AvlTreeMapImpl.setRoot(LinkedAvlMapNode<K,V> root) Set the root of the tree.
private void	AvlTreeMapImpl.visit(LinkedAvlMapNode<K,V> node, LinkedAvlMapNode<K,V> parentNode)
private void	AvlTreeMapImpl.visit(LinkedAvlMapNode<K,V> node, LinkedAvlMapNode<K,V> parentNode)

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

Modifier and Type	Method and Description
private void	AvlTreeMapImpl.balance(java.util.List<LinkedAvlMapNode<K,V>> 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 void	AvlTreeMapImpl.balanceNodesAfterRemove(java.util.List<LinkedAvlMapNode<K,V>> treePath, LinkedAvlMapNode<K,V> delNode) changes the order of nodes after a delete operation and then balances the tree
private java.util.List<LinkedAvlMapNode<K,V>>	AvlTreeMapImpl.find(K key, LinkedAvlMapNode<K,V> startNode, java.util.List<LinkedAvlMapNode<K,V>> path) Find a LinkedAvlMapNode with the given key value in the tree starting from the startNode.