ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 2017 The WebRTC project authors. All Rights Reserved. |
| 3 | * |
| 4 | * Use of this source code is governed by a BSD-style license |
| 5 | * that can be found in the LICENSE file in the root of the source |
| 6 | * tree. An additional intellectual property rights grant can be found |
| 7 | * in the file PATENTS. All contributing project authors may |
| 8 | * be found in the AUTHORS file in the root of the source tree. |
| 9 | */ |
| 10 | |
Karl Wiberg | 65c3922 | 2017-11-22 12:25:14 +0100 | [diff] [blame] | 11 | #include "rtc_base/numerics/moving_max_counter.h" |
Jonas Olsson | a4d8737 | 2019-07-05 19:08:33 +0200 | [diff] [blame] | 12 | |
Mirko Bonadei | 92ea95e | 2017-09-15 06:47:31 +0200 | [diff] [blame] | 13 | #include "test/gtest.h" |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 14 | |
| 15 | TEST(MovingMaxCounter, ReportsMaximumInTheWindow) { |
| 16 | rtc::MovingMaxCounter<int> counter(100); |
| 17 | counter.Add(1, 1); |
Oskar Sundbom | 9c78058 | 2017-11-27 10:28:22 +0100 | [diff] [blame] | 18 | EXPECT_EQ(counter.Max(1), 1); |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 19 | counter.Add(2, 30); |
Oskar Sundbom | 9c78058 | 2017-11-27 10:28:22 +0100 | [diff] [blame] | 20 | EXPECT_EQ(counter.Max(30), 2); |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 21 | counter.Add(100, 60); |
Oskar Sundbom | 9c78058 | 2017-11-27 10:28:22 +0100 | [diff] [blame] | 22 | EXPECT_EQ(counter.Max(60), 100); |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 23 | counter.Add(4, 70); |
Oskar Sundbom | 9c78058 | 2017-11-27 10:28:22 +0100 | [diff] [blame] | 24 | EXPECT_EQ(counter.Max(70), 100); |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 25 | counter.Add(5, 90); |
Oskar Sundbom | 9c78058 | 2017-11-27 10:28:22 +0100 | [diff] [blame] | 26 | EXPECT_EQ(counter.Max(90), 100); |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 27 | } |
| 28 | |
| 29 | TEST(MovingMaxCounter, IgnoresOldElements) { |
| 30 | rtc::MovingMaxCounter<int> counter(100); |
| 31 | counter.Add(1, 1); |
| 32 | counter.Add(2, 30); |
| 33 | counter.Add(100, 60); |
| 34 | counter.Add(4, 70); |
| 35 | counter.Add(5, 90); |
Oskar Sundbom | 9c78058 | 2017-11-27 10:28:22 +0100 | [diff] [blame] | 36 | EXPECT_EQ(counter.Max(160), 100); |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 37 | // 100 is now out of the window. Next maximum is 5. |
Oskar Sundbom | 9c78058 | 2017-11-27 10:28:22 +0100 | [diff] [blame] | 38 | EXPECT_EQ(counter.Max(161), 5); |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 39 | } |
| 40 | |
| 41 | TEST(MovingMaxCounter, HandlesEmptyWindow) { |
| 42 | rtc::MovingMaxCounter<int> counter(100); |
| 43 | counter.Add(123, 1); |
| 44 | EXPECT_TRUE(counter.Max(101).has_value()); |
| 45 | EXPECT_FALSE(counter.Max(102).has_value()); |
| 46 | } |
| 47 | |
| 48 | TEST(MovingMaxCounter, HandlesSamplesWithEqualTimestamps) { |
| 49 | rtc::MovingMaxCounter<int> counter(100); |
| 50 | counter.Add(2, 30); |
Oskar Sundbom | 9c78058 | 2017-11-27 10:28:22 +0100 | [diff] [blame] | 51 | EXPECT_EQ(counter.Max(30), 2); |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 52 | counter.Add(5, 30); |
Oskar Sundbom | 9c78058 | 2017-11-27 10:28:22 +0100 | [diff] [blame] | 53 | EXPECT_EQ(counter.Max(30), 5); |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 54 | counter.Add(4, 30); |
Oskar Sundbom | 9c78058 | 2017-11-27 10:28:22 +0100 | [diff] [blame] | 55 | EXPECT_EQ(counter.Max(30), 5); |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 56 | counter.Add(1, 90); |
Oskar Sundbom | 9c78058 | 2017-11-27 10:28:22 +0100 | [diff] [blame] | 57 | EXPECT_EQ(counter.Max(150), 1); |
ilnik | a79cc28 | 2017-08-23 05:24:10 -0700 | [diff] [blame] | 58 | } |