Package org.apache.lucene.index

Examples of org.apache.lucene.index.TermDocs.seek()

88
89
90
91
92
93
94
95
96
97
98
      if(!this.isFinish())
      {
        TermDocs td = te.getTermDocs();
        if(df<=SKIP_MIN||this.uni.baseAdvanceDocs==null)
        {
          td.seek(te);
          this.set_Doc2TermNum_NonSkip(td, docs, freqs, termNum,true,maxDoc);
        } else {

          MixTermInfo cl = new MixTermInfo(df, termNum, tdreader,  new Term(t.field(), t.text()));
          if (termDocslist.size() < limitsize) {
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
            if (UnInvertedFieldUtils.TD_CMP.compare(peek, cl) > 0 && cl.getCount() / (peek.getCount() + 1) > 1.5) {
              termDocslist.add(cl);
              MixTermInfo cl_old = termDocslist.poll();
              this.set_Doc2TermNum_NonSkip(cl_old.getTd(), docs,freqs, cl_old.getTermNum(), true, maxDoc);
            } else {
              td.seek(te);
              this.set_Doc2TermNum_NonSkip(td, docs, freqs,termNum, true, maxDoc);
            }
          }
        }
      }
View Full Code Here
194
195
196
197
198
199
200
201
202
203
204
      }
      TermDocs td = te.getTermDocs();

      int df = te.docFreq();
      if (df <= SKIP_MIN || this.uni.baseAdvanceDocs == null) {
        td.seek(te);
        this.set_Doc2TermNum_NonSkip(td, docs, freqs, termNum, false, maxDoc);
      } else {
        MixTermInfo cl = new MixTermInfo(df, termNum, tdreader,  new Term(t.field(), t.text()));
        if (termDocslist.size() < limitsize) {
          termDocslist.add(cl);
View Full Code Here
207
208
209
210
211
212
213
214
215
216
217
          if (UnInvertedFieldUtils.TD_CMP.compare(peek, cl) > 0 && cl.getCount() / (peek.getCount() + 1) > 1.5) {
            termDocslist.add(cl);
            MixTermInfo cl_old = termDocslist.poll();
            this.set_Doc2TermNum_NonSkip(cl_old.getTd(), docs,  freqs, cl_old.getTermNum(), false, maxDoc);
          } else {
            td.seek(te);
            this.set_Doc2TermNum_NonSkip(td, docs, freqs, termNum, false, maxDoc);
          }
        }
      }
      te.next();
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
        Term term = enumerator.term();
        if (term != null &&
            term.text().startsWith(prefixText) &&
            term.field() == prefixField)
        {
          termDocs.seek(term);
          while (termDocs.next()) {
            handleDoc(termDocs.doc());
          }
        } else {
          break;
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
    TermDocs termDocs = reader.termDocs();
    try {
      do {
        Term term = enumerator.term();
        if (term==null) break;
        termDocs.seek(term);
        while (termDocs.next()) {
          handleDoc(termDocs.doc());
        }
      } while (enumerator.next());
    } finally {
View Full Code Here
320
321
322
323
324
325
326
327
328
329
330
          if (sorted) {
            int countNext = 0;
            for(;;) {
              int cmp = internalKey.compareTo(termVal);
              if (cmp == 0) {
                termDocs.seek(termEnum);
                while (termDocs.next()) {
                  vals[termDocs.doc()] = fval;
                }
                break;
              } else if (cmp < 0) {
View Full Code Here
363
364
365
366
367
368
369
370
371
372
373
          termEnum = reader.terms(protoTerm.createTerm(internalKey));
          t = termEnum.term();
          if (t != null && t.field() == idName  // intern'd comparison
                  && internalKey.equals(t.text()))
          {
            termDocs.seek (termEnum);
            while (termDocs.next()) {
              vals[termDocs.doc()] = fval;
            }
          } else {
            if (notFoundCount<10) {  // collect first 10 not found for logging
View Full Code Here
403
404
405
406
407
408
409
410
411
412
413
    TermEnum terms = reader.terms();
    TermDocs termDocs = reader.termDocs();
    int totalTokenCount2 = 0;
    while(terms.next()) {
      termDocs.seek(terms.term());
      while(termDocs.next())
        totalTokenCount2 += termDocs.freq();
    }
    reader.close();
View Full Code Here
655
656
657
658
659
660
661
662
663
664
665
      try {
        do {
          Term term = termEnum.term();
          if (term==null || term.field() != field) break;
          String termval = term.text();
          termDocs.seek (termEnum);
          while (termDocs.next()) {
            retArray[termDocs.doc()] = termval;
          }
        } while (termEnum.next());
      } finally {
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.