#include <bits/c++config.h>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cstddef>
#include <new>
#include <iosfwd>
#include <bits/stl_pair.h>
#include <bits/type_traits.h>
#include <bits/stl_iterator_base_types.h>
#include <bits/stl_iterator_base_funcs.h>
#include <bits/stl_iterator.h>
#include <bits/concept_check.h>
#include <debug/debug.h>
Go to the source code of this file.
Namespaces | |
namespace | std |
Functions | |
template<typename ForwardIterator1, typename ForwardIterator2> | |
void | std::iter_swap (ForwardIterator1 a, ForwardIterator2 __b) |
Swaps the contents of two iterators. | |
template<typename Type> | |
void | std::swap (Type &a, Type &__b) |
Swaps two values. | |
template<typename Type> | |
const Type & | std::min (const Type &a, const Type &__b) |
This does what you think it does. | |
template<typename Type> | |
const Type & | std::max (const Type &a, const Type &__b) |
This does what you think it does. | |
template<typename Type, typename Compare> | |
const Type & | std::min (const Type &a, const Type &__b, Compare comp) |
This does what you think it does. | |
template<typename Type, typename Compare> | |
const Type & | std::max (const Type &a, const Type &__b, Compare comp) |
This does what you think it does. | |
template<typename InputIterator, typename OutputIterator> | |
OutputIterator | std::copy (InputIterator first, InputIterator last, OutputIterator __result) |
Copies the range [first,last) into result. | |
template<typename BI1, typename BI2> | |
BI2 | std::copy_backward (BI1 first, BI1 last, BI2 __result) |
Copies the range [first,last) into result. | |
template<typename ForwardIterator, typename Type> | |
void | std::fill (ForwardIterator first, ForwardIterator last, const Type &value) |
Fills the range [first,last) with copies of value. | |
template<typename OutputIterator, typename Size, typename Type> | |
OutputIterator | std::fill_n (OutputIterator first, Size n, const Type &value) |
Fills the range [first,first+n) with copies of value. | |
template<typename InputIterator1, typename InputIterator2> | |
pair< InputIterator1, InputIterator2 > | std::mismatch (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2) |
Finds the places in ranges which don't match. | |
template<typename InputIterator1, typename InputIterator2, typename BinaryPredicate> | |
pair< InputIterator1, InputIterator2 > | std::mismatch (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate __binary_pred) |
Finds the places in ranges which don't match. | |
template<typename InputIterator1, typename InputIterator2> | |
bool | std::equal (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2) |
Tests a range for element-wise equality. | |
template<typename InputIterator1, typename InputIterator2, typename BinaryPredicate> | |
bool | std::equal (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate __binary_pred) |
Tests a range for element-wise equality. | |
template<typename InputIterator1, typename InputIterator2> | |
bool | std::lexicographical_compare (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2) |
Performs "dictionary" comparison on ranges. | |
template<typename InputIterator1, typename InputIterator2, typename Compare> | |
bool | std::lexicographical_compare (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp) |
Performs "dictionary" comparison on ranges. |
Definition in file stl_algobase.h.