Added missing @since tags.
git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@1422195 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
fa7a7f0175
commit
23400334ee
|
@ -95,7 +95,10 @@ public class PolynomialFunctionNewtonForm implements UnivariateDifferentiableFun
|
|||
return evaluate(a, c, z);
|
||||
}
|
||||
|
||||
/** {@inheritDoc} */
|
||||
/**
|
||||
* {@inheritDoc}
|
||||
* @since 3.1
|
||||
*/
|
||||
public DerivativeStructure value(final DerivativeStructure t) {
|
||||
verifyInputArray(a, c);
|
||||
|
||||
|
|
|
@ -188,6 +188,7 @@ public class LaguerreSolver extends AbstractPolynomialSolver {
|
|||
* @throws NullArgumentException if the {@code coefficients} is
|
||||
* {@code null}.
|
||||
* @throws NoDataException if the {@code coefficients} array is empty.
|
||||
* @since 3.1
|
||||
*/
|
||||
public Complex[] solveAllComplex(double[] coefficients,
|
||||
double initial)
|
||||
|
@ -217,6 +218,7 @@ public class LaguerreSolver extends AbstractPolynomialSolver {
|
|||
* @throws NullArgumentException if the {@code coefficients} is
|
||||
* {@code null}.
|
||||
* @throws NoDataException if the {@code coefficients} array is empty.
|
||||
* @since 3.1
|
||||
*/
|
||||
public Complex solveComplex(double[] coefficients,
|
||||
double initial)
|
||||
|
|
|
@ -38,6 +38,7 @@ public abstract class AbstractIntegerDistribution
|
|||
implements IntegerDistribution, Serializable {
|
||||
/** Serializable version identifier */
|
||||
private static final long serialVersionUID = -1146319659338487221L;
|
||||
|
||||
/**
|
||||
* RandomData instance used to generate samples from the distribution.
|
||||
* @deprecated As of 3.1, to be removed in 4.0. Please use the
|
||||
|
@ -45,7 +46,11 @@ implements IntegerDistribution, Serializable {
|
|||
*/
|
||||
@Deprecated
|
||||
protected final RandomDataImpl randomData = new RandomDataImpl();
|
||||
/** RNG instance used to generate samples from the distribution. */
|
||||
|
||||
/**
|
||||
* RNG instance used to generate samples from the distribution.
|
||||
* @since 3.1
|
||||
*/
|
||||
protected final RandomGenerator random;
|
||||
|
||||
/**
|
||||
|
@ -60,6 +65,7 @@ implements IntegerDistribution, Serializable {
|
|||
}
|
||||
/**
|
||||
* @param rng Random number generator.
|
||||
* @since 3.1
|
||||
*/
|
||||
protected AbstractIntegerDistribution(RandomGenerator rng) {
|
||||
random = rng;
|
||||
|
|
|
@ -49,8 +49,13 @@ implements RealDistribution, Serializable {
|
|||
*/
|
||||
@Deprecated
|
||||
protected RandomDataImpl randomData = new RandomDataImpl();
|
||||
/** RNG instance used to generate samples from the distribution. */
|
||||
|
||||
/**
|
||||
* RNG instance used to generate samples from the distribution.
|
||||
* @since 3.1
|
||||
*/
|
||||
protected final RandomGenerator random;
|
||||
|
||||
/** Solver absolute accuracy for inverse cumulative computation */
|
||||
private double solverAbsoluteAccuracy = SOLVER_DEFAULT_ABSOLUTE_ACCURACY;
|
||||
|
||||
|
@ -66,6 +71,7 @@ implements RealDistribution, Serializable {
|
|||
}
|
||||
/**
|
||||
* @param rng Random number generator.
|
||||
* @since 3.1
|
||||
*/
|
||||
protected AbstractRealDistribution(RandomGenerator rng) {
|
||||
random = rng;
|
||||
|
@ -275,6 +281,7 @@ implements RealDistribution, Serializable {
|
|||
* {@inheritDoc}
|
||||
*
|
||||
* @return zero.
|
||||
* @since 3.1
|
||||
*/
|
||||
public double probability(double x) {
|
||||
return 0d;
|
||||
|
|
|
@ -167,6 +167,7 @@ public class GammaDistribution extends AbstractRealDistribution {
|
|||
* Returns the shape parameter of {@code this} distribution.
|
||||
*
|
||||
* @return the shape parameter
|
||||
* @since 3.1
|
||||
*/
|
||||
public double getShape() {
|
||||
return shape;
|
||||
|
@ -188,6 +189,7 @@ public class GammaDistribution extends AbstractRealDistribution {
|
|||
* Returns the scale parameter of {@code this} distribution.
|
||||
*
|
||||
* @return the scale parameter
|
||||
* @since 3.1
|
||||
*/
|
||||
public double getScale() {
|
||||
return scale;
|
||||
|
|
|
@ -120,6 +120,7 @@ public class LogNormalDistribution extends AbstractRealDistribution {
|
|||
* @param shape Shape parameter of this distribution.
|
||||
* @param inverseCumAccuracy Inverse cumulative probability accuracy.
|
||||
* @throws NotStrictlyPositiveException if {@code shape <= 0}.
|
||||
* @since 3.1
|
||||
*/
|
||||
public LogNormalDistribution(RandomGenerator rng,
|
||||
double scale,
|
||||
|
|
|
@ -21,7 +21,7 @@ import org.apache.commons.math3.exception.util.LocalizedFormats;
|
|||
/**
|
||||
* Exception to be thrown when a number is not a number.
|
||||
*
|
||||
* @since 3.0
|
||||
* @since 3.1
|
||||
* @version $Id$
|
||||
*/
|
||||
public class NotANumberException extends MathIllegalNumberException {
|
||||
|
|
|
@ -111,7 +111,8 @@ public abstract class ListPopulation implements Population {
|
|||
* Add a {@link Collection} of chromosomes to this {@link Population}.
|
||||
* @param chromosomeColl a {@link Collection} of chromosomes
|
||||
* @throws NumberIsTooLargeException if the population would exceed the population limit when
|
||||
* adding this chromosome
|
||||
* adding this chromosome
|
||||
* @since 3.1
|
||||
*/
|
||||
public void addChromosomes(final Collection<Chromosome> chromosomeColl) throws NumberIsTooLargeException {
|
||||
if (chromosomes.size() + chromosomeColl.size() > populationLimit) {
|
||||
|
@ -132,6 +133,7 @@ public abstract class ListPopulation implements Population {
|
|||
/**
|
||||
* Access the list of chromosomes.
|
||||
* @return the list of chromosomes
|
||||
* @since 3.1
|
||||
*/
|
||||
protected List<Chromosome> getChromosomeList() {
|
||||
return chromosomes;
|
||||
|
|
|
@ -115,6 +115,7 @@ public class Interval {
|
|||
* belong to the boundary
|
||||
* @return a code representing the point status: either {@link
|
||||
* Location#INSIDE}, {@link Location#OUTSIDE} or {@link Location#BOUNDARY}
|
||||
* @since 3.1
|
||||
*/
|
||||
public Location checkPoint(final double point, final double tolerance) {
|
||||
if (point < lower - tolerance || point > upper + tolerance) {
|
||||
|
|
|
@ -270,6 +270,7 @@ public class Line implements Hyperplane<Euclidean2D>, Embedding<Euclidean2D, Euc
|
|||
*
|
||||
* @param p to check
|
||||
* @return distance between the instance and the point
|
||||
* @since 3.1
|
||||
*/
|
||||
public double distance(final Vector2D p) {
|
||||
return FastMath.abs(getOffset(p));
|
||||
|
|
|
@ -128,6 +128,7 @@ public class PolygonsSet extends AbstractRegion<Euclidean2D, Euclidean1D> {
|
|||
* @param hyperplaneThickness tolerance below which points are considered to
|
||||
* belong to the hyperplane (which is therefore more a slab)
|
||||
* @param vertices vertices of the simple loop boundary
|
||||
* @since 3.1
|
||||
*/
|
||||
public PolygonsSet(final double hyperplaneThickness, final Vector2D ... vertices) {
|
||||
super(verticesToTree(hyperplaneThickness, vertices));
|
||||
|
|
|
@ -78,6 +78,7 @@ public class Segment {
|
|||
*
|
||||
* @param p to check
|
||||
* @return distance between the instance and the point
|
||||
* @since 3.1
|
||||
*/
|
||||
public double distance(final Vector2D p) {
|
||||
final double deltaX = end.getX() - start.getX();
|
||||
|
|
|
@ -112,6 +112,7 @@ public class EigenDecomposition {
|
|||
* @throws MaxCountExceededException if the algorithm fails to converge.
|
||||
* @throws MathArithmeticException if the decomposition of a general matrix
|
||||
* results in a matrix with zero norm
|
||||
* @since 3.1
|
||||
*/
|
||||
public EigenDecomposition(final RealMatrix matrix)
|
||||
throws MathArithmeticException {
|
||||
|
@ -151,6 +152,7 @@ public class EigenDecomposition {
|
|||
* @param main Main diagonal of the symmetric tridiagonal form.
|
||||
* @param secondary Secondary of the tridiagonal form.
|
||||
* @throws MaxCountExceededException if the algorithm fails to converge.
|
||||
* @since 3.1
|
||||
*/
|
||||
public EigenDecomposition(final double[] main, final double[] secondary) {
|
||||
isSymmetric = true;
|
||||
|
@ -367,6 +369,7 @@ public class EigenDecomposition {
|
|||
* @return the square-root of the matrix.
|
||||
* @throws MathUnsupportedOperationException if the matrix is not
|
||||
* symmetric or not positive definite.
|
||||
* @since 3.1
|
||||
*/
|
||||
public RealMatrix getSquareRoot() {
|
||||
if (!isSymmetric) {
|
||||
|
|
|
@ -107,6 +107,7 @@ public class JacobiPreconditioner extends RealLinearOperator {
|
|||
* P = diag(1 / √A<sub>11</sub>, 1 / √A<sub>22</sub>, …).
|
||||
*
|
||||
* @return the square root of {@code this} preconditioner
|
||||
* @since 3.1
|
||||
*/
|
||||
public RealLinearOperator sqrt() {
|
||||
final RealVector sqrtDiag = diag.map(new Sqrt());
|
||||
|
|
Loading…
Reference in New Issue