Package kodkod.util.ints

Provides implementations of ordered collections for storing integer primitives.

See: Description

Interface Summary

Interface	Description
IndexedEntry<E>	An entry in a sparse sequence.
IntCollection	The root interface in the int collection hierarchy.
IntIterator	An iterator over integer primitives.
IntSet	An ordered set of integers.
IntVector	A resizable array of integers.
SparseSequence<V>	Represents a sparse sequence -- a sequence whose indices are not necessarily contiguous.

Class Summary

Class	Description
AbstractIntCollection	A skeletal implementation of the IntCollection interface.
AbstractIntSet	A skeletal implementation of the IntSet interface.
AbstractIntVector	A skeletal implementation of the IntVector interface.
AbstractSparseSequence<V>	A skeletal implementation of the SparseSequence interface.
ArrayIntSet	An immutable set of integers, stored in a sorted array.
ArrayIntVector	A mutable implementation of the IntVector interface.
ArraySequence<V>	An implementation of a sparse sequence based on an array.
HomogenousSequence<V>	A sparse sequence implementation based on an IntSet.
IntBitSet	An implementation of the IntSet interface based on a bit map.
IntRange	Represents a range of integers, [min..max].
Ints	Contains various utility methods for working with integers, IntRanges, IntSets, and SparseSequences.
IntTreeSet	An implementation of the IntTreeSet interface based on a balanced binary search tree.
RangeSequence<V>	A tree-based sparse sequence implementation.
TreeSequence<V>	An implementation of a sparse sequence based on a balanced binary search tree.

Package kodkod.util.ints Description

Provides implementations of ordered collections for storing integer primitives.

Package Specification

Provides several implementations of ordered collections for storing integer primitives.

Related Documentation

See Also:

IntSet, IntVector, SparseSequence