-
Notifications
You must be signed in to change notification settings - Fork 153
/
group_key.go
225 lines (206 loc) · 5.25 KB
/
group_key.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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
package execute
import (
"fmt"
"sort"
"strings"
"github.com/influxdata/flux"
"github.com/influxdata/flux/values"
)
type groupKey struct {
cols []flux.ColMeta
values []values.Value
sorted []int // maintains a list of the sorted indexes
}
func NewGroupKey(cols []flux.ColMeta, values []values.Value) flux.GroupKey {
return newGroupKey(cols, values)
}
func newGroupKey(cols []flux.ColMeta, values []values.Value) *groupKey {
sorted := make([]int, len(cols))
for i := range cols {
sorted[i] = i
}
sort.Slice(sorted, func(i, j int) bool {
return cols[sorted[i]].Label < cols[sorted[j]].Label
})
return &groupKey{
cols: cols,
values: values,
sorted: sorted,
}
}
func (k *groupKey) Cols() []flux.ColMeta {
return k.cols
}
func (k *groupKey) Values() []values.Value {
return k.values
}
func (k *groupKey) HasCol(label string) bool {
return ColIdx(label, k.cols) >= 0
}
func (k *groupKey) LabelValue(label string) values.Value {
if !k.HasCol(label) {
return nil
}
return k.Value(ColIdx(label, k.cols))
}
func (k *groupKey) IsNull(j int) bool {
return k.values[j].IsNull()
}
func (k *groupKey) Value(j int) values.Value {
return k.values[j]
}
func (k *groupKey) ValueBool(j int) bool {
return k.values[j].Bool()
}
func (k *groupKey) ValueUInt(j int) uint64 {
return k.values[j].UInt()
}
func (k *groupKey) ValueInt(j int) int64 {
return k.values[j].Int()
}
func (k *groupKey) ValueFloat(j int) float64 {
return k.values[j].Float()
}
func (k *groupKey) ValueString(j int) string {
return k.values[j].Str()
}
func (k *groupKey) ValueDuration(j int) Duration {
return k.values[j].Duration()
}
func (k *groupKey) ValueTime(j int) Time {
return k.values[j].Time()
}
func (k *groupKey) Equal(o flux.GroupKey) bool {
return groupKeyEqual(k, o)
}
func (k *groupKey) Less(o flux.GroupKey) bool {
return groupKeyLess(k, o)
}
func (k *groupKey) String() string {
var b strings.Builder
b.WriteRune('{')
for j, c := range k.cols {
if j != 0 {
b.WriteRune(',')
}
fmt.Fprintf(&b, "%s=%v", c.Label, k.values[j])
}
b.WriteRune('}')
return b.String()
}
func groupKeyEqual(a *groupKey, other flux.GroupKey) bool {
b, ok := other.(*groupKey)
if !ok {
b = newGroupKey(other.Cols(), other.Values())
}
if len(a.cols) != len(b.cols) {
return false
}
for i, idx := range a.sorted {
jdx := b.sorted[i]
if a.cols[idx] != b.cols[jdx] {
return false
}
if anull, bnull := a.values[idx].IsNull(), b.values[jdx].IsNull(); anull && bnull {
// Both key columns are null, consider them equal
// So that rows are assigned to the same table.
continue
} else if anull || bnull {
return false
}
switch a.cols[idx].Type {
case flux.TBool:
if a.ValueBool(idx) != b.ValueBool(jdx) {
return false
}
case flux.TInt:
if a.ValueInt(idx) != b.ValueInt(jdx) {
return false
}
case flux.TUInt:
if a.ValueUInt(idx) != b.ValueUInt(jdx) {
return false
}
case flux.TFloat:
if a.ValueFloat(idx) != b.ValueFloat(jdx) {
return false
}
case flux.TString:
if a.ValueString(idx) != b.ValueString(jdx) {
return false
}
case flux.TTime:
if a.ValueTime(idx) != b.ValueTime(jdx) {
return false
}
}
}
return true
}
// groupKeyLess determines if the former key is lexicographically less than the
// latter.
func groupKeyLess(a *groupKey, other flux.GroupKey) bool {
b, ok := other.(*groupKey)
if !ok {
b = newGroupKey(other.Cols(), other.Values())
}
min := len(a.sorted)
if len(b.sorted) < min {
min = len(b.sorted)
}
for i := 0; i < min; i++ {
idx, jdx := a.sorted[i], b.sorted[i]
if a.cols[idx].Label != b.cols[jdx].Label {
// The labels at the current index are different
// so whichever one is greater is the one missing
// a value and the one missing a value is the less.
// That causes this next conditional to look wrong.
return a.cols[idx].Label > b.cols[jdx].Label
}
// The labels are identical. If the types are different,
// then resolve the ordering based on the type.
// TODO(jsternberg): Make this official in some way and part of the spec.
if a.cols[idx].Type != b.cols[jdx].Type {
return a.cols[idx].Type < b.cols[jdx].Type
}
// If a value is null, it is less than.
if anull, bnull := a.values[idx].IsNull(), b.values[jdx].IsNull(); anull && bnull {
continue
} else if anull {
return true
} else if bnull {
return false
}
// Neither value is null and they are the same type so compare.
switch a.cols[idx].Type {
case flux.TBool:
if av, bv := a.ValueBool(idx), b.ValueBool(jdx); av != bv {
return bv
}
case flux.TInt:
if av, bv := a.ValueInt(idx), b.ValueInt(jdx); av != bv {
return av < bv
}
case flux.TUInt:
if av, bv := a.ValueUInt(idx), b.ValueUInt(jdx); av != bv {
return av < bv
}
case flux.TFloat:
if av, bv := a.ValueFloat(idx), b.ValueFloat(jdx); av != bv {
return av < bv
}
case flux.TString:
if av, bv := a.ValueString(idx), b.ValueString(jdx); av != bv {
return av < bv
}
case flux.TTime:
if av, bv := a.ValueTime(idx), b.ValueTime(jdx); av != bv {
return av < bv
}
}
}
// In this case, min columns have been compared and found to be equal.
// Whichever key has the greater number of columns is lexicographically
// greater than the other.
return len(a.sorted) < len(b.sorted)
}