stl_algobase.h File Reference

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

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
Classes
struct	std::copy_backward_dispatch< BidirectionalIterator1, BidirectionalIterator2, BoolType >
struct	std::copy_backward_dispatch< Type *, Type *, __true_type >
struct	std::copy_backward_dispatch< const Type *, Type *, __true_type >
Defines
#define	ALGOBASEH
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, input_iterator_tag)
template<typename RandomAccessIterator, typename OutputIterator>
OutputIterator	std::copy (RandomAccessIterator first, RandomAccessIterator last, OutputIterator __result, random_access_iterator_tag)
template<typename Type>
Type *	std::copy_trivial (const Type *first, const Type *last, Type *__result)
template<typename InputIterator, typename OutputIterator>
OutputIterator	std::copy_aux2 (InputIterator first, InputIterator last, OutputIterator __result, __false_type)
template<typename InputIterator, typename OutputIterator>
OutputIterator	std::copy_aux2 (InputIterator first, InputIterator last, OutputIterator __result, __true_type)
template<typename Type>
Type *	std::copy_aux2 (Type *first, Type *last, Type *__result, __true_type)
template<typename Type>
Type *	std::copy_aux2 (const Type *first, const Type *last, Type *__result, __true_type)
template<typename InputIterator, typename OutputIterator>
OutputIterator	std::copy_ni2 (InputIterator first, InputIterator last, OutputIterator __result, __true_type)
template<typename InputIterator, typename OutputIterator>
OutputIterator	std::copy_ni2 (InputIterator first, InputIterator last, OutputIterator __result, __false_type)
template<typename InputIterator, typename OutputIterator>
OutputIterator	std::copy_ni1 (InputIterator first, InputIterator last, OutputIterator __result, __true_type)
template<typename InputIterator, typename OutputIterator>
OutputIterator	std::copy_ni1 (InputIterator first, InputIterator last, OutputIterator __result, __false_type)
template<typename InputIterator, typename OutputIterator>
OutputIterator	std::copy (InputIterator first, InputIterator last, OutputIterator __result)
	Copies the range [first,last) into result.
template<typename BidirectionalIterator1, typename BidirectionalIterator2>
BidirectionalIterator2	std::copy_backward (BidirectionalIterator1 first, BidirectionalIterator1 last, BidirectionalIterator2 __result, bidirectional_iterator_tag)
template<typename RandomAccessIterator, typename BidirectionalIterator>
BidirectionalIterator	std::copy_backward (RandomAccessIterator first, RandomAccessIterator last, BidirectionalIterator __result, random_access_iterator_tag)
template<typename BI1, typename BI2>
BI2	std::copy_backward_aux (BI1 first, BI1 last, BI2 __result)
template<typename BI1, typename BI2>
BI2	std::copy_backward_output_normal_iterator (BI1 first, BI1 last, BI2 __result, __true_type)
template<typename BI1, typename BI2>
BI2	std::copy_backward_output_normal_iterator (BI1 first, BI1 last, BI2 __result, __false_type)
template<typename BI1, typename BI2>
BI2	std::copy_backward_input_normal_iterator (BI1 first, BI1 last, BI2 __result, __true_type)
template<typename BI1, typename BI2>
BI2	std::copy_backward_input_normal_iterator (BI1 first, BI1 last, BI2 __result, __false_type)
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.
void	std::fill (unsigned char *first, unsigned char *last, const unsigned char &c)
void	std::fill (signed char *first, signed char *last, const signed char &c)
void	std::fill (char *first, char *last, const char &c)
template<typename Size>
unsigned char *	std::fill_n (unsigned char *first, Size n, const unsigned char &c)
template<typename Size>
signed char *	std::fill_n (char *first, Size n, const signed char &c)
template<typename Size>
char *	std::fill_n (char *first, Size n, const char &c)
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.
bool	std::lexicographical_compare (const unsigned char *first1, const unsigned char *last1, const unsigned char *first2, const unsigned char *last2)
bool	std::lexicographical_compare (const char *first1, const char *last1, const char *first2, const char *last2)

---

Detailed Description

This is an internal header file, included by other library headers. You should not attempt to use it directly.

Definition in file stl_algobase.h.

---