20 using namespace folly;
69 for (
int i = 1;
i <= 6;
i++) {
91 for (
int i = 0;
i < 3;
i++) {
103 const auto timeout = std::chrono::milliseconds{30};
104 for (
int i = 0;
i < 5;
i++) {
108 EXPECT_LE(time_after - time_before, timeout);
116 EXPECT_GE(time_after - time_before, timeout);
123 for (
int i = 0;
i < 5;
i++) {
#define EXPECT_LE(val1, val2)
#define EXPECT_EQ(val1, val2)
std::chrono::steady_clock::time_point now()
—— Concurrent Priority Queue Implementation ——
#define EXPECT_GE(val1, val2)
bool writeWithPriority(T &&item, size_t priority)
size_t getNumPriorities()
bool readWithPriority(T &item, size_t priority)
#define EXPECT_TRUE(condition)
bool isEmpty() const
Returns true if there are no items available for dequeue.
#define EXPECT_FALSE(condition)
TEST(SequencedExecutor, CPUThreadPoolExecutor)