Java OpenIntToDoubleHashMap类代码示例

import org.apache.commons.math3.util.OpenIntToDoubleHashMap; //导入依赖的package包/类
/**
 * Compute the sum of this matrix and {@code m}.
 *
 * @param m Matrix to be added.
 * @return {@code this} + {@code m}.
 * @throws MatrixDimensionMismatchException if {@code m} is not the same
 * size as {@code this}.
 */
public OpenMapRealMatrix add(OpenMapRealMatrix m)
    throws MatrixDimensionMismatchException {

    MatrixUtils.checkAdditionCompatible(this, m);

    final OpenMapRealMatrix out = new OpenMapRealMatrix(this);
    for (OpenIntToDoubleHashMap.Iterator iterator = m.entries.iterator(); iterator.hasNext();) {
        iterator.advance();
        final int row = iterator.key() / columns;
        final int col = iterator.key() - row * columns;
        out.setEntry(row, col, getEntry(row, col) + iterator.value());
    }

    return out;

}
 

import org.apache.commons.math3.util.OpenIntToDoubleHashMap; //导入依赖的package包/类
/**
 * {@inheritDoc}
 *
 * @throws NumberIsTooLargeException if {@code m} is an
 * {@code OpenMapRealMatrix}, and the total number of entries of the product
 * is larger than {@code Integer.MAX_VALUE}.
 */
@Override
public RealMatrix multiply(final RealMatrix m)
    throws DimensionMismatchException, NumberIsTooLargeException {
    try {
        return multiply((OpenMapRealMatrix) m);
    } catch (ClassCastException cce) {

        MatrixUtils.checkMultiplicationCompatible(this, m);

        final int outCols = m.getColumnDimension();
        final BlockRealMatrix out = new BlockRealMatrix(rows, outCols);
        for (OpenIntToDoubleHashMap.Iterator iterator = entries.iterator(); iterator.hasNext();) {
            iterator.advance();
            final double value = iterator.value();
            final int key      = iterator.key();
            final int i        = key / columns;
            final int k        = key % columns;
            for (int j = 0; j < outCols; ++j) {
                out.addToEntry(i, j, value * m.getEntry(k, j));
            }
        }

        return out;
    }
}
 

import org.apache.commons.math3.util.OpenIntToDoubleHashMap; //导入依赖的package包/类
/**
 * Optimized method to add two OpenMapRealVectors.
 * It copies the larger vector, then iterates over the smaller.
 *
 * @param v Vector to add.
 * @return the sum of {@code this} and {@code v}.
 * @throws DimensionMismatchException if the dimensions do not match.
 */
public OpenMapRealVector add(OpenMapRealVector v)
    throws DimensionMismatchException {
    checkVectorDimensions(v.getDimension());
    boolean copyThis = entries.size() > v.entries.size();
    OpenMapRealVector res = copyThis ? this.copy() : v.copy();
    Iterator iter = copyThis ? v.entries.iterator() : entries.iterator();
    OpenIntToDoubleHashMap randomAccess = copyThis ? entries : v.entries;
    while (iter.hasNext()) {
        iter.advance();
        int key = iter.key();
        if (randomAccess.containsKey(key)) {
            res.setEntry(key, randomAccess.get(key) + iter.value());
        } else {
            res.setEntry(key, iter.value());
        }
    }
    return res;
}
 

import org.apache.commons.math3.util.OpenIntToDoubleHashMap; //导入依赖的package包/类
/**
 * Compute the sum of this matrix and {@code m}.
 *
 * @param m Matrix to be added.
 * @return {@code this} + {@code m}.
 * @throws org.apache.commons.math3.exception.DimensionMismatchException
 * if {@code m} is not the same size as this matrix.
 */
public OpenMapRealMatrix add(OpenMapRealMatrix m) {

    // safety check
    MatrixUtils.checkAdditionCompatible(this, m);

    final OpenMapRealMatrix out = new OpenMapRealMatrix(this);
    for (OpenIntToDoubleHashMap.Iterator iterator = m.entries.iterator(); iterator.hasNext();) {
        iterator.advance();
        final int row = iterator.key() / columns;
        final int col = iterator.key() - row * columns;
        out.setEntry(row, col, getEntry(row, col) + iterator.value());
    }

    return out;

}
 

import org.apache.commons.math3.util.OpenIntToDoubleHashMap; //导入依赖的package包/类
/** {@inheritDoc} */
@Override
public RealMatrix multiply(final RealMatrix m) {
    try {
        return multiply((OpenMapRealMatrix) m);
    } catch (ClassCastException cce) {

        // safety check
        MatrixUtils.checkMultiplicationCompatible(this, m);

        final int outCols = m.getColumnDimension();
        final BlockRealMatrix out = new BlockRealMatrix(rows, outCols);
        for (OpenIntToDoubleHashMap.Iterator iterator = entries.iterator(); iterator.hasNext();) {
            iterator.advance();
            final double value = iterator.value();
            final int key      = iterator.key();
            final int i        = key / columns;
            final int k        = key % columns;
            for (int j = 0; j < outCols; ++j) {
                out.addToEntry(i, j, value * m.getEntry(k, j));
            }
        }

        return out;
    }
}
 

