private void saveDrfIds() { for (LongIterator i = this.drfIds.iterator(); i.hasNext();) { writeIFRecord(IFREC_DRF_CREATE, i.next()); this.ifLiveRecordCount++; this.ifTotalRecordCount++; } }
private void saveCrfIds() { for (LongIterator i = this.crfIds.iterator(); i.hasNext();) { writeIFRecord(IFREC_CRF_CREATE, i.next()); this.ifLiveRecordCount++; this.ifTotalRecordCount++; } }
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException { final LongIterator i = iterator(); s.defaultWriteObject(); for (int j = size; j-- != 0;) s.writeLong(i.nextLong()); }
@Override public Iterator<MutableEdge<LongWritable, NullWritable>> mutableIterator() { return new Iterator<MutableEdge<LongWritable, NullWritable>>() { /** Wrapped neighbors iterator. */ private LongIterator neighborsIt = neighbors.iterator(); /** Representative edge object. */ private ReusableEdge<LongWritable, NullWritable> representativeEdge = EdgeFactory.createReusable(new LongWritable()); public boolean hasNext() { return neighborsIt.hasNext(); } @Override public MutableEdge<LongWritable, NullWritable> next() { representativeEdge.getTargetVertexId().set(neighborsIt.nextLong()); return representativeEdge; } @Override public void remove() { neighborsIt.remove(); } }; }
@Override public void write(DataOutput out) throws IOException { out.writeInt(neighbors.size()); LongIterator neighborsIt = neighbors.iterator(); while (neighborsIt.hasNext()) { out.writeLong(neighborsIt.nextLong()); } }
private void saveKrfIds() { for (LongIterator i = this.krfIds.iterator(); i.hasNext(); ) { writeIFRecord(IFREC_KRF_CREATE, i.next()); this.ifLiveRecordCount++; this.ifTotalRecordCount++; } }
private void saveCrfIds() { for (LongIterator i = this.crfIds.iterator(); i.hasNext(); ) { writeIFRecord(IFREC_CRF_CREATE, i.next()); this.ifLiveRecordCount++; this.ifTotalRecordCount++; } }
private void saveDrfIds() { for (LongIterator i = this.drfIds.iterator(); i.hasNext(); ) { writeIFRecord(IFREC_DRF_CREATE, i.next()); this.ifLiveRecordCount++; this.ifTotalRecordCount++; } }
LongIterator iter = tweetids.iterator(); while (iter.hasNext()) { long t = iter.nextLong();
it.unimi.dsi.fastutil.longs.LongIterator nodeIter = nodes.iterator(); while (nodeIter.hasNext()) { long nodeId = nodeIter.nextLong();
LongIterator leftIter = tweets.iterator(); while (leftIter.hasNext()) { if (userTweetBigraph.getLeftNodeDegree(leftIter.nextLong()) != 0)
for (LongIterator iterator = items.iterator(); iterator.hasNext();) { long item = iterator.nextLong(); EWAHCompressedBitmap entry = itemClickMap.get(item);
LongIterator nodeIter = nodes.iterator(); while (nodeIter.hasNext()) { long nodeId = nodeIter.nextLong();
for (LongIterator iterator = items.iterator(); iterator.hasNext();) { long item = iterator.nextLong(); EWAHCompressedBitmap entry = itemKeywordMap.get(item);
/** * Runs PageRank, either until the max number of iterations has been reached or the L1 norm of * the difference between PageRank vectors drops below the tolerance. * * @return number of iterations that was actually run */ public int run() { LongArrayList noOuts = new LongArrayList(); LongIterator iter = nodes.iterator(); while (iter.hasNext()) { long v = iter.nextLong(); if (graph.getOutDegree(v) == 0) { noOuts.add(v); } } double dampingAmount = (1.0 - dampingFactor) / nodeCount; prVector = new double[(int) (maxNodeId + 1)]; nodes.forEach(v -> prVector[(int) (long) v] = 1.0 / nodeCount); int i = 0; while (i < this.maxIterations && normL1 > tolerance) { iterate(dampingAmount, noOuts); i++; } return i; }
for (LongIterator iterator = userTransactions.iterator(); iterator.hasNext();) { long itemID = iterator.nextLong(); for (int i = 0; i < realK; i++) {
private void iterate(double dampingAmount, LongArrayList noOuts) { double nextPR[] = new double[(int) (maxNodeId + 1)]; // PageRank vector after the iteration. // First compute how much mass is trapped at the dangling nodes. double dangleSum = 0.0; LongIterator iter = noOuts.iterator(); while (iter.hasNext()) { dangleSum += prVector[(int) iter.nextLong()]; } dangleSum = dampingFactor * dangleSum / nodeCount; // Distribute PageRank mass. iter = nodes.iterator(); while (iter.hasNext()) { long v = iter.nextLong(); int outDegree = graph.getOutDegree(v); if (outDegree > 0) { double outWeight = dampingFactor * prVector[(int) v] / outDegree; EdgeIterator edges = graph.getOutEdges(v); while (edges.hasNext()) { int nbr = (int) edges.nextLong(); nextPR[nbr] += outWeight; } } nextPR[(int) v] += dampingAmount + dangleSum; } normL1 = computeL1Norm(prVector, nextPR); prVector = nextPR; }