-
Notifications
You must be signed in to change notification settings - Fork 462
/
timeseries_series_set.go
227 lines (200 loc) · 6.75 KB
/
timeseries_series_set.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
226
227
// SPDX-License-Identifier: AGPL-3.0-only
// Provenance-includes-location: https://github.com/cortexproject/cortex/blob/master/pkg/querier/timeseries_series_set.go
// Provenance-includes-license: Apache-2.0
// Provenance-includes-copyright: The Cortex Authors.
package querier
import (
"sort"
"github.com/pkg/errors"
"github.com/prometheus/prometheus/model/histogram"
"github.com/prometheus/prometheus/model/labels"
"github.com/prometheus/prometheus/storage"
"github.com/prometheus/prometheus/tsdb/chunkenc"
"github.com/prometheus/prometheus/util/annotations"
"github.com/grafana/mimir/pkg/mimirpb"
)
// timeSeriesSeriesSet is a wrapper around a mimirpb.TimeSeries slice to implement to SeriesSet interface
type timeSeriesSeriesSet struct {
ts []mimirpb.TimeSeries
i int
}
func newTimeSeriesSeriesSet(series []mimirpb.TimeSeries) *timeSeriesSeriesSet {
sort.Sort(byTimeSeriesLabels(series))
return &timeSeriesSeriesSet{
ts: series,
i: -1,
}
}
// Next implements storage.SeriesSet interface.
func (t *timeSeriesSeriesSet) Next() bool { t.i++; return t.i < len(t.ts) }
// At implements storage.SeriesSet interface.
func (t *timeSeriesSeriesSet) At() storage.Series {
if t.i < 0 {
return nil
}
return ×eries{series: t.ts[t.i]}
}
// Err implements storage.SeriesSet interface.
func (t *timeSeriesSeriesSet) Err() error { return nil }
// Warnings implements storage.SeriesSet interface.
func (t *timeSeriesSeriesSet) Warnings() annotations.Annotations { return nil }
// timeseries is a type wrapper that implements the storage.Series interface
type timeseries struct {
series mimirpb.TimeSeries
}
// timeSeriesSeriesIterator is a wrapper around a mimirpb.TimeSeries to implement the chunkenc.Iterator.
type timeSeriesSeriesIterator struct {
ts *timeseries
iF int
iH int
atH bool
}
type byTimeSeriesLabels []mimirpb.TimeSeries
func (b byTimeSeriesLabels) Len() int { return len(b) }
func (b byTimeSeriesLabels) Swap(i, j int) { b[i], b[j] = b[j], b[i] }
func (b byTimeSeriesLabels) Less(i, j int) bool {
return mimirpb.CompareLabelAdapters(b[i].Labels, b[j].Labels) < 0
}
// Labels implements the storage.Series interface.
// Conversion is safe because ingester sets these by calling client.FromLabelsToLabelAdapters which guarantees labels are sorted.
func (t *timeseries) Labels() labels.Labels {
return mimirpb.FromLabelAdaptersToLabels(t.series.Labels)
}
// Iterator implements the storage.Series interface
func (t *timeseries) Iterator(_ chunkenc.Iterator) chunkenc.Iterator {
return &timeSeriesSeriesIterator{
ts: t,
iF: -1,
iH: -1,
}
}
// atTypeHisto is an internal method to differentiate between histogram and float histogram value types
// Checking that t.iH is a valid index in the t.ts.series.Histograms array and that
// t.atH is true must be done outside of this
func (t *timeSeriesSeriesIterator) atTypeHisto() chunkenc.ValueType {
if t.ts.series.Histograms[t.iH].IsFloatHistogram() {
return chunkenc.ValFloatHistogram
}
return chunkenc.ValHistogram
}
// atType returns current timestamp and value type
func (t *timeSeriesSeriesIterator) atType() (int64, chunkenc.ValueType) {
if t.atH {
if t.iH < 0 || t.iH >= len(t.ts.series.Histograms) {
return 0, chunkenc.ValNone
}
return t.ts.series.Histograms[t.iH].Timestamp, t.atTypeHisto()
}
if t.iF < 0 || t.iF >= len(t.ts.series.Samples) {
return 0, chunkenc.ValNone
}
return t.ts.series.Samples[t.iF].TimestampMs, chunkenc.ValFloat
}
// Seek implements implements chunkenc.Iterator.
func (t *timeSeriesSeriesIterator) Seek(s int64) chunkenc.ValueType {
oldTime, oldType := t.atType()
if oldTime >= s { // only advance via Seek
return oldType
}
t.iF = sort.Search(len(t.ts.series.Samples), func(i int) bool {
return t.ts.series.Samples[i].TimestampMs >= s
})
t.iH = sort.Search(len(t.ts.series.Histograms), func(i int) bool {
return t.ts.series.Histograms[i].Timestamp >= s
})
if t.iF >= len(t.ts.series.Samples) && t.iH >= len(t.ts.series.Histograms) {
return chunkenc.ValNone
}
if t.iF >= len(t.ts.series.Samples) {
t.atH = true
return t.atTypeHisto()
}
if t.iH >= len(t.ts.series.Histograms) {
t.atH = false
return chunkenc.ValFloat
}
if t.ts.series.Samples[t.iF].TimestampMs < t.ts.series.Histograms[t.iH].Timestamp {
t.iH--
t.atH = false
return chunkenc.ValFloat
}
t.iF--
t.atH = true
return t.atTypeHisto()
}
// At implements the implements chunkenc.Iterator.
func (t *timeSeriesSeriesIterator) At() (int64, float64) {
if t.atH {
panic(errors.New("timeSeriesSeriesIterator: Calling At() when cursor is at histogram"))
}
if t.iF < 0 || t.iF >= len(t.ts.series.Samples) {
return 0, 0
}
return t.ts.series.Samples[t.iF].TimestampMs, t.ts.series.Samples[t.iF].Value
}
// AtHistogram implements chunkenc.Iterator.
func (t *timeSeriesSeriesIterator) AtHistogram(*histogram.Histogram) (int64, *histogram.Histogram) {
if !t.atH {
panic(errors.New("timeSeriesSeriesIterator: Calling AtHistogram() when cursor is not at histogram"))
}
if t.iH < 0 || t.iH >= len(t.ts.series.Histograms) {
return 0, nil
}
h := t.ts.series.Histograms[t.iH]
return h.Timestamp, mimirpb.FromHistogramProtoToHistogram(&h)
}
// AtFloatHistogram implements chunkenc.Iterator.
func (t *timeSeriesSeriesIterator) AtFloatHistogram(*histogram.FloatHistogram) (int64, *histogram.FloatHistogram) {
if !t.atH {
panic(errors.New("timeSeriesSeriesIterator: Calling AtFloatHistogram() when cursor is not at histogram"))
}
if t.iH < 0 || t.iH >= len(t.ts.series.Histograms) {
return 0, nil
}
h := t.ts.series.Histograms[t.iH]
if h.IsFloatHistogram() {
return h.Timestamp, mimirpb.FromFloatHistogramProtoToFloatHistogram(&h)
}
return h.Timestamp, mimirpb.FromHistogramProtoToFloatHistogram(&h)
}
// AtT implements chunkenc.Iterator.
func (t *timeSeriesSeriesIterator) AtT() int64 {
if t.atH {
if t.iH < 0 || t.iH >= len(t.ts.series.Histograms) {
return 0
}
return t.ts.series.Histograms[t.iH].Timestamp
}
if t.iF < 0 || t.iF >= len(t.ts.series.Samples) {
return 0
}
return t.ts.series.Samples[t.iF].TimestampMs
}
// Next implements implements chunkenc.Iterator.
func (t *timeSeriesSeriesIterator) Next() chunkenc.ValueType {
if t.iF+1 >= len(t.ts.series.Samples) && t.iH+1 >= len(t.ts.series.Histograms) {
t.iF = len(t.ts.series.Samples)
t.iH = len(t.ts.series.Histograms)
return chunkenc.ValNone
}
if t.iF+1 >= len(t.ts.series.Samples) {
t.iH++
t.atH = true
return t.atTypeHisto()
}
if t.iH+1 >= len(t.ts.series.Histograms) {
t.iF++
t.atH = false
return chunkenc.ValFloat
}
if t.ts.series.Samples[t.iF+1].TimestampMs < t.ts.series.Histograms[t.iH+1].Timestamp {
t.iF++
t.atH = false
return chunkenc.ValFloat
}
t.iH++
t.atH = true
return t.atTypeHisto()
}
// Err implements the implements chunkenc.Iterator.
func (t *timeSeriesSeriesIterator) Err() error { return nil }