Package org.apache.lucene.index

Examples of org.apache.lucene.index.AtomicReader.maxDoc()

59
60
61
62
63
64
65
66
67
68
69
      if (fc.getOccur() == Occur.SHOULD) {
        hasShouldClauses = true;
        final DocIdSetIterator disi = getDISI(fc.getFilter(), context);
        if (disi == null) continue;
        if (res == null) {
          res = new FixedBitSet(reader.maxDoc());
        }
        res.or(disi);
      }
    }
    if (hasShouldClauses && res == null)
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
   
    for (final FilterClause fc : clauses) {
      if (fc.getOccur() == Occur.MUST_NOT) {
        if (res == null) {
          assert !hasShouldClauses;
          res = new FixedBitSet(reader.maxDoc());
          res.set(0, reader.maxDoc()); // NOTE: may set bits on deleted docs
        }
        final DocIdSetIterator disi = getDISI(fc.getFilter(), context);
        if (disi != null) {
          res.andNot(disi);
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
    for (final FilterClause fc : clauses) {
      if (fc.getOccur() == Occur.MUST_NOT) {
        if (res == null) {
          assert !hasShouldClauses;
          res = new FixedBitSet(reader.maxDoc());
          res.set(0, reader.maxDoc()); // NOTE: may set bits on deleted docs
        }
        final DocIdSetIterator disi = getDISI(fc.getFilter(), context);
        if (disi != null) {
          res.andNot(disi);
        }
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
        final DocIdSetIterator disi = getDISI(fc.getFilter(), context);
        if (disi == null) {
          return DocIdSet.EMPTY_DOCIDSET; // no documents can match
        }
        if (res == null) {
          res = new FixedBitSet(reader.maxDoc());
          res.or(disi);
        } else {
          res.and(disi);
        }
      }
View Full Code Here
806
807
808
809
810
811
812
813
814
815
816
          CategoryPath cp = new CategoryPath(value, delimiter);
          final int ordinal = addCategory(cp);
          docs = te.docs(null, docs, DocsEnum.FLAG_NONE);
          ordinalMap.addMapping(docs.nextDoc() + base, ordinal);
        }
        base += ar.maxDoc(); // no deletions, so we're ok
      }
      ordinalMap.addDone();
    } finally {
      r.close();
    }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
    // sanity check of norms writer
    // TODO: generalize
    AtomicReader slow = new SlowCompositeReaderWrapper(reader);
    NumericDocValues fooNorms = slow.getNormValues("foo");
    NumericDocValues barNorms = slow.getNormValues("bar");
    for (int i = 0; i < slow.maxDoc(); i++) {
      assertFalse(fooNorms.get(i) == barNorms.get(i));
    }
   
    // sanity check of searching
    TopDocs foodocs = searcher.search(new TermQuery(new Term("foo", "brown")), 10);
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
    }

    @Override
    public DocIdSet getDocIdSet(AtomicReaderContext context, Bits acceptDocs) throws IOException {
      final AtomicReader reader = context.reader();
      OpenBitSet bitSet = new OpenBitSet( reader.maxDoc() );
      DocsEnum termDocsEnum = reader.termDocsEnum( new Term( "owner", ownerName ) );
      if ( termDocsEnum == null ) {
        return bitSet;//All bits already correctly set
      }
      while ( termDocsEnum.nextDoc() != DocsEnum.NO_MORE_DOCS ) {
View Full Code Here
189
190
191
192
193
194
195
196
197
198
199
    @Override
    public DocIdSet getDocIdSet(AtomicReaderContext context, Bits acceptDocs) throws IOException {
      final AtomicReader reader = context.reader();
      this.visitedReaders.add( reader );
      OpenBitSet bitSet = new OpenBitSet( reader.maxDoc() );
      for ( int i = 0; i < reader.maxDoc(); i++ ) {
        bitSet.fastSet( i );
      }
      Terms terms = reader.terms( fieldName );
      TermsEnum iterator = terms.iterator( null );
View Full Code Here
190
191
192
193
194
195
196
197
198
199
200
    @Override
    public DocIdSet getDocIdSet(AtomicReaderContext context, Bits acceptDocs) throws IOException {
      final AtomicReader reader = context.reader();
      this.visitedReaders.add( reader );
      OpenBitSet bitSet = new OpenBitSet( reader.maxDoc() );
      for ( int i = 0; i < reader.maxDoc(); i++ ) {
        bitSet.fastSet( i );
      }
      Terms terms = reader.terms( fieldName );
      TermsEnum iterator = terms.iterator( null );
      BytesRef next = iterator.next();
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
public class BestDriversFilter extends Filter {

  @Override
  public DocIdSet getDocIdSet(AtomicReaderContext context, Bits acceptDocs) throws IOException {
    AtomicReader reader = context.reader();
    OpenBitSet bitSet = new OpenBitSet( reader.maxDoc() );
    DocsEnum termDocsEnum = reader.termDocsEnum( new Term( "score", "5" ) );
    if ( termDocsEnum == null ) {
      return bitSet;//All bits already correctly set
    }
    while ( termDocsEnum.nextDoc() != DocsEnum.NO_MORE_DOCS ) {
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.