/*============================================================================= Copyright (c) 2001-2007 Joel de Guzman Copyright (c) 2005-2006 Dan Marsden Distributed under 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) ==============================================================================*/ #if !defined(FUSION_STRUCT_ITERATOR_APRIL_2_2007_1008AM) #define FUSION_STRUCT_ITERATOR_APRIL_2_2007_1008AM #include #include #include #include #include #include #include #include #include #include namespace boost { namespace fusion { struct random_access_traversal_tag; template struct struct_iterator : iterator_facade, random_access_traversal_tag> { BOOST_MPL_ASSERT_RELATION(N_, >=, 0); BOOST_MPL_ASSERT_RELATION(N_, <=, extension::struct_size::value); typedef mpl::int_ index; typedef Struct struct_type; struct_iterator(Struct& struct_) : struct_(struct_) {} Struct& struct_; template struct value_of : extension::struct_member { }; template struct deref { typedef typename add_reference< typename extension::struct_member::type >::type type; static type call(Iterator const& iter) { return extension::struct_member:: call(iter.struct_); } }; template struct advance { typedef typename Iterator::index index; typedef typename Iterator::struct_type struct_type; typedef struct_iterator type; static type call(Iterator const& iter) { return type(iter.struct_); } }; template struct next : advance > {}; template struct prior : advance > {}; template struct distance : mpl::minus { typedef typename mpl::minus< typename I2::index, typename I1::index >::type type; static type call(I1 const&, I2 const&) { return type(); } }; }; }} #endif