Examples of IntIterator

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

98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
    assertEquals( 3, position[ 3 ] );

   
    assertEquals( Interval.valueOf( 3 ), multiTermIndexIterator.intervalIterator().nextInterval() );

    IntIterator positions = multiTermIndexIterator.positions();
    assertEquals( 0, positions.nextInt() );
    assertEquals( 1, positions.nextInt() );
    assertEquals( 2, positions.nextInt() );
    assertEquals( 3, positions.nextInt() );
    assertFalse( positions.hasNext() );

   
    assertFalse( multiTermIndexIterator.intervalIterator().hasNext() );
    assertFalse( multiTermIndexIterator.intervalIterator().hasNext() ); // To increase coverage

    assertEquals( 1, multiTermIndexIterator.nextDocument() );
    assertTrue( multiTermIndexIterator.intervalIterator().hasNext() );
    assertTrue( multiTermIndexIterator.intervalIterator().hasNext() ); // To increase coverage
    assertEquals( Interval.valueOf( 0 ), multiTermIndexIterator.intervalIterator().nextInterval() );
    assertEquals( Interval.valueOf( 2 ), multiTermIndexIterator.intervalIterator().nextInterval() );

    assertEquals( 2, multiTermIndexIterator.count() );
    position = multiTermIndexIterator.positionArray();
    assertEquals( 0, position[ 0 ] );
    assertEquals( 2, position[ 1 ] );
    positions = multiTermIndexIterator.positions();
    assertEquals( 0, positions.nextInt() );
    assertEquals( 2, positions.nextInt() );
    assertFalse( positions.hasNext() );
   
    assertFalse( multiTermIndexIterator.intervalIterator().hasNext() );

    assertEquals( 2, multiTermIndexIterator.nextDocument() );
    assertTrue( multiTermIndexIterator.intervalIterator().hasNext() );
    assertTrue( multiTermIndexIterator.intervalIterator().hasNext() ); // To increase coverage
    assertEquals( Interval.valueOf( 0 ), multiTermIndexIterator.intervalIterator().nextInterval() );
    assertEquals( Interval.valueOf( 1 ), multiTermIndexIterator.intervalIterator().nextInterval() );

    assertEquals( 2, multiTermIndexIterator.count() );
    position = multiTermIndexIterator.positionArray();
    assertEquals( 0, position[ 0 ] );
    assertEquals( 1, position[ 1 ] );
    positions = multiTermIndexIterator.positions();
    assertEquals( 0, positions.nextInt() );
    assertEquals( 1, positions.nextInt() );
    assertFalse( positions.hasNext() );
   
    assertFalse( multiTermIndexIterator.intervalIterator().hasNext() );
   
    // Here we get the iterator of the underlying IndexIterator
    assertEquals( 3, multiTermIndexIterator.nextDocument() );
    assertTrue( multiTermIndexIterator.intervalIterator().hasNext() );
    assertEquals( Interval.valueOf( 0 ), multiTermIndexIterator.intervalIterator().nextInterval() );

    assertEquals( 1, multiTermIndexIterator.count() );
    position = multiTermIndexIterator.positionArray();
    assertEquals( 0, position[ 0 ] );
    positions = multiTermIndexIterator.positions();
    assertEquals( 0, positions.nextInt() );
    assertFalse( positions.hasNext() );
   
    assertFalse( multiTermIndexIterator.intervalIterator().hasNext() );
   
    // The end
    assertFalse( multiTermIndexIterator.hasNext() );
View Full Code Here

Examples of javaewah.IntIterator

280
281
282
283
284
285
286
287
288
289
290
        return false;

      EWAHCompressedBitmap curr = bitset.combine()
          .xor(ones(indexObjectCount));

      IntIterator ii = curr.intIterator();
      if (ii.hasNext() && ii.next() < indexObjectCount)
        return false;
      bitset = new ComboBitset(curr);
      return true;
    }
View Full Code Here

Examples of kodkod.util.ints.IntIterator

95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
  public boolean equals(Object o) {
    if (o==this) return true;
    if (o instanceof Clause) {
      final Clause c = (Clause) o;
      if (size()==c.size()) {
        final IntIterator itr1 = literals(), itr2 = literals();
        while(itr1.hasNext()) {
          if (itr1.next()!=itr2.next()) return false;
        }
      }
      final int ante = numberOfAntecedents();
      if (ante > 0 && ante==c.numberOfAntecedents()) {
        final Iterator<Clause> itr1 = antecedents(), itr2 = c.antecedents();
        while(itr1.hasNext()) {
          if (!itr1.next().equals(itr2.next())) return false;
        }
      }
      return ante==0;
    }
    return false;
View Full Code Here

Examples of net.sf.saxon.sort.IntIterator

917
918
919
920
921
922
923
924
925
926
927
928
        }
        IntHashSet slots = new IntHashSet(10);
        gatherSlotsUsed(this, slots);
        slotsUsed = new int[slots.size()];
        int i=0;
        IntIterator iter = slots.iterator();
        while (iter.hasNext()) {
            slotsUsed[i++] = iter.next();
        }
        Arrays.sort(slotsUsed);
        return slotsUsed;
    }
