-
Notifications
You must be signed in to change notification settings - Fork 0
/
aggregate_tags_iterator.go
107 lines (90 loc) · 2.95 KB
/
aggregate_tags_iterator.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
// 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 client
import (
"github.com/m3db/m3/src/x/ident"
)
// FOLLOWUP(r): add pooling for aggregateTagsIterator(s).
type aggregateTagsIterator struct {
currentIdx int
err error
pools fetchTaggedPools
current struct {
tagName ident.ID
tagValues ident.Iterator
}
backing []*aggregateTagsIteratorTag
}
type aggregateTagsIteratorTag struct {
tagName ident.ID
tagValues []ident.ID
}
// make the compiler ensure the concrete type `&aggregateTagsIterator{}` implements
// the `AggregatedTagsIterator` interface.
var _ AggregatedTagsIterator = &aggregateTagsIterator{}
func newAggregateTagsIterator(pools fetchTaggedPools) *aggregateTagsIterator {
return &aggregateTagsIterator{
currentIdx: -1,
pools: pools,
}
}
func (i *aggregateTagsIterator) Next() bool {
if i.err != nil || i.currentIdx >= len(i.backing) {
return false
}
i.release()
i.currentIdx++
if i.currentIdx >= len(i.backing) {
return false
}
i.current.tagName = i.backing[i.currentIdx].tagName
i.current.tagValues = ident.NewIDSliceIterator(i.backing[i.currentIdx].tagValues)
return true
}
func (i *aggregateTagsIterator) addTag(tagName []byte) *aggregateTagsIteratorTag {
tag := &aggregateTagsIteratorTag{
tagName: ident.BytesID(tagName),
}
i.backing = append(i.backing, tag)
return tag
}
func (i *aggregateTagsIterator) release() {
i.current.tagName = nil
i.current.tagValues = nil
}
func (i *aggregateTagsIterator) Finalize() {
i.release()
for _, b := range i.backing {
b.tagName.Finalize()
for _, v := range b.tagValues {
v.Finalize()
}
}
i.backing = nil
}
func (i *aggregateTagsIterator) Remaining() int {
return len(i.backing) - (i.currentIdx + 1)
}
func (i *aggregateTagsIterator) Current() (tagName ident.ID, tagValues ident.Iterator) {
return i.current.tagName, i.current.tagValues
}
func (i *aggregateTagsIterator) Err() error {
return i.err
}