-
Notifications
You must be signed in to change notification settings - Fork 453
/
disjunction.go
61 lines (54 loc) · 2.01 KB
/
disjunction.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
// 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 searcher
import (
"github.com/m3db/m3/src/m3ninx/index"
"github.com/m3db/m3/src/m3ninx/postings"
"github.com/m3db/m3/src/m3ninx/search"
)
type disjunctionSearcher struct {
searchers search.Searchers
}
// NewDisjunctionSearcher returns a new Searcher which matches documents which are matched
// by any of the given Searchers.
func NewDisjunctionSearcher(searchers search.Searchers) (search.Searcher, error) {
if len(searchers) == 0 {
return nil, errEmptySearchers
}
return &disjunctionSearcher{
searchers: searchers,
}, nil
}
func (s *disjunctionSearcher) Search(r index.Reader) (postings.List, error) {
var pl postings.MutableList
for _, sr := range s.searchers {
curr, err := sr.Search(r)
if err != nil {
return nil, err
}
// TODO: Sort the iterators so that we take the union in order of decreasing size.
if pl == nil {
pl = curr.Clone()
} else {
pl.Union(curr)
}
}
return pl, nil
}