|
Class Summary |
| AbstractHashMapRVM<K,V> |
Common super class for all VM hash maps. |
| AbstractHashMapRVM.AbstractBucket<K,V> |
|
| AbstractHashSetRVM<T> |
Common super class for all VM hash sets. |
| AbstractHashSetRVM.AbstractBucket<T> |
|
| AddressInputStream |
Access raw memory region as an input stream. |
| BitVector |
Implements a bit vector. |
| EmptyEnumeration<E> |
Implements an empty enumeration. |
| EmptyIterator<T> |
A generic iterator containing no items. |
| HashMapRVM<K,V> |
Stripped down implementation of HashMap data structure for use
by core parts of the JikesRVM runtime. |
| HashMapRVM.Bucket<K,V> |
|
| HashSetRVM<T> |
Stripped down implementation of HashSet for use
by core parts of the JikesRVM runtime. |
| HashSetRVM.Bucket<T> |
|
| IdentityHashMapRVM<K,V> |
The same as HashMapRVM except object identities determine equality
not the equals method. |
| ImmutableEntryHashMapRVM<K,V> |
A hash map with entirely immutable buckets. |
| ImmutableEntryHashMapRVM.Bucket<K,V> |
|
| ImmutableEntryHashSetRVM<T> |
A hash set with entirely immutable buckets. |
| ImmutableEntryHashSetRVM.Bucket<T> |
|
| ImmutableEntryIdentityHashMapRVM<K,V> |
A hash map with entirely immutable buckets. |
| LinkedListIteratorRVM<T> |
|
| LinkedListRVM<T> |
Implementation of java.util.LinkedList for use in classes that
end up in the boot image. |
| LinkedListRVM.Element<T> |
Class for the actual elements of the list. |
| Pair<X,Y> |
|
| PriorityQueueRVM |
This class implements a priority queue using the standard
(balanced partially-ordered tree, i.e., "heap") algorithm. |
| PriorityQueueRVM.PriorityQueueNode |
A local class that holds the nodes of the priority tree |
| StringUtilities |
|