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

[mpl] Inheriting from each type in a sequence
by Scott Meyers 28 Mar '07

28 Mar '07

Given some base class, class Base { virtual ~Base(){} }; I want to be able to implement this: template<typename Seq> const Base& createObject() { // return an object that inherits from Base and every type in Seq } The problem is how to create the type of object I want. mpl::inherit is almost what I need, but it takes as template parameters each type to inherit from, and I don't have discrete types, I have a sequence of types. mpl::inherit_linearly takes a sequence and would work for my purposes (which is to create an object that I can later check via dynamic_cast to see if it inherits from a given type), but it works only with forward sequences, and I'll typically have an mpl::set. I could copy the contents of Seq into an mpl::vector and go from there, but that seems kind of gross. Is there a good way to solve this problem that I am overlooking? Thanks, Scott

4 5

[Math Toolkit] MSVC 7.1 issue
by Johan Råde 28 Mar '07

28 Mar '07

I just downloaded the latest version of the Math Toolkit, and tried a simple example: #include <boost/math/distributions/students_t.hpp> boost::math::students_t_distribution<double>(5) dist; When I compile these two lines of code with MSVC 7.1 I get the following error messages: boost\math\special_functions\log1p.hpp(195) : error C2785: 'tools::promote_args<T>::type boost::math::log1p(T)' and 'double boost::math::log1p(double)' have different return types boost\math\special_functions\math_fwd.hpp(246) : see declaration of 'boost::math::log1p' boost\math\special_functions\log1p.hpp(182) : see declaration of 'boost::math::log1p' boost\math\special_functions\log1p.hpp(195) : error C2912: explicit specialization; 'double boost::math::log1p<double>(double)' is not a specialization of a function template boost\math\special_functions\log1p.hpp(183) : fatal error C1903: unable to recover from previous error(s); stopping compilation -- Johan Råde

2 3

String Algo used with std algorithms
by Jason Ivey 28 Mar '07

28 Mar '07

Is there any way to use the string algorithm predicates and other facilities in conjunction with the standard algorithms (IE. for_each, find_if, etc.)? For example I am trying to make the following example work in MSVC8: typedef std::vector<std::string> Strs; Strs strs; strs.push_back("bob"); strs.push_back("lisa"); strs.push_back("eric"); Strs::const_iterator iter = find_if( strs.begin(), strs.end(), boost::bind( &istarts_with, _1, "B", std::locale() ) ); std::cout << "Found: " << std::boolalpha << ( iter == strs.end() ) << std::endl; I would be grateful for any comments or suggestions. Thanks, Jason

2 1

[fusion] Accessing sequence elements at runtime
by Christian Henning 28 Mar '07

28 Mar '07

Hi there, is it somehow possible to access a sequence element at runtime? Just image you're reading some name value pairs from file and you would like them to assign them to a fusion sequences. This way I don't know they order the values are supplied. Is that possible? For example take the following code: #include <string> #include <algorithm> #include <functional> #include <vector> #include <boost/any.hpp> #include <boost/bind.hpp> #include <boost/fusion/sequence.hpp> using namespace std; using namespace boost; struct A {}; struct B {}; struct info { string name; any value_type; }; static info info_table[] = { { "A_Value", any( A() ) }, { "B_Value", any( B() ) } }; string& get_name( info& i ) { return i.name; } typedef fusion::map< fusion::pair< A , int > , fusion::pair< B , double > > seq_type; int _tmain(int argc, _TCHAR* argv[]) { // Image a file read has delivered the following name value pair. string name = "A_Value"; int a_value = 12; // Find the type of the supplied name info* p = find_if( &info_table[0] , &info_table[0] + 2 , bind( equal_to<string>() , bind( &get_name, _1 ) , name )); seq_type seq; // How to add the value to the supplied name?? } Christian

3 2

[boost::pool] problem with allocation
by Seweryn Habdank-Wojewódzki 28 Mar '07

28 Mar '07

Hi! Below if small code for testing of pool_allocator. The program below is working quite good. But if I change 10`000 to 100`000 or more then program never ending. Regards. #include <list> #include <iostream> #include <algorithm> #include <iterator> #include <boost/pool/pool_alloc.hpp> int main() { using namespace std; //print_list(std::cout,primes::PrimesLE(10000000)); list<int,boost::pool_allocator<int> > p; for ( int i = 0; i < 10000; ++i ) p.push_back(i); //copy ( p.begin(), p.end(), ostream_iterator<int>(cout,"\n") ); //boost::singleton_pool<boost::pool_allocator_tag, sizeof(int)>::release_memory(); } -- |\/\/| Seweryn Habdank-Wojewódzki \/\/

1 0

[Statechart] Reusing states
by Philippe DAVID 27 Mar '07

27 Mar '07

Hi, I would like to reuse a state in statechart at different places of the state machine (so it can be a sub-state of at least 2 other states) or in different state machines. Since the state class has a template parameter with the context I am a bit stuck here. Have you done that yet or have an idea about how to do it ? Thanks, Philippe

2 1

[boost::wave] MSVC 8 warning
by Ovanes Markarian 27 Mar '07

27 Mar '07

Hello, I would like to address this issue to boost::wave authors. First of all great lib! Many thanks! During the compilation with MSVC8 Express Edition I get a warning: c:\boost\include\boost-1_33_1\boost\wave\cpp_context.hpp(112) : warning C4355: 'this' : used in base member initializer list c:\boost\include\boost-1_33_1\boost\wave\cpp_context.hpp(106) : while compiling class template member function 'boost::wave::context<IteratorT,LexIteratorT>::context(const std::_String_iterator<_Elem,_Traits,_Alloc> &,const std::_String_iterator<_Elem,_Traits,_Alloc> &,const char *,const TraceT &)' with [ IteratorT=token_groups::str_iter_type, LexIteratorT=token_groups::lex_iter_type, _Elem=char, _Traits=std::char_traits<char>, _Alloc=std::allocator<char>, TraceT=boost::wave::context_policies::default_preprocessing_hooks ] My typedefs look like: typedef wave::cpplexer::lex_token<> token_type; typedef wave::cpplexer::lex_iterator<token_type> lex_iter_type; typedef std::string::iterator str_iter_type; typedef wave::context<str_iter_type, lex_iter_type> context_type; typedef context_type::iterator_type ctx_iter_type; Is there any chance that this warning will be suppressed in the next release, since it is a little bit annoying. I can't do anything about it as a user of wave and I also try to follow the rule to compile clean without warnings. Many thanks and With Kind Regards, Ovanes Markarian

2 2

BOOST: Any planned release?
by dhruva 27 Mar '07

27 Mar '07

Hi, I am particularly looking for the boost::interprocess package. Is there any plan for a release in the near future? Has someone been using this in their production environment now. I have a real need and am evaluating if it is complete enough (with not too many changes planned) for me to replace the existing IPC mechanism used by us (McAfee). with best regards, dhruva -- Dhruva Krishnamurthy Contents reflect my personal views only!

2 1

[serialization] custom xml archive and dynamic linking (VC 8.0)
by Sergey Skorniakov 27 Mar '07

27 Mar '07

Hello. I have tried to inherit my custom archive from xml_iarchive_impl and found no way to do it if macro BOOST_SERIALIZATION_DYN_LINK is defined. May be anybody already do that and can suggest me how?

1 0

Re: [Boost-users] [test] detect_memory_leak option in msvc 8
by KLINIK Markus SDI2-G (AREVA NP GmbH) 27 Mar '07

27 Mar '07

> I am trying to get the --detect_memory_leak=1 option to detect a > memory leak in my code. Hi! In MSVC 7.0 the memory leak detection is somewhat primitive (I don't know about MSVC 8). I'm using Boost.Test together with mpatrol and it works great! Here is the output of a test run: <mpatrol_output> top 4 unfreed memory entries in leak table: bytes count location -------- ------ -------- 400 1 d:\[snip]\unittests\test_config.cpp line 10 84 1 d:\[snip]\tcpstream\src\myenv.cc line 145 24 1 c:\src\boost_1_33_1\libs\thread\src\mutex.inl line 55 8 1 c:\src\boost_1_33_1\libs\thread\src\tss_hooks.cpp line 29 516 4 total </mpatrol_output> NB. The first memory leak is intentional, the second is a resource leak from cppadvio. It also detects the already discussed resource leaks in Boost.Treads :) I needed some try-and-error to find the correct versions of mpatrol, Boost.Test and the windows runtime library, but now that it works, it is incredibly useful. (/MDd, mpatrolmt.dll, libboost_unit_test_framework-vc7-mt-gd.lib) Just for comparison, here is the output of the MSVC 7.0 memory leak detection of the same code: <msvc_output> Detected memory leaks! Dumping objects -> {11225} normal block at 0x00F3AA60, 24 bytes long. Data: < > 18 EE 14 00 FF FF FF FF 00 00 00 00 00 00 00 00 {11224} normal block at 0x00F3BBB0, 8 bytes long. Data: <` > 60 AA F3 00 01 CD CD CD {201} normal block at 0x00F35F90, 400 bytes long. Data: < > CD CD CD CD CD CD CD CD CD CD CD CD CD CD CD CD {147} normal block at 0x00F35880, 84 bytes long. Data: < =b > 10 3D 62 00 00 00 00 00 00 00 00 00 FF FF FF FF Object dump complete. </msvc_output> Best regards Markus Klinik

2 1

Proper initialization of a boost::shared_ptr<> in a constructor
by Stephen Torri 27 Mar '07

27 Mar '07

I am attempting to hunt down why I am getting a segmentation fault from the boost::shared_ptr class. I know that it has to do with how I am managing my shared pointers. That is creating and using them in functions. I am reading the best practices web page and I have a question about the best way to initialize a shared_ptr. Normally I have a class like the following: class A { public: typedef boost::shared_ptr<A> ptr_t; A ( int input_value ) : value ( input_value ) {} private: int value; }; Which I will use in another place: class A_User { public: A_User () : m_a_ptr ( new A() ) {} private: A::ptr_t m_a_ptr; }; Is this the correct way to initialize the A::ptr_t held in the A_User class in its constructor? Stephen

4 7

[boost::function] problem with void type as argument type
by Seweryn Habdank-Wojewódzki 26 Mar '07

26 Mar '07

Hi! I have small piece of code and I do not know why it is not compiling - proper instantiation of function is not created. It means, why boost::function can not deduct types (code below). The problem is when type U is void. Can any one help me with it? Regards. template < typename T, typename U > void test ( boost::function<T(U)> & f ) { f(); } int f3() { std::cout << "f3(void)" << std::endl; return 3; } void f4() { std::cout << "f4(void)" << std::endl; return;// 4; } int main() { boost::function<int (void)> h = &f3; boost::function<void (void)> i = &f4; test (h); test (i); } -- |\/\/| Seweryn Habdank-Wojewódzki \/\/

2 4

Re: [Boost-users] [bind] static array vs. pointer vector
by Daniel 26 Mar '07

26 Mar '07

> Date: Mon, 26 Mar 2007 11:24:08 -0400 > From: "Christian Henning" <chhenning(a)gmail.com> > Subject: [Boost-users] [bind] static array vs. pointer vector > To: boost-users(a)lists.boost.org > Message-ID: > <949801310703260824n31c76204pcd63bb686169e15c(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Hi there, I have posted this question last Friday, already. But maybe > my example was too confusing. Here is a more simple example. > Basically, I don't see what the big difference is when using > boost::bind with a pointer vector ( std::vector<info*> ) and a static > array of info. > > Please consider the following code: > > #include <string> > #include <algorithm> > #include <functional> > #include <vector> > > #include <boost/bind.hpp> > > using namespace std; > using namespace boost; > > struct info > { > int a; > string s; > }; > > static info table[] = > { > { 16, "Hello" }, > { 18, "Moin" } > }; > > string& get_s( info* p ) > { > return p->s; > } > > int _tmain(int argc, _TCHAR* argv[]) > { > { > vector<info*> v; > find_if( v.begin(), v.end() > , bind( equal_to<string>() > , bind( &get_s, _1 ) > , "Moin" )); > } > > { > find_if( &table[0], &table[0] + 2 > , bind( equal_to<string>() > , bind( &get_s, _1 ) > , "Moin" )); > > } > } > > The second find_if wont complie using MSVC 7.1. The errors are: > > c:\boost\boost\bind.hpp(219) : error C2664: 'std::string &(info *)' : > cannot convert parameter 1 from 'info' to 'info *' [snip] > > Any ideas? > > Christian In 1st case, when you dereference vector<info*> iterator, you will get info* pointer. But in 2nd case, your iterator is info* pointer, so you get info object when you dereference it. This is also mentioned at beginning of error message - "cannot convert parameter 1 from 'info' to 'info *'". Therefore you should change your get_s() function to accept info (or info&), or your binding expression to convert info to info*. Daniel

2 1

[bind] static array vs. pointer vector
by Christian Henning 26 Mar '07

26 Mar '07

Hi there, I have posted this question last Friday, already. But maybe my example was too confusing. Here is a more simple example. Basically, I don't see what the big difference is when using boost::bind with a pointer vector ( std::vector<info*> ) and a static array of info. Please consider the following code: #include <string> #include <algorithm> #include <functional> #include <vector> #include <boost/bind.hpp> using namespace std; using namespace boost; struct info { int a; string s; }; static info table[] = { { 16, "Hello" }, { 18, "Moin" } }; string& get_s( info* p ) { return p->s; } int _tmain(int argc, _TCHAR* argv[]) { { vector<info*> v; find_if( v.begin(), v.end() , bind( equal_to<string>() , bind( &get_s, _1 ) , "Moin" )); } { find_if( &table[0], &table[0] + 2 , bind( equal_to<string>() , bind( &get_s, _1 ) , "Moin" )); } } The second find_if wont complie using MSVC 7.1. The errors are: c:\boost\boost\bind.hpp(219) : error C2664: 'std::string &(info *)' : cannot convert parameter 1 from 'info' to 'info *' No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called c:\boost\boost\bind\bind_template.hpp(139) : see reference to function template instantiation 'R boost::_bi::list1<A1>::operator ()<boost::_bi::bind_t<R,F,L>::result_type,std::string&(__cdecl *)(info *),A>(boost::_bi::type<T>,F & ,A &,long)' being compiled with [ R=boost::_bi::bind_t<std::string &,std::string &(__cdecl *)(info *),boost::_bi::list1<boost::_bi::list_av_1<boost::arg<1>>::B1>>::result_type, A1=boost::_bi::list_av_1<boost::arg<1>>::B1, F=std::string &(__cdecl *)(info *), L=boost::_bi::list1<boost::_bi::list_av_1<boost::arg<1>>::B1>, A=const boost::_bi::list1<info &>, T=boost::_bi::bind_t<std::string &,std::string &(__cdecl *)(info *),boost::_bi::list1<boost::_bi::list_av_1<boost::arg<1>>::B1>>::result_type ] c:\boost\boost\bind.hpp(213) : see reference to function template instantiation 'boost::_bi::bind_t<R,F,L>::result_type boost::_bi::bind_t<R,F,L>::eval<const boost::_bi::list1<A1>>(A &)' being compiled with [ R=std::string &, F=std::string &(__cdecl *)(info *), L=boost::_bi::list1<boost::_bi::list_av_1<boost::arg<1>>::B1>, A1=info &, A=const boost::_bi::list1<info &> ] [snip] Any ideas? Christian

2 2

[fusion] Stateful unary functor for for_each loop
by Christian Henning 26 Mar '07

26 Mar '07

Hi there, is it possible to have a stateful functor object when using fusion::for_each() loop. I would like to to the following: #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; struct A { void print() { cout << "A" << endl; }}; struct B { void print() { cout << "B" << endl; }}; struct C { void print() { cout << "C" << endl; }}; std::vector<A> find_all( A ) { return std::vector<A>(12); } std::vector<B> find_all( B ) { return std::vector<B>(12); } std::vector<C> find_all( C ) { return std::vector<C>(12); } typedef mpl::list< A, B, C > _types_; template <typename T> struct add_vector { typedef std::vector<T> type; }; struct find_all_ { template< class T > void operator()( T& t ) const { typedef typename T::value_type type; type v; t = find_all( v ); } }; struct check_size { check_size() : _init( false ), _size( 0 ) {} template< class T > void operator()( T& t ) { if( !_init ) { _size = t.size(); _init = true; return; } if( _size != t.size() ) { throw runtime_error( "vectors don't match up." ); } } private: bool _init; size_t _size; }; struct print { template< class T > void operator()( T& vec ) const { vec[0].print(); } }; int main() { 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, find_all_() ); fusion::for_each( vectors, check_size() ); return 0; } Unfortunately it wont compile. The error messages are: c:\boost\boost\fusion\algorithm\iteration\detail\for_each.hpp(28) : error C3848: expression having type 'const check_size' would lose some const-volatile qualifiers in order to call 'void check_size::operator ()<T>(T &)' with [ T=boost::fusion::extension::deref_impl<boost::fusion::cons_iterator_tag>::apply<boost::fusion::cons_iterator<_fusion_list_of_vectors_>>::value_type ] c:\boost\boost\fusion\algorithm\iteration\for_each.hpp(37) : see reference to function template instantiation 'void boost::fusion::detail::for_each<boost::fusion::extension::begin_impl<boost::fusion::cons_tag>::apply<Sequence>::type,boost::fusion::extension::end_impl<boost::fusion::cons_tag>::apply<Sequence>::type,F>(const First &,const Last &,const F &,boost::mpl::false_)' being compiled with [ Sequence=_fusion_list_of_vectors_, F=check_size, First=boost::fusion::extension::begin_impl<boost::fusion::cons_tag>::apply<_fusion_list_of_vectors_>::type, Last=boost::fusion::extension::end_impl<boost::fusion::cons_tag>::apply<_fusion_list_of_vectors_>::type ] test.cpp(100) : see reference to function template instantiation 'void boost::fusion::for_each<_fusion_list_of_vectors_,check_size>(Sequence &,const F &)' being compiled with [ Sequence=_fusion_list_of_vectors_, F=check_size ] Any ideas? Christian

5 13

Re: [Boost-users] [Serialization] issue withportable_binary_oarchive
by Pfligersdorffer, Christian 26 Mar '07

26 Mar '07

Dear Robert, > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org]On Behalf Of Robert Ramey > Sent: Friday, March 16, 2007 9:49 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [Serialization] issue > withportable_binary_oarchive > > > Pfligersdorffer, Christian wrote: > > > I read this thread with very much interest since I want to use the > > portable binary archive too. Could you please share your experience > > and especially the code of the version that actually works? > > I've made some a few changes. I'll check them in to the HEAD before > tomorrow. I will have a look at that. > a) I made a small change to binary_?archvive which was losing > a "const" along the line and frustrating a template match > > b) I made a change in portable_binary_?archive to fix an > error whereby the sign bit was changed on certain > negative numbers. > > > Did you also add code to treat floating point types? > > Nope - that's an excercise for the user. > Notes on the current implementation: > > a) It presumes a two's complement computer so its not > "truely" portable. OK, I would not use it on some very fancy cpus then. ppc and x86 should probably work and that's what counts with me. > b) It doesn't include floating point. I think this would be more > effort than first meets the eye. At least one attractive proposal on > how to effectively do this was suggested. > c) Its not all that efficient on big endien machines. I think > a better version would write the data out in native mode > with flags in the header indicating how it was written. Then > the endian fix up would occur when it was moved from > one machine to another. I would like to switch to big endian representation to ensure maximum speed on the embedded system. This should easily be possible by changing the #ifdef BOOST_LITTLE_ENDIAN sections into #ifndef, or? ... > d) It focuses more on reducing archive size. So some > a 64 bit value of 0 is written as one byte. This is probably > a good choice for most. But it costs time in sign extending > etc. > > Robert Ramey By the way: did you solve the destruction issue when deleting an archive through the polymorphic interface? I sent you an email about that (a couple of months ago) and you answered you'd have a look at it. Regards, -- DI Christian Pfligersdorffer Software Engineering EOS GmbH

2 1

[Serialization]: Persistent references between archives
by Stefan Holzmann 26 Mar '07

26 Mar '07

Hello, For my application I need to serialize my data distributed into muliple archives and I need a persistent references on objects inside a different archiv. There is one main archiv which has references on other archives. I was thinking on the following solution (Perhaps there is an easier way). I think I have to store and load my objects into several steps. Save: 1. Assign each archiv a unique id. (Build up a archiv map) 2. Assign each object which needs to be referenced a unique id inside the archiv and build up a object map. 3. Serialize the archiv map (e.g. Archiv ID <-> Archiv Filename). 4. Serialize the content of all objects to the archives. If a reference on a objects needs to be stored the id of this object is serialized to the archiv. The 32bit object ID consists of a archiv ID as high word and the ID of the object within the archiv as low word. Load: 1. Load and create all the objects from the archives. 2. Assign again the object IDs to each object which can be referenced and build up a map (object <-> ID). 3. Resolve the references by looking up the the object address for the stored object id. I think step 2 could be skipped if the object IDs are stored also. Whats your opinion on this? Could this work? Any suggestion for implementation? To assign the object ID's I have to traverse the complete object structure in similar manner than during the serialize process. Is there a way to use the same mechanism but don't write any data to the archives. Regards, Stefan -- "Feel free" - 10 GB Mailbox, 100 FreeSMS/Monat ... Jetzt GMX TopMail testen: www.gmx.net/de/go/mailfooter/topmail-out

1 0

Segmentation fault in boost::iterator_property_map when using bfs visitor
by Stephen Torri 26 Mar '07

26 Mar '07

I am receiving a segmentation fault in boost::iterator_property_map for the following code. // Prepare Data infrastructure::Graph_Base::Data_Map_t m_data_map; // Process Graph visitor::Graph_Visitor graph_visitor_ref ( *graph_ptr, &m_data_map ); // Segmentation fault starts here boost::breadth_first_search ( graph_ptr->get_Graph(), // Grabs the adjacency list reference graph_ptr->get_Vertex ( 1 ), // Grabs the first vertex descriptor boost::visitor ( graph_visitor_ref ) ); // Call visitor (line 218) Here is the backtrace: #0 0x00d343ff in boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, unsigned int, unsigned int const&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>::operator[] (this=0xbff21818, v=0x4) at /usr/include/boost/property_map.hpp:349 #1 0x00d3445a in boost::put<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, unsigned int, unsigned int const&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, boost::default_color_type&, void*, boost::default_color_type> (pa=@0xbff21818, k=0x4, v=@0xbff217ec) at /usr/include/boost/property_map.hpp:319 #2 0x00d3b4d0 in boost::breadth_first_search<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, boost::queue<void*, std::deque<void*, std::allocator<void*> > >, libreverse::visitor::Graph_Visitor, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, unsigned int, unsigned int const&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&> > (g=@0x81e70c8, s=0x81e6c10, Q=@0xbff21830, vis= {<boost::bfs_visitor<boost::null_visitor>> = {m_vis = {<> = {<No data fields>}, <No data fields>}}, m_graph_ref = @0x81e70c8, m_data_map = 0xbff21970}, color= {<boost::put_get_helper<boost::default_color_type&,boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, unsigned int, const unsigned int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&> >> = {<No data fields>}, iter = {_M_current = 0x81ec4b0}, index = {<boost::put_get_helper<const unsigned int&,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, unsigned int, const unsigned int&, boost::vertex_index_t> >> = {<No data fields>}, <No data fields>}}) at /usr/include/boost/graph/breadth_first_search.hpp:97 #3 0x00d3b5f0 in boost::detail::bfs_helper<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_ty---Type <return> to continue, or q <return> to quit--- pe> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, unsigned int, unsigned int const&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, libreverse::visitor::Graph_Visitor, libreverse::visitor::Graph_Visitor, boost::graph_visitor_t, boost::no_property> (g=@0x81e70c8, s=0x81e6c10, color= {<boost::put_get_helper<boost::default_color_type&,boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, unsigned int, const unsigned int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&> >> = {<No data fields>}, iter = {_M_current = 0x81ec4b0}, index = {<boost::put_get_helper<const unsigned int&,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, unsigned int, const unsigned int&, boost::vertex_index_t> >> = {<No data fields>}, <No data fields>}}, vis= {<boost::bfs_visitor<boost::null_visitor>> = {m_vis = {<> = {<No data fields>}, <No data fields>}}, m_graph_ref = @0x81e70c8, m_data_map = 0xbff21970}, params=@0xbff219ac) at /usr/include/boost/graph/breadth_first_search.hpp:185 #4 0x00d3b7c0 in boost::detail::bfs_dispatch<boost::detail::error_property_not_found>::apply<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, libreverse::visitor::Graph_Visitor, boost::graph_visitor_t, boost::no_property> (g=@0x81e70c8, s=0x81e6c10, params=@0xbff219ac) at /usr/include/boost/graph/breadth_first_search.hpp:226 #5 0x00d3b84a in boost::breadth_first_search<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, libreverse::visitor::Graph_Visitor, boost::graph_visitor_t, boost::no_property> (g=@0x81e70c8, s=0x81e6c10, params=@0xbff219ac) at /usr/include/boost/graph/breadth_first_search.hpp:255 #6 0x00d2fa8c in libreverse::api::Reverse_Impl::process_Graph (this=0xbff21aeb, graph_ptr=@0xbff21a30, val=@0xbff21a28) at Reverse_Impl.cpp:218 I checked the graph_ptr and it appears to be initialized correctly. At frame #0, the value of 'v' is 0x4. Is there a way to print out more information to figure out why I am getting a segfault? Am I asking my questions in the right place? I say that because I have posted quite a few messages recently with no one responding. Stephen

1 0

[smart_ptr | ptr_container] Customize deletions
by Ray Hilton 26 Mar '07

26 Mar '07

Is there anyway to get the destructors to use free or ptr->release() instead of delete ptr? Looking at the docs they don't seemed to take a deleter functor Thanks in advance! Ray Hilton _________________________________________________________________ Mortgage refinance is hot 1) Rates near 30-yr lows 2) Good credit get intro-rate 4.625%* https://www2.nextag.com/goto.jsp?product=100000035&url=%2fst.jsp&tm=y&searc…

2 2

[review] intrusive container comments
by Thorsten Ottosen 26 Mar '07

26 Mar '07

Hi Ion, Here are some comments I have from reading the online documentation. I haven't followed the review discussion (because I don't have the time), so I apologize if my comments have already been discussed. I was originally review manager for Olaf, and was almost ready to allow a review when he said he did not have time to finnish the library. From what I recall, the docs have been improved somewhat, so kudos for that work. 1. "Constant time size: The intrusive container holds a size member that it's updated with every insertion/erasure. This implies that the size() function has constant time complexity. On the other hand, increases the size of the container, and some operations, like splice() taking a range of iterators, have linear time complexity in linked lists." Howward Hinnant proposed a new splice() function that allows one to pass the size into splice() to keep splice() O(1). Would this not be an idea here? 2. My general view of the design: fairly complicated, though the extra speed can be worth the effort. I find the amount of typedef'ing fairly large and can't help feeling it could be simplified. 3. Is 'Foo' really needed twice: typedef boost::intrusive::ilist_base_hook<Foo>::value_traits<Foo> FooValueTraits; ??? 4. The cloning example (http://ice.prohosting.com/newfunk/boost/libs/intrusive/doc/html/intrusive/c…) I don't quite get; I thought the whole point of intrusive container was to avoid memory allotions. Also, how does this affect exception-safety? In general I feel this is an important library with many uses for performance savy applications. I feel the quality in general is high. I had one major discussion with Olaf which relates to the general easy-of-use and also to space-tradeoffs: ---------------------------------------- When it is a design-time decision to allow the object to be inserted into 1 container, one object always carry the node-structure overhead (that is also when I don't insert the object into an intrusive container). Furthermore, If some objects must be in more than one container, all objects of that type pay the space penalty even though only a few objects are in several containers. Third, the compile-time dependency is fairly complicated, and would be cool to get rid of. Therefore I think there are compelling reasons for exploring a different design: an extrusive design where the node-structure is not part of the object. This immediately eliminates three problems: -1- there is no compile-time dependency -2- there is by default no any space overhead -3- there is by default no problem or contstraint when an object is added to more containers at runtime The approach has one serious drawback: -1- it might require extra memory This happens when all live objects are added to an intrusive container. An example: consider an ilist of size N. The node structure requires two T* objects and so the space required is N * 2 * sizeof(T*) An extrusive approach would look a bit like this: template< class T > class extrusive_list { struct Node { T* prev; T* next; T* me; }; std::vector<Node> nodes; }; Thus the space required would be N * 3 * sizeof(T*) if all N objects are put into the container. If less than 2/3's of the live objects are put into the container, the extrusive version takes up less space. As you add support for several containers, the extrusive version is even more likely to save space IMO. Now, I haven't actually implemented extrusive containers as out-lined above, but the simplity of use and the potential space savings tells me that it would be well worth persue. Let me know what you all think. best regards Thortsen

3 7

help with cgal..
by suganya baskaran 26 Mar '07

26 Mar '07

hi everyone, i am trying to compile cgal library which has a pre-requisite "BOOST'.. i believe Boost is almost done. While compiling cgal using MS .net 8.0, i get errors, "/boost/static_assert.hpp" and "/boost/mlp/if.hpp" are not found. These files are in their proper location and I cant figure out what went wrong.. Help please --------------------------------- Bored stiff? Loosen up... Download and play hundreds of games for free on Yahoo! Games.

2 1

Re: [Boost-users] Question about ifstream ranges
by Pfligersdorffer, Christian 26 Mar '07

26 Mar '07

> How about an iostreams restriction? > http://boost.org/libs/iostreams/doc/functions/restrict.html > I'm using it to pull data out of a zip file and zlib_decompressor to > decompress it. :-) > Also, > http://www.teslacore.it/wiki/index.php?title=BoostPicks#Restriction > has some sample code. > Hope this helps! > Phillip Dear Phillip, this is exactly was I was looking for! Thank you very much!! -- DI Christian Pfligersdorffer Software Engineering EOS GmbH

1 0

[Regex] Debug Assert Failure boost::cmatch or std::copy
by News Group 25 Mar '07

25 Mar '07

All, I am trying to copy from a boost::cmatch variable to a std::set. It compiles fine but when I run it I get a: Debug Assertion Failure xtree 245 map/set iterator not dereferencable I think it's the "match.begin()" and "match.end()" in std::copy that is failing. This is a short version of what I have: #include <boost/regex.hpp> #include <algorithm> #include <string> #include <set> bool Parse( const std::string &page, std::set< std::string > &links ) { const boost::regex expression( "123" ); boost::cmatch match; if( boost::regex_search( page.c_str(), match, expression ) ) { std::copy( match.begin(), match.end(), links.begin() ); return true; } return false; } int main() { std::string test_data = "www.abc123.com/index.php"; std::set< std::string > links; Parse( test_data, links ); return EXIT_SUCCESS; } Thanks in advance. Carl.

3 2

Boost.Regex - Match whole word
by skywalker Luke 25 Mar '07

25 Mar '07

Hi All, I'm developing my own grep tool and I would like to specify an option to match a whole word. Which mean, if I'm looking for 'main' I don't want to match 'mainVariation' but things like 'main(int' or 'one,main,two'. The equivalent of what you will find in any decent search tool :). I look through regex documentation and didn't find anything about that. If it's not implemented, is it planned to be ? Or shall the Boost.Regex user handle this applying some pre-processing on the regular expression to perform such task ? Thank you. LS ----------------------------------------------------------- www.EmailAsso.net : solutions email pour les associations, email gratuit sans pub ni virus. www.lavacheautomatique.com : email gratuit @lavache.com, original et universel. www.MonEmail.com : l'email professionnel à 1Giga, avec agenda partagé et gestion des contacts. Votre bureau vous suit partout. 30 jours d'essai gratuit.

5 7

[program_option] using vector and config
by Aljaz 25 Mar '07

25 Mar '07

Hello. I want to parse option that has more values. For instance: options_description desc("Allowed options"); desc.add_options() ("include-path,I", value< vector<string> >(), "include path"); Now I want to parse configuration file which looks like: include-path = first/path include-path = second etc.. Can I have something like this instead: include-path = first/path,second,third,.. Is this possible with program_option or I have to use ugly-way configuration? Thanks for help Regards Aljaz

1 0

[BGL] Reading GraphML
by Jens Müller 25 Mar '07

25 Mar '07

I tried to read a GraphML file using Douglas' code and the following: std::auto_ptr<boost::dynamic_property_map> string2string_gen(const std::string& name, const boost::any&, const boost::any&) { typedef std::map<std::string,std::string> map_t; typedef boost::associative_property_map< std::map<std::string, std::string> > property_t; map_t* mymap = new map_t(); // hint: leaky memory here! property_t property_map(*mymap); std::auto_ptr<boost::dynamic_property_map> pm( new boost::detail::dynamic_property_map_adaptor<property_t>(property_map)); return pm; } int main(int argc, char* argv[]){ // create a typedef for the Graph type using namespace boost; typedef boost::adjacency_list<vecS, vecS, directedS> Graph; Graph g; std::ifstream input(argv[1]); boost::dynamic_properties properties(&string2string_gen); typedef graph_traits<Graph>::vertex_descriptor Node; typedef property_map<Graph, vertex_index_t>::type NodeID_Map; NodeID_Map node_id = get(vertex_index, g); boost::read_graphml(input, g, properties); } but when running it I get: Unrecognized attribute `xmlns' of element `graphml'. Ignoring... Unrecognized attribute `xmlns:y' of element `graphml'. Ignoring... Unrecognized attribute `xmlns:xsi' of element `graphml'. Ignoring... Unrecognized attribute `xsi:schemaLocation' of element `graphml'. Ignoring... Unrecognized attribute `yfiles.type' of element `key'. Ignoring... Unrecognized attribute `yfiles.type' of element `key'. Ignoring... Unrecognized element `y:ShapeNode' Unrecognized element `y:Geometry' Unrecognized element `y:Fill' Unrecognized element `y:BorderStyle' Unrecognized element `y:NodeLabel' Unrecognized element `y:Shape' terminate called after throwing an instance of 'boost::bad_any_cast' what(): boost::bad_any_cast: failed conversion using boost::any_cast /bin/sh: line 1: 31380 Abgebrochen ./src/graphml2 Core0bis10_1000.graphml The file contains nodes like this (what a bloat ...): <node id="n1"> <data key="d0" > <y:ShapeNode > <y:Geometry x="2.457598996954175" y="498.06375265283157" width="10.0" height="10.0"/> <y:Fill color="#FF0000" transparent="false"/> <y:BorderStyle type="line" width="1.0" color="#000000" /> <y:NodeLabel x="3.0" y="3.0" width="4.0" height="4.0" visible="true" alignment="center" fontFamily="Dialog" fontSize="12" fontStyle="plain" textC olor="#000000" hasBackgroundColor="false" hasLineColor="false" modelName="internal" modelPosition="c" autoSizePolicy="content"></y:NodeLabel> <y:Shape type="rectangle"/> </y:ShapeNode> </data> </node> I am not even really interested in the d0 properties ... What can I do?

5 19

Advice on how to make a custom graph visitor
by Stephen Torri 24 Mar '07

24 Mar '07

I have a graph that I am having difficulty making a graph visitor. I thought a breadth first visitor would do but there is a issue of order. I cannot guarantee what the order of visits to all the vertices will be on a graph. My graph that I am testing against is a directed graph of Component objects. Each Component requires input from the parent Component objects in the graph. For example, (Graph) C1 | ------------------ | | | | C20 C30 C40 | | | | | ------------------- | C5 (Table of inputs) C1 C20 C30 C40 C5 C1 C20 x C30 x C40 x C5 x x x x x I thought a breadth first search visitor would work. The behavior I was expecting was visits in the following order: C1, C20, C30, C40, Cc5. What I found was that I had C1, C40 and then C5. My program will abort at that point that c5 is visited since it is missing inputs from C20 and C30. When I take away calls to my code in the visitor and include just a simple "Hey I am at Component X" message I get the order I suspect. My graph is defined as: typedef property< vertex_index_t, uint32_t, property< vertex_name_t, boost::shared_ptr<Component> > > VertexProperty_t; typedef adjacency_list<setS, // OutEdgeList setS, // VertexList directedS, // Directed VertexProperty_t> // VertexProperties Graph_t; The visitor is defined as: class Graph_Visitor : public boost::default_bfs_visitor { public: // Constructor Graph_Visitor ( infrastructure::Component_Graph const& graph_ref, infrastructure::Graph_Base::Data_Map_t* dmap ); // Visitor functions template <class Vertex, class Graph> void discover_vertex(Vertex v, Graph const& g) { boost::shared_ptr<infrastructure::Component> src_obj_ptr = m_graph_ref.get_Component(v); std::cout << "Visiting node: " << src_obj_ptr->get_ID() << std::endl; .... verify inputs .... .... if all inputs present then do work .... } }; Is there a problem with my choice of design for the graph or how I am using the breadth first visitor? Stephen

1 0

How to check out boost-1_35?
by Piotr Kozaczewski 24 Mar '07

24 Mar '07

Dear Boost Users, I tried to check-out boost-1_35 using command line CVS on WinXP. Unfortunately, I did not manage to do his. I was simply not able to login to cvsroot/boost-1_35 as anonymous user. Screenshot of my session follows: D:\INSTALL\boost>cvs -d:pserver:anonymous@boost.cvs.sourceforge.net:/cvsroot/boo st-1_35 login Logging in to :pserver:anonymous@boost.cvs.sourceforge.net:2401:/cvsroot/boost-1 _35 CVS password: cvs [login aborted]: authorization failed: server boost.cvs.sourceforge.net reje cted access to /cvsroot/boost-1_35 for user anonymous What should I do?. Thank you very much in advance. Kind regards, Piotr Kozaczewski ________________________________________________________________________ This email is confidential, may also be privileged and is subject to the information set out at http://www.microgen.co.uk/email-disclaimer/en.html which forms part of this email.

2 1

[test] detect_memory_leak option in msvc 8
by Chris Weed 24 Mar '07

24 Mar '07

Hi, I am trying to get the --detect_memory_leak=1 option to detect a memory leak in my code. Here is my file: #include <boost/test/unit_test.hpp> using namespace boost::unit_test; void memory_leak() { int* p = new int(1); // delete p; } test_suite* init_unit_test_suite(int argc, char* argv[]) { test_suite* test = BOOST_TEST_SUITE("memory leak test"); test->add(BOOST_TEST_CASE(&memory_leak)); return test; } Here is my Jamroot: import testing ; lib_sources = /site-config//boost_unit_test_framework /site-config//uuid ; alias regression : [ run test1.cpp $(lib_sources) : --build_info=yes --detect_memory_leak=yes --output_format=XML --log_level=all --report_level=all --catch_system_error=yes --result_code=no --report_level=detailed : : : test1 ] ; This doesn't seem to give me any indication of a memory leak. Chris

1 0

Re: [Boost-users] Serialization: Serialize into multiple archives
by Robert Ramey 23 Mar '07

23 Mar '07

"Stefan Holzmann" <Stefan.Holzmann(a)gmx.net> wrote in message news:34183.4475555972$1174634703@news.gmane.org... Hello, I'am new to the boost serialize libary and have the following question. At my data acquisition application I have a workspace object which contain several recorded data objects (measurements) which should be stored into separate archives. **** The first idea that occurs to me would be to use the iostreams library to create a fancier stream which transform any write into two separate ones. Since the serialization library relies on streams, this would create multiple archives from one serialization. The workspace objects needs to store references (weak pointers) on objects inside the measurement archives (e.g. references from views which should be serialized). **** which it can do. The will automatically serialize the references being pointed to. It should be possible to have the same measurement archive references from more than one workspace object. **** If the archives are reloaded- you'll get new instances of the referenced views. Probably not what you want. Is this possible with the boost serialization libary? *** You might be able to get what you want. But this would require a deeper understanding of the library than is usually necessary. Righ now I don't know how the object tracking is working in detail, is there a more detailed documentation on this? *** read the docs and the code. Robert Ramey Stefan ------------------------------------------------------------------------------ _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

question about binding a boost::reference_wrapper argument inside a templated function
by Barchenkov, Alexei (IT) 23 Mar '07

23 Mar '07

I am getting an error when compiling the following code on gcc32. Could someone please point out what is the problem? Thank you. class Test { }; template <class T> void foo(T arg_) { } template <class T> void fooRef(const T& arg_){ } int main(int) { Test t; boost::reference_wrapper<Test> tr(t); boost::function<void()> fun1 = boost::bind(&::foo<boost::reference_wrapper<Test> >, tr); // line 41 boost::function<void()> fun2 = boost::bind(&::fooRef<boost::reference_wrapper<Test> >, tr); // line 42 } .... /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind.hpp: In member function `void boost::_bi::list1<A1>::operator()(boost::_bi::type<void>, F&, A&, int) [with F = void (*)(boost::reference_wrapper<Test>), A = boost::_bi::list0, A1 = boost::reference_wrapper<Test>]': /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind/bind_template.h pp:20: instantiated from `boost::_bi::result_traits<R, F>::type boost::_bi::bind_t<R, F, L>::operator()() [with R = void, F = void (*)(boost::reference_wrapper<Test>), L = boost::_bi::list1<boost::reference_wrapper<Test> >]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:136: instantiated from `static void boost::detail::function::void_function_obj_invoker0<FunctionObj, R>::invoke(boost::detail::function::any_pointer) [with FunctionObj = boost::_bi::bind_t<void, void (*)(boost::reference_wrapper<Test>), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:479: instantiated from `void boost::function0<R, Allocator>::assign_to(FunctionObj, boost::detail::function::function_obj_tag) [with FunctionObj = boost::_bi::bind_t<void, void (*)(boost::reference_wrapper<Test>), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:430: instantiated from `void boost::function0<R, Allocator>::assign_to(Functor) [with Functor = boost::_bi::bind_t<void, void (*)(boost::reference_wrapper<Test>), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:294: instantiated from `boost::function0<R, Allocator>::function0(Functor, boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functo r>::value>::value, int>::type) [with Functor = boost::_bi::bind_t<void, void (*)(boost::reference_wrapper<Test>), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:638: instantiated from `boost::function<R ()(), Allocator>::function(Functor, boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functo r>::value>::value, int>::type) [with Functor = boost::_bi::bind_t<void, void (*)(boost::reference_wrapper<Test>), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' test10.C:41: instantiated from here /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind.hpp:229: conversion from `Test' to non-scalar type `boost::reference_wrapper<Test>' requested /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind.hpp: In member function `void boost::_bi::list1<A1>::operator()(boost::_bi::type<void>, F&, A&, int) [with F = void (*)(const boost::reference_wrapper<Test>&), A = boost::_bi::list0, A1 = boost::reference_wrapper<Test>]': /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind/bind_template.h pp:20: instantiated from `boost::_bi::result_traits<R, F>::type boost::_bi::bind_t<R, F, L>::operator()() [with R = void, F = void (*)(const boost::reference_wrapper<Test>&), L = boost::_bi::list1<boost::reference_wrapper<Test> >]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:136: instantiated from `static void boost::detail::function::void_function_obj_invoker0<FunctionObj, R>::invoke(boost::detail::function::any_pointer) [with FunctionObj = boost::_bi::bind_t<void, void (*)(const boost::reference_wrapper<Test>&), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:479: instantiated from `void boost::function0<R, Allocator>::assign_to(FunctionObj, boost::detail::function::function_obj_tag) [with FunctionObj = boost::_bi::bind_t<void, void (*)(const boost::reference_wrapper<Test>&), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:430: instantiated from `void boost::function0<R, Allocator>::assign_to(Functor) [with Functor = boost::_bi::bind_t<void, void (*)(const boost::reference_wrapper<Test>&), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:294: instantiated from `boost::function0<R, Allocator>::function0(Functor, boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functo r>::value>::value, int>::type) [with Functor = boost::_bi::bind_t<void, void (*)(const boost::reference_wrapper<Test>&), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:638: instantiated from `boost::function<R ()(), Allocator>::function(Functor, boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functo r>::value>::value, int>::type) [with Functor = boost::_bi::bind_t<void, void (*)(const boost::reference_wrapper<Test>&), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' test10.C:42: instantiated from here /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind.hpp:229: could not convert `(+a)->boost::_bi::list0::operator[](const boost::reference_wrapper<T>&) const [with T = Test](this)' to `const boost::reference_wrapper<Test>&' -------------------------------------------------------- NOTICE: If received in error, please destroy and notify sender. Sender does not intend to waive confidentiality or privilege. Use of this email is prohibited when received in error.

1 0

[bind] bind and static tables
by Christian Henning 23 Mar '07

23 Mar '07

Hi there, for whatever reason the following code doesn't compile: #include <string> #include <algorithm> #include <functional> #include <vector> #include <boost/any.hpp> #include <boost/bind.hpp> using namespace std; using namespace boost; struct A {}; struct B {}; struct field { const any a; const string s; }; static field table[] = { { any( A() ), "Hello" }, { any( B() ), "Moin" } }; template<class T> const T& get( field* p ) { return p->s; } int _tmain(int argc, _TCHAR* argv[]) { string s( "Hello" ); size_t size = sizeof(table) / sizeof(field); field* p = find_if( &table[0], &table[0] + size, boost::bind( equal_to<string>() , bind( get<string>, _1 ) , s )); } The problem is that bind doesn't like it when _1 is a pointer. I believe. So, what is wrong? On some other threads I could see that slightly different example worked. Thanks ahead, Christian

1 0

Interprocess: fixed_managed_shared_memory bug
by Sunil Chomal 23 Mar '07

23 Mar '07

Dear All, As suggested in an earlier post, for using the interprocess allocator with STL container, one has to use the fixed_managed_shared_memory. To be able to do so, we have to specify an address at which the shared memory region is mapped. This address is passed as the last argument to the fixed_managed_shared_memory constructor, and after this the following is the sequence of calls: 1) fixed_managed_shared_memory(,,,,addr) 2) basic_managed_shared_memory(,,,,addr) 3) managed_open_or_create_impl(,,,,addr,,) 4) priv_open_or_create(,,,,addr,) In priv_open_or_create() one creates the mapped_region which in turn calls mmap() to map the shared memory to the addr specified by us. However the mapped_region object that is created here is as follows: mapped_region region(dev, read_write); here the address is not passed to the to the mapped_region constructor, which has default arguments for addr which is '0'. Hence, the fixed_managed_shared_memory is never allocated at the addr specified. Can someone help with this? A work around that I have done is to create the mapped_region as follows: mapped_region region(dev, read_write, 0, 0, addr); Regards, Sunil Chomal

2 1

Re: [Boost-users] [boost::bimap] compilation problems of the reviewversion(VC 8.0)
by Ovanes Markarian 23 Mar '07

23 Mar '07

On Fri, March 23, 2007 16:14, Joaquín Mª López Muñoz wrote: [...] > > http://lists.boost.org/Archives/boost/2007/02/116985.php > > to see if it helps. > > Joaquín M López Muñoz > Telefónica, Investigación y Desarrollo > Thanks for your help. That worked fine! I have one more question or suggestion. In the sample is used the following construct: my_map<tag_name>(bimap_instance).find(key_type_inst); my_map<tag_name>(bimap_instance)[key_type_inst] = value_type_inst; As I can see I can apply not only find but any other function supported by the interface. my_map is a function which returns me an object that supports the find or operator[] functions. To be honest, I don't like the idea of typing these long constructs. Why is there no design for such a construct: my_map<tag_name, bimap> tagged_bimap(bimap_instance); Then I can use the tagged_bimap as: tagged_bimap.find(key_type_inst); tagged_bimap[key_type_inst] = value_type_inst; With Kind Regards, Ovanes Markarian With Kind Regards, Ovanes Markarian

1 0

[any] Using any in static string table.
by Christian Henning 23 Mar '07

23 Mar '07

Hi there, is the following code possible? #include <string> #include <boost/any.hpp> using namespace std; using namespace boost; struct A {}; struct B {}; struct string_table { const any a; const string s; }; static string_table table[] = { { any( A ), "Hello" }, { any( B ), "Moin" } }; How would you implement such functionality? Thanks ahead, Christian

1 1

[boost::bimap] compilation problems of the review version (VC 8.0)
by Ovanes Markarian 23 Mar '07

23 Mar '07

Hello all, Currently I have an opportunity to use boost::bimap in my project. I was really intrigued by the docs and features the library offers, so I used the review version from the vault. The translator example is that what I need in my project, but unfortunately I can not compile it. Possibly because I use the CVS head revision which might be broken. The errors I get are following: error C2661: 'boost::bimap::container_adaptor::sequence_container_adaptor<Base,Iterator,ConstIterator,ReverseIterator,ConstReverseIterator,IteratorToBaseConverter,IteratorFromBaseConverter,ReverseIteratorFromBaseConverter,ValueToBaseConverter,ValueFromBaseConverter,FunctorsFromDerivedClasses>::insert' : no overloaded function takes 1 arguments with [ Base=boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1,boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>,boost::bimap::detail::bimap_core<boost::bimap::tags::tagged<boost::bimap::unordered_set_of<std::string>,spanish>,boost::bimap::tags::tagged<boost::bimap::unordered_set_of<std::string>,english>,boost::bimap::list_of_relation,boost::mpl::na,boost::mpl::na>::core_indices,std::allocator<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>,boost::mpl::vector1<boost::bimap::detail::independent_index_tag>>, Iterator=boost::bimap::detail::set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>, ConstIterator=boost::bimap::detail::const_set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>, ReverseIterator=boost::bimap::detail::const_set_view_iterator<boost::reverse_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, ConstReverseIterator=boost::bimap::detail::const_set_view_iterator<boost::reverse_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, IteratorToBaseConverter=boost::bimap::container_adaptor::support::iterator_facade_to_base<boost::bimap::detail::set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>,boost::bimap::detail::const_set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, IteratorFromBaseConverter=boost::mpl::na, ReverseIteratorFromBaseConverter=boost::mpl::na, ValueToBaseConverter=boost::mpl::na, ValueFromBaseConverter=boost::bimap::relation::support::get_above_view_functor<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>, FunctorsFromDerivedClasses=boost::mpl::vector<boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na> ] main.cpp(66) : error C2661: 'boost::bimap::container_adaptor::sequence_container_adaptor<Base,Iterator,ConstIterator,ReverseIterator,ConstReverseIterator,IteratorToBaseConverter,IteratorFromBaseConverter,ReverseIteratorFromBaseConverter,ValueToBaseConverter,ValueFromBaseConverter,FunctorsFromDerivedClasses>::insert' : no overloaded function takes 1 arguments with [ Base=boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1,boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>,boost::bimap::detail::bimap_core<boost::bimap::tags::tagged<boost::bimap::unordered_set_of<std::string>,spanish>,boost::bimap::tags::tagged<boost::bimap::unordered_set_of<std::string>,english>,boost::bimap::list_of_relation,boost::mpl::na,boost::mpl::na>::core_indices,std::allocator<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>,boost::mpl::vector1<boost::bimap::detail::independent_index_tag>>, Iterator=boost::bimap::detail::set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>, ConstIterator=boost::bimap::detail::const_set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>, ReverseIterator=boost::bimap::detail::const_set_view_iterator<boost::reverse_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, ConstReverseIterator=boost::bimap::detail::const_set_view_iterator<boost::reverse_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, IteratorToBaseConverter=boost::bimap::container_adaptor::support::iterator_facade_to_base<boost::bimap::detail::set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>,boost::bimap::detail::const_set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, IteratorFromBaseConverter=boost::mpl::na, ReverseIteratorFromBaseConverter=boost::mpl::na, ValueToBaseConverter=boost::mpl::na, ValueFromBaseConverter=boost::bimap::relation::support::get_above_view_functor<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>, FunctorsFromDerivedClasses=boost::mpl::vector<boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na> ] main.cpp(67) : error C2661: 'boost::bimap::container_adaptor::sequence_container_adaptor<Base,Iterator,ConstIterator,ReverseIterator,ConstReverseIterator,IteratorToBaseConverter,IteratorFromBaseConverter,ReverseIteratorFromBaseConverter,ValueToBaseConverter,ValueFromBaseConverter,FunctorsFromDerivedClasses>::insert' : no overloaded function takes 1 arguments with [ Base=boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1,boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>,boost::bimap::detail::bimap_core<boost::bimap::tags::tagged<boost::bimap::unordered_set_of<std::string>,spanish>,boost::bimap::tags::tagged<boost::bimap::unordered_set_of<std::string>,english>,boost::bimap::list_of_relation,boost::mpl::na,boost::mpl::na>::core_indices,std::allocator<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>,boost::mpl::vector1<boost::bimap::detail::independent_index_tag>>, Iterator=boost::bimap::detail::set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>, ConstIterator=boost::bimap::detail::const_set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>, ReverseIterator=boost::bimap::detail::const_set_view_iterator<boost::reverse_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, ConstReverseIterator=boost::bimap::detail::const_set_view_iterator<boost::reverse_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, IteratorToBaseConverter=boost::bimap::container_adaptor::support::iterator_facade_to_base<boost::bimap::detail::set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>,boost::bimap::detail::const_set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, IteratorFromBaseConverter=boost::mpl::na, ReverseIteratorFromBaseConverter=boost::mpl::na, ValueToBaseConverter=boost::mpl::na, ValueFromBaseConverter=boost::bimap::relation::support::get_above_view_functor<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>, FunctorsFromDerivedClasses=boost::mpl::vector<boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na> ] main.cpp(68) : error C2661: 'boost::bimap::container_adaptor::sequence_container_adaptor<Base,Iterator,ConstIterator,ReverseIterator,ConstReverseIterator,IteratorToBaseConverter,IteratorFromBaseConverter,ReverseIteratorFromBaseConverter,ValueToBaseConverter,ValueFromBaseConverter,FunctorsFromDerivedClasses>::insert' : no overloaded function takes 1 arguments with [ Base=boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1,boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>,boost::bimap::detail::bimap_core<boost::bimap::tags::tagged<boost::bimap::unordered_set_of<std::string>,spanish>,boost::bimap::tags::tagged<boost::bimap::unordered_set_of<std::string>,english>,boost::bimap::list_of_relation,boost::mpl::na,boost::mpl::na>::core_indices,std::allocator<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>,boost::mpl::vector1<boost::bimap::detail::independent_index_tag>>, Iterator=boost::bimap::detail::set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>, ConstIterator=boost::bimap::detail::const_set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>, ReverseIterator=boost::bimap::detail::const_set_view_iterator<boost::reverse_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, ConstReverseIterator=boost::bimap::detail::const_set_view_iterator<boost::reverse_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, IteratorToBaseConverter=boost::bimap::container_adaptor::support::iterator_facade_to_base<boost::bimap::detail::set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>,boost::bimap::detail::const_set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::sequenced_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>>>>>>>, IteratorFromBaseConverter=boost::mpl::na, ReverseIteratorFromBaseConverter=boost::mpl::na, ValueToBaseConverter=boost::mpl::na, ValueFromBaseConverter=boost::bimap::relation::support::get_above_view_functor<boost::bimap::relation::mutant_relation<boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,spanish>,boost::bimap::tags::tagged<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>,english>,true>>, FunctorsFromDerivedClasses=boost::mpl::vector<boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na> ] Build log was saved at "file://e:\projects\testing_project\Debug\BuildLog.htm" testing_project - 4 error(s), 0 warning(s) There is also some error in the docs for Mighty Bimap: (http://cablemodem.fibertel.com.ar/mcape/boost/libs/bimap/boost_bimap/exampl…) .... typedef translator_bimap::relation translation; translator_bimap translator; .... iterator_type_by<spanish,translator_bimap>::type is = map_by<spanish>(d).find(word); ^^^error I think d should be 'translator' With Kind Regards, Ovanes

2 1

Serialization: Serialize into multiple archives
by Stefan Holzmann 23 Mar '07

23 Mar '07

Hello, I'am new to the boost serialize libary and have the following question. At my data acquisition application I have a workspace object which contain several recorded data objects (measurements) which should be stored into separate archives. The workspace objects needs to store references (weak pointers) on objects inside the measurement archives (e.g. references from views which should be serialized). It should be possible to have the same measurement archive references from more than one workspace object. Is this possible with the boost serialization libary? Righ now I don't know how the object tracking is working in detail, is there a more detailed documentation on this? Stefan

1 0

Re: [Boost-users] Question about ifstream ranges
by Pfligersdorffer, Christian 23 Mar '07

23 Mar '07

boost-users-bounces(a)lists.boost.org wrote: > Pfligersdorffer, Christian wrote: >> Hello all! >> >> I face the problem of partitioning a file that i read with > ifstream into portions that are to be processed by some > clients. I want to ensure that a client only views a specific > part (window, range) of the stream. So far I store 2 > streamoffsets posStart and posEnd, call seekg on the stream, > pass it to the client by ref and rely on the client to check > when it reached posEnd. >> >> However, I certainly cannot copy the whole range into a new > stream object and pass that one. Efficiency does matter. >> >> Any suggestions? Maybe some iterator-magic can be done? > > How about Boost.Spirit file_iterator? > That is a read-only RandomAccessIterator for files. > http://spirit.sourceforge.net/distrib/spirit_1_8_3/libs/spirit > /doc/file_iterator.html Hello Shunsuke, that's a good idea but unfortunately I cannot use this class in my case. I have some special decoding ifstreams doing decompression and the like. So I'd really need an iterator that takes an i(f)stream object in it's constructor and wraps that. Thanks anyway! -- Christian Pfligersdorffer Dipl.-Ing. Bakk.rer.nat. Software Engineering EOS GmbH - Electro Optical Systems Robert-Stirling-Ring 1 D-82152 Krailling / Munich Phone +49 89 893 36-229 Fax +49 89 893 36-287 christian.pfligersdorffer(a)eos.info http://www.eos.info

4 3

[asio] any protocol libs built on top?
by Sohail Somani 23 Mar '07

23 Mar '07

Hi, Have there been any implementations of some common protocols using asio? I know its still early days, but just wondering. Thanks, Sohail

2 2

[asio] Compilation requirements
by Sohail Somani 23 Mar '07

23 Mar '07

Hi, Is asio is a header-only library? If so, what are the requirements for compilation? If you are using Visual C++ with /Za (language extensions disabled), that will cause problems if you include windows.h. TIA, Sohail

4 7

[shared_ptr] why segfault?
by Xu, Peng 23 Mar '07

23 Mar '07

greetings, my test code is as follows: " int k = 128; std::vector<boost::shared_ptr<int> > v(k); for(unsigned int i = 0; i < k; ++i) { v[i].reset(&k); // v[i].reset(new int(0)); } int t = rand() % k + 1; std::cout << "element " << t << " points to integer value " << *(v[t].get()) << std::endl; } " It's intended to use shared_ptr in an atypical way(the normal one was commented out). The output is: " element 68 points to integer value 128 Segmentation fault " Attached debugger and got this stack: " Program received signal SIGSEGV, Segmentation fault. 0x0000002a95c16ed0 in _int_free () from /lib64/tls/libc.so.6 (gdb) bt #0 0x0000002a95c16ed0 in _int_free () from /lib64/tls/libc.so.6 #1 0x0000002a95c17317 in free () from /lib64/tls/libc.so.6 #2 0x0000002a95862cee in operator delete () from /usr/lib64/libstdc++.so.5 #3 0x0000000000403ac7 in boost::checked_delete<int> (x=0x7fbfffe9c8) at checked_delete.hpp:34 #4 0x00000000004035b4 in boost::detail::sp_counted_impl_p<int>::dispose (this=0x509060) at sp_counted_impl.hpp:78 #5 0x0000000000402cf8 in boost::detail::sp_counted_base::release (this=0x509060) at sp_counted_base_gcc_x86.hpp:146 #6 0x0000000000402dee in _ZN5boost6detail12shared_countD9Ev (this=0x508058) at shared_count.hpp:199 #7 0x0000000000402e0d in boost::detail::shared_count::~shared_count (this=0x508058) at shared_count.hpp:65536 #8 0x0000000000402831 in destr_detour25 () at shared_ptr.hpp:65536 #9 0x0000000000402855 in boost::shared_ptr<int>::~shared_ptr (this=0x508050) at sp_counted_base_gcc_x86.hpp:110 #10 0x0000000000403822 in std::_Destroy<boost::shared_ptr<int> > (__pointer=0x508050) at stl_construct.h:125 #11 0x00000000004037f6 in std::__destroy_aux<boost::shared_ptr<int>*> (__first=0x508050, __last=0x509050) at stl_construct.h:101 #12 0x00000000004037c7 in std::_Destroy<boost::shared_ptr<int>*> (__first=0x508050, __last=0x509050) at stl_construct.h:143 #13 0x0000000000401d3f in _ZNSt6vectorIN5boost10shared_ptrIiEESaIS2_EED9Ev (this=0x7fbfffe900) at stl_vector.h:297 #14 0x0000000000401da1 in std::vector<boost::shared_ptr<int>, std::allocator<boost::shared_ptr<int> > >::~vector (this=0x7fbfffe900) at stl_vector.h:65536 #15 0x000000000040160a in destr_detour44 () at shared_ptr.cpp:42 #16 0x0000002a95bcaacd in __libc_start_main () from /lib64/tls/libc.so.6 #17 0x000000000040108a in _start () at start.S:96 " I expected some problems with the code, but the segfault surprised me. Can anybody tell me why? Thanks a lot,

5 7

[mpl][fusion] Metafunction for extracting a type from a map
by Christian Henning 23 Mar '07

23 Mar '07

Hi there, next metaprogramming problem. Is it possible to extract a tagged type from a map? namespace fields { struct _id_; struct _name_; struct _birthday_; struct _address_id_; } namespace tags { struct _primary_key_; struct _foreign_key_; struct _value_; } typedef fusion::map< fusion::vector< fields::_id_ , std::string, tags::_primary_key_ > , fusion::vector< fields::_name_ , std::string, tags::_value_ > , fusion::vector< fields::_birthday_ , std::string, tags::_value_ > , fusion::vector< fields::_address_id_, std::string, tags::_foreign_key_ > > table_type; int main() { /// how to get the primary key type vector } I was looking at fusion's filter_view but that is only available for non-metaprogramming. Any ideas? Christian

3 10

bind doesn't use tuple
by Gottlob Frege 22 Mar '07

22 Mar '07

why doesn't bind use tuple (internally)? I'm tempted to leave the email as just that. No more to say. OK, maybe one thing - I'm not asking because I necessarily think it should, I can imagine there are reasons, just wondering what they might be. Thanks Tony

4 5

Using Variant with StateChart events
by Federico J. Fernández 22 Mar '07

22 Mar '07

Hi Boosters! I have been trying to use those libraries together. To be concrete, I want to have a variant of boost::statechart::event derived classes. The problem is that when I try to compile it I receive a lot of error messages, but the important ones say that there is no match for "operator new".. I mean, variant is calling a prototype of operator new that event doesn't offer. This is the error that I get: /usr/include/boost/variant/variant.hpp: In constructor 'boost::variant<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19>::variant() [with T0_ [...] /usr/include/boost/variant/variant.hpp:1174: error: no matching function for call to 'evt_reset::operator new(unsigned int, void*)' /usr/include/boost/statechart/event.hpp:38: note: candidates are: static void* boost::statechart::event<MostDerived, Allocator>::operator new(size_t) [with MostDerived = evt_reset, Allocator = std::allocator<void>] Any idea? I want to have a container of this "events" and don't want to have a base class and working with virtual functions. Thanks!

2 1

Statechart current status
by Philippe DAVID 22 Mar '07

22 Mar '07

Hi, I'm interested in using the statechart library and I would like to know what its current status is. It looks like it is inactive since dec 2005, am I right ? Has the project been freezed ? Btw, why is statechart not included with the other boost libs ? Thanks, Philippe

2 1

[Serialization, XML] - how to avoid another encoding level
by Frank Bergemann 22 Mar '07

22 Mar '07

Hi, i am working with MICO and use boost::serialization (XML) for import/export of CORBA functions IN/OUT parameters, because i have an XML formatted configuration for the data to use for CORBA service invocations. One of the problems was, that some of the MICO are template'd. E.g. a data type holding a number of digits (e.g. telephone #no) is encoded in MICO as: template <class T, int TID, int max> class BoundedSequenceTmpl { ... } ... using basic <class T> = CORBA::Short for digits (e.g.). 1st i used ToString(...)/fromString(...) functions to be able to save&load such to/from boost archives. And this worked - though it had the little drawback, that i needed to use additional variables in load() & save() to handle it this way. But then next it came up, that some other CORBA data types use the BoundedSequenceTempl<> as well, but for _more complex_ <class T> - e.g. BoundedSequenceTempl<> of BoundedSequenceTempl<>. For that i created a version of serialize(), save() & load() like this: template<class Archive, class T, int TID, int max> void serialize(Archive & ar, BoundedSequenceTmpl<T, TID, max> &p, const unsigned int version) { split_free(ar, p, version); } template<class Archive,class T, int TID, int max> void save(Archive & ar, const BoundedSequenceTmpl<T, TID, max> &p, const unsigned int version) { unsigned long length = p.length(); ar & make_nvp("length", length); for (unsigned long i = 0; i < length; ++i) { std::ostringstream name; name << "item_" << i; ar & make_nvp(name.str(), p[i]); } } template<class Archive, class T, int TID, int max> void load(Archive & ar, BoundedSequenceTmpl<T, TID, max> &p, const unsigned int version) { unsigned long length; ar & make_nvp("length", length); p.length(length); for (unsigned long i = 0; i < length; ++i) { std::ostringstream name; name << "item_" << i; ar & make_nvp(name.str(), p[i]); } } then i thought i can get rid of the formerly used ToString(...)/FromString(...) helpers and replace them by overloaded versions of the new (more generic) load() & save() variants dedicated for this BoundedSequenceTempl<...>. Like this: #if 0 // This was intended to make obsolete MicoVector_to_string(...) & // MicoVector_from_string(...) // kind of "template specialization" for the ones above // for BoundedSequenceTmpl<...> of types, which we don't want // to be spread out any further // // But i couldn't make this work. // Means: it compiles. But it implies another XML encoding level // - which is not what i want template<class Archive, int TID, int max> void serialize(Archive & ar, BoundedSequenceTmpl<CORBA::Short, TID, max> &p, const unsigned int version) { split_free(ar, p, version); } template<class Archive, int TID, int max> void save (Archive & ar, const BoundedSequenceTmpl<CORBA::Short, TID, max> &p, const unsigned int version) { std::ostringstream ostream; for (unsigned long i=0; i<p.length(); ++i) { ostream << p[i]; } // tried this, but it didn't work (compilation failed): ar & str; // so i tested this option std::string str(ostream.str()); ar & make_nvp("hallo", str); // CREATES ANOTHER ENCODING LEVEL :-( } template<class Archive, int TID, int max> void load (Archive & ar, BoundedSequenceTmpl<CORBA::Short, TID, max> &p, const unsigned int version) { ... } #endif But that created me another level of encoding - which i don't want. E.g. having a superior encoder: template<class Archive> void save(Archive & ar, const DeleteHlrSubscriber_s &pInstance, const unsigned int version) { std::string simsi; std::string smsisdn; MicoVector_to_string(pInstance.imsi, simsi); MicoVector_to_string(pInstance.msisdn, smsisdn); // ar & make_nvp("imsi", simsi); // replace by the next... // this worked, but see above (the by "#if 0" disabled stuff) ar & make_nvp("imsi", pInstance.imsi); ar & make_nvp("msisdn", smsisdn); ar & make_nvp( "attach_imsi", pInstance.attach_imsi); } using pInstance.imsi directly (which is a BoundedSequenceTmpl<CORBA::Short>()) resulted in: <imsi> // dropped boost::serializations internal XML attributes here <hallo>SomeString</hallo> </imsi> But I would like to have this one <imsi>SomeString</imsi> How can i do that? Thanks! Best regards! Frank _______________________________________________________________ SMS schreiben mit WEB.DE FreeMail - einfach, schnell und kostenguenstig. Jetzt gleich testen! http://f.web.de/?mc=021192

2 3

[multi_index] function object as key extractor?
by Boris 22 Mar '07

22 Mar '07

As I find myself replacing all kind of C++ standard containers with multi_index_container (a really very useful container) I've been defining key extractors quite a lot and wonder if there is any shortcut like using lambda expressions or function objects. Here's some pseudo-code to explain what I mean: struct foo { std::string s; foo(std::string s) : s(s) { } }; typedef multi_index_container< foo, indexed_by< hashed_unique< boost::bind<std::size_t, &std::string::size, member<foo, std::string, &foo::s> > > > > mi_t; The idea is to call another function on the object which is returned by the key extractor member. Here in this example the multi_index_container would only store strings with a unique size. However I'm lost how to define the key extractor. The difficulty is probably that I normally don't need to specify types when I use boost::bind or lambda expressions. Now I need to figure out how to use them with multi_index_container - is there any trick or I better go on defining key extractors? Boris

6 21

Review of Intrusive library begins today March 12
by Joaquín Mª López Muñoz 22 Mar '07

22 Mar '07

The review of Ion Gaztañagas's Intrusive library begins today, March 12, and extends up to March 21. * Download: Boost vault: http://boost-consulting.com/vault/ Folder: Containers File: intrusive.2007-03-04.zip * Online docs: http://ice.prohosting.com/newfunk/boost/libs/intrusive * Description: Intrusive is a library presenting some intrusive containers to the world of C++. While intrusive containers were and are widely used in C, they became more and more forgotten in C++ due to the presence of the standard containers, which don't support intrusive techniques. Intrusive not only reintroduces this technique to C++, but also encapsulates the implementation in STL-like interfaces. Hence anyone familiar with standard containers can easily use Intrusive. Like their STL-counterparts, intrusive containers use template parameters to control the stored data types and some special aspects of intrusive containers. * Compilers tested (so far): Visual 7.1/WinXP Visual 8.0/WinXP GCC 4.1.1/MinGW Intel 9.1/WinXP GCC 4.1.2/Linux * Review questions: Here are some questions you might want to answer in your review: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? And finally, every review should answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. I invite you to submit your review, either publicly to the developers or the users lists, or else, if for whatever reason you don't want to publicize it, directly to me. Thank you for investing some of your time on reviewing Ion Gaztañaga's Intrusive library. The Review Manager, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

4 4

End of Intrusive library review period
by Joaquín Mª López Muñoz 22 Mar '07

22 Mar '07

The official period for the formal review of Ion Gaztañagas's Intrusive has finished on March 21, although there is no problem with continuing the ongoing discussions or submiting past last minute reviews during a few days. I plan to compile the contributions and publish the final result by the end of the next week. Thank you to all the participants for the quality and quantity of their contributions. The Review Manager, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[BGL] dfs on graphs with bundled-properties
by Naomi Fox 22 Mar '07

22 Mar '07

I am trying to use an adjacency list with bundled properties and running into lots of problems. I'm wondering if bundled properties is mature enough, or if I should resort to the older style using property maps. Here's a description of one problem I've run into: So I define my graph class with bundled properties as so: struct MyV { int numStars; }; struct MyE { int numStars; }; typedef adjacency_list<setS, setS, bidirectionalS, MyV, MyE> MyGraph; I would like to perform dfs on this graph. So I have a very simple visitor defined: struct star_visitor : public boost::default_dfs_visitor { template <class Vertex, class Graph> void start_vertex(Vertex v, const Graph &) { std::cout << 'start'; } template <class Vertex, class Graph> void discover_vertex(Vertex v, const Graph &) { std::cout << "*"; } template <class Vertex, class Graph> void finish_vertex(Vertex v, const Graph &) { std::cout << 'finish'; } }; Then in my main function, I make a MyGraph object and put in vertices and edges, and assign property values. That works fine. MyGraph g; MyGraph::vertex_descriptor v1 = addVertex(g); MyGraph::vertex_descriptor v2 = addVertex(g); MyGraph::edge_descriptor e2 = addEdge(v1, v2, g); g[*v1].numStars = 100; g[*v2].numStars = 2; g[*e1].numStars = 7; Then I perform dfs on my graph depth_first_search(g, visitor(star_vis)); And I get the following errors. I don't get these errors and my program compiles fine if I do a dfs with my star_visitor on a graph with no properties. Main.cpp c:\boost_1_33_1\boost\property_map.hpp(349) : error C2679: binary '+' : no operator found which takes a right-hand operand of type 'const boost::detail::error_property_not_found' (or there is no acceptable conversion) c:\program files\microsoft visual studio 8\vc\include\vector(366): could be 'std::_Vector_iterator<_Ty,_Alloc> std::_Vector_iterator<_Ty,_Alloc>::operator +(__w64 int) const' with [ _Ty=boost::default_color_type, _Alloc=std::allocator ] while trying to match the argument list '(const std::_Vector_iterator<_Ty,_Alloc>, const boost::detail::error_property_not_found)' with [ _Ty=boost::default_color_type, _Alloc=std::allocator ] c:\boost_1_33_1\boost\property_map.hpp(349) : while compiling class template member function 'boost::default_color_type boost::iterator_property_map::operator [](void *) const' with [ RandomAccessIterator=std::_Vector_iterator>, IndexMap=boost::adj_list_vertex_property_map, T=boost::default_color_type, R=boost::default_color_type & ] c:\documents and settings\istreinu\desktop\naomi\boost_1_33_1\boost\graph\depth_first_search.hpp(250) : see reference to class template instantiation 'boost::iterator_property_map' being compiled with [ RandomAccessIterator=std::_Vector_iterator>, IndexMap=boost::adj_list_vertex_property_map, T=boost::default_color_type, R=boost::default_color_type & ] c:\documents and settings\istreinu\desktop\naomi\boost_1_33_1\boost\graph\depth_first_search.hpp(332) : see reference to function template instantiation 'void boost::detail::dfs_dispatch::apply(const VertexListGraph &,DFSVisitor,Vertex,const boost::bgl_named_params &,boost::detail::error_property_not_found)' being compiled with [ VertexListGraph=MyGraph, DFSVisitor=Star_visitor, Vertex=void *, T=Star_visitor, Tag=boost::graph_visitor_t, Base=boost::no_property ] c:\documents and settings\istreinu\my documents\visual studio 2005\projects\refactorfirst\refactorfirst\main.cpp(228) : see reference to function template instantiation 'void boost::depth_first_search(const VertexListGraph &,const boost::bgl_named_params &)' being compiled with [ VertexListGraph=MyGraph, T=Star_visitor, Tag=boost::graph_visitor_t, Base=boost::no_property ]

2 1

which one is preferable vector (or similar things) or valarray (or similar things ) ?
by abir basak 22 Mar '07

22 Mar '07

Hi, I am using vector and similar containers extensively for my project, as well as boost circular_buffer_space_optimized (and adobe circular_queue which is built over vector ). They all work with iterator based concept. As I need to refer a portion of the vector (or circular buffer ) from within a class , I need to store index (not iterators, as container elements are movable ) or a pair of index within the class (using std::distance to get index from iterator, all of my containers are random access ). now from index , I create boost sub_range and use it. For arbitrary access, I store a vector<size_t>, and use boost permutation_iterator with the index. One point here, iterator is not very cheap when it is circular_buffer (and space optimized version) , as it is not merely a pointer , and it need to know container (i.e. store a ref to container) or store 3 pointers, one current pos, one for begin of buffer, one end of buffer (AFAIK boost uses former version). But after that I came to a different concept , a concept of view, which is used by boost uBLAS containers Blitz array and the STL low profile container valarray. Now it seems slice_view , range_view are cheaper for circular buffer, as only one reference to container is stored (esp when using permutation_iterator or arbitrary sequence access). Also seems cross referencing from one valarray to another is easier due to slice concept which can be directly stored. and it also provides some numeric operations. In my case all of the arrays are one dimensional, and they are array of some small struct (like point, tangent etc) most of them have some geometric meaning. And mostly I want to have some numeric operations on them (my original test implementation is in matlab and the array in matlab is just like Blitz array with little more overhead) I am little confused at this stage, which one to use. and if I use valarray kind of thing , how to use stl algorithm's with it (i.e how to get a iterator from it ? valarray is continuous so getting iterator is not a problem, but not sure whether I can sort a slice) . Can anyone help in this regard? abir -- Abir Basak, Member IEEE Software Engineer, Read Ink Technologies B. Tech, IIT Kharagpur email: abir(a)abirbasak.com homepage: www.abirbasak.com

1 0

ptr_sequence and transfer functions.
by Matthew Bray 22 Mar '07

22 Mar '07

I have a problem with the current ptr_sequence interface, according to the documentation point #7 at this location: http://www.boost.org/libs/ptr_container/doc/examples.html#transferring-owne… it should be possible to write something such as this ptr_list<X> list; ptr_vector<X> vec; list.transfer( list.begin(), vec.begin(), vec ); vec.transfer( vec.end(), list.begin(), list.end(), list ); i.e. given a U<T> and a V<T> I should be able to perform transfer operations in either direction. However given a suitable X this code fails to compile on VC++ 8 as well as GCC 3.4. Indeed any attempt to transfer between different ptr_sequence types (e.g. ptr_deque<X> to ptr_vector<X>) fails to compile. Looking at the implementation of ptr_sequence it appears easy to see why this is the case. However my question is is the documentation incorrect or is the current code incorrect? Right now if I wish to create containers of objects and then transfer ownership to others I'm forced to use the same container type throughout (i.e. the transfer functions provide no benefit at all if I have to choose the wrong container for the job), either that or write awkward transferal code when it appears the simple transfer function should do the job. Could someone please explain the situation regarding the transfer functions and documentation at this time? Thanks, Mat.

2 4

[Date_Time] undefined reference to as_short_string()
by Artus 22 Mar '07

22 Mar '07

Hi, I am trying to use Boost.Date_Time (and Boost) for the first time, and I failed to compile the following : ------------------------------------ #include <iostream> #include <iomanip> #include <boost/date_time/gregorian/gregorian.hpp> #include <boost/date_time/posix_time/posix_time.hpp> int main(int, char **) { using namespace std; using namespace boost::posix_time; using namespace boost::gregorian; std::cout << to_simple_string(second_clock::universal_time()); return 0; } ----------------------------------------- I get these comments : g++ -c -pipe -Wall -W -O2 -g -pipe -m32 -march=i386 -mtune=pentium4 -DQT_NO_DEBUG -DQT_SHARED -DQT_THREAD_SUPPORT -I/usr/lib/qt-3.3/mkspecs/default -I. -I/usr/lib/qt-3.3/include -o receiver.o receiver.cpp g++ -o receiver.exe receiver.o -L/usr/lib/qt-3.3/lib -L/usr/X11R6/lib -lchoo -lqt-mt -lXext -lX11 -lm receiver.o(.text+0xb96): In function `main': /usr/include/boost/date_time/date_formatting.hpp:43: undefined reference to `boost::gregorian::greg_month::as_short_string() const' I found some threads about this error but no solution. Can any one help? I am using Boost 1.32.0. Cheers, Patrick

1 0

[multi_index] problem with hashed index
by Boris 21 Mar '07

21 Mar '07

I've been using Boost Multiindex quite a lot but don't understand why the code below inserts two items. The container has a unique hash index and the two items return the same hash value. Is this is a bug in the library or in my code? Boris -- struct foo { int i, j; foo(int i, int j) : i(i), j(j) { } }; std::size_t hash_value(const shared_ptr<foo> &f) { std::size_t seed = 0; boost::hash_combine(seed, f->i); boost::hash_combine(seed, f->j); return seed; } typedef multi_index_container< shared_ptr<foo>, indexed_by<hashed_unique<identity<shared_ptr<foo> > > > > mi_t; shared_ptr<foo> f1(new foo(0, 0)); shared_ptr<foo> f2(new foo(0, 0)); mi_t mi; cout << mi.insert(f1).second << endl; // Returns 1. cout << mi.insert(f2).second << endl; // Returns again 1?! cout << mi.size() << endl; // Returns 2?!

2 4

[fusion] Weird compiler error
by Christian Henning 21 Mar '07

21 Mar '07

Hi there, I know the subject looks suspicious. Usually all compiler errors are weird when you do metaprogramming. Anyway, this example is a bit different. I'm just trying to compile a small example taking from the documentation. #include <boost/fusion/sequence.hpp> using namespace std; using namespace boost; using namespace fusion; int _tmain(int argc, _TCHAR* argv[]) { typedef map<pair<int, char>, pair<char, char>, pair<double, char> > mymap; BOOST_MPL_ASSERT((boost::is_same<result_of::at_key<mymap, int>::type, char&>)); return 0; } The error is: c:\cybermdx\Test Programs\Boost\MPL\tagged types\tagged types.cpp(15) : error C2143: syntax error : missing '}' before '(' c:\cybermdx\Test Programs\Boost\MPL\tagged types\tagged types.cpp(15) : fatal error C1903: unable to recover from previous error(s); stopping compilation I have no clue where the compiler is missing a closing bracket. I'm using MSVC 7.1 Christian

3 8

polymorphic_downcast and references
by Michael Marcin 21 Mar '07

21 Mar '07

Unless I'm missing something it looks like polymorphic_downcast doesn't provide an overload for reference types... is there a reason? This makes it a little inconvenient for use. Thanks, Michael Marcin

2 3

[Test] BOOST_AUTO_TEST_CASE_EXPECTED_FAILURES => exceptions?
by Sohail Somani 21 Mar '07

21 Mar '07

Hi, Does Boost.Test consider an exception as a failure? How can I make it expect an exception? Or is there another way to do this? Thanks, Sohail

2 2

iostreams crash
by Aljaz 21 Mar '07

21 Mar '07

Hello I've been working with boost iostreams filters. Since when I changed fin.push(file_source("outest.fil", ios::in | ios::binary)); to: file_source fss("outest.fil", ios::in | ios::binary); fin.push(boost::ref(fss)); file crashes when the task is done. Why is that happening? What am I doing wrong? I think it has something to do with memory allocation.. Another thing im unsure about: Should I open file each time I want to read from it, or can I open it at program start, and leave it open (program will be running for a long period) ? I hope someone responds this time Thanks for help Best regards #include <boost/iostreams/device/file.hpp> #include <boost/iostreams/filtering_stream.hpp> #include <boost/iostreams/filter/line.hpp> #include <boost/ref.hpp> #include <exception> #include <fstream> #include <ostream> #include <iostream> #include <string> #include <vector> using namespace std; using namespace boost::iostreams; namespace io = boost::iostreams; class long_line_counter : public boost::iostreams::line_filter { public: explicit long_line_counter(int max_length = 80) : max_(max_length), count_(0) { } int count() const { return count_; } vector<string> mail_list; private: std::string do_filter(const std::string& line) { if (line.size() < max_) mail_list.push_back(line); ++count_; return line; } int max_; int count_; }; int main() { try { filtering_istream fin; long_line_counter llc(80); file_source fss("outest.fil", ios::in | ios::binary); fin.push(boost::ref(llc)); fin.push(boost::ref(fss)); char buf[4012]; while ( fin.read(buf, 4012) ) { } std::cout << llc.count() << "\n"; std::cout << llc.mail_list.size() << "\n"; } catch (exception &e) { cout << "exception: " << e.what() << std::endl; } return 0; }

1 0

[BGL] Problems implementing a special DFS algorithm
by Ignaz Rutter 21 Mar '07

21 Mar '07

Hi, I'm currently trying to implement an algorithm that basically is a DFS. The description looks roughly like this: Start a DFS, when going down an edge (e.g. put it into the tree): do something when backtracking an edge (e.g. move upwards in the search tree): do something else I tried to implement this using the DFS Visitor concept. However it seems like the appropriate events are not defined in this concept. Am I missing something here? Is it possible to reuse depth_first_search here? Or should I just I go ahead and implement my own DFS? Thanks, Ignaz

1 1

tutorial or book on boost
by Vaclav 21 Mar '07

21 Mar '07

Hello, Can you please recommend a good tutorial or book on boost library for beginners? Thanks Vaclav

4 5

Uninitialised value issue with serialization of std::vector<double>
by Jonathan Cooper 21 Mar '07

21 Mar '07

Hi. In using valgrind to run memory tests of our software, we've been getting 'Conditional jump or move depends on uninitialised value(s)' errors which appear to be caused by Boost's serialization library. Specifically, they occur on loading a std::vector<double> from a text archive. A simple test program which demonstrates this behaviour is shown below, together with a snippet from valgrind's output. Incidentally, deserializing std::vector<bool> does not have this problem, and specializing boost::serialization::{save,load} for vector as for bool makes the problem go away. Any ideas? Jonathan. Boost version: 1.33.1 Valgrind version: 3.2.1 System: Fedora Core 6 g++ (GCC) 4.1.1 20061011 (Red Hat 4.1.1-30) Test program, which compiles and runs as expected: #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/vector.hpp> #include <fstream> #include <cmath> #include <cassert> int main(void) { std::string archive_filename("simple_vars.arch"); // Create an ouput archive { std::ofstream ofs(archive_filename.c_str()); boost::archive::text_oarchive output_arch(ofs); std::vector<double> doubles(3); doubles[0] = 1.1; doubles[1] = 1.2; doubles[2] = 1.3; // cast to const and write output_arch << static_cast<const std::vector<double>&>(doubles); } { // Create an input archive std::ifstream ifs(archive_filename.c_str(), std::ios::binary); boost::archive::text_iarchive input_arch(ifs); std::vector<double> doubles; // read the archive input_arch >> doubles; // test values assert(doubles.size() == 3u); assert(fabs(doubles[0] - 1.1) < 1e-12); assert(fabs(doubles[1] - 1.2) < 1e-12); assert(fabs(doubles[2] - 1.3) < 1e-12); } return 0; } Excerpt from valgrind stack trace: ==10018== Conditional jump or move depends on uninitialised value(s) ==10018== at 0x403C0ED: boost::archive::detail::basic_iarchive::reset_object_address(void const*, void const*) (in /usr/lib/libboost_serialization.so.1.33.1) ==10018== by 0x804E23E: boost::serialization::stl::archive_input_seq<boost::archive::text_iarchive, std::vector<double, std::allocator<double> > >::operator()(boost::archive::text_iarchive&, std::vector<double, std::allocator<double> >&) (collections_load_imp.hpp:54) ... ==10018== by 0x80506A7: boost::archive::text_iarchive& boost::archive::detail::interface_iarchive<boost::archive::text_iarchive>::operator>><std::vector<double, std::allocator<double> > >(std::vector<double, std::allocator<double> >&) (interface_iarchive.hpp:76) ==10018== by 0x804B7F2: main (serialize_bug.cpp:40) -- Jonathan Cooper MSN: msn(a)jonc.me.uk www: jonc.me.uk/ I never learned anything while I was talking - Larry King

1 0

[timer] How to change format of progres_display
by Seweryn Habdank-Wojewódzki 21 Mar '07

21 Mar '07

Hi Is there any easy way to change format in progress_display? Change: - Length of axis; - Number of thicks; - Labels on axis e.g. "A", "B", "C" or 1.0, 3.14, 5.12. Motivation for changing labels. If I have strings in vector and for me better is not to use 20%, but to use letters. I can take the first letter(s) of word on position "20%" and display it as label. Is it possible? Regards. -- |\/\/| Seweryn Habdank-Wojewódzki \/\/

2 2

BGL graph library biconnected components
by Greg Reynolds 21 Mar '07

21 Mar '07

Hi, I have been using "biconnected_components.hpp" for quite a while now. However, I have come across some graphs for which it finds far too many components... Here is my usage: //////////////////////////// Graph g; // initialise g and give edges an index std::vector< int > vec_bcc_nums( num_edges(g) ); iterator_property_map< std::vector< int >::iterator, property_map<Graph, edge_index_t>::type > mapEdgeComponent( vec_bcc_nums.begin() ); int num = biconnected_components(g, mapEdgeComponent); /////////////////////////// I'm afraid I can't post an example of the graphs (they are really big and I signed an NDA). What I would like to know is: a) Is the code above sensible, is there something subtly wrong with it? b) Has anyone else used the biconnected components code in anger on largish (> 300 vertices) graphs? Thanks, Greg

2 3

resetting FUSION_MAX_MAP_SIZE
by Christian Henning 20 Mar '07

20 Mar '07

Hi there, I'm experiencing problems when setting FUSION_MAX_MAP_SIZE to 20. I'm getting a lot of compiler errors: #define FUSION_MAX_MAP_SIZE 20 #include <string> #include <boost/static_assert.hpp> #include <boost/fusion/sequence.hpp> using namespace std; using namespace boost; // Address contact namespace address_fields { struct _address_1_; struct _address_2_; struct _city_; struct _state_; struct _zip_; struct _country_; struct _phone_1_; struct _phone_2_; struct _email_1_; struct _email_2_; struct _fax_; struct _other_; } typedef fusion::map< fusion::pair< address_fields::_address_1_, string > , fusion::pair< address_fields::_address_2_, string > , fusion::pair< address_fields::_city_ , string > , fusion::pair< address_fields::_state_ , string > , fusion::pair< address_fields::_zip_ , string > , fusion::pair< address_fields::_country_ , string > , fusion::pair< address_fields::_phone_1_ , string > , fusion::pair< address_fields::_phone_2_ , string > , fusion::pair< address_fields::_email_1_ , string > , fusion::pair< address_fields::_email_2_ , string > , fusion::pair< address_fields::_fax_ , string > , fusion::pair< address_fields::_other_ , string > > address_type; int _tmain(int argc, _TCHAR* argv[]) { return 0; } c:\boost\boost\fusion\sequence\container\map\map.hpp(41) : error C2977: 'boost::fusion::vector' : too many template arguments c:\boost\boost\fusion\sequence\container\vector\vector.hpp(126) : see declaration of 'boost::fusion::vector' c:\boost\boost\fusion\sequence\container\map\map.hpp(70) : see reference to class template instantiation 'boost::fusion::map<T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16,T17,T18,T19>' being compiled c:\boost\boost\fusion\sequence\container\map\detail\map_lookup.hpp(31) : error C3203: 'vector' : class template invalid as template argument for template parameter 'Vector', expected a real type c:\boost\boost\fusion\sequence\container\map\detail\map_lookup.hpp(32) : see reference to class template instantiation 'boost::fusion::map<T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16,T17,T18,T19>::meta_find_impl<Key,dummy>' being compiled c:\boost\boost\fusion\sequence\container\map\detail\map_lookup.hpp(37) : error C3203: 'vector' : class template invalid as template argument for template parameter 'Vector', expected a real type [snip] Any ideas, Christian

2 2

[spirit] YAML parser
by Christian Henning 20 Mar '07

20 Mar '07

Hi there, my project has come to stage where I would need to create some test data (fixtures). I would like to do it similar to Ruby where you have some yaml files containing the data. So, my question is if there is a parser using spirit for the yaml format? Thanks in advance, Christian

2 1

iostreams skip bug
by Phillip Seaver 20 Mar '07

20 Mar '07

I ran into a problem when using restrict on a file_source. The problem was that it decided that the stream wasn't seekable and called the version of skip that reads a character at a time until it gets to the requested offset, instead of just calling seek. The code was similar to this: namespace io = boost::iostreams; std::string filename; io::filtering_istream rstr(io::restrict(io::file_source(filename), 10, 100)); I've attached a patch that solved my problem. It was checking to see if the device was seekable (which means input_seekable and output_seekable), but since it was an input device, it was just input_seekable. Phillip Seaver --- skip.hpp.orig 2007-03-20 16:20:55.253000000 -0400 +++ skip.hpp 2007-03-20 16:11:51.096750000 -0400 @@ -67,7 +67,17 @@ void skip(Device& dev, stream_offset off) { typedef typename mode_of<Device>::type mode; - detail::skip(dev, off, is_convertible<mode, seekable>()); + typedef mpl::or_< + mpl::and_< + is_convertible<mode, input>, + is_convertible<mode, input_seekable> + >, + mpl::and_< + is_convertible<mode, output>, + is_convertible<mode, output_seekable> + > + > can_seek; + detail::skip(dev, off, can_seek()); } template<typename Filter, typename Device>

1 0

[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

Boost Conference Reminder
by David Abrahams 19 Mar '07

19 Mar '07

Just a quick note to remind you that the official website for BoostCon'07 is up and registration is open: http://www.boostcon.com Space is limited, so register early to be sure you'll get in. See http://www.boostcon.com/registration for registration information. I'm really thrilled at the quality of the program (http://www.boostcon.com/program) we've assembled. On most days I'm going to have a hard time choosing among the simultaneous sessions! I look forward spending a week with you, immersed in Boost, at one of the most beautiful meeting sites in the world (http://www.boostcon.com/location/site) See you at BoostCon! -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

[fusion] How to use transform Metafunction?
by Christian Henning 19 Mar '07

19 Mar '07

Hi there, since there is no example in the docs and no test for it. I was wondering how to use fusion's transform metafunction. Here is what I want to do. template <typename T> struct add_vector { typedef std::vector<T> type; }; struct A; struct B; struct C; int main() { typedef fusion::list< A, B, C > types; typedef fusion::transform< types, add_vector<> >::type vector_of_types; return 0; } The compiler is complaining that there are too few parameters for add_vector. In MPL you would just add _1 as the template parameter. But this doesn't work for fusion. So, how do I use it? Thanks, Christian

3 5

[lexical_cast] lexical_cast<int>("1e4") == 1
by n.torrey.pines＠gmail.com 19 Mar '07

19 Mar '07

lexical_cast<int>("1e4") == 1 // because of the way streams work of course I think that in the interests of robustness, and unless a better solution can be found, lexical_cast<> should be secialized for some types. Another solution might be to make sure that the whole string argument got consumed (rejecting things like "123 " )

5 4

which type of smart pointer to use?
by Vaclav 19 Mar '07

19 Mar '07

Hello, When I reset the main pointer to an object, I want all other pointers pointing to that object to be reset as well. Which type of smart pointer should I use? Example: boost::shared_ptr<MySillyClass> mySharedPtr1(new MySillyClass("test")); boost::shared_ptr<MySillyClass> mySharedPtr2 = mySharedPtr1; mySharedPtr1.reset(); if(mySharedPtr2.use_count() > 0) { TRACE("still used\n"); } else { TRACE("not used anymore\n"); } I am getting message "still used". I understand that is the normal behavior of boost::shared_ptr. Is there a smart pointer type that would print the second message? Reason: When I am done with an object, I would reset the main pointer to it and do not want other references to that object to be able to do anything with it. Thanks for advice! Vaclav

3 3

MPL map error on g++
by Santosh Joseph 18 Mar '07

18 Mar '07

My code compiles on visual studio 8, but on g++ 3.3.2 (linux) and with g++ 3.4.4 (cygwin) it chokes with the following error: In function `void convertToScctsOpt()': optionmanager.cpp:119: error: expected init-declarator before "ScctsType" optionmanager.cpp:119: error: expected `, ' or `;' before "ScctsType" optionmanager.cpp:120: error: `ScctsType' undeclared (first use this function) Is some special command line argument needed? thanks for any help. #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #define BOOST_MPL_LIMIT_MAP_SIZE 50 #include <boost/mpl/map.hpp> #include <boost/mpl/at.hpp> #include <boost/mpl/pair.hpp> namespace bm = boost::mpl; typedef bm::map< bm::pair<Type1, MappedType1>, . . . bm::pair<Type41, MappedType41> > TypeToTypeMap; template<typename SoapType> inline void convertToScctsOpt() { typedef bm::at<TypeToTypeMap,SoapType>::type ScctsType; } ____________________________________________________________________________________ Now that's room service! Choose from over 150,000 hotels in 45,000 destinations on Yahoo! Travel to find your fit. http://farechase.yahoo.com/promo-generic-14795097

2 1

Boost.Interprocess shared_memory.hpp
by Jean-Christophe Roux 17 Mar '07

17 Mar '07

Hello, I installed boost-1_35 this morning from cvs, which I believe contains the interprocess library. I took the interprocess doc from the vault. In the doc, there is at the end of the chapter "Shared Memory" a "Simple Example" that I am unable to compile because it contains the line: #include <boost/interprocess/shared_memory.hpp> but that file does not exist in my boost-1_35 folder. In /usr/local/include/boost-1_35/boost/interprocess, I have managed_shared_memory.hpp shared_memory_object.hpp but no shared_memory.hpp Maybe I am missing something obvious... Maybe the library from 1_35 and the docs from the vault are not compatible? Thanks for helping me out here. Jean-Christophe

2 2

[boost-users][quickbook] Trying to get many sections onto one page
by Darren Garvey 17 Mar '07

17 Mar '07

Hello, I have a situation like this: [section Section 1] ... [endsect] [section Section 2] ... [endsect] and I'd like the generated html to have the layout of an article document-type but for it all to lie on one page. Obviously cut/paste is easy enough, but I'm wondering what the correct way to do this automatically is. Regards, Darren

2 2

Fwd: SQL library with full embedded SQL-syntax
by Lyfar Dmitriy 17 Mar '07

17 Mar '07

Hello, sorry for my long responce. Rene Rivera wrote: > Sure... But we could use that same argument to propose that we write C++ > programs by writing an abstraction on top of C++ compilers in Python so > that we can remove the incompatibilities in the various C++ > implementations. Having had the displeasure of dealing with PL/SQL there > is one serious drawback to the language embedded approach, it ties ones > to the capabilities of the abstraction. May be you right, but I think that that comparison is incorrect, because of as far as I know SQL-standart doesn't include many useful features from various databases, opposite, the C++ standart, which is describes the whole language :) The main goal of the abstract layer for that library is, as Thorsten said, is to provide "portable" SQL for at least a simple queries. There is no goal to emulate features of each db for others at the first time. > Jorge Lodos wrote: > Sorry, I don't see how any of this applies -- just because the SQL is a string > doesn't mean it comes from an untrusted source. And, programmers that don't > validate input from untrusted sources deserve what they get.... I'd like to draw an intermediate conclusions: 1) The SQL library should provide a backdoor so you can still use string queries if you need to be non-portable or cutting egde etc. 2) Embedded SQL commands is type-safe, but strings are flexible and more useful in the 'real world' 3) It's hard to write one big abstract layer for all databases with single functionality and many people doesn't need in it usually. 4) ...? Phil Endecott wrote: > Well, an interface is not much use without some sort of implementation > behind it. Possible implementations for a "generic relational > interface" include an SQL database, on-disk data structures implemented > using something like stxxl, and in-memory data structures made > persistent using serialisation. A measure of a good generic relational > interface could be that it works well with all of these implementations. > > Thinking just about SQL backends, the basic question is whether we want to > > (a) hide the SQL, making the database accesses look more like C++ > function calls and data structures, or > > (b) make the SQL explicit, making the C++ code look more like SQL. > > I definitely vote for (a), and the possibility of moving an application > to something like stxxl is one of my motivations for that. If you interested in such libraries -- take a look at database template library(dtl) also. What do you think about containers overhead? Does the (a) variant means that the parsing of the result of query is something like parsing an Variant type? Is it always opportune? The people who wants to have type-safety of queries and platform independence will select the (b) variant, I hope :) ----- Best Regards, Dmitriy Lyfar

1 0

Bug in boost.filesystem?
by Tom Bachmann 17 Mar '07

17 Mar '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, Is the following code expected to be portable? namespace fs = boost::filesystem; fs::rename (current_p, skin_p / current_p.leaf ()); Where current_p and skin_p are fs::path, where current_p is valid and skin_p is the result of dereferencing a directory iterator (that was not at behind-end position at time of dereferencing). For current_p = foo/10NfRaHD1AAICPMKZIC50FvmaHw==.medium.jpg skin_p = foo/bar (directory) the code causes an exception: boost::filesystem::path: invalid name "10NfRaHD1AAICPMKZIC50FvmaHw==.medium.jpg" in path: "10NfRaHD1AAICPMKZIC50FvmaHw==.medium.jpg" (that is, I believe, at the point where a temporary path object is constructed from current_p.leaf ()). This appears quiet strange to me, as I never mention the file in the code, and I'd expect the library to treat such oddities. The following code works: fs::rename (current_p, skin_p / fs::path (current_p.leaf (), fs::native)); Is this the expected behavior? - -- - -ness- -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (GNU/Linux) iD8DBQFF+/vPvD/ijq9JWhsRAhMdAKCDyLsi0EKzhUnVcM3GjKopqnpcCQCbBK4y vkNablkmw69y3xj6ulSNdvs= =izVN -----END PGP SIGNATURE-----

2 2

Boost path to use for VC++ 8?
by Jeff Dunlap 17 Mar '07

17 Mar '07

Hello, I am new to VC++ (ver 8) and would really like to use Boost! This is what I have done: 1) I unzipped the boost download to c:\boost_1_33_1 2) At the command prompt, I executed: c:\boost_1_33_1\>bjam "-sTOOLS=VC-8_0" install bjam ran fine and a new directory was created: c:\boost\include\boost-1_33_1\boost c:\boost\lib I had assumed that using bjam's install parameter would modify whatever the path settings for the VC IDE are supposed to be, but that does not appear to happen. There are alot of paths and I want to make sure that I use the right one. What are the paths that I am supposed to include in VC++ when using the bjam param 'install' above? Secondly, I was thinking that maybe the 'stage' param might be a better bjam choice since the boost libraries are built in a common directory, thus making it easier to use. Are there drawbacks to using boost this way? Thank you very much

2 2

RWmutex + sockets
by Bo Lorentsen 17 Mar '07

17 Mar '07

Hi ... I have been looking into your thread lib, and all seem fine and nice, but is it true that there where no RW mutex or is it just called something I did not know ? Also, ... are there some kind of URL / socket lib in boost ? /BL

3 3

cache basics
by Gottlob Frege 17 Mar '07

17 Mar '07

I had an idea for a general cache, based on the idea that caches are essentially trying to avoid re-calling expensive functions with the same parameters as last time. So typically you build a cache key from the params, put it in a map, etc. But what if we did things slightly differently... template <typename T> struct cache { typedef boost::function< T () > retriever_function; typedef std::map<retriever_function, T> map; map m; T retrieve(retriever_function retriever) { map::iterator it = m.find(retriever); if (it != m.end()) { return it->second; } else { T t = retriever(); m[retriever] = t; return t; } } }; Basically, instead of building a key from the params, build a key from the params + the function that takes the params. Then, as a bonus, you don't need to worry about packing/unpacking the params - just let bind() do that for you! The other bonus is that you can cache things that may be created via different methonds. So what's the problem? The problem is that boost::function and boost::bind don't have operator<(), so you can't put a boost::function in a map. :-( (actually it appears boost::bind does have an operator<, but it doesn't do what I want - it actually bind's the operator< into a function!) Any advice? Any chance boost::function might gain a < operator? (One that compared the underlying function and the params, possibly handled different numbe of params, etc - although I could live with requiring all the param types to be the same. ie basically boost::function would pass most of the work off to the function object (ie bind)) Do I instead need to use tuples and pack/unpack the params myself (and write overloads for 0 to n params, handle return_type messes, etc etc etc )? - Tony

3 2

[MPL] 2 Newbie Questions
by Scott Meyers 17 Mar '07

17 Mar '07

I'm trying to use the MPL for the first time, and I have two questions. First, I want to use BOOST_MPL_ASSERT to say that at least one of two conditions is true. For the time being, one of the conditions is always false, so this is what I've tried: BOOST_MPL_ASSERT(( false || boost::is_same<CallerConstraints, CodeConstraints::Ignore_Constraints> )); It won't compile, so I tried this: BOOST_MPL_ASSERT(( mpl::or_(false, boost::is_same<CallerConstraints, CodeConstraints::Ignore_Constraints>) )); It won't compile either. I'm guessing that I have to use mpl::false_ or something in place of false, but that doesn't work either. Can somebody please tell me the proper way to say what I want to say? My second question is about the existence of an MPL algorithm akin to the STL algorithm includes. Given two MPL vectors V1 and V2, I want to know if all the types in V1 are also in V2. I know about mpl::contains, but I can't find mpl::includes. Is there one, or do I need to write it myself? I have the MPL book, so references to that are fine, in addition to anything online. Thanks, Scott

4 7

[filesystem] Puzzling behaviour on MSVC 7.1 with ofstream and wpath in binary mode
by Eoin 17 Mar '07

17 Mar '07

Hello, My development platform is Win XP with sp2. I am using a very recent (no older than a week) copy of the boost cvs version 1.34rc and the compilers are MSVC 7.1 and 8.0 both with the service packs. I've encountered some puzzling behaviour with filesystem::wpath's and filesystem::ofstream's when opened in binary mode and compiled with VC++ 7.1. When I attempt to open a binary ofstream with a wpath as its filename it will fail if the file did not already exist. This appears to be contrary to when the filename argument is a narrow filesystem::path. When the binary mode is not specified both files are created. Attached is a very small app. demonstrating the inconsistency. This only occurs with 7.1, when compiled with 8.0 both files will be created if they did not already exist. Kind regards, Eoin. #include <iostream> #include <boost/filesystem/path.hpp> #include <boost/filesystem/fstream.hpp> namespace fs = boost::filesystem; int main() { fs::wpath wide_filename = L"./Wide.txt"; fs::path narrow_filename = "./Narrow.txt"; fs::ofstream wide_fs(wide_filename, fs::fstream::binary); std::cout << ((wide_fs.is_open()) ? "Wide file open." : "Wide file not open.") << std::endl; fs::ofstream narrow_fs(narrow_filename, fs::fstream::binary); std::cout << ((narrow_fs.is_open()) ? "Narrow file open." : "Narrow file not open.") << std::endl; return 0; }

1 0

Re: [Boost-users] Boost path to use for VC++ 8?
by Nathan McDaniel 16 Mar '07

16 Mar '07

Hi Jeff, I'm not real clear either on the difference between 'stage' and 'install' (seem to be different only in the default folders they place things), but this is what I'm doing: First, I build Boost with this command (I only want the release libraries and only statically linked--builds a bit faster): bjam "-sBUILD=release <runtime-link>static" "-sTOOLS=vc-8_0" --prefix=./boost-built install When it's done, you'll have a "boost-built" subfolder with a "boost" folder and a "lib" folder. I don't plan on routinely rebuilding 1.33.1, so I copy the "boost-built" folder into one of my project folders and delete the boost build directory/files. Then add the "boost-built\boost" subfolder to your include search path, and the "boost-built\lib" subfolder to your library search path. Nathan ---------- Forwarded message ---------- > From: Jeff Dunlap <jeff_j_dunlap(a)yahoo.com> > To: boost-users(a)lists.boost.org > Date: Thu, 15 Mar 2007 02:49:10 +0000 (UTC) > Subject: [Boost-users] Boost path to use for VC++ 8? > Hello, I am new to VC++ (ver 8) and would really like to use Boost! > > This is what I have done: > > 1) I unzipped the boost download to c:\boost_1_33_1 > > 2) At the command prompt, I executed: > c:\boost_1_33_1\>bjam "-sTOOLS=VC-8_0" install > > bjam ran fine and a new directory was created: > > c:\boost\include\boost-1_33_1\boost > c:\boost\lib > > > I had assumed that using bjam's install parameter would modify whatever > the > path settings for the VC IDE are supposed to be, but that does not appear > to > happen. There are alot of paths and I want to make sure that I use the > right > one. What are the paths that I am supposed to include in VC++ when using > the > bjam param 'install' above? > > Secondly, I was thinking that maybe the 'stage' param might be a better > bjam > choice since the boost libraries are built in a common directory, thus > making > it easier to use. Are there drawbacks to using boost this way? > > Thank you very much >

2 1

iostreams filter help
by Aljaz 16 Mar '07

16 Mar '07

Hello I've been trying to get boost iostreams filter to work. Heres the code I managed to write, but theres something I cannot understand.. It works fine with one small text file and it will process the lines okay, but when I try to use another text file (which is much bigger) it wont recognize any line and will return 0 lines counted (though file has around 2 million lines).. What am I doing wrong? What could be the cause of this? Best regards Thanks for help Heres the code: #include <boost/iostreams/device/file.hpp> #include <boost/iostreams/filtering_stream.hpp> #include <boost/iostreams/filter/newline.hpp> #include <boost/iostreams/filter/line.hpp> #include <boost/ref.hpp> #include <fstream> #include <ostream> #include <iostream> #include <string> using namespace std; using namespace boost::iostreams; namespace io = boost::iostreams; class long_line_counter : public io::line_filter { public: explicit long_line_counter(int max_length = 80) : max_(max_length), count_(0) { } int count() const { return count_; } private: std::string do_filter(const std::string& line) { ++count_; return line; } int max_; int count_; }; int main() { filtering_istream fin; long_line_counter llc(80); fin.push(boost::ref(llc)); fin.push(file_source("test2.txt", ios::in | ios::binary)); char buf[4012]; while ( fin.read(buf, 4012) && (llc.count() < 7000) ) { std::cout << "read" << "\n"; } std::cout << llc.count() << "\n"; return 0; }

1 0

[Serialization] issue with portable_binary_oarchive
by Dan Leibovich 16 Mar '07

16 Mar '07

Hi, I am trying to use the portable binary archive example. I need to serialize only integers and strings. I tried it on linux and solaris5.8. The result binary stream is not the same and deserialization fails. I used hex viewer and notice that the files are very similar except for some few differences which results from endienness issues. Can it be that the metadata is written differently on each platform. This is happens when I serialize derived class through a pointer to base class. (I used BOOS_CLASS_EXPORT) Below you will find a test case. It produce differ output on linux and solaris. Am I missing something? Thanks in advance Dan Leibovich #include <fstream> #include "portable_binary_oarchive.hpp" #include <boost/serialization/base_object.hpp> #include <boost/serialization/export.hpp> class Base { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & x; } protected: int x; public: Base() {} ; Base(int x_) : x(x_) {} ; virtual void foo() {} ; }; class Derived1 : public Base { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & boost::serialization::base_object<Base>(*this); ar & y; } protected: int y; public: Derived1() {} ; Derived1(int x_, int y_) : Base(x_), y(y_) {} ; virtual void foo() {x++;} }; class Derived2 : public Base { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & boost::serialization::base_object<Base>(*this); ar & z; } protected: bool z; public: Derived2() {} ; Derived2(int x_) : Base(x_), z(true) {} ; virtual void foo() {x--;} }; class Container { Base* b1 ; Base* b2 ; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & b1; ar & b2 ; } public: Container() {} ; Container(int x, int y) { b1 = new Derived1(x,y) ; b2 = new Derived2(x) ; } }; BOOST_CLASS_EXPORT(Derived1) ; BOOST_CLASS_EXPORT(Derived2) ; int main() { std::ofstream ofs("filename"); const Container c(1,2) ; portable_binary_oarchive oa(ofs); oa << c; }

2 19

[Boost.Test] improving BOOST_CHECK_CLOSE for arguments == 0
by Pierre-Jules Tremblay 16 Mar '07

16 Mar '07

I've been having some problems using BOOST_CHECK_CLOSE() (1.33.1) in cases where one of the two arguments is exactly equal to zero: the tolerance check fails in this case (d'oh). I know that I can use BOOST_CHECK_SMALL() in those cases, but it's a real drag to have to write the boilerplate code to handle specific cases where one operand is zero. So this is what I've done: #define MY_CHECK_CLOSE(a,b,c) \ if (a == 0) { BOOST_CHECK_SMALL(b,c); } \ else if (b == 0) { BOOST_CHECK_SMALL(a,c); } \ else { BOOST_CHECK_CLOSE(a,b,c); } I wonder: did I miss something, is there a better way? If not, perhaps this logic could be integrated in the _CLOSE tools. pj

2 3

[graph] Building a graph from file
by Marc Boyer 16 Mar '07

16 Mar '07

Dear all, I am a new boost::graph user, and I have a pb that should be very common, but I do not find any simple way to do it. I have a graph, with, in a file, some vertex name, and, in another file, edge described from vertex name, something like -- nodes.txt -- AAA BBB CCC -- edges.txt -- AAA BBB xx AAA CCC yy CCC AAA zz With the book, it is quite easy to set the vertex names in the graph (with an internal property and the name_map). What seems not easy to me is how to add the edges ? I add to find a way to get a vertex from its name, and the map only do the opposite. Did I have to build a tempory reverse map ? Best regards, Marc Boyer

3 2

[fusion] cannot compile extension example
by Christian Henning 16 Mar '07

16 Mar '07

Hi there, same to my former email. The extension example does not compile with VC7.1. Here are the errors: \boost\libs\fusion\example\extension\test_example.cpp(25) : error C2039: 'is_associative' : is not a member of 'boost::fusion::traits' \boost\libs\fusion\example\extension\test_example.cpp(25) : error C2059: syntax error : ')' \boost\libs\fusion\example\extension\test_example.cpp(26) : error C2653: 'traits' : is not a class or namespace name \boost\libs\fusion\example\extension\test_example.cpp(26) : error C2059: syntax error : ')' \boost\libs\fusion\example\extension\test_example.cpp(26) : error C2143: syntax error : missing ';' before '}' \boost\libs\fusion\example\extension\test_example.cpp(26) : error C2059: syntax error : '}' \boost\libs\fusion\example\extension\test_example.cpp(27) : error C2653: 'traits' : is not a class or namespace name \boost\libs\fusion\example\extension\test_example.cpp(27) : error C2059: syntax error : ')' \boost\libs\fusion\example\extension\test_example.cpp(27) : error C2143: syntax error : missing ';' before '}' \boost\libs\fusion\example\extension\test_example.cpp(27) : error C2059: syntax error : '}' \boost\libs\fusion\example\extension\test_example.cpp(29) : error C2061: syntax error : identifier 'begin' \boost\libs\fusion\example\extension\test_example.cpp(29) : error C2143: syntax error : missing ')' before '==' \boost\libs\fusion\example\extension\test_example.cpp(29) : error C2059: syntax error : ')' \boost\libs\fusion\example\extension\test_example.cpp(29) : error C2457: '__FUNCSIG__': predefined macro cannot appear outside of a function body \boost\libs\fusion\example\extension\test_example.cpp(29) : error C2059: syntax error : ')' \boost\libs\fusion\example\extension\test_example.cpp(29) : error C2501: 'boost::detail::test_failed_impl' : missing storage-class or type specifiers \boost\libs\fusion\example\extension\test_example.cpp(29) : error C2365: 'boost::detail::test_failed_impl' : redefinition; previous definition was a 'function' c:\boost\boost\detail\lightweight_test.hpp(40) : see declaration of 'boost::detail::test_failed_impl' \boost\libs\fusion\example\extension\test_example.cpp(29) : error C2185: 'boost::detail::test_failed_impl' : illegal based allocation \boost\libs\fusion\example\extension\test_example.cpp(29) : fatal error C1903: unable to recover from previous error(s); stopping compilation Christian

2 1

[fusion] Fill Em Up example doesn't compile
by Christian Henning 16 Mar '07

16 Mar '07

Hi there, I'm using VC7.1 and I try to compile the fill_em_up example I found in the cookbook example folder. Unfortunately the it doesn't compile. I have updated my boost to the latest CVS version. Here are the error messages: c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2039: 'category' : is not a member of 'boost::mpl::fusion_iterator<Iterator>' ...... c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2146: syntax error : missing ',' before identifier 'category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2065: 'category' : undeclared identifier c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2976: 'boost::fusion::detail::mpl_iterator_category' : too few template arguments c:\boost\boost\fusion\support\detail\mpl_iterator_category.hpp(28) : see declaration of 'boost::fusion::detail::mpl_iterator_category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2955: 'boost::fusion::detail::mpl_iterator_category' : use of class template requires template argument list c:\boost\boost\fusion\support\detail\mpl_iterator_category.hpp(28) : see declaration of 'boost::fusion::detail::mpl_iterator_category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2955: 'boost::fusion::detail::mpl_iterator_category' : use of class template requires template argument list c:\boost\boost\fusion\support\detail\mpl_iterator_category.hpp(28) : see declaration of 'boost::fusion::detail::mpl_iterator_category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2027: use of undefined type 'boost::fusion::detail::mpl_iterator_category' c:\boost\boost\fusion\support\detail\mpl_iterator_category.hpp(28) : see declaration of 'boost::fusion::detail::mpl_iterator_category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(33) : error C2146: syntax error : missing ';' before identifier 'category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(33) : error C2501: 'boost::fusion::mpl_iterator<Iterator>::category' : missing storage-class or type specifiers with [ Iterator=boost::fusion::extension::begin_impl<boost::fusion::mpl_sequence_tag>::apply<const boost::mpl::iterator_range<mpl_r_advance,mpl_r_end>>::iterator ] c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2039: 'category' : is not a member of 'boost::mpl::fusion_iterator<Iterator>' with [ Iterator=boost::fusion::extension::next_impl<boost::fusion::vector_iterator_tag>::apply<r_advance>::type ] c:\boost\boost\fusion\sequence\container\vector\detail\vector_n.hpp(68) : see reference to class template instantiation 'boost::fusion::mpl_iterator<Iterator>' being compiled with [ Iterator=boost::mpl::next<boost::fusion::mpl_iterator<boost::fusion::extension::begin_impl<boost::fusion::mpl_sequence_tag>::apply<const boost::mpl::iterator_range<mpl_r_advance,mpl_r_end>>::iterator>::iterator_type>::type ] c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2146: syntax error : missing ',' before identifier 'category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C3861: 'category': identifier not found, even with argument-dependent lookup c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2976: 'boost::fusion::detail::mpl_iterator_category' : too few template arguments c:\boost\boost\fusion\support\detail\mpl_iterator_category.hpp(28) : see declaration of 'boost::fusion::detail::mpl_iterator_category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2955: 'boost::fusion::detail::mpl_iterator_category' : use of class template requires template argument list c:\boost\boost\fusion\support\detail\mpl_iterator_category.hpp(28) : see declaration of 'boost::fusion::detail::mpl_iterator_category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2955: 'boost::fusion::detail::mpl_iterator_category' : use of class template requires template argument list c:\boost\boost\fusion\support\detail\mpl_iterator_category.hpp(28) : see declaration of 'boost::fusion::detail::mpl_iterator_category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(32) : error C2027: use of undefined type 'boost::fusion::detail::mpl_iterator_category' c:\boost\boost\fusion\support\detail\mpl_iterator_category.hpp(28) : see declaration of 'boost::fusion::detail::mpl_iterator_category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(33) : error C2146: syntax error : missing ';' before identifier 'category' c:\boost\boost\fusion\sequence\adapted\mpl\mpl_iterator.hpp(33) : error C2501: 'boost::fusion::mpl_iterator<Iterator>::category' : missing storage-class or type specifiers with [ Iterator=boost::mpl::next<boost::fusion::mpl_iterator<boost::fusion::extension::begin_impl<boost::fusion::mpl_sequence_tag>::apply<const boost::mpl::iterator_range<mpl_r_advance,mpl_r_end>>::iterator>::iterator_type>::type ] Is that a know problem? Thanks, Christian

2 1

How to sleep inside a boost::thread?
by Meryl Silverburgh 16 Mar '07

16 Mar '07

Hi, If I create a boost::thread like this: boost::thread thrd1(&reader); 1. how can I sleep inside the thread? (in the method 'reader') 2. when does the thread 'thrd1' terminate?

5 5

Re: [Boost-users] why the following regexp doesn't meet my requirement?
by llwaeva＠21cn.com 16 Mar '07

16 Mar '07

>> But, as I mentioned above, the whole matached string, namely #P{x}, >> will be replaced once the match is found. So, the character [^#] will >> also be replaced, that is not what I want. >Try a negative lookbehind: "(?<!#)#" will match any single "#" that is *not* preceded by another #. > The previous character (whatever it is) >does not form part of the result. >John. Thank you so much. It's amazing! I see that regex is really a powerful tool! BTW, in order to replace the pattern #P and avoid the string start with double #, I find it is all right to specify the exact times in matching when using replace_all_regex, for example replace_all_regex( source, boost::regex("([#]\{1\}P)|([#]\{1\}G)"), string("(?1 FIRST)(?2 SECOND)"), format_all ); of course, using the "negative lookbehind" approach also works in this problem replace_all_regex( source, boost::regex("((?<!#)#P)|((?<!#)#G)"), string("(?1 FIRST)(?2 SECOND)"), format_all ); For my case, the program might be used to handle a LARGE text (perhaps several megabytes). So, I am wondering which approach is faster! Thanks again!

1 0

why the following regexp doesn't meet my requirement?
by llwaeva＠21cn.com 16 Mar '07

16 Mar '07

Hi there, First of all, sorry for so many questions on using of regex. Actually, I am a beginner of regular expression; it is hard for me to understand some terms in document. I am going to extract a string in some pattern like #P{EXP_BEING_EXTRACTED} here, EXP_BEING_EXTRACTED is any expression which I want. For instance, xyz in #P{xyz} and 123_456 in #P{123_456}. But, I also need to ignore the case with double # as prefix, i.e. the output of ##P{123} should be kept unchanged. I use regex_search string source; // source contains the text being handled #P{x} or ##P{x} may occur boost::regex regexp; string::const_iterator start, end; boost::match_results<std::string::const_iterator> what; boost::match_flag_type flags = boost::match_default; regexp = "[#]\{1\}P[{]$[^}]*$[}]"; start = source.begin(); end = source.end(); if ( regex_search(start, end, what, regexp, flags) ) { // get the expression inside {} here // 1) get the text: string( what[1].first, what[1].second) // 2) replace the whole matched string, i.e., replace string(what[0].first, what[1].second); } The code above is fine for #P{x}; however, for the case ##P{x} regex_search still returns true. It seems that the regex_search firstly found the ##P{x} which is not match the regular expression; then, it go ahead from the second # and do the match again, so it found #P{x} finally. I don't know if the process is similiar to what I depict. Anyway, I just want to know how can I ignore the case ##P{x}. I try to modify the regular expression as follow regexp = "[^#]#P[{]$[^}]*$[}]"; But, as I mentioned above, the whole matached string, namely #P{x}, will be replaced once the match is found. So, the character [^#] will also be replaced, that is not what I want.

2 1