container_algorithm

Records

```
class HasBeginEnd
```

class HasBeginEnd<T, std::void_t<decltype(container_algorithm_internal::begin(
                                      std::declval<T (*)()>()())),
                                  decltype(container_algorithm_internal::end(
                                      std::declval<T (*)()>()()))>>

```
class IsIterator
```

class IsIterator<Iter, std::void_t<typename std::iterator_traits<Iter>::iterator_category>>

class IsUnorderedContainer<std::unordered_map<Key, T, Hash, KeyEqual, Allocator>>

class IsUnorderedContainer<std::unordered_set<Key, Hash, KeyEqual, Allocator>>

class IsUnorderedContainer<absl::flat_hash_map<Key, T, Hash, KeyEqual, Allocator>>

Functions

```
template <typename C>
```
```
ContainerIter<C> c_begin (C & c)
```
container_algorithm_internal::c_begin and

container_algorithm_internal::c_end are abbreviations for proper ADL

lookup of std::begin and std::end, i.e.

using std::begin;

using std::end;

std::foo(begin(c), end(c));

becomes

std::foo(container_algorithm_internal::c_begin(c),

container_algorithm_internal::c_end(c));

These are meant for internal use only.

Defined at line 111 of file ../../third_party/abseil-cpp/src/absl/algorithm/container.h
```
template <typename C>
```
```
ContainerIter<C> c_end (C & c)
```
Defined at line 116 of file ../../third_party/abseil-cpp/src/absl/algorithm/container.h
```
template <typename InputSequence, typename Size, typename OutputRange>
```
```
void AssertCopyNSize (InputSequence & input, Size n, OutputRange & output)
```
Helper to check that the `OutputRange` has enough space.

Only performs the check if the iterators are ForwardIterators or better.

Defined at line 123 of file ../../third_party/abseil-cpp/src/absl/algorithm/container.h

template <typename InputSequencetypename OutputRange>

void AssertCopySize (InputSequence & input, OutputRange & output)

Defined at line 141 of file ../../third_party/abseil-cpp/src/absl/algorithm/container.h