mln::util Namespace Reference

Namespace of tools using for more complex algorithm. More...

Classes
class	adjacency_matrix
	A class of adjacency matrix. More...
class	array
	A dynamic array class. More...
class	branch
	Class of generic branch. More...
class	branch_iter
	Basic 2D image class. More...
class	branch_iter_ind
	Basic 2D image class. More...
class	couple
	Definition of a couple. More...
struct	eat
	Eat structure. More...
class	edge
	Edge of a graph G. More...
class	fibonacci_heap
	Fibonacci heap. More...
class	graph
	Undirected graph. More...
class	greater_point
	A ``greater than'' functor comparing points w.r.t. More...
class	greater_psite
	A ``greater than'' functor comparing psites w.r.t. More...
class	head
	Top structure of the soft heap. More...
struct	ignore
	Ignore structure. More...
struct	ilcell
	Element of an item list. Store the data (key) used in soft_heap. More...
class	line_graph
	Undirected line graph of a graph of type G. More...
struct	nil
	Nil structure. More...
class	node
	Meta-data of an element in the heap. More...
class	object_id
	Base class of an object id. More...
struct	ord
	Function-object that defines an ordering between objects with type T: lhs R rhs. More...
struct	ord_pair
	Ordered pair structure s.a. More...
struct	pix
	Structure pix. More...
class	set
	An "efficient" mathematical set class. More...
class	site_pair
	A pair of sites. More...
class	soft_heap
	Soft heap. More...
class	timer
	Timer structure. More...
struct	tracked_ptr
	Smart pointer for shared data with tracking. More...
class	tree
	Class of generic tree. More...
class	tree_node
	Class of generic tree_node for tree. More...
class	vertex
	Vertex of a graph G. More...
struct	yes
	Object that always says "yes". More...
Namespaces
namespace	impl
	Implementation namespace of util namespace.
Typedefs
typedef object_id< vertex_tag, unsigned >	vertex_id_t
	Vertex id type.
Functions
template<typename I, typename J>
void	display_branch (const Image< J > &ima_, tree_node< I > *tree_node)
	Display an arborescence from tree_node.
template<typename I, typename J>
void	display_tree (const Image< J > &ima_, tree< I > &tree)
	Display a tree.
template<typename I>
I::psite	lemmings (const Image< I > &ima, const typename I::psite &pt, const typename I::psite::delta &dpt, const typename I::value &val)
	Launch a lemmings on an image.
template<typename I>
greater_point< I >	make_greater_point (const Image< I > &ima)
	Helper to build a mln::util::greater_point.
template<typename I>
greater_psite< I >	make_greater_psite (const Image< I > &ima)
	Helper to build a mln::util::greater_psite.
template<typename G>
bool	operator< (const vertex< G > &lhs, const vertex< G > &rhs)
	Less operator. Test whether lhs.id() < rhs.id().
template<typename G>
std::ostream &	operator<< (std::ostream &ostr, const vertex< G > &v)
	Push the vertex v in the output stream ostr.
template<typename T>
std::ostream &	operator<< (std::ostream &ostr, const array< T > &a)
	Operator<<.
template<typename G>
bool	operator== (const vertex< G > &v1, const vertex< G > &v2)
	Equality operator.
template<typename T>
bool	operator== (const array< T > &lhs, const array< T > &rhs)
	Operator==.
template<typename T>
bool	ord_strict (const T &lhs, const T &rhs)
	Routine to test if lhs is strictly "less-than" rhs.
template<typename T>
bool	ord_weak (const T &lhs, const T &rhs)
	Routine to test if lhs is "less-than or equal-to" rhs.
template<typename T, typename I>
void	tree_fast_to_image (tree_fast< T > &tree, Image< I > &output_)
template<typename T>
tree_fast< T >	tree_to_fast (tree< T > &input)
	Facade.
template<typename T, typename I>
void	tree_to_image (tree< T > &tree, Image< I > &output_)
	Convert a tree into an image.

---

Detailed Description

Namespace of tools using for more complex algorithm.

Forward declaration.

---

Typedef Documentation

typedef object_id<vertex_tag, unsigned> mln::util::vertex_id_t

Vertex id type.

---

Function Documentation

template<typename I, typename J>

