Uses of Class
org.apache.commons.collections4.bidimap.TreeBidiMap.Node
Packages that use TreeBidiMap.Node
Package
Description
-
Uses of TreeBidiMap.Node in org.apache.commons.collections4.bidimap
Fields in org.apache.commons.collections4.bidimap declared as TreeBidiMap.NodeModifier and TypeFieldDescription(package private) TreeBidiMap.Node
<K, V> TreeBidiMap.ViewIterator.lastReturnedNode
The last node returned by the iterator.private final TreeBidiMap.Node<K,
V>[] TreeBidiMap.Node.leftNode
private TreeBidiMap.Node
<K, V> TreeBidiMap.ViewIterator.nextNode
The next node to be returned by the iterator.private final TreeBidiMap.Node<K,
V>[] TreeBidiMap.Node.parentNode
private TreeBidiMap.Node
<K, V> TreeBidiMap.ViewIterator.previousNode
The previous node in the sequence returned by the iterator.private final TreeBidiMap.Node<K,
V>[] TreeBidiMap.Node.rightNode
private TreeBidiMap.Node<K,
V>[] TreeBidiMap.rootNode
Methods in org.apache.commons.collections4.bidimap that return TreeBidiMap.NodeModifier and TypeMethodDescriptionprivate TreeBidiMap.Node
<K, V> TreeBidiMap.getGrandParent
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get a node's grandparent.private TreeBidiMap.Node
<K, V> TreeBidiMap.Node.getLeft
(TreeBidiMap.DataElement dataElement) private TreeBidiMap.Node
<K, V> TreeBidiMap.getLeftChild
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get a node's left child.private TreeBidiMap.Node
<K, V> TreeBidiMap.getParent
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get a node's parent.private TreeBidiMap.Node
<K, V> TreeBidiMap.Node.getParent
(TreeBidiMap.DataElement dataElement) Get the parent node.private TreeBidiMap.Node
<K, V> TreeBidiMap.Node.getRight
(TreeBidiMap.DataElement dataElement) private TreeBidiMap.Node
<K, V> TreeBidiMap.getRightChild
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get a node's right child.private TreeBidiMap.Node
<K, V> TreeBidiMap.greatestNode
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) Find the greatest node from a given node.private TreeBidiMap.Node
<K, V> TreeBidiMap.leastNode
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) Find the least node from a given node.private <T extends Comparable<T>>
TreeBidiMap.Node<K, V> TreeBidiMap.lookup
(Object data, TreeBidiMap.DataElement dataElement) do the actual lookup of a piece of dataprivate TreeBidiMap.Node
<K, V> private TreeBidiMap.Node
<K, V> TreeBidiMap.lookupValue
(Object value) protected TreeBidiMap.Node
<K, V> TreeBidiMap.ViewIterator.navigateNext()
protected TreeBidiMap.Node
<K, V> TreeBidiMap.ViewIterator.navigatePrevious()
private TreeBidiMap.Node
<K, V> TreeBidiMap.nextGreater
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get the next larger node from the specified nodeprivate TreeBidiMap.Node
<K, V> TreeBidiMap.nextSmaller
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get the next larger node from the specified nodeMethods in org.apache.commons.collections4.bidimap with parameters of type TreeBidiMap.NodeModifier and TypeMethodDescriptionprivate void
TreeBidiMap.copyColor
(TreeBidiMap.Node<K, V> from, TreeBidiMap.Node<K, V> to, TreeBidiMap.DataElement dataElement) copy the color from one node to another, dealing with the fact that one or both nodes may, in fact, be nullprivate void
TreeBidiMap.Node.copyColor
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) Make this node the same color as anotherTreeBidiMap.InverseViewMapEntryIterator.createEntry
(TreeBidiMap.Node<K, V> node) private void
TreeBidiMap.doRedBlackDelete
(TreeBidiMap.Node<K, V> deletedNode) complicated red-black delete stuff.private void
TreeBidiMap.doRedBlackDeleteFixup
(TreeBidiMap.Node<K, V> replacementNode, TreeBidiMap.DataElement dataElement) complicated red-black delete stuff.private void
TreeBidiMap.doRedBlackInsert
(TreeBidiMap.Node<K, V> insertedNode, TreeBidiMap.DataElement dataElement) complicated red-black insert stuff.private TreeBidiMap.Node
<K, V> TreeBidiMap.getGrandParent
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get a node's grandparent.private TreeBidiMap.Node
<K, V> TreeBidiMap.getLeftChild
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get a node's left child.private TreeBidiMap.Node
<K, V> TreeBidiMap.getParent
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get a node's parent.private TreeBidiMap.Node
<K, V> TreeBidiMap.getRightChild
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get a node's right child.private TreeBidiMap.Node
<K, V> TreeBidiMap.greatestNode
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) Find the greatest node from a given node.private void
TreeBidiMap.insertValue
(TreeBidiMap.Node<K, V> newNode) insert a node by its valueprivate static boolean
TreeBidiMap.isBlack
(TreeBidiMap.Node<?, ?> node, TreeBidiMap.DataElement dataElement) is the specified black red? if the node does not exist, sure, it's black, thank youprivate static boolean
TreeBidiMap.isRed
(TreeBidiMap.Node<?, ?> node, TreeBidiMap.DataElement dataElement) is the specified node red? if the node does not exist, no, it's black, thank youprivate TreeBidiMap.Node
<K, V> TreeBidiMap.leastNode
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) Find the least node from a given node.private static void
TreeBidiMap.makeBlack
(TreeBidiMap.Node<?, ?> node, TreeBidiMap.DataElement dataElement) force a node (if it exists) blackprivate static void
TreeBidiMap.makeRed
(TreeBidiMap.Node<?, ?> node, TreeBidiMap.DataElement dataElement) force a node (if it exists) redprivate TreeBidiMap.Node
<K, V> TreeBidiMap.nextGreater
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get the next larger node from the specified nodeprivate TreeBidiMap.Node
<K, V> TreeBidiMap.nextSmaller
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) get the next larger node from the specified nodeprivate void
TreeBidiMap.rotateLeft
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) do a rotate left.private void
TreeBidiMap.rotateRight
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) do a rotate right.private void
TreeBidiMap.Node.setLeft
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) private void
TreeBidiMap.Node.setParent
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) Set this node's parent node.private void
TreeBidiMap.Node.setRight
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) private void
TreeBidiMap.Node.swapColors
(TreeBidiMap.Node<K, V> node, TreeBidiMap.DataElement dataElement) Exchange colors with another node.private void
TreeBidiMap.swapPosition
(TreeBidiMap.Node<K, V> x, TreeBidiMap.Node<K, V> y, TreeBidiMap.DataElement dataElement) swap two nodes (except for their content), taking care of special cases where one is the other's parent ...