List of usage examples for org.apache.lucene.search DocIdSetIterator NO_MORE_DOCS
int NO_MORE_DOCS
To view the source code for org.apache.lucene.search DocIdSetIterator NO_MORE_DOCS.
Click Source Link
From source file:javaewah.EWAHCompressedBitmapTest.java
License:Open Source License
/** * Test massive or.//from w ww . j a va 2 s.c om */ @Test public void testMassiveOr() throws IOException { System.out.println("testing massive logical or (can take a couple of minutes)"); final int N = 128; for (int howmany = 512; howmany <= 10000; howmany *= 2) { EWAHCompressedBitmap[] ewah = new EWAHCompressedBitmap[N]; BitSet[] bset = new BitSet[N]; for (int k = 0; k < ewah.length; ++k) { ewah[k] = new EWAHCompressedBitmap(); } for (int k = 0; k < bset.length; ++k) { bset[k] = new BitSet(); } for (int k = 0; k < N; ++k) { assertEqualsPositions(bset[k], ewah[k]); } for (int k = 0; k < howmany; ++k) { ewah[(k + 2 * k * k) % ewah.length].set(k); bset[(k + 2 * k * k) % ewah.length].set(k); } for (int k = 0; k < N; ++k) { assertEqualsPositions(bset[k], ewah[k]); } EWAHCompressedBitmap answer = ewah[0]; BitSet bitsetanswer = bset[0]; for (int k = 1; k < ewah.length; ++k) { EWAHCompressedBitmap tmp = answer.or(ewah[k]); bitsetanswer.or(bset[k]); answer = tmp; assertEqualsPositions(bitsetanswer, answer); } assertEqualsPositions(bitsetanswer, answer); int k = 0; int doc; for (DocIdSetIterator iter = answer .iterator(); (doc = iter.nextDoc()) != DocIdSetIterator.NO_MORE_DOCS;) { if (k != doc) System.out.println(answer.toDebugString()); equal(k, doc); k += 1; } } }
From source file:lucene.security.index.SecureAtomicReaderTestBase.java
License:Apache License
@Test public void testTermWalk() throws IOException, ParseException { SecureAtomicReader secureReader = getSecureReader(); Fields fields = secureReader.fields(); for (String field : fields) { Terms terms = fields.terms(field); TermsEnum termsEnum = terms.iterator(null); BytesRef ref;//from w ww . j ava2s .co m while ((ref = termsEnum.next()) != null) { System.out.println(field + " " + ref.utf8ToString()); DocsEnum docsEnum = termsEnum.docs(null, null); int doc; while ((doc = docsEnum.nextDoc()) != DocIdSetIterator.NO_MORE_DOCS) { System.out.println(field + " " + ref.utf8ToString() + " " + doc); } } } secureReader.close(); }
From source file:lux.IndexTest.java
License:Mozilla Public License
private void assertPathQuery(IndexTestSupport indexTestSupport) throws ParseException, IOException { SrndQuery q = new QueryParser().parse2("w(w({},\"ACT\"),\"SCENE\")"); Query q2 = q.makeLuceneQueryFieldNoBoost( indexTestSupport.indexer.getConfiguration().getFieldName(FieldRole.PATH), new BasicQueryFactory()); DocIdSetIterator iter = indexTestSupport.searcher.search(q2); int count = 0; while (iter.nextDoc() != DocIdSetIterator.NO_MORE_DOCS) { ++count;/* w ww. j a va2 s .co m*/ } assertEquals(5, count); }
From source file:lux.IndexTest.java
License:Mozilla Public License
private void assertFullTextQuery(IndexTestSupport indexTestSupport, String qName, String term, int expectedCount) throws IOException, ParserException { LuxSearcher searcher = indexTestSupport.searcher; XmlIndexer indexer = indexTestSupport.indexer; IndexConfiguration config = indexer.getConfiguration(); FieldDefinition field = config.getField(FieldRole.ELEMENT_TEXT); Query q = new XmlQueryParser(field.getName(), field.getAnalyzer()).parse(new ByteArrayInputStream( ("<QNameTextQuery fieldName=\"" + config.getFieldName(FieldRole.ELEMENT_TEXT) + "\" qName=\"" + qName + "\">" + term + "</QNameTextQuery>").getBytes())); DocIdSetIterator iter = searcher.search(q); int count = 0; while (iter.nextDoc() != DocIdSetIterator.NO_MORE_DOCS) { ++count;/* ww w .j a va 2 s .c o m*/ } assertEquals(expectedCount, count); }
From source file:lux.IndexTest.java
License:Mozilla Public License
private void assertXPathIntField(IndexTestSupport indexTestSupport) throws ParseException, IOException { Query q = NumericRangeQuery.newIntRange("nodecount", 6000, 20000, true, true); DocIdSetIterator iter = indexTestSupport.searcher.search(q); int count = 0; while (iter.nextDoc() != DocIdSetIterator.NO_MORE_DOCS) { ++count;//from w w w.j a v a 2 s . c om } assertEquals(1, count); }
From source file:lux.IndexTest.java
License:Mozilla Public License
private void assertXPathStringField(int expectedCount, String field, String term, IndexTestSupport indexTestSupport) throws ParseException, IOException { Query q = new TermQuery(new Term(field, term)); DocIdSetIterator iter = indexTestSupport.searcher.search(q); int count = 0; while (iter.nextDoc() != DocIdSetIterator.NO_MORE_DOCS) { ++count;/*w w w . ja v a 2s . co m*/ } assertEquals("Wrong number of matches for " + q.toString(), expectedCount, count); }
From source file:lux.IndexTest.java
License:Mozilla Public License
private void assertTotalDocs() throws IOException { LuxSearcher searcher = new LuxSearcher(dir); DocIdSetIterator results = searcher.search(new MatchAllDocsQuery()); int count = 0; while (results.nextDoc() != DocIdSetIterator.NO_MORE_DOCS) { ++count;/*from www . ja va 2 s . c om*/ } assertEquals(6641, count); /* */ searcher.close(); }
From source file:monad.face.internal.MonadSparseFixedBitSet.java
License:Apache License
/** Return the first document that occurs on or after the provided block index. */ private int firstDoc(int i4096) { long index = 0; while (i4096 < indices.length) { index = indices[i4096];/* ww w . ja v a 2 s . c o m*/ if (index != 0) { final int i64 = Long.numberOfTrailingZeros(index); return (i4096 << 12) | (i64 << 6) | Long.numberOfTrailingZeros(bits[i4096][0]); } i4096 += 1; } return DocIdSetIterator.NO_MORE_DOCS; }
From source file:nl.inl.blacklab.MockSpansInBuckets.java
License:Apache License
@Override public int docID() { if (currentBucket >= bucketDoc.length) return DocIdSetIterator.NO_MORE_DOCS; return bucketDoc[currentBucket]; }
From source file:nl.inl.blacklab.MockSpansInBuckets.java
License:Apache License
@Override public int nextDoc() { if (currentBucket >= bucketDoc.length) return DocIdSetIterator.NO_MORE_DOCS; alreadyAtFirstBucket = false;//from ww w. j av a2s. c o m int curDoc = currentBucket == -1 ? -1 : bucketDoc[currentBucket]; while (currentBucket < bucketDoc.length && (currentBucket == -1 || bucketDoc[currentBucket] == curDoc)) { currentBucket++; } if (currentBucket == bucketDoc.length) return DocIdSetIterator.NO_MORE_DOCS; alreadyAtFirstBucket = true; return docID(); }