#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 dependency graph for stl_algobase.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces | |
namespace | std |
Functions | |
template<typename ForwardIter1, typename ForwardIter2> | |
void | iter_swap (ForwardIter1 a, ForwardIter2 __b) |
Swaps the contents of two iterators. | |
template<typename Type> | |
void | swap (Type &a, Type &__b) |
Swaps two values. | |
template<typename Type> | |
const Type & | min (const Type &a, const Type &__b) |
This does what you think it does. | |
template<typename Type> | |
const Type & | max (const Type &a, const Type &__b) |
This does what you think it does. | |
template<typename Type, typename Compare> | |
const Type & | min (const Type &a, const Type &__b, Compare comp) |
This does what you think it does. | |
template<typename Type, typename Compare> | |
const Type & | max (const Type &a, const Type &__b, Compare comp) |
This does what you think it does. | |
template<typename InputIter, typename OutputIter> | |
OutputIter | copy (InputIter first, InputIter last, OutputIter __result) |
Copies the range [first,last) into result. | |
template<typename BI1, typename BI2> | |
BI2 | copy_backward (BI1 first, BI1 last, BI2 __result) |
Copies the range [first,last) into result. | |
template<typename ForwardIter, typename Type> | |
void | 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 | 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 > | 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 > | 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 | equal (InputIter1 first1, InputIter1 last1, InputIter2 first2) |
Tests a range for element-wise equality. | |
template<typename InputIter1, typename InputIter2, typename BinaryPredicate> | |
bool | equal (InputIter1 first1, InputIter1 last1, InputIter2 first2, BinaryPredicate __binary_pred) |
Tests a range for element-wise equality. | |
template<typename InputIter1, typename InputIter2> | |
bool | lexicographical_compare (InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2) |
Performs "dictionary" comparison on ranges. | |
template<typename InputIter1, typename InputIter2, typename Compare> | |
bool | lexicographical_compare (InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, Compare comp) |
Performs "dictionary" comparison on ranges. |
Definition in file stl_algobase.h.
|
Copies the range [first,last) into result.
memmove whenever possible. Failing that, if random access iterators are passed, then the loop count will be known (and therefore a candidate for compiler optimizations such as unrolling). If the input range and the output range overlap, then the copy_backward function should be used instead.
Definition at line 341 of file stl_algobase.h. Referenced by std::vector< Type, Alloc >::erase(), std::deque< Type, Alloc >::erase(), std::merge(), std::vector< Type, Alloc >::operator=(), std::deque< Type, Alloc >::operator=(), std::rotate_copy(), std::basic_streambuf< CharT, Traits >::xsgetn(), and std::basic_streambuf< CharT, Traits >::xsputn(). |
|
Copies the range [first,last) into result.
memmove whenever possible. Failing that, if random access iterators are passed, then the loop count will be known (and therefore a candidate for compiler optimizations such as unrolling).
Definition at line 479 of file stl_algobase.h. Referenced by std::deque< Type, Alloc >::erase(). |
|
Tests a range for element-wise equality.
Definition at line 701 of file stl_algobase.h. |
|
Tests a range for element-wise equality.
== and returns true or false depending on whether all of the corresponding elements of the ranges are equal.
Definition at line 670 of file stl_algobase.h. Referenced by std::operator==(). |
|
Fills the range [first,last) with copies of value.
memset .
Definition at line 511 of file stl_algobase.h. |
|
Fills the range [first,first+n) with copies of value.
memset .
Definition at line 533 of file stl_algobase.h. |
|
Swaps the contents of two iterators.
Definition at line 93 of file stl_algobase.h. Referenced by std::random_shuffle(), and std::swap_ranges(). |
|
Performs "dictionary" comparison on ranges.
lexigraphical_compare , but uses the comp parameter instead of < .
Definition at line 769 of file stl_algobase.h. |
|
Performs "dictionary" comparison on ranges.
memcmp .
Definition at line 734 of file stl_algobase.h. Referenced by std::operator<(). |
|
This does what you think it does.
Definition at line 206 of file stl_algobase.h. |
|
This does what you think it does.
Definition at line 168 of file stl_algobase.h. Referenced by std::basic_istream< CharT, Traits >::ignore(), std::operator>>(), std::basic_istream< CharT, Traits >::operator>>(), std::basic_stringbuf< CharT, Traits, Alloc >::overflow(), std::basic_filebuf< CharT, Traits >::seekoff(), and std::basic_stringbuf< CharT, Traits, Alloc >::str(). |
|
This does what you think it does.
Definition at line 188 of file stl_algobase.h. |
|
This does what you think it does.
Definition at line 148 of file stl_algobase.h. Referenced by std::basic_istream< CharT, Traits >::ignore(), std::basic_istream< CharT, Traits >::operator>>(), __gnu_cxx::random_sample_n(), std::basic_istream< CharT, Traits >::readsome(), std::basic_streambuf< CharT, Traits >::xsgetn(), and std::basic_streambuf< CharT, Traits >::xsputn(). |
|
Finds the places in ranges which don't match.
Definition at line 642 of file stl_algobase.h. |
|
Finds the places in ranges which don't match.
== and returns a pair of iterators. The first iterator points into the first range, the second iterator points into the second range, and the elements pointed to by the iterators are not equal.
Definition at line 608 of file stl_algobase.h. |
|
Swaps two values.
Definition at line 120 of file stl_algobase.h. Referenced by std::vector< Node *, Alloc >::swap(), std::list< Type, Alloc >::swap(), and std::deque< Type, Alloc >::swap(). |