20 using namespace folly;
24 template <
class T,
class Ts,
class =
void>
26 template <
class T,
class... Ts>
29 template <
class T,
class... Ts>
30 using IsApplicable = IsApplicable_<
T,
TypeList<Ts...>>;
60 template <
class Car,
class Cdr = Nil>
—— Concurrent Priority Queue Implementation ——
MetaApply< MetaApply< List, impl::FoldR_< Fn >>, State > TypeFold
bool_constant< true > true_type
MetaApply< List, MetaBindBack< MetaQuote< TypeList >, Ts... >> TypePushBack
MetaApply< List, MetaBindFront< MetaQuote< TypeList >, Ts... >> TypePushFront
MetaApply< List, impl::TypeTransform_< Fn >> TypeTransform
type_t< void, Ts... > void_t
typename Fn::template apply< Ts... > MetaApply
MetaApply< MetaApply< List, impl::FoldL_< Fn >>, State > TypeReverseFold
static const char *const value
TypeReverseFold< List, TypeList<>, MetaFlip< impl::Unique_ >> TypeReverseUnique
uint64_t value(const typename LockFreeRingBuffer< T, Atom >::Cursor &rbcursor)
bool_constant< false > false_type
def PushFront(a_list, elem)
TypeFold< List, TypeList<>, impl::Unique_ > TypeUnique
MetaApply< TypeFold< List, MetaQuote< TypeList >, impl::Join_ >> TypeJoin
TEST(SequencedExecutor, CPUThreadPoolExecutor)