SPAR/AIModule/BWTA/vendors/CGAL/CGAL/algorithm.h File Reference

#include <CGAL/basic.h>
#include <algorithm>
#include <iosfwd>

Include dependency graph for algorithm.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
template<class InputIterator , class Size , class OutputIterator >
CGAL_BEGIN_NAMESPACE OutputIterator	copy_n (InputIterator first, Size n, OutputIterator result)
template<class T >
bool	are_sorted (const T &a, const T &b, const T &c)
template<class T , class Compare >
bool	are_sorted (const T &a, const T &b, const T &c, Compare cmp)
template<class T >
bool	are_strictly_sorted (const T &a, const T &b, const T &c)
template<class T , class Compare >
bool	are_strictly_sorted (const T &a, const T &b, const T &c, Compare cmp)
template<class T >
bool	are_ordered (const T &a, const T &b, const T &c)
template<class T , class Compare >
bool	are_ordered (const T &a, const T &b, const T &c, Compare cmp)
template<class T >
bool	are_strictly_ordered (const T &a, const T &b, const T &c)
template<class T , class Compare >
bool	are_strictly_ordered (const T &a, const T &b, const T &c, Compare cmp)
template<class ForwardIterator >
ForwardIterator	successor (ForwardIterator it)
template<class BidirectionalIterator >
BidirectionalIterator	predecessor (BidirectionalIterator it)
template<class ForwardIterator >
std::pair< ForwardIterator, ForwardIterator >	min_max_element (ForwardIterator first, ForwardIterator last)
template<class ForwardIterator , class CompareMin , class CompareMax >
std::pair< ForwardIterator, ForwardIterator >	min_max_element (ForwardIterator first, ForwardIterator last, CompareMin comp_min, CompareMax comp_max)
template<class ForwardIterator , class Predicate >
ForwardIterator	min_element_if (ForwardIterator first, ForwardIterator last, Predicate pred)
template<class ForwardIterator , class Compare , class Predicate >
ForwardIterator	min_element_if (ForwardIterator first, ForwardIterator last, Compare comp, Predicate pred)
template<class ForwardIterator , class Predicate >
ForwardIterator	max_element_if (ForwardIterator first, ForwardIterator last, Predicate pred)
template<class ForwardIterator , class Compare , class Predicate >
ForwardIterator	max_element_if (ForwardIterator first, ForwardIterator last, Compare comp, Predicate pred)
template<class InputIterator1 , class InputIterator2 , class BinaryFunction >
CGAL::Comparison_result	lexicographical_compare_three_valued (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, BinaryFunction cmp)
	lexicographic comparison of the two ranges using the cmp function object.
template<class InputIterator >
std::ostream &	output_range (std::ostream &os, InputIterator first, InputIterator beyond, const char *sep=", ", const char *pre="", const char *post="")
	output iterator range to a stream, with separators

---

Function Documentation

template<class T >

bool are_ordered	(	const T &	a,
		const T &	b,
		const T &	c
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class T , class Compare >

bool are_ordered	(	const T &	a,
		const T &	b,
		const T &	c,
		Compare	cmp
	)		[inline]

Here is the call graph for this function:

template<class T >

bool are_sorted	(	const T &	a,
		const T &	b,
		const T &	c
	)		[inline]

template<class T , class Compare >

bool are_sorted	(	const T &	a,
		const T &	b,
		const T &	c,
		Compare	cmp
	)		[inline]

Here is the call graph for this function:

template<class T >

bool are_strictly_ordered	(	const T &	a,
		const T &	b,
		const T &	c
	)		[inline]

Here is the call graph for this function:

template<class T , class Compare >

bool are_strictly_ordered	(	const T &	a,
		const T &	b,
		const T &	c,
		Compare	cmp
	)		[inline]

Here is the call graph for this function:

template<class T >

bool are_strictly_sorted	(	const T &	a,
		const T &	b,
		const T &	c
	)		[inline]

template<class T , class Compare >

bool are_strictly_sorted	(	const T &	a,
		const T &	b,
		const T &	c,
		Compare	cmp
	)		[inline]

Here is the call graph for this function:

template<class InputIterator , class Size , class OutputIterator >

CGAL_BEGIN_NAMESPACE OutputIterator copy_n	(	InputIterator	first,
		Size	n,
		OutputIterator	result
	)

Here is the caller graph for this function:

template<class InputIterator1 , class InputIterator2 , class BinaryFunction >

CGAL::Comparison_result lexicographical_compare_three_valued	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		BinaryFunction	cmp
	)

lexicographic comparison of the two ranges using the cmp function object.

Compares the two ranges [first1,last1) and [first2,last2) lexicographically and returns one of the CGAL::Comparison_result enum values respectively:

• CGAL::SMALLER
• CGAL::EQUAL
• CGAL::LARGER

Precondition:

The value_type of InputIterator1 must be convertible to the first_argument_type of BinaryFunction. The value_type of InputIterator2 must be convertible to the second_argument_type of BinaryFunction. The result_type of BinaryFunction must be convertible to CGAL::Comparison_result.

Here is the call graph for this function:

template<class ForwardIterator , class Predicate >

ForwardIterator max_element_if	(	ForwardIterator	first,
		ForwardIterator	last,
		Predicate	pred
	)

Here is the caller graph for this function:

template<class ForwardIterator , class Compare , class Predicate >

ForwardIterator max_element_if	(	ForwardIterator	first,
		ForwardIterator	last,
		Compare	comp,
		Predicate	pred
	)

template<class ForwardIterator , class Predicate >

ForwardIterator min_element_if	(	ForwardIterator	first,
		ForwardIterator	last,
		Predicate	pred
	)

Here is the caller graph for this function:

template<class ForwardIterator , class Compare , class Predicate >

ForwardIterator min_element_if	(	ForwardIterator	first,
		ForwardIterator	last,
		Compare	comp,
		Predicate	pred
	)

template<class ForwardIterator >

std::pair< ForwardIterator, ForwardIterator > min_max_element	(	ForwardIterator	first,
		ForwardIterator	last
	)

Here is the caller graph for this function:

template<class ForwardIterator , class CompareMin , class CompareMax >

std::pair< ForwardIterator, ForwardIterator > min_max_element	(	ForwardIterator	first,
		ForwardIterator	last,
		CompareMin	comp_min,
		CompareMax	comp_max
	)

template<class InputIterator >

std::ostream& output_range	(	std::ostream &	os,
		InputIterator	first,
		InputIterator	beyond,
		const char *	sep = ", ",
		const char *	pre = "",
		const char *	post = ""
	)

output iterator range to a stream, with separators

The iterator range [first,beyond) is written to os (obeying CGAL I/O modes). Each element is bracketed by pre and post (default: empty string). Adjacent values are spearated by sep (default: ", ", i.e. comma space). The stream os is returned in its new state after output.

Example:

    int a[] = {1, 2, 3};
    output_range(std::cout, a, a+3, ":", "(", ")");

produces (1):(2):(3)

Here is the call graph for this function:

template<class BidirectionalIterator >

BidirectionalIterator predecessor

(

BidirectionalIterator

it

)

[inline]

Here is the caller graph for this function:

template<class ForwardIterator >

ForwardIterator successor

(

ForwardIterator

it

)

[inline]

Here is the caller graph for this function: