|
Generated by JDiff |
||||||
PREV PACKAGE NEXT PACKAGE FRAMES NO FRAMES | DETAIL: REMOVED | ADDED | CHANGED |
Removed Classes | |
|
A variant of TreeTraverser for binary trees, providing additional traversals specific to binary trees. |
Changed Classes | |
|
A multiset that supports concurrent modifications and that provides atomic versions of most {@code Multiset} operations (exceptions where noted). |
|
Multiset implementation specialized for enum elements, supporting all single-element operations in O(1). |
|
A sensible implementation of Multiset.elementSet in terms of the following methods: ForwardingMultiset.clear, ForwardingMultiset.contains, ForwardingMultiset.containsAll, ForwardingMultiset.count, ForwardingMultiset.isEmpty, the Set.size and Set.iterator methods of ForwardingMultiset.entrySet, and ForwardingMultiset.remove(Object, int). |
|
Multiset implementation that uses hashing for key and entry access. |
|
A multiset which maintains the ordering of its elements, according to either their natural order or an explicit Comparator. |
|
|||||||
PREV PACKAGE NEXT PACKAGE FRAMES NO FRAMES |