algorithm.h File Reference

Go to the source code of this file.

Classes
struct	std::__copy_backward< T, A >
struct	std::__copy_backward< T, true >

Namespaces
namespace	std

Functions
template<class ForwardIterator , class T , typename Predicate >
ForwardIterator	std::lower_bound (ForwardIterator first, ForwardIterator last, const T &val, Predicate p)
template<class ForwardIterator , class T >
ForwardIterator	std::lower_bound (ForwardIterator first, ForwardIterator last, const T &val)
template<class ForwardIterator , class T , class Predicate >
ForwardIterator	std::upper_bound (ForwardIterator first, ForwardIterator last, const T &val, Predicate p)
template<class InputIt , class UnaryPredicate >
InputIt	std::find_if (InputIt first, InputIt last, UnaryPredicate p)
template<class ForwardIterator , class T >
ForwardIterator	std::find (ForwardIterator first, ForwardIterator last, T &val)
template<class ForwardIt , class T >
void	std::fill (ForwardIt first, ForwardIt last, const T &value)
template<class InputIt , class OutputIt >
OutputIt	std::copy (InputIt first, InputIt last, OutputIt d_first)
template<class BidirectionalIterator1 , class BidirectionalIterator2 >
BidirectionalIterator2	std::copy_backward (BidirectionalIterator1 first, BidirectionalIterator1 last, BidirectionalIterator2 result)
template<class T >
T *	std::copy_backward (T *first, T *last, T *result)