stl_algobase.h File Reference

#include <bits/c++config.h>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cstddef>
#include <iosfwd>
#include <bits/stl_pair.h>
#include <bits/cpp_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
Classes
struct	std::__iter_swap< _BoolType >
struct	std::__iter_swap< true >
struct	std::__copy<, >
struct	std::__copy< _BoolType, random_access_iterator_tag >
struct	std::__copy< true, random_access_iterator_tag >
struct	std::__copy_normal<, >
struct	std::__copy_normal< true, false >
struct	std::__copy_normal< false, true >
struct	std::__copy_normal< true, true >
struct	std::__copy_backward<, >
struct	std::__copy_backward< _BoolType, random_access_iterator_tag >
struct	std::__copy_backward< true, random_access_iterator_tag >
struct	std::__copy_backward_normal<, >
struct	std::__copy_backward_normal< true, false >
struct	std::__copy_backward_normal< false, true >
struct	std::__copy_backward_normal< true, true >
struct	std::__fill<>
struct	std::__fill< true >
struct	std::__fill_n<>
struct	std::__fill_n< true >
Defines
#define	_ALGOBASE_H   1
Functions
template<typename _Tp>
void	std::swap (_Tp &__a, _Tp &__b)
	Swaps two values.
template<typename _ForwardIterator1, typename _ForwardIterator2>
void	std::iter_swap (_ForwardIterator1 __a, _ForwardIterator2 __b)
	Swaps the contents of two iterators.
template<typename _Tp>
const _Tp &	std::min (const _Tp &__a, const _Tp &__b)
	This does what you think it does.
template<typename _Tp>
const _Tp &	std::max (const _Tp &__a, const _Tp &__b)
	This does what you think it does.
template<typename _Tp, typename _Compare>
const _Tp &	std::min (const _Tp &__a, const _Tp &__b, _Compare __comp)
	This does what you think it does.
template<typename _Tp, typename _Compare>
const _Tp &	std::max (const _Tp &__a, const _Tp &__b, _Compare __comp)
	This does what you think it does.
template<typename _II, typename _OI>
_OI	std::__copy_aux (_II __first, _II __last, _OI __result)
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_aux (_BI1 __first, _BI1 __last, _BI2 __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 _Tp>
void	std::fill (_ForwardIterator __first, _ForwardIterator __last, const _Tp &__value)
	Fills the range [first,last) 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 _OutputIterator, typename _Size, typename _Tp>
_OutputIterator	std::fill_n (_OutputIterator __first, _Size __n, const _Tp &__value)
	Fills the range [first,first+n) with copies of value.
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.

---

Define Documentation

#define _ALGOBASE_H   1

Definition at line 62 of file stl_algobase.h.

---