import org.apache.commons.math3.util.OpenIntToDoubleHashMap; //导入依赖的package包/类
/**
 * Optimized method to add two OpenMapRealVectors.
 * It copies the larger vector, then iterates over the smaller.
 *
 * @param v Vector to add.
 * @return the sum of {@code this} and {@code v}.
 * @throws org.apache.commons.math3.exception.DimensionMismatchException
 * if the dimensions do not match.
 */
public OpenMapRealVector add(OpenMapRealVector v) {
    checkVectorDimensions(v.getDimension());
    boolean copyThis = entries.size() > v.entries.size();
    OpenMapRealVector res = copyThis ? this.copy() : v.copy();
    Iterator iter = copyThis ? v.entries.iterator() : entries.iterator();
    OpenIntToDoubleHashMap randomAccess = copyThis ? entries : v.entries;
    while (iter.hasNext()) {
        iter.advance();
        int key = iter.key();
        if (randomAccess.containsKey(key)) {
            res.setEntry(key, randomAccess.get(key) + iter.value());
        } else {
            res.setEntry(key, iter.value());
        }
    }
    return res;
}
 

import org.apache.commons.math3.util.OpenIntToDoubleHashMap; //导入依赖的package包/类
/** Update the tile according to the Digital Elevation Model.
 * @param tile to update
 * @exception RuggedException if tile cannot be updated
 */
public void updateTile(final UpdatableTile tile)
    throws RuggedException {

    tile.setGeometry(minLatitude, minLongitude,
                     latitudeStep, longitudeStep,
                     latitudeRows, longitudeColumns);

    final OpenIntToDoubleHashMap.Iterator iterator = elevations.iterator();
    while (iterator.hasNext()) {
        iterator.advance();
        final int    index          = iterator.key();
        final int    latitudeIndex  = index / longitudeColumns;
        final int    longitudeIndex = index % longitudeColumns;
        final double elevation      = iterator.value();
        tile.setElevation(latitudeIndex, longitudeIndex, elevation);
    }

}
 

import org.apache.commons.math3.util.OpenIntToDoubleHashMap; //导入依赖的package包/类
/**
 * Optimized method to add two OpenMapRealVectors.
 * It copies the larger vector, then iterates over the smaller.
 *
 * @param v Vector to add.
 * @return the sum of {@code this} and {@code v}.
 * @throws DimensionMismatchException if the dimensions do not match.
 */
public OpenMapRealVector add(OpenMapRealVector v) {
  checkVectorDimensions(v.getDimension());
  boolean copyThis = entries.size() > v.entries.size();
  OpenMapRealVector res = copyThis ? this.copy() : v.copy();
  OpenIntToDoubleHashMap.Iterator iter = copyThis ? v.entries.iterator() : entries.iterator();
  OpenIntToDoubleHashMap randomAccess = copyThis ? entries : v.entries;
  while (iter.hasNext()) {
    iter.advance();
    int key = iter.key();
    if (randomAccess.containsKey(key)) {
      res.setEntry(key, randomAccess.get(key) + iter.value());
    } else {
      res.setEntry(key, iter.value());
    }
  }
  return res;
}
 

import org.apache.commons.math3.util.OpenIntToDoubleHashMap; //导入依赖的package包/类
@Override
public OpenMapRealVector getSubVector(int index, int n) {
  checkIndex(index);
  if (n < 0) {
    throw new NotPositiveException(LocalizedFormats.NUMBER_OF_ELEMENTS_SHOULD_BE_POSITIVE, n);
  }
  checkIndex(index + n - 1);
  OpenMapRealVector res = new OpenMapRealVector(n);
  int end = index + n;
  OpenIntToDoubleHashMap.Iterator iter = entries.iterator();
  while (iter.hasNext()) {
    iter.advance();
    int key = iter.key();
    if (key >= index && key < end) {
      res.setEntry(key - index, iter.value());
    }
  }
  return res;
}
 

import org.apache.commons.math3.util.OpenIntToDoubleHashMap; //导入依赖的package包/类
@Override
public boolean isInfinite() {
  boolean infiniteFound = false;
  OpenIntToDoubleHashMap.Iterator iter = entries.iterator();
  while (iter.hasNext()) {
    iter.advance();
    double value = iter.value();
    if (Double.isNaN(value)) {
      return false;
    }
    if (Double.isInfinite(value)) {
      infiniteFound = true;
    }
  }
  return infiniteFound;
}