#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>


Go to the source code of this file.
Namespaces | |
| namespace | std |
Functions | |
| template<typename ForwardIter1, typename ForwardIter2> | |
| void | std::iter_swap (ForwardIter1 a, ForwardIter2 __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 InputIter, typename OutputIter> | |
| OutputIter | std::copy (InputIter first, InputIter last, OutputIter __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 ForwardIter, typename Type> | |
| void | std::fill (ForwardIter first, ForwardIter last, const Type &value) |
| Fills the range [first,last) with copies of value. | |
| template<typename OutputIter, typename Size, typename Type> | |
| OutputIter | std::fill_n (OutputIter first, Size n, const Type &value) |
| Fills the range [first,first+n) with copies of value. | |
| template<typename InputIter1, typename InputIter2> | |
| pair< InputIter1, InputIter2 > | std::mismatch (InputIter1 first1, InputIter1 last1, InputIter2 first2) |
| Finds the places in ranges which don't match. | |
| template<typename InputIter1, typename InputIter2, typename BinaryPredicate> | |
| pair< InputIter1, InputIter2 > | std::mismatch (InputIter1 first1, InputIter1 last1, InputIter2 first2, BinaryPredicate __binary_pred) |
| Finds the places in ranges which don't match. | |
| template<typename InputIter1, typename InputIter2> | |
| bool | std::equal (InputIter1 first1, InputIter1 last1, InputIter2 first2) |
| Tests a range for element-wise equality. | |
| template<typename InputIter1, typename InputIter2, typename BinaryPredicate> | |
| bool | std::equal (InputIter1 first1, InputIter1 last1, InputIter2 first2, BinaryPredicate __binary_pred) |
| Tests a range for element-wise equality. | |
| template<typename InputIter1, typename InputIter2> | |
| bool | std::lexicographical_compare (InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2) |
| Performs "dictionary" comparison on ranges. | |
| template<typename InputIter1, typename InputIter2, typename Compare> | |
| bool | std::lexicographical_compare (InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, Compare comp) |
| Performs "dictionary" comparison on ranges. | |
Definition in file stl_algobase.h.
1.5.5