26 using namespace folly;
29 template <
size_t MergeSize>
36 for (
size_t i = 0;
i < MergeSize; ++
i) {
57 for (
int i = 0;
i < 999; ++
i) {
65 for (
int i = 0;
i < 1000; ++
i) {
73 std::vector<std::thread>
threads;
74 for (
int i = 0;
i < 10; ++
i) {
75 threads.push_back(std::thread([
i, &builder]() {
76 for (
int j = 0; j < 100; ++j) {
81 for (
auto& thread : threads) {
#define EXPECT_EQ(val1, val2)
constexpr size_type size() const
—— Concurrent Priority Queue Implementation ——
SimpleDigest merge(Range< const double * > r) const
#define EXPECT_GE(val1, val2)
std::vector< std::thread::id > threads
void append(double value)
static SimpleDigest merge(Range< const SimpleDigest * > r)
constexpr Iter begin() const
TEST(SequencedExecutor, CPUThreadPoolExecutor)