|
UC Berkeley Group for User Interface Research Updated November 17, 2000 |
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
Queue | An interface for a Queue. |
Class Summary | |
DataBuffer | Holds a buffer of bytes that can be resized, compacted, inserted into, removed, sliced, and diced. |
EmptyEnumeration | This is just an enumeration that has no elements. |
EmptyIterator | This is just an Iterator that has no elements. |
HashBag | A bag collection backed by a HashMap. |
HashMapSet | Map from key to a set of objects. |
Map2D | A two-dimensional map whose rows and columns are indexed by arbitrary Java objects (like keys in a Java Map). |
NonlockingStack | A nonlocking version of a stack (list-based). |
NumericalComparator | Compare Number objects. |
ObjectPool | An ObjectPool is a way of reusing objects, in order to avoid garbage collection. |
OrderedList | A linked list with lots of extra functionality, including:
OrderedList.getForwardIterator()
OrderedList.getReverseIterator()
OrderedList.swap(int, int)
OrderedList.moveTo(int, int)
OrderedList.moveToFront(int)
OrderedList.moveToBack(int)
|
QueueDynamicSize | A dynamically resizable queue. |
QueueFixedSize | A statically sized queue that does not resize itself. |
SortedValueMap | A Map with any kind of uniquely named Keys with numerical Values, sorted by the values rather than by the keys. |
SortedValueNumMap | A Map with any kind of uniquely named Keys with numerical Values, sorted by the values (not by keys). |
WeakHashSet | Like a WeakHashMap, except that it's a set. |
Exception Summary | |
EmptyException | Data structure is empty. |
FullException | Data structure is full. |
Various collections that aren't provided by Java 1.2. Check the date on the files, since some were written when JDK1.0.2 was new.
This software is distributed under the Berkeley Software License. This software is part of the GUIRLib package.
|
Copyright Information | |||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |