123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153 |
- // Copyright 2002 The Trustees of Indiana University.
- // Use, modification and distribution is subject to the Boost Software
- // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
- // http://www.boost.org/LICENSE_1_0.txt)
- // Boost.MultiArray Library
- // Authors: Ronald Garcia
- // Jeremy Siek
- // Andrew Lumsdaine
- // See http://www.boost.org/libs/multi_array for documentation.
- //
- // index_bases - test of the index_base modifying facilities.
- //
- #include <boost/multi_array.hpp>
- #include <boost/core/lightweight_test.hpp>
- #include <boost/array.hpp>
- #include <vector>
- #include <iostream>
- int
- main()
- {
- typedef boost::multi_array<double, 3> array;
- typedef boost::multi_array_ref<double, 3> array_ref;
- typedef boost::const_multi_array_ref<double, 3> const_array_ref;
- typedef array::array_view<3>::type array_view;
- typedef array::size_type size_type;
- typedef array::extent_range range;
- typedef array::index_range irange;
- array::extent_gen extents;
- array::index_gen indices;
- // Construct with nonzero bases
- {
- array A(extents[range(1,4)][range(2,5)][range(3,6)]);
- array B(extents[3][3][3]);
- double ptr[27];
- array_ref
- C(ptr,extents[range(1,4)][range(2,5)][range(3,6)]);
- const_array_ref
- D(ptr,extents[range(1,4)][range(2,5)][range(3,6)]);
- array_view E = A[indices[irange()][irange()][irange()]];
- std::vector<double> vals;
- for (int i = 0; i < 27; ++i)
- vals.push_back(i);
- A.assign(vals.begin(),vals.end());
- B.assign(vals.begin(),vals.end());
- C.assign(vals.begin(),vals.end());
- boost::array<int,3> bases = { { 1, 2, 3 } };
- for (size_type a = 0; a < A.shape()[0]; ++a)
- for (size_type b = 0; b < A.shape()[1]; ++b)
- for (size_type c = 0; c < A.shape()[2]; ++c) {
- BOOST_TEST(A[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);
- BOOST_TEST(C[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);
- BOOST_TEST(D[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);
- // Test that E does not inherit A's index_base
- BOOST_TEST(E[a][b][c] == B[a][b][c]);
- }
- }
- // Reindex
- {
- typedef array::size_type size_type;
- array A(extents[3][3][3]), B(extents[3][3][3]);
- double ptr[27];
- array_ref C(ptr,extents[3][3][3]);
- const_array_ref D(ptr,extents[3][3][3]);
- array_view E = B[indices[irange()][irange()][irange()]];
- std::vector<double> vals;
- for (int i = 0; i < 27; ++i)
- vals.push_back(i);
- A.assign(vals.begin(),vals.end());
- B.assign(vals.begin(),vals.end());
- C.assign(vals.begin(),vals.end());
- boost::array<int,3> bases = { { 1, 2, 3 } };
- A.reindex(bases);
- C.reindex(bases);
- D.reindex(bases);
- E.reindex(bases);
- for (size_type a = 0; a < A.shape()[0]; ++a)
- for (size_type b = 0; b < A.shape()[1]; ++b)
- for (size_type c = 0; c < A.shape()[2]; ++c) {
- BOOST_TEST(A[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);
- BOOST_TEST(C[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);
- BOOST_TEST(D[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);
- BOOST_TEST(E[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);
- }
- }
- // Set Index Base
- {
- typedef array::size_type size_type;
- array A(extents[3][3][3]), B(extents[3][3][3]);
- double ptr[27];
- array_ref C(ptr,extents[3][3][3]);
- const_array_ref D(ptr,extents[3][3][3]);
- array_view E = B[indices[irange()][irange()][irange()]];
- std::vector<double> vals;
- for (int i = 0; i < 27; ++i)
- vals.push_back(i);
- A.assign(vals.begin(),vals.end());
- B.assign(vals.begin(),vals.end());
- C.assign(vals.begin(),vals.end());
- #ifdef BOOST_NO_SFINAE
- typedef boost::multi_array_types::index index;
- A.reindex(index(1));
- C.reindex(index(1));
- D.reindex(index(1));
- E.reindex(index(1));
- #else
- A.reindex(1);
- C.reindex(1);
- D.reindex(1);
- E.reindex(1);
- #endif
- for (size_type a = 0; a < A.shape()[0]; ++a)
- for (size_type b = 0; b < A.shape()[1]; ++b)
- for (size_type c = 0; c < A.shape()[2]; ++c) {
- BOOST_TEST(A[a+1][b+1][c+1] == B[a][b][c]);
- BOOST_TEST(C[a+1][b+1][c+1] == B[a][b][c]);
- BOOST_TEST(D[a+1][b+1][c+1] == B[a][b][c]);
- BOOST_TEST(E[a+1][b+1][c+1] == B[a][b][c]);
- }
- }
- return boost::report_errors();
- }
|