Package common

Interface Summary
DGraph A directed graph.
Heap Collection with an extractMin for efficiently getting the minimum-cost element.
Heap.Entry Interface for entries in a heap.
IndexedMultiMap Extension of the MultiMap interface in which the get returns an IndexedSet.
IndexedSet Data structure that behaves like a set, except that its elements also have consecutive indices starting at zero.
IndexedSetDiff Interface for objects that implement both the IndexedSet and the SetDiff interfaces.
IndexedSortedSet Interface for collections that implement both IndexedSet and SortedSet.
IntegerDist  
MapDiff A map that is represented as a set of changes to some underlying map.
MapWithPreimages An extension of the Map interface that provides efficient access to the pre-image of a value in the map.
MultiMap A map where keys are mapped to non-empty Set objects.
MultiMapDiff A MultiMap that is represented as a set of changes to some underlying MultiMap.
Multiset A multiset is like a set, except that it can include multiple copies of an element.
Multiset.Entry Interface for objects that represent entries in a multiset.
NullaryFunction The interface of a nullary function, useful for anonymous classes used as Lambda operators.
ReferenceHistogram A histogram that represents a partition of a set of references by showing the size of each block in the partition.
ScannerWithLocInfo Extension of the Scanner interface that includes methods for getting the current file and line number.
SetDiff Interface for sets that are represented in terms of additions and removals relative to an underlying set.
SetWithDistrib Interface for objects that represent a probability distribution over a set.
StringDistrib Interface for objects that define probability distributions over strings.
UnaryFunction The interface of a unary function, useful for anonymous classes used as Lambda operators.
UnaryPredicate The interface of a unary predicate, useful for anonymous classes used as Lambda operators.
 

Class Summary
AbstractDGraph Abstract implementation of the DGraph interface.
AbstractMapWithPreimages Abstract implementation of the MapWithPreimages interface.
AbstractMultiset Abstract implementation of the Multiset class.
AbstractMultiset.Entry Abstract implementation of the Multiset.Entry interface.
AbstractTupleIterator An iterator over the set of tuples (x1, ..., xk) such that x1 is in S1, x2 is in S2(x1), etc., and xk is in Sk(x1, ..., x(k-1)).
AddedTupleIterator Class for iterating over tuples that are added to the Cartesian product A_1 x A_2 x ...
Bernoulli A distribution over {true, false}.
BinaryHeap A binary heap data structure, as described in Cormen, Leiserson & Rivest (1990) Chapter 7.
BinarySequenceDistrib A distribution over sequences of independent, identically distributed binary variables.
BipartiteMatcher An engine for finding the maximum-weight matching in a complete bipartite graph.
CartesianProduct An implicit representation of the Cartesian product of a list of lists.
DefaultDGraph Default implementation of the DGraph interface.
DefaultMapEntry Default implementation of the Map.Entry interface.
DefaultReferenceHistogram Default implementation of the ReferenceHistogram interface.
DenseVector Implementation of ImplicitVector in which the explicit entries form a prefix of the implicit infinite vector.
ExtensibleLinkedList A data structure that is implemented as a linked list, but only implements the Collection interface, so it does not allow random access to elements and does not support ListIterators.
FibHeap A Fibonacci heap data structure, as described in Chapter 20 of Cormen, Leiserson, Rivest & Stein (2001).
FilteredIterator Abstract class for Iterator objects that filter or transform the objects returned by an underlying iterator.
FilteredMapIterator Abstract class for FilteredIterator objects whose underlying iterator runs over the entry set of a map.
Geometric A geometric distribution over the natural numbers 0, 1, 2,...
HashMapDiff MapDiff implementation that uses a HashMap to store the values for changed keys, and a HashSet to store the removed keys.
HashMapWithPreimages Implementation of MapWithPreimages that builds on a hash map from keys to values, augmenting it with a hash map from values to sets (preimages).
HashMultiMap Implementation of the MultiMap interface that uses a HashMap for the map and HashSets for automatically created sets.
HashMultiMapDiff Implementation of MultiMapDiff that uses a hash map from objects HashSetDiffs.
HashMultiset An implementation of the Multiset interface that uses a HashMap from elements to integers as the underlying data structure.
HashSetDiff Implementation of SetDiff that uses hash sets to store additions and removals.
Histogram A mapping from objects to weights, which are real numbers.
Histogram.Entry Nested class for the entries in a histogram.
ImplicitVector A sequence of floating-point numbers that is in principle infinite, but in which only a finite set of entries are represented explicitly.
IndexedHashMultiMap Implementation of the IndexedMultiMap interface.
IndexedHashSet Implementation of the IndexedSet interface that stores objects in a list, and uses a HashMap to map objects to their indices.
IndexedHashSetDiff Implementation of the IndexedSet interface that is represented as a set of differences from an underlying IndexedSet.
IndexedMultiMap.EmptyIndexedMultiMap  
IndexedMultiMapDiff A MultiMapDiff implementation that also implements the IndexedMultiMap interface.
IndexedSet.EmptyIndexedSet  
IndexedTreeSet An implementation of the IndexedSet interface that keeps elements in sorted order.
IndexedTreeSetDiff Implementation of the IndexedSortedSet interface that is represented as a set of differences from an underlying IndexedSortedSet.
LocationInFile Represents a file name and a line number in that file.
LogHistogram A histogram that stores the logs of the weights of its elements, rather than the weights themselves.
MapWithPreimages.EmptyMapWithPreimages  
MapWithPreimagesDiff Represents a map with preimages as a set of differences relative to an underlying map with preimages.
MultiMap.EmptyMultiMap  
Multinomial A distribution over a finite set of elements 0, 1, ..., k, specified with an array of k probabilities pi_0,...,pi_k summing to 1.
MultinomialWithTail A mixture of a multinomial over the first k natural numbers 0,...,(k-1), and a geometric distribution over the numbers >= k.
MultisetBackedSet An unmodifiable Set that is backed by a Multiset.
ParentUpdateDGraph Directed graph that is backed by an underlying DGraph, but represents changes to the set of nodes and to the parent sets of some existing nodes (and thus to the child sets of some nodes as well).
PermutationDistrib Defines, for each n, a distribution over the permutations of the sequence 0,...,n-1.
PermutationIterator An iterator for iterating over all the ways to make an ordered list of k distinct elements from a set of size n.
Poisson A Poisson distribution with mean and variance lambda.
PrecisionRecall An object of class PrecisionRecall represents precision and recall statistics for some experiment.
ReferenceHistogramPair Represents the partitions of two sets of references, called the foreground set and the background set.
RoundedLogNormal Distribution over positive integers for a random variable X = round(Y), where Y has a log normal distribution.
SamplingMultiset Multiset that allows sampling, but not iteration or removals.
SetBackedMultiset An unmodifiable Multiset implementation that just wraps around a Set object.
SparseVector Simple implementation of a sparse vector, that is, a vector of doubles in which many elements are zero.
SubsetIterator Class for iterating over all subsets of an ordered set.
SubstringReplacer A SubstringReplacer is an engine for replacing substrings of a given string.
TabularReader Reads tabular files, that is, files where each line represents a row, and each row is broken up into fields (columns) by separator characters.
Timer A class for measuring how much time a program spends doing certain operations.
TupleIterator This class is an iterator over all tuples in a finite cartesian product of finite sets.
Util Provides common utilities to FOMIE programs.
Util.InversePolynomialSampler A sampler of nonnegative reals following an inverse polynomial density 1/((x+\delta)^n), \delta > 0.
WeakHashSet A HashSet class that uses weak references to its elements.