hep.aida.tdouble.ref.Util Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of parallelcolt Show documentation

Parallel Colt is a multithreaded version of Colt - a library for high performance scientific computing in Java. It contains efficient algorithms for data analysis, linear algebra, multi-dimensional arrays, Fourier transforms, statistics and histogramming.

The newest version!

package hep.aida.tdouble.ref;

import hep.aida.tdouble.DoubleIHistogram1D;
import hep.aida.tdouble.DoubleIHistogram2D;

/**
 * Convenient histogram utilities.
 */
class Util {
    /**
     * Creates a new utility object.
     */
    public Util() {
    }

    /**
     * Returns the index of the in-range bin containing the maxBinHeight().
     */
    public int maxBin(DoubleIHistogram1D h) {
        int maxBin = -1;
        double maxValue = Double.MIN_VALUE;
        for (int i = h.xAxis().bins(); --i >= 0;) {
            double value = h.binHeight(i);
            if (value > maxValue) {
                maxValue = value;
                maxBin = i;
            }
        }
        return maxBin;
    }

    /**
     * Returns the indexX of the in-range bin containing the maxBinHeight().
     */
    public int maxBinX(DoubleIHistogram2D h) {
        double maxValue = Double.MIN_VALUE;
        int maxBinX = -1;
        int maxBinY = -1;
        for (int i = h.xAxis().bins(); --i >= 0;) {
            for (int j = h.yAxis().bins(); --j >= 0;) {
                double value = h.binHeight(i, j);
                if (value > maxValue) {
                    maxValue = value;
                    maxBinX = i;
                    maxBinY = j;
                }
            }
        }
        return maxBinX;
    }

    /**
     * Returns the indexY of the in-range bin containing the maxBinHeight().
     */
    public int maxBinY(DoubleIHistogram2D h) {
        double maxValue = Double.MIN_VALUE;
        int maxBinX = -1;
        int maxBinY = -1;
        for (int i = h.xAxis().bins(); --i >= 0;) {
            for (int j = h.yAxis().bins(); --j >= 0;) {
                double value = h.binHeight(i, j);
                if (value > maxValue) {
                    maxValue = value;
                    maxBinX = i;
                    maxBinY = j;
                }
            }
        }
        return maxBinY;
    }

    /**
     * Returns the index of the in-range bin containing the minBinHeight().
     */
    public int minBin(DoubleIHistogram1D h) {
        int minBin = -1;
        double minValue = Double.MAX_VALUE;
        for (int i = h.xAxis().bins(); --i >= 0;) {
            double value = h.binHeight(i);
            if (value < minValue) {
                minValue = value;
                minBin = i;
            }
        }
        return minBin;
    }

    /**
     * Returns the indexX of the in-range bin containing the minBinHeight().
     */
    public int minBinX(DoubleIHistogram2D h) {
        double minValue = Double.MAX_VALUE;
        int minBinX = -1;
        int minBinY = -1;
        for (int i = h.xAxis().bins(); --i >= 0;) {
            for (int j = h.yAxis().bins(); --j >= 0;) {
                double value = h.binHeight(i, j);
                if (value < minValue) {
                    minValue = value;
                    minBinX = i;
                    minBinY = j;
                }
            }
        }
        return minBinX;
    }

    /**
     * Returns the indexY of the in-range bin containing the minBinHeight().
     */
    public int minBinY(DoubleIHistogram2D h) {
        double minValue = Double.MAX_VALUE;
        int minBinX = -1;
        int minBinY = -1;
        for (int i = h.xAxis().bins(); --i >= 0;) {
            for (int j = h.yAxis().bins(); --j >= 0;) {
                double value = h.binHeight(i, j);
                if (value < minValue) {
                    minValue = value;
                    minBinX = i;
                    minBinY = j;
                }
            }
        }
        return minBinY;
    }
}