March 2007 - Boost-users - lists.preview.boost.org

[wave] revisited is_defined_macro
by Ovanes Markarian 20 Mar '07

20 Mar '07

Hello Hartmut, I have a question regardning the is_defined_macro member of context type. Is it intended, that this member is non-const? (CVS version as well) With Kind Regards, Ovanes

2 4

BGL adjacency_list bundled properties io
by Naomi Fox 20 Mar '07

20 Mar '07

I am trying to use an adjacency list with bundled properties. So I type my graph data stucture as so: struct MyV { int numOnVertex; }; struct MyE { int numOnEdge; }; typedef adjacency_list<setS, setS, bidirectionalS, MyV, MyE> MyGraph; I would like to use the read function as defined in adjacency_list_io.hpp, so I can read in my special graph from a file that looks like below. # 3 vertices, v0.numOnVertex=6, v1.numOnVertex=5, v2.numOnVertex=3 v 0 6 1 5 2 3 # 3 edges, edge 0, numOnEdge=0; edge 1, numOnEdge=3, edge 2, numOnEdge = 3 e 1 2 0 0 1 3 1 0 3 I can't seem to figure out a simple way to do IO with bundled properties. When I try these lines: MyGraph g; cin >> read(g); I get the error: C:\boost_1_33_1\boost/graph/adjacency_list_io.hpp(153) : error C2679: binary '>>' : no operator found which takes a right-hand operand of type 'MyV' (or there is no acceptable conversion)

1 0

[mpl] Implementing includes_if
by Scott Meyers 20 Mar '07

20 Mar '07

I want to implement this: // returns whether Seq1 includes each of the elements in Seq2 // using Pred to determine type equality template<typename Seq1, // the putative superset typename Seq2, // the putative subset typename Pred> // whether T1 from Seq1 == T2 from Seq2 struct includes_if; My ultimate goal is to be able to determine whether every element in Seq2 is either in Seq1 or has a base class in Seq1. So the predicate I'll be passing in is a metafunction class that invokes std::tr1::is_base_of. Here's my code, all but one line of which is supposed to be correct: template<typename Seq1, // the putative superset typename Seq2, // the putative subset typename Pred> // whether T1 from Seq1 == T2 from Seq2 struct includes_if : boost::is_same< typename mpl::find_if< Seq2, mpl::not_<mpl::contains_if<Seq1, lambda(T) is_base_of<mpl::_1, T> //!! > > >::type, typename mpl::end<Seq2>::type > {}; The line I don't know how to write is flagged, but the functionality I want to express is shown. In case it's relevant, here is the rest of my code: // metafunction class for TR1-conforming is_base_of struct is_base_of { template<typename T1, typename T2> struct apply: std::tr1::is_base_of<T1, T2> {}; }; // returns whether Seq contains an element satisfying Pred template<typename Seq, typename Pred> struct contains_if : mpl::not_< boost::is_same< typename mpl::find_if< Seq, mpl::apply<Pred, mpl::_1> >::type, typename mpl::end<Seq>::type > > {}; Thanks for all help, Scott

4 7

Re: [Boost-users] [asio].[aix].[1_33_1] Update regarding test cases compilation
by Gaurav.Jain＠iflexsolutions.com 20 Mar '07

20 Mar '07

Hi Chris, Christopher Kohlhoff <chris <at> kohlhoff.com> writes: > > > On Tue, 13 Mar 2007 18:58:47 +0530, Gaurav.Jain <at> iflexsolutions.com said: > > I am afraid to say that you are right in your observation. I am now > > using asio 0.3.8rc2 to compile and run the asio test cases. > > I presume this means you were able to get an uncorrupted copy of the > archive :) To make this bzip file work, I first downloaded to windows & then ftp the same to solaris & extract the solaris file, archving on solaris and ftp to aix machine. I am still not able to extract the bzip on AIX. Its still giving the same checksum error. > > Following test cases are throwing ambiguous reference to "ip" error > > during compilation: > [...] > > After qualifying boost::asio:: to all the ip in the above mentioned test > > cases, I am able to compile & execute them. > > Could you let me know if adding: > > namespace ip = boost::asio::ip; > > immediately after the "using namespace boost::asio;" line can also fix > the problem. Thanks! Yes, with above changes, now I am able to compile & execute the test cases. Cheers, Gaurav Jain DISCLAIMER: This message contains privileged and confidential information and is intended only for an individual named. If you are not the intended recipient, you should not disseminate, distribute, store, print, copy or deliver this message. Please notify the sender immediately by e-mail if you have received this e-mail by mistake and delete this e-mail from your system. E-mail transmission cannot be guaranteed to be secure or error-free as information could be intercepted, corrupted, lost, destroyed, arrive late or incomplete or contain viruses. The sender, therefore, does not accept liability for any errors or omissions in the contents of this message which arise as a result of e-mail transmission. If verification is required, please request a hard-copy version.

1 0

variant no compile time check on get<> type parameter
by Dizzy 20 Mar '07

20 Mar '07

Hello In order to minimize heap allocations but still allow for some OOP designs I needed a sort of union but one that it works for more than POD types. So I implemented such a thing myself to find out recently that boost::variant might do this already (boost does that often ;) ). However, initial testing for boost::variant shows that that there is no compile time check on the types allowed to instantiate boost::get on a variant, example: struct A {}; struct B {}; struct C{}; int main() { boost::variant v<A, B> v; boost::get<C>(v); } Compiles fine (gcc 4.1.1, boost 1.33.1) but errors at runtime throwing a bad_get exception from get. It seems to me that the get<> on variant somehow works for any type not checking if the type parameter for get matches one in the type sequence of the given variant. Maybe I miss something but shouldn't get on variant have a compile time type check ? (this would catch at compile time common errors for variant use cases I think) -- Mihai RUSU Email: dizzy(a)roedu.net GPG : http://dizzy.roedu.net/dizzy-gpg.txt WWW: http://dizzy.roedu.net "Linux is obsolete" -- AST

2 1

How can I build Boost.regex in visual studio 2005 that?
by 신규선 20 Mar '07

20 Mar '07

Hi everyone~^^ I’m installing boost.regex to visual studio 2005 Step 1. Run vcvarsall.bat : D:\Program Files\Microsoft Visual Studio 8\VC\vcvarsall.bat. A. I got the following message on the screen -> Setting environment for using Microsoft Visual Studio 2005 x86 tools. 2. Move directory : D:\MyLibrary\boost_1_33_1\libs\regex\build 3. Run nmake : nmake -f vc8.mak install 4. Building… 5. I got the following error message (U1077) : A. NMAKE : fatal error U1077: '"D:\Program Files\Microsoft Visual Studio 8\VC\BIN\cl.EXE"' : '0x2' …. How can I build Boost.regex in visual studio 2005 that?

2 1

Compiling boost for Windows Mobile
by Colin Irwin 20 Mar '07

20 Mar '07

