/
container.go
387 lines (316 loc) · 8.26 KB
/
container.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
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
// Copyright (c) 2019 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 block
import (
"errors"
"fmt"
xerrors "github.com/m3db/m3/src/x/errors"
)
var (
errMismatchedStepIter = errors.New(
"container step iter has mismatched step size")
errMismatchedUcStepIter = errors.New(
"unconsolidated container step iter has mismatched step size")
errNoContainerBlocks = errors.New(
"no blocks provided to initialize container block")
)
type containerBlock struct {
err error
meta Metadata
blocks []Block
}
func newContainerBlock(blocks []Block) (AccumulatorBlock, error) {
if len(blocks) == 0 {
return nil, errNoContainerBlocks
}
meta := blocks[0].Meta()
for _, b := range blocks[1:] {
m := b.Meta()
if !m.Equals(meta) {
return nil, fmt.Errorf("mismatched metadata in container block: "+
"expected %s, got %s", meta.String(), m.String())
}
meta.ResultMetadata = meta.ResultMetadata.CombineMetadata(m.ResultMetadata)
}
return &containerBlock{
blocks: blocks,
meta: meta,
}, nil
}
// NewContainerBlock creates a container block, which allows iterating across
// blocks incoming from multiple data sources, provided they have the same
// bounds.
func NewContainerBlock(blocks ...Block) (AccumulatorBlock, error) {
return newContainerBlock(blocks)
}
func (b *containerBlock) Meta() Metadata {
return b.meta
}
func (b *containerBlock) AddBlock(bl Block) error {
if b.err != nil {
return b.err
}
m, blockMeta := b.Meta(), bl.Meta()
if !m.Equals(blockMeta) {
return fmt.Errorf("mismatched metadata adding block to container block: "+
"expected %s, got %s", m.String(), blockMeta.String())
}
b.meta.ResultMetadata = b.meta.ResultMetadata.
CombineMetadata(blockMeta.ResultMetadata)
b.blocks = append(b.blocks, bl)
return nil
}
func (b *containerBlock) Info() BlockInfo {
return NewBlockInfo(BlockContainer)
}
func (b *containerBlock) Close() error {
multiErr := xerrors.NewMultiError()
multiErr = multiErr.Add(b.err)
for _, bl := range b.blocks {
multiErr = multiErr.Add(bl.Close())
}
if err := multiErr.FinalError(); err != nil {
b.err = err
return err
}
return nil
}
func (b *containerBlock) StepIter() (StepIter, error) {
if b.err != nil {
return nil, b.err
}
it := &containerStepIter{its: make([]StepIter, 0, len(b.blocks))}
for _, bl := range b.blocks {
iter, err := bl.StepIter()
if err != nil {
b.err = err
return nil, err
}
it.its = append(it.its, iter)
}
return it, nil
}
// NB: step iterators are constructed "sideways"
type containerStepIter struct {
err error
its []StepIter
}
func (it *containerStepIter) Close() {
for _, iter := range it.its {
iter.Close()
}
}
func (it *containerStepIter) Err() error {
if it.err != nil {
return it.err
}
for _, iter := range it.its {
if it.err = iter.Err(); it.err != nil {
return it.err
}
}
return nil
}
func (it *containerStepIter) StepCount() int {
// NB: when using a step iterator, step count doesn't change, but the length
// of each step does.
if len(it.its) == 0 {
return 0
}
return it.its[0].StepCount()
}
func (it *containerStepIter) SeriesMeta() []SeriesMeta {
length := 0
for _, iter := range it.its {
length += len(iter.SeriesMeta())
}
metas := make([]SeriesMeta, 0, length)
for _, iter := range it.its {
metas = append(metas, iter.SeriesMeta()...)
}
return metas
}
func (it *containerStepIter) Next() bool {
if it.err != nil {
return false
}
// advance all the contained iterators; if any have size mismatches, set an
// error and stop traversal.
var next bool
for i, iter := range it.its {
n := iter.Next()
if it.err = iter.Err(); it.err != nil {
return false
}
if i == 0 {
next = n
} else if next != n {
it.err = errMismatchedStepIter
return false
}
}
return next
}
func (it *containerStepIter) Current() Step {
if len(it.its) == 0 {
return ColStep{
time: 0,
values: []float64{},
}
}
curr := it.its[0].Current()
// NB: to get Current for contained step iterators, append results from all
// contained step iterators in order.
accumulatorStep := ColStep{
time: curr.Time(),
values: curr.Values(),
}
for _, iter := range it.its[1:] {
curr := iter.Current()
accumulatorStep.values = append(accumulatorStep.values, curr.Values()...)
}
return accumulatorStep
}
func (b *containerBlock) SeriesIter() (SeriesIter, error) {
if b.err != nil {
return nil, b.err
}
it := &containerSeriesIter{
its: make([]SeriesIter, 0, len(b.blocks)),
}
for _, bl := range b.blocks {
iter, err := bl.SeriesIter()
if err != nil {
b.err = err
return nil, err
}
it.its = append(it.its, iter)
}
return it, nil
}
type containerSeriesIter struct {
err error
idx int
its []SeriesIter
}
func (it *containerSeriesIter) Close() {
for _, iter := range it.its {
iter.Close()
}
}
func (it *containerSeriesIter) Err() error {
if it.err != nil {
return it.err
}
for _, iter := range it.its {
if it.err = iter.Err(); it.err != nil {
return it.err
}
}
return nil
}
func (it *containerSeriesIter) SeriesCount() int {
count := 0
for _, iter := range it.its {
count += iter.SeriesCount()
}
return count
}
func (it *containerSeriesIter) SeriesMeta() []SeriesMeta {
length := 0
for _, iter := range it.its {
length += len(iter.SeriesMeta())
}
metas := make([]SeriesMeta, 0, length)
for _, iter := range it.its {
metas = append(metas, iter.SeriesMeta()...)
}
return metas
}
func (it *containerSeriesIter) Next() bool {
if it.err != nil {
return false
}
for ; it.idx < len(it.its); it.idx++ {
iter := it.its[it.idx]
if iter.Next() {
// the active iterator has been successfully incremented.
return true
}
// active iterator errored.
if it.err = iter.Err(); it.err != nil {
return false
}
}
// all iterators expanded.
return false
}
func (it *containerSeriesIter) Current() UnconsolidatedSeries {
return it.its[it.idx].Current()
}
func (b *containerBlock) MultiSeriesIter(
concurrency int,
) ([]SeriesIterBatch, error) {
if b.err != nil {
return nil, b.err
}
if len(b.blocks) == 0 {
return nil, nil
}
multiBatches := make([][]SeriesIterBatch, 0, len(b.blocks))
for _, bl := range b.blocks {
batch, err := bl.MultiSeriesIter(concurrency)
if err != nil {
// NB: do not have to set the iterator error here, since not all
// contained blocks necessarily allow multi series iteration.
return nil, err
}
multiBatches = append(multiBatches, batch)
}
// NB: create a batch and merge into it rather than merging
// into an existing batch, in case sizes don't line up across blocks
// (e.g. if some contained blocks have fewer than `concurrency` series.)
batches := make([]SeriesIterBatch, 0, concurrency)
// init batch sizes.
for i := 0; i < concurrency; i++ {
// Determine container iter size.
size := 0
for _, b := range multiBatches {
if i >= len(b) {
// NB: the current batch has been exhausted, but batches from other
// contained blocks may still have values.
continue
}
size += b[i].Size
}
iters := make([]SeriesIter, 0, size)
for _, b := range multiBatches {
if i >= len(b) {
continue
}
iters = append(iters, b[i].Iter)
}
batches = append(batches, SeriesIterBatch{
Size: size,
Iter: &containerSeriesIter{its: iters},
})
}
return batches, nil
}