Package jsat.utils

Class Summary

Class	Description
ArrayUtils	Extra utilities for working on array types
BoundedSortedList<E extends Comparable<E>>
BoundedSortedSet<V>	A Sorted set that has a maximum number of values it will hold.
ClosedHashingUtil	This class provides some useful methods and utilities for implementing Closed Hashing structures
DoubleList	Provides a modifiable implementation of a List using a double array.
FakeExecutor	Provides a fake ExecutorService that immediatly runs any given runnable on the main thread.
FibHeap<T>
FibHeap.FibNode<T>
GridDataGenerator	This is a utility to generate data in a grid fashion.
IndexTable	The index table provides a way of accessing the sorted view of an array or list, without ever sorting the elements of said list.
IntDoubleMap	A hash map for storing the primitive types of integers (as keys) to doubles (as table).
IntDoubleMapArray	Provides a map from integers to doubles backed by index into an array.
IntList	Provides a modifiable implementation of a List using a int array.
IntPriorityQueue	This class represents a priority queue specifically designed to contain integer keys, and uses less memory then a PriorityQueue filled with integers.
IntSet	A utility class for efficiently storing a set of integers.
IntSetFixedSize	A set for integers that is of a fixed initial size, and can only accept integers in the range [0, size).
IntSortedSet	A utility class for efficiently storing a set of integers.
IterableIterator<T>	Convenience object for being able to use the for each loop on an iterator.
ListUtils
LongDoubleMap	A hash map for storing the primitive types of long (as keys) to doubles (as table).
LongList	Provides a modifiable implementation of a List using an array of longs.
ModifiableCountDownLatch	Provides a CountDownLatch that can have the number of counts increased as well as decreased.
Pair<X,Y>	A simple object to hold a pair of values
PairedReturn<T,V>	Utility class that allows the returning of 2 different objects as one.
PoisonRunnable	A helper class for using the reader / writer model to implement parallel algorithms.
ProbailityMatch<T>	Class allows the arbitrary association of some object type with a probability.
QuickSort	Provides implementations of quicksort.
RunnableConsumer	The RunnableConsumer is meant to be used in conjunction with PoisonRunnable and an ExecutorService to implement a consumer / produce model.
SimpleList<E>	An alternative implementation of an ArrayList.
SortedArrayList<T extends Comparable<T>>
StringUtils
SystemInfo	This class provides Static system information that may be useful for algorithms that want to adjust their behavior based on the system's hardware information.
Tuple3<X,Y,Z>
UnionFind<X>

Enum Summary

Enum	Description
IntPriorityQueue.Mode	Sets the mode used for the priority queue.