Example usage for java.lang Math abs

Introduction

In this page you can find the example usage for java.lang Math abs.

Prototype

@HotSpotIntrinsicCandidate
public static double abs(double a) 

Source Link

Document

Returns the absolute value of a double value.

Usage

From source file:com.yahoo.egads.models.tsmm.TimeSeriesAbstractModel.java

private static int compareError(double error1, double error2) {
    // can't compare NaN
    if (Double.isNaN(error1) || Double.isNaN(error2)) {
        return 0;
    }/*from  w  ww  .ja v  a  2  s . c o  m*/
    // positive when error1 is better (smaller) then error2
    double diffAbs = Math.abs(error2) - Math.abs(error1);
    if (Math.abs(diffAbs) <= TOLERANCE) {
        return 0;
    }
    return diffAbs > 0 ? 1 : -1;
}

---

From source file:com.opengamma.analytics.financial.timeseries.analysis.PortmanteauIIDHypothesis.java

public PortmanteauIIDHypothesis(final double level, final int maxLag) {
    if (!ArgumentChecker.isInRangeExcludingLow(0, 1, level)) {
        throw new IllegalArgumentException("Level must be between 0 and 1");
    }/*from   w w  w .  java2  s . c  om*/
    if (maxLag == 0) {
        throw new IllegalArgumentException("Lag cannot be zero");
    }
    if (maxLag < 0) {
        s_logger.warn("Maximum lag was less than zero; using absolute value");
    }
    _h = Math.abs(maxLag);
    _criticalValue = new ChiSquareDistribution(_h).getInverseCDF(1 - level);
}

---

From source file:com.insightml.evaluation.functions.MedianError.java

@Override
public DescriptiveStatistics label(final Serializable[] preds, final Object[] expected, final double[] weights,
        final ISamples<?, ?> samples, final int labelIndex) {
    final DescriptiveStatistics stats = new DescriptiveStatistics();
    for (int i = 0; i < preds.length; ++i) {
        final double[] predAndAct = toDouble(preds[i], expected[i]);
        stats.addValue(Math.abs(predAndAct[0] - predAndAct[1]));
    }/*  ww w  . j  a  va  2s .  c  o m*/
    return new DescriptiveStatistics(new double[] { stats.getPercentile(50) });
}

---

From source file:com.opengamma.analytics.financial.timeseries.analysis.LiMcLeodPortmanteauIIDHypothesis.java

public LiMcLeodPortmanteauIIDHypothesis(final double level, final int maxLag) {
    if (!ArgumentChecker.isInRangeExcludingLow(0, 1, level)) {
        throw new IllegalArgumentException("Level must be between 0 and 1");
    }//from  w  w  w  .j  av  a  2 s .com
    if (maxLag == 0) {
        throw new IllegalArgumentException("Lag cannot be zero");
    }
    if (maxLag < 0) {
        s_logger.info("Lag was negative; using absolute value");
    }
    _h = Math.abs(maxLag);
    _criticalValue = new ChiSquareDistribution(_h).getInverseCDF(1 - level);
}

---

From source file:jetbrick.tools.chm.reader.AnchorNameManager.java

public static String getNewAnchorName(String anchor) {
    return "HH_" + Math.abs(anchor.hashCode());
}

---

From source file:Main.java

