-
Notifications
You must be signed in to change notification settings - Fork 450
/
or.go
151 lines (129 loc) · 4.09 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
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
// 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 (
"math"
"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,
lMeta, rMeta block.Metadata,
lIter, rIter block.StepIter,
controller *transform.Controller,
matching VectorMatching,
) (block.Block, error) {
if !matching.Set {
return nil, errNoMatching
}
lSeriesMetas := lIter.SeriesMeta()
lMeta, lSeriesMetas = removeNameTags(lMeta, lSeriesMetas)
lMeta, lSeriesMetas = removeNameTags(lMeta, lSeriesMetas)
rSeriesMetas := rIter.SeriesMeta()
rMeta, rSeriesMetas = removeNameTags(rMeta, rSeriesMetas)
meta, lSeriesMetas, rSeriesMetas, err := combineMetaAndSeriesMeta(
lMeta,
rMeta,
lSeriesMetas,
rSeriesMetas,
)
if err != nil {
return nil, err
}
indices, combinedSeriesMeta := mergeIndices(
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
}
values := make([]float64, len(combinedSeriesMeta))
for index := 0; lIter.Next(); index++ {
if !rIter.Next() {
return nil, errRExhausted
}
lStep := lIter.Current()
lValues := lStep.Values()
copy(values, lValues)
rStep := rIter.Current()
rValues := rStep.Values()
for iterIndex, valueIndex := range indices {
if valueIndex >= len(lValues) {
values[valueIndex] = rValues[iterIndex]
} else if math.IsNaN(values[valueIndex]) {
values[valueIndex] = rValues[iterIndex]
}
}
if err := builder.AppendValues(index, values); err != nil {
return nil, err
}
}
if err = lIter.Err(); err != nil {
return nil, err
}
if rIter.Next() {
return nil, errLExhausted
}
if err = rIter.Err(); err != nil {
return nil, err
}
return builder.Build(), nil
}
// mergeIndices returns a slice that maps rhs series to lhs series.
//
// NB(arnikola): if the series in the rhs does not exist in the lhs, it is
// added after all lhs series have been added.
// This function also combines the series metadatas for the entire block.
func mergeIndices(
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]int, len(lhs))
for i, meta := range lhs {
l := idFunction(meta.Tags)
leftSigs[l] = i
}
rIndices := make([]int, len(rhs))
rIndex := len(lhs)
for i, meta := range rhs {
// If there's no matching entry in the left-hand side Vector,
// add the sample.
r := idFunction(meta.Tags)
if matchingIndex, ok := leftSigs[r]; !ok {
rIndices[i] = rIndex
rIndex++
lhs = append(lhs, meta)
} else {
rIndices[i] = matchingIndex
}
}
return rIndices, lhs
}