23 using namespace folly;
34 return std::is_const<_t<std::remove_reference<T>>>
::value;
53 explicit Explicit(Source) {}
75 ptr = std::make_unique<int>(2);
133 int data[2] = {3, 4};
149 int data[2] = {3, 4};
155 auto _ = [](
auto&&
x,
auto&&
y) {
return x ==
y; };
166 int data[2] = {3, 4};
172 auto _ = [](
auto&&
x,
auto&&
y) {
return x !=
y; };
183 int data[2] = {3, 4};
189 auto _ = [](
auto&&
x,
auto&&
y) {
return x <
y; };
205 int data[2] = {3, 4};
211 auto _ = [](
auto&&
x,
auto&&
y) {
return x >
y; };
227 int data[2] = {3, 4};
233 auto _ = [](
auto&&
x,
auto&&
y) {
return x <=
y; };
249 int data[2] = {3, 4};
255 auto _ = [](
auto&&
x,
auto&&
y) {
return x >=
y; };
279 int data[2] = {3, 4};
285 auto _ = std::equal_to<pc<int*>>{};
291 int data[2] = {3, 4};
297 auto _ = std::not_equal_to<pc<int*>>{};
303 int data[2] = {3, 4};
309 auto _ = std::less<pc<int*>>{};
317 int data[2] = {3, 4};
323 auto _ = std::greater<pc<int*>>{};
331 int data[2] = {3, 4};
337 auto _ = std::less_equal<pc<int*>>{};
345 int data[2] = {3, 4};
351 auto _ = std::greater_equal<pc<int*>>{};
#define EXPECT_EQ(val1, val2)
—— Concurrent Priority Queue Implementation ——
constexpr T const & as_const(T &t) noexcept
constexpr auto data(C &c) -> decltype(c.data())
TEST_F(AsyncSSLSocketWriteTest, write_coalescing1)
#define EXPECT_TRUE(condition)
void swap(exception_wrapper &a, exception_wrapper &b) noexcept
constexpr Pointer & get_underlying(propagate_const< Pointer > &obj)
uint64_t value(const typename LockFreeRingBuffer< T, Atom >::Cursor &rbcursor)
const internal::AnythingMatcher _
#define EXPECT_FALSE(condition)
static bool is_const(T &&)