void mln::util::display_branch	(	const Image< J > &	ima_,
		tree_node< I > *	tree_node
	)			[inline]

Display an arborescence from tree_node.

Parameters:

[in]	ima_	The domain of output image.
[in]	tree_node	The root tree_node to display.

References mln::data::fill().

template<typename I, typename J>

void mln::util::display_tree	(	const Image< J > &	ima_,
		tree< I > &	tree
	)			[inline]

Display a tree.

Parameters:

[in]	ima_	The domain of output image.
[in]	tree	The tree to display.

References mln::util::tree< T >::root().

template<typename I>

I::psite mln::util::lemmings	(	const Image< I > &	ima,
		const typename I::psite &	pt,
		const typename I::psite::delta &	dpt,
		const typename I::value &	val
	)			[inline]

Launch a lemmings on an image.

A lemmings is the point pt that you put on an image ima . This point will move through the image using the delta-point dpt while consider his value on the given image.

Returns:

The first point that is not in the domain domain or which value on the given image is different to the value val.

Precondition:

The domain domain must be contained in the domain of ima.

template<typename I>

greater_point< I > mln::util::make_greater_point

(

const Image< I > &

ima

)

[inline]

Helper to build a mln::util::greater_point.

References make_greater_point().

Referenced by make_greater_point().

template<typename I>

greater_psite< I > mln::util::make_greater_psite

(

const Image< I > &

ima

)

[inline]

Helper to build a mln::util::greater_psite.

References make_greater_psite().

Referenced by make_greater_psite().

template<typename G>

bool mln::util::operator<	(	const vertex< G > &	lhs,
		const vertex< G > &	rhs
	)			[inline]

Less operator. Test whether lhs.id() < rhs.id().

template<typename G>

std::ostream & mln::util::operator<<	(	std::ostream &	ostr,
		const vertex< G > &	v
	)			[inline]

Push the vertex v in the output stream ostr.

template<typename T>

std::ostream & mln::util::operator<<	(	std::ostream &	ostr,
		const array< T > &	a
	)			[inline]

Operator<<.

References mln::util::array< T >::nelements().

template<typename G>

bool mln::util::operator==	(	const vertex< G > &	v1,
		const vertex< G > &	v2
	)			[inline]

Equality operator.

Test whether two vertices have the same id.

References mln::util::vertex< G >::graph(), and mln::util::vertex< G >::id().

template<typename T>

bool mln::util::operator==	(	const array< T > &	lhs,
		const array< T > &	rhs
	)			[inline]

Operator==.

References mln::util::array< T >::std_vector().

template<typename T>

bool mln::util::ord_strict	(	const T &	lhs,
		const T &	rhs
	)			[inline]

Routine to test if lhs is strictly "less-than" rhs.

References ord_strict().

Referenced by mln::util::ord_pair< T >::change_both(), mln::util::ord_pair< T >::change_first(), mln::util::ord_pair< T >::change_second(), and ord_strict().

template<typename T>

bool mln::util::ord_weak	(	const T &	lhs,
		const T &	rhs
	)			[inline]

Routine to test if lhs is "less-than or equal-to" rhs.

References ord_weak().

Referenced by mln::util::ord_pair< T >::change_both(), mln::util::ord_pair< T >::change_first(), mln::util::ord_pair< T >::change_second(), mln::box< P >::is_valid(), and ord_weak().

template<typename T, typename I>

void mln::util::tree_fast_to_image	(	tree_fast< T > &	tree,
		Image< I > &	output_
	)			[inline]

Convert a tree_fast into an image.

Parameters:

[in]	tree	The tree to convert.
[out]	output_	The image containing tree informations.

References mln::util::impl::tree_fast_to_image().

Referenced by tree_fast_to_image().

template<typename T>

tree_fast< T > mln::util::tree_to_fast

(

tree< T > &

input

)

[inline]

Facade.

Convert a tree into an tree_fast.

Parameters:

[in]

input

The tree to convert.

Returns:

The tree_fast containing tree informations.

References mln::util::tree< T >::root().

template<typename T, typename I>

void mln::util::tree_to_image	(	tree< T > &	tree,
		Image< I > &	output_
	)			[inline]

Convert a tree into an image.

Parameters:

[in]	tree	The tree to convert.
[out]	output_	The image containing tree information.