-
Notifications
You must be signed in to change notification settings - Fork 452
/
unless.go
136 lines (114 loc) · 4.01 KB
/
unless.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
// 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/functions/utils"
"github.com/m3db/m3/src/query/models"
)
// UnlessType uses all values from lhs which do not exist in rhs
const UnlessType = "unless"
func makeUnlessBlock(
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)
rSeriesMetas := rIter.SeriesMeta()
rMeta, rSeriesMetas = removeNameTags(rMeta, rSeriesMetas)
// NB: need to flatten metadata for cases where
// e.g. lhs: common tags {a:b}, series tags: {c:d}, {e:f}
// e.g. rhs: common tags {c:d}, series tags: {a:b}, {e:f}
// If not flattened before calculating distinct values,
// both series on lhs would be added
lSeriesMetas = utils.FlattenMetadata(lMeta, lSeriesMetas)
rSeriesMetas = utils.FlattenMetadata(rMeta, rSeriesMetas)
indices := matchingIndices(matching, lSeriesMetas, rSeriesMetas)
lMeta.ResultMetadata = lMeta.ResultMetadata.
CombineMetadata(rMeta.ResultMetadata)
builder, err := controller.BlockBuilder(queryCtx, lMeta, lSeriesMetas)
if err != nil {
return nil, err
}
if err = builder.AddCols(lIter.StepCount()); err != nil {
return nil, err
}
for index := 0; lIter.Next(); index++ {
if !rIter.Next() {
return nil, errRExhausted
}
lStep := lIter.Current()
lValues := lStep.Values()
rStep := rIter.Current()
rValues := rStep.Values()
for _, indexMatcher := range indices {
if !math.IsNaN(rValues[indexMatcher.rhsIndex]) {
lValues[indexMatcher.lhsIndex] = math.NaN()
}
}
if err := builder.AppendValues(index, lValues); 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
}
// matchingIndices returns a slice representing which index in the lhs the rhs
// series maps to. If it does not map to an existing index, this is set to -1.
func matchingIndices(
matching VectorMatching,
lhs, rhs []block.SeriesMeta,
) []indexMatcher {
idFunction := hashFunc(matching.On, matching.MatchingLabels...)
// The set of signatures for the left-hand side.
leftSigs := make(map[uint64]int, len(lhs))
for idx, meta := range lhs {
leftSigs[idFunction(meta.Tags)] = idx
}
rhsIndices := make([]indexMatcher, 0, len(rhs))
for i, rs := range rhs {
// If this series matches a series on the lhs, add its index.
id := idFunction(rs.Tags)
if lhsIndex, ok := leftSigs[id]; ok {
matcher := indexMatcher{
lhsIndex: lhsIndex,
rhsIndex: i,
}
rhsIndices = append(rhsIndices, matcher)
}
}
return rhsIndices[:len(rhsIndices)]
}