|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||
See:
Description
| Interface Summary | |
|---|---|
| Filter<T> | Simple interface for an intensional set definition |
| IVector<T> | simple interface for a vector. |
| Class Summary | |
|---|---|
| ArrayIterator<T> | an Iterator of array elements |
| ArrayNonNullIterator<T> | Iterator that only returns non-null elements of the array hasNext() return true when there is a non-null element, false otherwise next() returns the current element and advances the counter up to the next non-null element or beyond the limit of the array |
| BimodalMap<K,V> | This implementation of Map chooses between one of two implementations, depending on the size of the map. |
| CollectionFilter<T> | A filter defined by set membership |
| ComposedIterator<O,I> | A 2-level iterator. |
| CompoundIntIterator | An Iterator which provides a concatenation of two IntIterators. |
| CompoundIterator<T> | An iterator which provides a logical concatenation of the lists from two other iterators |
| EmptyIntIterator | A singleton instance of an empty iterator; this is better than Collections.EMPTY_SET.iterator(), which allocates an iterator object; |
| EmptyIterator<T> | A singleton instance of an empty iterator; this is better than Collections.EMPTY_SET.iterator(), which allocates an iterator object; |
| FifoQueue<T> | FIFO work queue management of Objects that prevents an object from being added to the queue if it is already enqueued and has not yet been popped. |
| FifoQueueNoDuplicates<T> | FIFO work queue management of Objects that prevents an Object from being added to the queue if it was ever previously enqueued. |
| FilterIterator<T> | A FilterIterator filters an Iterator to
generate a new one. |
| Filtersection<T> | intersection of two filters |
| HashCodeComparator<T> | A comparator based on hash codes |
| HashMapFactory | A debugging aid. |
| HashSetFactory | A debugging aid. |
| Heap | Simple Heap data structure. |
| IndiscriminateFilter<T> | A filter that accepts everything. |
| IntMapIterator<T> | An IntMapIterator maps an
Iterator contents to produce a new Iterator |
| IntStack | A stack of integer primitives. |
| Iterator2Collection<T> | Converts an iterator to a collection |
| IteratorPlusOne<T> | A utility to efficiently compose an iterator and a singleton |
| IteratorPlusTwo<T> | |
| IteratorUtil | utilities dealing with Iterators |
| MapIterator<X,Y> | An MapIterator maps an
Iterator contents to produce a new Iterator |
| MapUtil | utilities for managing Maps |
| NonNullSingletonIterator<T> | A singleton iterator for an object which is guaranteed to be not-null. |
| ObjectArrayMapping<T> | A bit set mapping based on an immutable object array. |
| OrFilter<T> | A filter "A or B" |
| Pair<T,U> | |
| ParanoidHashMap<K,V> | a debugging aid. |
| ParanoidHashSet<T> | a debugging aid. |
| ReverseIterator<T> | An iterator that reverses an input iterator. |
| SimpleVector<T> | simple implementation of IVector |
| SmallMap<K,V> | A simple implementation of Map; intended for Maps with few elements. |
| SparseVector<T> | a vector implementation designed for low occupancy. |
| ToStringComparator<T> | A comparator based on lexicographical ordering of toString() |
| TwoLevelVector<T> | a vector implementation which delegates to pages of int vectors. |
Sets and collections
|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||