absl::container_algorithm_internal Namespace Reference

Classes
struct	IsUnorderedContainer
struct	IsUnorderedContainer< absl::flat_hash_map< Key, T, Hash, KeyEqual, Allocator > >
struct	IsUnorderedContainer< absl::flat_hash_set< Key, Hash, KeyEqual, Allocator > >
struct	IsUnorderedContainer< absl::node_hash_map< Key, T, Hash, KeyEqual, Allocator > >
struct	IsUnorderedContainer< absl::node_hash_set< Key, Hash, KeyEqual, Allocator > >
struct	IsUnorderedContainer< std::unordered_map< Key, T, Hash, KeyEqual, Allocator > >
struct	IsUnorderedContainer< std::unordered_set< Key, Hash, KeyEqual, Allocator > >

Typedefs
template<typename C >
using	ContainerDifferenceType = decltype(std::distance(std::declval< ContainerIter< C > >(), std::declval< ContainerIter< C > >()))
template<typename C >
using	ContainerIter = decltype(begin(std::declval< C & >()))
template<typename C1 , typename C2 >
using	ContainerIterPairType = decltype(std::make_pair(ContainerIter< C1 >(), ContainerIter< C2 >()))
template<typename C >
using	ContainerPointerType = typename std::iterator_traits< ContainerIter< C > >::pointer

Functions
template<typename C >
ContainerIter< C >	c_begin (C &c)
template<typename C >
ContainerIter< C >	c_end (C &c)
template<class C >
auto	c_size (C &c) -> decltype(c.size())
template<class T , std::size_t N>
constexpr std::size_t	c_size (T(&)[N])

Typedef Documentation

ContainerDifferenceType

template<typename C >

using absl::container_algorithm_internal::ContainerDifferenceType = typedef decltype(std::distance(std::declval<ContainerIter<C> >(), std::declval<ContainerIter<C> >()))

Definition at line 82 of file abseil-cpp/absl/algorithm/container.h.

ContainerIter

template<typename C >

using absl::container_algorithm_internal::ContainerIter = typedef decltype(begin(std::declval<C&>()))

Definition at line 71 of file abseil-cpp/absl/algorithm/container.h.

ContainerIterPairType

template<typename C1 , typename C2 >

using absl::container_algorithm_internal::ContainerIterPairType = typedef decltype(std::make_pair(ContainerIter<C1>(), ContainerIter<C2>()))

Definition at line 77 of file abseil-cpp/absl/algorithm/container.h.

ContainerPointerType

template<typename C >

using absl::container_algorithm_internal::ContainerPointerType = typedef typename std::iterator_traits<ContainerIter<C> >::pointer

Definition at line 86 of file abseil-cpp/absl/algorithm/container.h.

Function Documentation

c_begin()

template<typename C >

ContainerIter< C > absl::container_algorithm_internal::c_begin

(

C &

c

)

Definition at line 100 of file abseil-cpp/absl/algorithm/container.h.

c_end()

template<typename C >

ContainerIter< C > absl::container_algorithm_internal::c_end

(

C &

c

)

Definition at line 103 of file abseil-cpp/absl/algorithm/container.h.

c_size() [1/2]

template<class C >

auto absl::container_algorithm_internal::c_size

(

C &

c

)

-> decltype(c.size())

Definition at line 119 of file abseil-cpp/absl/algorithm/container.h.

c_size() [2/2]

template<class T , std::size_t N>

constexpr std::size_t absl::container_algorithm_internal::c_size ( T(&)  [N] )

constexpr

Definition at line 124 of file abseil-cpp/absl/algorithm/container.h.