See: Description
| Interface | Description |
|---|---|
| Collection4D<E> |
Interface that represents a collection of objects.
|
| Comparable |
Comparable interface that must be implemented by Objects that can be compared to another one.
|
| Comparator4D<T> |
Interface for objects that specify an ordering between objects.
|
| Deque4D<E> |
A linear collection that supports element insertion and removal at
both ends.
|
| Enumeration4D<E> |
Interface for lists of objects that can be returned in sequence.
|
| Iterator4D<E> |
An object which iterates over a collection.
|
| List4D<E> |
An ordered collection (also known as a list).
|
| ListIterator4D<E> |
An extended version of Iterator to support the extra features of Lists.
|
| Map4D<K,V> |
An object that maps keys onto values.
|
| Map4D.Entry<K,V> |
A map entry (key-value pair).
|
| NavigableMap4D<K,V> |
A
SortedMap extended with navigation methods returning the
closest matches for given search targets. |
| NavigableSet4D<E> |
A
SortedSet extended with navigation methods reporting
closest matches for given search targets. |
| Queue4D<E> |
A collection designed for holding elements prior to processing.
|
| RandomAccess4D |
Marker interface used to inform
List implementations that
they support fast (usually constant time) random access. |
| Set4D<E> |
A collection that contains no duplicates.
|
| SortedMap4D<K,V> |
A map which guarantees its key's iteration order.
|
| SortedSet4D<E> |
A set which guarantees its iteration order.
|
| Class | Description |
|---|---|
| AbstractCollection4D<E> |
A basic implementation of most of the methods in the Collection interface to
make it easier to create a collection.
|
| AbstractList4D<E> |
A basic implementation of most of the methods in the List interface to make
it easier to create a List based on a random-access data structure.
|
| AbstractMap4D<K,V> |
An abstract implementation of Map to make it easier to create your own
implementations.
|
| AbstractMap4D.SimpleEntry<K,V> |
A class which implements Map.Entry.
|
| AbstractMap4D.SimpleImmutableEntry<K,V> |
A class containing an immutable key and value.
|
| AbstractQueue4D<E> |
This class provides skeletal implementations of some
Queue
operations. |
| AbstractSequentialList4D<E> |
Abstract superclass to make it easier to implement the List interface when
backed by a sequential-access store, such as a linked list.
|
| AbstractSet4D<E> |
An abstract implementation of Set to make it easier to create your own
implementations.
|
| ArrayList4D<E> |
An array-backed implementation of the List interface.
|
| Arrays4D |
This class contains various static utility methods performing operations on
arrays, and a method to provide a List "view" of an array to facilitate
using arrays with Collection-based APIs.
|
| BigDecimal |
Arbitrary-precision signed decimal numbers.
|
| BigInteger |
Written using on-line Java Platform 1.2 API Specification, as well as "The Java class libraries", 2nd edition
(Addison-Wesley, 1998) and "Applied Cryptography, Second Edition" by Bruce Schneier (Wiley, 1996).
|
| BitSet4D |
This class can be thought of in two ways.
|
| Collections4D |
Utility class consisting of static methods that operate on, or return
Collections.
|
| Date |
The Date class is a general date data type(Object) that is similar to those built in to other languages.
|
| Dictionary4D<K,V> |
A Dictionary maps keys to values; how it does that is
implementation-specific.
|
| Enum |
Class used to simulate an enumeration.
|
| EnumMap4D<K extends java.lang.Enum<K>,V> | |
| EnumSet4D<T extends java.lang.Enum<T>> |
Provides an efficient mechanism for recording a set of enumeration
constants.
|
| HashMap4D<K,V> |
This class provides a hashtable-backed implementation of the
Map interface.
|
| HashSet4D<T> |
This class provides a HashMap-backed implementation of the Set interface.
|
| Hashtable |
This class implements a hash table, which maps keys to values.
|
| Hashtable.Entry |
Hashtable collision list.
|
| Hashtable4D<K,V> |
A class which implements a hashtable data structure.
|
| I18N |
I18N is entity that supports internationalized applications.
|
| IdentityHashMap4D<K,V> |
This class provides a hashtable-backed implementation of the
Map interface, but uses object identity to do its hashing.
|
| IntHashtable |
This class implements a hashtable, which maps keys to values.
|
| IntHashtable.Entry |
Hashtable collision list.
|
| IntVector |
An int vector is an array of int's.
|
| IOUtils |
Largely based on Apache IOUtils
Only needed methods copied, like copy InputStream -> OutoutStream and copy Reader -> Writer
Javadoc maintained where possible, but the "since" tag was largely removed
|
| LangTag |
Language tags: support for parsing and canonicalization of case.
|
| LinkedHashMap4D<K,V> |
This class provides a hashtable-backed implementation of the
Map interface, with predictable traversal order.
|
| LinkedHashSet4D<T> |
This class provides a hashtable-backed implementation of the
Set interface, with predictable traversal order.
|
| LinkedList4D<T> |
Linked list implementation of the List interface.
|
| Logger |
A Logger object is used to log messages for a specific system or application
component.
|
| Objects | |
| PriorityQueue4D<E> | |
| Properties |
Used to store properties pairs (key,value).
|
| Properties.Boolean |
Implements a value of type boolean
|
| Properties.Double |
Implements a value of type double
|
| Properties.Int |
Implements a value of type int
|
| Properties.Long |
Implements a value of type long
|
| Properties.Str |
Implements a value of type String
|
| Properties.Value |
Represents a generic value that can be stored here.
|
| Random |
This is a simple Linear Congruential Generator which
produces random numbers in the range [0,2^31), derived
from ran0 in Numerical Recipies.
|
| Stack4D<T> | |
| StringUtils | |
| TreeMap4D<K,V> |
This class provides a red-black tree implementation of the SortedMap
interface.
|
| TreeSet4D<T> |
This class provides a TreeMap-backed implementation of the SortedSet
interface.
|
| UnitsConverter | |
| Vector |
A vector is an array of object references.
|
| Vector4D<T> |
The
Vector classes implements growable arrays of Objects. |
| Exception | Description |
|---|---|
| ConcurrentModificationException4D |
Exception that is thrown by the collections classes when it is detected that
a modification has been made to a data structure when this is not allowed,
such as when a collection is structurally modified while an Iterator is
operating over it.
|
| ElementNotFoundException |
Thrown when an element of a Vector or a Hashtable is not found.
|
| EmptyStackException4D |
This exception is thrown by the Stack class when an attempt is made to pop
or otherwise access elements from an empty stack.
|
| IntHashtable.DuplicatedKeyException |
Exception thrown when allowDuplicateKeys is set to false.
|
| InvalidDateException |
Represents a date that is invalid.
|
| NoSuchElementException4D |
Exception thrown when an attempt is made to access an element that does not
exist.
|
| NotInstalledException |