os/ossrv/stdcpp/tsrc/Boost_test/multi_array/src/compare.cpp
changeset 0 bde4ae8d615e
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/os/ossrv/stdcpp/tsrc/Boost_test/multi_array/src/compare.cpp	Fri Jun 15 03:10:57 2012 +0200
     1.3 @@ -0,0 +1,156 @@
     1.4 +// Copyright 2002 The Trustees of Indiana University.
     1.5 +
     1.6 +// Use, modification and distribution is subject to the Boost Software 
     1.7 +// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
     1.8 +// http://www.boost.org/LICENSE_1_0.txt)
     1.9 +
    1.10 +//  Boost.MultiArray Library
    1.11 +//  Authors: Ronald Garcia
    1.12 +//           Jeremy Siek
    1.13 +//           Andrew Lumsdaine
    1.14 +//  See http://www.boost.org/libs/multi_array for documentation.
    1.15 +
    1.16 +/*
    1.17 + * © Portions copyright (c) 2006-2007 Nokia Corporation.  All rights reserved.
    1.18 +*/
    1.19 +
    1.20 +
    1.21 +#include "boost/multi_array.hpp"
    1.22 +
    1.23 +#include "boost/test/minimal.hpp"
    1.24 +
    1.25 +#include <algorithm>
    1.26 +#include <list>
    1.27 +
    1.28 +#ifdef __SYMBIAN32__
    1.29 +#include "std_log_result.h"
    1.30 +#define LOG_FILENAME_LINE __FILE__, __LINE__
    1.31 +#endif
    1.32 +
    1.33 +
    1.34 +int
    1.35 +test_main(int, char*[])
    1.36 +{
    1.37 +  typedef boost::multi_array<double, 3> array;
    1.38 +  typedef array::size_type size_type;
    1.39 +  boost::array<size_type,3> sizes = { { 3, 3, 3 } };
    1.40 +  const size_type num_elements = 27;
    1.41 +
    1.42 +  // Copy Constructor
    1.43 +  {
    1.44 +    array A(sizes);
    1.45 +    std::vector<double> vals(num_elements, 4.5);
    1.46 +    A.assign(vals.begin(),vals.end());
    1.47 +    array B(A);
    1.48 +    BOOST_CHECK(A == B);
    1.49 +    BOOST_CHECK(B == A);
    1.50 +    BOOST_CHECK(A[0] == B[0]);
    1.51 +  }
    1.52 +  // Assignment Operator
    1.53 +  {
    1.54 +    array A(sizes), B(sizes);
    1.55 +    std::vector<double> vals(num_elements, 4.5);
    1.56 +    A.assign(vals.begin(),vals.end());
    1.57 +    B = A;
    1.58 +    BOOST_CHECK(A == B);
    1.59 +    BOOST_CHECK(B == A);
    1.60 +    BOOST_CHECK(B[0] == A[0]);
    1.61 +
    1.62 +    typedef array::index_range range;
    1.63 +    array::index_gen indices;
    1.64 +    array::array_view<2>::type C = A[indices[2][range()][range()]];
    1.65 +    array::array_view<2>::type D = B[indices[2][range()][range()]];
    1.66 +    BOOST_CHECK(C == D);
    1.67 +  }
    1.68 +  // Different Arrays
    1.69 +  {
    1.70 +    array A(sizes), B(sizes);
    1.71 +    std::vector<double> valsA(num_elements, 4.5);
    1.72 +    std::vector<double> valsB(num_elements, 2.5);
    1.73 +    A.assign(valsA.begin(),valsA.end());
    1.74 +    B.assign(valsB.begin(),valsB.end());
    1.75 +
    1.76 +    BOOST_CHECK(A != B);
    1.77 +    BOOST_CHECK(B != A);
    1.78 +    BOOST_CHECK(A[0] != B[0]);
    1.79 +
    1.80 +    typedef array::index_range range;
    1.81 +    array::index_gen indices;
    1.82 +    array::array_view<2>::type C = A[indices[2][range()][range()]];
    1.83 +    array::array_view<2>::type D = B[indices[2][range()][range()]];
    1.84 +    BOOST_CHECK(C != D);
    1.85 +  }
    1.86 +
    1.87 +  // Comparisons galore!
    1.88 +  {
    1.89 +    array A(sizes), B(sizes);
    1.90 +
    1.91 +    double valsA[] = {
    1.92 +        0, 0, 0,
    1.93 +        0, 0, 0,
    1.94 +        0, 0, 0,
    1.95 +
    1.96 +        1, 1, 1,
    1.97 +        1, 1, 1,
    1.98 +        1, 1, 1,
    1.99 +
   1.100 +        2, 2, 2,
   1.101 +        2, 2, 2,
   1.102 +        2, 2, 2
   1.103 +    };
   1.104 +
   1.105 +    double valsB[] = {
   1.106 +        0, 0, 0,
   1.107 +        0, 0, 0,
   1.108 +        0, 0, 0,
   1.109 +
   1.110 +        1, 1, 1,
   1.111 +        1, 1, 1,
   1.112 +        1, 1, 1,
   1.113 +
   1.114 +        2, 2, 2,
   1.115 +        2, 2, 2,
   1.116 +        2, 2, 1
   1.117 +    };
   1.118 +
   1.119 +    A.assign(valsA,valsA+num_elements);
   1.120 +    B.assign(valsB,valsB+num_elements);
   1.121 +
   1.122 +    BOOST_CHECK(B < A);
   1.123 +    BOOST_CHECK(A > B);
   1.124 +
   1.125 +    BOOST_CHECK(B <= A);
   1.126 +    BOOST_CHECK(A >= B);
   1.127 +
   1.128 +    BOOST_CHECK(B[0] == A[0]);
   1.129 +    BOOST_CHECK(B[2] < A[2]);
   1.130 +
   1.131 +    array C = A;
   1.132 +    
   1.133 +    BOOST_CHECK(C <= A);
   1.134 +    BOOST_CHECK(C >= A);
   1.135 +
   1.136 +    BOOST_CHECK(!(C < A));
   1.137 +    BOOST_CHECK(!(C > A));
   1.138 +
   1.139 +    typedef array::index_range range;
   1.140 +    array::index_gen indices;
   1.141 +    array::array_view<2>::type D = A[indices[2][range()][range()]];
   1.142 +    array::array_view<2>::type E = B[indices[2][range()][range()]];
   1.143 +
   1.144 +    BOOST_CHECK(E < D);
   1.145 +    BOOST_CHECK(E <= D);
   1.146 +  }
   1.147 +
   1.148 +#ifdef __SYMBIAN32__
   1.149 +if(boost::minimal_test::errors_counter() != 0)
   1.150 +   assert_failed = true;
   1.151 +   	testResultXml("compare");
   1.152 +	close_log_file();
   1.153 +#endif
   1.154 +
   1.155 +
   1.156 +  return boost::exit_success;
   1.157 +}
   1.158 +
   1.159 +