// 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.

//

/*

 * © Portions copyright (c) 2006-2007 Nokia Corporation.  All rights reserved.

*/

#include "boost/multi_array.hpp"

#include "boost/test/minimal.hpp"

#include "boost/array.hpp"

#include <vector>

#include <iostream>

#ifdef __SYMBIAN32__

#include "std_log_result.h"

#define LOG_FILENAME_LINE __FILE__, __LINE__

#endif

int

test_main(int,char*[])

{

  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_CHECK(A[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);

          BOOST_CHECK(C[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);

          BOOST_CHECK(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_CHECK(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_CHECK(A[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);

          BOOST_CHECK(C[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);

          BOOST_CHECK(D[a+bases[0]][b+bases[1]][c+bases[2]] == B[a][b][c]);

          BOOST_CHECK(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_CHECK(A[a+1][b+1][c+1] == B[a][b][c]);

          BOOST_CHECK(C[a+1][b+1][c+1] == B[a][b][c]);

          BOOST_CHECK(D[a+1][b+1][c+1] == B[a][b][c]);

          BOOST_CHECK(E[a+1][b+1][c+1] == B[a][b][c]);

        }

  }

#ifdef __SYMBIAN32__

if(boost::minimal_test::errors_counter() != 0)

   assert_failed = true;

   	testResultXml("index_bases");

	close_log_file();

#endif

  return boost::exit_success;

}