Package it.unimi.dsi.fastutil.ints

Examples of it.unimi.dsi.fastutil.ints.IntIterator

106
107
108
109
110
111
112
113
114
115
116
117
118
        // keep track of the next item that we want to retain
        boolean wantToRetainMore = iter.hasNext();
        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
410
411
412
413
414
415
416
417
418
419
420
421
     *
     * @return The collection of all values in this vector.
     */
    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
83
84
85
86
87
88
89
90
91
92
93
94
95
        // prohibit nulls
        if (o == null) {
            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
206
207
208
209
210
211
212
213
214
215
216
      int partitionId) {
    Int2ObjectOpenHashMap<DataInputOutput> 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;
  }
View Full Code Here
169
170
171
172
173
174
175
176
177
178
179
  public Iterable<IntWritable> getPartitionDestinationVertices(
      int partitionId) {
    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;
  }
View Full Code Here
121
122
123
124
125
126
127
128
129
130
    }

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

  @Override
  public void write(DataOutput out) throws IOException {
    out.writeInt(neighbors.size());
    IntIterator iterator = neighbors.iterator();
    while (iterator.hasNext()) {
      out.writeInt(iterator.nextInt());
    }
  }
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
57
58
    mask |= (mask >> 4);
    mask |= (mask >> 8);
    mask |= (mask >> 16);
    _mask = mask;
    _filter = new long[mask + 1];
    IntIterator iter = set.iterator();
    while (iter.hasNext()) {
      int h = iter.nextInt() * MIXER;

      long bits = _filter[h & _mask];
      bits |= ((1L << (h >>> 26)));
      bits |= ((1L << ((h >> 20) & 0x3F)));
      _filter[h & _mask] = bits;
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
    return true;
  }

  public boolean containsAll(IntCollection c) {
    final IntIterator i = c.iterator();
    int n = c.size();
    while (n-- != 0)
      if (!contains(i.nextInt())) return false;
    return true;
  }
View Full Code Here
TOP

Related Classes of it.unimi.dsi.fastutil.ints.IntIterator

  • it.unimi.dsi.mg4j.index.MultiTermIndexIteratorTest
  • it.unimi.dsi.mg4j.test.RemoteIndexIteratorTest
  • it.unimi.dsi.mg4j.test.Verifier
  • it.unimi.dsi.mg4j.tool.Concatenate
  • it.unimi.dsi.mg4j.tool.Merge
  • it.unimi.dsi.mg4j.tool.Paste
  • org.apache.giraph.comm.messages.primitives.IntByteArrayMessageStore
  • org.apache.giraph.comm.messages.primitives.IntFloatMessageStore
  • org.apache.giraph.edge.IntNullArrayEdges
  • org.apache.giraph.types.ops.collections.BasicSet$BasicIntOpenHashSet
    • Copyright © 2018 www.massapicom. 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.