Java DoubleIterator.hasNext方法代码示例

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
@Override
public void truncateTo(int minimumNumberOfElementsToKeep) {
	if (m.size() < minimumNumberOfElementsToKeep)
		return;
	
	DoubleHeapPriorityQueue heap = new DoubleHeapPriorityQueue();
	
	DoubleIterator values = values();
	while (values.hasNext()) {
			heap.enqueue(Math.abs(values.nextDouble()));
			if (heap.size() > minimumNumberOfElementsToKeep)
				heap.dequeueDouble();
		}
	
	double threshold = heap.dequeueDouble();
	
	DoubleIterator iterator = m.values().iterator();
	while (iterator.hasNext()) {
		if (Math.abs(iterator.nextDouble()) < threshold)
			iterator.remove();
	}
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
private double getNorm2(int uidx) {
    if (data.useIteratorsPreferentially()) {
        DoubleIterator ivs = data.getUidxVs(uidx);
        double sum = 0;
        while (ivs.hasNext()) {
            double iv = ivs.nextDouble();
            sum += iv * iv;
        }
        return sum;
    } else {
        return data.getUidxPreferences(uidx)
                .mapToDouble(IdxPref::v2)
                .map(x -> x * x)
                .sum();
    }
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
@Override
public boolean isBad() {
	final DoubleIterator iterator = values.values().iterator();
	while (iterator.hasNext()) {
		final double value = iterator.nextDouble();
		if (Double.isNaN(value) || Double.isInfinite(value)) {
			return true;
		}
	}
	return false;
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
private double cosineProduct(Object2DoubleMap<String> vector1, Object2DoubleMap<String> vector2) {
    double aa = 0, bb = 0, ab = 0;
    for(Object2DoubleMap.Entry<String> e : vector1.object2DoubleEntrySet()) {
        aa += e.getDoubleValue() * e.getDoubleValue();
        ab += e.getDoubleValue() * vector2.getDouble(e.getKey());
    }
    DoubleIterator di  = vector2.values().iterator();
    while(di.hasNext()) {
        double d = di.nextDouble();
        bb +=  d * d;
    }
    return ab / Math.sqrt(aa * bb);
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
public int numberOfNonZeroEntries() {
	int n = 0;
	DoubleIterator values = values();
	while (values.hasNext())
		if (values.nextDouble() != 0)
			n++;
	return n;
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
public double maxNorm() {
	double max = 0;
	DoubleIterator values = values();
	while (values.hasNext())
		max = Math.max(max, Math.abs(values.nextDouble()));
	return max;
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
public double norm2() {
	double sumOfSquares = 0;
	DoubleIterator values = values();
	double v;
	while (values.hasNext()) {
		v = values.nextDouble();
		sumOfSquares += v * v;
	}
	return Math.sqrt(sumOfSquares);
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
public double norm1() {
	double sum = 0;
	DoubleIterator values = values();
	while (values.hasNext())
		sum += Math.abs(values.nextDouble());
	return sum;
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
public void cutBelow(double k) {
    DoubleIterator iter = values().iterator();
    while (iter.hasNext()) {
        if (iter.nextDouble() < k)
            iter.remove();
    }
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
public void cutAbove(double k) {
    DoubleIterator iter = values().iterator();
    while (iter.hasNext()) {
        if (iter.nextDouble() > k)
            iter.remove();
    }
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
public void cutBelow(double k) {
    DoubleIterator iter = values().iterator();
    while (iter.hasNext()) {
        if (iter.nextDouble() < k) {
            iter.remove();
        }
    }
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
public void cutAbove(double k) {
    DoubleIterator iter = values().iterator();
    while (iter.hasNext()) {
        if (iter.nextDouble() > k) {
            iter.remove();
        }
    }
}
 

import it.unimi.dsi.fastutil.doubles.DoubleIterator; //导入方法依赖的package包/类
/**
 * Read edges in format "id1 id2 w3"* or "id1 id2" up to the end of file.
 * Closes buffer reader.
 */
public static IGraph parseEdges(int numNodes, BufferedReader br) throws IOException {
    IntList[] nodes = new IntList[numNodes];
    DoubleList[] weightsList = new DoubleList[numNodes];
    String line = null;
    //Initialization of IntList and weigthsList
    for (int i = 0; i < numNodes; i++) {
        nodes[i] = new IntArrayList();
        weightsList[i] = new DoubleArrayList();
    }

    while ((line = br.readLine()) != null) {
        String[] splitArray = line.replace("\t", " ").split(" ");
        int node1 = Integer.parseInt(splitArray[0]);
        int node2 = Integer.parseInt(splitArray[1]);
        nodes[node1 - 1].add(node2 - 1); // Numeration in matLab file begins from 1, whether in java array from 0
        if (splitArray.length == 2) {
            weightsList[node1 - 1].add(1);
        } else {
            weightsList[node1 - 1].add(Double.parseDouble(splitArray[2]));
        }
    }
    br.close();
    boolean isWeighted = false;
    int[][] matrix = new int[numNodes][];
    double[][] weights = new double[numNodes][];
    for (int i = 0; i < numNodes; i++) {
        matrix[i] = new int[nodes[i].size()];
        weights[i] = new double[weightsList[i].size()];
        IntIterator intIterator = nodes[i].iterator();
        int count = 0;
        while (intIterator.hasNext()) {
            matrix[i][count] = intIterator.next();
            count++;
        }
        count = 0;
        DoubleIterator doubleIterator = weightsList[i].iterator();
        while (doubleIterator.hasNext()) {
            weights[i][count] = doubleIterator.next();
            if (weights[i][count] != 1) {
                isWeighted = true;
            }
            count++;
        }
    }
    return isWeighted ? new MatrixWeightedGraph(matrix, weights): new MatrixGraph(matrix);
}