120 lines
3.9 KiB
C++
120 lines
3.9 KiB
C++
/*
|
|
* Copyright 2016 The Cartographer Authors
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
#include "cartographer/common/blocking_queue.h"
|
|
|
|
#include <memory>
|
|
#include <thread>
|
|
|
|
#include "absl/memory/memory.h"
|
|
#include "cartographer/common/time.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
namespace cartographer {
|
|
namespace common {
|
|
namespace {
|
|
|
|
TEST(BlockingQueueTest, testPushPeekPop) {
|
|
BlockingQueue<std::unique_ptr<int>> blocking_queue;
|
|
blocking_queue.Push(absl::make_unique<int>(42));
|
|
ASSERT_EQ(1, blocking_queue.Size());
|
|
blocking_queue.Push(absl::make_unique<int>(24));
|
|
ASSERT_EQ(2, blocking_queue.Size());
|
|
EXPECT_EQ(42, *blocking_queue.Peek<int>());
|
|
ASSERT_EQ(2, blocking_queue.Size());
|
|
EXPECT_EQ(42, *blocking_queue.Pop());
|
|
ASSERT_EQ(1, blocking_queue.Size());
|
|
EXPECT_EQ(24, *blocking_queue.Pop());
|
|
ASSERT_EQ(0, blocking_queue.Size());
|
|
EXPECT_EQ(nullptr, blocking_queue.Peek<int>());
|
|
ASSERT_EQ(0, blocking_queue.Size());
|
|
}
|
|
|
|
TEST(BlockingQueueTest, testPushPopSharedPtr) {
|
|
BlockingQueue<std::shared_ptr<int>> blocking_queue;
|
|
blocking_queue.Push(std::make_shared<int>(42));
|
|
blocking_queue.Push(std::make_shared<int>(24));
|
|
EXPECT_EQ(42, *blocking_queue.Pop());
|
|
EXPECT_EQ(24, *blocking_queue.Pop());
|
|
}
|
|
|
|
TEST(BlockingQueueTest, testPopWithTimeout) {
|
|
BlockingQueue<std::unique_ptr<int>> blocking_queue;
|
|
EXPECT_EQ(nullptr,
|
|
blocking_queue.PopWithTimeout(common::FromMilliseconds(150)));
|
|
}
|
|
|
|
TEST(BlockingQueueTest, testPushWithTimeout) {
|
|
BlockingQueue<std::unique_ptr<int>> blocking_queue(1);
|
|
EXPECT_EQ(true,
|
|
blocking_queue.PushWithTimeout(absl::make_unique<int>(42),
|
|
common::FromMilliseconds(150)));
|
|
EXPECT_EQ(false,
|
|
blocking_queue.PushWithTimeout(absl::make_unique<int>(15),
|
|
common::FromMilliseconds(150)));
|
|
EXPECT_EQ(42, *blocking_queue.Pop());
|
|
EXPECT_EQ(0, blocking_queue.Size());
|
|
}
|
|
|
|
TEST(BlockingQueueTest, testPushWithTimeoutInfinteQueue) {
|
|
BlockingQueue<std::unique_ptr<int>> blocking_queue;
|
|
EXPECT_EQ(true,
|
|
blocking_queue.PushWithTimeout(absl::make_unique<int>(42),
|
|
common::FromMilliseconds(150)));
|
|
EXPECT_EQ(true,
|
|
blocking_queue.PushWithTimeout(absl::make_unique<int>(45),
|
|
common::FromMilliseconds(150)));
|
|
EXPECT_EQ(42, *blocking_queue.Pop());
|
|
EXPECT_EQ(45, *blocking_queue.Pop());
|
|
EXPECT_EQ(0, blocking_queue.Size());
|
|
}
|
|
|
|
TEST(BlockingQueueTest, testBlockingPop) {
|
|
BlockingQueue<std::unique_ptr<int>> blocking_queue;
|
|
ASSERT_EQ(0, blocking_queue.Size());
|
|
|
|
int pop = 0;
|
|
|
|
std::thread thread([&blocking_queue, &pop] { pop = *blocking_queue.Pop(); });
|
|
|
|
std::this_thread::sleep_for(common::FromMilliseconds(100));
|
|
blocking_queue.Push(absl::make_unique<int>(42));
|
|
thread.join();
|
|
ASSERT_EQ(0, blocking_queue.Size());
|
|
EXPECT_EQ(42, pop);
|
|
}
|
|
|
|
TEST(BlockingQueueTest, testBlockingPopWithTimeout) {
|
|
BlockingQueue<std::unique_ptr<int>> blocking_queue;
|
|
ASSERT_EQ(0, blocking_queue.Size());
|
|
|
|
int pop = 0;
|
|
|
|
std::thread thread([&blocking_queue, &pop] {
|
|
pop = *blocking_queue.PopWithTimeout(common::FromMilliseconds(2500));
|
|
});
|
|
|
|
std::this_thread::sleep_for(common::FromMilliseconds(100));
|
|
blocking_queue.Push(absl::make_unique<int>(42));
|
|
thread.join();
|
|
ASSERT_EQ(0, blocking_queue.Size());
|
|
EXPECT_EQ(42, pop);
|
|
}
|
|
|
|
} // namespace
|
|
} // namespace common
|
|
} // namespace cartographer
|