21 using namespace folly;
30 slidingWindow = std::make_unique<SlidingWindow<size_t>>(
31 [&]() {
return curWindow++; }, 60);
36 auto buckets = slidingWindow->get();
39 for (
size_t i = 0;
i < 60; ++
i) {
45 slidingWindow->slide(0);
46 auto buckets = slidingWindow->get();
49 for (
size_t i = 0;
i < 60; ++
i) {
55 slidingWindow->slide(5);
56 auto buckets = slidingWindow->get();
59 for (
size_t i = 0;
i < 60; ++
i) {
65 slidingWindow->slide(60);
66 auto buckets = slidingWindow->get();
69 for (
size_t i = 0;
i < 60; ++
i) {
#define EXPECT_EQ(val1, val2)
—— Concurrent Priority Queue Implementation ——
std::unique_ptr< SlidingWindow< size_t > > slidingWindow
TEST_F(StaticSingletonManagerTest, example)