[Olena-patches] proto-1.0 224: Add files to makefile.src & Fix typo

Index: ChangeLog from Christophe Berger &lt;christophe(a)lrde.epita.fr&gt; * oln/makefile.src: Add astro files. * oln/appli/astro/tree_coherance_checks.hh: Fix typo. * oln/appli/astro/tree_statistics.hh: Fix typo. appli/astro/tree_coherance_checks.hh | 12 ++++++------ appli/astro/tree_statistics.hh | 9 +++++---- makefile.src | 2 ++ 3 files changed, 13 insertions(+), 10 deletions(-) Index: oln/appli/astro/tree_statistics.hh --- oln/appli/astro/tree_statistics.hh (revision 223) +++ oln/appli/astro/tree_statistics.hh (working copy) @@ -157,7 +157,7 @@ /** - ** Makes the children per node average. + ** Compute the children per node average. ** ** \param I Type of maxtree's image. ** @@ -178,7 +178,7 @@ ** */ template<typename I> - float children_average(oln::appli::astro::clean<I>& tree) + double children_average(oln::appli::astro::clean<I>& tree) { typedef oln_type_of(I, point) point_type; std::queue<point_type> q; @@ -212,7 +212,7 @@ ** ** \warning Maxtree should have already been computed. ** - ** This algorith is not the best way to compute max depth! + ** This algorithm is not the best way to compute max depth! ** ** ** \return Maximal depth of tree. @@ -257,7 +257,8 @@ ** */ template<typename I> - void dotty_output(oln::appli::astro::clean<I>& tree, const std::string& filename) + void dotty_output(oln::appli::astro::clean<I>& tree, + const std::string& filename) { typedef oln_type_of(I, point) point_type; std::queue<point_type> q; Index: oln/appli/astro/tree_coherance_checks.hh --- oln/appli/astro/tree_coherance_checks.hh (revision 223) +++ oln/appli/astro/tree_coherance_checks.hh (working copy) @@ -44,7 +44,7 @@ namespace maxtree { - namespace coherance_check { + namespace coherence_check { /** ** Check if tree starts from an unique root point. @@ -146,7 +146,7 @@ ** search for parent (par) of p ** ensure (p) is contained in children of (par) ** else - ** // nothing, root parent of hiself + ** // nothing, root parent of hitself ** ** \endcode ** @@ -189,7 +189,7 @@ ** ** \arg tree maxtree structure to check. ** - ** A node cannot be children of hiself, this check if this + ** A node cannot be children of hitelf, this check if this ** property is satisfied. ** ** \warning Maxtree should have already been computed. @@ -236,7 +236,7 @@ ** ** \arg tree maxtree structure to check. ** - ** The maxtree structure is based on Tarjan's union find + ** The maxtree structure is based on Tarjan's Union-Find ** algorithm which works on decreasing point levels. ** This property guarantees that leafs are seen first in ** first pass order. The check exists to ensure this. @@ -303,12 +303,12 @@ ** Algorithm used : ** ** Tree is traversed using breadth-first traversal with a queue. - ** Every points are marked, at the end all the points must + ** Every point is marked, at the end all the points must ** have been marked. ** ** \endcode ** - ** \return True if all points where marked. + ** \return True if all points were marked. ** */ template<typename I> Index: oln/makefile.src --- oln/makefile.src (revision 223) +++ oln/makefile.src (working copy) @@ -7,6 +7,8 @@ all.hh \ \ appli/astro/clean.hh \ + appli/astro/tree_coherance_checks.hh \ + appli/astro/tree_statistics.hh \ \ basics1d.hh \ basics2d.hh \