public boolean next() { while (id < maxId) { id++; if (!reader.isDeleted(id)) { return true; } } return false; }
public boolean next() throws IOException { for(;;) { ++doc; if (doc>=maxDoc) { return false; } if (reader.isDeleted(doc)) { continue; } return true; } }
public boolean next() { while (id < maxId) { id++; if (!reader.isDeleted(id)) { return true; } } return false; }
public boolean next() throws IOException { for(;;) { ++doc; if (doc>=maxDoc) { return false; } if (reader.isDeleted(doc)) { continue; } return true; } }
public boolean isDeleted(int n) { // Don't call ensureOpen() here (it could affect performance) return in.isDeleted(n); }
@Override public boolean isDeleted(int n) { return in.isDeleted(n); }
@Override protected boolean match(final int docId) throws IOException { return !this.reader.isDeleted(docId); }
public boolean isDeleted(int n) { // Don't call ensureOpen() here (it could affect performance) return in.isDeleted(n); }
@Override public boolean isDeleted(final int n) { return this.delegate.isDeleted(n); }
public Boolean isDeleted(int i) { return reader.isDeleted(i); }
@Override public boolean isDeleted(int docid) { if(!_noDedup) { int[] delSet = _delDocIds;//.get(); if(delSet != null && Arrays.binarySearch(delSet, docid) >= 0) return true; } return in.isDeleted(docid); }
public boolean isDeleted(int n) { // Don't call ensureOpen() here (it could affect performance) if (readers.size() > 0) return ((IndexReader)readers.get(0)).isDeleted(n); return false; }
public boolean isDeleted(int n) { // Don't call ensureOpen() here (it could affect performance) if (readers.size() > 0) return ((IndexReader)readers.get(0)).isDeleted(n); return false; }
public boolean isDeleted(int n) { // Don't call ensureOpen() here (it could affect performance) int i = readerIndex(n); // find segment num return subReaders[i].isDeleted(n - starts[i]); // dispatch to segment reader }
public boolean isDeleted(int n) { // Don't call ensureOpen() here (it could affect performance) int i = readerIndex(n); // find segment num return subReaders[i].isDeleted(n - starts[i]); // dispatch to segment reader }
public boolean isDeleted(int n) { int i = readerIndex(n); // find segment num return subReaders[i].isDeleted(n - starts[i]); // dispatch to segment reader }
IndexReader r = IndexReader.open( "prdb_index"); int num = r.numDocs(); for ( int i = 0; i < num; i++) { if ( ! r.isDeleted( i)) { Document d = r.document( i); System.out.println( "d=" +d); } } r.close();
@Override public boolean isDeleted(final int n) { int offset = 0; for (IndexReader reader : this.subReaders) { if (n < offset + reader.maxDoc()) { return reader.isDeleted(n - offset); } offset += reader.maxDoc(); } throw new IllegalArgumentException("docId out of bounds!"); }
@Override public boolean isDeleted(final int n) { return getUnderlyingReader().isDeleted(n) || !this.bits.get(n); }
public FakeDeleteIndexReader(IndexReader in) { super(in); dels = new FixedBitSet(in.maxDoc()); if (in.hasDeletions()) { oldDels = new FixedBitSet(in.maxDoc()); for (int i = 0; i < in.maxDoc(); i++) { if (in.isDeleted(i)) oldDels.set(i); } dels.or(oldDels); } }