public static Bitmap fastblur(Bitmap sentBitmap, int radius) {
    int width = Math.round(sentBitmap.getWidth());
    int height = Math.round(sentBitmap.getHeight());
    sentBitmap = Bitmap.createScaledBitmap(sentBitmap, width, height, false);

    Bitmap bitmap = sentBitmap.copy(sentBitmap.getConfig(), true);

    if (radius < 1) {
        return (null);
    }/*from w w  w  .  j a  v a2s.co m*/

    int w = bitmap.getWidth();
    int h = bitmap.getHeight();

    int[] pix = new int[w * h];
    bitmap.getPixels(pix, 0, w, 0, 0, w, h);

    int wm = w - 1;
    int hm = h - 1;
    int wh = w * h;
    int div = radius + radius + 1;

    int r[] = new int[wh];
    int g[] = new int[wh];
    int b[] = new int[wh];
    int a[] = new int[wh];
    int rsum, gsum, bsum, asum, x, y, i, p, yp, yi, yw;
    int vmin[] = new int[Math.max(w, h)];

    int divsum = (div + 1) >> 1;
    divsum *= divsum;
    int dv[] = new int[256 * divsum];
    for (i = 0; i < 256 * divsum; i++) {
        dv[i] = (i / divsum);
    }

    yw = yi = 0;

    int[][] stack = new int[div][4];
    int stackpointer;
    int stackstart;
    int[] sir;
    int rbs;
    int r1 = radius + 1;
    int routsum, goutsum, boutsum, aoutsum;
    int rinsum, ginsum, binsum, ainsum;

    for (y = 0; y < h; y++) {
        rinsum = ginsum = binsum = ainsum = routsum = goutsum = boutsum = aoutsum = rsum = gsum = bsum = asum = 0;
        for (i = -radius; i <= radius; i++) {
            p = pix[yi + Math.min(wm, Math.max(i, 0))];
            sir = stack[i + radius];
            sir[0] = (p & 0xff0000) >> 16;
            sir[1] = (p & 0x00ff00) >> 8;
            sir[2] = (p & 0x0000ff);
            sir[3] = 0xff & (p >> 24);

            rbs = r1 - Math.abs(i);
            rsum += sir[0] * rbs;
            gsum += sir[1] * rbs;
            bsum += sir[2] * rbs;
            asum += sir[3] * rbs;
            if (i > 0) {
                rinsum += sir[0];
                ginsum += sir[1];
                binsum += sir[2];
                ainsum += sir[3];
            } else {
                routsum += sir[0];
                goutsum += sir[1];
                boutsum += sir[2];
                aoutsum += sir[3];
            }
        }
        stackpointer = radius;

        for (x = 0; x < w; x++) {

            r[yi] = dv[rsum];
            g[yi] = dv[gsum];
            b[yi] = dv[bsum];
            a[yi] = dv[asum];

            rsum -= routsum;
            gsum -= goutsum;
            bsum -= boutsum;
            asum -= aoutsum;

            stackstart = stackpointer - radius + div;
            sir = stack[stackstart % div];

            routsum -= sir[0];
            goutsum -= sir[1];
            boutsum -= sir[2];
            aoutsum -= sir[3];

            if (y == 0) {
                vmin[x] = Math.min(x + radius + 1, wm);
            }
            p = pix[yw + vmin[x]];

            sir[0] = (p & 0xff0000) >> 16;
            sir[1] = (p & 0x00ff00) >> 8;
            sir[2] = (p & 0x0000ff);
            sir[3] = 0xff & (p >> 24);

            rinsum += sir[0];
            ginsum += sir[1];
            binsum += sir[2];
            ainsum += sir[3];

            rsum += rinsum;
            gsum += ginsum;
            bsum += binsum;
            asum += ainsum;

            stackpointer = (stackpointer + 1) % div;
            sir = stack[(stackpointer) % div];

            routsum += sir[0];
            goutsum += sir[1];
            boutsum += sir[2];
            aoutsum += sir[3];

            rinsum -= sir[0];
            ginsum -= sir[1];
            binsum -= sir[2];
            ainsum -= sir[3];

            yi++;
        }
        yw += w;
    }
    for (x = 0; x < w; x++) {
        rinsum = ginsum = binsum = ainsum = routsum = goutsum = boutsum = aoutsum = rsum = gsum = bsum = asum = 0;
        yp = -radius * w;
        for (i = -radius; i <= radius; i++) {
            yi = Math.max(0, yp) + x;

            sir = stack[i + radius];

            sir[0] = r[yi];
            sir[1] = g[yi];
            sir[2] = b[yi];
            sir[3] = a[yi];

            rbs = r1 - Math.abs(i);

            rsum += r[yi] * rbs;
            gsum += g[yi] * rbs;
            bsum += b[yi] * rbs;
            asum += a[yi] * rbs;

            if (i > 0) {
                rinsum += sir[0];
                ginsum += sir[1];
                binsum += sir[2];
                ainsum += sir[3];
            } else {
                routsum += sir[0];
                goutsum += sir[1];
                boutsum += sir[2];
                aoutsum += sir[3];
            }

            if (i < hm) {
                yp += w;
            }
        }
        yi = x;
        stackpointer = radius;
        for (y = 0; y < h; y++) {
            pix[yi] = (dv[asum] << 24) | (dv[rsum] << 16) | (dv[gsum] << 8) | dv[bsum];

            rsum -= routsum;
            gsum -= goutsum;
            bsum -= boutsum;
            asum -= aoutsum;

            stackstart = stackpointer - radius + div;
            sir = stack[stackstart % div];

            routsum -= sir[0];
            goutsum -= sir[1];
            boutsum -= sir[2];
            aoutsum -= sir[3];

            if (x == 0) {
                vmin[y] = Math.min(y + r1, hm) * w;
            }
            p = x + vmin[y];

            sir[0] = r[p];
            sir[1] = g[p];
            sir[2] = b[p];
            sir[3] = a[p];

            rinsum += sir[0];
            ginsum += sir[1];
            binsum += sir[2];
            ainsum += sir[3];

            rsum += rinsum;
            gsum += ginsum;
            bsum += binsum;
            asum += ainsum;

            stackpointer = (stackpointer + 1) % div;
            sir = stack[stackpointer];

            routsum += sir[0];
            goutsum += sir[1];
            boutsum += sir[2];
            aoutsum += sir[3];

            rinsum -= sir[0];
            ginsum -= sir[1];
            binsum -= sir[2];
            ainsum -= sir[3];

            yi += w;
        }
    }
    bitmap.setPixels(pix, 0, w, 0, 0, w, h);
    return (bitmap);
}

