Classes
struct	Median
struct	Median_with_sorting
struct	Rand
class	RandomGeneratorInterval
struct	Power_natural
Enumerations
enum	Assumptions_exact_matches { no_check, do_check }
Functions
template<typename Out , typename It >
Out	median (const It beg, const It end)
template<typename It >
double	median (const It beg, const It end)
template<typename Out , typename It >
Out	median_with_sorting (const It beg, const It end)
template<typename It >
double	median_with_sorting (const It beg, const It end)
template<class C >
C::difference_type	exact_matches (const C &a, const C &b, Assumptions_exact_matches check=no_check)
template<class C >
C::difference_type	matching_values (const C &pattern, C test)
template<typename T , typename R >
T	adopt_rand (T max, R &f)
template<typename T >
T	adopt_rand (T max)
template<typename InputIterator , typename Size , typename OutputIterator >
OutputIterator	copy_n (InputIterator first1, Size count, OutputIterator first2)
template<typename BidirectionalIterator1 , typename Size , typename BidirectionalIterator2 >
BidirectionalIterator2	copy_backward_n (BidirectionalIterator1 last1, Size count, BidirectionalIterator2 last2)
template<typename InputIterator , typename MultiPassInputIterator , class Predicate >
void	pair2_find_if (InputIterator begin1, const InputIterator end1, const MultiPassInputIterator begin2, const MultiPassInputIterator end2)
template<typename InputIterator , typename MultiPassInputIterator , class Predicate >
std::pair< InputIterator, MultiPassInputIterator >	pair2_find_if (InputIterator begin1, const InputIterator end1, const MultiPassInputIterator begin2, const MultiPassInputIterator end2, Predicate pred)
template<typename MultiPassInputIterator , class Predicate >
void	pair1_find_if (const MultiPassInputIterator begin, const MultiPassInputIterator end)
template<typename MultiPassInputIterator , class Predicate >
std::pair < MultiPassInputIterator, MultiPassInputIterator >	pair1_find_if (const MultiPassInputIterator begin, const MultiPassInputIterator end, Predicate pred)
template<typename MultiPassInputIterator , class Predicate >
void	pair1_nonself_find_if (const MultiPassInputIterator begin, const MultiPassInputIterator end)
template<typename MultiPassInputIterator , class Predicate >
std::pair < MultiPassInputIterator, MultiPassInputIterator >	pair1_nonself_find_if (const MultiPassInputIterator begin, const MultiPassInputIterator end, Predicate pred)
template<typename MultiPassInputIterator , class Predicate >
void	pair1_symmpred_find_if (const MultiPassInputIterator begin, const MultiPassInputIterator end)
template<typename MultiPassInputIterator , class Predicate >
std::pair < MultiPassInputIterator, MultiPassInputIterator >	pair1_symmpred_find_if (const MultiPassInputIterator begin, const MultiPassInputIterator end, Predicate pred)
template<typename MultiPassInputIterator , class Predicate >
void	pair1_symmpred_nonself_find_if (const MultiPassInputIterator begin, const MultiPassInputIterator end)
template<typename MultiPassInputIterator , class Predicate >
std::pair < MultiPassInputIterator, MultiPassInputIterator >	pair1_symmpred_nonself_find_if (const MultiPassInputIterator begin, const MultiPassInputIterator end, Predicate pred)
template<typename MultiplicativeMonoid , typename Int >
MultiplicativeMonoid	power_natural (const MultiplicativeMonoid basis, const Int exponent)

Enumeration Type Documentation

enum Algorithms::Assumptions_exact_matches

Enumerator:

no_check
do_check

Definition at line 167 of file Algorithms.hpp.

Function Documentation

template<typename T , typename R >

T Algorithms::adopt_rand	(	T	max,
		R &	f
	)		`[inline]`

Definition at line 212 of file Algorithms.hpp.

References T.

template<typename T >

T Algorithms::adopt_rand ( T max )

Definition at line 220 of file Algorithms.hpp.

References T.

template<typename BidirectionalIterator1 , typename Size , typename BidirectionalIterator2 >

BidirectionalIterator2 Algorithms::copy_backward_n	(	BidirectionalIterator1	last1,
		Size	count,
		BidirectionalIterator2	last2
	)

Definition at line 266 of file Algorithms.hpp.

template<typename InputIterator , typename Size , typename OutputIterator >

OutputIterator Algorithms::copy_n	(	InputIterator	first1,
		Size	count,
		OutputIterator	first2
	)

Definition at line 258 of file Algorithms.hpp.

template<class C >

C::difference_type Algorithms::exact_matches	(	const C &	a,
		const C &	b,
		Assumptions_exact_matches	check = `no_check`
	)		`[inline]`

Definition at line 170 of file Algorithms.hpp.

References do_check.

template<class C >

C::difference_type Algorithms::matching_values	(	const C &	pattern,
		C	test
	)		`[inline]`

Definition at line 180 of file Algorithms.hpp.

template<typename Out , typename It >

Out Algorithms::median	(	const It	beg,
		const It	end
	)		`[inline]`

Definition at line 114 of file Algorithms.hpp.

template<typename It >

double Algorithms::median	(	const It	beg,
		const It	end
	)		`[inline]`

Definition at line 118 of file Algorithms.hpp.

template<typename Out , typename It >

Out Algorithms::median_with_sorting	(	const It	beg,
		const It	end
	)		`[inline]`

Definition at line 149 of file Algorithms.hpp.

template<typename It >

double Algorithms::median_with_sorting	(	const It	beg,
		const It	end
	)		`[inline]`

Definition at line 153 of file Algorithms.hpp.