-
Notifications
You must be signed in to change notification settings - Fork 458
/
Copy pathiterator.go
131 lines (109 loc) · 3.09 KB
/
iterator.go
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
// Copyright (c) 2018 Uber Technologies, Inc.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
package executor
import (
"github.com/m3db/m3/src/m3ninx/doc"
"github.com/m3db/m3/src/m3ninx/index"
"github.com/m3db/m3/src/m3ninx/search"
)
type iterator struct {
searcher search.Searcher
readers index.Readers
idx int
currDoc doc.Document
currIter doc.Iterator
err error
closed bool
}
func newIterator(s search.Searcher, rs index.Readers) (doc.Iterator, error) {
it := &iterator{
searcher: s,
readers: rs,
idx: -1,
}
currIter, _, err := it.nextIter()
if err != nil {
return nil, err
}
it.currIter = currIter
return it, nil
}
func (it *iterator) Next() bool {
if it.closed || it.err != nil || it.idx == len(it.readers) {
return false
}
for !it.currIter.Next() {
// Check if the current iterator encountered an error.
if err := it.currIter.Err(); err != nil {
it.err = err
return false
}
// Close current iterator now that we are finished with it.
err := it.currIter.Close()
it.currIter = nil
if err != nil {
it.err = err
return false
}
iter, hasNext, err := it.nextIter()
if err != nil {
it.err = err
return false
}
if !hasNext {
return false
}
it.currIter = iter
}
it.currDoc = it.currIter.Current()
return true
}
func (it *iterator) Current() doc.Document {
return it.currDoc
}
func (it *iterator) Err() error {
return it.err
}
func (it *iterator) Close() error {
var err error
if it.currIter != nil {
err = it.currIter.Close()
}
return err
}
// nextIter gets the next document iterator by getting the next postings list from
// the it's searcher and then getting the documents for that postings list from the
// corresponding reader associated with that postings list.
func (it *iterator) nextIter() (doc.Iterator, bool, error) {
it.idx++
if it.idx >= len(it.readers) {
return nil, false, nil
}
reader := it.readers[it.idx]
pl, err := it.searcher.Search(reader)
if err != nil {
return nil, false, err
}
iter, err := reader.Docs(pl)
if err != nil {
return nil, false, err
}
return iter, true, nil
}