当前位置: 首页>>代码示例>>Java>>正文


Java Iterator类代码示例

本文整理汇总了Java中org.apache.commons.math3.util.OpenIntToDoubleHashMap.Iterator的典型用法代码示例。如果您正苦于以下问题:Java Iterator类的具体用法?Java Iterator怎么用?Java Iterator使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。


Iterator类属于org.apache.commons.math3.util.OpenIntToDoubleHashMap包,在下文中一共展示了Iterator类的8个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: add

import org.apache.commons.math3.util.OpenIntToDoubleHashMap.Iterator; //导入依赖的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;
}
 
开发者ID:biocompibens,项目名称:SME,代码行数:27,代码来源:OpenMapRealVector.java

示例2: getSubVector

import org.apache.commons.math3.util.OpenIntToDoubleHashMap.Iterator; //导入依赖的package包/类
/** {@inheritDoc} */
@Override
public OpenMapRealVector getSubVector(int index, int n)
    throws NotPositiveException, OutOfRangeException {
    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;
    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;
}
 
开发者ID:biocompibens,项目名称:SME,代码行数:22,代码来源:OpenMapRealVector.java

示例3: isInfinite

import org.apache.commons.math3.util.OpenIntToDoubleHashMap.Iterator; //导入依赖的package包/类
/** {@inheritDoc} */
@Override
public boolean isInfinite() {
    boolean infiniteFound = false;
    Iterator iter = entries.iterator();
    while (iter.hasNext()) {
        iter.advance();
        final double value = iter.value();
        if (Double.isNaN(value)) {
            return false;
        }
        if (Double.isInfinite(value)) {
            infiniteFound = true;
        }
    }
    return infiniteFound;
}
 
开发者ID:biocompibens,项目名称:SME,代码行数:18,代码来源:OpenMapRealVector.java

示例4: subtract

import org.apache.commons.math3.util.OpenIntToDoubleHashMap.Iterator; //导入依赖的package包/类
/**
 * Optimized method to subtract OpenMapRealVectors.
 *
 * @param v Vector to subtract from {@code this}.
 * @return the difference of {@code this} and {@code v}.
 * @throws DimensionMismatchException if the dimensions do not match.
 */
public OpenMapRealVector subtract(OpenMapRealVector v)
    throws DimensionMismatchException {
    checkVectorDimensions(v.getDimension());
    OpenMapRealVector res = copy();
    Iterator iter = v.getEntries().iterator();
    while (iter.hasNext()) {
        iter.advance();
        int key = iter.key();
        if (entries.containsKey(key)) {
            res.setEntry(key, entries.get(key) - iter.value());
        } else {
            res.setEntry(key, -iter.value());
        }
    }
    return res;
}
 
开发者ID:biocompibens,项目名称:SME,代码行数:24,代码来源:OpenMapRealVector.java

示例5: hashCode

import org.apache.commons.math3.util.OpenIntToDoubleHashMap.Iterator; //导入依赖的package包/类
/**
 * {@inheritDoc}
 * Implementation Note: This works on exact values, and as a result
 * it is possible for {@code a.subtract(b)} to be the zero vector, while
 * {@code a.hashCode() != b.hashCode()}.
 */
@Override
public int hashCode() {
    final int prime = 31;
    int result = 1;
    long temp;
    temp = Double.doubleToLongBits(epsilon);
    result = prime * result + (int) (temp ^ (temp >>> 32));
    result = prime * result + virtualSize;
    Iterator iter = entries.iterator();
    while (iter.hasNext()) {
        iter.advance();
        temp = Double.doubleToLongBits(iter.value());
        result = prime * result + (int) (temp ^ (temp >>32));
    }
    return result;
}
 
开发者ID:biocompibens,项目名称:SME,代码行数:23,代码来源:OpenMapRealVector.java

示例6: add

import org.apache.commons.math3.util.OpenIntToDoubleHashMap.Iterator; //导入依赖的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;
}
 
开发者ID:jiaminghan,项目名称:droidplanner-master,代码行数:27,代码来源:OpenMapRealVector.java

示例7: getSubVector

import org.apache.commons.math3.util.OpenIntToDoubleHashMap.Iterator; //导入依赖的package包/类
/** {@inheritDoc} */
@Override
public OpenMapRealVector getSubVector(int index, int n) {
    checkIndex(index);
    checkIndex(index + n - 1);
    OpenMapRealVector res = new OpenMapRealVector(n);
    int end = index + n;
    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;
}
 
开发者ID:jiaminghan,项目名称:droidplanner-master,代码行数:18,代码来源:OpenMapRealVector.java

示例8: subtract

import org.apache.commons.math3.util.OpenIntToDoubleHashMap.Iterator; //导入依赖的package包/类
/**
 * Optimized method to subtract OpenMapRealVectors.
 *
 * @param v Vector to subtract from {@code this}.
 * @return the difference of {@code this} and {@code v}.
 * @throws org.apache.commons.math3.exception.DimensionMismatchException
 * if the dimensions do not match.
 */
public OpenMapRealVector subtract(OpenMapRealVector v) {
    checkVectorDimensions(v.getDimension());
    OpenMapRealVector res = copy();
    Iterator iter = v.getEntries().iterator();
    while (iter.hasNext()) {
        iter.advance();
        int key = iter.key();
        if (entries.containsKey(key)) {
            res.setEntry(key, entries.get(key) - iter.value());
        } else {
            res.setEntry(key, -iter.value());
        }
    }
    return res;
}
 
开发者ID:jiaminghan,项目名称:droidplanner-master,代码行数:24,代码来源:OpenMapRealVector.java


注:本文中的org.apache.commons.math3.util.OpenIntToDoubleHashMap.Iterator类示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。