Hi, I have some libraries of my own - of course using boost(!) - that I would like to use on the Windows Mobile platform. For those libraries that are non-header only, it's not clear to me how to change the platform to compile for. I'm using Microsoft Visual Studio .Net 2005 and so am hoping it should be possible. (Saying this, I fully understand that there may be libraries that don't work too well.) I've looked through the boost documentation and searched on the web/discussion groups, but can't find anything relevant. How does one specify the compiler (I understand the 'vc-8_0' bit, having used boost for many years) and the platform together? Can someone point me in the right direction? Thanks, Colin

3 2

SQL library with full embedded SQL-syntax
by Dmitri Lyfar 19 Mar '07

19 Mar '07

Hi I would like to participate in Google Summer of Code in this year. I reviewed boost projects for last years and found an interesting project, I think. If you go to the link below you will see a short description for that library: http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Google_Summe… The goal of this post is to define the main library features, which will be useful for users. Is that library useful for C++ community? If you are using(or have ever used) similar C++ libraries for work with SQL: which of features do you want to have? Also I want to notice one of the biggest beauty of that approach: you can get the compiler to type-check the SQL-expression, what do you think about that? Thank you. Best regards, Lyfar Dmitriy

5 6

[ping] The review of Intrusive library started March 12
by Joaquín Mª López Muñoz 19 Mar '07

19 Mar '07

As we approach the mid review of Ion Gaztañaga's Intrusive library, I would like to encourage you to consider submitting your review reports. So far we've received three reviews only, I hope more Boost members step in and contribute to this global effort which constitutes the cornerstone of Boost renowned quality standards. If you love and use Boost, remember that active involvement is a nice way of repaying the benefit you have obtained from this community. If you plan to submit a review before the deadline but are still working on it, I'd appreciate receiving a short notice so that I can estimate the final number of reviewers. Also, if you'd like to do a review but can't do it on time, please let me know so as to consider the possibility to ask for a period extension. The Review Manager, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 2

[fusion] How to create an object of my fusion generated type?
by Christian Henning 19 Mar '07

19 Mar '07

Hi there, I'm still playing with my vector of types example. Please see what I'm doing: #include <vector> #include <boost/mpl/assert.hpp> #include <boost/mpl/equal.hpp> #include <boost/mpl/list.hpp> #include <boost/mpl/transform.hpp> #include <boost/fusion/algorithm/transformation/transform.hpp> #include <boost/fusion/algorithm/iteration/for_each.hpp> #include <boost/fusion/sequence/adapted/mpl.hpp> #include <boost/fusion/sequence/container.hpp> #include <boost/fusion/sequence/conversion/as_list.hpp> using namespace std; using namespace boost; template <typename T> struct add_vector { typedef std::vector<T> type; }; struct A; struct B; struct C; struct create_empty_vec { template< class T > void operator()( T& t ) const { return std::vector<T>(); } }; struct add_one { template< class T > void operator()( T& vec ) const { vec.push_back( T() ); } }; int main() { typedef mpl::list< A, B, C > _types_; typedef mpl::transform1< _types_, add_vector<mpl::_1> >::type _mpl_list_of_vectors_; typedef fusion::result_of::as_list<_mpl_list_of_vectors_>::type _fusion_list_of_vectors_; _fusion_list_of_vectors_ vectors; fusion::for_each( vectors, create_empty_vec() ); return 0; } I have no idea why this code doesn't compile. My compiler (VC7.1) complaints: test.cpp C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\vector(795) : error C2036: 'std::vector<_Ty>::pointer' : unknown size with [ _Ty=boost::mpl::aux::resolve_bind_arg<boost::mpl::bind1<boost::mpl::quote1<add_vector,boost::mpl::void_>,boost::mpl::lambda<boost::mpl::_1,boost::mpl::void_>::result_>::apply<boost::mpl::aux::resolve_bind_arg<boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>::apply<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::bkwd_state3,boost::mpl::deref<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::iter2>::type,boost::mpl::na,boost::mpl::na,boost::mpl::na>::a1,boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boos t::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::bkwd_state3,boost::mpl::deref<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::iter2>::type,boost::mpl::na,boost::mpl::na,boost::mpl::na>::type>::a1,boost::mpl::aux::resolve_bind_arg<boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>::apply<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::bkwd_state3,boost::mpl::deref<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_ tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::iter2>::type,boost::mpl::na,boost::mpl::na,boost::mpl::na>::a1,boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::bkwd_state3,boost::mpl::deref<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::iter2>::type,boost::mpl::na,boost::mpl::na,boost::mpl::na>::type,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na>::type ] C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\vector(791) : while compiling class-template member function 'void std::vector<_Ty>::_Tidy(void)' with [ _Ty=boost::mpl::aux::resolve_bind_arg<boost::mpl::bind1<boost::mpl::quote1<add_vector,boost::mpl::void_>,boost::mpl::lambda<boost::mpl::_1,boost::mpl::void_>::result_>::apply<boost::mpl::aux::resolve_bind_arg<boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>::apply<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::bkwd_state3,boost::mpl::deref<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::iter2>::type,boost::mpl::na,boost::mpl::na,boost::mpl::na>::a1,boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::m pl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::bkwd_state3,boost::mpl::deref<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::iter2>::type,boost::mpl::na,boost::mpl::na,boost::mpl::na>::type>::a1,boost::mpl::aux::resolve_bind_arg<boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>::apply<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::bkwd_state3,boost::mpl::deref<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mp l::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::iter2>::type,boost::mpl::na,boost::mpl::na,boost::mpl::na>::a1,boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::bkwd_state3,boost::mpl::deref<boost::mpl::aux::reverse_fold_impl<3,boost::mpl::begin<_types_>::type,boost::mpl::end<_types_>::type,boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::state,boost::mpl::bind2<boost::mpl::lambda<boost::mpl::inserter<boost::mpl::clear_impl<boost::mpl::aux::list_tag>::apply<_types_>::type,boost::mpl::push_front<boost::mpl::na,boost::mpl::na>>::operation>::type,boost::mpl::_1,boost::mpl::bind1<boost::mpl::lambda<add_vector<boost::mpl::_1>>::type,boost::mpl::_2>>,boost::mpl::arg<1>>::iter2>::type,boost::mpl::na,boost::mpl::na,boost::mpl::na>::type,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na>::type [snip] Any help is appreciated, Christian

1 1