Package edu.ucla.sspace.util

Interface Summary

Interface	Description
BiMap<K,V>	This interface allows for a bi-directional mapping, where keys can map to values and values can map to keys.
Counter<T>	A utility for counting unique instance of an object.
DoubleEntry	An object that represents an index that has an associated double value.
Generator<T>	An interface for classes which will maintain and generate new instances of classes that require several parameters that will be used consistently several times.
Indexer<T>	A utility class for mapping a set of objects to unique indices.
IntegerEntry	An object that represents an index that has an associated int value.
MultiMap<K,V>	An object that maps a key to one or more values.
NearestNeighborFinder	An interface for utilities that finds the k-nearest neighbors of one or more words in a given SemanticSpace
ObjectEntry<T>	An object that represents an index that has an associated typed Object value.
ResourceFinder	An interface for reader file-based resources regardless of the environment in which the system is operating, e.g.
SortedMultiMap<K,V>	A MultiMap that provides a total ordering for the keys.
SparseArray<T>	A interface for array-like classes that use a sparse internal representation to save space.
SparseNumericArray<T extends Number>	A interface for array-like classes that use a sparse internal representation for numeric values.

Class Summary

Class	Description
ArrayMap<T>	A Map implementation for integer keys, which backed by an array.
BoundedCache<K,V>	A special-purpose Map that acts as an LRU cache for a fixed number of elements.
BoundedSortedMap<K,V>	A Map implementation that grows to a fixed size and then retains only a fixed number of the highest (largest) keys.
BoundedSortedMultiMap<K,V>	A MultiMap implementation that grows to a fixed size and then retains only a fixed number of either keys or mappings.
CharMap<V>	A space-optimized map for associating char keys with values.
ColorGenerator	A utility for generating a random sequence of colors.
CombinedIterator<T>	An Iterator implemntation that combines multiple iterators into a single instance.
CombinedSet<T>
DirectoryWalker	A utility class that allows for easy iteration over all the files within a directory and its subdirectories (but not returning the directories themselves).
DisjointSets<T>
Duple<T,U>	A wrapper for containing two objects of different types.
FileResourceFinder	A ResourceFinder implementation that maps file name to File instances.
GeneratorMap<T>	A Mapping from Strings to object instances created by a Generator.
GrowableArrayList<E>	An ArrayList subclass that will never throw an IndexOutOfBoundsException and instead grow the backing array to match the size of the requested operation.
HashBiMap<K,V>	A HashMap based implementation of a BiMap.
HashIndexer<T>	A utility class for mapping a set of objects to unique indices based on object equality.
HashMultiMap<K,V>	A hash table based implementation of the MultiMap interface.
IndexedCounter<T>	A utility for counting unique instance of an object.
IntegerMap<V>	A space-optimized map for associating integer keys with values, which also doubles as a sparse object array.
IteratorDecorator<T>	A decorator around an existing Iterator that is designed to facilitate subclasses that need to extend the functionality of an existing iterator.
KrippendorffsAlpha
LimitedIterator<T>	An iterator decorator that returns a limited number of string tokens.
LineReader	A utility class for reading the lines of a file.
LoggerUtil	A utility class for setting the logging level output of the S-Space package.
ObjectCounter<T>	A utility for counting unique instance of an object.
ObjectIndexer<T>	A utility class for mapping a set of objects to unique indices based on object equality.
OpenIntSet	A Set implementation specialized for storing int values with efficient storagage and look-up.
Pair<T>	A utility class for holding two of the same type of object.
PairCounter<T>	A utility for counting unique instance of pairs of objects.
PartitioningNearestNeighborFinder	A class for finding the k-nearest neighbors of one or more words.
Properties	A simple wrapper around Properties that provides methods that interpret properties based on the type of the default value.
ReflectionUtil	A collection of miscellaneous, but useful, functions for working with reflection
SemanticSpaceMatrix	A Matrix implementation whose data is backed by a SemanticSpace.
SerializableUtil	A utility class for loading and saving typed Serializable objects from files, streams and readers.
SetDecorator<T>	A wrapper around an existing Set implementation that allows subclasses to modify or extend the functionality of am existing Set instance by overriding some of its methods.
SimpleNearestNeighborFinder	A native NearestNeighborFinder implemetnation for finding the k most-similar words to a provided word in a SemanticSpace using a brute-force search.
SparseDoubleArray	A sparse double array.
SparseHashArray<T>	A sparse array backed by a HashMap.
SparseIntArray	A sparse int array.
SparseIntHashArray	A sparse int array.
SparseLongArray	A sparse long array.
SynchronizedIterator<T>	An Iterator decorator that provides synchronized access to each element.
TimeSpan	A utility class for representing a span of time.
TreeMultiMap<K,V>	A Red-Black tree SortedMultiMap implementation.
TrieMap<V>	A trie-based Map implementation that uses String instances as keys.
TrieSet	A space-efficient set of String instances.
WorkerThread	A daemon thread that continuously dequeues Runnable instances from a queue and executes them.
WorkQueue	A utility class that receives a collection of tasks to execute internally and then distributes the tasks among a thread pool.

Enum Summary

Enum	Description
KrippendorffsAlpha.DifferenceFunction