private static final class TreeMultiset.AvlNode<E>
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
private int |
distinctElements |
private E |
elem |
private int |
elemCount |
private int |
height |
private TreeMultiset.AvlNode<E> |
left |
private TreeMultiset.AvlNode<E> |
pred |
private TreeMultiset.AvlNode<E> |
right |
private TreeMultiset.AvlNode<E> |
succ |
private long |
totalCount |
Modifier and Type | Method and Description |
---|---|
(package private) TreeMultiset.AvlNode<E> |
add(java.util.Comparator<? super E> comparator,
E e,
int count,
int[] result) |
private TreeMultiset.AvlNode<E> |
addLeftChild(E e,
int count) |
private TreeMultiset.AvlNode<E> |
addRightChild(E e,
int count) |
private int |
balanceFactor() |
private TreeMultiset.AvlNode<E> |
ceiling(java.util.Comparator<? super E> comparator,
E e) |
int |
count(java.util.Comparator<? super E> comparator,
E e) |
private TreeMultiset.AvlNode<E> |
deleteMe() |
private TreeMultiset.AvlNode<E> |
floor(java.util.Comparator<? super E> comparator,
E e) |
(package private) int |
getCount() |
(package private) E |
getElement() |
private static int |
height(TreeMultiset.AvlNode<?> node) |
private TreeMultiset.AvlNode<E> |
rebalance() |
private void |
recompute() |
private void |
recomputeHeight() |
private void |
recomputeMultiset() |
(package private) TreeMultiset.AvlNode<E> |
remove(java.util.Comparator<? super E> comparator,
E e,
int count,
int[] result) |
private TreeMultiset.AvlNode<E> |
removeMax(TreeMultiset.AvlNode<E> node) |
private TreeMultiset.AvlNode<E> |
removeMin(TreeMultiset.AvlNode<E> node) |
private TreeMultiset.AvlNode<E> |
rotateLeft() |
private TreeMultiset.AvlNode<E> |
rotateRight() |
(package private) TreeMultiset.AvlNode<E> |
setCount(java.util.Comparator<? super E> comparator,
E e,
int count,
int[] result) |
(package private) TreeMultiset.AvlNode<E> |
setCount(java.util.Comparator<? super E> comparator,
E e,
int expectedCount,
int newCount,
int[] result) |
java.lang.String |
toString() |
private static long |
totalCount(TreeMultiset.AvlNode<?> node) |
private final E elem
private int elemCount
private int distinctElements
private long totalCount
private int height
private TreeMultiset.AvlNode<E> left
private TreeMultiset.AvlNode<E> right
private TreeMultiset.AvlNode<E> pred
private TreeMultiset.AvlNode<E> succ
AvlNode(E elem, int elemCount)
private TreeMultiset.AvlNode<E> addRightChild(E e, int count)
private TreeMultiset.AvlNode<E> addLeftChild(E e, int count)
TreeMultiset.AvlNode<E> add(java.util.Comparator<? super E> comparator, E e, int count, int[] result)
TreeMultiset.AvlNode<E> remove(java.util.Comparator<? super E> comparator, E e, int count, int[] result)
TreeMultiset.AvlNode<E> setCount(java.util.Comparator<? super E> comparator, E e, int count, int[] result)
TreeMultiset.AvlNode<E> setCount(java.util.Comparator<? super E> comparator, E e, int expectedCount, int newCount, int[] result)
private TreeMultiset.AvlNode<E> deleteMe()
private TreeMultiset.AvlNode<E> removeMin(TreeMultiset.AvlNode<E> node)
private TreeMultiset.AvlNode<E> removeMax(TreeMultiset.AvlNode<E> node)
private void recomputeMultiset()
private void recomputeHeight()
private void recompute()
private TreeMultiset.AvlNode<E> rebalance()
private int balanceFactor()
private TreeMultiset.AvlNode<E> rotateLeft()
private TreeMultiset.AvlNode<E> rotateRight()
private static long totalCount(TreeMultiset.AvlNode<?> node)
private static int height(TreeMultiset.AvlNode<?> node)
private TreeMultiset.AvlNode<E> ceiling(java.util.Comparator<? super E> comparator, E e)
private TreeMultiset.AvlNode<E> floor(java.util.Comparator<? super E> comparator, E e)
E getElement()
int getCount()
public java.lang.String toString()
toString
in class java.lang.Object