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

#include <CGAL/circulator.h>
#include <vector>
#include <map>
#include <boost/type_traits.hpp>
#include <CGAL/tuple.h>

Include dependency graph for iterator.h:

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

Go to the source code of this file.

Classes
struct	Emptyset_iterator
class	Insert_iterator< Container >
class	Oneset_iterator< T >
class	Const_oneset_iterator< T >
class	Counting_output_iterator
class	Counting_iterator< I, Val >
class	N_step_adaptor< I, N, Ref, Ptr, Val, Dist, Ctg >
class	N_step_adaptor_derived< I, N >
struct	Filter_iterator< I, P >
class	Join_input_iterator_1< I1, Op >
class	Join_input_iterator_2< I1, I2, Op >
class	Join_input_iterator_3< I1, I2, I3, Op >
class	Inverse_index< IC >
class	Random_access_adaptor< IC >
class	Random_access_value_adaptor< IC, T >
class	Filter_output_iterator< _Iterator, Predicate >
struct	CGALi::Derivator< D, V, O >
struct	CGALi::Derivator< D, cpp0x::tuple< V1, V...>, cpp0x::tuple< O1, O...> >
class	Dispatch_output_iterator< cpp0x::tuple< V...>, cpp0x::tuple< O...> >
class	Dispatch_or_drop_output_iterator< cpp0x::tuple< V...>, cpp0x::tuple< O...> >
Namespaces
namespace	CGALi
Functions
template<class Container >
Insert_iterator< Container >	inserter (Container &x)
template<class I , int N, class Ref , class Ptr , class Val , class Dist , class Ctg >
N_step_adaptor< I, N, Ref, Ptr, Val, Dist, Ctg >	operator+ (typename N_step_adaptor< I, N, Ref, Ptr, Val, Dist, Ctg >::difference_type n, N_step_adaptor< I, N, Ref, Ptr, Val, Dist, Ctg > i)
template<class I , int N>
N_step_adaptor_derived< I, N >	operator+ (typename N_step_adaptor_derived< I, N >::difference_type n, N_step_adaptor_derived< I, N > i)
template<class I , class P >
bool	operator== (const Filter_iterator< I, P > &, const Filter_iterator< I, P > &)
template<class I , class P >
Filter_iterator< I, P >	filter_iterator (I e, const P &p)
template<class I , class P >
Filter_iterator< I, P >	filter_iterator (I e, const P &p, I c)
template<class I , class P >
bool	operator!= (const Filter_iterator< I, P > &it1, const Filter_iterator< I, P > &it2)
template<class I , class P >
Filter_output_iterator< I, P >	filter_output_iterator (I e, const P &p)
template<typename... V, typename... O>
Dispatch_output_iterator < cpp0x::tuple< V...> , cpp0x::tuple< O...> >	dispatch_output (O...o)
template<typename... V, typename... O>
Dispatch_or_drop_output_iterator < cpp0x::tuple< V...> , cpp0x::tuple< O...> >	dispatch_or_drop_output (O...o)

---

Function Documentation

template<typename... V, typename... O>

Dispatch_or_drop_output_iterator<cpp0x::tuple<V...>, cpp0x::tuple<O...> > dispatch_or_drop_output

(

O...

o

)

[inline]

template<typename... V, typename... O>

Dispatch_output_iterator<cpp0x::tuple<V...>, cpp0x::tuple<O...> > dispatch_output

(

O...

o

)

template<class I , class P >

Filter_iterator< I, P > filter_iterator	(	I	e,
		const P &	p
	)		[inline]

Here is the caller graph for this function:

template<class I , class P >

Filter_iterator< I, P > filter_iterator	(	I	e,
		const P &	p,
		I	c
	)		[inline]

template<class I , class P >

Filter_output_iterator< I, P > filter_output_iterator	(	I	e,
		const P &	p
	)		[inline]

Here is the caller graph for this function:

template<class Container >

Insert_iterator<Container> inserter

(

Container &

x

)

[inline]

Here is the caller graph for this function:

template<class I , class P >

bool operator!=	(	const Filter_iterator< I, P > &	it1,
		const Filter_iterator< I, P > &	it2
	)		[inline]

template<class I , int N, class Ref , class Ptr , class Val , class Dist , class Ctg >

N_step_adaptor<I,N,Ref,Ptr,Val,Dist,Ctg> operator+	(	typename N_step_adaptor< I, N, Ref, Ptr, Val, Dist, Ctg >::difference_type	n,
		N_step_adaptor< I, N, Ref, Ptr, Val, Dist, Ctg >	i
	)		[inline]

template<class I , int N>

N_step_adaptor_derived<I,N> operator+	(	typename N_step_adaptor_derived< I, N >::difference_type	n,
		N_step_adaptor_derived< I, N >	i
	)		[inline]

template<class I , class P >

bool operator==	(	const Filter_iterator< I, P > &	it1,
		const Filter_iterator< I, P > &	it2
	)		[inline]

Here is the call graph for this function: