
Russell Hind wrote:
Hi Eric, with the new version, I can't even get foreach.hpp to compile. I get the following error on line 308:
[C++ Error] foreach.hpp(308): E2109 Not an allowed type
This is a shot in the dark, but can you try the attached version? If this doesn't work, I'll need the help of someone familiar with this compiler. -- Eric Niebler Boost Consulting www.boost-consulting.com /////////////////////////////////////////////////////////////////////////////// // foreach.hpp header file // // Copyright 2004 Eric Niebler. // 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) // #ifndef BOOST_FOREACH #include <cstddef> #include <utility> // for std::pair #include <iterator> // for std::iterator_traits #include <boost/config.hpp> #include <boost/detail/workaround.hpp> // Some compilers allow temporaries to be bound to non-const references. // These compilers make it impossible to for BOOST_FOREACH to detect // temporaries and avoid reevaluation of the collection expression. #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) # define BOOST_FOREACH_NO_RVALUE_DETECTION #endif // Some compilers do not correctly implement the L-value/R-value conversion // rules of the ternary conditional operator. #if defined(BOOST_FOREACH_NO_RVALUE_DETECTION) \ || BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1400)) \ || BOOST_WORKAROUND(BOOST_INTEL_WIN, BOOST_TESTED_AT(800)) # define BOOST_FOREACH_NO_CONST_RVALUE_DETECTION #endif #include <boost/mpl/or.hpp> #include <boost/mpl/bool.hpp> #include <boost/mpl/eval_if.hpp> #include <boost/range/end.hpp> #include <boost/range/begin.hpp> #include <boost/range/result_iterator.hpp> #include <boost/type_traits/is_const.hpp> #include <boost/type_traits/is_pointer.hpp> #include <boost/iterator/iterator_traits.hpp> #ifndef BOOST_FOREACH_NO_CONST_RVALUE_DETECTION # include <new> # include <boost/aligned_storage.hpp> #endif namespace boost { // forward declarations for iterator_range template<typename T> class iterator_range; // forward declarations for sub_range template<typename T> class sub_range; namespace foreach { /////////////////////////////////////////////////////////////////////////////// // yes/no // typedef char yes_type; typedef char (&no_type)[2]; /////////////////////////////////////////////////////////////////////////////// // adl_begin/adl_end // template<typename T> inline BOOST_DEDUCED_TYPENAME range_result_iterator<T>::type adl_begin(T &t) { #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) return boost::begin(t); #else using boost::begin; typedef BOOST_DEDUCED_TYPENAME range_result_iterator<T>::type type; return type(begin(t)); #endif } template<typename T> inline BOOST_DEDUCED_TYPENAME range_result_iterator<T>::type adl_end(T &t) { #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) return boost::end(t); #else using boost::end; typedef BOOST_DEDUCED_TYPENAME range_result_iterator<T>::type type; return type(end(t)); #endif } /////////////////////////////////////////////////////////////////////////////// // auto_any_t/auto_any // struct auto_any_base { // auto_any_base must evaluate to false in boolean context so that // they can be declared in if() statements. operator bool() const { return false; } }; template<typename T> struct auto_any : auto_any_base { auto_any(T const &t) : item(t) { } // temporaries of type auto_any will be bound to const auto_any_base // references, but we still want to be able to mutate the stored // data, so declare it as mutable. mutable T item; }; typedef auto_any_base const &auto_any_t; template<typename T,typename C> inline BOOST_DEDUCED_TYPENAME mpl::if_<C,T const,T>::type &auto_any_cast(auto_any_t a) { return static_cast<auto_any<T> const &>(a).item; } typedef mpl::true_ const_; /////////////////////////////////////////////////////////////////////////////// // type2type // template<typename T,typename C = mpl::false_> struct type2type : mpl::if_<C,T const,T> { }; template<typename T,typename C = mpl::false_> struct foreach_iterator { // If there is no function template ordering, then it may // be impossible to strip cv-modifiers from T, so use // range_result_iterator. Otherwise, use range_const_iterator // and range_iterator. #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING typedef BOOST_DEDUCED_TYPENAME mpl::eval_if< C , range_const_iterator<T> , range_iterator<T> >::type type; #else typedef BOOST_DEDUCED_TYPENAME mpl::eval_if< C , range_result_iterator<T const> , range_result_iterator<T> >::type type; #endif }; template<typename T,typename C = mpl::false_> struct foreach_reference : iterator_reference<BOOST_DEDUCED_TYPENAME foreach_iterator<T,C>::type> { }; /////////////////////////////////////////////////////////////////////////////// // encode_type // template<typename T> inline type2type<T> *encode_type(T &) { return 0; } #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING template<typename T> inline type2type<T,const_> *encode_type(T const &) { return 0; } #endif /////////////////////////////////////////////////////////////////////////////// // in_range // template<typename T> inline std::pair<T,T> in_range(T begin, T end) { return std::make_pair(begin, end); } #ifndef BOOST_FOREACH_NO_CONST_RVALUE_DETECTION /////////////////////////////////////////////////////////////////////////////// // rvalue_probe // struct rvalue_probe { template<typename T> rvalue_probe(T const &t, bool &b) : ptemp(const_cast<T *>(&t)) , rvalue(b) { } template<typename U> operator U() { rvalue = true; return *static_cast<U *>(ptemp); } template<typename V> operator V &() const { return *static_cast<V *>(ptemp); } void *ptemp; bool &rvalue; }; /////////////////////////////////////////////////////////////////////////////// // simple_variant // holds either a T or a T* template<typename T> struct simple_variant { simple_variant(T *t) : rvalue(false) { *static_cast<T **>(data.address()) = t; } simple_variant(T const &t) : rvalue(true) { ::new(data.address()) T(t); } simple_variant(simple_variant const &that) : rvalue(that.rvalue) { if(rvalue) ::new(data.address()) T(*that.get()); else *static_cast<T **>(data.address()) = that.get(); } ~simple_variant() { if(rvalue) get()->~T(); } T *get() const { if(rvalue) return static_cast<T *>(data.address()); else return *static_cast<T **>(data.address()); } private: enum { size = sizeof(T) > sizeof(T*) ? sizeof(T) : sizeof(T*) }; simple_variant &operator =(simple_variant const &); bool const rvalue; mutable aligned_storage<size> data; }; #elif !defined(BOOST_FOREACH_NO_RVALUE_DETECTION) /////////////////////////////////////////////////////////////////////////////// // is_rvalue // template<typename T> no_type is_rvalue(T &, int); template<typename T> yes_type is_rvalue(T const &, ...); #endif // BOOST_FOREACH_NO_CONST_RVALUE_DETECTION /////////////////////////////////////////////////////////////////////////////// // set_false // inline bool set_false(bool &b) { return b = false; } no_type is_range_fun(...); template<typename T> yes_type is_range_fun(std::pair<T,T> *); template<typename T> yes_type is_range_fun(iterator_range<T> *); template<typename T> yes_type is_range_fun(sub_range<T> *); template<typename T> struct is_range_base { BOOST_STATIC_CONSTANT(size_t, size = sizeof(boost::foreach::is_range_fun((T*)0))); BOOST_STATIC_CONSTANT(bool, value = sizeof(yes_type)==size); typedef mpl::bool_<value> type; }; template<typename T> struct is_range : is_range_base<T>::type { }; template<typename T> struct is_cheap_copy : mpl::or_<is_pointer<T>, is_range<T> > { // work-around for VC6 enum { value = mpl::or_< is_pointer<T>, is_range<T> >::value }; }; /////////////////////////////////////////////////////////////////////////////// // cheap_copy // Overload this for user-defined collection types if they are inexpensive to copy. // This tells BOOST_FOREACH it can avoid the r-value/l-value detection stuff. template<typename T,typename C> inline mpl::bool_<is_cheap_copy<T>::value> cheap_copy(type2type<T,C> *) { return mpl::bool_<is_cheap_copy<T>::value>(); } /////////////////////////////////////////////////////////////////////////////// // contain // template<typename T> inline auto_any<T> contain(T const &t, bool const &, mpl::true_) { return t; } #ifndef BOOST_FOREACH_NO_CONST_RVALUE_DETECTION template<typename T> inline auto_any<T *> contain(T &t, bool const &, mpl::false_) { return &t; } template<typename T> inline auto_any<simple_variant<T const> > contain(T const &t, bool const &rvalue, mpl::false_) { return rvalue ? simple_variant<T const>(t) : simple_variant<T const>(&t); } #else template<typename T> inline auto_any<T *> contain(T &t, mpl::false_, mpl::false_) // l-value { return &t; } template<typename T> inline auto_any<T> contain(T const &t, mpl::true_, mpl::false_) // r-value { return t; } #endif ///////////////////////////////////////////////////////////////////////////// // begin // template<typename T,typename C> inline auto_any<BOOST_DEDUCED_TYPENAME foreach_iterator<T,C>::type> begin(auto_any_t col, type2type<T,C> *, bool, mpl::true_) { return foreach::adl_begin(auto_any_cast<T,C>(col)); } #ifndef BOOST_FOREACH_NO_CONST_RVALUE_DETECTION template<typename T> inline auto_any<BOOST_DEDUCED_TYPENAME foreach_iterator<T,mpl::false_>::type> begin(auto_any_t col, type2type<T> *, bool, mpl::false_) { return foreach::adl_begin(*auto_any_cast<T *,mpl::false_>(col)); } template<typename T> inline auto_any<BOOST_DEDUCED_TYPENAME foreach_iterator<T,mpl::true_>::type> begin(auto_any_t col, type2type<T,const_> *, bool, mpl::false_) { return foreach::adl_begin(*auto_any_cast<simple_variant<T const>,mpl::false_>(col).get()); } #else template<typename T,typename C> inline auto_any<BOOST_DEDUCED_TYPENAME foreach_iterator<T,C>::type> begin(auto_any_t col, type2type<T,C> *, mpl::false_, mpl::false_) // l-value { typedef BOOST_DEDUCED_TYPENAME type2type<T,C>::type type; return foreach::adl_begin(*auto_any_cast<type *,mpl::false_>(col)); } template<typename T> inline auto_any<BOOST_DEDUCED_TYPENAME foreach_iterator<T,mpl::true_>::type> begin(auto_any_t col, type2type<T,const_> *, mpl::true_, mpl::false_) // r-value { return foreach::adl_begin(auto_any_cast<T,mpl::true_>(col)); } #endif /////////////////////////////////////////////////////////////////////////////// // end // template<typename T,typename C> inline auto_any<BOOST_DEDUCED_TYPENAME foreach_iterator<T,C>::type> end(auto_any_t col, type2type<T,C> *, bool, mpl::true_) { return foreach::adl_end(auto_any_cast<T,C>(col)); } #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING template<typename T,typename C> inline auto_any<int> end(auto_any_t col, type2type<T *,C> *, bool, mpl::true_) { return 0; // not used } #endif #ifndef BOOST_FOREACH_NO_CONST_RVALUE_DETECTION template<typename T> inline auto_any<BOOST_DEDUCED_TYPENAME foreach_iterator<T,mpl::false_>::type> end(auto_any_t col, type2type<T> *, bool, mpl::false_) { return foreach::adl_end(*auto_any_cast<T *,mpl::false_>(col)); } template<typename T> inline auto_any<BOOST_DEDUCED_TYPENAME foreach_iterator<T,mpl::true_>::type> end(auto_any_t col, type2type<T,const_> *, bool, mpl::false_) { return foreach::adl_end(*auto_any_cast<simple_variant<T const>,mpl::false_>(col).get()); } #else template<typename T,typename C> inline auto_any<BOOST_DEDUCED_TYPENAME foreach_iterator<T,C>::type> end(auto_any_t col, type2type<T,C> *, mpl::false_, mpl::false_) // l-value { typedef BOOST_DEDUCED_TYPENAME type2type<T,C>::type type; return foreach::adl_end(*auto_any_cast<type *,mpl::false_>(col)); } template<typename T> inline auto_any<BOOST_DEDUCED_TYPENAME foreach_iterator<T,mpl::true_>::type> end(auto_any_t col, type2type<T,const_> *, mpl::true_, mpl::false_) // r-value { return foreach::adl_end(auto_any_cast<T,mpl::true_>(col)); } #endif /////////////////////////////////////////////////////////////////////////////// // done // template<typename T,typename C> inline bool done(auto_any_t cur, auto_any_t end, type2type<T,C> *) { typedef BOOST_DEDUCED_TYPENAME foreach_iterator<T,C>::type iter_t; return auto_any_cast<iter_t,mpl::false_>(cur) == auto_any_cast<iter_t,mpl::false_>(end); } #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING template<typename T,typename C> inline bool done(auto_any_t cur, auto_any_t, type2type<T *,C> *) { return ! *auto_any_cast<T *,mpl::false_>(cur); } #endif /////////////////////////////////////////////////////////////////////////////// // next // template<typename T,typename C> inline void next(auto_any_t cur, type2type<T,C> *) { typedef BOOST_DEDUCED_TYPENAME foreach_iterator<T,C>::type iter_t; ++auto_any_cast<iter_t,mpl::false_>(cur); } /////////////////////////////////////////////////////////////////////////////// // deref // template<typename T,typename C> inline BOOST_DEDUCED_TYPENAME foreach_reference<T,C>::type deref(auto_any_t cur, type2type<T,C> *) { typedef BOOST_DEDUCED_TYPENAME foreach_iterator<T,C>::type iter_t; return *auto_any_cast<iter_t,mpl::false_>(cur); } } // namespace foreach } // namespace boost #ifndef BOOST_FOREACH_NO_CONST_RVALUE_DETECTION /////////////////////////////////////////////////////////////////////////////// // R-values and const R-values supported here /////////////////////////////////////////////////////////////////////////////// // A sneaky way to get the type of the collection without evaluating the expression # define BOOST_FOREACH_TYPEOF(COL) \ (true ? 0 : ::boost::foreach::encode_type(COL)) // Evaluate the collection expression, and detect if it is an l-value or and r-value # define BOOST_FOREACH_EVAL(COL) \ (true ? ::boost::foreach::rvalue_probe((COL),_foreach_rvalue) : (COL)) // The R-value/L-value-ness of the collection expression is determined dynamically # define BOOST_FOREACH_RVALUE(COL) \ _foreach_rvalue # define BOOST_FOREACH_CHEAP_COPY(COL) \ (::boost::foreach::cheap_copy(BOOST_FOREACH_TYPEOF(COL))) # define BOOST_FOREACH_NOOP(COL) \ ((void)0) #elif !defined(BOOST_FOREACH_NO_RVALUE_DETECTION) /////////////////////////////////////////////////////////////////////////////// // R-values supported here, const R-values NOT supported here /////////////////////////////////////////////////////////////////////////////// // A sneaky way to get the type of the collection without evaluating the expression # define BOOST_FOREACH_TYPEOF(COL) \ (true ? 0 : ::boost::foreach::encode_type(COL)) // Evaluate the collection expression # define BOOST_FOREACH_EVAL(COL) \ (COL) // Determine whether the collection expression is an l-value or an r-value. // NOTE: this gets the answer for const R-values wrong. # define BOOST_FOREACH_RVALUE(COL) \ (::boost::mpl::bool_<(sizeof(::boost::foreach::is_rvalue((COL),0)) \ ==sizeof(::boost::foreach::yes_type))>()) # define BOOST_FOREACH_CHEAP_COPY(COL) \ (::boost::foreach::cheap_copy(BOOST_FOREACH_TYPEOF(COL))) # define BOOST_FOREACH_NOOP(COL) \ ((void)0) #else /////////////////////////////////////////////////////////////////////////////// // R-values NOT supported here /////////////////////////////////////////////////////////////////////////////// // A sneaky way to get the type of the collection without evaluating the expression # define BOOST_FOREACH_TYPEOF(COL) \ (true ? 0 : ::boost::foreach::encode_type(COL)) // Evaluate the collection expression # define BOOST_FOREACH_EVAL(COL) \ (COL) // Can't use R-values with BOOST_FOREACH # define BOOST_FOREACH_RVALUE(COL) \ (::boost::mpl::false_()) # define BOOST_FOREACH_CHEAP_COPY(COL) \ (::boost::foreach::cheap_copy(BOOST_FOREACH_TYPEOF(COL))) // Attempt to make uses of BOOST_FOREACH with non-lvalues fail to compile # define BOOST_FOREACH_NOOP(COL) \ ((void)&(COL)) #endif #define BOOST_FOREACH_CONTAIN(COL) \ ::boost::foreach::contain( \ BOOST_FOREACH_EVAL(COL) \ , BOOST_FOREACH_RVALUE(COL) \ , BOOST_FOREACH_CHEAP_COPY(COL)) #define BOOST_FOREACH_BEGIN(COL) \ ::boost::foreach::begin( \ _foreach_col \ , BOOST_FOREACH_TYPEOF(COL) \ , BOOST_FOREACH_RVALUE(COL) \ , BOOST_FOREACH_CHEAP_COPY(COL)) #define BOOST_FOREACH_END(COL) \ ::boost::foreach::end( \ _foreach_col \ , BOOST_FOREACH_TYPEOF(COL) \ , BOOST_FOREACH_RVALUE(COL) \ , BOOST_FOREACH_CHEAP_COPY(COL)) #define BOOST_FOREACH_DONE(COL) \ ::boost::foreach::done( \ _foreach_cur \ , _foreach_end \ , BOOST_FOREACH_TYPEOF(COL)) #define BOOST_FOREACH_NEXT(COL) \ ::boost::foreach::next( \ _foreach_cur \ , BOOST_FOREACH_TYPEOF(COL)) #define BOOST_FOREACH_DEREF(COL) \ ::boost::foreach::deref( \ _foreach_cur \ , BOOST_FOREACH_TYPEOF(COL)) /////////////////////////////////////////////////////////////////////////////// // BOOST_FOREACH // // For iterating over collections. Collections can be // arrays, null-terminated strings, or STL containers. // The loop variable can be a value or reference. For // example: // // std::list<int> int_list(/*stuff*/); // BOOST_FOREACH(int &i, int_list) // { // /* // * loop body goes here. // * i is a reference to the int in int_list. // */ // } // // Alternately, you can declare the loop variable first, // so you can access it after the loop finishes. Obviously, // if you do it this way, then the loop variable cannot be // a reference. // // int i; // BOOST_FOREACH(i, int_list) // { ... } // #define BOOST_FOREACH(VAR, COL) \ if (bool _foreach_rvalue = false) {} else \ if (::boost::foreach::auto_any_t _foreach_col = BOOST_FOREACH_CONTAIN(COL)) {} else \ if (::boost::foreach::auto_any_t _foreach_cur = BOOST_FOREACH_BEGIN(COL)) {} else \ if (::boost::foreach::auto_any_t _foreach_end = BOOST_FOREACH_END(COL)) {} else \ for (bool _foreach_continue = true; \ _foreach_continue && !BOOST_FOREACH_DONE(COL); \ _foreach_continue ? BOOST_FOREACH_NEXT(COL) : BOOST_FOREACH_NOOP(COL)) \ if (::boost::foreach::set_false(_foreach_continue)) {} else \ for (VAR = BOOST_FOREACH_DEREF(COL); !_foreach_continue; _foreach_continue = true) #endif