|
BRUtil - Making Java a Kinder, Gentler, Place to be. |
|||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||
| Interface Summary | |
| Collection | Ron doubts the wisdom or usefulness of having size() implemented by collections. |
| HashFunction | This class provides a HashFunction interface that encapsulates a function that creates a HashCoord from a key object. |
| List | An interface for methods common to any sequence of elements. |
| ListIterator | A uni-directional iterator that moves in the forward direction. |
| Map | Used for associating (key, value) pairs of objects. |
| MultiSet | Same as the Set interface, only a MultiSet may contain more than one instance of a single object. |
| PriorityQueue | |
| Queue | |
| ReverseListIterator | A uni-directional iterator that moves in the reverse direction. |
| Set | |
| SortedMap | |
| SortedMultiSet | |
| SortedSet | |
| Stack | |
| Class Summary | |
| AbstractListing | |
| AbstractMap | |
| AbstractMultiSet | Same as the Set interface, only a MultiSet may contain more than one instance of a single object. |
| AbstractQueue | |
| AbstractSet | |
| AbstractSortedList | |
| AbstractSortedMultiSet | |
| AbstractSortedSet | |
| AbstractStack | |
| Array | This is an automatically-resizing array list. |
| ArrayList | This is circular buffer implementation of a list with a standard java array as the underlying data structure. |
| ArrayMap | Array implementation of the Map interface. |
| ArrayMultiSet | |
| ArrayQueue | |
| ArraySet | |
| ArraySortedSet | |
| ArrayStack | |
| BinaryHeap | |
| BSTree | |
| Entry | |
| Handle | A handle for use with a BinaryHeap. |
| HandlePQ | |
| HashCoord | This class encapsulates the subtable number, and the bucket number, used in a HashMap. |
| HashMap | A HashMap implements the Map interface; therefore its purpose is associating keys and values. |
| HashSet | |
| LinkedList | SinglyLinkedList implementation - caters to the List interface. |
| LinkedMap | |
| LinkedMultiSet | |
| LinkedQueue | |
| LinkedSet | This is a simple version of Set based on a LinkedList. |
| LinkedSortedSet | |
| LinkedStack | |
| MapTestResults | It performs unit timing tests using a HighResTimer upon the get, put, and remove methods. |
| Mutex | |
| NoncyclicReference | |
| PriorityQueueDemo | This class tests the different versions of priority queues for correctness |
| PriorityQueueHeap | PriorityQueue.java Created: Wed Sep 25 16:04:47 2002 |
| PriorityQueueHeapArray | |
| PriorityQueueRadix | |
| RBMap | |
| RBSet | An implementation of the Set interface based on RBTree. |
| ReadWriteMutex | This class uses a Readers-Writers mutex from Doug Lea's book, Concurrent Programming in Java, Second Edition. |
| SetTester | |
| SimpleModHashFunction | This class is a simple HashFunction for use with a RealtimeHashLite. |
| Subarray | Subarrays act as sub-modules for the Array. |
| TreeEntry | |
|
BRUtil - Making Java a Kinder, Gentler, Place to be. |
|||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||