Package | Description |
---|---|
org.apache.directory.server.core.avltree |
Modifier and Type | Method and Description |
---|---|
LinkedAvlNode<K> |
AvlTree.find(K key)
Find a LinkedAvlNode with the given key value in the tree.
|
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.findGreater(K key)
Finds a LinkedAvlNode whose key is higher than the given key.
|
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.findGreaterOrEqual(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.findLess(K key)
Finds a LinkedAvlNode whose key is lower 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.findLessOrEqual(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.getFirst() |
LinkedAvlNode<K> |
AvlTreeImpl.getFirst() |
LinkedAvlNode<K> |
AvlTreeSingleton.getFirst() |
LinkedAvlNode<K> |
AvlTree.getLast() |
LinkedAvlNode<K> |
AvlTreeImpl.getLast() |
LinkedAvlNode<K> |
AvlTreeSingleton.getLast() |
LinkedAvlNode<T> |
LinkedAvlNode.getLeft() |
LinkedAvlNode<T> |
LinkedAvlNode.getNext() |
LinkedAvlNode<T> |
LinkedAvlNode.getPrevious() |
LinkedAvlNode<T> |
LinkedAvlNode.getRight() |
LinkedAvlNode<K> |
AvlTree.getRoot() |
LinkedAvlNode<K> |
AvlTreeImpl.getRoot() |
LinkedAvlNode<K> |
AvlTreeSingleton.getRoot() |
LinkedAvlNode<E> |
AvlTreeMarshaller.readTree(DataInputStream in,
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].
|
Modifier and Type | Method and Description |
---|---|
LinkedAvlNode<E> |
AvlTreeMarshaller.readTree(DataInputStream in,
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].
|
void |
LinkedAvlNode.setLeft(LinkedAvlNode<T> left) |
void |
LinkedAvlNode.setNext(LinkedAvlNode<T> next) |
void |
LinkedAvlNode.setPrevious(LinkedAvlNode<T> previous) |
void |
LinkedAvlNode.setRight(LinkedAvlNode<T> right) |
Copyright © 2003–2020 The Apache Software Foundation. All rights reserved.