Package org.apache.lucene.util

Examples of org.apache.lucene.util.BytesRefIterator

43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
      random().nextBytes(current);
      sorter.add(new BytesRef(current));
    }

    // Create two iterators and check that they're aligned with each other.
    BytesRefIterator i1 = sorter.iterator();
    BytesRefIterator i2 = sorter.iterator();
   
    // Verify sorter contract.
    try {
      sorter.add(new BytesRef(new byte [1]));
      fail("expected contract violation.");
    } catch (IllegalStateException e) {
      // Expected.
    }
    BytesRef spare1;
    BytesRef spare2;
    while ((spare1 = i1.next()) != null && (spare2 = i2.next()) != null) {
      assertEquals(spare1, spare2);
    }
    assertNull(i1.next());
    assertNull(i2.next());
  } 
View Full Code Here
175
176
177
178
179
180
181
182
183
184
185
   */
  public BytesRefIterator iterator(final Comparator<BytesRef> comp) {
    final BytesRef spare = new BytesRef();
    final int size = size();
    final int[] indices = comp == null ? null : sort(comp);
    return new BytesRefIterator() {
      int pos = 0;
     
      @Override
      public BytesRef next() {
        if (pos < size) {
View Full Code Here
155
156
157
158
159
160
161
162
163
164
165
   * or unsorted keys from the dictionary's iterator - use
   * {@link SortedInputIterator} or
   * {@link UnsortedInputIterator} in such case.
   */
  public void build(Dictionary dict) throws IOException {
    BytesRefIterator it = dict.getWordsIterator();
    InputIterator tfit;
    if (it instanceof InputIterator) {
      tfit = (InputIterator)it;
    } else {
      tfit = new InputIterator.InputIteratorWrapper(it);
View Full Code Here
33
34
35
36
37
38
39
40
41
42
    IndexWriter writer = new IndexWriter(dir, newIndexWriterConfig(TEST_VERSION_CURRENT, new MockAnalyzer(random())));
    writer.commit();
    writer.close();
    IndexReader ir = DirectoryReader.open(dir);
    Dictionary dictionary = new HighFrequencyDictionary(ir, "bogus", 0.1f);
    BytesRefIterator tf = dictionary.getWordsIterator();
    assertNull(tf.getComparator());
    assertNull(tf.next());
    dir.close();
  }
View Full Code Here
510
511
512
513
514
515
516
517
518
519
520
521
522
523
      }
     
      boolean isEmpty = termsEnums.isEmpty();

      try {
        BytesRefIterator iter = dict.getWordsIterator();
        BytesRef currentTerm;
       
        terms: while ((currentTerm = iter.next()) != null) {
 
          String word = currentTerm.utf8ToString();
          int len = word.length();
          if (len < 3) {
            continue; // too short we bail but "too long" is fine...
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
71
        assertEquals("entry " + i + " doesn't match", stringList.get(e),
            spare.utf8ToString());
      }
      for (int i = 0; i < 2; i++) {
       
        BytesRefIterator iterator = list.iterator();
        for (String string : stringList) {
          assertEquals(string, iterator.next().utf8ToString());
        }
      }
    }
  }
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
        assertEquals(initSize + i, list.append(spare));
        stringList.add(randomRealisticUnicodeString);
      }
     
      Collections.sort(stringList);
      BytesRefIterator iter = list.iterator(BytesRef
          .getUTF8SortedAsUTF16Comparator());
      int i = 0;
      while ((spare = iter.next()) != null) {
        assertEquals("entry " + i + " doesn't match", stringList.get(i),
            spare.utf8ToString());
        i++;
      }
      assertNull(iter.next());
      assertEquals(i, stringList.size());
    }
   
  }
View Full Code Here
244
245
246
247
248
249
250
251
252
253
254
255
   
    BytesRef scratch = new BytesRef();
    BytesRef entry;
    final IntsRef scratchIntsRef = new IntsRef();
    int count = 0;
    BytesRefIterator iter = sorter.iterator();
    while((entry = iter.next()) != null) {
      count++;
      if (scratch.compareTo(entry) != 0) {
        builder.add(Util.toIntsRef(entry, scratchIntsRef), empty);
        scratch.copyBytes(entry);
      }
View Full Code Here
510
511
512
513
514
515
516
517
518
519
520
521
522
523
      }
     
      boolean isEmpty = termsEnums.isEmpty();

      try {
        BytesRefIterator iter = dict.getEntryIterator();
        BytesRef currentTerm;
       
        terms: while ((currentTerm = iter.next()) != null) {
 
          String word = currentTerm.utf8ToString();
          int len = word.length();
          if (len < 3) {
            continue; // too short we bail but "too long" is fine...
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
   * or unsorted keys from the dictionary's iterator - use
   * {@link SortedTermFreqIteratorWrapper} or
   * {@link UnsortedTermFreqIteratorWrapper} in such case.
   */
  public void build(Dictionary dict) throws IOException {
    BytesRefIterator it = dict.getWordsIterator();
    TermFreqIterator tfit;
    if (it instanceof TermFreqIterator) {
      tfit = (TermFreqIterator)it;
    } else {
      tfit = new TermFreqIterator.TermFreqIteratorWrapper(it);
View Full Code Here
TOP

Related Classes of org.apache.lucene.util.BytesRefIterator

  • org.apache.lucene.search.spell.SpellChecker
  • org.apache.lucene.search.suggest.BytesRefArray
  • org.apache.lucene.search.suggest.BytesRefList
  • org.apache.lucene.search.suggest.fst.BytesRefSortersTest
  • org.apache.lucene.search.suggest.fst.FSTCompletionBuilder
  • org.apache.lucene.search.suggest.Lookup
  • org.apache.lucene.search.suggest.TestBytesRefArray
  • org.apache.lucene.search.suggest.TestBytesRefList
  • org.apache.lucene.search.suggest.TestHighFrequencyDictionary
  • org.apache.lucene.util.BytesRefArray
    • 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.