View Full Code Here

Examples of org.apache.clerezza.rdf.core.impl.graphmatching.collections.IntIterator

117
118
119
120
121
122
123
124
125
126
127
128
129
    if (!hashNodeMap1.keySet().equals(hashNodeMap2.keySet())) {
      return null;
    }

    matchingGroups = new HashMap<Set<BNode>, Set<BNode>>();
    IntIterator hashIter = hashNodeMap1.keySet().intIterator();
    while (hashIter.hasNext()) {
      int hash = hashIter.next();
      Set<BNode> nodes1 = hashNodeMap1.get(hash);
      Set<BNode> nodes2 = hashNodeMap2.get(hash);
      if (nodes1.size() != nodes2.size()) {
        return null;
      }
View Full Code Here

Examples of org.apache.commons.collections.primitives.IntIterator

161
162
163
164
165
166
167
168
169
170
171
172
173
  }

  private List<Line> offsetToLineList(IntList offsets) {
    List<Line> results = new ArrayList<Line>();

    IntIterator i = offsets.iterator();
    while (i.hasNext()) {
      int offset = i.next();
      RequestLine requestLine = requests.get(offset);

      if (requestLine == null) {
        throw new IllegalStateException("line not found");
      }
View Full Code Here

Examples of org.apache.lucene.facet.collections.IntIterator

430
431
432
433
434
435
436
437
438
439
440
441
442
443
        tmpToReturn.rootNodeValue = tfr.rootNodeValue;
      }
      // now merge the HashMap of tfr into this of tmpToReturn
      IntToObjectMap<AACO> tmpToReturnMapToACCOs = tmpToReturn.mapToAACOs;
      IntToObjectMap<AACO> tfrMapToACCOs = tfr.mapToAACOs;
      IntIterator tfrIntIterator = tfrMapToACCOs.keyIterator();
      //iterate over all ordinals in tfr that are maps to their children
      while (tfrIntIterator.hasNext()) {
        int tfrkey = tfrIntIterator.next();
        AACO tmpToReturnAACO = null;
        if (null == (tmpToReturnAACO = tmpToReturnMapToACCOs.get(tfrkey))) {
          // if tmpToReturn does not have any kids of tfrkey, map all the kids
          // from tfr to it as one package, along with their redisude
          tmpToReturnMapToACCOs.put(tfrkey, tfrMapToACCOs.get(tfrkey));
View Full Code Here

Examples of org.apache.lucene.util.collections.IntIterator

447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
        tmpToReturn.rootNodeValue = tfr.rootNodeValue;
      }
      // now merge the HashMap of tfr into this of tmpToReturn
      IntToObjectMap<AACO> tmpToReturnMapToACCOs = tmpToReturn.mapToAACOs;
      IntToObjectMap<AACO> tfrMapToACCOs = tfr.mapToAACOs;
      IntIterator tfrIntIterator = tfrMapToACCOs.keyIterator();
      //iterate over all ordinals in tfr that are maps to their children (and the residue over
      // non included chilren)
      while (tfrIntIterator.hasNext()) {
        int tfrkey = tfrIntIterator.next();
        AACO tmpToReturnAACO = null;
        if (null == (tmpToReturnAACO = tmpToReturnMapToACCOs.get(tfrkey))) {
          // if tmpToReturn does not have any kids of tfrkey, map all the kids
          // from tfr to it as one package, along with their redisude
          tmpToReturnMapToACCOs.put(tfrkey, tfrMapToACCOs.get(tfrkey));
View Full Code Here

Examples of org.pdf4j.saxon.sort.IntIterator

924
925
926
927
928
929
930
931
932
933
934
935
        }
        IntHashSet slots = new IntHashSet(10);
        gatherSlotsUsed(this, slots);
        slotsUsed = new int[slots.size()];
        int i=0;
        IntIterator iter = slots.iterator();
        while (iter.hasNext()) {
            slotsUsed[i++] = iter.next();
        }
        Arrays.sort(slotsUsed);
        return slotsUsed;
    }
View Full Code Here

Examples of org.roaringbitmap.IntIterator

45
46
47
48
49
50
51
52
53
54
    ImmutableRTree secondTree = new ImmutableRTree(buffer, bf);
    Iterable<ImmutableGenericBitmap> points = secondTree.search(new RadiusBound(new float[]{0, 0}, 10));
    ImmutableGenericBitmap finalSet = bf.union(points);
    Assert.assertTrue(finalSet.size() >= 5);
    Set<Integer> expected = Sets.newHashSet(1, 2, 3, 4, 5);
    IntIterator iter = finalSet.iterator();
    while (iter.hasNext()) {
      Assert.assertTrue(expected.contains(iter.next()));
    }
  }
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.