blob: 5306918518111a66c25b4083012c86c54519104d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
using System;
using Lucene.Net.Support;
namespace Lucene.Net.Index
{
// TODO FI: some of this is "generic" to TermsHash* so we
// should factor it out so other consumers don't have to
// duplicate this code
/// <summary>Used by DocumentsWriter to merge the postings from
/// multiple ThreadStates when creating a segment
/// </summary>
sealed class FreqProxFieldMergeState
{
internal FreqProxTermsWriterPerField field;
internal int numPostings;
internal CharBlockPool charPool;
internal RawPostingList[] postings;
private FreqProxTermsWriter.PostingList p;
internal char[] text;
internal int textOffset;
private int postingUpto = - 1;
internal ByteSliceReader freq = new ByteSliceReader();
internal ByteSliceReader prox = new ByteSliceReader();
internal int docID;
internal int termFreq;
public FreqProxFieldMergeState(FreqProxTermsWriterPerField field)
{
this.field = field;
this.charPool = field.perThread.termsHashPerThread.charPool;
this.numPostings = field.termsHashPerField.numPostings;
this.postings = field.termsHashPerField.SortPostings();
}
internal bool NextTerm()
{
postingUpto++;
if (postingUpto == numPostings)
return false;
p = (FreqProxTermsWriter.PostingList) postings[postingUpto];
docID = 0;
text = charPool.buffers[p.textStart >> DocumentsWriter.CHAR_BLOCK_SHIFT];
textOffset = p.textStart & DocumentsWriter.CHAR_BLOCK_MASK;
field.termsHashPerField.InitReader(freq, p, 0);
if (!field.fieldInfo.omitTermFreqAndPositions)
field.termsHashPerField.InitReader(prox, p, 1);
// Should always be true
bool result = NextDoc();
System.Diagnostics.Debug.Assert(result);
return true;
}
public bool NextDoc()
{
if (freq.Eof())
{
if (p.lastDocCode != - 1)
{
// Return last doc
docID = p.lastDocID;
if (!field.omitTermFreqAndPositions)
termFreq = p.docFreq;
p.lastDocCode = - 1;
return true;
}
// EOF
else
return false;
}
int code = freq.ReadVInt();
if (field.omitTermFreqAndPositions)
docID += code;
else
{
docID += Number.URShift(code, 1);
if ((code & 1) != 0)
termFreq = 1;
else
termFreq = freq.ReadVInt();
}
System.Diagnostics.Debug.Assert(docID != p.lastDocID);
return true;
}
}
}
|
