[Olena-patches] 2259: Factor iterators on mln::p_complex.

* mln/core/internal/p_complex_piter_base.hh: New. Use it to factor... * mln/core/p_complex_piter.hh (mln::p_complex_fwd_piter_<D, P>) (mln::p_complex_bkd_piter_<D, P>): ...these. --- milena/ChangeLog | 11 + milena/mln/core/internal/p_complex_piter_base.hh | 294 ++++++++++++++++ milena/mln/core/p_complex_piter.hh | 397 +--------------------- 3 files changed, 322 insertions(+), 380 deletions(-) create mode 100644 milena/mln/core/internal/p_complex_piter_base.hh diff --git a/milena/ChangeLog b/milena/ChangeLog index fbf267f..d80dc75 100644 --- a/milena/ChangeLog +++ b/milena/ChangeLog @@ -1,5 +1,16 @@ 2008-09-14 Roland Levillain &lt;roland(a)lrde.epita.fr&gt; + Factor iterators on mln::p_complex. + + * mln/core/internal/p_complex_piter_base.hh: New. + Use it to factor... + * mln/core/p_complex_piter.hh + (mln::p_complex_fwd_piter_<D, P>) + (mln::p_complex_bkd_piter_<D, P>): + ...these. + +2008-09-14 Roland Levillain &lt;roland(a)lrde.epita.fr&gt; + Have iterators on mln::complex export their dimension. * mln/core/complex_iter.hh diff --git a/milena/mln/core/internal/p_complex_piter_base.hh b/milena/mln/core/internal/p_complex_piter_base.hh new file mode 100644 index 0000000..a9d5f6d --- /dev/null +++ b/milena/mln/core/internal/p_complex_piter_base.hh @@ -0,0 +1,294 @@ +// Copyright (C) 2008 EPITA Research and Development Laboratory (LRDE) +// +// This file is part of the Olena Library. This library is free +// software; you can redistribute it and/or modify it under the terms +// of the GNU General Public License version 2 as published by the +// Free Software Foundation. +// +// This library 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 this library; see the file COPYING. If not, write to +// the Free Software Foundation, 51 Franklin Street, Fifth Floor, +// Boston, MA 02111-1307, USA. +// +// As a special exception, you may use this file as part of a free +// software library 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. +// reasons why the executable file might be covered by the GNU General +// Public License. + +#ifndef MLN_CORE_INTERNAL_P_COMPLEX_PITER_BASE_HH +# define MLN_CORE_INTERNAL_P_COMPLEX_PITER_BASE_HH + +/// \file mln/core/internal/p_complex_piter_base.hh +/// \brief Definition of an implementation (factoring) class for +/// iterators on mln::p_complex. + +# include <limits> + +# include <mln/core/internal/point_iterator_base.hh> +# include <mln/core/p_complex.hh> +# include <mln/core/complex_psite.hh> +# include <mln/core/complex_iter.hh> + +namespace mln +{ + /* FIXME: Get rid of P? */ + + // Forward declarations. + template <unsigned D, typename P> class p_complex; + template <unsigned D, typename P> class complex_psite; + + namespace internal + { + + /*---------------------------------. + | p_complex_piter_base_<I, P, E>. | + `---------------------------------*/ + + /// \brief Factoring class for iterators on mln::p_complex. + /// + /// \arg \p I The type of the underlying complex iterator. + /// \arg \p P The associated point type. + /// \arg \p E The type exact type of the iterator. + template <typename I, typename P, typename E> + class p_complex_piter_base_ : public point_iterator_base_< P, E > + { + typedef p_complex_piter_base_<I, P, E> self_; + typedef point_iterator_base_< P, E > super_; + + /// The type of the underlying complex iterator. + typedef I iter; + + public: + typedef p_complex<iter::complex_dim, P> pset; + typedef complex_psite<iter::complex_dim, P> psite; + typedef P point; + typedef mln_coord(point) coord; + + /// Construction and assignment. + /// \{ + p_complex_piter_base_(const pset& pc); + p_complex_piter_base_(const self_& rhs); + self_& operator= (const self_& rhs); + /// \} + + /// Manipulation. + /// \{ + /// Test if the iterator is valid. + bool is_valid() const; + /// Invalidate the iterator. + void invalidate(); + /// Start an iteration. + void start(); + + /// Go to the next point. + void next_(); + /// Update the internal data of the iterator. + void update_(); + /// \} + + /// Conversion and accessors. + /// \{ + /// Reference to the corresponding point. + // FIXME: Don't use this method (dummy value). + const point& to_point () const; + /// Reference to the corresponding point site. + const psite& to_psite () const; + /// Convert the iterator into a line graph psite. + operator psite() const; + + /// Read-only access to the \a i-th coordinate. + // FIXME: Don't use this operator (dummy value). + coord operator[](unsigned i) const; + /// \} + + private: + /// The underlying complex iterator. + iter iter_; + /// The psite corresponding to this iterator. + psite psite_; + /// \brief The point associated to this psite. + // FIXME: Actually, this is a dummy value! + point p_; + }; + + + /* FIXME: This hand-made delegation is painful. We should rely on + the general mechanism provided by Point_Site. But then again, we + need to refine/adjust the interface of Point_Site w.r.t. the + mandatory conversions to points. */ + template <typename I, typename P, typename E> + inline + std::ostream& + operator<<(std::ostream& ostr, const p_complex_piter_base_<I, P, E>& p); + + + + +# ifndef MLN_INCLUDE_ONLY + + /*---------------------------------. + | p_complex_piter_base_<I, P, E>. | + `---------------------------------*/ + + template <typename I, typename P, typename E> + inline + p_complex_piter_base_<I, P, E>::p_complex_piter_base_(const pset& pc) + // Initialize psite_ and p_ a dummy values. + : psite_(), + p_() + { + iter_.set_cplx(pc.cplx()); + mln_postcondition(!is_valid()); + } + + template <typename I, typename P, typename E> + inline + p_complex_piter_base_<I, P, E>::p_complex_piter_base_(const p_complex_piter_base_<I, P, E>& rhs) + : iter_(rhs.iter_), + psite_(rhs.psite_), + // Dummy value. + p_() + { + } + + template <typename I, typename P, typename E> + inline + p_complex_piter_base_<I, P, E>& + p_complex_piter_base_<I, P, E>::operator=(const p_complex_piter_base_<I, P, E>& rhs) + { + if (&rhs == this) + return *this; + iter_ = rhs.iter_; + psite_ = rhs.psite_; + return *this; + } + + template <typename I, typename P, typename E> + inline + mln_coord(P) + p_complex_piter_base_<I, P, E>::operator[](unsigned i) const + { + // Dummy value. + return p_[i]; + } + + template <typename I, typename P, typename E> + inline + bool + p_complex_piter_base_<I, P, E>::is_valid() const + { + return iter_.is_valid(); + } + + template <typename I, typename P, typename E> + inline + void + p_complex_piter_base_<I, P, E>::invalidate() + { + iter_.invalidate(); + } + + template <typename I, typename P, typename E> + inline + void + p_complex_piter_base_<I, P, E>::start() + { + iter_.start(); + update_(); + } + + template <typename I, typename P, typename E> + inline + void + p_complex_piter_base_<I, P, E>::next_() + { + iter_.next_(); + if (is_valid()) + update_(); + } + + template <typename I, typename P, typename E> + inline + void + p_complex_piter_base_<I, P, E>::update_() + { + // Update psite_. + psite_ = psite(iter_); + } + + template <typename I, typename P, typename E> + inline + const P& + p_complex_piter_base_<I, P, E>::to_point() const + { + // Dummy value. + return p_; + } + + template <typename I, typename P, typename E> + inline + const typename p_complex_piter_base_<I, P, E>::psite& + p_complex_piter_base_<I, P, E>::to_psite() const + { + /* We don't check whether the iterator is valid before returning + the value using + + mln_precondition(is_valid()); + + since this method may be called *before* the iterator is + actually initialized. This is the case for instance when this + point iterator (say, P) is used to initialize another iterator + on window or neighborhood (say, Q); most of the time, for_all() + is responsible for the initialization of P, but it takes place + *after* the creation of Q. */ + return psite_; + } + + template <typename I, typename P, typename E> + inline + p_complex_piter_base_<I, P, E>::operator psite() const + { + mln_precondition(is_valid()); + return psite_; + } + + + template <typename I, typename P, typename E> + inline + std::ostream& + operator<<(std::ostream& ostr, const p_complex_piter_base_<I, P, E>& p) + { + /* FIXME: We should use p.to_psite() here, but as it lacks the + precondition the conversion operator has, so we use the latter. + + We should + - rename `to_psite' as `to_psite_'; + - write a new `to_psite' routine checking the validity of the + iterator; + - have the conversion operator to psite use this new `to_psite' + routine; + - adjust former clients of `to_psite' + + This is a general remark that applies to all point/psite + iterators of Milena. */ + return ostr << static_cast< mln_psite(E) >(p); + } + +# endif // ! MLN_INCLUDE_ONLY + + } // end of mln::internal + +} // end of mln + + +#endif // ! MLN_CORE_INTERNAL_P_COMPLEX_PITER_BASE_HH diff --git a/milena/mln/core/p_complex_piter.hh b/milena/mln/core/p_complex_piter.hh index d9ce17a..f4b1158 100644 --- a/milena/mln/core/p_complex_piter.hh +++ b/milena/mln/core/p_complex_piter.hh @@ -31,23 +31,12 @@ /// \file mln/core/p_complex_piter.hh /// \brief Definition of point iterator on complex-based pset. -# include <limits> - -# include <mln/core/internal/point_iterator_base.hh> -# include <mln/core/p_complex.hh> -# include <mln/core/complex_psite.hh> -# include <mln/core/complex_iter.hh> - -// Factor p_complex_fwd_piter_<D, P> and p_complex_bkd_piter_<D, P>. +# include <mln/core/internal/p_complex_piter_base.hh> namespace mln { /* FIXME: Get rid of P? */ - // Fwd decls. - template <unsigned D, typename P> class p_complex; - template <unsigned D, typename P> class complex_psite; - /*-----------------------------. | p_complex_fwd_piter_<D, P>. | @@ -56,81 +45,24 @@ namespace mln /// \brief Forward iterator on point sites of a mln::p_complex<D, P>. template <unsigned D, typename P> class p_complex_fwd_piter_ - : public internal::point_iterator_base_< P, p_complex_fwd_piter_<D, P> > + : public internal::p_complex_piter_base_< complex_fwd_iter_<D>, + P, + p_complex_fwd_piter_<D, P> > { typedef p_complex_fwd_piter_<D, P> self_; - typedef internal::point_iterator_base_< P, self_ > super_; - - /// The type of the underlying complex iterator. - typedef complex_fwd_iter_<D> iter; + typedef + internal::p_complex_piter_base_< complex_fwd_iter_<D>, P, self_ > super_; public: - // Make definitions from super class available. - // FIXME: Is it still meaningful for a complex? - enum { dim = super_::dim }; - - typedef complex_psite<D, P> psite; - typedef P point; - typedef mln_coord(point) coord; - /// Construction and assignment. /// \{ p_complex_fwd_piter_(const p_complex<D, P>& pc); p_complex_fwd_piter_(const self_& rhs); self_& operator= (const self_& rhs); /// \} - - /// Manipulation. - /// \{ - /// Test if the iterator is valid. - bool is_valid() const; - /// Invalidate the iterator. - void invalidate(); - /// Start an iteration. - void start(); - - /// Go to the next point. - void next_(); - /// Update the internal data of the iterator. - void update_(); - /// \} - - /// Conversion and accessors. - /// \{ - /// Reference to the corresponding point. - // FIXME: Don't use this method (dummy value). - const point& to_point () const; - /// Reference to the corresponding point site. - const psite& to_psite () const; - /// Convert the iterator into a line graph psite. - operator psite() const; - - /// Read-only access to the \a i-th coordinate. - // FIXME: Don't use this operator (dummy value). - coord operator[](unsigned i) const; - /// \} - - private: - /// The underlying complex iterator. - iter iter_; - /// The psite corresponding to this iterator. - psite psite_; - /// \brief The point associated to this psite. - // FIXME: Actually, this is a dummy value! - point p_; }; - /* FIXME: This hand-made delegation is painful. We should rely on - the general mechanism provided by Point_Site. But then again, we - need to refine/adjust the interface of Point_Site w.r.t. the - mandatory conversions to points. */ - template <unsigned D, typename P> - inline - std::ostream& - operator<<(std::ostream& ostr, const p_complex_fwd_piter_<D, P>& p); - - /*-----------------------------. | p_complex_bkd_piter_<D, P>. | `-----------------------------*/ @@ -138,81 +70,24 @@ namespace mln /// \brief Backward iterator on point sites of a mln::p_complex<D, P>. template <unsigned D, typename P> class p_complex_bkd_piter_ - : public internal::point_iterator_base_< P, p_complex_bkd_piter_<D, P> > + : public internal::p_complex_piter_base_< complex_bkd_iter_<D>, + P, + p_complex_bkd_piter_<D, P> > { typedef p_complex_bkd_piter_<D, P> self_; - typedef internal::point_iterator_base_< P, self_ > super_; - - /// The type of the underlying complex iterator. - typedef complex_bkd_iter_<D> iter; + typedef + internal::p_complex_piter_base_< complex_bkd_iter_<D>, P, self_ > super_; public: - // Make definitions from super class available. - // FIXME: Is it still meaningful for a complex? - enum { dim = super_::dim }; - - typedef complex_psite<D, P> psite; - typedef P point; - typedef mln_coord(point) coord; - /// Construction and assignment. /// \{ p_complex_bkd_piter_(const p_complex<D, P>& pc); p_complex_bkd_piter_(const self_& rhs); self_& operator= (const self_& rhs); /// \} - - /// Manipulation. - /// \{ - /// Test if the iterator is valid. - bool is_valid() const; - /// Invalidate the iterator. - void invalidate(); - /// Start an iteration. - void start(); - - /// Go to the next point. - void next_(); - /// Update the internal data of the iterator. - void update_(); - /// \} - - /// Conversion and accessors. - /// \{ - /// Reference to the corresponding point. - // FIXME: Don't use this method (dummy value). - const point& to_point () const; - /// Reference to the corresponding point site. - const psite& to_psite () const; - /// Convert the iterator into a line graph psite. - operator psite() const; - - /// Read-only access to the \a i-th coordinate. - // FIXME: Don't use this operator (dummy value). - coord operator[](unsigned i) const; - /// \} - - private: - /// The underlying complex iterator. - iter iter_; - /// The psite corresponding to this iterator. - psite psite_; - /// \brief The point associated to this psite. - // FIXME: Actually, this is a dummy value! - point p_; }; - /* FIXME: This hand-made delegation is painful. We should rely on - the general mechanism provided by Point_Site. But then again, we - need to refine/adjust the interface of Point_Site w.r.t. the - mandatory conversions to points. */ - template <unsigned D, typename P> - inline - std::ostream& - operator<<(std::ostream& ostr, const p_complex_bkd_piter_<D, P>& p); - - # ifndef MLN_INCLUDE_ONLY @@ -223,21 +98,14 @@ namespace mln template <unsigned D, typename P> inline p_complex_fwd_piter_<D, P>::p_complex_fwd_piter_(const p_complex<D, P>& pc) - // Initialize psite_ and p_ a dummy values. - : psite_(), - p_() + : super_(pc) { - iter_.set_cplx(pc.cplx()); - mln_postcondition(!is_valid()); } template <unsigned D, typename P> inline p_complex_fwd_piter_<D, P>::p_complex_fwd_piter_(const p_complex_fwd_piter_<D, P>& rhs) - : iter_(rhs.iter_), - psite_(rhs.psite_), - // Dummy value. - p_() + : super_(rhs) { } @@ -248,122 +116,10 @@ namespace mln { if (&rhs == this) return *this; - iter_ = rhs.iter_; - psite_ = rhs.psite_; + super_::operator=(rhs); return *this; } - template <unsigned D, typename P> - inline - mln_coord(P) - p_complex_fwd_piter_<D, P>::operator[](unsigned i) const - { - // Dummy value. - return p_[i]; - } - - template <unsigned D, typename P> - inline - bool - p_complex_fwd_piter_<D, P>::is_valid() const - { - return iter_.is_valid(); - } - - template <unsigned D, typename P> - inline - void - p_complex_fwd_piter_<D, P>::invalidate() - { - iter_.invalidate(); - } - - template <unsigned D, typename P> - inline - void - p_complex_fwd_piter_<D, P>::start() - { - iter_.start(); - update_(); - } - - template <unsigned D, typename P> - inline - void - p_complex_fwd_piter_<D, P>::next_() - { - iter_.next_(); - if (is_valid()) - update_(); - } - - template <unsigned D, typename P> - inline - void - p_complex_fwd_piter_<D, P>::update_() - { - // Update psite_. - psite_ = complex_psite<D, P>(iter_); - } - - template <unsigned D, typename P> - inline - const P& - p_complex_fwd_piter_<D, P>::to_point() const - { - // Dummy value. - return p_; - } - - template <unsigned D, typename P> - inline - const complex_psite<D, P>& - p_complex_fwd_piter_<D, P>::to_psite() const - { - /* We don't check whether the iterator is valid before returning - the value using - - mln_precondition(is_valid()); - - since this method may be called *before* the iterator is - actually initialized. This is the case for instance when this - point iterator (say, P) is used to initialize another iterator - on window or neighborhood (say, Q); most of the time, for_all() - is responsible for the initialization of P, but it takes place - *after* the creation of Q. */ - return psite_; - } - - template <unsigned D, typename P> - inline - p_complex_fwd_piter_<D, P>::operator complex_psite<D, P>() const - { - mln_precondition(is_valid()); - return psite_; - } - - - template <unsigned D, typename P> - inline - std::ostream& - operator<<(std::ostream& ostr, const p_complex_fwd_piter_<D, P>& p) - { - /* FIXME: We should use p.to_psite() here, but as it lacks the - precondition the conversion operator has, so we use the latter. - - We should - - rename `to_psite' as `to_psite_'; - - write a new `to_psite' routine checking the validity of the - iterator; - - have the conversion operator to psite use this new `to_psite' - routine; - - adjust former clients of `to_psite' - - This is a general remark that applies to all point/psite - iterators of Milena. */ - return ostr << static_cast< complex_psite<D, P> >(p); - } - /*-----------------------------. | p_complex_bkd_piter_<D, P>. | @@ -372,21 +128,14 @@ namespace mln template <unsigned D, typename P> inline p_complex_bkd_piter_<D, P>::p_complex_bkd_piter_(const p_complex<D, P>& pc) - // Initialize psite_ and p_ a dummy values. - : psite_(), - p_() + : super_(pc) { - iter_.set_cplx(pc.cplx()); - mln_postcondition(!is_valid()); } template <unsigned D, typename P> inline p_complex_bkd_piter_<D, P>::p_complex_bkd_piter_(const p_complex_bkd_piter_<D, P>& rhs) - : iter_(rhs.iter_), - psite_(rhs.psite_), - // Dummy value. - p_() + : super_(rhs) { } @@ -397,122 +146,10 @@ namespace mln { if (&rhs == this) return *this; - iter_ = rhs.iter_; - psite_ = rhs.psite_; + super_::operator=(rhs); return *this; } - template <unsigned D, typename P> - inline - mln_coord(P) - p_complex_bkd_piter_<D, P>::operator[](unsigned i) const - { - // Dummy value. - return p_[i]; - } - - template <unsigned D, typename P> - inline - bool - p_complex_bkd_piter_<D, P>::is_valid() const - { - return iter_.is_valid(); - } - - template <unsigned D, typename P> - inline - void - p_complex_bkd_piter_<D, P>::invalidate() - { - iter_.invalidate(); - } - - template <unsigned D, typename P> - inline - void - p_complex_bkd_piter_<D, P>::start() - { - iter_.start(); - update_(); - } - - template <unsigned D, typename P> - inline - void - p_complex_bkd_piter_<D, P>::next_() - { - iter_.next_(); - if (is_valid()) - update_(); - } - - template <unsigned D, typename P> - inline - void - p_complex_bkd_piter_<D, P>::update_() - { - // Update psite_. - psite_ = complex_psite<D, P>(iter_); - } - - template <unsigned D, typename P> - inline - const P& - p_complex_bkd_piter_<D, P>::to_point() const - { - // Dummy value. - return p_; - } - - template <unsigned D, typename P> - inline - const complex_psite<D, P>& - p_complex_bkd_piter_<D, P>::to_psite() const - { - /* We don't check whether the iterator is valid before returning - the value using - - mln_precondition(is_valid()); - - since this method may be called *before* the iterator is - actually initialized. This is the case for instance when this - point iterator (say, P) is used to initialize another iterator - on window or neighborhood (say, Q); most of the time, for_all() - is responsible for the initialization of P, but it takes place - *after* the creation of Q. */ - return psite_; - } - - template <unsigned D, typename P> - inline - p_complex_bkd_piter_<D, P>::operator complex_psite<D, P>() const - { - mln_precondition(is_valid()); - return psite_; - } - - - template <unsigned D, typename P> - inline - std::ostream& - operator<<(std::ostream& ostr, const p_complex_bkd_piter_<D, P>& p) - { - /* FIXME: We should use p.to_psite() here, but as it lacks the - precondition the conversion operator has, so we use the latter. - - We should - - rename `to_psite' as `to_psite_'; - - write a new `to_psite' routine checking the validity of the - iterator; - - have the conversion operator to psite use this new `to_psite' - routine; - - adjust former clients of `to_psite' - - This is a general remark that applies to all point/psite - iterators of Milena. */ - return ostr << static_cast< complex_psite<D, P> >(p); - } - # endif // ! MLN_INCLUDE_ONLY } // end of mln -- 1.6.0.1