MtasSpanPrecededBySpans.java.html
14.3 KB
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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../jacoco-resources/report.css" type="text/css"/><link rel="shortcut icon" href="../jacoco-resources/report.gif" type="image/gif"/><title>MtasSpanPrecededBySpans.java</title><link rel="stylesheet" href="../jacoco-resources/prettify.css" type="text/css"/><script type="text/javascript" src="../jacoco-resources/prettify.js"></script></head><body onload="window['PR_TAB_WIDTH']=4;prettyPrint()"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="../jacoco-sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">MTAS</a> > <a href="index.source.html" class="el_package">mtas.search.spans</a> > <span class="el_source">MtasSpanPrecededBySpans.java</span></div><h1>MtasSpanPrecededBySpans.java</h1><pre class="source lang-java linenums">package mtas.search.spans;
import java.io.IOException;
import java.util.HashSet;
import org.apache.lucene.search.spans.SpanCollector;
import mtas.search.spans.MtasSpanPrecededByQuery.MtasSpanPrecededByQuerySpans;
import mtas.search.spans.util.MtasSpans;
/**
* The Class MtasSpanPrecededBySpans.
*/
public class MtasSpanPrecededBySpans extends MtasSpans {
/** The spans 1. */
private MtasSpanPrecededByQuerySpans spans1;
/** The spans 2. */
private MtasSpanPrecededByQuerySpans spans2;
/** The last spans 2 start position. */
private int lastSpans2StartPosition;
/** The last spans 2 end position. */
private int lastSpans2EndPosition;
/** The maximum spans 2 end position. */
private int maximumSpans2EndPosition;
/** The previous spans 2 end positions. */
private HashSet<Integer> previousSpans2EndPositions;
/** The called next start position. */
private boolean calledNextStartPosition;
/** The no more positions. */
private boolean noMorePositions;
/** The doc id. */
private int docId;
/**
* Instantiates a new mtas span preceded by spans.
*
* @param mtasSpanPrecededByQuery
* the mtas span preceded by query
* @param spans1
* the spans 1
* @param spans2
* the spans 2
*/
public MtasSpanPrecededBySpans(MtasSpanPrecededByQuerySpans spans1,
MtasSpanPrecededByQuerySpans spans2) {
<span class="fc" id="L54"> super();</span>
<span class="fc" id="L55"> docId = -1;</span>
<span class="fc" id="L56"> this.spans1 = spans1;</span>
<span class="fc" id="L57"> this.spans2 = spans2;</span>
<span class="fc" id="L58"> previousSpans2EndPositions = new HashSet<>();</span>
<span class="fc" id="L59"> }</span>
/*
* (non-Javadoc)
*
* @see
* org.apache.lucene.search.spans.Spans#collect(org.apache.lucene.search.spans
* .SpanCollector)
*/
@Override
public void collect(SpanCollector collector) throws IOException {
<span class="nc" id="L70"> spans1.spans.collect(collector);</span>
<span class="nc" id="L71"> spans2.spans.collect(collector);</span>
<span class="nc" id="L72"> }</span>
/*
* (non-Javadoc)
*
* @see org.apache.lucene.search.spans.Spans#endPosition()
*/
@Override
public int endPosition() {
<span class="pc bpc" id="L81" title="1 of 2 branches missed."> if(calledNextStartPosition) {</span>
<span class="pc bpc" id="L82" title="1 of 2 branches missed."> return noMorePositions ? NO_MORE_POSITIONS : spans1.spans.endPosition();</span>
} else {
<span class="nc" id="L84"> return -1;</span>
}
}
/*
* (non-Javadoc)
*
* @see org.apache.lucene.search.spans.Spans#nextStartPosition()
*/
@Override
public int nextStartPosition() throws IOException {
// no document
<span class="pc bpc" id="L96" title="2 of 4 branches missed."> if (docId == -1 || docId == NO_MORE_DOCS) {</span>
<span class="nc" id="L97"> throw new IOException("no document");</span>
// finished
<span class="pc bpc" id="L99" title="1 of 2 branches missed."> } else if (noMorePositions) {</span>
<span class="nc" id="L100"> return NO_MORE_POSITIONS;</span>
// littleSpans already at start match, because of check for matching
// document
<span class="fc bfc" id="L103" title="All 2 branches covered."> } else if (!calledNextStartPosition) {</span>
<span class="fc" id="L104"> calledNextStartPosition = true;</span>
<span class="fc" id="L105"> return spans1.spans.startPosition();</span>
// compute next match
} else {
<span class="fc bfc" id="L108" title="All 2 branches covered."> if (goToNextStartPosition()) {</span>
// match found
<span class="fc" id="L110"> return spans1.spans.startPosition();</span>
} else {
// no more matches: document finished
<span class="fc" id="L113"> return NO_MORE_POSITIONS;</span>
}
}
}
/*
* (non-Javadoc)
*
* @see org.apache.lucene.search.spans.Spans#positionsCost()
*/
@Override
public float positionsCost() {
<span class="nc" id="L125"> return 0;</span>
}
/*
* (non-Javadoc)
*
* @see org.apache.lucene.search.spans.Spans#startPosition()
*/
@Override
public int startPosition() {
<span class="pc bpc" id="L135" title="1 of 2 branches missed."> if(calledNextStartPosition) {</span>
<span class="pc bpc" id="L136" title="1 of 2 branches missed."> return noMorePositions ? NO_MORE_POSITIONS : spans1.spans.startPosition();</span>
} else {
<span class="nc" id="L138"> return -1;</span>
}
}
/*
* (non-Javadoc)
*
* @see org.apache.lucene.search.spans.Spans#width()
*/
@Override
public int width() {
<span class="nc bnc" id="L149" title="All 2 branches missed."> if(calledNextStartPosition) {</span>
<span class="nc bnc" id="L150" title="All 2 branches missed."> return noMorePositions ? 0</span>
<span class="nc" id="L151"> : spans1.spans.endPosition() - spans1.spans.startPosition();</span>
} else {
<span class="nc" id="L153"> return 0;</span>
}
}
/*
* (non-Javadoc)
*
* @see org.apache.lucene.search.DocIdSetIterator#advance(int)
*/
@Override
public int advance(int target) throws IOException {
<span class="nc" id="L164"> reset();</span>
<span class="nc bnc" id="L165" title="All 2 branches missed."> if (docId == NO_MORE_DOCS) {</span>
<span class="nc" id="L166"> return docId;</span>
<span class="nc bnc" id="L167" title="All 2 branches missed."> } else if (target < docId) {</span>
// should not happen
<span class="nc" id="L169"> docId = NO_MORE_DOCS;</span>
<span class="nc" id="L170"> return docId;</span>
} else {
// advance 1
<span class="nc" id="L173"> int spans1DocId = spans1.spans.docID();</span>
<span class="nc" id="L174"> int newTarget = target;</span>
<span class="nc bnc" id="L175" title="All 2 branches missed."> if (spans1DocId < newTarget) {</span>
<span class="nc" id="L176"> spans1DocId = spans1.spans.advance(target);</span>
<span class="nc bnc" id="L177" title="All 2 branches missed."> if (spans1DocId == NO_MORE_DOCS) {</span>
<span class="nc" id="L178"> docId = NO_MORE_DOCS;</span>
<span class="nc" id="L179"> return docId;</span>
}
<span class="nc" id="L181"> newTarget = Math.max(newTarget, spans1DocId);</span>
}
<span class="nc" id="L183"> int spans2DocId = spans2.spans.docID();</span>
// advance 2
<span class="nc bnc" id="L185" title="All 2 branches missed."> if (spans2DocId < newTarget) {</span>
<span class="nc" id="L186"> spans2DocId = spans2.spans.advance(newTarget);</span>
<span class="nc bnc" id="L187" title="All 2 branches missed."> if (spans2DocId == NO_MORE_DOCS) {</span>
<span class="nc" id="L188"> docId = NO_MORE_DOCS;</span>
<span class="nc" id="L189"> return docId;</span>
}
}
// check equal docId, otherwise next
<span class="nc bnc" id="L193" title="All 2 branches missed."> if (spans1DocId == spans2DocId) {</span>
<span class="nc" id="L194"> docId = spans1DocId;</span>
// check match
<span class="nc bnc" id="L196" title="All 2 branches missed."> if (goToNextStartPosition()) {</span>
<span class="nc" id="L197"> return docId;</span>
} else {
<span class="nc" id="L199"> return nextDoc();</span>
}
} else {
<span class="nc" id="L202"> return nextDoc();</span>
}
}
}
/*
* (non-Javadoc)
*
* @see org.apache.lucene.search.DocIdSetIterator#cost()
*/
@Override
public long cost() {
<span class="nc" id="L214"> return 0;</span>
}
/*
* (non-Javadoc)
*
* @see org.apache.lucene.search.DocIdSetIterator#docID()
*/
@Override
public int docID() {
<span class="fc" id="L224"> return docId;</span>
}
/*
* (non-Javadoc)
*
* @see org.apache.lucene.search.DocIdSetIterator#nextDoc()
*/
@Override
public int nextDoc() throws IOException {
<span class="fc" id="L234"> reset();</span>
<span class="pc bpc" id="L235" title="1 of 2 branches missed."> while (!goToNextDoc())</span>
<span class="nc" id="L236"> ;</span>
<span class="fc" id="L237"> return docId;</span>
}
/**
* Go to next doc.
*
* @return true, if successful
* @throws IOException
* Signals that an I/O exception has occurred.
*/
private boolean goToNextDoc() throws IOException {
<span class="pc bpc" id="L248" title="1 of 2 branches missed."> if (docId == NO_MORE_DOCS) {</span>
<span class="nc" id="L249"> return true;</span>
} else {
<span class="fc" id="L251"> int spans1DocId = spans1.spans.nextDoc();</span>
<span class="fc" id="L252"> int spans2DocId = spans2.spans.docID();</span>
<span class="fc" id="L253"> docId = Math.max(spans1DocId, spans2DocId);</span>
<span class="fc bfc" id="L254" title="All 4 branches covered."> while (spans1DocId != spans2DocId && docId != NO_MORE_DOCS) {</span>
<span class="pc bpc" id="L255" title="1 of 2 branches missed."> if (spans1DocId < spans2DocId) {</span>
<span class="nc" id="L256"> spans1DocId = spans1.spans.advance(spans2DocId);</span>
<span class="nc" id="L257"> docId = spans1DocId;</span>
} else {
<span class="fc" id="L259"> spans2DocId = spans2.spans.advance(spans1DocId);</span>
<span class="fc" id="L260"> docId = spans2DocId;</span>
}
}
<span class="pc bpc" id="L263" title="1 of 4 branches missed."> if (docId != NO_MORE_DOCS && !goToNextStartPosition()) {</span>
<span class="nc" id="L264"> reset();</span>
<span class="nc" id="L265"> return false;</span>
} else {
<span class="fc" id="L267"> return true;</span>
}
}
}
/**
* Go to next start position.
*
* @return true, if successful
* @throws IOException
* Signals that an I/O exception has occurred.
*/
private boolean goToNextStartPosition() throws IOException {
int nextSpans1StartPosition;
<span class="fc" id="L281"> while ((nextSpans1StartPosition = spans1.spans</span>
<span class="fc bfc" id="L282" title="All 2 branches covered."> .nextStartPosition()) != NO_MORE_POSITIONS) {</span>
<span class="fc bfc" id="L283" title="All 2 branches covered."> if (nextSpans1StartPosition == lastSpans2EndPosition) {</span>
<span class="fc" id="L284"> return true;</span>
} else {
// clean up
<span class="fc bfc" id="L287" title="All 2 branches covered."> if (maximumSpans2EndPosition < nextSpans1StartPosition) {</span>
<span class="fc" id="L288"> previousSpans2EndPositions.clear();</span>
<span class="fc" id="L289"> maximumSpans2EndPosition = -1;</span>
<span class="fc" id="L290"> } else if (previousSpans2EndPositions</span>
<span class="pc bpc" id="L291" title="1 of 2 branches missed."> .contains(nextSpans1StartPosition)) {</span>
<span class="nc" id="L292"> return true;</span>
}
// try to find match
<span class="fc bfc" id="L295" title="All 2 branches covered."> while (lastSpans2StartPosition < nextSpans1StartPosition) {</span>
<span class="pc bpc" id="L296" title="1 of 2 branches missed."> if (lastSpans2StartPosition != NO_MORE_POSITIONS) {</span>
<span class="fc" id="L297"> lastSpans2StartPosition = spans2.spans.nextStartPosition();</span>
}
<span class="fc bfc" id="L299" title="All 2 branches covered."> if (lastSpans2StartPosition == NO_MORE_POSITIONS) {</span>
<span class="pc bpc" id="L300" title="1 of 2 branches missed."> if (previousSpans2EndPositions.isEmpty()) {</span>
<span class="fc" id="L301"> noMorePositions = true;</span>
<span class="fc" id="L302"> return false;</span>
}
} else {
<span class="fc" id="L305"> lastSpans2EndPosition = spans2.spans.endPosition();</span>
<span class="fc bfc" id="L306" title="All 2 branches covered."> if (lastSpans2EndPosition >= nextSpans1StartPosition) {</span>
<span class="fc" id="L307"> previousSpans2EndPositions.add(lastSpans2EndPosition);</span>
<span class="fc" id="L308"> maximumSpans2EndPosition = Math.max(maximumSpans2EndPosition,</span>
lastSpans2EndPosition);
}
<span class="fc bfc" id="L311" title="All 2 branches covered."> if (nextSpans1StartPosition == lastSpans2EndPosition) {</span>
<span class="fc" id="L312"> return true;</span>
}
}
}
}
}
<span class="fc" id="L318"> return false;</span>
}
/**
* Reset.
*/
private void reset() {
<span class="fc" id="L325"> calledNextStartPosition = false;</span>
<span class="fc" id="L326"> noMorePositions = false;</span>
<span class="fc" id="L327"> lastSpans2StartPosition = -1;</span>
<span class="fc" id="L328"> lastSpans2EndPosition = -1;</span>
<span class="fc" id="L329"> maximumSpans2EndPosition = -1;</span>
<span class="fc" id="L330"> previousSpans2EndPositions.clear();</span>
<span class="fc" id="L331"> }</span>
}
</pre><div class="footer"><span class="right">Created with <a href="http://www.jacoco.org/jacoco">JaCoCo</a> 0.7.9.201702052155</span></div></body></html>