grid.hpp 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185
  1. // (C) Copyright Gennadiy Rozental 2001.
  2. // Distributed under the Boost Software License, Version 1.0.
  3. // (See accompanying file LICENSE_1_0.txt or copy at
  4. // http://www.boost.org/LICENSE_1_0.txt)
  5. // See http://www.boost.org/libs/test for the library home page.
  6. //
  7. ///@file
  8. /// Defines monomorphic dataset n+m dimentional *. Samples in this
  9. /// dataset is grid of elements in DataSet1 and DataSet2. There will be total
  10. /// |DataSet1| * |DataSet2| samples
  11. // ***************************************************************************
  12. #ifndef BOOST_TEST_DATA_MONOMORPHIC_GRID_HPP_101512GER
  13. #define BOOST_TEST_DATA_MONOMORPHIC_GRID_HPP_101512GER
  14. // Boost.Test
  15. #include <boost/test/data/config.hpp>
  16. #if !defined(BOOST_TEST_NO_GRID_COMPOSITION_AVAILABLE) || defined(BOOST_TEST_DOXYGEN_DOC__)
  17. #include <boost/test/data/monomorphic/fwd.hpp>
  18. #include <boost/test/data/monomorphic/sample_merge.hpp>
  19. #include <boost/mpl/identity.hpp>
  20. #include <boost/test/detail/suppress_warnings.hpp>
  21. //____________________________________________________________________________//
  22. namespace boost {
  23. namespace unit_test {
  24. namespace data {
  25. namespace monomorphic {
  26. // ************************************************************************** //
  27. // ************** grid ************** //
  28. // ************************************************************************** //
  29. //! Implements the dataset resulting from a cartesian product/grid operation on datasets.
  30. //!
  31. //! The arity of the resulting dataset is the sum of the arity of its operands.
  32. template<typename DataSet1, typename DataSet2>
  33. class grid {
  34. typedef typename boost::decay<DataSet1>::type dataset1_decay;
  35. typedef typename boost::decay<DataSet2>::type dataset2_decay;
  36. typedef typename dataset1_decay::iterator dataset1_iter;
  37. typedef typename dataset2_decay::iterator dataset2_iter;
  38. public:
  39. struct iterator {
  40. // Constructor
  41. explicit iterator( dataset1_iter iter1, DataSet2 const& ds2 )
  42. : m_iter1( std::move( iter1 ) )
  43. , m_iter2( std::move( ds2.begin() ) )
  44. , m_ds2( &ds2 )
  45. , m_ds2_pos( 0 )
  46. {}
  47. using iterator_sample = decltype(
  48. sample_merge( *std::declval<dataset1_iter>(),
  49. *std::declval<dataset2_iter>()) );
  50. // forward iterator interface
  51. auto operator*() const -> iterator_sample {
  52. return sample_merge( *m_iter1, *m_iter2 );
  53. }
  54. void operator++()
  55. {
  56. ++m_ds2_pos;
  57. if( m_ds2_pos != m_ds2->size() )
  58. ++m_iter2;
  59. else {
  60. m_ds2_pos = 0;
  61. ++m_iter1;
  62. m_iter2 = std::move( m_ds2->begin() );
  63. }
  64. }
  65. private:
  66. // Data members
  67. dataset1_iter m_iter1;
  68. dataset2_iter m_iter2;
  69. dataset2_decay const* m_ds2;
  70. data::size_t m_ds2_pos;
  71. };
  72. public:
  73. enum { arity = boost::decay<DataSet1>::type::arity + boost::decay<DataSet2>::type::arity };
  74. //! Constructor
  75. grid( DataSet1&& ds1, DataSet2&& ds2 )
  76. : m_ds1( std::forward<DataSet1>( ds1 ) )
  77. , m_ds2( std::forward<DataSet2>( ds2 ) )
  78. {}
  79. //! Move constructor
  80. grid( grid&& j )
  81. : m_ds1( std::forward<DataSet1>( j.m_ds1 ) )
  82. , m_ds2( std::forward<DataSet2>( j.m_ds2 ) )
  83. {}
  84. // dataset interface
  85. data::size_t size() const {
  86. BOOST_TEST_DS_ASSERT( !m_ds1.size().is_inf() && !m_ds2.size().is_inf(), "Grid axes can't have infinite size" );
  87. return m_ds1.size() * m_ds2.size();
  88. }
  89. iterator begin() const { return iterator( m_ds1.begin(), m_ds2 ); }
  90. private:
  91. // Data members
  92. DataSet1 m_ds1;
  93. DataSet2 m_ds2;
  94. };
  95. //____________________________________________________________________________//
  96. // A grid dataset is a dataset
  97. template<typename DataSet1, typename DataSet2>
  98. struct is_dataset<grid<DataSet1,DataSet2>> : mpl::true_ {};
  99. //____________________________________________________________________________//
  100. namespace result_of {
  101. /// Result type of the grid operation on dataset.
  102. template<typename DS1Gen, typename DS2Gen>
  103. struct grid {
  104. typedef monomorphic::grid<typename DS1Gen::type,typename DS2Gen::type> type;
  105. };
  106. } // namespace result_of
  107. //____________________________________________________________________________//
  108. //! Grid operation
  109. template<typename DataSet1, typename DataSet2>
  110. inline typename boost::lazy_enable_if_c<is_dataset<DataSet1>::value && is_dataset<DataSet2>::value,
  111. result_of::grid<mpl::identity<DataSet1>,mpl::identity<DataSet2>>
  112. >::type
  113. operator*( DataSet1&& ds1, DataSet2&& ds2 )
  114. {
  115. return grid<DataSet1,DataSet2>( std::forward<DataSet1>( ds1 ), std::forward<DataSet2>( ds2 ) );
  116. }
  117. //____________________________________________________________________________//
  118. //! @overload boost::unit_test::data::operator*
  119. template<typename DataSet1, typename DataSet2>
  120. inline typename boost::lazy_enable_if_c<is_dataset<DataSet1>::value && !is_dataset<DataSet2>::value,
  121. result_of::grid<mpl::identity<DataSet1>,data::result_of::make<DataSet2>>
  122. >::type
  123. operator*( DataSet1&& ds1, DataSet2&& ds2 )
  124. {
  125. return std::forward<DataSet1>(ds1) * data::make(std::forward<DataSet2>(ds2));
  126. }
  127. //____________________________________________________________________________//
  128. //! @overload boost::unit_test::data::operator*
  129. template<typename DataSet1, typename DataSet2>
  130. inline typename boost::lazy_enable_if_c<!is_dataset<DataSet1>::value && is_dataset<DataSet2>::value,
  131. result_of::grid<data::result_of::make<DataSet1>,mpl::identity<DataSet2>>
  132. >::type
  133. operator*( DataSet1&& ds1, DataSet2&& ds2 )
  134. {
  135. return data::make(std::forward<DataSet1>(ds1)) * std::forward<DataSet2>(ds2);
  136. }
  137. } // namespace monomorphic
  138. } // namespace data
  139. } // namespace unit_test
  140. } // namespace boost
  141. #include <boost/test/detail/enable_warnings.hpp>
  142. #endif // BOOST_TEST_NO_GRID_COMPOSITION_AVAILABLE
  143. #endif // BOOST_TEST_DATA_MONOMORPHIC_GRID_HPP_101512GER