neighb_niter_impl.hh

// Copyright (C) 2008, 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_CORE_INTERNAL_NEIGHB_NITER_IMPL_HH
# define MLN_CORE_INTERNAL_NEIGHB_NITER_IMPL_HH


# include <mln/core/macros.hh>
# include <mln/core/internal/force_exact.hh>


namespace mln
{

  // Forward declaration.
  template <typename P, typename W> class graph_window_base;
  template <typename G, typename F> class graph_elt_window;
  template <typename G, typename F, typename I> class graph_elt_window_if;
  template <typename G, typename F> class line_graph_elt_window;
  namespace util
  {
    template <typename G> class vertex;
    template <typename G> class edge;
  }


  namespace internal
  {

    template <typename W, typename E>
    struct neighb_niter_impl
    {

    };

    template <typename P, typename E>
    struct neighb_niter_impl_graph_window
    {
      unsigned id() const
      {
        return internal::force_exact<E>(*this).compute_p_().id();
      }

    };

    template <typename G, typename E>
    struct neighb_niter_impl_graph_window< util::vertex<G>, E >
    {
    };

    template <typename G, typename E>
    struct neighb_niter_impl_graph_window< util::edge<G>, E >
    {
    };


    template <typename P, typename T, typename E>
    struct neighb_niter_impl< graph_window_base<P, T>, E >
      : neighb_niter_impl_graph_window<P,E>
    {
      typedef typename T::target S;

      // Tech. note: A copy is returned since it actually is a
      // temporary object; we cannot return a "const&" here for some
      // compilers badly kills the temporary object...
      mln_graph_element(S) element() const
      {
        return internal::force_exact<E>(*this).compute_p_().element();
      }

    };



    template <typename G, typename S, typename E>
    struct neighb_niter_impl<graph_elt_window<G,S>, E>
      : public neighb_niter_impl< graph_window_base< mln_result(S::fun_t),
                                                     graph_elt_window<G,S> >,
                                  E >
    {

    };

    template <typename G, typename F, typename E>
    struct neighb_niter_impl<line_graph_elt_window<G,F>, E>
      : public neighb_niter_impl< graph_window_base< mln_result(F),
                                                     line_graph_elt_window<G, F> >,
                                  E >
    {

    };


    template <typename G, typename S, typename I, typename E>
    struct neighb_niter_impl<graph_elt_window_if<G,S,I>, E>
      : public neighb_niter_impl< graph_window_base< mln_result(S::fun_t),
                                                     graph_elt_window_if<G,S,I> >,
                                  E >
    {

    };


  } // end of namespace mln::internal

} // end of namespace mln

#endif // ! MLN_CORE_INTERNAL_NEIGHB_NITER_IMPL_HH