blob: 52e95e1ac3f52c73c8a3ddac44d9c9977b8f434f (
plain) (
blame)
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
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "bucket.h"
#include <assert.h>
#include <map>
namespace vespalib {
namespace metrics {
namespace {
template<typename T>
std::vector<typename T::aggregator_type>
mergeFromSamples(const StableStore<typename T::sample_type> &source)
{
using Aggregator = typename T::aggregator_type;
using Sample = typename T::sample_type;
using Map = std::map<MetricIdentifier, Aggregator>;
using MapValue = typename Map::value_type;
Map map;
source.for_each([&map] (const Sample &sample) {
MetricIdentifier id = sample.idx;
auto iter_check = map.emplace(id, sample);
if (!iter_check.second) {
iter_check.first->second.merge(sample);
}
});
std::vector<typename T::aggregator_type> result;
for (const MapValue &entry : map) {
result.push_back(entry.second);
}
return result;
}
template<typename T>
std::vector<T>
mergeVectors(const std::vector<T> &a,
const std::vector<T> &b)
{
std::vector<T> result;
auto a_iter = a.begin();
auto b_iter = b.begin();
while (a_iter != a.end() &&
b_iter != b.end())
{
if (a_iter->idx < b_iter->idx) {
result.push_back(*a_iter);
++a_iter;
} else if (b_iter->idx < a_iter->idx) {
result.push_back(*b_iter);
++b_iter;
} else {
result.push_back(*a_iter);
result.back().merge(*b_iter);
++a_iter;
++b_iter;
}
}
while (a_iter != a.end()) {
result.push_back(*a_iter);
++a_iter;
}
while (b_iter != b.end()) {
result.push_back(*b_iter);
++b_iter;
}
return result;
}
template<typename T>
std::vector<T>
findMissing(const std::vector<T> &already,
const std::vector<T> &complete)
{
std::vector<T> result;
auto a_iter = already.begin();
auto c_iter = complete.begin();
while (a_iter != already.end() &&
c_iter != complete.end())
{
if (a_iter->idx < c_iter->idx) {
// missing from "complete", should not happen
++a_iter;
} else if (c_iter->idx < a_iter->idx) {
// missing this
result.push_back(*c_iter);
++c_iter;
} else {
// already have this
++a_iter;
++c_iter;
}
}
while (c_iter != complete.end()) {
// missing this
result.push_back(*c_iter);
++c_iter;
}
return result;
}
} // namespace <unnamed>
void Bucket::merge(const CurrentSamples &samples)
{
counters = mergeFromSamples<Counter>(samples.counterIncrements);
gauges = mergeFromSamples<Gauge>(samples.gaugeMeasurements);
}
void Bucket::merge(const Bucket &other)
{
assert(genCnt < other.genCnt);
genCnt = other.genCnt;
startTime = std::min(startTime, other.startTime);
endTime = std::max(endTime, other.endTime);
std::vector<CounterAggregator> nextCounters = mergeVectors(counters, other.counters);
counters = std::move(nextCounters);
std::vector<GaugeAggregator> nextGauges = mergeVectors(gauges, other.gauges);
gauges = std::move(nextGauges);
}
void Bucket::padMetrics(const Bucket &source)
{
std::vector<CounterAggregator> missingC = findMissing(counters, source.counters);
for (CounterAggregator aggr : missingC) {
aggr.count = 0;
counters.push_back(aggr);
}
std::vector<GaugeAggregator> missingG = findMissing(gauges, source.gauges);
for (GaugeAggregator aggr : missingG) {
aggr.observedCount = 0;
aggr.sumValue = 0;
aggr.minValue = 0;
aggr.maxValue = 0;
gauges.push_back(aggr);
}
}
} // namespace vespalib::metrics
} // namespace vespalib
|
