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
|
// Copyright 2013 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "remoting/base/running_samples.h"
#include <stddef.h>
#include <stdint.h>
#include <array>
#include "testing/gtest/include/gtest/gtest.h"
namespace remoting {
typedef void (*TestFunction)(size_t i, RunningSamples& samples);
constexpr auto kTestValues =
std::to_array<int64_t>({10, 20, 30, 10, 25, 16, 15});
// Test framework that verifies average() and max() at beginning, iterates
// through all elements and meanwhile calls your own test function
static void TestFramework(int windowSize, TestFunction testFn) {
RunningSamples samples(windowSize);
EXPECT_EQ(0, samples.Average());
EXPECT_EQ(0, samples.Max());
for (size_t i = 0; i < std::size(kTestValues); ++i) {
samples.Record(kTestValues[i]);
testFn(i, samples);
}
}
// Average across a single element, i.e. just return the most recent.
TEST(RunningSamplesTest, AverageOneElementWindow) {
TestFramework(1, [](size_t i, RunningSamples& samples) {
EXPECT_EQ(static_cast<double>(kTestValues[i]), samples.Average());
});
}
// Average the two most recent elements.
TEST(RunningSamplesTest, AverageTwoElementWindow) {
TestFramework(2, [](size_t i, RunningSamples& samples) {
double expected = kTestValues[i];
if (i > 0) {
expected = (expected + kTestValues[i - 1]) / 2;
}
EXPECT_EQ(expected, samples.Average());
});
}
// Average across all the elements if the window size exceeds the element count.
TEST(RunningSamplesTest, AverageLongWindow) {
TestFramework(std::size(kTestValues) + 1,
[](size_t i, RunningSamples& samples) {
double expected = 0.0;
for (size_t j = 0; j <= i; ++j) {
expected += kTestValues[j];
}
expected /= i + 1;
EXPECT_EQ(expected, samples.Average());
});
}
// Max of a single element, i.e. just return the most recent.
TEST(RunningSamplesTest, MaxOneElementWindow) {
TestFramework(1, [](size_t i, RunningSamples& samples) {
EXPECT_EQ(static_cast<double>(kTestValues[i]), samples.Max());
});
}
// Max of the two most recent elements.
TEST(RunningSamplesTest, MaxTwoElementWindow) {
TestFramework(2, [](size_t i, RunningSamples& samples) {
double expected = kTestValues[i];
if (i > 0) {
expected = expected > kTestValues[i - 1] ? expected : kTestValues[i - 1];
}
EXPECT_EQ(expected, samples.Max());
});
}
// Max of all the elements if the window size exceeds the element count.
TEST(RunningSamplesTest, MaxLongWindow) {
TestFramework(
std::size(kTestValues) + 1, [](size_t i, RunningSamples& samples) {
int64_t expected = -1;
for (size_t j = 0; j <= i; ++j) {
expected = expected > kTestValues[j] ? expected : kTestValues[j];
}
EXPECT_EQ(expected, samples.Max());
});
}
} // namespace remoting
|
