Olena-patches

olena-patches@lrde.epita.fr

9625 discussions

by Guillaume Duhamel

URL: https://svn.lrde.epita.fr/svn/oln/trunk/milena ChangeLog: 2007-10-12 Guillaume Duhamel <guillaume.duhamel(a)lrde.epita.fr> Add tests for queue. * queue_p_fast.cc, * queue_p_fast_priority.cc, * queue_p_priority.cc: New tests. * image2d.cc: Update test for (id_) in mln/core/internal. --- image2d.cc | 10 ++++ queue_p_fast.cc | 57 +++++++++++++++++++++++++++ queue_p_fast_priority.cc | 98 +++++++++++++++++++++++++++++++++++++++++++++++ queue_p_priority.cc | 98 +++++++++++++++++++++++++++++++++++++++++++++++ 4 files changed, 263 insertions(+) Index: trunk/milena/tests/image2d.cc =================================================================== --- trunk/milena/tests/image2d.cc (revision 1324) +++ trunk/milena/tests/image2d.cc (revision 1325) @@ -34,6 +34,7 @@ #include <mln/geom/size2d.hh> #include <mln/core/init.hh> +#include <mln/border/resize.hh> @@ -47,6 +48,15 @@ image2d<int> f(nrows, ncols, border); + { + std::cout << f.id_() << std::endl; + image2d<int> g; + std::cout << g.id_() << std::endl; + g = f; + // border::resize (g, 2); + std::cout << g.id_() << std::endl; + } + mln_assertion(f.npoints() == geom::nrows(f) * geom::ncols(f)); mln_assertion(f.ncells() == (nrows + 2 * border) * (ncols + 2 * border)); } Index: trunk/milena/tests/queue_p_fast.cc =================================================================== --- trunk/milena/tests/queue_p_fast.cc (revision 0) +++ trunk/milena/tests/queue_p_fast.cc (revision 1325) @@ -0,0 +1,57 @@ +// Copyright (C) 2007 EPITA Research and Development Laboratory +// +// 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. This exception does not however invalidate any other +// reasons why the executable file might be covered by the GNU General +// Public License. + +/*! \file tests/queue_p.cc + * + * \brief Tests on mln::queue_p. + */ + +#include <mln/core/point2d.hh> +#include <mln/core/queue_p_fast.hh> + + + +int main() +{ + using namespace mln; + + queue_p_fast<point2d> q; + q + .push(make::point2d(6, 9)) + .push(make::point2d(5, 1)) + .push(make::point2d(4, 2)); + mln_assertion(q.npoints() == 3); + + std::cout << q.bbox() << std::endl; + std::cout << q << std::endl; + + q.pop(); + mln_assertion(q.npoints() == 2); + point2d p = q.front(); + mln_assertion(q.npoints() == 2); + mln_assertion(p == make::point2d(5, 1)); +} Index: trunk/milena/tests/queue_p_priority.cc =================================================================== --- trunk/milena/tests/queue_p_priority.cc (revision 0) +++ trunk/milena/tests/queue_p_priority.cc (revision 1325) @@ -0,0 +1,98 @@ +// Copyright (C) 2007 EPITA Research and Development Laboratory +// +// 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. This exception does not however invalidate any other +// reasons why the executable file might be covered by the GNU General +// Public License. + +/*! \file tests/queue_p_priority.cc + * + * \brief Tests on mln::queue_p_priority. + */ + +#include <mln/core/point2d.hh> +#include <mln/core/queue_p_priority.hh> + +int main () +{ + using namespace mln; + + mln::queue_p_priority<point2d, unsigned> q; + point2d p1 (6, 9); + point2d p2 (5, 1); + point2d p3 (4, 2); + + mln_assertion (q.empty ()); + + mln_assertion (q.npoints () == 0); + + q.push_force (p3); + q.push_force (p1, 3); + q.push_force (p2, 5); + + std::cout << q.bbox () << std::endl; + std::cout << q << std::endl; + + mln_assertion (!q.empty ()); + + mln_assertion (q.has (p1)); + mln_assertion (q.has (p2)); + mln_assertion (q.has (p3)); + + mln_assertion (q.npoints () == 3); + mln_assertion (q.front () == p2); + q.pop (); + + mln_assertion (q.has (p1)); + mln_assertion (!q.has (p2)); + mln_assertion (q.has (p3)); + + mln_assertion (q.npoints () == 2); + mln_assertion (q.front () == p1); + q.pop (); + + mln_assertion (!q.has (p1)); + mln_assertion (!q.has (p2)); + mln_assertion (q.has (p3)); + + mln_assertion (q.npoints () == 1); + mln_assertion (q.front () == p3); + q.pop (); + + mln_assertion (!q.has (p1)); + mln_assertion (!q.has (p2)); + mln_assertion (!q.has (p3)); + mln_assertion (q.npoints () == 0); + + mln_assertion (q.empty ()); + + q.push_force (p3); + q.push_force (p2, 5); + q.push_force (p1, 3); + + mln_assertion (q[2] == p3); + mln_assertion (q[1] == p1); + mln_assertion (q[0] == p2); + q.clear (); + mln_assertion (q.empty ()); +} Index: trunk/milena/tests/queue_p_fast_priority.cc =================================================================== --- trunk/milena/tests/queue_p_fast_priority.cc (revision 0) +++ trunk/milena/tests/queue_p_fast_priority.cc (revision 1325) @@ -0,0 +1,98 @@ +// Copyright (C) 2007 EPITA Research and Development Laboratory +// +// 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. This exception does not however invalidate any other +// reasons why the executable file might be covered by the GNU General +// Public License. + +/*! \file tests/queue_p_priority.cc + * + * \brief Tests on mln::queue_p_priority. + */ + +#include <mln/core/point2d.hh> +#include <mln/core/queue_p_fast_priority.hh> + +int main () +{ + using namespace mln; + + mln::queue_p_fast_priority<point2d, unsigned> q; + point2d p1 (6, 9); + point2d p2 (5, 1); + point2d p3 (4, 2); + + mln_assertion (q.empty ()); + + mln_assertion (q.npoints () == 0); + + q.push_force (p3); + q.push_force (p1, 3); + q.push_force (p2, 5); + + std::cout << q.bbox () << std::endl; + std::cout << q << std::endl; + + mln_assertion (!q.empty ()); + + mln_assertion (q.has (p1)); + mln_assertion (q.has (p2)); + mln_assertion (q.has (p3)); + + mln_assertion (q.npoints () == 3); + mln_assertion (q.front () == p2); + q.pop (); + + mln_assertion (q.has (p1)); + mln_assertion (!q.has (p2)); + mln_assertion (q.has (p3)); + + mln_assertion (q.npoints () == 2); + mln_assertion (q.front () == p1); + q.pop (); + + mln_assertion (!q.has (p1)); + mln_assertion (!q.has (p2)); + mln_assertion (q.has (p3)); + + mln_assertion (q.npoints () == 1); + mln_assertion (q.front () == p3); + q.pop (); + + mln_assertion (!q.has (p1)); + mln_assertion (!q.has (p2)); + mln_assertion (!q.has (p3)); + mln_assertion (q.npoints () == 0); + + mln_assertion (q.empty ()); + + q.push_force (p3); + q.push_force (p2, 5); + q.push_force (p1, 3); + + mln_assertion (q[2] == p3); + mln_assertion (q[1] == p1); + mln_assertion (q[0] == p2); + q.clear (); + mln_assertion (q.empty ()); +}

17 years, 3 months

milena r1324: Add new kind of queue

by Guillaume Duhamel

URL: https://svn.lrde.epita.fr/svn/oln/trunk/milena ChangeLog: 2007-10-12 Guillaume Duhamel <guillaume.duhamel(a)lrde.epita.fr> Add new kind of queue. * queue_p_fast.hh, * queue_p_fast_priority.hh, * queue_p_priority.hh: New kind of queue. * internal/image_base.hh: Add (id_). --- internal/image_base.hh | 2 queue_p_fast.hh | 275 ++++++++++++++++++++++++++++++++++++++++ queue_p_fast_priority.hh | 322 +++++++++++++++++++++++++++++++++++++++++++++++ queue_p_priority.hh | 321 ++++++++++++++++++++++++++++++++++++++++++++++ 4 files changed, 920 insertions(+) Index: trunk/milena/mln/core/internal/image_base.hh =================================================================== --- trunk/milena/mln/core/internal/image_base.hh (revision 1323) +++ trunk/milena/mln/core/internal/image_base.hh (revision 1324) @@ -156,6 +156,8 @@ const util::tracked_ptr< internal::data_<E> >& hook_data_() const { return data_; } + const void* id_() const { return data_.ptr_; } + protected: image_base_(); Index: trunk/milena/mln/core/queue_p_fast.hh =================================================================== --- trunk/milena/mln/core/queue_p_fast.hh (revision 0) +++ trunk/milena/mln/core/queue_p_fast.hh (revision 1324) @@ -0,0 +1,275 @@ +// Copyright (C) 2007 EPITA Research and Development Laboratory +// +// 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. 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_QUEUE_P_FAST_HH +# define MLN_CORE_QUEUE_P_FAST_HH + +/*! \file mln/core/queue_p_fast.hh + * + * \brief Definition of a point set class based on std::deque. + */ + +# include <vector> +# include <deque> +# include <algorithm> +# include <iterator> + +# include <mln/core/internal/point_set_base.hh> +# include <mln/core/vec_p_piter.hh> +# include <mln/accu/bbox.hh> + + +namespace mln +{ + + // Fwd decls. + template <typename P> struct vec_p_fwd_piter_; + template <typename P> struct vec_p_bkd_piter_; + + + /*! \brief Point queue class (based on std::deque). + * + * This is a mathematical set of points (unique insertion). + * + * \todo Make it work with P being a Point_Site. + * \todo Add a parameter flag to choose another policy for "push" + * (i.e., no-op if multiple or allow multiple insertions). + * + * \warning We have some troubles with point set comparison based on + * a call to npoints() when this container is multiple. + */ + template <typename P> + class queue_p_fast : public internal::point_set_base_< P, queue_p_fast > + { + public: + + /// Forward Point_Iterator associated type. + typedef vec_p_fwd_piter_ fwd_piter; + + /// Backward Point_Iterator associated type. + typedef vec_p_bkd_piter_ bkd_piter; + + /// Constructor. + queue_p_fast(); + + /// Test is \p p belongs to this point set. + bool has(const P& p) const; + + /// Test if queue is empty or not. + bool empty() const; + + /// Give the number of points. + std::size_t npoints() const; + + /// Give the exact bounding box. + const box_& bbox() const; + + /// Push force a point \p p in the queue. + queue_p_fast& push_force(const P& p); + + /// Push a point \p p in the queue. + queue_p_fast& push(const P& p); + + /// Pop (remove) the front point \p p from the queue; \p p is the + /// least recently inserted point. + void pop(); + + /// Give the front point \p p of the queue; \p p is the least + /// recently inserted point. + const P& front() const; + + /// Clear the queue. + void clear(); + + /// Return the corresponding std::vector of points. + const std::vector& vect() const; + + /// Return the \p i-th point. + const P& operator[](unsigned i) const; + + protected: + + std::vector q_; + std::size_t begin_; + std::size_t end_; + + mutable std::vector vect_; + mutable bool vect_needs_update_; + void vect_update_() const; + + mutable accu::bbox bb_; + mutable bool bb_needs_update_; + void bb_update_() const; + }; + + + +# ifndef MLN_INCLUDE_ONLY + + template <typename P> + queue_p_fast::queue_p_fast() + { + // vect_needs_update_ = false; + bb_needs_update_ = false; + begin_ = 0; + end_ = 0; + } + + template <typename P> + void + queue_p_fast::vect_update_() const + { + vect_.clear(); + vect_.reserve(q_.size()); + std::copy(q_.begin(), q_.end(), + std::back_inserter(vect_)); + vect_needs_update_ = false; + } + + template <typename P> + void + queue_p_fast::bb_update_() const + { + bb_.init(); + for (std::size_t i = this->begin_; i < this->end_; ++i) + bb_.take(q_[i]); + bb_needs_update_ = false; + } + + template <typename P> + bool + queue_p_fast::has(const P& p) const + { + for (unsigned i = this->begin_; i < this->end_; ++i) + if (q_[i] == p) + return true; + return false; + } + + template <typename P> + bool + queue_p_fast::empty() const + { + return (this->begin_ == this->end_); + } + + template <typename P> + std::size_t + queue_p_fast::npoints() const + { + mln_precondition(this->end_ >= this->begin_); + return (this->end_ - this->begin_); + } + + template <typename P> + const box_& + queue_p_fast::bbox() const + { + mln_precondition(npoints() != 0); + if (bb_needs_update_) + bb_update_(); + return bb_.to_result(); + } + + template <typename P> + queue_p_fast& + queue_p_fast::push_force(const P& p) + { + q_.push_back(p); + ++this->end_; + if (! vect_needs_update_) + { + // vect_needs_update_ = true; + bb_needs_update_ = true; + } + return *this; + } + + template <typename P> + queue_p_fast& + queue_p_fast::push(const P& p) + { + mln_precondition(! this->has(p)); + // FIXME: Our choice is "error if multiple insertions" + return this->push_force(p); + } + + template <typename P> + void + queue_p_fast::pop() + { + ++this->begin_; +// q_.pop_front(); +// if (! vect_needs_update_) +// { +// vect_needs_update_ = true; +// bb_needs_update_ = true; +// } + } + + template <typename P> + const P& + queue_p_fast::front() const + { + mln_precondition(! this->empty()); + return q_[begin_]; + } + + template <typename P> + void + queue_p_fast::clear() + { + this->end_ = begin_; +// q_.clear(); +// vect_.clear(); +// vect_needs_update_ = false; + bb_needs_update_ = false; + } + + template <typename P> + const std::vector& + queue_p_fast::vect() const + { + if (vect_needs_update_) + vect_update_(); + return vect_; + } + + template <typename P> + const P& + queue_p_fast::operator[](unsigned i) const + { + mln_precondition(i < npoints()); + return q_[begin_ + i]; + } + +# endif // ! MLN_INCLUDE_ONLY + +} // end of namespace mln + + +#endif // ! MLN_CORE_QUEUE_P_FAST_HH Index: trunk/milena/mln/core/queue_p_fast_priority.hh =================================================================== --- trunk/milena/mln/core/queue_p_fast_priority.hh (revision 0) +++ trunk/milena/mln/core/queue_p_fast_priority.hh (revision 1324) @@ -0,0 +1,322 @@ +// Copyright (C) 2007 EPITA Research and Development Laboratory +// +// 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. 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_QUEUE_P_FAST_PRIORITY_HH +# define MLN_CORE_QUEUE_P_FAST_PRIORITY_HH + +/*! \file mln/core/queue_p_fast_priority.hh + * + * \brief Definition of a point set class based on std::deque + * and std::map. + */ + +# include <vector> +# include <deque> +# include <map> +# include <algorithm> +# include <iterator> + +# include <mln/core/internal/point_set_base.hh> +# include <mln/core/vec_p_piter.hh> +# include <mln/accu/bbox.hh> +# include <mln/core/queue_p_fast.hh> + +namespace mln +{ + + // Fwd decls. + template <typename P> struct vec_p_fwd_piter_; + template <typename P> struct vec_p_bkd_piter_; + + + /*! \brief Point queue class (based on std::deque). + * + * This is a mathematical set of points (unique insertion). + * + * \todo Make it work with P being a Point_Site. + * \todo Add a parameter flag to choose another policy for "push" + * (i.e., no-op if multiple or allow multiple insertions). + * + * \warning We have some troubles with point set comparison based on + * a call to npoints() when this container is multiple. + */ + template <typename P, typename T> + class queue_p_fast_priority : public internal::point_set_base_< P, queue_p_fast_priority<P, T> > + { + public: + + /// Forward Point_Iterator associated type. + typedef vec_p_fwd_piter_ fwd_piter; + + /// Backward Point_Iterator associated type. + typedef vec_p_bkd_piter_ bkd_piter; + + /// Constructor. + queue_p_fast_priority(); + + /// Test is \p p belongs to this point set. + bool has(const P& p) const; + + /// Test if queue is empty or not. + bool empty() const; + + /// Give the number of points. + unsigned npoints() const; + + /// Give the exact bounding box. + const box_& bbox() const; + + /// Push force a point \p p in the queue. + queue_p_fast_priority<P, T>& push_force(const P& p, T prio = 0); + + /// Push a point \p p in the queue. + queue_p_fast_priority<P, T>& push(const P& p, T prio = 0); + + /// Pop (remove) the front point \p p from the queue; \p p is the + /// least recently inserted point. + void pop(); + + /// Give the front point \p p of the queue; \p p is the least + /// recently inserted point. + const P& front() const; + + /// Clear the queue. + void clear(); + + /// Return the corresponding std::vector of points. + const std::vector& vect() const; + + /// Return the \p i-th point. + const P& operator[](unsigned i) const; + + protected: + + std::map<const T, queue_p_fast > q_; + + mutable std::vector vect_; + mutable bool vect_needs_update_; + void vect_update_() const; + + mutable accu::bbox bb_; + mutable bool bb_needs_update_; + void bb_update_() const; + + }; + + + +# ifndef MLN_INCLUDE_ONLY + + template <typename P, typename T> + queue_p_fast_priority<P, T>::queue_p_fast_priority() + { + vect_needs_update_ = false; + bb_needs_update_ = false; + } + + template <typename P, typename T> + void + queue_p_fast_priority<P, T>::vect_update_() const + { + vect_.clear(); + vect_.reserve(npoints()); + + typename std::map<T, queue_p_fast >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + std::copy((*it).second.vect().begin(), (*it).second.vect().end(), + std::back_inserter(vect_)); + vect_needs_update_ = false; + } + + template <typename P, typename T> + void + queue_p_fast_priority<P, T>::bb_update_() const + { + bb_.init(); + + typename std::map<T, queue_p_fast >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + for (unsigned i = 0; i < (*it).second.npoints (); ++i) + bb_.take((*it).second[i]); + bb_needs_update_ = false; + } + + + template <typename P, typename T> + bool + queue_p_fast_priority<P, T>::has(const P& p) const + { + typename std::map<T, queue_p_fast >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + if ((*it).second.has (p)) + return true; + return false; + } + + template <typename P, typename T> + bool + queue_p_fast_priority<P, T>::empty() const + { + typename std::map<T, queue_p_fast >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + if (!(*it).second.empty ()) + return false; + return true; + } + + template <typename P, typename T> + unsigned + queue_p_fast_priority<P, T>::npoints() const + { + unsigned res = 0; + + typename std::map<T, queue_p_fast >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + if (!(*it).second.empty ()) + res += (*it).second.npoints(); + return res; + } + + template <typename P, typename T> + const box_& + queue_p_fast_priority<P, T>::bbox() const + { + mln_precondition(npoints() != 0); + if (bb_needs_update_) + bb_update_(); + return bb_.to_result(); + } + + template <typename P, typename T> + queue_p_fast_priority<P, T>& + queue_p_fast_priority<P, T>::push_force(const P& p, T prio) + { + q_[prio].push_force (p); + if (! vect_needs_update_) + { + vect_needs_update_ = true; + bb_needs_update_ = true; + } + return *this; + } + + template <typename P, typename T> + queue_p_fast_priority<P, T>& + queue_p_fast_priority<P, T>::push(const P& p, T prio) + { + if (! has(p)) + return this->push_force(p, prio); + else + return *this; + } + + template <typename P, typename T> + void + queue_p_fast_priority<P, T>::pop() + { + typename std::map<T, queue_p_fast >::reverse_iterator it = q_.rbegin (); + + for (; it != q_.rend (); ++it) + if (!(*it).second.empty ()) + return (*it).second.pop (); + + if (! vect_needs_update_) + { + vect_needs_update_ = true; + bb_needs_update_ = true; + } + } + + template <typename P, typename T> + const P& + queue_p_fast_priority<P, T>::front() const + { + mln_precondition(! q_.empty()); + + typename std::map<T, queue_p_fast >::const_reverse_iterator it = q_.rbegin (); + + for (; it != q_.rend (); ++it) + if (!(*it).second.empty ()) + break; + return (*it).second.front (); + } + + template <typename P, typename T> + void + queue_p_fast_priority<P, T>::clear() + { + typename std::map<T, queue_p_fast >::iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + (*it).second.clear (); + q_.clear(); + vect_needs_update_ = false; + bb_needs_update_ = false; + } + + template <typename P, typename T> + const std::vector& + queue_p_fast_priority<P, T>::vect() const + { + if (vect_needs_update_) + vect_update_(); + return vect_; + } + + template <typename P, typename T> + const P& + queue_p_fast_priority<P, T>::operator[](unsigned i) const + { + mln_precondition(i < npoints()); + + typename std::map<T, queue_p_fast >::const_reverse_iterator it = q_.rbegin (); + unsigned cpt = 0; + + for (; it != q_.rend (); ++it) + { + if (!(*it).second.empty ()) + for (cpt = 0; cpt < (*it).second.npoints (); ++cpt) + { + if (i == 0) + return (*it).second[cpt]; + --i; + } + } + return (*it).second[cpt]; + } + +# endif // ! MLN_INCLUDE_ONLY + +} // end of namespace mln + + +#endif // ! MLN_CORE_QUEUE_P_FAST_PRIORITY_HH Index: trunk/milena/mln/core/queue_p_priority.hh =================================================================== --- trunk/milena/mln/core/queue_p_priority.hh (revision 0) +++ trunk/milena/mln/core/queue_p_priority.hh (revision 1324) @@ -0,0 +1,321 @@ +// Copyright (C) 2007 EPITA Research and Development Laboratory +// +// 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. 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_QUEUE_P_PRIORITY_HH +# define MLN_CORE_QUEUE_P_PRIORITY_HH + +/*! \file mln/core/queue_p_priority.hh + * + * \brief Definition of a point set class based on std::deque. + */ + +# include <vector> +# include <deque> +# include <map> +# include <algorithm> +# include <iterator> + +# include <mln/core/internal/point_set_base.hh> +# include <mln/core/vec_p_piter.hh> +# include <mln/accu/bbox.hh> +# include <mln/core/queue_p.hh> + +namespace mln +{ + + // Fwd decls. + template <typename P> struct vec_p_fwd_piter_; + template <typename P> struct vec_p_bkd_piter_; + + + /*! \brief Point queue class (based on std::deque). + * + * This is a mathematical set of points (unique insertion). + * + * \todo Make it work with P being a Point_Site. + * \todo Add a parameter flag to choose another policy for "push" + * (i.e., no-op if multiple or allow multiple insertions). + * + * \warning We have some troubles with point set comparison based on + * a call to npoints() when this container is multiple. + */ + template <typename P, typename T> + class queue_p_priority : public internal::point_set_base_< P, queue_p_priority<P, T> > + { + public: + + /// Forward Point_Iterator associated type. + typedef vec_p_fwd_piter_ fwd_piter; + + /// Backward Point_Iterator associated type. + typedef vec_p_bkd_piter_ bkd_piter; + + /// Constructor. + queue_p_priority(); + + /// Test is \p p belongs to this point set. + bool has(const P& p) const; + + /// Test if queue is empty or not. + bool empty() const; + + /// Give the number of points. + unsigned npoints() const; + + /// Give the exact bounding box. + const box_& bbox() const; + + /// Push force a point \p p in the queue. + queue_p_priority<P, T>& push_force(const P& p, T prio = 0); + + /// Push a point \p p in the queue. + queue_p_priority<P, T>& push(const P& p, T prio = 0); + + /// Pop (remove) the front point \p p from the queue; \p p is the + /// least recently inserted point. + void pop(); + + /// Give the front point \p p of the queue; \p p is the least + /// recently inserted point. + const P& front() const; + + /// Clear the queue. + void clear(); + + /// Return the corresponding std::vector of points. + const std::vector& vect() const; + + /// Return the \p i-th point. + const P& operator[](unsigned i) const; + + protected: + + std::map<const T, queue_p > q_; + + mutable std::vector vect_; + mutable bool vect_needs_update_; + void vect_update_() const; + + mutable accu::bbox bb_; + mutable bool bb_needs_update_; + void bb_update_() const; + + }; + + + +# ifndef MLN_INCLUDE_ONLY + + template <typename P, typename T> + queue_p_priority<P, T>::queue_p_priority() + { + vect_needs_update_ = false; + bb_needs_update_ = false; + } + + template <typename P, typename T> + void + queue_p_priority<P, T>::vect_update_() const + { + vect_.clear(); + vect_.reserve(npoints()); + + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + std::copy((*it).second.vect().begin(), (*it).second.vect().end(), + std::back_inserter(vect_)); + vect_needs_update_ = false; + } + + template <typename P, typename T> + void + queue_p_priority<P, T>::bb_update_() const + { + bb_.init(); + + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + for (unsigned i = 0; i < (*it).second.npoints (); ++i) + bb_.take((*it).second[i]); + bb_needs_update_ = false; + } + + + template <typename P, typename T> + bool + queue_p_priority<P, T>::has(const P& p) const + { + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + if ((*it).second.has (p)) + return true; + return false; + } + + template <typename P, typename T> + bool + queue_p_priority<P, T>::empty() const + { + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + if (!(*it).second.empty ()) + return false; + return true; + } + + template <typename P, typename T> + unsigned + queue_p_priority<P, T>::npoints() const + { + unsigned res = 0; + + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + if (!(*it).second.empty ()) + res += (*it).second.npoints(); + return res; + } + + template <typename P, typename T> + const box_& + queue_p_priority<P, T>::bbox() const + { + mln_precondition(npoints() != 0); + if (bb_needs_update_) + bb_update_(); + return bb_.to_result(); + } + + template <typename P, typename T> + queue_p_priority<P, T>& + queue_p_priority<P, T>::push_force(const P& p, T prio) + { + q_[prio].push_force (p); + if (! vect_needs_update_) + { + vect_needs_update_ = true; + bb_needs_update_ = true; + } + return *this; + } + + template <typename P, typename T> + queue_p_priority<P, T>& + queue_p_priority<P, T>::push(const P& p, T prio) + { + if (! has(p)) + return this->push_force(p, prio); + else + return *this; + } + + template <typename P, typename T> + void + queue_p_priority<P, T>::pop() + { + typename std::map<T, queue_p >::reverse_iterator it = q_.rbegin (); + + for (; it != q_.rend (); ++it) + if (!(*it).second.empty ()) + return (*it).second.pop (); + + if (! vect_needs_update_) + { + vect_needs_update_ = true; + bb_needs_update_ = true; + } + } + + template <typename P, typename T> + const P& + queue_p_priority<P, T>::front() const + { + mln_precondition(! q_.empty()); + + typename std::map<T, queue_p >::const_reverse_iterator it = q_.rbegin (); + + for (; it != q_.rend (); ++it) + if (!(*it).second.empty ()) + break; + return (*it).second.front (); + } + + template <typename P, typename T> + void + queue_p_priority<P, T>::clear() + { + typename std::map<T, queue_p >::iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + (*it).second.clear (); + q_.clear(); + vect_needs_update_ = false; + bb_needs_update_ = false; + } + + template <typename P, typename T> + const std::vector& + queue_p_priority<P, T>::vect() const + { + if (vect_needs_update_) + vect_update_(); + return vect_; + } + + template <typename P, typename T> + const P& + queue_p_priority<P, T>::operator[](unsigned i) const + { + mln_precondition(i < npoints()); + + typename std::map<T, queue_p >::const_reverse_iterator it = q_.rbegin (); + unsigned cpt = 0; + + for (; it != q_.rend (); ++it) + { + if (!(*it).second.empty ()) + for (cpt = 0; cpt < (*it).second.npoints (); ++cpt) + { + if (i == 0) + return (*it).second[cpt]; + --i; + } + } + return (*it).second[cpt]; + } + +# endif // ! MLN_INCLUDE_ONLY + +} // end of namespace mln + + +#endif // ! MLN_CORE_QUEUE_P_PRIORITY_HH

17 years, 3 months

milena r1323: Update queue_p_priority

by Guillaume Duhamel

URL: https://svn.lrde.epita.fr/svn/oln/trunk/milena ChangeLog: 2007-10-12 Guillaume Duhamel <guillaume.duhamel(a)lrde.epita.fr> Update queue_p_priority. * queue_p_priority.hh: Update. --- queue_p_priority.hh | 72 ++++++++++++++++++++++++++-------------------------- 1 file changed, 37 insertions(+), 35 deletions(-) Index: trunk/milena/sandbox/duhamel/queue_p_priority.hh =================================================================== --- trunk/milena/sandbox/duhamel/queue_p_priority.hh (revision 1322) +++ trunk/milena/sandbox/duhamel/queue_p_priority.hh (revision 1323) @@ -64,7 +64,7 @@ * a call to npoints() when this container is multiple. */ template <typename P, typename T> - class queue_p_priority// : public internal::point_set_base_< P, queue_p_priority > + class queue_p_priority : public internal::point_set_base_< P, queue_p_priority<P, T> > { public: @@ -78,16 +78,16 @@ queue_p_priority(); /// Test is \p p belongs to this point set. - bool has(const P& p); + bool has(const P& p) const; /// Test if queue is empty or not. - bool empty(); + bool empty() const; /// Give the number of points. - unsigned npoints(); + unsigned npoints() const; /// Give the exact bounding box. - const box_& bbox(); + const box_& bbox() const; /// Push force a point \p p in the queue. queue_p_priority<P, T>& push_force(const P& p, T prio = 0); @@ -101,7 +101,7 @@ /// Give the front point \p p of the queue; \p p is the least /// recently inserted point. - const P& front(); + const P& front() const; /// Clear the queue. void clear(); @@ -110,7 +110,7 @@ const std::vector& vect() const; /// Return the \p i-th point. - const P& operator[](unsigned i); + const P& operator[](unsigned i) const; protected: @@ -118,11 +118,11 @@ mutable std::vector vect_; mutable bool vect_needs_update_; - void vect_update_(); + void vect_update_() const; mutable accu::bbox bb_; mutable bool bb_needs_update_; - void bb_update_(); + void bb_update_() const; }; @@ -133,11 +133,13 @@ template <typename P, typename T> queue_p_priority<P, T>::queue_p_priority() { + vect_needs_update_ = false; + bb_needs_update_ = false; } template <typename P, typename T> void - queue_p_priority<P, T>::vect_update_() + queue_p_priority<P, T>::vect_update_() const { vect_.clear(); vect_.reserve(npoints()); @@ -145,66 +147,66 @@ typename std::map<T, queue_p >::const_iterator it = q_.begin (); for (; it != q_.end (); ++it) - std::copy(q_[(*it).first].begin(), q_[(*it).first].end(), + std::copy((*it).second.begin(), (*it).second.end(), std::back_inserter(vect_)); vect_needs_update_ = false; } template <typename P, typename T> void - queue_p_priority<P, T>::bb_update_() + queue_p_priority<P, T>::bb_update_() const { bb_.init(); typename std::map<T, queue_p >::const_iterator it = q_.begin (); for (; it != q_.end (); ++it) - for (unsigned i = 0; i < q_[(*it).first].npoints (); ++i) - bb_.take(q_[(*it).first][i]); + for (unsigned i = 0; i < (*it).second.npoints (); ++i) + bb_.take((*it).second[i]); } template <typename P, typename T> bool - queue_p_priority<P, T>::has(const P& p) + queue_p_priority<P, T>::has(const P& p) const { typename std::map<T, queue_p >::const_iterator it = q_.begin (); for (; it != q_.end (); ++it) - if (q_[(*it).first].has (p)) + if ((*it).second.has (p)) return true; return false; } template <typename P, typename T> bool - queue_p_priority<P, T>::empty() + queue_p_priority<P, T>::empty() const { typename std::map<T, queue_p >::const_iterator it = q_.begin (); for (; it != q_.end (); ++it) - if (!q_[(*it).first].empty ()) + if (!(*it).second.empty ()) return false; return true; } template <typename P, typename T> unsigned - queue_p_priority<P, T>::npoints() + queue_p_priority<P, T>::npoints() const { unsigned res = 0; typename std::map<T, queue_p >::const_iterator it = q_.begin (); for (; it != q_.end (); ++it) - if (!q_[(*it).first].empty ()) - res += q_[(*it).first].npoints(); + if (!(*it).second.empty ()) + res += (*it).second.npoints(); return res; } template <typename P, typename T> const box_& - queue_p_priority<P, T>::bbox() + queue_p_priority<P, T>::bbox() const { mln_precondition(npoints() != 0); if (bb_needs_update_) @@ -235,11 +237,11 @@ void queue_p_priority<P, T>::pop() { - typename std::map<T, queue_p >::const_reverse_iterator it = q_.rbegin (); + typename std::map<T, queue_p >::reverse_iterator it = q_.rbegin (); for (; it != q_.rend (); ++it) - if (!q_[(*it).first].empty ()) - return q_[(*it).first].pop (); + if (!(*it).second.empty ()) + return (*it).second.pop (); if (! vect_needs_update_) { @@ -250,26 +252,26 @@ template <typename P, typename T> const P& - queue_p_priority<P, T>::front() + queue_p_priority<P, T>::front() const { mln_precondition(! q_.empty()); typename std::map<T, queue_p >::const_reverse_iterator it = q_.rbegin (); for (; it != q_.rend (); ++it) - if (!q_[(*it).first].empty ()) + if (!(*it).second.empty ()) break; - return q_[(*it).first].front (); + return (*it).second.front (); } template <typename P, typename T> void queue_p_priority<P, T>::clear() { - typename std::map<T, queue_p >::const_iterator it = q_.begin (); + typename std::map<T, queue_p >::iterator it = q_.begin (); for (; it != q_.end (); ++it) - q_[(*it).first].clear (); + (*it).second.clear (); q_.clear(); vect_needs_update_ = false; bb_needs_update_ = false; @@ -286,7 +288,7 @@ template <typename P, typename T> const P& - queue_p_priority<P, T>::operator[](unsigned i) + queue_p_priority<P, T>::operator[](unsigned i) const { mln_precondition(i < npoints()); @@ -295,15 +297,15 @@ for (; it != q_.end (); ++it) { - if (!q_[(*it).first].empty ()) - for (cpt = 0; cpt < q_[(*it).first].npoints (); ++cpt) + if (!(*it).second.empty ()) + for (cpt = 0; cpt < (*it).second.npoints (); ++cpt) { if (i == 0) - return q_[(*it).first][cpt]; + return (*it).second[cpt]; --i; } } - return q_[(*it).first][cpt]; + return (*it).second[cpt]; } # endif // ! MLN_INCLUDE_ONLY

17 years, 3 months

milena r1322: Update composed transformation. (does not work)

by Simon Nivault

URL: https://svn.lrde.epita.fr/svn/oln/trunk/milena ChangeLog: 2007-10-12 Simon Nivault <simon.nivault(a)lrde.epita.fr> Update composed transformation. (does not work). * mln/core/macros.hh, * mln/fun/x2x/composed.hh, * mln/metal/bool.hh: Update. --- core/macros.hh | 4 ++ fun/x2x/composed.hh | 80 +++++++++++++++++++++++++++------------------------- metal/bool.hh | 2 + 3 files changed, 48 insertions(+), 38 deletions(-) Index: trunk/milena/mln/core/macros.hh =================================================================== --- trunk/milena/mln/core/macros.hh (revision 1321) +++ trunk/milena/mln/core/macros.hh (revision 1322) @@ -103,6 +103,10 @@ # define mln_image(T) typename T::image # define mln_image_(T) T::image +/// Shortcut to access the invert type associated to T. +# define mln_invert(T) typename T::invert +# define mln_invert_(T) T::invert + // l Index: trunk/milena/mln/metal/bool.hh =================================================================== --- trunk/milena/mln/metal/bool.hh (revision 1321) +++ trunk/milena/mln/metal/bool.hh (revision 1322) @@ -50,6 +50,7 @@ template <> struct bool_< true > { + typedef bool_<true> check_t; static const bool value = true; typedef bool_<true> eval; static void check(); @@ -63,6 +64,7 @@ template <> struct bool_< false > { + typedef bool_<false> check_not_t; static const bool value = false; typedef bool_<false> eval; static void check_not(); Index: trunk/milena/mln/fun/x2x/composed.hh =================================================================== --- trunk/milena/mln/fun/x2x/composed.hh (revision 1321) +++ trunk/milena/mln/fun/x2x/composed.hh (revision 1322) @@ -36,6 +36,8 @@ # include <mln/core/concept/function.hh> # include <mln/fun/internal/x2x_impl.hh> # include <mln/metal/vec.hh> +# include <mln/metal/is.hh> +# include <mln/metal/bexpr.hh> # include <mln/core/h_mat.hh> @@ -54,9 +56,12 @@ namespace internal { + template <unsigned n, typename F, typename G, typename E, bool is_bij> + struct helper_composed_; - template <typename F, typename G, typename E, bool is_bij = true> - struct helper_composed_ + + template <unsigned n, typename F, typename G, typename E> + struct helper_composed_<n, F, G, E, true> : public fun::internal::x2x_impl_<mln_result(F), E >, public Bijection_x2x<E> { @@ -68,8 +73,8 @@ helper_composed_(const F& f, const G& g); using super_::operator(); - metal::vec<dim,mln_result(F)> - operator()(const metal::vec<dim,mln_result(F)>& v) const; + metal::vec<n,mln_result(F)> + operator()(const metal::vec<n,mln_result(F)>& v) const; void set_first(const F& f); void set_second(const G& g); @@ -84,8 +89,8 @@ invert inv() const; }; - template <typename F, typename G, typename E> - struct helper_composed_<F, G, E, false> + template <unsigned n, typename F, typename G, typename E> + struct helper_composed_<n, F, G, E, false> : public fun::internal::x2x_impl_<mln_result(F), E >, public Function_x2x<E> { @@ -97,8 +102,8 @@ helper_composed_(const F& f, const G& g); using super_::operator(); - metal::vec<dim,mln_result(F)> - operator()(const metal::vec<dim,mln_result(F)>& v) const; + metal::vec<n,mln_result(F)> + operator()(const metal::vec<n,mln_result(F)>& v) const; void set_first(const F& f); void set_second(const G& g); @@ -115,20 +120,19 @@ template <typename F, typename G> struct composed - : public internal::helper_composed_<F, G, composed<F,G>, + : public internal::helper_composed_<F::dim, F, G, composed<F,G>, mlc_is(F, Bijection_x2x<F>)::value && mlc_is(G, Bijection_x2x<G>)::value>, - private metal::bool_<(F::dim == G::dim)>::check_t, - private metal::is<mln_argument(F), mln_result(G)>::check_t - { - typedef internal::helper_composed_<F, G, composed<F,G>, - mlc_is(F, Bijection_x2x<F>)::value && - mlc_is(G, Bijection_x2x<G>)::value> super_; + + private metal::and_< metal::bool_<(F::dim == G::dim)>, + metal::is<mln_argument(F), mln_result(G)> + >::check_t + { composed() {} composed(const F& f, const G& g) - : helper_composed_<F, G, composed<F,G>, + : internal::helper_composed_<F::dim, F, G, composed<F,G>, mlc_is(F, Bijection_x2x<F>)::value && mlc_is(G, Bijection_x2x<G>)::value>(f, g) { @@ -155,38 +159,38 @@ // Implementation of the bijective version. - template <typename F, typename G> - helper_composed_<F,G,E,true>::helper_composed_() + template <unsigned n, typename F, typename G, typename E> + helper_composed_<n,F,G,E,true>::helper_composed_() { this->m_ = h_mat<dim,mln_result(F)>::Id; } - template <typename F, typename G> - helper_composed_<F,G,E,true>::helper_composed_(const F& f, const G& g) + template <unsigned n, typename F, typename G, typename E> + helper_composed_<n,F,G,E,true>::helper_composed_(const F& f, const G& g) :f_(f), g_(g) { this->m_ = f_.mat() * g_.mat(); } - template <typename F, typename G> - metal::vec<helper_composed_<F,G,E,true>::dim, mln_result(F)> - helper_composed_<F,G,E,true>::operator()(const metal::vec<dim, mln_result(F)>& v) const + template <unsigned n, typename F, typename G, typename E> + metal::vec<n, mln_result(F)> + helper_composed_<n,F,G,E,true>::operator()(const metal::vec<n, mln_result(F)>& v) const { return this->m_(v); } - template <typename F, typename G> + template <unsigned n, typename F, typename G, typename E> void - helper_composed_<F,G,E,true>::set_first(const F& f) + helper_composed_<n,F,G,E,true>::set_first(const F& f) { this->f_ = f; this->m_ = this->f_.mat() * this->g_.mat(); } - template <typename F, typename G> + template <unsigned n, typename F, typename G, typename E> void - helper_composed_<F,G,E,true>::set_second(const G& g) + helper_composed_<n,F,G,E,true>::set_second(const G& g) { this->g_ = g; this->m_ = this->f_.mat() * this->g_.mat(); @@ -194,38 +198,38 @@ // Implementation of the non bijective version. - template <typename F, typename G> - helper_composed_<F,G,E,false>::helper_composed_() + template <unsigned n, typename F, typename G, typename E> + helper_composed_<n,F,G,E,false>::helper_composed_() { this->m_ = h_mat<dim,mln_result(F)>::Id; } - template <typename F, typename G> - helper_composed_<F,G,E,false>::helper_composed_(const F& f, const G& g) + template <unsigned n, typename F, typename G, typename E> + helper_composed_<n,F,G,E,false>::helper_composed_(const F& f, const G& g) :f_(f), g_(g) { this->m_ = f_.mat() * g_.mat(); } - template <typename F, typename G> - metal::vec<helper_composed_<F,G,E,false>::dim, mln_result(F)> - helper_composed_<F,G,E,false>::operator()(const metal::vec<dim, mln_result(F)>& v) const + template <unsigned n, typename F, typename G, typename E> + metal::vec<n, mln_result(F)> + helper_composed_<n,F,G,E,false>::operator()(const metal::vec<n, mln_result(F)>& v) const { return this->m_(v); } - template <typename F, typename G> + template <unsigned n, typename F, typename G, typename E> void - helper_composed_<F,G,E,false>::set_first(const F& f) + helper_composed_<n,F,G,E,false>::set_first(const F& f) { this->f_ = f; this->m_ = this->f_.mat() * this->g_.mat(); } - template <typename F, typename G> + template <unsigned n, typename F, typename G, typename E> void - helper_composed_<F,G,E,false>::set_second(const G& g) + helper_composed_<n,F,G,E,false>::set_second(const G& g) { this->g_ = g; this->m_ = this->f_.mat() * this->g_.mat();

17 years, 3 months

milena r1321: Add tests macros

by Matthieu Garrigues

URL: https://svn.lrde.epita.fr/svn/oln/trunk/milena ChangeLog: 2007-10-11 Matthieu Garrigues <garrigues(a)lrde.epita.fr> Add tests macros. * tests/value_macros.hh: Macros to factorise tests. --- value_macros.hh | 104 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 104 insertions(+) Index: trunk/milena/tests/value_macros.hh =================================================================== --- trunk/milena/tests/value_macros.hh (revision 0) +++ trunk/milena/tests/value_macros.hh (revision 1321) @@ -0,0 +1,104 @@ +// Copyright (C) 2007 EPITA Research and Development Laboratory +// +// 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. This exception does not however invalidate any other +// reasons why the executable file might be covered by the GNU General +// Public License. + +/*! \file tests/value_macros.hh + * + * \brief Utilities to tests value types. + */ + +#define sym_compare_assert(V1, OP, V2) \ + \ + mln_assertion(V1 OP V2); \ + mln_assertion(-V1 OP -V2); \ + mln_assertion(V2 OP V1); \ + mln_assertion(-V2 OP -V1); + +#define asym_compare_assert(V1, OP, V2) \ + \ + mln_assertion(V1 OP V2); \ + mln_assertion(!(-V1 OP -V2)); \ + mln_assertion(-V2 OP -V1); \ + mln_assertion(!(V2 OP V1)); + +// For unsigned types, V1 > V2 if op is minus +#define test_interop(T1, T2, OP, V1, V2) \ + \ +{ \ + T1 i = V1; \ + T2 j = V2; \ + \ + i = i OP j; \ + sym_compare_assert(i, ==, float(V1 OP V2)); \ + sym_compare_assert(j, ==, float(V2)); \ + \ + i = V1; \ + j = V2; \ + \ + j = i OP j; \ + sym_compare_assert(j, ==, float(V1 OP V2)); \ + sym_compare_assert(i, ==, float(V1)); \ + \ + i = V1; \ + i OP##= i; \ + sym_compare_assert(i, ==, float(V1 OP V1)); \ + \ + i = V1; \ + j = V2; \ + i OP##= j; \ + sym_compare_assert(i, ==, float(V1 OP V2)); \ + \ + j OP##= j; \ + sym_compare_assert(j, ==, float(V2 OP V2)); \ + \ + i = V1; \ + j = V2; \ + j OP##= i; \ + sym_compare_assert(j, ==, float(V2 OP V1)); \ + \ + i = V1; \ + i OP##= i; \ + sym_compare_assert(i, ==, float(((V1 OP V1)))); \ +} + +#define test_operator(T, OP, V1, V2) \ + \ +{ \ + T i = V1; \ + T j = V2; \ + \ + i = i OP j; \ + sym_compare_assert(i, ==, float(V1 OP V2)); \ + sym_compare_assert(j, ==, float(V2)); \ + \ + i = V1; \ + i OP##= i; \ + sym_compare_assert(i, ==, float(V1 OP V1)); \ + \ + i = V1; \ + j = V2; \ + i OP##= j; \ +}

17 years, 3 months

milena r1320: Fix graylevel. Tests on graylevel

by Matthieu Garrigues

URL: https://svn.lrde.epita.fr/svn/oln/trunk/milena ChangeLog: 2007-10-11 Matthieu Garrigues <garrigues(a)lrde.epita.fr> Fix graylevel. Tests on graylevel. * mln/value/graylevel.hh: Re add operator=(int) * tests/value_int_u8.cc: More tests. * tests/value_graylevel.cc: Likewise. FIXME : to augment. --- mln/value/graylevel.hh | 10 +++ tests/value_graylevel.cc | 144 +++++++++++++++++++++++++++++++++++++++++++---- tests/value_int_u8.cc | 94 ++++++++++-------------------- 3 files changed, 175 insertions(+), 73 deletions(-) Index: trunk/milena/tests/value_int_u8.cc =================================================================== --- trunk/milena/tests/value_int_u8.cc (revision 1319) +++ trunk/milena/tests/value_int_u8.cc (revision 1320) @@ -31,37 +31,7 @@ */ #include <mln/value/int_u8.hh> - -#define test_operator(T, OP, V1, V2) \ - \ -{ \ - T i = V1; \ - T j = V2; \ - \ - i = i OP j; \ - mln_assertion(i == (V1 OP V2)); \ - mln_assertion(j == V2); \ - \ - i OP##= i; \ - mln_assertion(i == (((V1 OP V2) OP (V1 OP V2)))); \ -} - -#define test_interop(T1, T2, OP, V1, V2) \ - \ -{ \ - T1 i = V1; \ - T2 j = V2; \ - \ - i = i OP j; \ - mln_assertion(i == (V1 OP V2)); \ - mln_assertion(j == V2); \ - \ - i OP##= i; \ - mln_assertion(i == (((V1 OP V2) OP (V1 OP V2)))); \ -} - - -// test_operator +#include <tests/value_macros.hh> int main() { @@ -73,21 +43,21 @@ // Assignment. { i = 51; - mln_assertion(i == 51); + sym_compare_assert(i, ==, 51); i = 51u; - mln_assertion(i == 51); + sym_compare_assert(i, ==, 51); signed char c = 51; i = c; - mln_assertion(i == 51); + sym_compare_assert(i, ==, 51); j = i; - mln_assertion(j == 51); + sym_compare_assert(j, ==, 51); i = 3; - mln_assertion(3.0f == i); - mln_assertion(i != 2.99f); + sym_compare_assert(3.0f, ==, i); + sym_compare_assert(i, !=, 2.99f); // Error at run-time as expected :-) // i = 256; @@ -101,16 +71,16 @@ int_u8 i = 42; int_u8 j = 51; - mln_assertion(i < j); - mln_assertion(j > i); - mln_assertion(i < 12345); - mln_assertion(12345 > i); - - mln_assertion(i != j); - mln_assertion(i == 42); - mln_assertion(42 == i); - mln_assertion(i != 69); - mln_assertion(69 != i); + asym_compare_assert(i, <, j); + asym_compare_assert(j, >, i); + asym_compare_assert(i, <, 12345.f); + asym_compare_assert(12345.f, >, i); + + sym_compare_assert(i, !=, j); + sym_compare_assert(i, ==, 42.f); + sym_compare_assert(42.f, ==, i); + sym_compare_assert(i, !=, 69.f); + sym_compare_assert(69.f, !=, i); } @@ -124,13 +94,13 @@ int_u8 i = 234; i++; - mln_assertion(i == 235); + sym_compare_assert(i, ==, 235.f); ++i; - mln_assertion(i == 236); + sym_compare_assert(i, ==, 236.f); i = +i; - mln_assertion(i == 236); + sym_compare_assert(i, ==, 236.f); } @@ -139,26 +109,24 @@ test_operator(int_u8, -, 100, 5); test_interop(int_u8, int, -, 100, 5); test_interop(int_u8, char, -, 100, 5); - test_interop(int_u8, unsigned char, -, 100, 5); + test_interop(int_u8, unsigned char, -, 5, 5); int_u8 c = 255; c -= c; - mln_assertion(c == 0); + sym_compare_assert(c, ==, 0.f); int_u8 i = 236; i--; - mln_assertion(i == 235); + sym_compare_assert(i, ==, 235.f); --i; - mln_assertion(i == 234); + sym_compare_assert(i, ==, 234.f); - std::cout << (-i) << " FIXME Matthieu: add .f to literals " << i << std::endl; - mln_assertion(-i == -234); // FIXME: old version - mln_assertion(-i == -234.f); // FIXME: new better version + sym_compare_assert(-i, ==, -234.f); - mln_assertion(i * -2 != 0.f); + sym_compare_assert(i * -2, !=, 0.f); std::cout << (i) << " * -2 = " << (i * -2) << ' ' << (-2 * i) << ' ' @@ -176,14 +144,14 @@ int_u8 c = 255; c *= 0; - mln_assertion(c == 0); + sym_compare_assert(c, ==, 0.f); i *= 2; int k; k *= i; unsigned char d = 0; i *= d; - mln_assertion(i == 0); + sym_compare_assert(i, ==, 0.f); // Error at run-time as expected :-) // i = 128; @@ -201,13 +169,13 @@ int_u8 c = 200; c /= 1; - mln_assertion(c == 200); + sym_compare_assert(c, ==, 200.f); c /= 2; - mln_assertion(c == 100); + sym_compare_assert(c, ==, 100.f); int_u8 d = 2; c /= 2; - mln_assertion(c == 50); + sym_compare_assert(c, ==, 50.f); } Index: trunk/milena/tests/value_graylevel.cc =================================================================== --- trunk/milena/tests/value_graylevel.cc (revision 1319) +++ trunk/milena/tests/value_graylevel.cc (revision 1320) @@ -27,7 +27,9 @@ /*! \file tests/value_graylevel.cc * - * \brief Tests on mln::value::graylevel. + * \brief Tests on mln::value::graylevel. Tests operations between + * graylevel of different encodings. + * */ @@ -45,22 +47,144 @@ using mln::literal::white; using mln::literal::black; + // Literals + { gl8 a = white; - gl16 b = black; + gl16 b = white; + mln_assertion(a == b); - mln_assertion(a.value() != b.value()); + mln_assertion(a.value() == 255); + mln_assertion(b.value() == 65535); - gl8 c = (a + b) / 2; + gl8 c = (white + white) / 2; mln_assertion(c == white); mln_assertion(c.value() == 255); - c = a; - mln_assertion(c == white); + a = black; + b = black; - c = (a * 2) / 2; - mln_assertion(c == white); + mln_assertion(a == b); + mln_assertion(a.value() == 0); + mln_assertion(b.value() == 0); + + c = (black + black) / 2; + mln_assertion(c == black); + mln_assertion(c.value() == 0); + } + + // Assigment + { + gl8 a; + gl8 b; + + a = white; + mln_assertion(a == white); + mln_assertion(a.value() == 255); + + a = 23; + mln_assertion(a != white); + mln_assertion(a != black); + mln_assertion(a.value() == 23); + + b = 2; + mln_assertion(b != white); + mln_assertion(b != black); + mln_assertion(b.value() == 2); + + a = b; + mln_assertion(a.value() == 2); + + signed char c = 51; + a = c; + mln_assertion(a.value() == 51); + + // bounds + a = 255; + mln_assertion(a.value() == 255); + a = 0; + mln_assertion(a.value() == 0); + } + + // Addition + { + gl8 a; + gl16 b; + + // gl8 <- gl8 + gl8 + a = 42; + b = 16969; + a += a; + mln_assertion(a.value() == 84); + + a = 42; + b = 16969; + a = a + a; + mln_assertion(a.value() == 84); + + // gl8 <- gl8 + gl16 + a = 42; + b = 16969; + a = a + b; + mln_assertion(a.value() == (42 + b.value() / 257) ); + a = 42; + b = 16969; + a += b; + mln_assertion(a.value() == (42 + b.value() / 257) ); + + + // gl16 <- gl8 + gl16 + a = 42; + b = 16969; + b += a; + mln_assertion(b.value() == (42 * 257 + 16969) ); + + a = 42; + b = 16969; + b = a + b; + mln_assertion(b.value() == (42 * 257 + 16969) ); + + // misc + a = 255; + b = 0; + a = a + b; + mln_assertion(a.value() == 255); + + a = 0; + b = 65535; + a = a + b; + mln_assertion(a.value() == 255); + } + + + + // Not exhaustive + + // gl8 a = white; + // gl16 b = white; + // mln_assertion(a == b); + // // mln_assertion(-a == -b); + + // mln_assertion(a.value() != b.value()); + + // { + // gl8 c = (a + b) / 2; + // mln_assertion(c == white); + // mln_assertion(c.value() == 255); + + // c = a; + // mln_assertion(c == white); + + // c = (a * 2) / 2; + // mln_assertion(c == white); + + // c = c / 6; + // } - c = c / 6; + // { + // gl8 c = (white + white) / 2; + // mln_assertion(c == white); + // mln_assertion(c.value() == 255); + // } - gray g = black; + // gray g = black; } Index: trunk/milena/mln/value/graylevel.hh =================================================================== --- trunk/milena/mln/value/graylevel.hh (revision 1319) +++ trunk/milena/mln/value/graylevel.hh (revision 1320) @@ -162,6 +162,16 @@ template <unsigned n> graylevel<n>& + graylevel<n>::operator=(int val) + { + mln_precondition(val >= 0); + mln_precondition(unsigned(val) <= mln_max(mln_enc(int_u<n>))); + this->v_ = val; + return *this; + } + + template <unsigned n> + graylevel<n>& graylevel<n>::operator=(const literal::black_t&) { this->v_ = 0; Index: trunk/milena/mln/value/gray.hh ===================================================================

17 years, 3 months

milena r1319: Try to reduce number of files in doc/html

by Matthieu Garrigues

URL: https://svn.lrde.epita.fr/svn/oln/trunk/milena ChangeLog: 2007-10-11 Matthieu Garrigues <garrigues(a)lrde.epita.fr> Try to reduce number of files in doc/html. * doc/Doxyfile.in: Create_subdirs = YES. --- Doxyfile.in | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) Index: trunk/milena/doc/Doxyfile.in =================================================================== --- trunk/milena/doc/Doxyfile.in (revision 1318) +++ trunk/milena/doc/Doxyfile.in (revision 1319) @@ -48,7 +48,7 @@ # source files, where putting all generated files in the same directory would # otherwise cause performance problems for the file system. -CREATE_SUBDIRS = NO +CREATE_SUBDIRS = YES # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this

17 years, 3 months

milena r1318: Add queue with priority in sandbox

by Guillaume Duhamel

URL: https://svn.lrde.epita.fr/svn/oln/trunk/milena ChangeLog: 2007-10-11 Guillaume Duhamel <guillaume.duhamel(a)lrde.epita.fr> Add queue with priority in sandbox. * queue_p_priority.cc: New test for queue with priority. * queue_p_priority.hh: New queue with priority. * queue_p_fast.hh, * translate_image.cc, * translate_image.hh, * log.txt: Update. --- log.txt | 9 + queue_p_fast.hh | 1 queue_p_priority.cc | 64 ++++++++++ queue_p_priority.hh | 314 ++++++++++++++++++++++++++++++++++++++++++++++++++++ translate_image.cc | 19 +-- translate_image.hh | 24 +++ 6 files changed, 419 insertions(+), 12 deletions(-) Index: trunk/milena/sandbox/duhamel/queue_p_priority.cc =================================================================== --- trunk/milena/sandbox/duhamel/queue_p_priority.cc (revision 0) +++ trunk/milena/sandbox/duhamel/queue_p_priority.cc (revision 1318) @@ -0,0 +1,64 @@ +#include "queue_p_priority.hh" +#include <mln/core/image2d.hh> + +int main () +{ + using namespace mln; + + mln::queue_p_priority<point2d, unsigned> q; + point2d p1 (1,1); + point2d p2 (1,5); + point2d p3 (2,7); + + mln_assertion (q.empty ()); + + mln_assertion (q.npoints () == 0); + + q.push_force (p3); + q.push_force (p1, 3); + q.push_force (p2, 5); + + + mln_assertion (!q.empty ()); + + mln_assertion (q.has (p1)); + mln_assertion (q.has (p2)); + mln_assertion (q.has (p3)); + + mln_assertion (q.npoints () == 3); + mln_assertion (q.front () == p2); + q.pop (); + + mln_assertion (q.has (p1)); + mln_assertion (!q.has (p2)); + mln_assertion (q.has (p3)); + + mln_assertion (q.npoints () == 2); + mln_assertion (q.front () == p1); + q.pop (); + + mln_assertion (!q.has (p1)); + mln_assertion (!q.has (p2)); + mln_assertion (q.has (p3)); + + mln_assertion (q.npoints () == 1); + mln_assertion (q.front () == p3); + q.pop (); + + mln_assertion (!q.has (p1)); + mln_assertion (!q.has (p2)); + mln_assertion (!q.has (p3)); + mln_assertion (q.npoints () == 0); + + mln_assertion (q.empty ()); + + q.push_force (p3); + q.push_force (p2, 5); + q.push_force (p1, 3); + + mln_assertion (q[0] == p3); + mln_assertion (q[1] == p1); + mln_assertion (q[2] == p2); + q.clear (); + mln_assertion (q.empty ()); +} Index: trunk/milena/sandbox/duhamel/translate_image.hh =================================================================== --- trunk/milena/sandbox/duhamel/translate_image.hh (revision 1317) +++ trunk/milena/sandbox/duhamel/translate_image.hh (revision 1318) @@ -61,6 +61,27 @@ } // end of namespace mln::internal + + namespace trait + { + + template <typename I> + struct image_< translate_image > : default_image_morpher_< I, mln_value(I), + translate_image > + { + + typedef trait::image::category::domain_morpher category; + + typedef mln_trait_image_io_from_(I) io; + + typedef mln_trait_image_data_from_(I) data; + + }; + + } // end of namespace mln::trait + + + /*! \brief FIXME * */ @@ -73,7 +94,6 @@ /// Return type of read-write access. typedef typename internal::morpher_lvalue_::ret lvalue; - /// Skeleton. typedef translate_image< tag::image_ > skeleton; @@ -84,7 +104,7 @@ translate_image(I& ima, const mln_dpoint(I) dp); translate_image(); - /// FIXME: Doc! + /// Return domain of translated_image. const box2d& domain() const; /// Test if a pixel value is accessible at \p p. Index: trunk/milena/sandbox/duhamel/queue_p_fast.hh =================================================================== --- trunk/milena/sandbox/duhamel/queue_p_fast.hh (revision 1317) +++ trunk/milena/sandbox/duhamel/queue_p_fast.hh (revision 1318) @@ -124,7 +124,6 @@ mutable accu::bbox bb_; mutable bool bb_needs_update_; void bb_update_() const; - }; Index: trunk/milena/sandbox/duhamel/queue_p_priority.hh =================================================================== --- trunk/milena/sandbox/duhamel/queue_p_priority.hh (revision 0) +++ trunk/milena/sandbox/duhamel/queue_p_priority.hh (revision 1318) @@ -0,0 +1,314 @@ +// Copyright (C) 2007 EPITA Research and Development Laboratory +// +// 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. 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_QUEUE_P_PRIORITY_HH +# define MLN_CORE_QUEUE_P_PRIORITY_HH + +/*! \file mln/core/queue_p_priority.hh + * + * \brief Definition of a point set class based on std::deque. + */ + +# include <vector> +# include <deque> +# include <map> +# include <algorithm> +# include <iterator> + +# include <mln/core/internal/point_set_base.hh> +# include <mln/core/vec_p_piter.hh> +# include <mln/accu/bbox.hh> +# include <mln/core/queue_p.hh> + +namespace mln +{ + + // Fwd decls. + template <typename P> struct vec_p_fwd_piter_; + template <typename P> struct vec_p_bkd_piter_; + + + /*! \brief Point queue class (based on std::deque). + * + * This is a mathematical set of points (unique insertion). + * + * \todo Make it work with P being a Point_Site. + * \todo Add a parameter flag to choose another policy for "push" + * (i.e., no-op if multiple or allow multiple insertions). + * + * \warning We have some troubles with point set comparison based on + * a call to npoints() when this container is multiple. + */ + template <typename P, typename T> + class queue_p_priority// : public internal::point_set_base_< P, queue_p_priority > + { + public: + + /// Forward Point_Iterator associated type. + typedef vec_p_fwd_piter_ fwd_piter; + + /// Backward Point_Iterator associated type. + typedef vec_p_bkd_piter_ bkd_piter; + + /// Constructor. + queue_p_priority(); + + /// Test is \p p belongs to this point set. + bool has(const P& p); + + /// Test if queue is empty or not. + bool empty(); + + /// Give the number of points. + unsigned npoints(); + + /// Give the exact bounding box. + const box_& bbox(); + + /// Push force a point \p p in the queue. + queue_p_priority<P, T>& push_force(const P& p, T prio = 0); + + /// Push a point \p p in the queue. + queue_p_priority<P, T>& push(const P& p, T prio = 0); + + /// Pop (remove) the front point \p p from the queue; \p p is the + /// least recently inserted point. + void pop(); + + /// Give the front point \p p of the queue; \p p is the least + /// recently inserted point. + const P& front(); + + /// Clear the queue. + void clear(); + + /// Return the corresponding std::vector of points. + const std::vector& vect() const; + + /// Return the \p i-th point. + const P& operator[](unsigned i); + + protected: + + std::map<const T, queue_p > q_; + + mutable std::vector vect_; + mutable bool vect_needs_update_; + void vect_update_(); + + mutable accu::bbox bb_; + mutable bool bb_needs_update_; + void bb_update_(); + + }; + + + +# ifndef MLN_INCLUDE_ONLY + + template <typename P, typename T> + queue_p_priority<P, T>::queue_p_priority() + { + } + + template <typename P, typename T> + void + queue_p_priority<P, T>::vect_update_() + { + vect_.clear(); + vect_.reserve(npoints()); + + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + std::copy(q_[(*it).first].begin(), q_[(*it).first].end(), + std::back_inserter(vect_)); + vect_needs_update_ = false; + } + + template <typename P, typename T> + void + queue_p_priority<P, T>::bb_update_() + { + bb_.init(); + + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + for (unsigned i = 0; i < q_[(*it).first].npoints (); ++i) + bb_.take(q_[(*it).first][i]); + } + + + template <typename P, typename T> + bool + queue_p_priority<P, T>::has(const P& p) + { + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + if (q_[(*it).first].has (p)) + return true; + return false; + } + + template <typename P, typename T> + bool + queue_p_priority<P, T>::empty() + { + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + if (!q_[(*it).first].empty ()) + return false; + return true; + } + + template <typename P, typename T> + unsigned + queue_p_priority<P, T>::npoints() + { + unsigned res = 0; + + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + if (!q_[(*it).first].empty ()) + res += q_[(*it).first].npoints(); + return res; + } + + template <typename P, typename T> + const box_& + queue_p_priority<P, T>::bbox() + { + mln_precondition(npoints() != 0); + if (bb_needs_update_) + bb_update_(); + return bb_.to_result(); + } + + template <typename P, typename T> + queue_p_priority<P, T>& + queue_p_priority<P, T>::push_force(const P& p, T prio) + { + q_[prio].push_force (p); + + return *this; + } + + template <typename P, typename T> + queue_p_priority<P, T>& + queue_p_priority<P, T>::push(const P& p, T prio) + { + if (! has(p)) + return this->push_force(p, prio); + else + return *this; + } + + template <typename P, typename T> + void + queue_p_priority<P, T>::pop() + { + typename std::map<T, queue_p >::const_reverse_iterator it = q_.rbegin (); + + for (; it != q_.rend (); ++it) + if (!q_[(*it).first].empty ()) + return q_[(*it).first].pop (); + + if (! vect_needs_update_) + { + vect_needs_update_ = true; + bb_needs_update_ = true; + } + } + + template <typename P, typename T> + const P& + queue_p_priority<P, T>::front() + { + mln_precondition(! q_.empty()); + + typename std::map<T, queue_p >::const_reverse_iterator it = q_.rbegin (); + + for (; it != q_.rend (); ++it) + if (!q_[(*it).first].empty ()) + break; + return q_[(*it).first].front (); + } + + template <typename P, typename T> + void + queue_p_priority<P, T>::clear() + { + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + + for (; it != q_.end (); ++it) + q_[(*it).first].clear (); + q_.clear(); + vect_needs_update_ = false; + bb_needs_update_ = false; + } + + template <typename P, typename T> + const std::vector& + queue_p_priority<P, T>::vect() const + { + if (vect_needs_update_) + vect_update_(); + return vect_; + } + + template <typename P, typename T> + const P& + queue_p_priority<P, T>::operator[](unsigned i) + { + mln_precondition(i < npoints()); + + typename std::map<T, queue_p >::const_iterator it = q_.begin (); + unsigned cpt = 0; + + for (; it != q_.end (); ++it) + { + if (!q_[(*it).first].empty ()) + for (cpt = 0; cpt < q_[(*it).first].npoints (); ++cpt) + { + if (i == 0) + return q_[(*it).first][cpt]; + --i; + } + } + return q_[(*it).first][cpt]; + } + +# endif // ! MLN_INCLUDE_ONLY + +} // end of namespace mln + + +#endif // ! MLN_CORE_QUEUE_P_PRIORITY_HH Index: trunk/milena/sandbox/duhamel/translate_image.cc =================================================================== --- trunk/milena/sandbox/duhamel/translate_image.cc (revision 1317) +++ trunk/milena/sandbox/duhamel/translate_image.cc (revision 1318) @@ -6,7 +6,7 @@ #include <mln/border/fill.hh> #include <mln/debug/println_with_border.hh> #include <mln/debug/println.hh> -#include "translate_image.hh" +#include <mln/core/translate_image.hh> int main () { @@ -31,12 +31,13 @@ std::cout << "translated image :" << std::endl; debug::println (tmp); -// std::cout << std::endl; -// I out (4,4); -// level::paste(ima, out); -// level::paste(tmp, out); -// std::cout << "pasted image :" -// << std::endl; -// debug::println (out); -// std::cout << std::endl; + + std::cout << std::endl; + I out (4,4); + level::paste(ima, out); + level::paste(tmp, out); + std::cout << "pasted image :" + << std::endl; + debug::println (out); + std::cout << std::endl; } Index: trunk/milena/sandbox/duhamel/log.txt =================================================================== --- trunk/milena/sandbox/duhamel/log.txt (revision 1317) +++ trunk/milena/sandbox/duhamel/log.txt (revision 1318) @@ -13,3 +13,12 @@ - mesh_p / mesh_image - draw mesh - graph_labeling + +- show/display. + +- Add translate image class. +- Add convert/to_tiles. + +- border/resize. + +- queue with priority.

17 years, 3 months

milena r1317: Fix traits for translate_image

by Guillaume Duhamel

URL: https://svn.lrde.epita.fr/svn/oln/trunk/milena ChangeLog: 2007-10-11 Guillaume Duhamel <guillaume.duhamel(a)lrde.epita.fr> Fix traits for translate_image. * translate_image.hh: Fix traits. --- translate_image.hh | 16 +++++----------- 1 file changed, 5 insertions(+), 11 deletions(-) Index: trunk/milena/mln/core/translate_image.hh =================================================================== --- trunk/milena/mln/core/translate_image.hh (revision 1316) +++ trunk/milena/mln/core/translate_image.hh (revision 1317) @@ -73,19 +73,13 @@ struct image_< translate_image > : default_image_morpher_< I, mln_value(I), translate_image > { - typedef trait::image::category::domain_morpher category; -// typedef mln_trait_image_access(I)() access; -// typedef mln_trait_image_space(I)() space; -// typedef mln_trait_image_size(I)() size; -// typedef mln_trait_image_support(I)() support; - -// typedef mln_trait_image_border(I)() border; -// typedef mln_trait_image_data(I)() data; -// typedef mln_trait_image_io(I)() io; -// typedef mln_trait_image_speed(I)() speed; - + typedef mln_trait_image_access(I) access; + typedef mln_trait_image_space(I) space; + typedef mln_trait_image_size(I) size; + typedef mln_trait_image_support(I) support; + typedef mln_trait_image_border(I) border; typedef mln_trait_image_io_from_(I) io; typedef mln_trait_image_data_from_(I) data;

17 years, 3 months

milena r1316: Fix bug in translate_image

by Guillaume Duhamel

URL: https://svn.lrde.epita.fr/svn/oln/trunk/milena ChangeLog: 2007-10-11 Guillaume Duhamel <guillaume.duhamel(a)lrde.epita.fr> Fix bug in translate_image. * translate_image.hh: Fix. --- translate_image.hh | 23 ++++++++++++----------- 1 file changed, 12 insertions(+), 11 deletions(-) Index: trunk/milena/mln/core/translate_image.hh =================================================================== --- trunk/milena/mln/core/translate_image.hh (revision 1315) +++ trunk/milena/mln/core/translate_image.hh (revision 1316) @@ -76,18 +76,18 @@ typedef trait::image::category::domain_morpher category; -// typedef mln_trait_image_access_from(I) access; -// typedef mln_trait_image_space_from(I) space; -// typedef mln_trait_image_size_from(I) size; -// typedef mln_trait_image_support_from(I) support; - -// typedef mln_trait_image_border_from(I) border; - typedef mln_trait_image_data_from(I) data; - typedef mln_trait_image_io_from(I) io; -// typedef mln_trait_image_speed_from(I) speed; +// typedef mln_trait_image_access(I)() access; +// typedef mln_trait_image_space(I)() space; +// typedef mln_trait_image_size(I)() size; +// typedef mln_trait_image_support(I)() support; + +// typedef mln_trait_image_border(I)() border; +// typedef mln_trait_image_data(I)() data; +// typedef mln_trait_image_io(I)() io; +// typedef mln_trait_image_speed(I)() speed; -// typedef mln_trait_image_io_from_(I) io; -// typedef mln_trait_image_data_from_(I) data; + typedef mln_trait_image_io_from_(I) io; + typedef mln_trait_image_data_from_(I) data; }; @@ -106,6 +106,7 @@ { typedef mln::internal::image_morpher_< I, mln_pset(I), translate_image > super_; + typedef line_piter_<mln_psite(I)> line_piter; /// Return type of read-write access. typedef typename internal::morpher_lvalue_::ret lvalue;

17 years, 3 months

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Olena-patches