-
Notifications
You must be signed in to change notification settings - Fork 623
/
MultiTerms.cs
201 lines (181 loc) · 6.71 KB
/
MultiTerms.cs
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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
using J2N.Collections.Generic.Extensions;
using Lucene.Net.Diagnostics;
using System.Collections.Generic;
using JCG = J2N.Collections.Generic;
namespace Lucene.Net.Index
{
/*
* 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 BytesRef = Lucene.Net.Util.BytesRef;
using CompiledAutomaton = Lucene.Net.Util.Automaton.CompiledAutomaton;
/// <summary>
/// Exposes flex API, merged from flex API of
/// sub-segments.
/// <para/>
/// @lucene.experimental
/// </summary>
public sealed class MultiTerms : Terms
{
private readonly Terms[] subs;
private readonly ReaderSlice[] subSlices;
private readonly IComparer<BytesRef> termComp;
private readonly bool hasFreqs;
private readonly bool hasOffsets;
private readonly bool hasPositions;
private readonly bool hasPayloads;
/// <summary>
/// Sole constructor.
/// </summary>
/// <param name="subs"> The <see cref="Terms"/> instances of all sub-readers. </param>
/// <param name="subSlices"> A parallel array (matching
/// <paramref name="subs"/>) describing the sub-reader slices. </param>
public MultiTerms(Terms[] subs, ReaderSlice[] subSlices)
{
this.subs = subs;
this.subSlices = subSlices;
IComparer<BytesRef> _termComp = null;
if (Debugging.AssertsEnabled) Debugging.Assert(subs.Length > 0, "inefficient: don't use MultiTerms over one sub");
bool _hasFreqs = true;
bool _hasOffsets = true;
bool _hasPositions = true;
bool _hasPayloads = false;
for (int i = 0; i < subs.Length; i++)
{
if (_termComp is null)
{
_termComp = subs[i].Comparer;
}
else
{
// We cannot merge sub-readers that have
// different TermComps
IComparer<BytesRef> subTermComp = subs[i].Comparer;
if (subTermComp != null && !subTermComp.Equals(_termComp))
{
throw IllegalStateException.Create("sub-readers have different BytesRef.Comparers; cannot merge");
}
}
_hasFreqs &= subs[i].HasFreqs;
_hasOffsets &= subs[i].HasOffsets;
_hasPositions &= subs[i].HasPositions;
_hasPayloads |= subs[i].HasPayloads;
}
termComp = _termComp;
hasFreqs = _hasFreqs;
hasOffsets = _hasOffsets;
hasPositions = _hasPositions;
hasPayloads = hasPositions && _hasPayloads; // if all subs have pos, and at least one has payloads.
}
public override TermsEnum Intersect(CompiledAutomaton compiled, BytesRef startTerm)
{
IList<MultiTermsEnum.TermsEnumIndex> termsEnums = new JCG.List<MultiTermsEnum.TermsEnumIndex>();
for (int i = 0; i < subs.Length; i++)
{
TermsEnum termsEnum = subs[i].Intersect(compiled, startTerm);
if (termsEnum != null)
{
termsEnums.Add(new MultiTermsEnum.TermsEnumIndex(termsEnum, i));
}
}
if (termsEnums.Count > 0)
{
return (new MultiTermsEnum(subSlices)).Reset(termsEnums.ToArray(/*MultiTermsEnum.TermsEnumIndex.EMPTY_ARRAY*/));
}
else
{
return TermsEnum.EMPTY;
}
}
public override TermsEnum GetEnumerator()
{
IList<MultiTermsEnum.TermsEnumIndex> termsEnums = new JCG.List<MultiTermsEnum.TermsEnumIndex>();
for (int i = 0; i < subs.Length; i++)
{
TermsEnum termsEnum = subs[i].GetEnumerator();
if (termsEnum != null)
{
termsEnums.Add(new MultiTermsEnum.TermsEnumIndex(termsEnum, i));
}
}
if (termsEnums.Count > 0)
{
return (new MultiTermsEnum(subSlices)).Reset(termsEnums.ToArray(/*MultiTermsEnum.TermsEnumIndex.EMPTY_ARRAY*/));
}
else
{
return TermsEnum.EMPTY;
}
}
public override long Count => -1;
public override long SumTotalTermFreq
{
get
{
long sum = 0;
foreach (Terms terms in subs)
{
long v = terms.SumTotalTermFreq;
if (v == -1)
{
return -1;
}
sum += v;
}
return sum;
}
}
public override long SumDocFreq
{
get
{
long sum = 0;
foreach (Terms terms in subs)
{
long v = terms.SumDocFreq;
if (v == -1)
{
return -1;
}
sum += v;
}
return sum;
}
}
public override int DocCount
{
get
{
int sum = 0;
foreach (Terms terms in subs)
{
int v = terms.DocCount;
if (v == -1)
{
return -1;
}
sum += v;
}
return sum;
}
}
public override IComparer<BytesRef> Comparer => termComp;
public override bool HasFreqs => hasFreqs;
public override bool HasOffsets => hasOffsets;
public override bool HasPositions => hasPositions;
public override bool HasPayloads => hasPayloads;
}
}