All Classes and Interfaces
Class
Description
Boiler-plate code for concrete implementations of
Field.Addition.
Represents the angle concept.
Unit: degrees.
Normalizes an angle around a center value.
Unit: radians.
Unit: turns.
Some useful, arithmetics related, additions to the built-in functions in
Math.Exception.
Representation of a rational number using arbitrary precision.
BigFraction field.Representation of the
binomial coefficient.
Representation of the
binomial coefficient, as a
double.Implementation of the
regularized beta functions and
incomplete beta functions.
Implementation of the error function and
its inverse.
Implementation of the
Regularized Gamma functions and
Incomplete Gamma functions.
53-bit precision implementation of the Lanczos approximation.
Math functions used by the Boost functions.
Utility tools used by the Boost functions.
This class implements the
Brent algorithm for finding zeros of real univariate functions.
Defines a lexicographic ordering of the combinations.
Lexicographic combinations iterator.
Iterator with just one element to handle degenerate cases (full array,
empty array) for combination iterator.
Package private exception class with constants for frequently used messages.
Cartesian representation of a complex number.
Define a constructor for a Complex.
Provides a generic means to evaluate
continued fractions.
Computes the cosine of the angle between two vectors.
Scaled complementary error function.
Computes the difference between
error function values.Computes extended precision floating-point operations.
Deprecated.
Interface representing a field.
Wraps a
double value in order to be used as a field
element.Double field.Representation of a rational number.
Package private exception class with constants for frequently used messages.
Fraction field.Gamma
function \( \Gamma(x) \).
Package private exception class with constants for frequently used messages.
Ratio of Gamma
functions.
Provides a means to evaluate
generalized continued fractions.
Defines the
n-th "a" and "b" coefficients of the continued fraction.
Lower incomplete Gamma function \( \gamma(a, x) \).
Upper incomplete Gamma function \( \Gamma(a, x) \).
Inverse of the error function.
Inverse of the complementary error function.
Function \( \frac{1}{\Gamma(1 + x)} - 1 \).
Lanczos approximation to the Gamma function.
Computes \( log_e B(p, q) \).
Natural logarithm of the
binomial coefficient.
Class for computing the natural logarithm of the factorial of a number.
Natural logarithm of the absolute value of \( \Gamma(x) \).
Function \( \ln \Gamma(1 + x) \).
Computes \( \log_e(\Gamma(a+b)) \).
Converter between unidimensional storage structure and multidimensional
conceptual structure.
Multiplication.
Operators that can be implemented in a more performant way
using the language constructs.
Norm functions.
Function of array argument.
Function of 3 arguments.
Function of 2 arguments.
Encapsulate the policy for function evaluation.
Utilities for comparing numbers.
Interface containing comparison operations for doubles that allow values
to be considered equal even if they are not exactly equal.
Methods related to prime numbers in the range of
int.This class implements
quaternions (Hamilton's hypercomplex numbers).
For enabling optimized implementations.
Default implementations.
Implementations for normalized quaternions.
Reduces
|a - offset| to the primary interval [0, |period|).
Lower regularized Gamma function \( P(a, x) \).
Upper regularized Gamma function \( Q(a, x) \).
Perform spherical linear interpolation (Slerp).
Utility methods to work on primes within the
int range.Package private exception class with constants for frequently used messages.
Sort an array and perform the same reordering of entries on other arrays.
Helper data structure holding a (double, integer) pair.
Special math functions.
Class providing accurate floating-point sums and linear combinations.
Factorial.doubleValue(int).