|
TUM CCSM Commons | |||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
See:
Description
| Interface Summary | |
|---|---|
| IIdProvider<I,T> | This interface defines an ID provider. |
| ISortableData | Abstraction for sortable/comparable data. |
| Class Summary | |
|---|---|
| AllEqualComparator<T> | Comparator that does not acutally compare but handles all elements as being equal. |
| ArrayBackedMap<K,V> | A map implementation based on unsorted arrays. |
| ArrayBackedStringMap<V> | A specialization of the array backed map for string keys. |
| ArrayUtils | Utility methods for arrays. |
| BidirectionalMap<S,T> | A collection which implements a bidirectional mapping. |
| ClassHierarchyMap<T,V> | This class provides a mapping from classes to values. |
| CollectionUtils | This class offers utility methods for collections. |
| CounterSet<E> | This class manages a set of counters (i.e. is a mapping from some key objects to integers). |
| HashedListMap<K,I> | This class defines a mapping from on item to a list of items. |
| HybridMapBase<K,V> | A hybrid map is a map which starts with one map implementation, but switches to another one after a certain size is reached. |
| IdComparator<I extends Comparable<I>,T> | Comparator that compares objects based on the identifiers provided by a
IIdProvider. |
| IdentifierBasedComparatorBase<I extends Comparable<I>,T> | Base class for comparators that compare to objects by comparing a suitable object identifier. |
| IdentityHashSet<E> | This class implements a set based on referential equality similar to JDK
class IdentityHashMap. |
| IdentityPairMap<T,V> | A map using (unordered) pairs as key which are compared by reference. |
| IdManager<K> | This class assigns unique ids to objects. |
| IdManagerBase<K> | Base class for id managers. |
| ImmutablePair<S,T> | Simple readonly pair class. |
| IntList | A really simple list for storing ints. |
| InvertingComparator<E> | This works on another compartor and inverts it. |
| ManagedIntArray | A class containing an int array that is managed in the sense that it can grow dynamically (using exponential growth). |
| MemoryEfficientStringMap<V> | A map implementation of a map using string keys. |
| Pair<S,T> | Simple pair class. |
| PairList<S,T> | A list for storing pairs in a specific order. |
| SortableDataUtils | Abstraction for sortable/comparable data. |
| SortedCounterSet<E extends Comparable<? super E>> | A counter set supporting ranged access to its values, i.e. it is possible to query the sum of values for all keys in a given range. |
| StringLengthComparator | Compares strings by their length. |
| ToStringComparator | This comparator compares objects by their toString() representation. |
| TwoDimHashMap<K1,K2,I> | A 2-dimensional hash map. |
| UniqueIdManager<K> | This class assigns unique ids to objects. |
| UnmodifiableCollection<E> | This is a wrapper for a Collection prohibiting all calls which would
modify its contents. |
| UnmodifiableHashedListMap<K,I> | This is a wrapper for a HashedListMap prohibiting all calls that
would modify its contents. |
| UnmodifiableIterator<E> | This is a wrapper for a Iterator prohibiting all calls which would
modify its owning container. |
| UnmodifiableList<E> | This is a wrapper for a List prohibiting all calls which would modify
its contents. |
| UnmodifiableListIterator<T> | This is a wrapper for a ListIterator prohibiting all calls which
would modify its owning container. |
| UnmodifiableMap<K,V> | This is a wrapper for a Map prohibiting all calls which would modify
its contents. |
| UnmodifiableSet<E> | This is a wrapper for a Set prohibiting all calls which would modify
its contents. |
| UnmodifiableSortedMap<K,V> | This is a wrapper for a SortedMap prohibiting all calls which would
modify its contents. |
| UnmodifiableSortedSet<E> | This is a wrapper for a SortedSet prohibiting all calls which would
modify its contents. |
Extensions to the Java collections.
|
TUM CCSM Commons | |||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||