Uses of Enum
org.apache.commons.collections4.bidimap.TreeBidiMap.DataElement

Packages that use TreeBidiMap.DataElement

Package	Description
org.apache.commons.collections4.bidimap	This package contains implementations of the BidiMap, OrderedBidiMap and SortedBidiMap interfaces.

Uses of TreeBidiMap.DataElement in org.apache.commons.collections4.bidimap

Fields in org.apache.commons.collections4.bidimap declared as TreeBidiMap.DataElement

Modifier and Type	Field	Description
(package private) final TreeBidiMap.DataElement	TreeBidiMap.View.orderType	Whether to return KEY or VALUE order.
private final TreeBidiMap.DataElement	TreeBidiMap.ViewIterator.orderType	Whether to return KEY or VALUE order.

Methods in org.apache.commons.collections4.bidimap that return TreeBidiMap.DataElement

Modifier and Type	Method	Description
static TreeBidiMap.DataElement	TreeBidiMap.DataElement.valueOf(String name)	Returns the enum constant of this type with the specified name.
static TreeBidiMap.DataElement[]	TreeBidiMap.DataElement.values()	Returns an array containing the constants of this enum type, in the order they are declared.

Methods in org.apache.commons.collections4.bidimap with parameters of type TreeBidiMap.DataElement

Modifier and Type	Method	Description
private static void	TreeBidiMap.checkNonNullComparable(Object o, TreeBidiMap.DataElement dataElement)	check if an object is fit to be proper input ...
private 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 null
private void	TreeBidiMap.Node.copyColor(TreeBidiMap.Node<K,V> node, TreeBidiMap.DataElement dataElement)	Make this node the same color as another
private boolean	TreeBidiMap.doEquals(Object obj, TreeBidiMap.DataElement dataElement)	Compares for equals as per the API.
private int	TreeBidiMap.doHashCode(TreeBidiMap.DataElement dataElement)	Gets the hash code value for this map as per the API.
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 String	TreeBidiMap.doToString(TreeBidiMap.DataElement dataElement)	Gets the string form of this map as per AbstractMap.
private Object	TreeBidiMap.Node.getData(TreeBidiMap.DataElement dataElement)
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.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 MapIterator<?,?>	TreeBidiMap.getMapIterator(TreeBidiMap.DataElement dataElement)
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 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 you
private boolean	TreeBidiMap.Node.isBlack(TreeBidiMap.DataElement dataElement)	Is this node black?
private boolean	TreeBidiMap.Node.isLeftChild(TreeBidiMap.DataElement dataElement)
private 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 you
private boolean	TreeBidiMap.Node.isRed(TreeBidiMap.DataElement dataElement)	Is this node red?
private boolean	TreeBidiMap.Node.isRightChild(TreeBidiMap.DataElement dataElement)
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 data
private static void	TreeBidiMap.makeBlack(TreeBidiMap.Node<?,?> node, TreeBidiMap.DataElement dataElement)	force a node (if it exists) black
private static void	TreeBidiMap.makeRed(TreeBidiMap.Node<?,?> node, TreeBidiMap.DataElement dataElement)	force a node (if it exists) red
private TreeBidiMap.Node<K,V>	TreeBidiMap.nextGreater(TreeBidiMap.Node<K,V> node, TreeBidiMap.DataElement dataElement)	get the next larger node from the specified node
private TreeBidiMap.Node<K,V>	TreeBidiMap.nextSmaller(TreeBidiMap.Node<K,V> node, TreeBidiMap.DataElement dataElement)	get the next larger node from the specified node
private 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.setBlack(TreeBidiMap.DataElement dataElement)	Make this node black.
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.setRed(TreeBidiMap.DataElement dataElement)	Make this node red.
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 ...

Constructors in org.apache.commons.collections4.bidimap with parameters of type TreeBidiMap.DataElement

Modifier	Constructor	Description
	InverseViewMapIterator(TreeBidiMap.DataElement orderType)	Create a new TreeBidiMap.InverseViewMapIterator.
	KeyView(TreeBidiMap.DataElement orderType)	Create a new TreeBidiMap.KeyView.
	ValueView(TreeBidiMap.DataElement orderType)	Create a new TreeBidiMap.ValueView.
(package private)	View(TreeBidiMap.DataElement orderType)	Constructor.
(package private)	ViewIterator(TreeBidiMap.DataElement orderType)	Constructor.
(package private)	ViewMapIterator(TreeBidiMap.DataElement orderType)	Constructor.