/*============================================================================= Copyright (c) 2001-2006 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(BOOST_FUSION_ARRAY_ITERATOR_26122005_2250) #define BOOST_FUSION_ARRAY_ITERATOR_26122005_2250 #include #include #include #include #include #include #include #include namespace boost { namespace fusion { struct random_access_traversal_tag; template struct array_iterator : iterator_facade, random_access_traversal_tag> { BOOST_MPL_ASSERT_RELATION(Pos, >=, 0); BOOST_MPL_ASSERT_RELATION(Pos, <=, Array::static_size); typedef mpl::int_ index; typedef Array array_type; array_iterator(Array& a) : array(a) {} Array& array; template struct value_of { typedef typename Iterator::array_type array_type; typedef typename array_type::value_type type; }; template struct deref { typedef typename Iterator::array_type array_type; typedef typename mpl::if_< is_const , typename array_type::const_reference , typename array_type::reference >::type type; static type call(Iterator const & it) { return it.array[Iterator::index::value]; } }; template struct advance { typedef typename Iterator::index index; typedef typename Iterator::array_type array_type; typedef array_iterator type; static type call(Iterator const& i) { return type(i.array); } }; 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(); } }; private: array_iterator& operator=(array_iterator const&); }; }} #endif