// storage_order.cpp - testing storage_order-isms.
//
-#include "boost/multi_array.hpp"
+#include <boost/multi_array.hpp>
-#include "boost/test/minimal.hpp"
+#include <boost/core/lightweight_test.hpp>
-#include "boost/array.hpp"
+#include <boost/array.hpp>
int
-test_main(int,char*[])
+main()
{
const int ndims=3;
for (array::index i = 0; i != 2; ++i)
for (array::index j = 0; j != 3; ++j)
for (array::index k = 0; k != 4; ++k)
- BOOST_CHECK(A[i][j][k] == *num++);
+ BOOST_TEST(A[i][j][k] == *num++);
}
// Mimic fortran_storage_order using
for (array::index i = 0; i != 2; ++i)
for (array::index j = 0; j != 3; ++j)
for (array::index k = 0; k != 4; ++k)
- BOOST_CHECK(A[i][j][k] == *num++);
+ BOOST_TEST(A[i][j][k] == *num++);
}
// general_storage_order with arbitrary storage order
for (array::index i = 0; i != 2; ++i)
for (array::index j = 0; j != 3; ++j)
for (array::index k = 0; k != 4; ++k)
- BOOST_CHECK(A[i][j][k] == *num++);
+ BOOST_TEST(A[i][j][k] == *num++);
}
for (array::index i = 0; i != 2; ++i)
for (array::index j = 0; j != 3; ++j)
for (array::index k = 0; k != 4; ++k)
- BOOST_CHECK(A[i][j][k] == *num++);
+ BOOST_TEST(A[i][j][k] == *num++);
}
- return boost::exit_success;
+ return boost::report_errors();
}