---

From source file:com.opengamma.analytics.financial.timeseries.analysis.BoxLjungPortmanteauIIDHypothesis.java

public BoxLjungPortmanteauIIDHypothesis(final double level, final int maxLag) {
    if (!ArgumentChecker.isInRangeExcludingLow(0, 1, level)) {
        throw new IllegalArgumentException("Level must be between 0 and 1");
    }/*from  w w w .  ja va2  s  .  c  o  m*/
    if (maxLag == 0) {
        throw new IllegalArgumentException("Lag cannot be zero");
    }
    if (maxLag < 0) {
        s_logger.warn("Maximum lag was less than zero; using absolute value");
    }
    _h = Math.abs(maxLag);
    _criticalValue = new ChiSquareDistribution(_h).getInverseCDF(1 - level);
}

---

From source file:Methods.CalculusNewtonRaphson.java

public static void newtonRaphson1(double xold, double decPoint) {//method used calculate root point acording the paramethers that enter the method and store the data in a global paramether linked list

    double xnew, fxold, fxnew, fdashxold, diff;
    int iteration = 0;
    xNewLinkedList.head = null;//Clearing the linked list before using it
    xLinkedList.head = null;/*  w  w  w . j a  v  a  2s  .  co m*/

    do {
        iteration += 1;
        fxold = xold - Math.pow(xold, 2.0);
        fdashxold = 1.0 - (2.0 * xold);
        xnew = xold - (fxold / fdashxold);
        fxnew = xnew - Math.pow(xnew, 2.0);
        System.out.println("Approx for iteration{}" + iteration + " is " + xnew);

        if (iteration == 1) {//Block used to insert data in the linked list
            xNewLinkedList.addFirst(xold, fxold, iteration);
            xLinkedList.addFirst(xnew, fxnew, iteration);
        } else {
            xNewLinkedList.addMid(xold, fxold, iteration, iteration - 1);
            xLinkedList.addMid(xnew, fxnew, iteration, iteration - 1);
        }

        diff = Math.abs(xnew - xold);
        xold = xnew;

    } while (diff > decPoint);
    xNewLinkedList.addMid(xnew, 0.0, iteration + 1, iteration);//Block used to insert data in the linked list
    xLinkedList.addMid(xnew, 0.0, iteration + 1, iteration);
    System.out.println("root to six decimal places is " + xnew);

}

---

From source file:annis.sqlgen.SqlConstraints.java

public static String numberJoin(String op, String lhs, String rhs, int offset) {
    String plus = offset >= 0 ? " + " : " - ";
    return join(op, lhs, rhs) + plus + String.valueOf(Math.abs(offset));
}

---

From source file:com.opengamma.analytics.financial.timeseries.analysis.RankTestIIDHypothesis.java

@Override
public boolean testIID(final DoubleTimeSeries<?> x) {
    Validate.notNull(x, "x");
    final double[] data = x.valuesArrayFast();
    int t = 0;//from  w  w w  .  j a v  a 2  s.  com
    final int n = x.size();
    double val;
    for (int i = 0; i < n - 1; i++) {
        val = data[i];
        for (int j = i + 1; j < n; j++) {
            if (data[j] > val) {
                t++;
            }
        }
    }
    final double mean = n * (n - 1) / 4.;
    final double std = Math.sqrt(n * (n - 1) * (2 * n + 5.) / 72.);
    return Math.abs(t - mean) / std < _criticalValue;
}

---

• «
• 1
• 2
• 3
• 4
• 5
• 6
• 7
• 8
• 9
• 10
• 11
• 12
• 13
• 14
• 15
• 16
• 17
• 18
• 19
• 20
• 21
• 22
• 23
• 24
• 25
• 26
• 27
• 28
• 29
• 30
• 31
• 32
• 33
• 34
• 35
• 36
• 37
• 38
• 39
• 40
• 41
• 42
• 43
• 44
• 45
• 46
• 47
• 48
• 49
• 50
• »