Package org.apache.lucene.search

Examples of org.apache.lucene.search.IndexSearcher.docFreq()

482
483
484
485
486
487
488
489
490
491
492
   */
  public boolean exist(String word) throws IOException {
    // obtainSearcher calls ensureOpen
    final IndexSearcher indexSearcher = obtainSearcher();
    try{
      return indexSearcher.docFreq(F_WORD_TERM.createTerm(word)) > 0;
    } finally {
      releaseSearcher(indexSearcher);
    }
  }

View Full Code Here
501
502
503
504
505
506
507
508
509
510
511
  public final boolean exist(final String word) throws IOException {
    ensureOpen();
    final IndexAccessor accessor = this.spellIndex.getAccessor();
    final IndexSearcher indexSearcher = (IndexSearcher) accessor.getPrioritizedSearcher();
    try {
      return indexSearcher.docFreq(F_WORD_TERM.createTerm(word)) > 0;
    } finally {
      if (accessor != null && indexSearcher != null) {
        accessor.release(indexSearcher);
      }
    }
View Full Code Here
540
541
542
543
544
545
546
547
548
549
550
          int len = word.length();
          if (len < THREE) {
            continue; // too short we bail but "too long" is fine...
          }

          if (indexSearcher.docFreq(F_WORD_TERM.createTerm(word)) > 0) {
            // if the word already exist in the gramindex
            continue;
          }

          // ok index the word
View Full Code Here
368
369
370
371
372
373
374
375
376
377
378
   */
  public boolean exist(String word) throws IOException {
    // obtainSearcher calls ensureOpen
    final IndexSearcher indexSearcher = obtainSearcher();
    try{
      return indexSearcher.docFreq(F_WORD_TERM.createTerm(word)) > 0;
    } finally {
      releaseSearcher(indexSearcher);
    }
  }

View Full Code Here
316
317
318
319
320
321
322
323
324
325
326
    for (final String shard : shards) {
      final java.util.Iterator<Term> termIterator = termSet.iterator();
      IndexSearcher searcher = getSearcherByShard(shard);
      while (termIterator.hasNext()) {
        final Term term = termIterator.next();
        final int docFreq = searcher.docFreq(term);
        docFreqs.put(term.field(), term.text(), docFreq);
      }
      docFreqs.addNumDocs(shardSize(shard));
    }
    return docFreqs;
View Full Code Here
483
484
485
486
487
488
489
490
491
492
493
   */
  public boolean exist(String word) throws IOException {
    // obtainSearcher calls ensureOpen
    final IndexSearcher indexSearcher = obtainSearcher();
    try{
      return indexSearcher.docFreq(F_WORD_TERM.createTerm(word)) > 0;
    } finally {
      releaseSearcher(indexSearcher);
    }
  }

View Full Code Here
368
369
370
371
372
373
374
375
376
377
378
   */
  public boolean exist(String word) throws IOException {
    // obtainSearcher calls ensureOpen
    final IndexSearcher indexSearcher = obtainSearcher();
    try{
      return indexSearcher.docFreq(F_WORD_TERM.createTerm(word)) > 0;
    } finally {
      releaseSearcher(indexSearcher);
    }
  }

View Full Code Here
549
550
551
552
553
554
555
556
557
558
559
   */
  public boolean exist(String word) throws IOException {
    // obtainSearcher calls ensureOpen
    final IndexSearcher indexSearcher = obtainSearcher();
    try{
      return indexSearcher.docFreq(F_WORD_TERM.createTerm(word)) > 0;
    } finally {
      releaseSearcher(indexSearcher);
    }
  }

View Full Code Here
550
551
552
553
554
555
556
557
558
559
560
   */
  public boolean exist(String word) throws IOException {
    // obtainSearcher calls ensureOpen
    final IndexSearcher indexSearcher = obtainSearcher();
    try{
      return indexSearcher.docFreq(F_WORD_TERM.createTerm(word)) > 0;
    } finally {
      releaseSearcher(indexSearcher);
    }
  }

View Full Code Here
483
484
485
486
487
488
489
490
491
492
493
   */
  public boolean exist(String word) throws IOException {
    // obtainSearcher calls ensureOpen
    final IndexSearcher indexSearcher = obtainSearcher();
    try{
      return indexSearcher.docFreq(F_WORD_TERM.createTerm(word)) > 0;
    } finally {
      releaseSearcher(indexSearcher);
    }
  }

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.