scnc
/
qmcpack
mirror of https://github.com/QMCPACK/qmcpack.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
qmcpack/external_codes/boost_multi/multi/test/iterator.cpp

283 lines
9.6 KiB
C++
Raw Permalink Blame History

// Copyright 2018-2023 Alfredo A. Correa
// Copyright 2024 Matt Borland
// Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt
#include <boost/multi/array.hpp>
#include <numeric>
#include <vector>
// Suppress warnings from boost.test
#if defined(__clang__)
# pragma clang diagnostic push
# pragma clang diagnostic ignored "-Wold-style-cast"
# pragma clang diagnostic ignored "-Wundef"
# pragma clang diagnostic ignored "-Wconversion"
# pragma clang diagnostic ignored "-Wsign-conversion"
# pragma clang diagnostic ignored "-Wfloat-equal"
#elif defined(__GNUC__)
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wold-style-cast"
# pragma GCC diagnostic ignored "-Wundef"
# pragma GCC diagnostic ignored "-Wconversion"
# pragma GCC diagnostic ignored "-Wsign-conversion"
# pragma GCC diagnostic ignored "-Wfloat-equal"
#elif defined(_MSC_VER)
# pragma warning(push)
# pragma warning(disable : 4244)
#endif
#ifndef BOOST_TEST_MODULE
# define BOOST_TEST_MAIN
#endif
#include <boost/test/unit_test.hpp>
namespace multi = boost::multi;
template<class Array> auto take(Array&& array) -> auto& {return std::forward<Array>(array)[0];}
BOOST_AUTO_TEST_CASE(iterator_1d) {
{
multi::array<double, 1> arr(multi::extensions_t<1>{multi::iextension{100}}, 99.0);
BOOST_REQUIRE( size(arr) == 100 );
BOOST_REQUIRE( begin(arr) < end(arr) );
BOOST_REQUIRE( end(arr) - begin(arr) == size(arr) );
multi::array<double, 1>::const_iterator const cbarr = cbegin(arr);
multi::array<double, 1>::iterator barr = begin(arr);
[[maybe_unused]] multi::array<double, 1>::const_iterator const cbarr3{barr};
BOOST_REQUIRE( barr == cbarr );
BOOST_REQUIRE( cbarr == barr );
barr += 1;
barr -= 1;
BOOST_REQUIRE( cbarr == barr );
multi::array<double, 1>::const_iterator const cbarr2 = begin(arr);
BOOST_REQUIRE( cbarr2 == cbarr );
}
{
multi::array<double, 1> arr(multi::extensions_t<1>{multi::iextension{100}}, 99.0);
BOOST_REQUIRE( size(arr) == 100 );
BOOST_REQUIRE( begin(arr) < end(arr) );
auto arr2 = arr.begin();
multi::array<double, 1>::const_iterator const cbb = arr2;
BOOST_REQUIRE( cbb == arr2 );
BOOST_REQUIRE( arr2 == cbb );
}
{
multi::array<double, 1> arr(multi::extensions_t<1>{multi::iextension{100}}, 99.0);
BOOST_REQUIRE( size(arr) == 100 );
BOOST_REQUIRE( begin(arr) < end(arr) );
auto const arrend = arr.end();
auto const arrlast = arrend - 1;
BOOST_REQUIRE( arrlast + 1 == arrend );
}
}
BOOST_AUTO_TEST_CASE(iterator_2d) {
{
multi::array<double, 2> const arr({120, 140}, 99.0);
BOOST_REQUIRE( arr.size() == 120 );
BOOST_REQUIRE( size(arr) == 120 );
BOOST_REQUIRE( arr.cbegin() < arr.cend() );
BOOST_REQUIRE( arr.cend() - arr.cbegin() == arr.size() );
using iter = multi::array<double, 2>::iterator;
static_assert( std::is_same_v< iter::element , double > );
static_assert( std::is_same_v< iter::value_type, multi::array<double, 1> > );
static_assert( std::is_same_v< iter::reference, multi::subarray<double, 1>> );
static_assert( std::is_same_v< iter::element_ptr, double*> );
using citer = multi::array<double, 2>::const_iterator;
static_assert( std::is_same_v< citer::element , double > );
static_assert( std::is_same_v< citer::value_type, multi::array<double, 1> > );
static_assert( std::is_same_v< citer::reference, multi::subarray<double, 1, double const*>> );
static_assert( std::is_same_v< citer::element_ptr, double const* > );
auto const arrend = arr.end();
auto const arrlast = arrend - 1;
BOOST_REQUIRE( arrlast + 1 == arrend );
}
{
std::vector<double> vec(10000); // std::vector NOLINT(fuchsia-default-arguments-calls)
multi::array_ref<double, 2> arr(vec.data(), {100, 100});
BOOST_REQUIRE(size(arr) == 100);
begin(arr)[4][3] = 2.0;
}
}
BOOST_AUTO_TEST_CASE(iterator_interface ) {
multi::array<int, 3> arr = {
{
{ 12, 11}, { 24, 10}
},
{
{112, 30}, {344, 40}
},
{
{ 12, 11}, { 24, 10}
}
};
BOOST_REQUIRE( size(arr) == 3 );
BOOST_REQUIRE( size(arr[0]) == 2 );
BOOST_REQUIRE( size(arr[0][0]) == 2 );
BOOST_REQUIRE( arr[0][0][1] == 11 );
BOOST_REQUIRE( begin(arr) < end(arr) );
BOOST_REQUIRE( cbegin(arr) < cend(arr) );
BOOST_REQUIRE( begin(arr[0]) < end(arr[0]) );
BOOST_REQUIRE( begin(arr[0]) < end(arr[0]) );
// BOOST_REQUIRE(( multi::array<double, 3>::reverse_iterator {A.begin()} == rend(A) ));
// BOOST_REQUIRE( rbegin(A) < rend(A) );
BOOST_REQUIRE( end(arr) - begin(arr) == size(arr) );
// BOOST_REQUIRE( rend(A) - rbegin(A) == size(A) );
BOOST_REQUIRE( size(*begin(arr) ) == 2 );
BOOST_REQUIRE( size( begin(arr)[1]) == 2 );
BOOST_REQUIRE( &(arr[1][1].begin()[0]) == &arr[1][1][0] ); // NOLINT(readability-container-data-pointer) test access
BOOST_REQUIRE( &arr[0][1][0] == &arr[0][1][0] );
BOOST_REQUIRE( &((*arr.begin())[1][0]) == &arr[0][1][0] );
BOOST_REQUIRE( &((*arr.begin()).operator[](1)[0]) == &arr[0][1][0] );
BOOST_REQUIRE( &(arr.begin()->operator[](1)[0]) == &arr[0][1][0] );
BOOST_REQUIRE( &(arr.begin()->operator[](1).begin()[0]) == &arr[0][1][0] ); // NOLINT(readability-container-data-pointer) test access
BOOST_REQUIRE( &((arr.begin()+1)->operator[](1).begin()[0]) == &arr[1][1][0] ); // NOLINT(readability-container-data-pointer) test access
BOOST_REQUIRE( &((begin(arr)+1)->operator[](1).begin()[0]) == &arr[1][1][0] ); // NOLINT(readability-container-data-pointer) test access
BOOST_REQUIRE( &((cbegin(arr)+1)->operator[](1).begin()[0]) == &arr[1][1][0] ); // NOLINT(readability-container-data-pointer) test access
}
BOOST_AUTO_TEST_CASE(iterator_semantics) {
multi::array<double, 3> arr = {
{{ 1.2, 1.1}, { 2.4, 1.0}},
{{11.2, 3.0}, {34.4, 4.0}},
{{ 1.2, 1.1}, { 2.4, 1.0}}
};
multi::array<double, 3>::iterator it;
BOOST_REQUIRE(( multi::array<double, 3>::iterator{} == it ));
BOOST_REQUIRE(( it == multi::array<double, 3>::iterator{} ));
it = begin(arr);
BOOST_REQUIRE( it == begin(arr) );
it += 1;
it -= 1;
BOOST_REQUIRE( it == begin(arr) );
auto const& arrc = arr();
BOOST_REQUIRE( &arrc[0][0][0] == &arr[0][0][0] );
auto const& arrc2 = arr();
BOOST_REQUIRE( arrc.addressof() == arrc2.addressof() ); // BOOST_REQUIRE( &arrc == &arrc2 );
multi::array<double, 3>::iterator const it2 = begin(arr);
BOOST_REQUIRE(it == it2);
it = end(arr);
BOOST_REQUIRE(it != it2);
BOOST_REQUIRE(it > it2);
multi::array<double, 3>::iterator const it3{it};
BOOST_REQUIRE( it3 == it );
multi::array<double, 3>::const_iterator cit;
static_assert( std::is_same<multi::array<double, 3>::iterator::element_ptr, double*>{}, "!");
[[maybe_unused]] multi::array<double, 3>::const_iterator const cit3{it3};
cit = it3;
BOOST_REQUIRE( cit == it3 );
BOOST_REQUIRE( it3 == cit );
BOOST_REQUIRE( &arr[0][2][1] == &begin(arr)[0][2][1] );
[[maybe_unused]] multi::array<double, 3>::const_iterator const cit2 = it3;
static_assert( decltype(begin(arr))::rank_v == 3 , "!" );
static_assert( decltype(begin(arr))::rank {} == 3 , "!" );
auto&& ref = multi::ref(begin(arr), end(arr));
BOOST_TEST( arr.base() == ref.base() );
BOOST_TEST( arr[0][2][1] == ref[0][2][1] );
BOOST_TEST( &arr[0][2][1] == &ref[0][2][1] );
BOOST_TEST( arr.layout().stride() == ref.layout().stride());
BOOST_TEST( arr.layout().offset() == ref.layout().offset());
BOOST_TEST( arr.layout().nelems() == ref.layout().nelems());
BOOST_REQUIRE( arr.num_elements() == ref.num_elements() );
BOOST_REQUIRE( arr.stride() == ref.stride() );
BOOST_REQUIRE( arr.layout() == ref.layout() );
BOOST_REQUIRE( &multi::ref(begin(arr), end(arr)) == &arr );
}
BOOST_AUTO_TEST_CASE(iterator_arrow_operator) {
multi::array<std::string, 2> arr = {
{"00", "01"}, // std::string NOLINT(fuchsia-default-arguments-calls) std::string has a default constructor
{"10", "11"}, // std::string NOLINT(fuchsia-default-arguments-calls)
{"20", "21"} // std::string NOLINT(fuchsia-default-arguments-calls)
};
BOOST_REQUIRE( arr[1][0] == "10" );
BOOST_REQUIRE( std::is_sorted(begin(arr), end(arr)) ); // sorted by rows
BOOST_REQUIRE( std::is_sorted(begin(arr.rotated()), end(arr.rotated())) ); // sorted by cols
BOOST_REQUIRE( begin( arr )->size() == arr[0].size() );
BOOST_REQUIRE( begin( arr.rotated() )->size() == arr.size() );
BOOST_REQUIRE( &(begin( arr )->operator[](1)) == &(arr[0][1]) );
BOOST_REQUIRE( &(begin( arr.rotated() )->operator[](1)) == &(arr[1][0]) );
}
BOOST_AUTO_TEST_CASE(index_range_iteration) {
multi::index_range irng{0, 5}; // semiopen interval
std::ostringstream out;
std::copy(begin(irng), end(irng), std::ostream_iterator<int>{out, ","});
BOOST_REQUIRE( out.str() == "0,1,2,3,4," );
BOOST_REQUIRE( std::accumulate(begin(irng), end(irng), static_cast<multi::index_range::value_type>(0U)) == irng.size()*(irng.size()-1)/2 );
BOOST_REQUIRE( std::accumulate(begin(irng), end(irng), static_cast<multi::index_range::value_type>(0U), [](auto&& acc, auto const& elem) {return acc + elem*elem*elem;}) > 0 ); // sum of cubes
}
BOOST_AUTO_TEST_CASE(multi_reverse_iterator_1D) {
multi::array<double, 1> arr(100, 66.0);
BOOST_REQUIRE( &arr[99] == &*std::make_reverse_iterator(arr.end()) );
auto rbegin = std::make_reverse_iterator(arr.end());
rbegin += 100;
multi::array<double, 1>::iterator const begin{rbegin.base()};
BOOST_REQUIRE( begin == arr.begin() );
}
BOOST_AUTO_TEST_CASE(multi_reverse_iterator_2D) {
multi::array<double, 2> arr = {
{ 1.0, 2.0},
{ 10.0, 20.0},
{100.0, 200.0}
};
BOOST_REQUIRE( (*arr.begin())[1] == 2.0 );
auto rbegin = std::make_reverse_iterator(arr.end());
BOOST_TEST( (*rbegin)[1] == 200.0 );
BOOST_REQUIRE( arr.begin() < arr.begin() + 1 );
BOOST_REQUIRE( arr.end() - 1 < arr.end() );
}
Reference in New Issue View Git Blame Copy Permalink