blob: c825839227ebb8a4aac7c591138f60940508d27f (
plain)
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
|
/*
* Copyright (c) 2018 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contributing project authors may
* be found in the AUTHORS file in the root of the source tree.
*/
#include "rtc_base/numerics/moving_average.h"
#include <algorithm>
#include "rtc_base/checks.h"
namespace rtc {
MovingAverage::MovingAverage(size_t window_size) : history_(window_size, 0) {
// Limit window size to avoid overflow.
RTC_DCHECK_LE(window_size, (int64_t{1} << 32) - 1);
}
MovingAverage::~MovingAverage() = default;
void MovingAverage::AddSample(int sample) {
count_++;
size_t index = count_ % history_.size();
if (count_ > history_.size())
sum_ -= history_[index];
sum_ += sample;
history_[index] = sample;
}
absl::optional<int> MovingAverage::GetAverageRoundedDown() const {
if (count_ == 0)
return absl::nullopt;
return sum_ / Size();
}
absl::optional<int> MovingAverage::GetAverageRoundedToClosest() const {
if (count_ == 0)
return absl::nullopt;
return (sum_ + Size() / 2) / Size();
}
absl::optional<double> MovingAverage::GetUnroundedAverage() const {
if (count_ == 0)
return absl::nullopt;
return sum_ / static_cast<double>(Size());
}
void MovingAverage::Reset() {
count_ = 0;
sum_ = 0;
}
size_t MovingAverage::Size() const {
return std::min(count_, history_.size());
}
} // namespace rtc
|
