All Classes and Interfaces
Class
Description
Abstract base class for all arbitrary-dimensional bins consumes double elements.
Abstract base class for all 1-dimensional bins consumes double elements.
Abstract base class for resizable lists holding
boolean elements; abstract.Abstract base class for resizable lists holding
byte elements; abstract.Abstract base class for resizable lists holding
char elements; abstract.Abstract base class for resizable collections holding objects or primitive data types such as
int, float, etc.Abstract base class for all continous distributions.
Abstract base class for all discrete distributions.
Abstract base class for all random distributions.
Abstract base class for hash maps holding (key,value) associations of type (double-->int).
Abstract base class for resizable lists holding
double elements; abstract.Abstract base class for resizable lists holding
float elements; abstract.Abstract base class for flexible, well human readable matrix print formatting.
Abstract base class extracting and implementing most of the redundancy of the interface.
Abstract base class extracting and implementing most of the redundancy of the interface.
Abstract base class extracting and implementing most of the redundancy of the interface.
Abstract base class for hash maps holding (key,value) associations of type (int-->double).
Abstract base class for hash maps holding (key,value) associations of type (int-->int).
Abstract base class for resizable lists holding
int elements; abstract.Abstract base class for hash maps holding (key,value) associations of type (int-->Object).
Abstract base class for resizable lists holding objects or primitive data types such as
int, float, etc.Abstract base class for resizable lists holding
long elements; abstract.Abstract base class for hash maps holding (key,value) associations of type (long-->Object).
Abstract base class for hash maps holding objects or primitive data types such as
int, float, etc.Abstract base class for arbitrary-dimensional matrices holding objects or primitive data types such as
int, float, etc.Abstract base class for 1-d matrices (aka vectors) holding objects or primitive data types such as
int, double, etc.Abstract base class for 2-d matrices holding objects or primitive data types such as
int, double, etc.Abstract base class for 3-d matrices holding objects or primitive data types such as
int, double, etc.Abstract base class for resizable lists holding
short elements; abstract.Linear algebraic matrix operations operating on
DoubleMatrix2D; concentrates most functionality of this package.Not yet commented.
Arithmetic functions.
Array manipulations; complements java.util.Arrays.
Benchmarks the classes of this package.
Benchmarks the performance of matrix algorithms.
Benchmarks random number generation from various distributions as well as PDF and CDF lookups.
Benchmarks the performance of the currently provided uniform pseudo-random number generation engines.
Not yet documented.
Configurable matrix benchmark.
Benchmarks the performance of matrices.
Bessel and Airy functions.
Beta distribution; math definition
and animated definition.
Interface that represents a function object: a function that takes
two bins as arguments and returns a single value.
Interface that represents a function object: a function that takes
two bins as arguments and returns a single value.
Function objects computing dynamic bin aggregations; to be passed to generic methods.
Binomial distribution; See the math definition
and animated definition.
Fixed sized (non resizable) n*m bit matrix.
Fixed sized (non resizable) bitvector.
Subset of the BLAS (Basic Linear Algebra System);
High quality "building block" routines for performing basic vector and matrix operations.
Resizable list holding
boolean elements; implemented with arrays.Interface that represents a procedure object: a procedure that takes
a single argument and does not return a value.
BreitWigner (aka Lorentz) distribution; See the math definition.
Mean-square BreitWigner distribution; See the math definition.
A buffer holding elements; internally used for computing approximate quantiles.
An abstract set of buffers; internally used for computing approximate quantiles.
Resizable list holding
byte elements; implemented with arrays.A comparison function which imposes a total ordering on some
collection of elements.
Interface that represents a procedure object: a procedure that takes
a single argument and does not return a value.
Resizable list holding
char elements; implemented with arrays.A comparison function which imposes a total ordering on some
collection of elements.
Interface that represents a procedure object: a procedure that takes
a single argument and does not return a value.
ChiSquare distribution; See the math definition
and animated definition.
For a symmetric, positive definite matrix A, the Cholesky decomposition
is a lower triangular matrix L so that A = L*L';
If the matrix is not symmetric or positive definite, the constructor
returns a partial decomposition and sets an internal flag that may
be queried by the isSymmetricPositiveDefinite() method.
Not yet commented.
Defines some useful constants.
Histogram conversions, for example to String and XML format;
This class requires the Colt distribution, whereas the rest of the package is entirelly stand-alone.
1-d matrix holding double elements; either a view wrapping another 2-d matrix and therefore delegating calls to it.
Dense 1-d matrix (aka vector) holding double elements.
Dense 2-d matrix holding double elements.
Dense 3-d matrix holding double elements.
Dense 1-d matrix (aka vector) holding Object elements.
Dense 2-d matrix holding Object elements.
Dense 3-d matrix holding Object elements.
Basic descriptive statistics.
For diagonal matrices we can often do better.
Resizable compressed list holding numbers; based on the fact that a number from a large list with few distinct values need not take more than log(distinctValues) bits; implemented with a MinMaxNumberList.
Contains methods for conveniently generating pseudo-random numbers from special distributions such as the Burr, Cauchy, Erlang, Geometric, Lambda, Laplace, Logistic, Weibull, etc.
Interface that represents a function object: a function that takes
27 arguments and returns a single value.
Interface that represents a function object: a function that takes
5 arguments and returns a single value.
Interface that represents a function object: a function that takes
9 arguments and returns a single value.
Resizable list holding
double elements; implemented with arrays.Fixed sized (non resizable) streaming buffer connected to a target DoubleBufferConsumer to which data is automatically flushed upon buffer overflow.
A buffer holding double elements; internally used for computing approximate quantiles.
Fixed sized (non resizable) streaming buffer connected to a target DoubleBuffer2DConsumer to which data is automatically flushed upon buffer overflow.
Target of a streaming DoubleBuffer2D into which data is flushed upon buffer overflow.
Fixed sized (non resizable) streaming buffer connected to a target DoubleBuffer3DConsumer to which data is automatically flushed upon buffer overflow.
Target of a streaming DoubleBuffer3D into which data is flushed upon buffer overflow.
Target of a streaming DoubleBuffer into which data is flushed upon buffer overflow.
A set of buffers holding double elements; internally used for computing approximate quantiles.
A comparison function which imposes a total ordering on some
collection of elements.
Interface that represents a function object: a function that takes
two arguments and returns a single value.
Interface that represents a procedure object: a procedure that takes
two arguments and does not return a value.
Factory for convenient construction of 1-d matrices holding double cells.
Factory for convenient construction of 2-d matrices holding double
cells.
Factory for convenient construction of 3-d matrices holding double cells.
Interface that represents a function object: a function that takes
a single argument and returns a single value.
Interface that represents a procedure object: a procedure that takes
two arguments and does not return a value.
Adapter that permits an
AbstractDoubleList to be viewed and treated as a JDK 1.2 AbstractList.Abstract base class for 1-d matrices (aka vectors) holding double elements.
A comparison function which imposes a total ordering on some
collection of elements.
Interface that represents a condition or procedure object: takes
a single argument and returns a boolean value.
Abstract base class for 2-d matrices holding double elements.
A comparison function which imposes a total ordering on some
collection of elements.
Interface that represents a condition or procedure object: takes
a single argument and returns a boolean value.
Abstract base class for 3-d matrices holding double elements.
Interface that represents a condition or procedure object: takes
a single argument and returns a boolean value.
Interface that represents a procedure object: a procedure that takes
a single argument and does not return a value.
The abstract base class for approximate quantile finders computing quantiles over a sequence of double elements.
The interface shared by all quantile finders, no matter if they are exact or approximate.
Quick medium quality uniform pseudo-random number generator.
1-dimensional rebinnable bin holding double elements;
Efficiently computes advanced statistics of data sequences.
Eigenvalues and eigenvectors of a real matrix A.
Not yet commented.
Empirical distribution.
Discrete Empirical distribution (pdf's can be specified).
Read-only equi-depth histogram for selectivity estimation.
Exact quantile finding algorithm for known and unknown N requiring large main memory; computes quantiles over a sequence of double elements.
Exponential functions.
Exponential Distribution (aka Negative Exponential Distribution); See the math definition
animated definition.
Not yet commented.
Exponential Power distribution.
Fixed-width axis; A reference implementation of hep.aida.IAxis.
Resizable list holding
float elements; implemented with arrays.A comparison function which imposes a total ordering on some
collection of elements.
Adapter that permits an
AbstractFloatList to be viewed and treated as a JDK 1.2 AbstractList.Interface that represents a procedure object: a procedure that takes
a single argument and does not return a value.
A class for formatting numbers that follows printf conventions.
Flexible, well human readable matrix print formatting; By default decimal point aligned.
Flexible, well human readable matrix print formatting.
Formats a double into a string (like sprintf in C).
Factory producing implementations of
Former via method create();
Implementations of can use existing libraries such as corejava.PrintfFormat or corejava.Format or other.Contains various mathematical helper methods.
Function objects to be passed to generic methods.
Gamma and Beta functions.
Generically reorders (permutes) arbitrary shaped data (for example, an array, three arrays, a 2-d matrix, two linked lists) using an in-place swapping algorithm.
Generically sorts arbitrary shaped data (for example multiple arrays, 1,2 or 3-d matrices, and so on) using a
quicksort or mergesort.
Demonstrates how to use
.
invalid reference
SortProvides various hash functions.
Base class for Histogram1D and Histogram2D.
A reference implementation of hep.aida.IHistogram1D.
A reference implementation of hep.aida.IHistogram2D.
A reference implementation of hep.aida.IHistogram3D.
Hyperbolic distribution.
HyperGeometric distribution; See the math definition
The hypergeometric distribution with parameters N, n and s is the probability distribution of the random variable X,
whose value is the number of successes in a sample of n items from a population of size N that has s 'success' items and N - s 'failure' items.
An IAxis represents a binned histogram axis.
A common base interface for IHistogram1D, IHistogram2D and IHistogram3D.
A Java interface corresponding to the AIDA 1D Histogram.
A Java interface corresponding to the AIDA 2D Histogram.
A Java interface corresponding to the AIDA 3D Histogram.
Resizable list holding
int elements; implemented with arrays.Fixed sized (non resizable) streaming buffer connected to a target IntBufferConsumer to which data is automatically flushed upon buffer overflow.
Fixed sized (non resizable) streaming buffer connected to a target IntBuffer2DConsumer to which data is automatically flushed upon buffer overflow.
Target of a streaming IntBuffer2D into which data is flushed upon buffer overflow.
Fixed sized (non resizable) streaming buffer connected to a target IntBuffer3DConsumer to which data is automatically flushed upon buffer overflow.
Target of a streaming IntBuffer3D into which data is flushed upon buffer overflow.
Target of a streaming IntBuffer into which data is flushed upon buffer overflow.
A comparison function which imposes a total ordering on some
collection of elements.
Interface that represents a function object: a function that takes two arguments.
Interface that represents a procedure object: a procedure that takes
two arguments and does not return a value.
Interface that represents a function object: a function that takes
a single argument and returns a single value.
Integer Function objects to be passed to generic methods.
Interface that represents a function object: a function that takes three arguments.
Interface that represents a procedure object: a procedure that takes
three arguments and does not return a value.
Interface that represents a function object: a function that takes
two arguments and returns a single value.
Interface that represents a procedure object: a procedure that takes
three arguments and does not return a value.
Interface that represents a procedure object: a procedure that takes
two arguments and does not return a value.
Adapter that permits an
AbstractIntList to be viewed and treated as a JDK 1.2 AbstractList.Interface that represents a procedure object: a procedure that takes
two arguments and does not return a value.
Interface that represents a procedure object: a procedure that takes
a single argument and does not return a value.
Approximate quantile finding algorithm for known N requiring only one pass and little main memory; computes quantiles over a sequence of double elements.
Logarithmic distribution.
Resizable list holding
long elements; implemented with arrays.A comparison function which imposes a total ordering on some
collection of elements.
Adapter that permits an
AbstractLongList to be viewed and treated as a JDK 1.2 AbstractList.Interface that represents a procedure object: a procedure that takes
two arguments and does not return a value.
Interface that represents a procedure object: a procedure that takes
a single argument and does not return a value.
For an m x n matrix A with m >= n, the LU decomposition is an m x n
unit lower triangular matrix L, an n x n upper triangular matrix U,
and a permutation vector piv of length m so that A(piv,:) = L*U;
If m invalid input: '<' n, then L is m x m and U is m x n.
A low level version of
LUDecomposition, avoiding unnecessary memory allocation and copying.Interface that represents a function object: a function that takes
two arguments and returns a single value.
MersenneTwister (MT19937) is one of the strongest uniform pseudo-random number generators known so far; at the same time it is quick.
Same as MersenneTwister except that method raw() returns 64 bit random numbers instead of 32 bit random numbers.
Static and the same as its superclass, except that it can do more: Additionally computes moments of arbitrary integer order, harmonic mean, geometric mean, etc.
Resizable compressed list holding numbers; based on the fact that a value in a given interval need not take more than log(max-min+1) bits; implemented with a cern.colt.bitvector.BitVector.
Not yet commented.
Only for performance tuning of compute intensive linear algebraic computations.
Negative Binomial distribution; See the math definition.
Normal (aka Gaussian) distribution; See the math definition
and animated definition.
Not yet commented.
Resizable list holding
Object elements; implemented with arrays.Fixed sized (non resizable) streaming buffer connected to a target ObjectBufferConsumer to which data is automatically flushed upon buffer overflow.
Target of a streaming ObjectBuffer into which data is flushed upon buffer overflow.
Factory for convenient construction of 1-d matrices holding Object cells.
Factory for convenient construction of 2-d matrices holding Object
cells.
Factory for convenient construction of 3-d matrices holding Object cells.
Interface that represents a function object: a function that takes
a single argument and returns a single value.
Adapter that permits an
ObjectArrayList to be viewed and treated as a JDK 1.2 AbstractList.Abstract base class for 1-d matrices (aka vectors) holding Object elements.
A comparison function which imposes a total ordering on some
collection of elements.
Interface that represents a condition or procedure object: takes
a single argument and returns a boolean value.
Abstract base class for 2-d matrices holding Object elements.
A comparison function which imposes a total ordering on some
collection of elements.
Interface that represents a condition or procedure object: takes
a single argument and returns a boolean value.
Abstract base class for 3-d matrices holding Object elements.
Interface that represents a condition or procedure object: takes
a single argument and returns a boolean value.
Interface that represents a function object: a function that takes
two arguments and returns a single value.
Interface that represents a procedure object: a procedure that takes
a single argument and does not return a value.
Hash map holding (key,value) associations of type (double-->int); Automatically grows and shrinks as needed; Implemented using open addressing with double hashing.
Hash map holding (key,value) associations of type (int-->double); Automatically grows and shrinks as needed; Implemented using open addressing with double hashing.
Hash map holding (key,value) associations of type (int-->int); Automatically grows and shrinks as needed; Implemented using open addressing with double hashing.
Hash map holding (key,value) associations of type (int-->Object); Automatically grows and shrinks as needed; Implemented using open addressing with double hashing.
Hash map holding (key,value) associations of type (long-->Object); Automatically grows and shrinks as needed; Implemented using open addressing with double hashing.
Given some interval boundaries, partitions matrices such that cell values falling into an interval are placed next to each other.
Given some interval boundaries, partitions matrices such that cell values falling into an interval are placed next to each other.
Given some interval boundaries, partitions arrays such that all elements falling into an interval are placed next to each other.
This empty class is the common root for all persistent capable classes.
High Energy Physics coherent Physical Constants.
Only for performance tuning of compute intensive linear algebraic computations.
Poisson distribution (quick); See the math definition
and animated definition.
Poisson distribution; See the math definition
and animated definition.
Polynomial functions.
Not of interest for users; only for implementors of hashtables.
Custom tailored numerical integration of certain probability distributions.
Tests matrices for linear algebraic properties (equality, tridiagonality, symmetry, singularity, etc).
For an m x n matrix A with m >= n, the QR decomposition is an m x n
orthogonal matrix Q and an n x n upper triangular matrix R so that
A = Q*R.
A class to test the QuantileBin1D code.
1-dimensional non-rebinnable bin holding double elements with scalable quantile operations defined upon;
Using little main memory, quickly computes approximate quantiles over very large data sequences with and even without a-priori knowledge of the number of elements to be filled;
Conceptually a strongly lossily compressed multiset (or bag);
Guarantees to respect the worst case approximation error specified upon instance construction.
Computes b and k vor various parameters.
Factory constructing exact and approximate quantile finders for both known and unknown N.
A class holding test cases for exact and approximate quantile finders.
Implements quick non polymorphic non bounds checking low level bitvector operations.
Status: Experimental; Do not use for production yet.
Abstract base class for uniform pseudo-random number generating engines.
Interface for uniform pseudo-random number generators.
Space and time efficiently computes a sorted Simple Random Sample Without Replacement (SRSWOR), that is, a sorted set of n random numbers from an interval of N numbers;
Example: Computing n=3 random numbers from the interval [1,50] may yield the sorted random set (7,13,47).
Conveniently computes a stable Simple Random Sample Without Replacement (SRSWOR) subsequence of n elements from a given input sequence of N elements;
Example: Computing a sublist of n=3 random elements from a list (1,...,50) may yield the sublist (7,13,47).
Deterministic seed generator for pseudo-random number generators.
(Seemingly gigantic) table of good seeds for pseudo-random number generators.
Sparse row-compressed 2-d matrix holding double elements.
Sparse row-compressed-modified 2-d matrix holding double elements.
Selection view on dense 1-d matrices holding double elements.
Selection view on dense 2-d matrices holding double elements.
Selection view on dense 3-d matrices holding double elements.
Selection view on dense 1-d matrices holding Object elements.
Selection view on dense 2-d matrices holding Object elements.
Selection view on dense 3-d matrices holding Object elements.
Selection view on sparse 1-d matrices holding double elements.
Selection view on sparse 2-d matrices holding double elements.
Selection view on sparse 3-d matrices holding double elements.
Selection view on sparse 1-d matrices holding Object elements.
Selection view on sparse 2-d matrices holding Object elements.
Selection view on sparse 3-d matrices holding Object elements.
Sequential implementation of the Basic Linear Algebra System.
Resizable list holding
short elements; implemented with arrays.A comparison function which imposes a total ordering on some
collection of elements.
Interface that represents a procedure object: a procedure that takes
a single argument and does not return a value.
Resizable list holding
long elements; implemented with arrays; not efficient; just to demonstrate which methods you must override to implement a fully functional list.For an m x n matrix A with m >= n, the singular value decomposition is
an m x n orthogonal matrix U, an n x n diagonal matrix S, and
an n x n orthogonal matrix V so that A = U*S*V'.
Parallel implementation of the Basic Linear Algebra System for symmetric multi processing boxes.
Matrix quicksorts and mergesorts.
Matrix quicksorts and mergesorts.
Quicksorts, mergesorts and binary searches; complements java.util.Arrays.
Sparse hashed 1-d matrix (aka vector) holding double elements.
Sparse hashed 2-d matrix holding double elements.
Sparse hashed 3-d matrix holding double elements.
Sparse hashed 1-d matrix (aka vector) holding Object elements.
Sparse hashed 2-d matrix holding Object elements.
Sparse hashed 3-d matrix holding Object elements.
Not yet commented.
1-dimensional non-rebinnable bin consuming double elements;
Efficiently computes basic statistics of data sequences.
Basic statistics operations on matrices.
Interface that represents a function object: a function that takes
two argument vectors and returns a single value.
Stencil operations.
StudentT distribution (aka T-distribution); See the math definition
and animated definition.
Interface for an object that knows how to swap elements at two positions (a,b).
A very(!) basic test of the reference implementations of AIDA histograms.
A very(!) basic test of the reference implementations
of AIDA histograms
Quick and dirty tests.
A handy stopwatch for benchmarking.
Interface that represents a procedure object: a procedure that takes
a single argument and does not return a value.
Deprecated.
Tridiagonal 2-d matrix holding double elements.
Uniform distribution; Math definition
and animated definition.
High Energy Physics coherent system of Units.
Approximate quantile finding algorithm for unknown N requiring only one pass and little main memory; computes quantiles over a sequence of double elements.
Convenient histogram utilities.
Holds some utility methods shared by different quantile finding implementations.
Variable-width axis; A reference implementation of hep.aida.IAxis.
Information about the current release.
Von Mises distribution.
Conveniently computes a stable subsequence of elements from a given input sequence;
Picks (samples) exactly one random element from successive blocks of weight input elements each.
1-d matrix holding double elements; either a view wrapping another matrix or a matrix whose views are wrappers.
2-d matrix holding double elements; either a view wrapping another matrix or a matrix whose views are wrappers.
Zeta distribution.