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
|
// 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/rate_counter.h"
#include <stddef.h>
#include <stdint.h>
#include <array>
#include "base/test/simple_test_tick_clock.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace remoting {
constexpr auto kTestValues =
std::to_array<int64_t>({10, 20, 30, 10, 25, 16, 15});
// One second window and one sample per second, so rate equals each sample.
TEST(RateCounterTest, OneSecondWindow) {
base::SimpleTestTickClock tick_clock;
RateCounter rate_counter(base::Seconds(1), &tick_clock);
EXPECT_EQ(0, rate_counter.Rate());
for (size_t i = 0; i < std::size(kTestValues); ++i) {
tick_clock.Advance(base::Seconds(1));
rate_counter.Record(kTestValues[i]);
EXPECT_EQ(static_cast<double>(kTestValues[i]), rate_counter.Rate());
}
}
// Record all samples instantaneously, so the rate is the total of the samples.
TEST(RateCounterTest, OneSecondWindowAllSamples) {
base::SimpleTestTickClock tick_clock;
RateCounter rate_counter(base::Seconds(1), &tick_clock);
EXPECT_EQ(0, rate_counter.Rate());
double expected = 0.0;
for (size_t i = 0; i < std::size(kTestValues); ++i) {
rate_counter.Record(kTestValues[i]);
expected += kTestValues[i];
}
EXPECT_EQ(expected, rate_counter.Rate());
}
// Two second window, one sample per second. For all but the first sample, the
// rate should be the average of it and the preceding one. For the first it
// will be the average of the sample with zero.
TEST(RateCounterTest, TwoSecondWindow) {
base::SimpleTestTickClock tick_clock;
RateCounter rate_counter(base::Seconds(2), &tick_clock);
EXPECT_EQ(0, rate_counter.Rate());
for (size_t i = 0; i < std::size(kTestValues); ++i) {
tick_clock.Advance(base::Seconds(1));
rate_counter.Record(kTestValues[i]);
double expected = kTestValues[i];
if (i > 0) {
expected += kTestValues[i - 1];
}
expected /= 2;
EXPECT_EQ(expected, rate_counter.Rate());
}
}
// Sample over a window one second shorter than the number of samples.
// Rate should be the average of all but the first sample.
TEST(RateCounterTest, LongWindow) {
const size_t kWindowSeconds = std::size(kTestValues) - 1;
base::SimpleTestTickClock tick_clock;
RateCounter rate_counter(base::Seconds(kWindowSeconds), &tick_clock);
EXPECT_EQ(0, rate_counter.Rate());
double expected = 0.0;
for (size_t i = 0; i < std::size(kTestValues); ++i) {
tick_clock.Advance(base::Seconds(1));
rate_counter.Record(kTestValues[i]);
if (i != 0) {
expected += kTestValues[i];
}
}
expected /= kWindowSeconds;
EXPECT_EQ(expected, rate_counter.Rate());
}
} // namespace remoting
|
