| Added Classes |
|
BinaryTreeTraverser
|
A variant of TreeTraverser for binary trees, providing additional traversals specific to
binary trees. |
|
EvictingQueue
|
A non-blocking queue which automatically evicts elements from the head of the queue when
attempting to add new elements onto the queue and it is full. |
|
ForwardingSortedMap.StandardKeySet
|
A sensible implementation of SortedMap.keySet in terms of the methods of
{@code ForwardingSortedMap}. |
|
ForwardingSortedMultiset
|
A sorted multiset which forwards all its method calls to another sorted multiset. |
ForwardingSortedMultiset. StandardDescendingMultiset
|
A skeleton implementation of a descending multiset view. |
ForwardingSortedMultiset. StandardElementSet
|
A sensible implementation of SortedMultiset.elementSet in terms of the following
methods: SortedMultiset.clear, SortedMultiset.comparator, SortedMultiset.contains, SortedMultiset.containsAll, SortedMultiset.count,
SortedMultiset.firstEntry SortedMultiset.headMultiset, SortedMultiset.isEmpty, SortedMultiset.lastEntry, SortedMultiset.subMultiset,
SortedMultiset.tailMultiset, the {@code size()} and {@code iterator()} methods of
SortedMultiset.entrySet, and SortedMultiset.remove(Object, int). |
|
TreeTraverser
|
Views elements of a type {@code T} as nodes in a tree, and provides methods to traverse the trees
induced by this traverser. |
| Changed Classes and Interfaces |
|
ArrayTable
|
Fixed-size Table implementation backed by a two-dimensional array. |
|
ConcurrentHashMultiset
|
A multiset that supports concurrent modifications and that provides atomic versions of most
{@code Multiset} operations (exceptions where noted). |
|
Constraint
|
A constraint that an element must satisfy in order to be added to a
collection. |
|
Constraints
|
Factories and utilities pertaining to the Constraint interface. |
|
ContiguousSet
|
A sorted set of contiguous values in a given DiscreteDomain. |
|
DiscreteDomain
|
A descriptor for a discrete {@code Comparable} domain such as all
Integer instances. |
|
FluentIterable
|
{@code FluentIterable} provides a rich interface for manipulating {@code Iterable} instances in a
chained fashion. |
|
ForwardingSortedMap
|
A sorted map which forwards all its method calls to another sorted map. |
|
GenericMapMaker
|
A class exactly like MapMaker, except restricted in the types of maps it can build. |
|
ImmutableCollection
|
An immutable collection. |
|
ImmutableList
|
A high-performance, immutable, random-access {@code List} implementation. |
|
ImmutableList.Builder
|
A builder for creating immutable list instances, especially {@code public
static final} lists ("constant lists"). |
|
ImmutableMultimap
|
An immutable Multimap. |
|
ImmutableRangeMap
|
An immutable implementation of {@code RangeMap}, supporting all query operations efficiently. |
|
ImmutableSet.Builder
|
A builder for creating immutable set instances, especially {@code public
static final} sets ("constant sets"). |
|
ImmutableTable
|
An immutable Table with reliable user-specified iteration order. |
|
LinkedListMultimap
|
An implementation of {@code ListMultimap} that supports deterministic
iteration order for both keys and values. |
|
MapMaker
|
A builder of ConcurrentMap instances having any combination of the following features:
- keys or values automatically wrapped in WeakReference weak or SoftReference soft references
- notification of evicted (or otherwise removed) entries
- on-demand computation of values for keys not already present
|
|
Maps
|
Static utility methods pertaining to Map instances (including instances of
SortedMap, BiMap, etc.). |
|
Multimaps
|
Provides static methods acting on or generating a {@code Multimap}. |
|
Queues
|
Static utility methods pertaining to Queue and Deque instances. |
|
Sets
|
Static utility methods pertaining to Set instances. |
|
TreeBasedTable
|
Implementation of {@code Table} whose row keys and column keys are ordered
by their natural ordering or by supplied comparators. |