Package it.unimi.dsi.fastutil.ints

Examples of it.unimi.dsi.fastutil.ints.IntIterator.nextInt()

133
134
135
136
137
138
139
140
141
142
143
  @Override
  public void write(DataOutput out) throws IOException {
    out.writeInt(neighbors.size());
    IntIterator iterator = neighbors.iterator();
    while (iterator.hasNext()) {
      out.writeInt(iterator.nextInt());
    }
  }

  @Override
  public void readFields(DataInput in) throws IOException {
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
     * @return {@code true} if any items were removed.
     */
    private boolean removeAll(LongIterator iter) {
        boolean removed = false;
        IntIterator posIter = keys.activeIndexIterator(true);
        int idx = posIter.hasNext() ? posIter.nextInt() : -1;
        while (iter.hasNext() && idx >= 0) {
            long rmk = iter.nextLong();
            // advance position pointer looking for this item
            while (idx >= 0 && keys.getKey(idx) < rmk) {
                idx = posIter.hasNext() ? posIter.nextInt() : -1;
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
        int idx = posIter.hasNext() ? posIter.nextInt() : -1;
        while (iter.hasNext() && idx >= 0) {
            long rmk = iter.nextLong();
            // advance position pointer looking for this item
            while (idx >= 0 && keys.getKey(idx) < rmk) {
                idx = posIter.hasNext() ? posIter.nextInt() : -1;
            }
            // remove if necessary
            if (idx >= 0 && keys.getKey(idx) == rmk) {
                keys.setActive(idx, false);
                removed = true;
View Full Code Here
108
109
110
111
112
113
114
115
116
117
118
        long nextToRetain = wantToRetainMore ? iter.nextLong() : 0;

        // scan all items, keeping only the ones to keep
        IntIterator posIter = keys.activeIndexIterator(true);
        while (posIter.hasNext()) {
            final int pos = posIter.nextInt();
            final long cur = keys.getKey(pos);
            while (wantToRetainMore && nextToRetain < cur) {
                // gone past next to retain, advance it
                wantToRetainMore = iter.hasNext();
                nextToRetain = wantToRetainMore ? iter.nextLong() : 0;
View Full Code Here
412
413
414
415
416
417
418
419
420
421
422
     */
    public DoubleCollection values() {
        DoubleArrayList lst = new DoubleArrayList(size());
        IntIterator iter = keys.activeIndexIterator(false);
        while (iter.hasNext()) {
            int idx = iter.nextInt();
            lst.add(values[idx]);
        }
        return lst;
    }

View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
            return false;
        }
        // and search
        IntIterator iter = keys.activeIndexIterator(false);
        while (iter.hasNext()) {
            if (o.equals(values[iter.nextInt()])) {
                return true;
            }
        }
        return false;
    }
View Full Code Here
208
209
210
211
212
213
214
215
216
217
218
        map.get(partitionId);
    List<IntWritable> vertices =
        Lists.newArrayListWithCapacity(partitionMap.size());
    IntIterator iterator = partitionMap.keySet().iterator();
    while (iterator.hasNext()) {
      vertices.add(new IntWritable(iterator.nextInt()));
    }
    return vertices;
  }

  @Override
View Full Code Here
123
124
125
126
127
128
129
130
131
132
133
    @Override
    public void write(DataOutput out) throws IOException {
      out.writeInt(set.size());
      IntIterator iter = set.iterator();
      while (iter.hasNext()) {
        out.writeInt(iter.nextInt());
      }
    }

    @Override
    public void readFields(DataInput in) throws IOException {
View Full Code Here
123
124
125
126
127
128
129
130
131
132
133
  @Override
  public void write(DataOutput out) throws IOException {
    out.writeInt(neighbors.size());
    IntIterator iterator = neighbors.iterator();
    while (iterator.hasNext()) {
      out.writeInt(iterator.nextInt());
    }
  }

  @Override
  public void readFields(DataInput in) throws IOException {
View Full Code Here
171
172
173
174
175
176
177
178
179
180
181
    Int2FloatOpenHashMap partitionMap = map.get(partitionId);
    List<IntWritable> vertices =
        Lists.newArrayListWithCapacity(partitionMap.size());
    IntIterator iterator = partitionMap.keySet().iterator();
    while (iterator.hasNext()) {
      vertices.add(new IntWritable(iterator.nextInt()));
    }
    return vertices;
  }

  @Override
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.