#include <initializer_list>
#include <iterator>
Go to the source code of this file.
|
| folly |
| —— Concurrent Priority Queue Implementation ——
|
|
|
template<typename C > |
constexpr auto | folly::size (C const &c) -> decltype(c.size()) |
|
template<typename T , std::size_t N> |
constexpr std::size_t | folly::size (T const (&)[N]) noexcept |
|
template<typename C > |
constexpr auto | folly::empty (C const &c) -> decltype(c.empty()) |
|
template<typename T , std::size_t N> |
constexpr bool | folly::empty (T const (&)[N]) noexcept |
|
template<typename E > |
constexpr bool | folly::empty (std::initializer_list< E > il) noexcept |
|
template<typename C > |
constexpr auto | folly::data (C &c) -> decltype(c.data()) |
|
template<typename C > |
constexpr auto | folly::data (C const &c) -> decltype(c.data()) |
|
template<typename T , std::size_t N> |
constexpr T * | folly::data (T(&a)[N]) noexcept |
|
template<typename E > |
constexpr E const * | folly::data (std::initializer_list< E > il) noexcept |
|