All Classes and Interfaces

Class
Description
Boiler-plate code for concrete implementations of Field.
Addition.
Represents the angle concept.
Unit: degrees.
Unit: radians.
Unit: turns.
Some useful, arithmetics related, additions to the built-in functions in Math.
Representation of a rational number using arbitrary precision.
Representation of the binomial coefficient.
Representation of the binomial coefficient, as a double.
This class implements the Brent algorithm for finding zeros of real univariate functions.
Utility to create combinations (n, k) of k elements in a set of n elements.
Cartesian representation of a complex number.
Provides a generic means to evaluate continued fractions.
Computes the cosine of the angle between two vectors.
Computes double-double floating-point operations.
DD field.
Computes extended precision floating-point operations.
Scaled complementary error function.
Computes the difference between error function values.
Deprecated.
Since 1.1 this functionality has been replaced with Factorial.doubleValue(int).
Interface representing a field.
Wraps a double value in order to be used as a field element.
Double field.
Representation of a rational number.
Fraction field.
Gamma function \( \Gamma(x) \).
Ratio of Gamma functions.
Provides a means to evaluate generalized continued fractions.
Defines the n-th "a" and "b" coefficients of the continued fraction.
Inverse of the error function.
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) \).
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.
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).
Reduces |a - offset| to the primary interval [0, |period|).
Select indices in array data.
Perform spherical linear interpolation (Slerp).
Sort an array and perform the same reordering of entries on other arrays.
Computation of Stirling numbers.
Class providing accurate floating-point sums and linear combinations.