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
use hdrhistogram::Histogram;
use metrics_core::{Key, Recorder};
use metrics_util::{parse_quantiles, Quantile};
use std::collections::{HashMap, VecDeque};
use std::fmt::Display;
pub struct TextRecorder {
structure: MetricsTree,
quantiles: Vec<Quantile>,
}
impl TextRecorder {
pub fn new() -> Self {
Self::with_quantiles(&[0.0, 0.5, 0.9, 0.95, 0.99, 0.999, 1.0])
}
pub fn with_quantiles(quantiles: &[f64]) -> Self {
let actual_quantiles = parse_quantiles(quantiles);
Self {
structure: MetricsTree::with_level(0),
quantiles: actual_quantiles,
}
}
}
impl Recorder for TextRecorder {
fn record_counter<K: Into<Key>>(&mut self, key: K, value: u64) {
let (name_parts, name) = name_to_parts(key.into().as_ref());
let mut values = single_value_to_values(name, value);
self.structure.insert(name_parts, &mut values);
}
fn record_gauge<K: Into<Key>>(&mut self, key: K, value: i64) {
let (name_parts, name) = name_to_parts(key.into().as_ref());
let mut values = single_value_to_values(name, value);
self.structure.insert(name_parts, &mut values);
}
fn record_histogram<K: Into<Key>>(&mut self, key: K, values: &[u64]) {
let mut h = Histogram::new(3).expect("failed to create histogram");
for value in values {
h.record(*value).expect("failed to record histogram value");
}
let (name_parts, name) = name_to_parts(key.into().as_ref());
let mut values = hist_to_values(name, h, &self.quantiles);
self.structure.insert(name_parts, &mut values);
}
}
impl Clone for TextRecorder {
fn clone(&self) -> Self {
Self {
structure: MetricsTree::with_level(0),
quantiles: self.quantiles.clone(),
}
}
}
#[derive(Default)]
struct MetricsTree {
level: usize,
current: Vec<String>,
next: HashMap<String, MetricsTree>,
}
impl MetricsTree {
pub fn with_level(level: usize) -> Self {
MetricsTree {
level,
current: Vec::new(),
next: HashMap::new(),
}
}
pub fn insert(&mut self, mut name_parts: VecDeque<String>, values: &mut Vec<String>) {
match name_parts.len() {
0 => {
let indent = " ".repeat(self.level + 1);
let mut indented = values
.iter()
.map(move |x| format!("{}{}", indent, x))
.collect::<Vec<_>>();
self.current.append(&mut indented);
}
_ => {
let name = name_parts
.pop_front()
.expect("failed to get next name component");
let current_level = self.level;
let inner = self
.next
.entry(name)
.or_insert_with(move || MetricsTree::with_level(current_level + 1));
inner.insert(name_parts, values);
}
}
}
pub fn into_output(self) -> String {
let indent = " ".repeat(self.level + 1);
let mut output = String::new();
if self.level == 0 {
output.push_str("\nroot:\n");
}
let mut sorted = self
.current
.into_iter()
.map(SortEntry::Inline)
.chain(self.next.into_iter().map(|(k, v)| SortEntry::Nested(k, v)))
.collect::<Vec<_>>();
sorted.sort();
for entry in sorted {
match entry {
SortEntry::Inline(s) => {
output.push_str(s.as_str());
output.push_str("\n");
}
SortEntry::Nested(s, inner) => {
output.push_str(indent.as_str());
output.push_str(s.as_str());
output.push_str(":\n");
let layer_output = inner.into_output();
output.push_str(layer_output.as_str());
}
}
}
output
}
}
impl Into<String> for TextRecorder {
fn into(self) -> String {
self.structure.into_output()
}
}
enum SortEntry {
Inline(String),
Nested(String, MetricsTree),
}
impl SortEntry {
fn name(&self) -> &String {
match self {
SortEntry::Inline(s) => s,
SortEntry::Nested(s, _) => s,
}
}
}
impl PartialEq for SortEntry {
fn eq(&self, other: &SortEntry) -> bool {
self.name() == other.name()
}
}
impl Eq for SortEntry {}
impl std::cmp::PartialOrd for SortEntry {
fn partial_cmp(&self, other: &SortEntry) -> Option<std::cmp::Ordering> {
Some(self.cmp(other))
}
}
impl std::cmp::Ord for SortEntry {
fn cmp(&self, other: &SortEntry) -> std::cmp::Ordering {
self.name().cmp(other.name())
}
}
fn name_to_parts(name: &str) -> (VecDeque<String>, String) {
let mut parts = name
.split('.')
.map(ToOwned::to_owned)
.collect::<VecDeque<_>>();
let name = parts.pop_back().expect("name didn't have a single part");
(parts, name)
}
fn single_value_to_values<T>(name: String, value: T) -> Vec<String>
where
T: Display,
{
let fvalue = format!("{}: {}", name, value);
vec![fvalue]
}
fn hist_to_values(name: String, hist: Histogram<u64>, quantiles: &[Quantile]) -> Vec<String> {
let mut values = Vec::new();
values.push(format!("{} count: {}", name, hist.len()));
for quantile in quantiles {
let value = hist.value_at_quantile(quantile.value());
values.push(format!("{} {}: {}", name, quantile.label(), value));
}
values
}