Guest User

perf_array

a guest
May 27th, 2012
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.49 KB | None | 0 0
  1. #include <iostream>
  2. #include <array>
  3. #include <random>
  4.  
  5. #include <boost/timer.hpp>
  6.  
  7. using namespace std;
  8.  
  9. const size_t N1 = 64;
  10. const size_t N2 = 64;
  11. const size_t N3 = 16;
  12.  
  13. typedef array< double , N3 > array1_type;
  14. typedef array< array1_type , N2 > array2_type;
  15. typedef array< array2_type , N1 > array_type;
  16.  
  17. double do_computation1( const array_type &arr )
  18. {
  19.   double tmp = 0.0;
  20.   for( size_t i=0 ; i<N1 ; ++i )
  21.     {
  22.       for( size_t j=0 ; j<N2 ; ++j )
  23.     {
  24.       for( size_t k=0 ; k<N3 ; ++k )
  25.         {
  26.           tmp += arr[i][j][k];
  27.         }
  28.     }
  29.     }
  30.   return tmp;
  31. }
  32.  
  33. double do_computation2( const array_type &arr )
  34. {
  35.   double tmp = 0.0;
  36.   for( size_t i=0 ; i<N1 ; ++i )
  37.     {
  38.       const array2_type &a1 = arr[i];
  39.       for( size_t j=0 ; j<N2 ; ++j )
  40.     {
  41.       const array1_type &a2 = a1[j];
  42.       for( size_t k=0 ; k<N3 ; ++k )
  43.         {
  44.           tmp += a2[k];
  45.         }
  46.     }
  47.     }
  48.   return tmp;
  49. }
  50.  
  51. template< class Gen >
  52. void fill1( array_type &arr , Gen gen )
  53. {
  54.   for( size_t i=0 ; i<N1 ; ++i )
  55.     {
  56.       for( size_t j=0 ; j<N2 ; ++j )
  57.     {
  58.       for( size_t k=0 ; k<N3 ; ++k )
  59.         {
  60.           arr[i][j][k] = gen();
  61.         }
  62.     }
  63.     }
  64. }
  65.  
  66. template< class Gen >
  67. void fill2( array_type &arr , Gen gen )
  68. {
  69.   for( size_t i=0 ; i<N1 ; ++i )
  70.     {
  71.       array2_type &a1 = arr[i];
  72.       for( size_t j=0 ; j<N2 ; ++j )
  73.     {
  74.       array1_type &a2 = a1[j];
  75.       for( size_t k=0 ; k<N3 ; ++k )
  76.         {
  77.           a2[k] = gen();
  78.         }
  79.     }
  80.     }
  81. }
  82.  
  83. template< class Eng , class Dist >
  84. struct dist_gen
  85. {
  86.   dist_gen( Eng &eng , Dist &dist ) : m_eng( eng ) , m_dist( dist ) { };
  87.   double operator()( void ) const { return m_dist( m_eng ); }
  88.   Eng &m_eng;
  89.   Dist &m_dist;
  90. };
  91.  
  92. template< class Eng , class Dist >
  93. dist_gen< Eng , Dist > make_dist_gen( Eng &eng , Dist &dist )
  94. {
  95.   return dist_gen< Eng , Dist >( eng , dist );
  96. }
  97.  
  98.  
  99. int main( int argc , char **argv )
  100. {
  101.   boost::timer timer;
  102.  
  103.   default_random_engine r1 , r2;
  104.   uniform_real_distribution<double> u( -1.0 , 1.0 );
  105.  
  106.   timer.restart();
  107.   double tmp1 = 0.0;
  108.   for( size_t i=0 ; i<1000 ; ++i )
  109.     {
  110.       array_type arr;
  111.       fill1( arr , make_dist_gen( r1 , u ) );
  112.       tmp1 += do_computation1( arr );
  113.     }
  114.   cout << timer.elapsed() << "\t" << tmp1 << endl;
  115.  
  116.  
  117.   timer.restart();
  118.   double tmp2 = 0.0;
  119.   for( size_t i=0 ; i<1000 ; ++i )
  120.     {
  121.       array_type arr;
  122.       fill2( arr , make_dist_gen( r2 , u ) );
  123.       tmp2 += do_computation2( arr );
  124.     }
  125.   cout << timer.elapsed() << "\t" << tmp2 << endl;
  126.  
  127.  
  128.   return 0;
  129. }
Advertisement
Add Comment
Please, Sign In to add comment