Searched refs:postings (Results 1 - 13 of 13) sorted by relevance

/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/
H A DPhraseScorer.java40 PhraseScorer(Weight weight, PhraseQuery.PostingsAndFreq[] postings, argument
51 if (postings.length > 0) {
52 min = new PhrasePositions(postings[0].postings, postings[0].position, 0, postings[0].terms);
55 for (int i = 1; i < postings.length; i++) {
56 PhrasePositions pp = new PhrasePositions(postings[i].postings, postings[
[all...]
H A DExactPhraseScorer.java63 ExactPhraseScorer(Weight weight, PhraseQuery.PostingsAndFreq[] postings, argument
69 chunkStates = new ChunkState[postings.length];
71 endMinus1 = postings.length-1;
73 for(int i=0;i<postings.length;i++) {
81 final boolean useAdvance = postings[i].docFreq > 5*postings[0].docFreq;
82 chunkStates[i] = new ChunkState(postings[i].postings, -postings[i].position, useAdvance);
83 if (i > 0 && !postings[
[all...]
H A DSloppyPhraseScorer.java45 SloppyPhraseScorer(Weight weight, PhraseQuery.PostingsAndFreq[] postings, Similarity similarity, argument
47 super(weight, postings, similarity, norms);
49 this.numPostings = postings==null ? 0 : postings.length;
50 pq = new PhraseQueue(postings.length);
289 * If there are repetitions, check if multi-term postings (MTP) are involved.<p>
300 * on the bipartite graph of postings and terms.
H A DPhraseQuery.java123 final TermPositions postings; field in class:PhraseQuery.PostingsAndFreq
129 public PostingsAndFreq(TermPositions postings, int docFreq, int position, Term... terms) { argument
130 this.postings = postings;
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/index/
H A DFreqProxTermsWriterPerField.java109 FreqProxPostingsArray postings = (FreqProxPostingsArray) termsHashPerField.postingsArray;
110 postings.lastPositions[termID] = fieldState.position;
120 FreqProxPostingsArray postings = (FreqProxPostingsArray) termsHashPerField.postingsArray;
121 postings.lastDocIDs[termID] = docState.docID;
123 postings.lastDocCodes[termID] = docState.docID;
125 postings.lastDocCodes[termID] = docState.docID << 1;
126 postings.docFreqs[termID] = 1;
140 FreqProxPostingsArray postings = (FreqProxPostingsArray) termsHashPerField.postingsArray;
142 assert indexOptions == IndexOptions.DOCS_ONLY || postings.docFreqs[termID] > 0;
145 if (docState.docID != postings
[all...]
H A DFreqProxFieldMergeState.java29 /** Used by DocumentsWriter to merge the postings from
37 final FreqProxPostingsArray postings; field in class:FreqProxFieldMergeState
56 this.postings = (FreqProxPostingsArray) field.termsHashPerField.postingsArray;
67 final int textStart = postings.textStarts[currentTermID];
92 if (postings.lastDocCodes[currentTermID] != -1) {
94 docID = postings.lastDocIDs[currentTermID];
96 termFreq = postings.docFreqs[currentTermID];
97 postings.lastDocCodes[currentTermID] = -1;
115 assert docID != postings.lastDocIDs[currentTermID];
H A DSegmentMergeInfo.java31 private TermPositions postings; // use getPositions() field in class:SegmentMergeInfo
65 if (postings == null) {
66 postings = reader.termPositions();
68 return postings;
85 if (postings != null) {
86 postings.close();
H A DTermVectorsTermsWriterPerField.java130 TermVectorsPostingsArray postings = (TermVectorsPostingsArray) termsHashPerField.postingsArray;
149 final int freq = postings.freqs[termID];
151 final char[] text2 = charBuffers[postings.textStarts[termID] >> DocumentsWriter.CHAR_BLOCK_SHIFT];
152 final int start2 = postings.textStarts[termID] & DocumentsWriter.CHAR_BLOCK_MASK;
224 TermVectorsPostingsArray postings = (TermVectorsPostingsArray) termsHashPerField.postingsArray;
226 postings.freqs[termID] = 1;
234 postings.lastOffsets[termID] = endOffset;
239 postings.lastPositions[termID] = fieldState.position;
248 TermVectorsPostingsArray postings = (TermVectorsPostingsArray) termsHashPerField.postingsArray;
250 postings
[all...]
H A DSegmentMerger.java512 /** Process postings from multiple segments all positioned on the
529 TermPositions postings = smi.getPositions();
530 assert postings != null;
533 postings.seek(smi.termEnum);
540 while (postings.next()) {
542 int doc = postings.doc();
547 final int freq = postings.freq();
552 final int position = postings.nextPosition();
553 int payloadLength = postings.getPayloadLength();
557 postings
[all...]
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/index/
H A DTestLongPostings.java162 final TermPositions postings = r.termPositions(new Term("field", term));
183 boolean result = postings.next();
191 docID = postings.doc();
198 final int freq = postings.freq();
201 assertEquals(pos, postings.nextPosition());
202 if (random.nextBoolean() && postings.isPayloadAvailable()) {
203 postings.getPayload(payload, 0);
231 final boolean result = postings.skipTo(targetDocID);
239 docID = postings.doc();
246 final int freq = postings
[all...]
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/index/
H A DTestLongPostings.java161 final TermPositions postings = r.termPositions(new Term("field", term));
182 boolean result = postings.next();
190 docID = postings.doc();
197 final int freq = postings.freq();
200 assertEquals(pos, postings.nextPosition());
201 if (random.nextBoolean() && postings.isPayloadAvailable()) {
202 postings.getPayload(payload, 0);
230 final boolean result = postings.skipTo(targetDocID);
238 docID = postings.doc();
245 final int freq = postings
[all...]
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/search/
H A DJustCompileSearch.java321 JustCompilePhraseScorer(Weight weight, PhraseQuery.PostingsAndFreq[] postings, argument
323 super(weight, postings, similarity, norms);
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/search/
H A DJustCompileSearch.java321 JustCompilePhraseScorer(Weight weight, PhraseQuery.PostingsAndFreq[] postings, argument
323 super(weight, postings, similarity, norms);

Completed in 26 milliseconds