20 using namespace folly;
31 auto f2 = sp.getFuture();
45 auto f2 = sp.getSemiFuture();
73 auto f1 = sp1.getFuture();
82 auto f3 = sp3.getFuture();
101 auto f3 = sp3.getFuture();
117 auto f2 = sp2.getFuture();
121 auto f3 = sp3.getFuture();
137 auto f2 = sp2.getFuture();
141 auto f3 = sp3.getFuture();
148 auto pSP = std::make_unique<folly::FutureSplitter<int>>(
167 throw std::runtime_error(
"Oops");
168 }
catch (std::exception& e) {
173 auto f2 = sp.getFuture();
179 std::vector<int8_t> priorities = {
185 for (
const auto priority : priorities) {
#define EXPECT_NO_THROW(statement)
static const int8_t MID_PRI
SemiFuture< T > getSemiFuture()
#define EXPECT_EQ(val1, val2)
static const int8_t LO_PRI
constexpr detail::Map< Move > move
void setException(exception_wrapper ew)
—— Concurrent Priority Queue Implementation ——
FOLLY_ATTR_VISIBILITY_HIDDEN static FOLLY_ALWAYS_INLINE InlineExecutor & instance() noexcept
#define EXPECT_TRUE(condition)
std::enable_if< std::is_same< Unit, B >::value, void >::type setValue()
SemiFuture< T > getSemiFuture()
#define EXPECT_FALSE(condition)
static const int8_t HI_PRI
TEST(SequencedExecutor, CPUThreadPoolExecutor)