-
Notifications
You must be signed in to change notification settings - Fork 453
/
or.go
107 lines (94 loc) · 3.24 KB
/
or.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
// 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 binary
import (
"github.com/m3db/m3/src/query/block"
"github.com/m3db/m3/src/query/executor/transform"
"github.com/m3db/m3/src/query/models"
)
// OrType uses all values from left hand side, and appends values from the right hand side which do
// not have corresponding tags on the right
const OrType = "or"
func makeOrBlock(
queryCtx *models.QueryContext,
lIter, rIter block.StepIter,
controller *transform.Controller,
matching *VectorMatching,
) (block.Block, error) {
meta, lSeriesMetas, rSeriesMetas, err := combineMetaAndSeriesMeta(
lIter.Meta(),
rIter.Meta(),
lIter.SeriesMeta(),
rIter.SeriesMeta(),
)
if err != nil {
return nil, err
}
missingIndices, combinedSeriesMeta := missing(
matching,
lSeriesMetas,
rSeriesMetas,
)
builder, err := controller.BlockBuilder(queryCtx, meta, combinedSeriesMeta)
if err != nil {
return nil, err
}
if err = builder.AddCols(lIter.StepCount()); err != nil {
return nil, err
}
index := 0
for ; lIter.Next(); index++ {
lStep := lIter.Current()
lValues := lStep.Values()
if err := builder.AppendValues(index, lValues); err != nil {
return nil, err
}
}
if err = lIter.Err(); err != nil {
return nil, err
}
if err = appendValuesAtIndices(missingIndices, rIter, builder); err != nil {
return nil, err
}
return builder.Build(), nil
}
// missing returns the slice of rhs indices for which there are no corresponding
// indices on the lhs. It also returns the metadatas for the series at these
// indices to avoid having to calculate this separately
func missing(
matching *VectorMatching,
lhs, rhs []block.SeriesMeta,
) ([]int, []block.SeriesMeta) {
idFunction := HashFunc(matching.On, matching.MatchingLabels...)
// The set of signatures for the left-hand side.
leftSigs := make(map[uint64]struct{}, len(lhs))
for _, meta := range lhs {
leftSigs[idFunction(meta.Tags)] = struct{}{}
}
missing := make([]int, 0, initIndexSliceLength)
for i, rs := range rhs {
// If there's no matching entry in the left-hand side Vector, add the sample.
if _, ok := leftSigs[idFunction(rs.Tags)]; !ok {
missing = append(missing, i)
lhs = append(lhs, rs)
}
}
return missing, lhs
}