id int64 1 889 | project_id stringclasses 17
values | bug_id stringclasses 163
values | class_file stringlengths 28 111 | method stringlengths 3 47 | source stringlengths 66 21.2k | target stringlengths 25 29k |
|---|---|---|---|---|---|---|
701 | Lang | 46 | src/java/org/apache/commons/lang/StringEscapeUtils.java | escapeJavaStyleString | public class StringEscapeUtils {
private static final char CSV_DELIMITER = ',';
private static final char CSV_QUOTE = '"';
private static final String CSV_QUOTE_STR = String.valueOf(CSV_QUOTE);
private static final char[] CSV_SEARCH_CHARS = new char[] {CSV_DELIMITER, CSV_QUOTE, CharUtils.CR, CharUtils.... | if (str == null) {
return null;
}
try {
StringWriter writer = new StringWriter(str.length() * 2);
escapeJavaStyleString(writer, str, escapeSingleQuotes, escapeForwardSlash);
return writer.toString();
} catch (IOException ioe) {
... |
702 | Lang | 46 | src/java/org/apache/commons/lang/StringEscapeUtils.java | escapeJavaStyleString | public class StringEscapeUtils {
private static final char CSV_DELIMITER = ',';
private static final char CSV_QUOTE = '"';
private static final String CSV_QUOTE_STR = String.valueOf(CSV_QUOTE);
private static final char[] CSV_SEARCH_CHARS = new char[] {CSV_DELIMITER, CSV_QUOTE, CharUtils.CR, CharUtils.... | if (out == null) {
throw new IllegalArgumentException("The Writer must not be null");
}
if (str == null) {
return;
}
int sz;
sz = str.length();
for (int i = 0; i < sz; i++) {
char ch = str.charAt(i);
// handle unico... |
703 | Lang | 47 | src/java/org/apache/commons/lang/text/StrBuilder.java | appendFixedWidthPadLeft | public class StrBuilder implements Cloneable {
static final int CAPACITY = 32;
private static final long serialVersionUID = 7628716375283629643L;
protected char[] buffer;
protected int size;
private String newLine;
private String nullText;
public StrBuilder appendFixedWidthPadRight(Object ... | if (width > 0) {
ensureCapacity(size + width);
String str = (obj == null ? getNullText() : obj.toString());
if (str == null) {
str = "";
}
int strLen = str.length();
if (strLen >= width) {
str.getChars(strLen... |
704 | Lang | 47 | src/java/org/apache/commons/lang/text/StrBuilder.java | appendFixedWidthPadRight | public class StrBuilder implements Cloneable {
static final int CAPACITY = 32;
private static final long serialVersionUID = 7628716375283629643L;
protected char[] buffer;
protected int size;
private String newLine;
private String nullText;
public StrBuilder appendFixedWidthPadLeft(Object o... | if (width > 0) {
ensureCapacity(size + width);
String str = (obj == null ? getNullText() : obj.toString());
if (str == null) {
str = "";
}
int strLen = str.length();
if (strLen >= width) {
str.getChars(0, wid... |
705 | Lang | 49 | src/java/org/apache/commons/lang/math/Fraction.java | reduce | public class Fraction extends Number implements Comparable {
private static final long serialVersionUID = 65382027393090L;
public static final Fraction ZERO = new Fraction(0, 1);
public static final Fraction ONE = new Fraction(1, 1);
public static final Fraction ONE_HALF = new Fraction(1, 2);
publi... | if (numerator == 0) {
return equals(ZERO) ? this : ZERO;
}
int gcd = greatestCommonDivisor(Math.abs(numerator), denominator);
if (gcd == 1) {
return this;
}
return Fraction.getFraction(numerator / gcd, denominator / gcd);
}
} |
706 | Lang | 50 | src/java/org/apache/commons/lang/time/FastDateFormat.java | getDateInstance | public class FastDateFormat extends Format {
private static final long serialVersionUID = 1L;
public static final int FULL = DateFormat.FULL;
public static final int LONG = DateFormat.LONG;
public static final int MEDIUM = DateFormat.MEDIUM;
public static final int SHORT = DateFormat.SHORT;
pri... | Object key = new Integer(style);
if (timeZone != null) {
key = new Pair(key, timeZone);
}
if (locale == null) {
locale = Locale.getDefault();
}
key = new Pair(key, locale);
FastDateFormat format = (FastDateFormat) cDateInstanceCache.get(... |
707 | Lang | 50 | src/java/org/apache/commons/lang/time/FastDateFormat.java | getDateTimeInstance | public class FastDateFormat extends Format {
private static final long serialVersionUID = 1L;
public static final int FULL = DateFormat.FULL;
public static final int LONG = DateFormat.LONG;
public static final int MEDIUM = DateFormat.MEDIUM;
public static final int SHORT = DateFormat.SHORT;
pri... | Object key = new Pair(new Integer(dateStyle), new Integer(timeStyle));
if (timeZone != null) {
key = new Pair(key, timeZone);
}
if (locale == null) {
locale = Locale.getDefault();
}
key = new Pair(key, locale);
FastDateFormat format = (Fas... |
708 | Lang | 52 | src/java/org/apache/commons/lang/StringEscapeUtils.java | escapeJavaStyleString | public class StringEscapeUtils {
private static void escapeJavaStyleString(Writer out, String str, boolean escapeSingleQuote) throws IOException { | if (out == null) {
throw new IllegalArgumentException("The Writer must not be null");
}
if (str == null) {
return;
}
int sz;
sz = str.length();
for (int i = 0; i < sz; i++) {
char ch = str.charAt(i);
// handle unico... |
709 | Lang | 53 | src/java/org/apache/commons/lang/time/DateUtils.java | modify | public class DateUtils {
public static final TimeZone UTC_TIME_ZONE = TimeZone.getTimeZone("GMT");
public static final long MILLIS_PER_SECOND = 1000;
public static final long MILLIS_PER_MINUTE = 60 * MILLIS_PER_SECOND;
public static final long MILLIS_PER_HOUR = 60 * MILLIS_PER_MINUTE;
public static... | if (val.get(Calendar.YEAR) > 280000000) {
throw new ArithmeticException("Calendar value too large for accurate calculations");
}
if (field == Calendar.MILLISECOND) {
return;
}
// ----------------- Fix for LANG-59 ---------------------- START ----... |
710 | Lang | 54 | src/java/org/apache/commons/lang/LocaleUtils.java | toLocale | public class LocaleUtils {
private static final List cAvailableLocaleList;
private static Set cAvailableLocaleSet;
private static final Map cLanguagesByCountry = Collections.synchronizedMap(new HashMap());
private static final Map cCountriesByLanguage = Collections.synchronizedMap(new HashMap());
... | if (str == null) {
return null;
}
int len = str.length();
if (len != 2 && len != 5 && len < 7) {
throw new IllegalArgumentException("Invalid locale format: " + str);
}
char ch0 = str.charAt(0);
char ch1 = str.charAt(1);
if (ch0 < 'a... |
711 | Lang | 55 | src/java/org/apache/commons/lang/time/StopWatch.java | stop | public class StopWatch {
private static final int STATE_UNSTARTED = 0;
private static final int STATE_RUNNING = 1;
private static final int STATE_STOPPED = 2;
private static final int STATE_SUSPENDED = 3;
private static final int STATE_UNSPLIT = 10;
private static final int STATE_SPLIT = ... | if(this.runningState != STATE_RUNNING && this.runningState != STATE_SUSPENDED) {
throw new IllegalStateException("Stopwatch is not running. ");
}
if(this.runningState == STATE_RUNNING) {
stopTime = System.currentTimeMillis();
}
this.runningState = STATE_ST... |
712 | Lang | 57 | src/java/org/apache/commons/lang/LocaleUtils.java | isAvailableLocale | public class LocaleUtils {
private static final List cAvailableLocaleList;
private static Set cAvailableLocaleSet;
private static final Map cLanguagesByCountry = Collections.synchronizedMap(new HashMap());
private static final Map cCountriesByLanguage = Collections.synchronizedMap(new HashMap());
... | return availableLocaleList().contains(locale);
}
} |
713 | Lang | 58 | src/java/org/apache/commons/lang/math/NumberUtils.java | createNumber | public class NumberUtils {
public static final Long LONG_ZERO = new Long(0L);
public static final Long LONG_ONE = new Long(1L);
public static final Long LONG_MINUS_ONE = new Long(-1L);
public static final Integer INTEGER_ZERO = new Integer(0);
public static final Integer INTEGER_ONE = new Integer(1... | if (str == null) {
return null;
}
if (StringUtils.isBlank(str)) {
throw new NumberFormatException("A blank string is not a valid number");
}
if (str.startsWith("--")) {
// this is protection for poorness in java.lang.BigDecimal.
/... |
714 | Lang | 59 | src/java/org/apache/commons/lang/text/StrBuilder.java | appendFixedWidthPadRight | public class StrBuilder implements Cloneable {
static final int CAPACITY = 32;
private static final long serialVersionUID = 7628716375283629643L;
protected char[] buffer;
protected int size;
private String newLine;
private String nullText;
public StrBuilder appendFixedWidthPadRight(Object ... | if (width > 0) {
ensureCapacity(size + width);
String str = (obj == null ? getNullText() : obj.toString());
int strLen = str.length();
if (strLen >= width) {
str.getChars(0, width, buffer, size);
} else {
int padLen = wi... |
715 | Lang | 62 | src/java/org/apache/commons/lang/Entities.java | unescape | public class Entities {
private static final String[][] BASIC_ARRAY = {
{"quot", "34"}, // " - double-quote
{"amp", "38"}, // & - ampersand
{"lt", "60"}, // < - less-than
{"gt", "62"}, // > - greater-than
};
private static final String[][] APOS_ARRAY = {
{"apos", "39... | int firstAmp = str.indexOf('&');
if (firstAmp < 0) {
return str;
}
StringBuffer buf = new StringBuffer(str.length());
buf.append(str.substring(0, firstAmp));
for (int i = firstAmp; i < str.length(); ++i) {
char ch = str.charAt(i);
if (... |
716 | Lang | 62 | src/java/org/apache/commons/lang/Entities.java | unescape | public class Entities {
private static final String[][] BASIC_ARRAY = {
{"quot", "34"}, // " - double-quote
{"amp", "38"}, // & - ampersand
{"lt", "60"}, // < - less-than
{"gt", "62"}, // > - greater-than
};
private static final String[][] APOS_ARRAY = {
{"apos", "39... | int firstAmp = string.indexOf('&');
if (firstAmp < 0) {
writer.write(string);
return;
}
writer.write(string, 0, firstAmp);
int len = string.length();
for (int i = firstAmp; i < len; i++) {
char c = string.charAt(i);
if (c =... |
717 | Lang | 63 | src/java/org/apache/commons/lang/time/DurationFormatUtils.java | format | public class DurationFormatUtils {
public static final String ISO_EXTENDED_FORMAT_PATTERN = "'P'yyyy'Y'M'M'd'DT'H'H'm'M's.S'S'";
static final Object y = "y";
static final Object M = "M";
static final Object d = "d";
static final Object H = "H";
static final Object m = "m";
static final Obje... | StringBuffer buffer = new StringBuffer();
boolean lastOutputSeconds = false;
int sz = tokens.length;
for (int i = 0; i < sz; i++) {
Token token = tokens[i];
Object value = token.getValue();
int count = token.getCount();
if (value instanceof... |
718 | Lang | 63 | src/java/org/apache/commons/lang/time/DurationFormatUtils.java | formatPeriod | public class DurationFormatUtils {
public static final String ISO_EXTENDED_FORMAT_PATTERN = "'P'yyyy'Y'M'M'd'DT'H'H'm'M's.S'S'";
static final Object y = "y";
static final Object M = "M";
static final Object d = "d";
static final Object H = "H";
static final Object m = "m";
static final Obje... | long millis = endMillis - startMillis;
if (millis < 28 * DateUtils.MILLIS_PER_DAY) {
return formatDuration(millis, format, padWithZeros);
}
Token[] tokens = lexx(format);
// timezones get funky around 0, so normalizing everything to GMT
// stops the hours b... |
719 | Lang | 64 | src/java/org/apache/commons/lang/enums/ValuedEnum.java | compareTo | public class ValuedEnum extends Enum {
private static final long serialVersionUID = -7129650521543789085L;
private final int iValue;
public int compareTo(Object other) { | if (other == this) {
return 0;
}
if (other.getClass() != this.getClass()) {
if (other.getClass().getName().equals(this.getClass().getName())) {
return iValue - getValueInOtherClassLoader(other);
}
throw new ClassCastException(
... |
720 | Lang | 65 | src/java/org/apache/commons/lang/time/DateUtils.java | modify | public class DateUtils {
public static final TimeZone UTC_TIME_ZONE = TimeZone.getTimeZone("GMT");
public static final long MILLIS_PER_SECOND = 1000;
public static final long MILLIS_PER_MINUTE = 60 * MILLIS_PER_SECOND;
public static final long MILLIS_PER_HOUR = 60 * MILLIS_PER_MINUTE;
public static... | if (val.get(Calendar.YEAR) > 280000000) {
throw new ArithmeticException("Calendar value too large for accurate calculations");
}
if (field == Calendar.MILLISECOND) {
return;
}
// ----------------- Fix for LANG-59 ---------------------- START ----... |
721 | Math | 2 | src/main/java/org/apache/commons/math3/distribution/HypergeometricDistribution.java | getNumericalMean | public class HypergeometricDistribution extends AbstractIntegerDistribution {
private static final long serialVersionUID = -436928820673516179L;
private final int numberOfSuccesses;
private final int populationSize;
private final int sampleSize;
private double numericalVariance = Double.NaN;
pr... | return getSampleSize() * (getNumberOfSuccesses() / (double) getPopulationSize());
}
} |
722 | Math | 3 | src/main/java/org/apache/commons/math3/util/MathArrays.java | linearCombination | public class MathArrays {
private static final int SPLIT_FACTOR = 0x8000001;
public static double linearCombination(final double[] a, final double[] b) throws DimensionMismatchException { | final int len = a.length;
if (len != b.length) {
throw new DimensionMismatchException(len, b.length);
}
if (len == 1) {
// Revert to scalar multiplication.
return a[0] * b[0];
}
final double[] prodHigh = new double[len];
doubl... |
723 | Math | 4 | src/main/java/org/apache/commons/math3/geometry/euclidean/threed/SubLine.java | intersection | public class SubLine {
private final Line line;
private final IntervalsSet remainingRegion;
public Vector3D intersection(final SubLine subLine, final boolean includeEndPoints) { | // compute the intersection on infinite line
Vector3D v1D = line.intersection(subLine.line);
if (v1D == null) {
return null;
}
// check location of point with respect to first sub-line
Location loc1 = remainingRegion.checkPoint(line.toSubSpace(v1D));
... |
724 | Math | 4 | src/main/java/org/apache/commons/math3/geometry/euclidean/twod/SubLine.java | intersection | public class SubLine extends AbstractSubHyperplane<Euclidean2D, Euclidean1D> {
public Vector2D intersection(final SubLine subLine, final boolean includeEndPoints) { | // retrieve the underlying lines
Line line1 = (Line) getHyperplane();
Line line2 = (Line) subLine.getHyperplane();
// compute the intersection on infinite line
Vector2D v2D = line1.intersection(line2);
if (v2D == null) {
return null;
}
// che... |
725 | Math | 5 | src/main/java/org/apache/commons/math3/complex/Complex.java | reciprocal | public class Complex implements FieldElement<Complex>, Serializable {
public static final Complex I = new Complex(0.0, 1.0);
public static final Complex NaN = new Complex(Double.NaN, Double.NaN);
public static final Complex INF = new Complex(Double.POSITIVE_INFINITY, Double.POSITIVE_INFINITY);
public s... | if (isNaN) {
return NaN;
}
if (real == 0.0 && imaginary == 0.0) {
return INF;
}
if (isInfinite) {
return ZERO;
}
if (FastMath.abs(real) < FastMath.abs(imaginary)) {
double q = real / imaginary;
double ... |
726 | Math | 6 | src/main/java/org/apache/commons/math3/optim/nonlinear/scalar/noderiv/CMAESOptimizer.java | doOptimize | public class CMAESOptimizer extends MultivariateOptimizer {
private int lambda;
private final boolean isActiveCMA;
private final int checkFeasableCount;
private double[] inputSigma;
private int dimension;
private int diagonalOnly;
private boolean isMinimize = true;
private final boolean... | // -------------------- Initialization --------------------------------
isMinimize = getGoalType().equals(GoalType.MINIMIZE);
final FitnessFunction fitfun = new FitnessFunction();
final double[] guess = getStartPoint();
// number of objective variables/problem dimension
... |
727 | Math | 6 | src/main/java/org/apache/commons/math3/optim/nonlinear/vector/jacobian/GaussNewtonOptimizer.java | doOptimize | public class GaussNewtonOptimizer extends AbstractLeastSquaresOptimizer {
private final boolean useLU;
@Override public PointVectorValuePair doOptimize() { | checkParameters();
final ConvergenceChecker<PointVectorValuePair> checker
= getConvergenceChecker();
// Computation will be useless without a checker (see "for-loop").
if (checker == null) {
throw new NullArgumentException();
}
final double[] ta... |
728 | Math | 6 | src/main/java/org/apache/commons/math3/optim/nonlinear/vector/jacobian/LevenbergMarquardtOptimizer.java | doOptimize | public class LevenbergMarquardtOptimizer extends AbstractLeastSquaresOptimizer {
private int solvedCols;
private double[] diagR;
private double[] jacNorm;
private double[] beta;
private int[] permutation;
private int rank;
private double lmPar;
private double[] lmDir;
private final ... | checkParameters();
final int nR = getTarget().length; // Number of observed data.
final double[] currentPoint = getStartPoint();
final int nC = currentPoint.length; // Number of parameters.
// arrays shared with the other private methods
solvedCols = FastMath.min(nR, n... |
729 | Math | 6 | src/main/java/org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizer.java | doOptimize | public class NonLinearConjugateGradientOptimizer extends GradientMultivariateOptimizer {
private final Formula updateFormula;
private final Preconditioner preconditioner;
private final UnivariateSolver solver;
private double initialStep = 1;
@Override protected PointValuePair doOptimize() { | final ConvergenceChecker<PointValuePair> checker = getConvergenceChecker();
final double[] point = getStartPoint();
final GoalType goal = getGoalType();
final int n = point.length;
double[] r = computeObjectiveGradient(point);
if (goal == GoalType.MINIMIZE) {
... |
730 | Math | 6 | src/main/java/org/apache/commons/math3/optim/nonlinear/scalar/noderiv/PowellOptimizer.java | doOptimize | public class PowellOptimizer extends MultivariateOptimizer {
private static final double MIN_RELATIVE_TOLERANCE = 2 * FastMath.ulp(1d);
private final double relativeThreshold;
private final double absoluteThreshold;
private final LineSearch line;
@Override protected PointValuePair doOptimize() { | checkParameters();
final GoalType goal = getGoalType();
final double[] guess = getStartPoint();
final int n = guess.length;
final double[][] direc = new double[n][n];
for (int i = 0; i < n; i++) {
direc[i][i] = 1;
}
final ConvergenceChecker<... |
731 | Math | 6 | src/main/java/org/apache/commons/math3/optim/nonlinear/scalar/noderiv/SimplexOptimizer.java | doOptimize | public class SimplexOptimizer extends MultivariateOptimizer {
private AbstractSimplex simplex;
@Override protected PointValuePair doOptimize() { | checkParameters();
// Indirect call to "computeObjectiveValue" in order to update the
// evaluations counter.
final MultivariateFunction evalFunc
= new MultivariateFunction() {
public double value(double[] point) {
return computeObjectiveV... |
732 | Math | 7 | src/main/java/org/apache/commons/math3/ode/AbstractIntegrator.java | acceptStep | public class AbstractIntegrator implements FirstOrderIntegrator {
protected Collection<StepHandler> stepHandlers;
protected double stepStart;
protected double stepSize;
protected boolean isLastStep;
protected boolean resetOccurred;
private Collection<EventState> eventsStates;
private boolea... | double previousT = interpolator.getGlobalPreviousTime();
final double currentT = interpolator.getGlobalCurrentTime();
// initialize the events states if needed
if (! statesInitialized) {
for (EventState state : eventsStates) {
state.re... |
733 | Math | 8 | src/main/java/org/apache/commons/math3/distribution/DiscreteDistribution.java | sample | public class DiscreteDistribution {
protected final RandomGenerator random;
private final List<T> singletons;
private final double[] probabilities;
public Object[] sample(int sampleSize) throws NotStrictlyPositiveException { | if (sampleSize <= 0) {
throw new NotStrictlyPositiveException(LocalizedFormats.NUMBER_OF_SAMPLES,
sampleSize);
}
final Object[] out = new Object[sampleSize];
for (int i = 0; i < sampleSize; i++) {
out[i] = sample();
}
return ... |
734 | Math | 9 | src/main/java/org/apache/commons/math3/geometry/euclidean/threed/Line.java | revert | public class Line implements Embedding<Euclidean3D, Euclidean1D> {
private Vector3D direction;
private Vector3D zero;
public Line revert() { | final Line reverted = new Line(this);
reverted.direction = reverted.direction.negate();
return reverted;
}
} |
735 | Math | 10 | src/main/java/org/apache/commons/math3/analysis/differentiation/DSCompiler.java | atan2 | public class DSCompiler {
private static AtomicReference<DSCompiler[][]> compilers =
new AtomicReference<DSCompiler[][]>(null);
private final int parameters;
private final int order;
private final int[][] sizes;
private final int[][] derivativesIndirection;
private final int[] lower... | // compute r = sqrt(x^2+y^2)
double[] tmp1 = new double[getSize()];
multiply(x, xOffset, x, xOffset, tmp1, 0); // x^2
double[] tmp2 = new double[getSize()];
multiply(y, yOffset, y, yOffset, tmp2, 0); // y^2
add(tmp1, 0, tmp2, 0, tmp2, 0); // x^2 ... |
736 | Math | 11 | src/main/java/org/apache/commons/math3/distribution/MultivariateNormalDistribution.java | density | public class MultivariateNormalDistribution extends AbstractMultivariateRealDistribution {
private final double[] means;
private final RealMatrix covarianceMatrix;
private final RealMatrix covarianceMatrixInverse;
private final double covarianceMatrixDeterminant;
private final RealMatrix samplingMa... | final int dim = getDimension();
if (vals.length != dim) {
throw new DimensionMismatchException(vals.length, dim);
}
return FastMath.pow(2 * FastMath.PI, -0.5 * dim) *
FastMath.pow(covarianceMatrixDeterminant, -0.5) *
getExponentTerm(vals);
}
} |
737 | Math | 13 | src/main/java/org/apache/commons/math3/optimization/general/AbstractLeastSquaresOptimizer.java | squareRoot | public class AbstractLeastSquaresOptimizer extends BaseAbstractMultivariateVectorOptimizer<DifferentiableMultivariateVectorFunction> implements DifferentiableMultivariateVectorOptimizer {
@Deprecated
private static final double DEFAULT_SINGULARITY_THRESHOLD = 1e-14;
@Deprecated
protected double[][] wei... | if (m instanceof DiagonalMatrix) {
final int dim = m.getRowDimension();
final RealMatrix sqrtM = new DiagonalMatrix(dim);
for (int i = 0; i < dim; i++) {
sqrtM.setEntry(i, i, FastMath.sqrt(m.getEntry(i, i)));
}
return sqrtM;
} el... |
738 | Math | 16 | src/main/java/org/apache/commons/math3/util/FastMath.java | cosh | public class FastMath {
private static final double LOG_MAX_VALUE = StrictMath.log(Double.MAX_VALUE);
public static final double PI = 105414357.0 / 33554432.0 + 1.984187159361080883e-9;
public static final double E = 2850325.0 / 1048576.0 + 8.254840070411028747e-8;
static final int EXP_INT_TABLE_MAX_IN... | if (x != x) {
return x;
}
// cosh[z] = (exp(z) + exp(-z))/2
// for numbers with magnitude 20 or so,
// exp(-z) can be ignored in comparison with exp(z)
if (x > 20) {
if (x >= LOG_MAX_VALUE) {
// Avoid overflow (MATH-905).
final doubl... |
739 | Math | 17 | src/main/java/org/apache/commons/math3/dfp/Dfp.java | multiply | public class Dfp implements FieldElement<Dfp> {
public static final int RADIX = 10000;
public static final int MIN_EXP = -32767;
public static final int MAX_EXP = 32768;
public static final int ERR_SCALE = 32760;
public static final byte FINITE = 0;
public static final byte INFINITE = 1;
p... | if (x >= 0 && x < RADIX) {
return multiplyFast(x);
} else {
return multiply(newInstance(x));
}
}
} |
740 | Math | 19 | src/main/java/org/apache/commons/math3/optimization/direct/CMAESOptimizer.java | checkParameters | public class CMAESOptimizer extends BaseAbstractMultivariateSimpleBoundsOptimizer<MultivariateFunction> implements MultivariateOptimizer {
public static final int DEFAULT_CHECKFEASABLECOUNT = 0;
public static final double DEFAULT_STOPFITNESS = 0;
public static final boolean DEFAULT_ISACTIVECMA = true;
... | final double[] init = getStartPoint();
final double[] lB = getLowerBound();
final double[] uB = getUpperBound();
// Checks whether there is at least one finite bound value.
boolean hasFiniteBounds = false;
for (int i = 0; i < lB.length; i++) {
if (!Double.isI... |
741 | Math | 22 | src/main/java/org/apache/commons/math3/distribution/FDistribution.java | isSupportLowerBoundInclusive | public class FDistribution extends AbstractRealDistribution {
public static final double DEFAULT_INVERSE_ABSOLUTE_ACCURACY = 1e-9;
private static final long serialVersionUID = -8516354193418641566L;
private final double numeratorDegreesOfFreedom;
private final double denominatorDegreesOfFreedom;
pr... | return false;
}
} |
742 | Math | 22 | src/main/java/org/apache/commons/math3/distribution/UniformRealDistribution.java | isSupportUpperBoundInclusive | public class UniformRealDistribution extends AbstractRealDistribution {
public static final double DEFAULT_INVERSE_ABSOLUTE_ACCURACY = 1e-9;
private static final long serialVersionUID = 20120109L;
private final double lower;
private final double upper;
private final double solverAbsoluteAccuracy;
... | return true;
}
} |
743 | Math | 23 | src/main/java/org/apache/commons/math3/optimization/univariate/BrentOptimizer.java | doOptimize | public class BrentOptimizer extends BaseAbstractUnivariateOptimizer {
private static final double GOLDEN_SECTION = 0.5 * (3 - FastMath.sqrt(5));
private static final double MIN_RELATIVE_TOLERANCE = 2 * FastMath.ulp(1d);
private final double relativeThreshold;
private final double absoluteThreshold;
... | final boolean isMinim = getGoalType() == GoalType.MINIMIZE;
final double lo = getMin();
final double mid = getStartValue();
final double hi = getMax();
// Optional additional convergence criteria.
final ConvergenceChecker<UnivariatePointValuePair> checker
= g... |
744 | Math | 24 | src/main/java/org/apache/commons/math3/optimization/univariate/BrentOptimizer.java | doOptimize | public class BrentOptimizer extends BaseAbstractUnivariateOptimizer {
private static final double GOLDEN_SECTION = 0.5 * (3 - FastMath.sqrt(5));
private static final double MIN_RELATIVE_TOLERANCE = 2 * FastMath.ulp(1d);
private final double relativeThreshold;
private final double absoluteThreshold;
... | final boolean isMinim = getGoalType() == GoalType.MINIMIZE;
final double lo = getMin();
final double mid = getStartValue();
final double hi = getMax();
// Optional additional convergence criteria.
final ConvergenceChecker<UnivariatePointValuePair> checker
= g... |
745 | Math | 27 | src/main/java/org/apache/commons/math3/fraction/Fraction.java | percentageValue | public class Fraction extends Number implements FieldElement<Fraction>, Comparable<Fraction>, Serializable {
public static final Fraction TWO = new Fraction(2, 1);
public static final Fraction ONE = new Fraction(1, 1);
public static final Fraction ZERO = new Fraction(0, 1);
public static final Fraction... | return 100 * doubleValue();
}
} |
746 | Math | 28 | src/main/java/org/apache/commons/math3/optimization/linear/SimplexSolver.java | getPivotRow | public class SimplexSolver extends AbstractLinearOptimizer {
private static final double DEFAULT_EPSILON = 1.0e-6;
private static final int DEFAULT_ULPS = 10;
private final double epsilon;
private final int maxUlps;
private Integer getPivotRow(SimplexTableau tableau, final int col) { | // create a list of all the rows that tie for the lowest score in the minimum ratio test
List<Integer> minRatioPositions = new ArrayList<Integer>();
double minRatio = Double.MAX_VALUE;
for (int i = tableau.getNumObjectiveFunctions(); i < tableau.getHeight(); i++) {
final doub... |
747 | Math | 29 | src/main/java/org/apache/commons/math3/linear/OpenMapRealVector.java | ebeDivide | public class OpenMapRealVector extends SparseRealVector implements Serializable {
public static final double DEFAULT_ZERO_TOLERANCE = 1.0e-12;
private static final long serialVersionUID = 8772222695580707260L;
private final OpenIntToDoubleHashMap entries;
private final int virtualSize;
private fina... | checkVectorDimensions(v.getDimension());
OpenMapRealVector res = new OpenMapRealVector(this);
/*
* MATH-803: it is not sufficient to loop through non zero entries of
* this only. Indeed, if this[i] = 0d and v[i] = 0d, then
* this[i] / v[i] = NaN, and not 0d.
*... |
748 | Math | 29 | src/main/java/org/apache/commons/math3/linear/OpenMapRealVector.java | ebeMultiply | public class OpenMapRealVector extends SparseRealVector implements Serializable {
public static final double DEFAULT_ZERO_TOLERANCE = 1.0e-12;
private static final long serialVersionUID = 8772222695580707260L;
private final OpenIntToDoubleHashMap entries;
private final int virtualSize;
private fina... | checkVectorDimensions(v.getDimension());
OpenMapRealVector res = new OpenMapRealVector(this);
Iterator iter = entries.iterator();
while (iter.hasNext()) {
iter.advance();
res.setEntry(iter.key(), iter.value() * v.getEntry(iter.key()));
}
/*
... |
749 | Math | 30 | src/main/java/org/apache/commons/math3/stat/inference/MannWhitneyUTest.java | calculateAsymptoticPValue | public class MannWhitneyUTest {
private NaturalRanking naturalRanking;
private double calculateAsymptoticPValue(final double Umin, final int n1, final int n2) throws ConvergenceException, MaxCountExceededException { | final double n1n2prod = n1 * n2;
// http://en.wikipedia.org/wiki/Mann%E2%80%93Whitney_U#Normal_approximation
final double EU = n1n2prod / 2.0;
final double VarU = n1n2prod * (n1 + n2 + 1) / 12.0;
final double z = (Umin - EU) / FastMath.sqrt(VarU);
final NormalDistribut... |
750 | Math | 32 | src/main/java/org/apache/commons/math3/geometry/euclidean/twod/PolygonsSet.java | computeGeometricalProperties | public class PolygonsSet extends AbstractRegion<Euclidean2D, Euclidean1D> {
private Vector2D[][] vertices;
@Override protected void computeGeometricalProperties() { | final Vector2D[][] v = getVertices();
if (v.length == 0) {
final BSPTree<Euclidean2D> tree = getTree(false);
if (tree.getCut() == null && (Boolean) tree.getAttribute()) {
// the instance covers the whole space
setSize(Double.POSITIVE_INFINITY);
... |
751 | Math | 33 | src/main/java/org/apache/commons/math3/optimization/linear/SimplexTableau.java | dropPhase1Objective | public class SimplexTableau implements Serializable {
private static final String NEGATIVE_VAR_COLUMN_LABEL = "x-";
private static final int DEFAULT_ULPS = 10;
private static final long serialVersionUID = -1369660067587938365L;
private final LinearObjectiveFunction f;
private final List<LinearConst... | if (getNumObjectiveFunctions() == 1) {
return;
}
List<Integer> columnsToDrop = new ArrayList<Integer>();
columnsToDrop.add(0);
// positive cost non-artificial variables
for (int i = getNumObjectiveFunctions(); i < getArtificialVariableOffset(); i++) {
... |
752 | Math | 34 | src/main/java/org/apache/commons/math3/genetics/ListPopulation.java | iterator | public class ListPopulation implements Population {
private List<Chromosome> chromosomes;
private int populationLimit;
public Iterator<Chromosome> iterator() { | return getChromosomes().iterator();
}
} |
753 | Math | 36 | src/main/java/org/apache/commons/math/fraction/BigFraction.java | doubleValue | public class BigFraction extends Number implements FieldElement<BigFraction>, Comparable<BigFraction>, Serializable {
public static final BigFraction TWO = new BigFraction(2);
public static final BigFraction ONE = new BigFraction(1);
public static final BigFraction ZERO = new BigFraction(0);
public sta... | double result = numerator.doubleValue() / denominator.doubleValue();
if (Double.isNaN(result)) {
// Numerator and/or denominator must be out of range:
// Calculate how far to shift them to put them in range.
int shift = Math.max(numerator.bitLength(),
... |
754 | Math | 36 | src/main/java/org/apache/commons/math/fraction/BigFraction.java | floatValue | public class BigFraction extends Number implements FieldElement<BigFraction>, Comparable<BigFraction>, Serializable {
public static final BigFraction TWO = new BigFraction(2);
public static final BigFraction ONE = new BigFraction(1);
public static final BigFraction ZERO = new BigFraction(0);
public sta... | float result = numerator.floatValue() / denominator.floatValue();
if (Double.isNaN(result)) {
// Numerator and/or denominator must be out of range:
// Calculate how far to shift them to put them in range.
int shift = Math.max(numerator.bitLength(),
... |
755 | Math | 37 | src/main/java/org/apache/commons/math/complex/Complex.java | tan | public class Complex implements FieldElement<Complex>, Serializable {
public static final Complex I = new Complex(0.0, 1.0);
public static final Complex NaN = new Complex(Double.NaN, Double.NaN);
public static final Complex INF = new Complex(Double.POSITIVE_INFINITY, Double.POSITIVE_INFINITY);
public s... | if (isNaN || Double.isInfinite(real)) {
return NaN;
}
if (imaginary > 20.0) {
return createComplex(0.0, 1.0);
}
if (imaginary < -20.0) {
return createComplex(0.0, -1.0);
}
double real2 = 2.0 * real;
double imaginary2 = ... |
756 | Math | 37 | src/main/java/org/apache/commons/math/complex/Complex.java | tanh | public class Complex implements FieldElement<Complex>, Serializable {
public static final Complex I = new Complex(0.0, 1.0);
public static final Complex NaN = new Complex(Double.NaN, Double.NaN);
public static final Complex INF = new Complex(Double.POSITIVE_INFINITY, Double.POSITIVE_INFINITY);
public s... | if (isNaN || Double.isInfinite(imaginary)) {
return NaN;
}
if (real > 20.0) {
return createComplex(1.0, 0.0);
}
if (real < -20.0) {
return createComplex(-1.0, 0.0);
}
double real2 = 2.0 * real;
double imaginary2 = 2.0 * ... |
757 | Math | 38 | src/main/java/org/apache/commons/math/optimization/direct/BOBYQAOptimizer.java | prelim | public class BOBYQAOptimizer extends BaseAbstractMultivariateSimpleBoundsOptimizer<MultivariateFunction> implements MultivariateOptimizer {
public static final int MINIMUM_PROBLEM_DIMENSION = 2;
public static final double DEFAULT_INITIAL_RADIUS = 10.0;
public static final double DEFAULT_STOPPING_RADIUS = 1... | printMethod(); // XXX
final int n = currentBest.getDimension();
final int npt = numberOfInterpolationPoints;
final int ndim = bMatrix.getRowDimension();
final double rhosq = initialTrustRegionRadius * initialTrustRegionRadius;
final double recip = 1d / rhosq;
fi... |
758 | Math | 39 | src/main/java/org/apache/commons/math/ode/nonstiff/EmbeddedRungeKuttaIntegrator.java | integrate | public class EmbeddedRungeKuttaIntegrator extends AdaptiveStepsizeIntegrator {
private final boolean fsal;
private final double[] c;
private final double[][] a;
private final double[] b;
private final RungeKuttaStepInterpolator prototype;
private final double exp;
private double safety;
... | sanityChecks(equations, t);
setEquations(equations);
final boolean forward = t > equations.getTime();
// create some internal working arrays
final double[] y0 = equations.getCompleteState();
final double[] y = y0.clone();
final int stages = c.length + 1;
final double[][] yDotK = new do... |
759 | Math | 40 | src/main/java/org/apache/commons/math/analysis/solvers/BracketingNthOrderBrentSolver.java | doSolve | public class BracketingNthOrderBrentSolver extends AbstractUnivariateRealSolver implements BracketedUnivariateRealSolver<UnivariateFunction> {
private static final double DEFAULT_ABSOLUTE_ACCURACY = 1e-6;
private static final int DEFAULT_MAXIMAL_ORDER = 5;
private static final int MAXIMAL_AGING = 2;
pr... | // prepare arrays with the first points
final double[] x = new double[maximalOrder + 1];
final double[] y = new double[maximalOrder + 1];
x[0] = getMin();
x[1] = getStartValue();
x[2] = getMax();
verifySequence(x[0], x[1], x[2]);
// evaluate initial guess... |
760 | Math | 41 | src/main/java/org/apache/commons/math/stat/descriptive/moment/Variance.java | evaluate | public class Variance extends AbstractStorelessUnivariateStatistic implements Serializable, WeightedEvaluation {
private static final long serialVersionUID = -9111962718267217978L;
protected SecondMoment moment = null;
protected boolean incMoment = true;
private boolean isBiasCorrected = true;
pub... | double var = Double.NaN;
if (test(values, weights, begin, length)) {
if (length == 1) {
var = 0.0;
} else if (length > 1) {
double accum = 0.0;
double dev = 0.0;
double accum2 = 0.0;
for (int i = beg... |
761 | Math | 42 | src/main/java/org/apache/commons/math/optimization/linear/SimplexTableau.java | getSolution | public class SimplexTableau implements Serializable {
private static final String NEGATIVE_VAR_COLUMN_LABEL = "x-";
private static final int DEFAULT_ULPS = 10;
private static final long serialVersionUID = -1369660067587938365L;
private final LinearObjectiveFunction f;
private final List<LinearConst... | int negativeVarColumn = columnLabels.indexOf(NEGATIVE_VAR_COLUMN_LABEL);
Integer negativeVarBasicRow = negativeVarColumn > 0 ? getBasicRow(negativeVarColumn) : null;
double mostNegative = negativeVarBasicRow == null ? 0 : getEntry(negativeVarBasicRow, getRhsOffset());
Set<Integer> basicRows = n... |
762 | Math | 43 | src/main/java/org/apache/commons/math/stat/descriptive/SummaryStatistics.java | addValue | public class SummaryStatistics implements StatisticalSummary, Serializable {
private static final long serialVersionUID = -2021321786743555871L;
protected long n = 0;
protected SecondMoment secondMoment = new SecondMoment();
protected Sum sum = new Sum();
protected SumOfSquares sumsq = new SumOfSqu... | sumImpl.increment(value);
sumsqImpl.increment(value);
minImpl.increment(value);
maxImpl.increment(value);
sumLogImpl.increment(value);
secondMoment.increment(value);
// If mean, variance or geomean have been overridden,
// need to increment these
i... |
763 | Math | 44 | src/main/java/org/apache/commons/math/ode/AbstractIntegrator.java | acceptStep | public class AbstractIntegrator implements FirstOrderIntegrator {
protected Collection<StepHandler> stepHandlers;
protected double stepStart;
protected double stepSize;
protected boolean isLastStep;
protected boolean resetOccurred;
private Collection<EventState> eventsStates;
private boolea... | double previousT = interpolator.getGlobalPreviousTime();
final double currentT = interpolator.getGlobalCurrentTime();
// initialize the events states if needed
if (! statesInitialized) {
for (EventState state : eventsStates) {
state.re... |
764 | Math | 46 | src/main/java/org/apache/commons/math/complex/Complex.java | divide | public class Complex implements FieldElement<Complex>, Serializable {
public static final Complex I = new Complex(0.0, 1.0);
public static final Complex NaN = new Complex(Double.NaN, Double.NaN);
public static final Complex INF = new Complex(Double.POSITIVE_INFINITY, Double.POSITIVE_INFINITY);
public s... | MathUtils.checkNotNull(divisor);
if (isNaN || divisor.isNaN) {
return NaN;
}
if (divisor.isZero) {
// return isZero ? NaN : INF; // See MATH-657
return NaN;
}
if (divisor.isInfinite() && !isInfinite()) {
return ZERO;
... |
765 | Math | 46 | src/main/java/org/apache/commons/math/complex/Complex.java | divide | public class Complex implements FieldElement<Complex>, Serializable {
public static final Complex I = new Complex(0.0, 1.0);
public static final Complex NaN = new Complex(Double.NaN, Double.NaN);
public static final Complex INF = new Complex(Double.POSITIVE_INFINITY, Double.POSITIVE_INFINITY);
public s... | if (isNaN || Double.isNaN(divisor)) {
return NaN;
}
if (divisor == 0d) {
// return isZero ? NaN : INF; // See MATH-657
return NaN;
}
if (Double.isInfinite(divisor)) {
return !isInfinite() ? ZERO : NaN;
}
return creat... |
766 | Math | 47 | src/main/java/org/apache/commons/math/complex/Complex.java | divide | public class Complex implements FieldElement<Complex>, Serializable {
public static final Complex I = new Complex(0.0, 1.0);
public static final Complex NaN = new Complex(Double.NaN, Double.NaN);
public static final Complex INF = new Complex(Double.POSITIVE_INFINITY, Double.POSITIVE_INFINITY);
public s... | MathUtils.checkNotNull(divisor);
if (isNaN || divisor.isNaN) {
return NaN;
}
if (divisor.isZero) {
return isZero ? NaN : INF;
}
if (divisor.isInfinite() && !isInfinite()) {
return ZERO;
}
final double c = divisor.getR... |
767 | Math | 47 | src/main/java/org/apache/commons/math/complex/Complex.java | divide | public class Complex implements FieldElement<Complex>, Serializable {
public static final Complex I = new Complex(0.0, 1.0);
public static final Complex NaN = new Complex(Double.NaN, Double.NaN);
public static final Complex INF = new Complex(Double.POSITIVE_INFINITY, Double.POSITIVE_INFINITY);
public s... | if (isNaN || Double.isNaN(divisor)) {
return NaN;
}
if (divisor == 0d) {
return isZero ? NaN : INF;
}
if (Double.isInfinite(divisor)) {
return !isInfinite() ? ZERO : NaN;
}
return createComplex(real / divisor,
... |
768 | Math | 48 | src/main/java/org/apache/commons/math/analysis/solvers/BaseSecantSolver.java | doSolve | public class BaseSecantSolver extends AbstractUnivariateRealSolver implements BracketedUnivariateRealSolver<UnivariateRealFunction> {
protected static final double DEFAULT_ABSOLUTE_ACCURACY = 1e-6;
private AllowedSolution allowed;
private final Method method;
protected final double doSolve() { | // Get initial solution
double x0 = getMin();
double x1 = getMax();
double f0 = computeObjectiveValue(x0);
double f1 = computeObjectiveValue(x1);
// If one of the bounds is the exact root, return it. Since these are
// not under-approximations or over-approximati... |
769 | Math | 50 | src/main/java/org/apache/commons/math/analysis/solvers/BaseSecantSolver.java | doSolve | public class BaseSecantSolver extends AbstractUnivariateRealSolver implements BracketedUnivariateRealSolver<UnivariateRealFunction> {
protected static final double DEFAULT_ABSOLUTE_ACCURACY = 1e-6;
private AllowedSolution allowed;
private final Method method;
protected final double doSolve() { | // Get initial solution
double x0 = getMin();
double x1 = getMax();
double f0 = computeObjectiveValue(x0);
double f1 = computeObjectiveValue(x1);
// If one of the bounds is the exact root, return it. Since these are
// not under-approximations or over-approximati... |
770 | Math | 51 | src/main/java/org/apache/commons/math/analysis/solvers/BaseSecantSolver.java | doSolve | public class BaseSecantSolver extends AbstractUnivariateRealSolver implements BracketedUnivariateRealSolver<UnivariateRealFunction> {
protected static final double DEFAULT_ABSOLUTE_ACCURACY = 1e-6;
private AllowedSolution allowed;
private final Method method;
protected final double doSolve() { | // Get initial solution
double x0 = getMin();
double x1 = getMax();
double f0 = computeObjectiveValue(x0);
double f1 = computeObjectiveValue(x1);
// If one of the bounds is the exact root, return it. Since these are
// not under-approximations or over-approximati... |
771 | Math | 53 | src/main/java/org/apache/commons/math/complex/Complex.java | add | public class Complex implements FieldElement<Complex>, Serializable {
public static final Complex I = new Complex(0.0, 1.0);
public static final Complex NaN = new Complex(Double.NaN, Double.NaN);
public static final Complex INF = new Complex(Double.POSITIVE_INFINITY, Double.POSITIVE_INFINITY);
public s... | MathUtils.checkNotNull(rhs);
if (isNaN || rhs.isNaN) {
return NaN;
}
return createComplex(real + rhs.getReal(),
imaginary + rhs.getImaginary());
}
} |
772 | Math | 54 | src/main/java/org/apache/commons/math/dfp/Dfp.java | toDouble | public class Dfp implements FieldElement<Dfp> {
public static final int RADIX = 10000;
public static final int MIN_EXP = -32767;
public static final int MAX_EXP = 32768;
public static final int ERR_SCALE = 32760;
public static final byte FINITE = 0;
public static final byte INFINITE = 1;
p... | if (isInfinite()) {
if (lessThan(getZero())) {
return Double.NEGATIVE_INFINITY;
} else {
return Double.POSITIVE_INFINITY;
}
}
if (isNaN()) {
return Double.NaN;
}
Dfp y = this;
boolean negate... |
773 | Math | 55 | src/main/java/org/apache/commons/math/geometry/Vector3D.java | crossProduct | public class Vector3D implements Serializable {
public static final Vector3D ZERO = new Vector3D(0, 0, 0);
public static final Vector3D PLUS_I = new Vector3D(1, 0, 0);
public static final Vector3D MINUS_I = new Vector3D(-1, 0, 0);
public static final Vector3D PLUS_J = new Vector3D(0, 1, 0);
publi... | final double n1 = v1.getNormSq();
final double n2 = v2.getNormSq();
if ((n1 * n2) < MathUtils.SAFE_MIN) {
return ZERO;
}
// rescale both vectors without losing precision,
// to ensure their norm are the same order of magnitude
final int deltaExp = (FastMath.getExpone... |
774 | Math | 56 | src/main/java/org/apache/commons/math/util/MultidimensionalCounter.java | getCounts | public class MultidimensionalCounter implements Iterable<Integer> {
private final int dimension;
private final int[] uniCounterOffset;
private final int[] size;
private final int totalSize;
private final int last;
public int[] getCounts(int index) { | if (index < 0 ||
index >= totalSize) {
throw new OutOfRangeException(index, 0, totalSize);
}
final int[] indices = new int[dimension];
int count = 0;
for (int i = 0; i < last; i++) {
int idx = 0;
final int offset = uniCounterOffse... |
775 | Math | 57 | src/main/java/org/apache/commons/math/stat/clustering/KMeansPlusPlusClusterer.java | chooseInitialCenters | public class KMeansPlusPlusClusterer {
private final Random random;
private final EmptyClusterStrategy emptyStrategy;
private static <T extends Clusterable<T>> List<Cluster<T>> chooseInitialCenters(final Collection<T> points, final int k, final Random random) { | final List<T> pointSet = new ArrayList<T>(points);
final List<Cluster<T>> resultSet = new ArrayList<Cluster<T>>();
// Choose one center uniformly at random from among the data points.
final T firstPoint = pointSet.remove(random.nextInt(pointSet.size()));
resultSet.add(new Cluste... |
776 | Math | 60 | src/main/java/org/apache/commons/math/distribution/NormalDistributionImpl.java | cumulativeProbability | public class NormalDistributionImpl extends AbstractContinuousDistribution implements NormalDistribution, Serializable {
public static final double DEFAULT_INVERSE_ABSOLUTE_ACCURACY = 1e-9;
private static final long serialVersionUID = 8589540077390120676L;
private static final double SQRT2PI = FastMath.sqr... | final double dev = x - mean;
if (FastMath.abs(dev) > 40 * standardDeviation) {
return dev < 0 ? 0.0d : 1.0d;
}
return 0.5 * (1.0 + Erf.erf((dev) /
(standardDeviation * FastMath.sqrt(2.0))));
}
} |
777 | Math | 62 | src/main/java/org/apache/commons/math/optimization/univariate/MultiStartUnivariateRealOptimizer.java | optimize | public class MultiStartUnivariateRealOptimizer implements BaseUnivariateRealOptimizer<FUNC> {
private final BaseUnivariateRealOptimizer<FUNC> optimizer;
private int maxEvaluations;
private int totalEvaluations;
private int starts;
private RandomGenerator generator;
private UnivariateRealPointVa... | return optimize(f, goal, min, max, min + 0.5 * (max - min));
}
} |
778 | Math | 62 | src/main/java/org/apache/commons/math/optimization/univariate/MultiStartUnivariateRealOptimizer.java | optimize | public class MultiStartUnivariateRealOptimizer implements BaseUnivariateRealOptimizer<FUNC> {
private final BaseUnivariateRealOptimizer<FUNC> optimizer;
private int maxEvaluations;
private int totalEvaluations;
private int starts;
private RandomGenerator generator;
private UnivariateRealPointVa... | optima = new UnivariateRealPointValuePair[starts];
totalEvaluations = 0;
// Multi-start loop.
for (int i = 0; i < starts; ++i) {
try {
final double s = (i == 0) ? startValue : min + generator.nextDouble() * (max - min);
optima[i] = optimizer.o... |
779 | Math | 63 | src/main/java/org/apache/commons/math/util/MathUtils.java | equals | public class MathUtils {
public static final double EPSILON = 0x1.0p-53;
public static final double SAFE_MIN = 0x1.0p-1022;
public static final double TWO_PI = 2 * FastMath.PI;
private static final byte NB = (byte)-1;
private static final short NS = (short)-1;
private static final byte PB = (... | return equals(x, y, 1);
}
} |
780 | Math | 64 | src/main/java/org/apache/commons/math/optimization/general/LevenbergMarquardtOptimizer.java | doOptimize | public class LevenbergMarquardtOptimizer extends AbstractLeastSquaresOptimizer {
private int solvedCols;
private double[] diagR;
private double[] jacNorm;
private double[] beta;
private int[] permutation;
private int rank;
private double lmPar;
private double[] lmDir;
private double... | // arrays shared with the other private methods
solvedCols = Math.min(rows, cols);
diagR = new double[cols];
jacNorm = new double[cols];
beta = new double[cols];
permutation = new int[cols];
lmDir = new double[cols];
// local point... |
781 | Math | 65 | src/main/java/org/apache/commons/math/optimization/general/AbstractLeastSquaresOptimizer.java | getChiSquare | public class AbstractLeastSquaresOptimizer implements DifferentiableMultivariateVectorialOptimizer {
public static final int DEFAULT_MAX_ITERATIONS = 100;
protected VectorialConvergenceChecker checker;
protected double[][] jacobian;
protected int cols;
protected int rows;
protected double[] tar... | double chiSquare = 0;
for (int i = 0; i < rows; ++i) {
final double residual = residuals[i];
chiSquare += residual * residual * residualsWeights[i];
}
return chiSquare;
}
} |
782 | Math | 65 | src/main/java/org/apache/commons/math/optimization/general/AbstractLeastSquaresOptimizer.java | getRMS | public class AbstractLeastSquaresOptimizer implements DifferentiableMultivariateVectorialOptimizer {
public static final int DEFAULT_MAX_ITERATIONS = 100;
protected VectorialConvergenceChecker checker;
protected double[][] jacobian;
protected int cols;
protected int rows;
protected double[] tar... | return Math.sqrt(getChiSquare() / rows);
}
} |
783 | Math | 66 | src/main/java/org/apache/commons/math/optimization/univariate/BrentOptimizer.java | localMin | public class BrentOptimizer extends AbstractUnivariateRealOptimizer {
private static final double GOLDEN_SECTION = 0.5 * (3 - Math.sqrt(5));
private double localMin(boolean isMinim, double lo, double mid, double hi, double eps, double t) throws MaxIterationsExceededException, FunctionEvaluationException { | if (eps <= 0) {
throw new NotStrictlyPositiveException(eps);
}
if (t <= 0) {
throw new NotStrictlyPositiveException(t);
}
double a, b;
if (lo < hi) {
a = lo;
b = hi;
} else {
a = hi;
b = lo;
... |
784 | Math | 67 | src/main/java/org/apache/commons/math/optimization/MultiStartUnivariateRealOptimizer.java | getResult | public class MultiStartUnivariateRealOptimizer implements UnivariateRealOptimizer {
private static final long serialVersionUID = 5983375963110961019L;
private final UnivariateRealOptimizer optimizer;
private int maxIterations;
private int maxEvaluations;
private int totalIterations;
private int... | return optima[0];
}
} |
785 | Math | 68 | src/main/java/org/apache/commons/math/optimization/general/LevenbergMarquardtOptimizer.java | doOptimize | public class LevenbergMarquardtOptimizer extends AbstractLeastSquaresOptimizer {
private int solvedCols;
private double[] diagR;
private double[] jacNorm;
private double[] beta;
private int[] permutation;
private int rank;
private double lmPar;
private double[] lmDir;
private double... | // arrays shared with the other private methods
solvedCols = Math.min(rows, cols);
diagR = new double[cols];
jacNorm = new double[cols];
beta = new double[cols];
permutation = new int[cols];
lmDir = new double[cols];
// local point... |
786 | Math | 69 | src/main/java/org/apache/commons/math/stat/correlation/PearsonsCorrelation.java | getCorrelationPValues | public class PearsonsCorrelation {
private final RealMatrix correlationMatrix;
private final int nObs;
public RealMatrix getCorrelationPValues() throws MathException { | TDistribution tDistribution = new TDistributionImpl(nObs - 2);
int nVars = correlationMatrix.getColumnDimension();
double[][] out = new double[nVars][nVars];
for (int i = 0; i < nVars; i++) {
for (int j = 0; j < nVars; j++) {
if (i == j) {
... |
787 | Math | 70 | src/main/java/org/apache/commons/math/analysis/solvers/BisectionSolver.java | solve | public class BisectionSolver extends UnivariateRealSolverImpl {
public double solve(final UnivariateRealFunction f, double min, double max, double initial) throws MaxIterationsExceededException, FunctionEvaluationException { | return solve(f, min, max);
}
} |
788 | Math | 71 | src/main/java/org/apache/commons/math/ode/nonstiff/EmbeddedRungeKuttaIntegrator.java | integrate | public class EmbeddedRungeKuttaIntegrator extends AdaptiveStepsizeIntegrator {
private final boolean fsal;
private final double[] c;
private final double[][] a;
private final double[] b;
private final RungeKuttaStepInterpolator prototype;
private final double exp;
private double safety;
... | sanityChecks(equations, t0, y0, t, y);
setEquations(equations);
resetEvaluations();
final boolean forward = t > t0;
// create some internal working arrays
final int stages = c.length + 1;
if (y != y0) {
System.arraycopy(y0, 0, y, 0, y0.length);
}
final double[][] yDotK = new d... |
789 | Math | 71 | src/main/java/org/apache/commons/math/ode/nonstiff/RungeKuttaIntegrator.java | integrate | public class RungeKuttaIntegrator extends AbstractIntegrator {
private final double[] c;
private final double[][] a;
private final double[] b;
private final RungeKuttaStepInterpolator prototype;
private final double step;
public double integrate(final FirstOrderDifferentialEquations equations,... | sanityChecks(equations, t0, y0, t, y);
setEquations(equations);
resetEvaluations();
final boolean forward = t > t0;
// create some internal working arrays
final int stages = c.length + 1;
if (y != y0) {
System.arraycopy(y0, 0, y, 0, y0.length);
}
final double[][] yDotK = new d... |
790 | Math | 72 | src/main/java/org/apache/commons/math/analysis/solvers/BrentSolver.java | solve | public class BrentSolver extends UnivariateRealSolverImpl {
private static final String NON_BRACKETING_MESSAGE =
"function values at endpoints do not have different signs. " +
"Endpoints: [{0}, {1}], Values: [{2}, {3}]";
private static final long serialVersionUID = 7694577816772532779L;
p... | clearResult();
verifySequence(min, initial, max);
// return the initial guess if it is good enough
double yInitial = f.value(initial);
if (Math.abs(yInitial) <= functionValueAccuracy) {
setResult(initial, 0);
return result;
}
// return th... |
791 | Math | 73 | src/main/java/org/apache/commons/math/analysis/solvers/BrentSolver.java | solve | public class BrentSolver extends UnivariateRealSolverImpl {
private static final String NON_BRACKETING_MESSAGE =
"function values at endpoints do not have different signs. " +
"Endpoints: [{0}, {1}], Values: [{2}, {3}]";
private static final long serialVersionUID = 7694577816772532779L;
p... | clearResult();
verifySequence(min, initial, max);
// return the initial guess if it is good enough
double yInitial = f.value(initial);
if (Math.abs(yInitial) <= functionValueAccuracy) {
setResult(initial, 0);
return result;
}
// return th... |
792 | Math | 74 | src/main/java/org/apache/commons/math/ode/nonstiff/EmbeddedRungeKuttaIntegrator.java | integrate | public class EmbeddedRungeKuttaIntegrator extends AdaptiveStepsizeIntegrator {
private final boolean fsal;
private final double[] c;
private final double[][] a;
private final double[] b;
private final RungeKuttaStepInterpolator prototype;
private final double exp;
private double safety;
... | sanityChecks(equations, t0, y0, t, y);
setEquations(equations);
resetEvaluations();
final boolean forward = t > t0;
// create some internal working arrays
final int stages = c.length + 1;
if (y != y0) {
System.arraycopy(y0, 0, y, 0, y0.length);
}
final double[][] yDotK = new d... |
793 | Math | 75 | src/main/java/org/apache/commons/math/stat/Frequency.java | getPct | public class Frequency implements Serializable {
private static final long serialVersionUID = -3845586908418844111L;
private final TreeMap<Comparable<?>, Long> freqTable;
@Deprecated public double getPct(Object v) { | return getPct((Comparable<?>) v);
}
} |
794 | Math | 76 | src/main/java/org/apache/commons/math/linear/SingularValueDecompositionImpl.java | getU | public class SingularValueDecompositionImpl implements SingularValueDecomposition {
private int m;
private int n;
private BiDiagonalTransformer transformer;
private double[] mainBidiagonal;
private double[] secondaryBidiagonal;
private double[] mainTridiagonal;
private double[] secondaryTri... | if (cachedU == null) {
final int p = singularValues.length;
if (m >= n) {
// the tridiagonal matrix is Bt.B, where B is upper bidiagonal
final RealMatrix e =
eigenDecomposition.getV().getSubMatrix(0, n - 1, 0, p - 1);
f... |
795 | Math | 76 | src/main/java/org/apache/commons/math/linear/SingularValueDecompositionImpl.java | getV | public class SingularValueDecompositionImpl implements SingularValueDecomposition {
private int m;
private int n;
private BiDiagonalTransformer transformer;
private double[] mainBidiagonal;
private double[] secondaryBidiagonal;
private double[] mainTridiagonal;
private double[] secondaryTri... | if (cachedV == null) {
final int p = singularValues.length;
if (m >= n) {
// the tridiagonal matrix is Bt.B, where B is upper bidiagonal
final RealMatrix e =
eigenDecomposition.getV().getSubMatrix(0, n - 1, 0, p - 1);
c... |
796 | Math | 77 | src/main/java/org/apache/commons/math/linear/ArrayRealVector.java | getLInfNorm | public class ArrayRealVector extends AbstractRealVector implements Serializable {
private static final String NON_FITTING_POSITION_AND_SIZE_MESSAGE =
"position {0} and size {1} don't fit to the size of the input array {2}";
private static final long serialVersionUID = -1097961340710804027L;
private... | double max = 0;
for (double a : data) {
max = Math.max(max, Math.abs(a));
}
return max;
}
} |
797 | Math | 78 | src/main/java/org/apache/commons/math/ode/events/EventState.java | evaluateStep | public class EventState {
private final EventHandler handler;
private final double maxCheckInterval;
private final double convergence;
private final int maxIterationCount;
private double t0;
private double g0;
private boolean g0Positive;
private boolean pendingEvent;
private double ... | try {
forward = interpolator.isForward();
final double t1 = interpolator.getCurrentTime();
final int n = Math.max(1, (int) Math.ceil(Math.abs(t1 - t0) / maxCheckInterval));
final double h = (t1 - t0) / n;
double ta = t0;
double ga = ... |
798 | Math | 79 | src/main/java/org/apache/commons/math/util/MathUtils.java | distance | public class MathUtils {
public static final double EPSILON = 0x1.0p-53;
public static final double SAFE_MIN = 0x1.0p-1022;
public static final double TWO_PI = 2 * Math.PI;
private static final byte NB = (byte)-1;
private static final short NS = (short)-1;
private static final byte PB = (byte... | double sum = 0;
for (int i = 0; i < p1.length; i++) {
final double dp = p1[i] - p2[i];
sum += dp * dp;
}
return Math.sqrt(sum);
}
} |
799 | Math | 80 | src/main/java/org/apache/commons/math/linear/EigenDecompositionImpl.java | flipIfWarranted | public class EigenDecompositionImpl implements EigenDecomposition {
private static final double TOLERANCE = 100 * MathUtils.EPSILON;
private static final double TOLERANCE_2 = TOLERANCE * TOLERANCE;
private double splitTolerance;
private double[] main;
private double[] secondary;
private double[... | if (1.5 * work[pingPong] < work[4 * (n - 1) + pingPong]) {
// flip array
int j = 4 * (n - 1);
for (int i = 0; i < j; i += 4) {
for (int k = 0; k < 4; k += step) {
final double tmp = work[i + k];
work[i + k] = work[j - k]... |
800 | Math | 81 | src/main/java/org/apache/commons/math/linear/EigenDecompositionImpl.java | computeGershgorinCircles | public class EigenDecompositionImpl implements EigenDecomposition {
private static final double TOLERANCE = 100 * MathUtils.EPSILON;
private static final double TOLERANCE_2 = TOLERANCE * TOLERANCE;
private double splitTolerance;
private double[] main;
private double[] secondary;
private double[... | final int m = main.length;
final int lowerStart = 4 * m;
final int upperStart = 5 * m;
lowerSpectra = Double.POSITIVE_INFINITY;
upperSpectra = Double.NEGATIVE_INFINITY;
double eMax = 0;
double eCurrent = 0;
for (int i = 0; i < m - 1; ++i) {
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.