#include <bslstl_algorithm.h>
|
template<class t_INPUT_ITERATOR , class t_SIZE , class t_OUTPUT_ITERATOR > |
t_OUTPUT_ITERATOR | copyNImp (t_INPUT_ITERATOR first, t_SIZE count, t_OUTPUT_ITERATOR result, const bsl::input_iterator_tag &) |
|
template<class t_RANDOM_ACCESS_ITERATOR , class t_SIZE , class t_OUTPUT_ITERATOR > |
t_OUTPUT_ITERATOR | copyNImp (t_RANDOM_ACCESS_ITERATOR first, t_SIZE count, t_OUTPUT_ITERATOR result, const bsl::random_access_iterator_tag &) |
|
template<class CONTAINER , class PREDICATE > |
CONTAINER::size_type | containerEraseIf (CONTAINER &container, PREDICATE predicate) |
|
template<class t_INPUT_ITERATOR , class t_SIZE , class t_OUTPUT_ITERATOR > |
t_OUTPUT_ITERATOR | copyN (t_INPUT_ITERATOR first, t_SIZE count, t_OUTPUT_ITERATOR result) |
|
|
template<class CONTAINER , class PREDICATE > |
static CONTAINER::size_type | containerEraseIf (CONTAINER &container, PREDICATE predicate) |
|
template<class t_INPUT_ITERATOR , class t_SIZE , class t_OUTPUT_ITERATOR > |
static t_OUTPUT_ITERATOR | copyN (t_INPUT_ITERATOR first, t_SIZE count, t_OUTPUT_ITERATOR result) |
|
Provide a namespace for implementing helper routines for algorithm implementations.
◆ containerEraseIf()
template<class CONTAINER , class PREDICATE >
static CONTAINER::size_type bslstl::AlgorithmUtil::containerEraseIf |
( |
CONTAINER & |
container, |
|
|
PREDICATE |
predicate |
|
) |
| |
|
static |
Erase all the elements in the specified container container
that satisfy the specified predicate predicate
. Return the number of elements erased.
◆ copyN()
template<class t_INPUT_ITERATOR , class t_SIZE , class t_OUTPUT_ITERATOR >
static t_OUTPUT_ITERATOR bslstl::AlgorithmUtil::copyN |
( |
t_INPUT_ITERATOR |
first, |
|
|
t_SIZE |
count, |
|
|
t_OUTPUT_ITERATOR |
result |
|
) |
| |
|
static |
Copy the specified count
elements from the specified first
to the specified result
. Return an iterator pointing past the last copied element in the output range.
The documentation for this struct was generated from the following file: