planar_pixel_iterator.hpp 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227
  1. /*
  2. Copyright 2005-2007 Adobe Systems Incorporated
  3. Use, modification and distribution are subject to the Boost Software License,
  4. Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
  5. http://www.boost.org/LICENSE_1_0.txt).
  6. See http://opensource.adobe.com/gil for most recent version including documentation.
  7. */
  8. /*************************************************************************************************/
  9. #ifndef GIL_PLANAR_PTR_H
  10. #define GIL_PLANAR_PTR_H
  11. ////////////////////////////////////////////////////////////////////////////////////////
  12. /// \file
  13. /// \brief planar pixel pointer class
  14. /// \author Lubomir Bourdev and Hailin Jin \n
  15. /// Adobe Systems Incorporated
  16. /// \date 2005-2007 \n Last updated on February 12, 2007
  17. ///
  18. ////////////////////////////////////////////////////////////////////////////////////////
  19. #include <cassert>
  20. #include <iterator>
  21. #include <boost/iterator/iterator_facade.hpp>
  22. #include "gil_config.hpp"
  23. #include "pixel.hpp"
  24. #include "step_iterator.hpp"
  25. namespace boost { namespace gil {
  26. //forward declaration (as this file is included in planar_pixel_reference.hpp)
  27. template <typename ChannelReference, typename ColorSpace>
  28. struct planar_pixel_reference;
  29. /// \defgroup ColorBaseModelPlanarPtr planar_pixel_iterator
  30. /// \ingroup ColorBaseModel
  31. /// \brief A homogeneous color base whose element is a channel iterator. Models HomogeneousColorBaseValueConcept
  32. /// This class is used as an iterator to a planar pixel.
  33. /// \defgroup PixelIteratorModelPlanarPtr planar_pixel_iterator
  34. /// \ingroup PixelIteratorModel
  35. /// \brief An iterator over planar pixels. Models PixelIteratorConcept, HomogeneousPixelBasedConcept, MemoryBasedIteratorConcept, HasDynamicXStepTypeConcept
  36. ////////////////////////////////////////////////////////////////////////////////////////
  37. /// \brief An iterator over planar pixels. Models HomogeneousColorBaseConcept, PixelIteratorConcept, HomogeneousPixelBasedConcept, MemoryBasedIteratorConcept, HasDynamicXStepTypeConcept
  38. ///
  39. /// Planar pixels have channel data that is not consecutive in memory.
  40. /// To abstract this we use classes to represent references and pointers to planar pixels.
  41. ///
  42. /// \ingroup PixelIteratorModelPlanarPtr ColorBaseModelPlanarPtr PixelBasedModel
  43. template <typename ChannelPtr, typename ColorSpace>
  44. struct planar_pixel_iterator : public iterator_facade<planar_pixel_iterator<ChannelPtr,ColorSpace>,
  45. pixel<typename std::iterator_traits<ChannelPtr>::value_type,layout<ColorSpace> >,
  46. std::random_access_iterator_tag,
  47. const planar_pixel_reference<typename std::iterator_traits<ChannelPtr>::reference,ColorSpace> >,
  48. public detail::homogeneous_color_base<ChannelPtr,layout<ColorSpace>,mpl::size<ColorSpace>::value > {
  49. private:
  50. typedef iterator_facade<planar_pixel_iterator<ChannelPtr,ColorSpace>,
  51. pixel<typename std::iterator_traits<ChannelPtr>::value_type,layout<ColorSpace> >,
  52. std::random_access_iterator_tag,
  53. const planar_pixel_reference<typename std::iterator_traits<ChannelPtr>::reference,ColorSpace> > parent_t;
  54. typedef detail::homogeneous_color_base<ChannelPtr,layout<ColorSpace>,mpl::size<ColorSpace>::value> color_base_parent_t;
  55. typedef typename std::iterator_traits<ChannelPtr>::value_type channel_t;
  56. public:
  57. typedef typename parent_t::value_type value_type;
  58. typedef typename parent_t::reference reference;
  59. typedef typename parent_t::difference_type difference_type;
  60. planar_pixel_iterator() : color_base_parent_t(0) {}
  61. planar_pixel_iterator(bool) {} // constructor that does not fill with zero (for performance)
  62. planar_pixel_iterator(const ChannelPtr& v0, const ChannelPtr& v1) : color_base_parent_t(v0,v1) {}
  63. planar_pixel_iterator(const ChannelPtr& v0, const ChannelPtr& v1, const ChannelPtr& v2) : color_base_parent_t(v0,v1,v2) {}
  64. planar_pixel_iterator(const ChannelPtr& v0, const ChannelPtr& v1, const ChannelPtr& v2, const ChannelPtr& v3) : color_base_parent_t(v0,v1,v2,v3) {}
  65. planar_pixel_iterator(const ChannelPtr& v0, const ChannelPtr& v1, const ChannelPtr& v2, const ChannelPtr& v3, const ChannelPtr& v4) : color_base_parent_t(v0,v1,v2,v3,v4) {}
  66. template <typename IC1,typename C1>
  67. planar_pixel_iterator(const planar_pixel_iterator<IC1,C1>& ptr) : color_base_parent_t(ptr) {}
  68. /// Copy constructor and operator= from pointers to compatible planar pixels or planar pixel references.
  69. /// That allow constructs like pointer = &value or pointer = &reference
  70. /// Since we should not override operator& that's the best we can do.
  71. template <typename P>
  72. planar_pixel_iterator(P* pix) : color_base_parent_t(pix, true) {
  73. function_requires<PixelsCompatibleConcept<P,value_type> >();
  74. }
  75. struct address_of { template <typename T> T* operator()(T& t) { return &t; } };
  76. template <typename P>
  77. planar_pixel_iterator& operator=(P* pix) {
  78. function_requires<PixelsCompatibleConcept<P,value_type> >();
  79. static_transform(*pix,*this, address_of());
  80. // PERFORMANCE_CHECK: Compare to this:
  81. //this->template semantic_at_c<0>()=&pix->template semantic_at_c<0>();
  82. //this->template semantic_at_c<1>()=&pix->template semantic_at_c<1>();
  83. //this->template semantic_at_c<2>()=&pix->template semantic_at_c<2>();
  84. return *this;
  85. }
  86. /// For some reason operator[] provided by iterator_facade returns a custom class that is convertible to reference
  87. /// We require our own reference because it is registered in iterator_traits
  88. reference operator[](difference_type d) const { return memunit_advanced_ref(*this,d*sizeof(channel_t));}
  89. reference operator->() const { return **this; }
  90. // PERFORMANCE_CHECK: Remove?
  91. bool operator< (const planar_pixel_iterator& ptr) const { return gil::at_c<0>(*this)< gil::at_c<0>(ptr); }
  92. bool operator!=(const planar_pixel_iterator& ptr) const { return gil::at_c<0>(*this)!=gil::at_c<0>(ptr); }
  93. private:
  94. friend class boost::iterator_core_access;
  95. void increment() { static_transform(*this,*this,detail::inc<ChannelPtr>()); }
  96. void decrement() { static_transform(*this,*this,detail::dec<ChannelPtr>()); }
  97. void advance(ptrdiff_t d) { static_transform(*this,*this,std::bind2nd(detail::plus_asymmetric<ChannelPtr,ptrdiff_t>(),d)); }
  98. reference dereference() const { return this->template deref<reference>(); }
  99. ptrdiff_t distance_to(const planar_pixel_iterator& it) const { return gil::at_c<0>(it)-gil::at_c<0>(*this); }
  100. bool equal(const planar_pixel_iterator& it) const { return gil::at_c<0>(*this)==gil::at_c<0>(it); }
  101. };
  102. namespace detail {
  103. template <typename IC> struct channel_iterator_is_mutable : public mpl::true_ {};
  104. template <typename T> struct channel_iterator_is_mutable<const T*> : public mpl::false_ {};
  105. }
  106. template <typename IC, typename C>
  107. struct const_iterator_type<planar_pixel_iterator<IC,C> > {
  108. private:
  109. typedef typename std::iterator_traits<IC>::value_type channel_t;
  110. public:
  111. typedef planar_pixel_iterator<typename channel_traits<channel_t>::const_pointer,C> type;
  112. };
  113. // The default implementation when the iterator is a C pointer is to use the standard constness semantics
  114. template <typename IC, typename C>
  115. struct iterator_is_mutable<planar_pixel_iterator<IC,C> > : public detail::channel_iterator_is_mutable<IC> {};
  116. /////////////////////////////
  117. // ColorBasedConcept
  118. /////////////////////////////
  119. template <typename IC, typename C, int K>
  120. struct kth_element_type<planar_pixel_iterator<IC,C>, K> {
  121. typedef IC type;
  122. };
  123. template <typename IC, typename C, int K>
  124. struct kth_element_reference_type<planar_pixel_iterator<IC,C>, K> : public add_reference<IC> {};
  125. template <typename IC, typename C, int K>
  126. struct kth_element_const_reference_type<planar_pixel_iterator<IC,C>, K> : public add_reference<typename add_const<IC>::type> {};
  127. /////////////////////////////
  128. // HomogeneousPixelBasedConcept
  129. /////////////////////////////
  130. template <typename IC, typename C>
  131. struct color_space_type<planar_pixel_iterator<IC,C> > {
  132. typedef C type;
  133. };
  134. template <typename IC, typename C>
  135. struct channel_mapping_type<planar_pixel_iterator<IC,C> > : public channel_mapping_type<typename planar_pixel_iterator<IC,C>::value_type> {};
  136. template <typename IC, typename C>
  137. struct is_planar<planar_pixel_iterator<IC,C> > : public mpl::true_ {};
  138. template <typename IC, typename C>
  139. struct channel_type<planar_pixel_iterator<IC,C> > {
  140. typedef typename std::iterator_traits<IC>::value_type type;
  141. };
  142. /////////////////////////////
  143. // MemoryBasedIteratorConcept
  144. /////////////////////////////
  145. template <typename IC, typename C>
  146. inline std::ptrdiff_t memunit_step(const planar_pixel_iterator<IC,C>&) { return sizeof(typename std::iterator_traits<IC>::value_type); }
  147. template <typename IC, typename C>
  148. inline std::ptrdiff_t memunit_distance(const planar_pixel_iterator<IC,C>& p1, const planar_pixel_iterator<IC,C>& p2) {
  149. return memunit_distance(gil::at_c<0>(p1),gil::at_c<0>(p2));
  150. }
  151. template <typename IC>
  152. struct memunit_advance_fn {
  153. memunit_advance_fn(std::ptrdiff_t diff) : _diff(diff) {}
  154. IC operator()(const IC& p) const { return memunit_advanced(p,_diff); }
  155. std::ptrdiff_t _diff;
  156. };
  157. template <typename IC, typename C>
  158. inline void memunit_advance(planar_pixel_iterator<IC,C>& p, std::ptrdiff_t diff) {
  159. static_transform(p, p, memunit_advance_fn<IC>(diff));
  160. }
  161. template <typename IC, typename C>
  162. inline planar_pixel_iterator<IC,C> memunit_advanced(const planar_pixel_iterator<IC,C>& p, std::ptrdiff_t diff) {
  163. planar_pixel_iterator<IC,C> ret=p;
  164. memunit_advance(ret, diff);
  165. return ret;
  166. }
  167. template <typename ChannelPtr, typename ColorSpace>
  168. inline planar_pixel_reference<typename std::iterator_traits<ChannelPtr>::reference,ColorSpace>
  169. memunit_advanced_ref(const planar_pixel_iterator<ChannelPtr,ColorSpace>& ptr, std::ptrdiff_t diff) {
  170. return planar_pixel_reference<typename std::iterator_traits<ChannelPtr>::reference,ColorSpace>(ptr, diff);
  171. }
  172. /////////////////////////////
  173. // HasDynamicXStepTypeConcept
  174. /////////////////////////////
  175. template <typename IC, typename C>
  176. struct dynamic_x_step_type<planar_pixel_iterator<IC,C> > {
  177. typedef memory_based_step_iterator<planar_pixel_iterator<IC,C> > type;
  178. };
  179. } } // namespace boost::gil
  180. #endif