|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
Indexer<K> | An index generator for a set of keys. |
Class Summary | |
---|---|
ArrayStack<T> | A Stack implementation based on an array. |
CacheSet<E> | Implements the Set interface, backed by a hash table. |
Containers | Provides utility methods for working with arrays and collections. |
FixedMap<K,V> | A map with a fixed set of keys that acts as an indexer, assigning a unique integer in the range [0..#keys) to each key. |
IdentityHashSet<T> | Implements the Set interface with a hash table, using reference-equality in place of object-equality when comparing elements. |
LinkedStack<T> | A Stack implementation based on a singly linked list. |
SingletonIdentitySet<V> | This is an immutable singleton set implementation that tests for membership using reference-equality in place of object-equality when comparing elements. |
Stack<T> | Represents a last-in-first-out (LIFO) stack of objects. |
Contains specialized collections, such as a set that provides methods for retrieving elements with a particular hashcode.
Contains specialized collections, such as a set that provides methods for retrieving elements with a particular hashcode. It also provides a utility class for working with arrays.
|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |