max.hh

// Copyright (C) 2009 EPITA Research and Development Laboratory (LRDE)
//
// This file is part of Olena.
//
// Olena is free software: you can redistribute it and/or modify it under
// the terms of the GNU General Public License as published by the Free
// Software Foundation, version 2 of the License.
//
// Olena is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Olena.  If not, see <http://www.gnu.org/licenses/>.
//
// As a special exception, you may use this file as part of a free
// software project without restriction.  Specifically, if other files
// instantiate templates or use macros or inline functions from this
// file, or you compile this file and link it with other files to produce
// an executable, this file does not by itself cause the resulting
// executable to be covered by the GNU General Public License.  This
// exception does not however invalidate any other reasons why the
// executable file might be covered by the GNU General Public License.

#ifndef MLN_MORPHO_TREE_FILTER_MAX_HH
# define MLN_MORPHO_TREE_FILTER_MAX_HH

# include <mln/core/concept/function.hh>
# include <mln/morpho/tree/data.hh>

namespace mln
{

  namespace morpho
  {

    namespace tree
    {

      namespace filter
      {

        template <typename T, typename F, typename P>
        inline
        void
        max(const T& tree, Image<F>& f_, const Function_v2b<P>& pred_);




# ifndef MLN_INCLUDE_ONLY

        template <typename T, typename F, typename P>
        inline
        void
        max(const T& tree, Image<F>& f_, const Function_v2b<P>& pred_)
        {
          F& f = exact(f_);
          const P& pred = exact(pred_);

          trace::entering("mln::morpho::tree::filter::max");

          mln_ch_value(F, bool) mark;
          initialize(mark, f);
          mln::data::fill(mark, true);

          {
            mln_up_node_piter(T) n(tree);
            for_all(n)
              if (!mark(n))
                mark(tree.parent(n)) = false;
              else if (pred(n))
                {
                  mark(tree.parent(n)) = false;
                  mark(n) = false;
                }
          }

          {
            mln_dn_node_piter(T) n(tree);
            for_all(n)
              if (mark(n))
                f(n) = f(tree.parent(n));
          }

          trace::exiting("mln::morpho::tree::filter::max");
        }

# endif // ! MLN_INCLUDE_ONLY

      } // end of namespace mln::morpho::tree::filter

    } // end of namespace mln::morpho::tree

  } // end of namespace mln::morpho

} // end of namespace mln

#endif // ! MLN_MORPHO_TREE_FILTER_MAX_HH