chapter-7.cpp

Go to the documentation of this file.

// ===-- chapter-7/chapter-7.cpp -------------------------- -*- C++ -*- --=== //
#include "exercise-7-0.hpp"
#include "exercise-7-2.hpp"
#include "exercise-7-3.hpp"
#include "exercise-7-7.hpp"
 
#include "chapter-7-permutation_view.hpp"
 
#include <boost/mpl/equal.hpp>
#include <boost/mpl/list.hpp>
#include <boost/mpl/list_c.hpp>
#include <boost/mpl/range_c.hpp>
#include <boost/mpl/vector.hpp>
#include <boost/mpl/vector_c.hpp>
#include <boost/static_assert.hpp>
 
 
namespace test_7_2 {
 
typedef boost::mpl::vector_c<int, 1, 3, 5, 7> v1;
typedef boost::mpl::vector_c<int, 2, 4, 6, 8> v2;
typedef boost::mpl::vector<v1, v2> zip_vec;
typedef chapter7::zip_view<zip_vec> zip_vec_t;
typedef chapter7::least_refined_iterator_category<zip_vec>::type
        zip_vec_category;
 
BOOST_STATIC_ASSERT((
    boost::is_same<
        zip_vec_category,
        boost::mpl::random_access_iterator_tag
    >::value));
 
typedef boost::mpl::begin<zip_vec_t>::type zv_begin;
typedef boost::mpl::deref<zv_begin>::type zv_begin_t;
BOOST_STATIC_ASSERT((
    boost::mpl::equal<
        zv_begin_t, boost::mpl::vector_c<int, 1, 2>
    >::value));
typedef boost::mpl::next<zv_begin>::type zv_next;
BOOST_STATIC_ASSERT((
    boost::mpl::equal<
        boost::mpl::deref<zv_next>::type, boost::mpl::vector_c<int, 3, 4>
    >::value));
typedef boost::mpl::prior<zv_next>::type zv_prior;
BOOST_STATIC_ASSERT((boost::is_same<zv_prior, zv_begin>::value));
BOOST_STATIC_ASSERT((
    boost::mpl::equal<
        boost::mpl::deref<zv_prior>::type, boost::mpl::vector_c<int, 1, 2>
    >::value));
typedef boost::mpl::at< zip_vec_t, boost::mpl::int_<2> >::type zv_at2;
BOOST_STATIC_ASSERT((
    boost::mpl::equal<
        boost::mpl::deref<zv_at2>::type, boost::mpl::vector_c<int, 5, 6>
    >::value));
 
typedef boost::mpl::advance< zv_next, boost::mpl::int_<2> >::type zv_at3;
BOOST_STATIC_ASSERT((
    boost::mpl::equal<
        boost::mpl::deref<zv_at3>::type, boost::mpl::vector_c<int, 7, 8>
    >::value));
 
typedef boost::mpl::list_c<int, 1, 3, 5, 7> l1;
typedef boost::mpl::list_c<int, 2, 4, 6, 8> l2;
typedef boost::mpl::list<l1, l2> zip_list;
typedef chapter7::least_refined_iterator_category<zip_list>::type
        zip_list_category;
BOOST_STATIC_ASSERT((
    boost::is_same<
        zip_list_category,
        boost::mpl::forward_iterator_tag
    >::value));
 
} // namespace test_7_2
 
 
namespace test_7_3 {
 
typedef boost::mpl::vector_c<int,5,6,7,8,9,0,1,2,3,4> v;
typedef exercise_7_3::rotate_view<
    v,
    boost::mpl::advance_c<boost::mpl::begin<v>::type, 5>::type
> view;
 
BOOST_STATIC_ASSERT((
    boost::mpl::equal< view, boost::mpl::range_c<int, 0, 10> >::value));
 
} // namespace test_7_3
 
 
namespace test_7_6 {
using namespace chapter7;
 
typedef permutation_view<
    boost::mpl::list_c<int,2,1,3,0,2>,    // indices
    boost::mpl::vector_c<int,11,22,33,44> // elements
> pv1;
 
typedef boost::mpl::begin<pv1>::type it0;
typedef boost::mpl::deref<it0>::type val0;
BOOST_STATIC_ASSERT((33 == val0::value));
 
typedef boost::mpl::next<it0>::type it1;
typedef boost::mpl::deref<it1>::type val1;
BOOST_STATIC_ASSERT((22 == val1::value));
 
BOOST_STATIC_ASSERT((
    boost::mpl::equal< pv1, boost::mpl::vector_c<int,33,22,44,11,33> >::value));
 
} // namespace test_7_6
 
 
namespace test_7_7 {
 
typedef boost::mpl::vector_c<int, 1, 2> v1;
typedef boost::mpl::rbegin<v1>::type ri0;
typedef boost::mpl::deref<ri0>::type rv0;
BOOST_STATIC_ASSERT((rv0::value == 2));
 
typedef boost::mpl::next<ri0>::type ri1;
typedef boost::mpl::deref<ri1>::type rv1;
BOOST_STATIC_ASSERT((rv1::value == 1));
 
typedef boost::mpl::next<ri1>::type ri2;
typedef boost::mpl::rend<v1>::type ri_end;
BOOST_STATIC_ASSERT((boost::is_same<ri2, ri_end>::value));
 
typedef boost::mpl::prior<ri1>::type ri1_prior;
BOOST_STATIC_ASSERT((boost::is_same<ri1_prior, ri0>::value));
 
} // namespace test_7_7
 
 
int main()
{
    return 0;
}