\hypertarget{a02752}{
\section{mln::util Namespace Reference}
\label{dc/d3d/a02752}\index{mln::util@{mln::util}}
}


Namespace of tools using for more complex algorithm.  


\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
namespace \hyperlink{a02753}{impl}


\begin{DoxyCompactList}\small\item\em Implementation namespace of util namespace. \item\end{DoxyCompactList}

\end{DoxyCompactItemize}
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \hyperlink{a00388}{adjacency\_\-matrix}
\begin{DoxyCompactList}\small\item\em A class of adjacency matrix. \item\end{DoxyCompactList}\item 
class \hyperlink{a00027}{array}
\begin{DoxyCompactList}\small\item\em A dynamic array class. \item\end{DoxyCompactList}\item 
class \hyperlink{a00389}{branch}
\begin{DoxyCompactList}\small\item\em Class of generic branch. \item\end{DoxyCompactList}\item 
class \hyperlink{a00390}{branch\_\-iter}
\begin{DoxyCompactList}\small\item\em Basic 2D image class. \item\end{DoxyCompactList}\item 
class \hyperlink{a00391}{branch\_\-iter\_\-ind}
\begin{DoxyCompactList}\small\item\em Basic 2D image class. \item\end{DoxyCompactList}\item 
class \hyperlink{a00392}{couple}
\begin{DoxyCompactList}\small\item\em Definition of a couple. \item\end{DoxyCompactList}\item 
struct \hyperlink{a00393}{eat}
\begin{DoxyCompactList}\small\item\em Eat structure. \item\end{DoxyCompactList}\item 
class \hyperlink{a00394}{edge}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00183}{Edge} of a graph {\ttfamily G}. \item\end{DoxyCompactList}\item 
class \hyperlink{a00395}{fibonacci\_\-heap}
\begin{DoxyCompactList}\small\item\em Fibonacci heap. \item\end{DoxyCompactList}\item 
class \hyperlink{a00396}{graph}
\begin{DoxyCompactList}\small\item\em Undirected graph. \item\end{DoxyCompactList}\item 
class \hyperlink{a00397}{greater\_\-point}
\begin{DoxyCompactList}\small\item\em A ``greater than'' functor comparing points w.r.t. \item\end{DoxyCompactList}\item 
class \hyperlink{a00398}{greater\_\-psite}
\begin{DoxyCompactList}\small\item\em A ``greater than'' functor comparing psites w.r.t. \item\end{DoxyCompactList}\item 
class \hyperlink{a00399}{head}
\begin{DoxyCompactList}\small\item\em Top structure of the soft heap. \item\end{DoxyCompactList}\item 
struct \hyperlink{a00400}{ignore}
\begin{DoxyCompactList}\small\item\em Ignore structure. \item\end{DoxyCompactList}\item 
struct \hyperlink{a00401}{ilcell}
\begin{DoxyCompactList}\small\item\em Element of an item list. Store the data (key) used in \hyperlink{a00411}{soft\_\-heap}. \item\end{DoxyCompactList}\item 
class \hyperlink{a00402}{line\_\-graph}
\begin{DoxyCompactList}\small\item\em Undirected line graph of a graph of type {\ttfamily G}. \item\end{DoxyCompactList}\item 
struct \hyperlink{a00403}{nil}
\begin{DoxyCompactList}\small\item\em Nil structure. \item\end{DoxyCompactList}\item 
class \hyperlink{a00404}{node}
\begin{DoxyCompactList}\small\item\em Meta-\/data of an element in the heap. \item\end{DoxyCompactList}\item 
class \hyperlink{a00405}{object\_\-id}
\begin{DoxyCompactList}\small\item\em Base class of an object id. \item\end{DoxyCompactList}\item 
struct \hyperlink{a00406}{ord}
\begin{DoxyCompactList}\small\item\em Function-\/object that defines an ordering between objects with type {\ttfamily T:} {\itshape lhs\/} R {\itshape rhs\/}. \item\end{DoxyCompactList}\item 
struct \hyperlink{a00407}{ord\_\-pair}
\begin{DoxyCompactList}\small\item\em Ordered pair structure s.a. \item\end{DoxyCompactList}\item 
struct \hyperlink{a00408}{pix}
\begin{DoxyCompactList}\small\item\em Structure pix. \item\end{DoxyCompactList}\item 
class \hyperlink{a00409}{set}
\begin{DoxyCompactList}\small\item\em An \char`\"{}efficient\char`\"{} mathematical set class. \item\end{DoxyCompactList}\item 
class \hyperlink{a00410}{site\_\-pair}
\begin{DoxyCompactList}\small\item\em A pair of sites. \item\end{DoxyCompactList}\item 
class \hyperlink{a00411}{soft\_\-heap}
\begin{DoxyCompactList}\small\item\em Soft heap. \item\end{DoxyCompactList}\item 
class \hyperlink{a00412}{timer}
\begin{DoxyCompactList}\small\item\em Timer structure. \item\end{DoxyCompactList}\item 
struct \hyperlink{a00413}{tracked\_\-ptr}
\begin{DoxyCompactList}\small\item\em Smart pointer for shared data with tracking. \item\end{DoxyCompactList}\item 
class \hyperlink{a00414}{tree}
\begin{DoxyCompactList}\small\item\em Class of generic tree. \item\end{DoxyCompactList}\item 
class \hyperlink{a00415}{tree\_\-node}
\begin{DoxyCompactList}\small\item\em Class of generic \hyperlink{a00415}{tree\_\-node} for tree. \item\end{DoxyCompactList}\item 
class \hyperlink{a00416}{vertex}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00439}{Vertex} of a graph {\ttfamily G}. \item\end{DoxyCompactList}\item 
struct \hyperlink{a00417}{yes}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00298}{Object} that always says \char`\"{}yes\char`\"{}. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Typedefs}
\begin{DoxyCompactItemize}
\item 
typedef \hyperlink{a00405}{object\_\-id}$<$ vertex\_\-tag, unsigned $>$ \hyperlink{a02752_ad7d7dfd70aae4e1b86a376f74ce2ff75}{vertex\_\-id\_\-t}
\begin{DoxyCompactList}\small\item\em \hyperlink{a00439}{Vertex} id type. \item\end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename I , typename J $>$ }\\void \hyperlink{a02752_ae9769b5f8f9ab8462b088fc5e98f67ef}{display\_\-branch} (const \hyperlink{a00044}{Image}$<$ J $>$ \&ima\_\-, \hyperlink{a00415}{tree\_\-node}$<$ I $>$ $\ast$\hyperlink{a00415}{tree\_\-node})
\begin{DoxyCompactList}\small\item\em Display an arborescence from {\ttfamily \hyperlink{a00415}{tree\_\-node}}. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename I , typename J $>$ }\\void \hyperlink{a02752_a27faca8ddb62f87d6746a35c19dcedcb}{display\_\-tree} (const \hyperlink{a00044}{Image}$<$ J $>$ \&ima\_\-, \hyperlink{a00414}{tree}$<$ I $>$ \&\hyperlink{a00414}{tree})
\begin{DoxyCompactList}\small\item\em Display a tree. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename I $>$ }\\I::psite \hyperlink{a02752_a4aa6ccda0a4a30def0370e94d6e0940d}{lemmings} (const \hyperlink{a00044}{Image}$<$ I $>$ \&ima, const typename I::psite \&pt, const typename I::psite::delta \&dpt, const typename I::value \&val)
\begin{DoxyCompactList}\small\item\em Launch a lemmings on an image. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename I $>$ }\\\hyperlink{a00397}{greater\_\-point}$<$ I $>$ \hyperlink{a02752_a8f82e7a538b5f1f515a8ffd6d2958e2e}{make\_\-greater\_\-point} (const \hyperlink{a00044}{Image}$<$ I $>$ \&ima)
\begin{DoxyCompactList}\small\item\em Helper to build a \hyperlink{a00397}{mln::util::greater\_\-point}. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename I $>$ }\\\hyperlink{a00398}{greater\_\-psite}$<$ I $>$ \hyperlink{a02752_a9fa8d39e525103378128c0aec5836d4e}{make\_\-greater\_\-psite} (const \hyperlink{a00044}{Image}$<$ I $>$ \&ima)
\begin{DoxyCompactList}\small\item\em Helper to build a \hyperlink{a00398}{mln::util::greater\_\-psite}. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename G $>$ }\\bool \hyperlink{a02752_ad78b6d2c06d732fd3c0234171e2cfc1d}{operator$<$} (const \hyperlink{a00416}{vertex}$<$ G $>$ \&lhs, const \hyperlink{a00416}{vertex}$<$ G $>$ \&rhs)
\begin{DoxyCompactList}\small\item\em Less operator. Test whether lhs.id() $<$ rhs.id(). \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename G $>$ }\\std::ostream \& \hyperlink{a02752_a795d899cef07dd0327f117ef9e306252}{operator$<$$<$} (std::ostream \&ostr, const \hyperlink{a00416}{vertex}$<$ G $>$ \&v)
\begin{DoxyCompactList}\small\item\em Push the vertex {\ttfamily v} in the output stream {\ttfamily ostr}. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\std::ostream \& \hyperlink{a02752_aab2fc15f8b2f35f097c079078934c276}{operator$<$$<$} (std::ostream \&ostr, const \hyperlink{a00027}{array}$<$ T $>$ \&a)
\begin{DoxyCompactList}\small\item\em Operator$<$$<$. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename G $>$ }\\bool \hyperlink{a02752_aad5f26712f8faa294b315e53b4bf6568}{operator==} (const \hyperlink{a00416}{vertex}$<$ G $>$ \&v1, const \hyperlink{a00416}{vertex}$<$ G $>$ \&v2)
\begin{DoxyCompactList}\small\item\em Equality operator. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\bool \hyperlink{a02752_a02f85883ac9b3e9308d049d993fa463b}{operator==} (const \hyperlink{a00027}{array}$<$ T $>$ \&lhs, const \hyperlink{a00027}{array}$<$ T $>$ \&rhs)
\begin{DoxyCompactList}\small\item\em Operator==. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\bool \hyperlink{a02752_a58362a8ec6ca26cb673e384724e7f076}{ord\_\-strict} (const T \&lhs, const T \&rhs)
\begin{DoxyCompactList}\small\item\em Routine to test if {\itshape lhs\/} is strictly \char`\"{}less-\/than\char`\"{} {\itshape rhs\/}. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\bool \hyperlink{a02752_abd5ae8d79193860f9ca3cd5f884366fe}{ord\_\-weak} (const T \&lhs, const T \&rhs)
\begin{DoxyCompactList}\small\item\em Routine to test if {\itshape lhs\/} is \char`\"{}less-\/than or equal-\/to\char`\"{} {\itshape rhs\/}. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename T , typename I $>$ }\\void \hyperlink{a02752_a917f01145d9d95e5458dfa1a96c96675}{tree\_\-fast\_\-to\_\-image} (tree\_\-fast$<$ T $>$ \&\hyperlink{a00414}{tree}, \hyperlink{a00044}{Image}$<$ I $>$ \&output\_\-)
\item 
{\footnotesize template$<$typename T $>$ }\\tree\_\-fast$<$ T $>$ \hyperlink{a02752_a3434e119ba1bcc545e07026d2d9bda2f}{tree\_\-to\_\-fast} (\hyperlink{a00414}{tree}$<$ T $>$ \&input)
\begin{DoxyCompactList}\small\item\em Facade. \item\end{DoxyCompactList}\item 
{\footnotesize template$<$typename T , typename I $>$ }\\void \hyperlink{a02752_a0c6ce8d2ad72bfa364af97713fdbee31}{tree\_\-to\_\-image} (\hyperlink{a00414}{tree}$<$ T $>$ \&\hyperlink{a00414}{tree}, \hyperlink{a00044}{Image}$<$ I $>$ \&output\_\-)
\begin{DoxyCompactList}\small\item\em Convert a tree into an image. \item\end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
Namespace of tools using for more complex algorithm. Forward declaration. 

\subsection{Typedef Documentation}
\hypertarget{a02752_ad7d7dfd70aae4e1b86a376f74ce2ff75}{
\index{mln::util@{mln::util}!vertex\_\-id\_\-t@{vertex\_\-id\_\-t}}
\index{vertex\_\-id\_\-t@{vertex\_\-id\_\-t}!mln::util@{mln::util}}
\subsubsection[{vertex\_\-id\_\-t}]{\setlength{\rightskip}{0pt plus 5cm}typedef {\bf object\_\-id}$<$vertex\_\-tag, unsigned$>$ {\bf mln::util::vertex\_\-id\_\-t}}}
\label{dc/d3d/a02752_ad7d7dfd70aae4e1b86a376f74ce2ff75}


\hyperlink{a00439}{Vertex} id type. 



Definition at line 43 of file graph\_\-ids.hh.



\subsection{Function Documentation}
\hypertarget{a02752_ae9769b5f8f9ab8462b088fc5e98f67ef}{
\index{mln::util@{mln::util}!display\_\-branch@{display\_\-branch}}
\index{display\_\-branch@{display\_\-branch}!mln::util@{mln::util}}
\subsubsection[{display\_\-branch}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename I , typename J $>$ void mln::util::display\_\-branch (
\begin{DoxyParamCaption}
\item[{const Image$<$ J $>$ \&}]{ ima\_\-, }
\item[{tree\_\-node$<$ I $>$ $\ast$}]{ tree\_\-node}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d3d/a02752_ae9769b5f8f9ab8462b088fc5e98f67ef}


Display an arborescence from {\ttfamily \hyperlink{a00415}{tree\_\-node}}. 


\begin{DoxyParams}{Parameters}
\item[\mbox{\tt[in]} {\em ima\_\-}]The domain of output image. \item[\mbox{\tt[in]} {\em \hyperlink{a00415}{tree\_\-node}}]The root \hyperlink{a00415}{tree\_\-node} to display. \end{DoxyParams}


Definition at line 210 of file tree\_\-to\_\-image.hh.



References mln::data::fill().

\hypertarget{a02752_a27faca8ddb62f87d6746a35c19dcedcb}{
\index{mln::util@{mln::util}!display\_\-tree@{display\_\-tree}}
\index{display\_\-tree@{display\_\-tree}!mln::util@{mln::util}}
\subsubsection[{display\_\-tree}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename I , typename J $>$ void mln::util::display\_\-tree (
\begin{DoxyParamCaption}
\item[{const Image$<$ J $>$ \&}]{ ima\_\-, }
\item[{tree$<$ I $>$ \&}]{ tree}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d3d/a02752_a27faca8ddb62f87d6746a35c19dcedcb}


Display a tree. 


\begin{DoxyParams}{Parameters}
\item[\mbox{\tt[in]} {\em ima\_\-}]The domain of output image. \item[\mbox{\tt[in]} {\em tree}]The tree to display. \end{DoxyParams}


Definition at line 192 of file tree\_\-to\_\-image.hh.



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

\hypertarget{a02752_a4aa6ccda0a4a30def0370e94d6e0940d}{
\index{mln::util@{mln::util}!lemmings@{lemmings}}
\index{lemmings@{lemmings}!mln::util@{mln::util}}
\subsubsection[{lemmings}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename I $>$ I::psite mln::util::lemmings (
\begin{DoxyParamCaption}
\item[{const Image$<$ I $>$ \&}]{ ima, }
\item[{const typename I::psite \&}]{ pt, }
\item[{const typename I::psite::delta \&}]{ dpt, }
\item[{const typename I::value \&}]{ val}
\end{DoxyParamCaption}
)}}
\label{dc/d3d/a02752_a4aa6ccda0a4a30def0370e94d6e0940d}


Launch a lemmings on an image. 

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

\begin{DoxyReturn}{Returns}
The first point that is not in the domain {\ttfamily domain} or which value on the given image is different to the value {\ttfamily val}.
\end{DoxyReturn}
\begin{DoxyPrecond}{Precondition}
The domain {\ttfamily domain} must be contained in the domain of {\ttfamily ima}. 
\end{DoxyPrecond}


Definition at line 104 of file lemmings.hh.

\hypertarget{a02752_a8f82e7a538b5f1f515a8ffd6d2958e2e}{
\index{mln::util@{mln::util}!make\_\-greater\_\-point@{make\_\-greater\_\-point}}
\index{make\_\-greater\_\-point@{make\_\-greater\_\-point}!mln::util@{mln::util}}
\subsubsection[{make\_\-greater\_\-point}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename I $>$ {\bf greater\_\-point}$<$ I $>$ mln::util::make\_\-greater\_\-point (
\begin{DoxyParamCaption}
\item[{const Image$<$ I $>$ \&}]{ ima}
\end{DoxyParamCaption}
)}}
\label{dc/d3d/a02752_a8f82e7a538b5f1f515a8ffd6d2958e2e}


Helper to build a \hyperlink{a00397}{mln::util::greater\_\-point}. 



Definition at line 82 of file greater\_\-point.hh.

\hypertarget{a02752_a9fa8d39e525103378128c0aec5836d4e}{
\index{mln::util@{mln::util}!make\_\-greater\_\-psite@{make\_\-greater\_\-psite}}
\index{make\_\-greater\_\-psite@{make\_\-greater\_\-psite}!mln::util@{mln::util}}
\subsubsection[{make\_\-greater\_\-psite}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename I $>$ {\bf greater\_\-psite}$<$ I $>$ mln::util::make\_\-greater\_\-psite (
\begin{DoxyParamCaption}
\item[{const Image$<$ I $>$ \&}]{ ima}
\end{DoxyParamCaption}
)}}
\label{dc/d3d/a02752_a9fa8d39e525103378128c0aec5836d4e}


Helper to build a \hyperlink{a00398}{mln::util::greater\_\-psite}. 



Definition at line 82 of file greater\_\-psite.hh.

\hypertarget{a02752_ad78b6d2c06d732fd3c0234171e2cfc1d}{
\index{mln::util@{mln::util}!operator$<$@{operator$<$}}
\index{operator$<$@{operator$<$}!mln::util@{mln::util}}
\subsubsection[{operator$<$}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ bool mln::util::operator$<$ (
\begin{DoxyParamCaption}
\item[{const vertex$<$ G $>$ \&}]{ lhs, }
\item[{const vertex$<$ G $>$ \&}]{ rhs}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d3d/a02752_ad78b6d2c06d732fd3c0234171e2cfc1d}


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



Definition at line 390 of file vertex.hh.

\hypertarget{a02752_a795d899cef07dd0327f117ef9e306252}{
\index{mln::util@{mln::util}!operator$<$$<$@{operator$<$$<$}}
\index{operator$<$$<$@{operator$<$$<$}!mln::util@{mln::util}}
\subsubsection[{operator$<$$<$}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ std::ostream \& mln::util::operator$<$$<$ (
\begin{DoxyParamCaption}
\item[{std::ostream \&}]{ ostr, }
\item[{const vertex$<$ G $>$ \&}]{ v}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d3d/a02752_a795d899cef07dd0327f117ef9e306252}


Push the vertex {\ttfamily v} in the output stream {\ttfamily ostr}. 



Definition at line 372 of file vertex.hh.

\hypertarget{a02752_aab2fc15f8b2f35f097c079078934c276}{
\index{mln::util@{mln::util}!operator$<$$<$@{operator$<$$<$}}
\index{operator$<$$<$@{operator$<$$<$}!mln::util@{mln::util}}
\subsubsection[{operator$<$$<$}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T $>$ std::ostream \& mln::util::operator$<$$<$ (
\begin{DoxyParamCaption}
\item[{std::ostream \&}]{ ostr, }
\item[{const array$<$ T $>$ \&}]{ a}
\end{DoxyParamCaption}
)}}
\label{dc/d3d/a02752_aab2fc15f8b2f35f097c079078934c276}


Operator$<$$<$. 



Definition at line 796 of file util/array.hh.



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

\hypertarget{a02752_aad5f26712f8faa294b315e53b4bf6568}{
\index{mln::util@{mln::util}!operator==@{operator==}}
\index{operator==@{operator==}!mln::util@{mln::util}}
\subsubsection[{operator==}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename G $>$ bool mln::util::operator== (
\begin{DoxyParamCaption}
\item[{const vertex$<$ G $>$ \&}]{ v1, }
\item[{const vertex$<$ G $>$ \&}]{ v2}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d3d/a02752_aad5f26712f8faa294b315e53b4bf6568}


Equality operator. 

Test whether two vertices have the same id. 

Definition at line 380 of file vertex.hh.



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

\hypertarget{a02752_a02f85883ac9b3e9308d049d993fa463b}{
\index{mln::util@{mln::util}!operator==@{operator==}}
\index{operator==@{operator==}!mln::util@{mln::util}}
\subsubsection[{operator==}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T $>$ bool mln::util::operator== (
\begin{DoxyParamCaption}
\item[{const array$<$ T $>$ \&}]{ lhs, }
\item[{const array$<$ T $>$ \&}]{ rhs}
\end{DoxyParamCaption}
)}}
\label{dc/d3d/a02752_a02f85883ac9b3e9308d049d993fa463b}


Operator==. 



Definition at line 815 of file util/array.hh.



References mln::util::array$<$ T $>$::std\_\-vector().

\hypertarget{a02752_a58362a8ec6ca26cb673e384724e7f076}{
\index{mln::util@{mln::util}!ord\_\-strict@{ord\_\-strict}}
\index{ord\_\-strict@{ord\_\-strict}!mln::util@{mln::util}}
\subsubsection[{ord\_\-strict}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T $>$ bool mln::util::ord\_\-strict (
\begin{DoxyParamCaption}
\item[{const T \&}]{ lhs, }
\item[{const T \&}]{ rhs}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d3d/a02752_a58362a8ec6ca26cb673e384724e7f076}


Routine to test if {\itshape lhs\/} is strictly \char`\"{}less-\/than\char`\"{} {\itshape rhs\/}. 



Definition at line 90 of file util/ord.hh.



Referenced by mln::util::ord\_\-pair$<$ T $>$::change\_\-both(), mln::util::ord\_\-pair$<$ T $>$::change\_\-first(), and mln::util::ord\_\-pair$<$ T $>$::change\_\-second().

\hypertarget{a02752_abd5ae8d79193860f9ca3cd5f884366fe}{
\index{mln::util@{mln::util}!ord\_\-weak@{ord\_\-weak}}
\index{ord\_\-weak@{ord\_\-weak}!mln::util@{mln::util}}
\subsubsection[{ord\_\-weak}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T $>$ bool mln::util::ord\_\-weak (
\begin{DoxyParamCaption}
\item[{const T \&}]{ lhs, }
\item[{const T \&}]{ rhs}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d3d/a02752_abd5ae8d79193860f9ca3cd5f884366fe}


Routine to test if {\itshape lhs\/} is \char`\"{}less-\/than or equal-\/to\char`\"{} {\itshape rhs\/}. 



Definition at line 101 of file util/ord.hh.



Referenced by mln::util::ord\_\-pair$<$ T $>$::change\_\-both(), mln::util::ord\_\-pair$<$ T $>$::change\_\-first(), mln::util::ord\_\-pair$<$ T $>$::change\_\-second(), and mln::box$<$ P $>$::is\_\-valid().

\hypertarget{a02752_a917f01145d9d95e5458dfa1a96c96675}{
\index{mln::util@{mln::util}!tree\_\-fast\_\-to\_\-image@{tree\_\-fast\_\-to\_\-image}}
\index{tree\_\-fast\_\-to\_\-image@{tree\_\-fast\_\-to\_\-image}!mln::util@{mln::util}}
\subsubsection[{tree\_\-fast\_\-to\_\-image}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T , typename I $>$ void mln::util::tree\_\-fast\_\-to\_\-image (
\begin{DoxyParamCaption}
\item[{tree\_\-fast$<$ T $>$ \&}]{ tree, }
\item[{Image$<$ I $>$ \&}]{ output\_\-}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d3d/a02752_a917f01145d9d95e5458dfa1a96c96675}
Convert a tree\_\-fast into an image.


\begin{DoxyParams}{Parameters}
\item[\mbox{\tt[in]} {\em tree}]The tree to convert. \item[\mbox{\tt[out]} {\em output\_\-}]The image containing tree informations. \end{DoxyParams}


Definition at line 99 of file tree\_\-fast\_\-to\_\-image.hh.

\hypertarget{a02752_a3434e119ba1bcc545e07026d2d9bda2f}{
\index{mln::util@{mln::util}!tree\_\-to\_\-fast@{tree\_\-to\_\-fast}}
\index{tree\_\-to\_\-fast@{tree\_\-to\_\-fast}!mln::util@{mln::util}}
\subsubsection[{tree\_\-to\_\-fast}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T $>$ tree\_\-fast$<$ T $>$ mln::util::tree\_\-to\_\-fast (
\begin{DoxyParamCaption}
\item[{tree$<$ T $>$ \&}]{ input}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d3d/a02752_a3434e119ba1bcc545e07026d2d9bda2f}


Facade. 

Convert a tree into an tree\_\-fast.


\begin{DoxyParams}{Parameters}
\item[\mbox{\tt[in]} {\em input}]The tree to convert.\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The tree\_\-fast containing tree informations. 
\end{DoxyReturn}


Definition at line 90 of file tree\_\-to\_\-fast.hh.



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

\hypertarget{a02752_a0c6ce8d2ad72bfa364af97713fdbee31}{
\index{mln::util@{mln::util}!tree\_\-to\_\-image@{tree\_\-to\_\-image}}
\index{tree\_\-to\_\-image@{tree\_\-to\_\-image}!mln::util@{mln::util}}
\subsubsection[{tree\_\-to\_\-image}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T , typename I $>$ void mln::util::tree\_\-to\_\-image (
\begin{DoxyParamCaption}
\item[{tree$<$ T $>$ \&}]{ tree, }
\item[{Image$<$ I $>$ \&}]{ output\_\-}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{dc/d3d/a02752_a0c6ce8d2ad72bfa364af97713fdbee31}


Convert a tree into an image. 


\begin{DoxyParams}{Parameters}
\item[\mbox{\tt[in]} {\em tree}]The tree to convert. \item[\mbox{\tt[out]} {\em output\_\-}]The image containing tree information. \end{DoxyParams}


Definition at line 178 of file tree\_\-to\_\-image.hh.

