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

Bug in boost/graph/transitive_closure.hpp
by Todd A. Gibson 14 Mar '05

14 Mar '05

Bug: The header file boost/graph/transitive_closure.hpp contains an unscoped call to not1(). This function is defined in both the std namespace and the boost namespace (via boost/functional.hpp). If boost/functional.hpp is included either directly or indirectly (e.g., via boost/multi_array.hpp) Then any attempted use of transitive_closure() will not compile due to the ambiguity. Solution: Scope the call to not1 in boost/graph/transitive_closure.hpp: std::not1 Note: This bug can be easily be reproduced by including boost/functional.hpp (or boost/multi_array.hpp) To the example program transitive_closure.cpp . Thanks, -TAG Todd A. Gibson

3 3

boost::serialization within libraries
by Carsten Tham 14 Mar '05

14 Mar '05

Hi, i've run into a problem with serialization in combination with static-libraries: In my first try i defined BOOST_CLASS_EXPORT in the header-file of my exported classes. It worked for the libraries but gave me linker-errors in my applications (multiple defines). I think the link-problems are due to some static functions, defined by BOOST_CLASS_EXPORT, therefore i moved the macro-instantiations to my application, which fixed my problem. If this is the correct way to handle the issue i would suggest to include this situation in the docs. BTW: I want to thank Robert Ramey for this great library! It serialized my deeply nested object-structure with lots of shared smart-ptr's without any problem in all 3 formats and with very little work on my side. Thanks for such a great contribution to boost! Regards - Carsten -- SMS bei wichtigen e-mails und Ihre Gedanken sind frei ... Alle Infos zur SMS-Benachrichtigung: http://www.gmx.net/de/go/sms

2 1

BGL: EdgeList template parameter specification for undirected graphs
by Anatoly Petkevich 14 Mar '05

14 Mar '05

Hi! I am trying to use the BGL to create sparse undirected graph using boost::setS as template argument for EdgeList parameter: typedef adjacency_list<vecS, vecS, undirectedS, no_property, no_property, no_property, setS> GraphType; Impementation of boost::add_edge() for undirected graphs calls g.m_edges.push_back(e), and we get compilation error here since push_back() is not a member of associative container std::set. There is no such a problem for directed graphs (directedS). According to the BGL documentation there are no restrictions on EdgeList parameter for undirected graphs. Is this an undocumented feature or inconsistent implementation or library misuse? Regards, A.Petkevich

3 3

Re: [Boost-users] Graph Library - bundled properties, internal & external properties
by Elvanör 14 Mar '05

14 Mar '05

Hello again, >> Second, with bundled properties I have troubles with constructors. I >> created a class myClass, that I will use as a struct for the bundled >> properties. This class contains reference members so it needs a >> constructor better than the default constructor without any >> arguments. Creating a graph with these bundled properties doesn't >> allow me to use another constructor than the default myClass() one, >> it seems. I think it would be very good if I could create an array of >> myClass and then point my Graph object to this array to use it as >> bundled properties. Then I could do all the initialization I want >> cleanly. > > I think that when you add an edge or vertex, you can just pass a > myClass instance before the graph argument, e.g,, > > v = add_vertex(myClass(some_reference), g); Ok, so that would solve one of my problems. Thank you. > > >> My last problem is with the depth_first_search() algorithm... and of >> course bundled properties. This algorithm takes a const Graph &; but >> I want to be able to modify (while running the algorithm) the bundled >> properties!! That is the whole point of running this algorithm. I >> don't want to change the structure of the graph (the abstract graph - >> links from vertices to edges, etc), while running the algorithm, of >> course, but I do want to change when I want my bundled properties... >> that is not possible (at least, not without compiler warnings, which >> I don't like :-) due to the fact that depth_first_search expects a >> const graph. > > Yeah, this is an annoying problem. We'd like to be able to take either > a const or a non-const graph, but doing so would require two overloads > of the algorithm, which we really can't do (too much code!). Like someone else pointed out, what do you mean by too much code? It would require too much time? Or would it be considered a problem for more "fundamental" reasons (ie, that could lead to trouble in existing code, etc...)? > I suggest that you put a non-const reference to the graph from within > your visitor and use that instead of the graph that is passed to the > event functions. I am not sure I understand how you would do that... Am I correct in understanding that you would declare a non const reference as a member in your visitor? And then you would have to pass the Graph object when you create the visitor. That means a visitor would be suitable for only one graph (that is not a problem in my case, just a remark) on which you intend to use the visitor on. Another way would be to use pointers to objects as bundled properties, instead of directly the object themselves. I think that should work and that's what I am using right now. Basically it only changes that in your visitor, it's not g[v].some_member = 4; but g[v]->some_member = 4; (if g is the graph). Seems to work fine. Jean-Noël

2 1

Graph Library - bundled properties, internal & external properties
by Elvanör 14 Mar '05

14 Mar '05

Hello everyone, this is my first post to the list so excuse me if I didn't get some concepts right. I have begun to learn the BGL as I was searching for a good graph library; I am a student in Computer Science and my thesis is about graph algorithms. I am impressed, it seems to be a good library. Plus, it has forced me at last to deepen my knowledge of STL, templates and generic programming. Now to my question: as I am a new user, when I read the documentation I decided to use the new bundled properties mechanism rather than the old properties map methods. It was recommended in the documentation (I would, btw, like to humbly point out that the documentation is not very clear on this. The bundled properties explanation page is not accessible from the content page and could confuse quite a lot of people), and anyway I found that a lot simpler. But now I am running into troubles. First, are bundled properties applicable to "external properties"? To be honest, I don't really get the difference between internal and external properties. Or do I have to use property maps (in the old way) for external properties? Second, with bundled properties I have troubles with constructors. I created a class myClass, that I will use as a struct for the bundled properties. This class contains reference members so it needs a constructor better than the default constructor without any arguments. Creating a graph with these bundled properties doesn't allow me to use another constructor than the default myClass() one, it seems. I think it would be very good if I could create an array of myClass and then point my Graph object to this array to use it as bundled properties. Then I could do all the initialization I want cleanly. Right now, it seems to me than the only way to modify these properties (prior to running a grpah algorithm for example), is to do some sort of: G[v].my_first_data_member =5; G[v].my_second_data_member = "test"; etc... with v moving over all the vertexes (or edges). This seems a little bit strange... and impossible to use reference data members with that, for exemple. My last problem is with the depth_first_search() algorithm... and of course bundled properties. This algorithm takes a const Graph &; but I want to be able to modify (while running the algorithm) the bundled properties!! That is the whole point of running this algorithm. I don't want to change the structure of the graph (the abstract graph - links from vertices to edges, etc), while running the algorithm, of course, but I do want to change when I want my bundled properties... that is not possible (at least, not without compiler warnings, which I don't like :-) due to the fact that depth_first_search expects a const graph. I think that will be all... if someone can enlighthen me on these topics I'll be happy!! Regards Jean-Noël

3 3

__stdcall with boost::function
by Olenhouse, Jason 14 Mar '05

14 Mar '05

I'm trying to pass a member function pointer around to the Windows Service Control Manager through Windpws API functions, but I think I'm having troubles with the __stdcall convention. I'm using MSVC 7.1.3088. For brevity I've left out information, but I think this is enough to go on: __ExampleClass.h__ class ExampleClass { protected: void Setup( void ); void __stdcall ServiceMain( DWORD dwArgc, LPSTR *lpszArgv ); LPSERVICE_MAIN_FUNCTION m_fServiceMain; }; __ExampleClass.cpp__ void ExampleClass::Setup( void ) { boost::function<void ( DWORD, LPSTR * )> f2 = boost::bind( boost::mem_fn( &ExampleClass::ServiceMain ), this, _1, _2 ); m_fServiceMain = f2.target<void ( DWORD, LPSTR * )>( ); SERVICE_TABLE_ENTRY dispatchTable[ ] = { { const_cast<char *>( g_sAPP_NAME.c_str( ) ), m_fServiceMain }, { 0, 0 } }; StartServiceCtrlDispatcher( dispatchTable ); } void __stdcall ExampleClass::ServiceMain( DWORD dwArgc, LPSTR *lpszArgv ) { } The error I receive concerns the line m_fServiceMain = f2.target<void ( DWORD, LPSTR * )>( ); error C2440: '=' : cannot convert from 'void (__cdecl *)(DWORD,LPSTR * )' to 'LPSERVICE_MAIN_FUNCTIONA' This conversion requires a reinterpret_cast, a C-style cast or function-style cast LPSERVICE_MAIN_FUNCTIONA is defined in "winsvc.h" and is: typedef VOID (WINAPI *LPSERVICE_MAIN_FUNCTIONA)( DWORD dwNumServicesArgs, LPSTR *lpServiceArgVectors ); Any help or insight would be much appreciated. -Jason

3 2

fruchterman_reingold doesn't like small graphs
by Jamie Wilkinson 14 Mar '05

14 Mar '05

I'm writing an app in which the user incrementally adds vertices to the graph; of course it starts empty, and after each addition the graph is laid out with the fruchterman-reingold function. The algorithm copes well with empty graphs, but once I add a single vertex, the program crashes: the crash is always in the same place, deep in std::list but called from boost/graph/fruchterman_reingold.hpp:116 : buckets[row * columns + column].push_back(*v); The push_back function calls end() to get the last element of the list, and fails. A bit of gdb turned up the following result: columns and rows were both being set to 0 and so buckets was also of size 0. Lines 111:112 also end up setting column and row to 0, and then the next pair of lines were setting them to, on my machine, 4G. The element of buckets being accessed, then, was ridiculously out of bounds. The value width/two_k, once cast to the integral size_t, was always zero. I don't think this is restricted to having a single vertex in the graph, but that case seems to exacerbate the bug. So as a workaround, I've added the following two lines to make sure that the variables columns and rows are at least 1: Index: boost/graph/fruchterman_reingold.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/graph/fruchterman_reingold.hpp,v retrieving revision 1.5 diff -u -r1.5 fruchterman_reingold.hpp --- boost/graph/fruchterman_reingold.hpp 29 Dec 2004 16:53:05 -0000 1.5 +++ boost/graph/fruchterman_reingold.hpp 13 Jan 2005 13:09:00 -0000 @@ -105,6 +105,8 @@ std::size_t columns = std::size_t(width / two_k); std::size_t rows = std::size_t(height / two_k); + if (columns == 0) columns = 1; + if (rows == 0) rows = 1; buckets_t buckets(rows * columns); vertex_iterator v, v_end; for (tie(v, v_end) = vertices(g); v != v_end; ++v) { If you wish to reproduce this bug, you can do so with the example program libs/graph/example/fr_layout.cpp : g++ -Iboost boost/libs/graph/example/fr_layout.cpp echo "A B" | ./a.out 100 100 My results without the patched function: willow% echo "A B" | ./a.out 100 100 0% 10 20 30 40 50 60 70 80 90 100% |----|----|----|----|----|----|----|----|----|----| *zsh: done echo "A B" | zsh: segmentation fault ./a.out 100 100 and patched: willow% echo "A B" | ./a.out 100 100 0% 10 20 30 40 50 60 70 80 90 100% |----|----|----|----|----|----|----|----|----|----| *************************************************** A -41.0322 -29.471 B 1.16969 27.1354

2 1

[wiki] New content filtering to reduce spam
by Jeff Garland 14 Mar '05

14 Mar '05

All - I've instituted a new content filter on the Wiki to try and cut off the spamming without going to a login or other user intrusive mechanism. The timing of this feature turned out to be important as a sophisticated spambot that evades the ip banning strategy by using many different ip addresses (presumably using zombie machines) has been attempting to SPAM the wiki all day today. The new content filter has sucessfully stopped this bot. Note that if a spammer is successful I am now reverting all spam content from the Wiki history so that there is no chance of googlebot finding it. For the moment, I'm not going to publish the regular expressions I'm using to filter, but suffice to say, normal boost content should be unaffected. If you get an error indicating content has been blocked due to spam, send me and email. Thanks, Jeff

1 0

How does Boost.Build/bjam find boost?
by Kelly Burkhart 13 Mar '05

13 Mar '05

Hello, I am starting to fiddle with boost and bjam and am not able to get bjam to find the boost headers and libraries. I'm running SuSE 9.1 and started out using the RPMs. Since last night, one-by-one I've uninstalled the RPMs and replaced with freshly downloaded and build components. Right now I have the latest boost,bjam and boost.build releases. I built boost with --prefix=/opt/boost and installed it. I have boost.build placed in /opt/boost as well. Under my home directory I have a directory in which I'm trying to build a hello-world program. The directory contents: > ls boost-build.jam Jamfile project-root.jam tst.cpp > cat boost-build.jam boost-build /opt/boost/boost-build ; > cat Jamfile exe tst : tst.cpp ; > cat tst.cpp #include <iostream> #include <string> #include "boost/format.hpp" int main() { std::cout << boost::format("%1%, world") % "hello" << std::endl; return 0; } project-root.jam is empty. When I try to build with 'bjam tst' it is not able to find the boost headers, which makes sense, because I've not been able to figure out how to indicate where they live. How is this accomplished? -K

3 9

Boost::regex: Removing Forte CC compiler warnings
by Rajesh Radhakrishnan 13 Mar '05

13 Mar '05

Hi, Any suggestions on removing these compiler warnings (CC: Sun C++ 5.5 2003/03/12 ) : /usr/local/boost_regex/include/boost/type_traits/is_convertible.hpp", line 279: Warning (Anachronism): Type names qualified by template parameters require "typename". "/usr/local/boost_regex/include/boost/type_traits/is_convertible.hpp", line 279: Where: While specializing "boost::is_convertible<boost::From, boost::To>". "/usr/local/boost_regex/include/boost/type_traits/is_convertible.hpp", line 279: Where: Specialized in non-template code. "/usr/local/boost_regex/include/boost/type_traits/is_convertible.hpp", line 279: Warning (Anachronism): Type names qualified by template parameters require "typename". "/usr/local/boost_regex/include/boost/type_traits/is_convertible.hpp", line 279: Where: While specializing "boost::is_convertible<boost::From, boost::To>". "/usr/local/boost_regex/include/boost/type_traits/is_convertible.hpp", line 279: Where: Specialized in non-template code. Line 279: /usr/local/boost_regex/include/boost/type_traits/is_convertible.hpp BOOST_TT_AUX_BOOL_TRAIT_DEF2(is_convertible,From,To,(::boost::detail::is_convertible_impl<From,To>::value)) -- Regards Rajesh

2 1

MPL - creating new sequence from another sequence using predicate
by Bruce Trask 13 Mar '05

13 Mar '05

Hi, I have a mpl::vector of types. Each of the types in the vector have themselves another nested mpl::vector that is a sequence of enums. I have include the code below. What I am trying to do is take the original sequence and make a new sequence based on the predicate that only elements with certains enums in their nested vector be included in the new sequence. I have included more notes in the embedded comments. I was thinking of using mpl::copy_if but am having trouble getting the predicate right. Wanted to know if anyone could steer me in the right direction. I am trying to fill in the ??? below. I am having trouble writing a custom predicate. Thanks in advance. Regards, Bruce #include <string> #include <iostream> #include <boost/mpl/vector.hpp> #include <boost/mpl/begin_end.hpp> #include <boost/mpl/deref.hpp> #include <boost/mpl/count_if.hpp> #include <boost/mpl/size.hpp> #include <boost/mpl/for_each.hpp> #include <boost/type_traits/is_member_pointer.hpp> #include <boost/mpl/vector_c.hpp> #include <boost/mpl/copy_if.hpp> #include <boost/mpl/less.hpp> #include <boost/mpl/placeholders.hpp> #include <boost/mpl/find.hpp> namespace mpl = boost::mpl; using namespace mpl::placeholders; enum colors { red, blue, green, yellow }; template<typename COLORTYPES> struct TestClass { typedef COLORTYPES colortypes; }; void func() { // come up with a interface to simplify this like vector_c - only it must be able to handle enums - I would think one would already exist typedef mpl::vector< mpl::integral_c<colors,red> , mpl::integral_c<colors,green> , mpl::integral_c<colors,blue> > colorcoll1; typedef mpl::vector< mpl::integral_c<colors,red> , mpl::integral_c<colors,blue> > colorcoll2; typedef mpl::vector< mpl::integral_c<colors,green> > colorcoll3; typedef mpl::vector<TestClass<colorcoll1>, TestClass<colorcoll2>, TestClass<colorcoll3> > testvector; std::cout << " SIZE IS " << mpl::size<testvector>::value << std::endl; // would like to make a new vector from testvector that contains only those types that have green in their nested vector colortypes. //In other words, go from testvector which has three types to a vector that only has TestClass<colorcoll1> and TestClass<colorcoll3> // typedef mpl::copy_if<testvector, ???? >::type testvectorwithgreen; // I can do it successfully when operating directly on the container as below, but am having trouble deterimining the predicate for the above case typedef mpl::vector_c<int, 1,2,3,4,5,6,7,8> intColl; std::cout << mpl::size<intColl>::value << std::endl; typedef mpl::copy_if<intColl, mpl::less<mpl::_1, mpl::int_<5> > >::type newIntColl; std::cout << mpl::size<newIntColl>::value << std::endl; } int main() { func(); return 0; }

3 4

boost::fsm, parameters to DestinationState
by Jan Eickmann 12 Mar '05

12 Mar '05

Hi, when doing a transition using transit<myDestinationState>, I would like to pass some parameters to myDestination. Problem is, those parameter-values will not be known at compile time, so I can't just pass them in as template-parameters to myDestinationState. Of course I could just set some global (or static member member) variable and read that from myDestinationState's constructor but this doesn't feel like a very clean design. Any suggestions? Jan Eickmann

2 6

base64->wstring decoding
by Stefan Strasser 12 Mar '05

12 Mar '05

Hi, I need to write a std::wstring which can contain binary data like \0 to a xml attribute, so I'm converting it to base64 but I have problems decoding it: typedef transform_width<binary_from_base64<std::string::const_iterator>,32,6> decode; std::wostringstream out; std::copy(decode(in.begin()),decode(in.end()),std::ostream_iterator<wchar_t,wchar_t>(out)); is this a correct way to decode base64? it works, but only if (bits % 6 == 0). otherwise the program is abort()ed due to an exception. the string was encoded by base64_from_binary<transform_width<std::wstring::const_iterator,6,32> > Thanks, -- Stefan Strasser

2 2

question on using BOOST_FOREACH with non-stl container
by Michael W Daniels 12 Mar '05

12 Mar '05

In experimenting with the new BOOST_FOREACH header, I'm getting the compile error (MSVC 7.1) below with this code. The documentation for BOOST_FOREACH says: >The support for STL containers is very general; anything that looks like >an STL container counts. If it has nested iterator and const_iterator >types and begin() and end() member functions, BOOST_FOREACH will >automatically know how to iterate over it. I've checked, and the hashed_array_tree class does have nested iterator and const_iterator types, as well as begin() and end() member functions. (It's originally from www.cphstl.dk, but that site no longer provides the code.) Replacing hashed_array_tree with vector gets rid of the error, so there's obviously something I need to fix in the hashed_array_tree. How do I figure out what that is, though? Any help will be greatly appreciated. ===code=== #include <memory> #include <iostream> #include "foreach.hpp" #include "math_utils.hpp" #include "hashed_array_tree.hpp" #include "hat_iterator.hpp" using namespace std; using namespace boost; using namespace cphstl; class A { public: int foo; }; void test() { const hashed_array_tree<const A*>* Ahat = new hashed_array_tree<const A*>(); BOOST_FOREACH(const A* curA, *Ahat) cout << curA->foo; } ====== ==error== e:\Projects\gidlp\fsparser\foreach.hpp(455) : error C2440: 'return' : cannot convert from 'const std::allocator<_Ty>::value_type' to 'boost::iterator_reference<Iterator>::type' with [ _Ty=const A * ] and [ Iterator=boost::range_const_iterator<cphstl::hashed_array_tree<const A *>>::type ] Conversion loses qualifiers e:\Projects\gidlp\fsparser\test2.cpp(20) : see reference to function template instantiation 'boost::iterator_reference<Iterator>::type boost::for_each::deref<cphstl::hashed_array_tree<T>,boost::mpl::true_>(boost::for_each::static_any_t,boost::for_each::container<cphstl::hashed_array_tree<T>,C>)' being compiled with [ Iterator=boost::range_const_iterator<cphstl::hashed_array_tree<const A *>>::type, T=const A *, C=boost::mpl::true_ ] ====== -- Michael W. Daniels | Choreography is its own reward. daniels(a)ling.osu.edu | Some things are done only for the sake Doctoral Candidate | of form. Don't fight it by looking for Department of Linguistics | substance in everything.

3 6

boost::threads is it all about managed threads?
by The Grumpiest Man You Know 11 Mar '05

11 Mar '05

I realize I might be trying to read beyond my experience level but I am having a blast and might even be getting somewhere learning a new programming style, a little. :) So, I've been looking at boost::threads and pthreads while considering a problem. I was never a believer in threads, I come from an SMP background and always found that for what I wanted to do, async IO beat the pants off threads. Not that I want to start a war, just that I want to explain why I'm happy with concurrent programming but a complete nonce case when discussing thread programming. I have an application in mind for comparison and it's not particularly complex but it's a monster in LOC, mainly due to the liberal use of FORTRAN in whatever language the compiler happens to take. But one of the things it does have, that I'd rather not re-implement, is a request service library. That library picks up an incoming request, goes and carries out the action and then returns the result. The requests are of unbounded duration and there are multiple clients so the service times are pretty sad. I think that sounds like a job for threads; no need to alter the service code, just replace the routine that returns the results and bob's your mum's brother and I can get 10 at a time all sleeping waiting for the requested IO. But to not scare the natives I'd prefer to have a single thread unless the load actually demands more. Now, my old C brain can see that the main thread can get it's thread ID from thread_self() and then just be one of the guys but I can't see how the boost::thread() can do anything but give me threads to manage. After stepping on myself with a vector<boost::thread> :) I think this is the tao of boost::thread: const boost::function0<void> run = &go; boost::thread_group grp; for(int i = 0; i < 100; i++) { grp.create_thread(go); } grp.join_all(); Is that right? What am I missing? How do I get a bunch of peer boost::threads? If you're still with me thanks very much for your time and help and let me know if I'm dragging the list off topic and I'll go find someone else to bug. -- Blue Skies

3 4

RE: [Boost-users] __stdcall with boost::function
by Olenhouse, Jason 11 Mar '05

11 Mar '05

Ben Hutchings wrote: > Olenhouse, Jason wrote: > > I'm trying to pass a member function pointer around to the Windows > > Service Control Manager through Windpws API functions, but > > I think I'm having troubles with the __stdcall convention. > <snip> > > No, the problem is passing a member function pointer. A > member function > pointer is not type-compatible with a function pointer with the same > parameter types, regardless of whether they have the same calling > convention. <snip> But I used boost::bind to get a function pointer to hide the implicit this. I thought that the purpose of boost::bind was for that reason. It seems that the way I did it was nearly successful other than function::target<>() returns a __cdecl function pointer instead of an __stdcall one, as indicated by the error that MSVC returns. Is my interpretation of what I'm seeing incorrect? BTW, I included the two defines, #define BOOST_BIND_ENABLE_STDCALL #define BOOST_MEM_FN_ENABLE_STDCALL to be able to bind __stdcall member function with the this object pointer (I forgot to mention this in the original post). -Jason

2 1

Re: Re: Serialization, multiple inheritance, bad cast at smart_cast.hpp:202
by Zoltan Szatmary 11 Mar '05

11 Mar '05

Dear Robert thank you for answering. > > class A > > class B : public A > > class C : public virtual B > > class D : public virtual B > > class E : public C, public D > > > > so, a classic diamond inheritance which the serialization lib is > > supposed to be able to tackle with. Now, if I have a piece of code > > like this > > > > boost::serialization::xml_oarchive oa(somestream); > > A *a = new E(); > > oa << BOOST_SERIALIZATION_NVP(a); > > > > it throws exception at the aforementioned line. Examining the template > > substitutions, template class T is substituted with const B* and > > template class U is substituted with const A. So, the program should > > do a downcast on a const A* to const B* which is ought to be possible. > > Your example does indicate whether A has any pure virtual functions or not. > The dynamic down cast will only function if A is polymorphic - that is has > at least one virtual function. Soooo, I would expect this work if A has at > least one virtual function and I would expect it to fail if has no virtual > function. Double check this and get back to us. Yes, A does have a virtual destructor. But originally A had more virtual member functions, I just trimmed them down when I wanted to locate the source of error. But yes, class A is still polymorphic. I try to attach the example code to this mail, I hope it will get through. Best regards Zoltan

1 0

when to use libboost_xxx-mt ?
by Oliver Kowalke 11 Mar '05

11 Mar '05

Hello, afaik '-mt' stands for multithreading. Do I've to link against the '-mt' version of a boost library if my application is single threaded but uses external libs which internally span threads? Could you be so kind to give me a generall guideline? thx Oliver -- SMS bei wichtigen e-mails und Ihre Gedanken sind frei ... Alle Infos zur SMS-Benachrichtigung: http://www.gmx.net/de/go/sms

3 2

Serialization, multiple inheritance, bad cast at smart_cast.hpp:202
by Zoltan Szatmary 11 Mar '05

11 Mar '05

Dear all I use the serialization library of boost, and I am very satisfied with it except one annoying issue. It turns out, that in many cases (not always!!!) when there is a multiple inheritance structure in the class hierarchy I am trying to serialize I get a std::bad_cast exception at line 202 in smart_cast.hpp. The corresponding boost code is: template<class U> static T cast(U * u){ T tmp = dynamic_cast<T>(u); #ifndef NDEBUG if ( tmp == 0 ) throw std::bad_cast(); #endif return tmp; } I have debugged it, and I could not really find out what the problem was. For example I have a class hierarchy similar to this: class A class B : public A class C : public virtual B class D : public virtual B class E : public C, public D so, a classic diamond inheritance which the serialization lib is supposed to be able to tackle with. Now, if I have a piece of code like this boost::serialization::xml_oarchive oa(somestream); A *a = new E(); oa << BOOST_SERIALIZATION_NVP(a); it throws exception at the aforementioned line. Examining the template substitutions, template class T is substituted with const B* and template class U is substituted with const A. So, the program should do a downcast on a const A* to const B* which is ought to be possible. The funny thing is, that the error does not always appear! I could put together a simple example code demonstrating this effect, but I am not sure that attachments to this mail get through the list server, so anybody kind enough to take a look at this problem can ask me to send him/her the example code. I have tested the example code both with Intel C++ compiler v8.1 and G++, so I concluded this may not be a compiler error but rather some boost flaw. Any help is warmly welcome and thanked in advance! Cheers Zoltan

2 1

PC-Lint and boost 1.32.0
by Jarl Lindrud 10 Mar '05

10 Mar '05

Hi! Is anyone here running PC-Lint successfully on projects using Boost 1.32.0 ? When I run it (PC-Lint 8.00q), it winds up in an infinite loop while processing some headers from boost/mpl. There's a note about it on Gimpel's discussion boards, but no responses from them, unfortunately... Is anyone else having this problem? TIA! /Jarl

1 0

Boost threads libraries? linking problem and question
by Roger Wilco 10 Mar '05

10 Mar '05

I have a large (at least non-trivial) C++ application that uses Boost threads. I am now trying to get it building as a Managed C++ (aka C++ .NET) application. The original unmanaged MFC application used the following import library: ..\boost\boost_1_32_0\bin\boost\libs\thread\build\boost_thread.dll\vc-7_1\release\threading-multi\boost_thread-vc71-mt-gd-1_32.lib The managed C++ Forms application requires that AND a second library which seems to be a static library and not an import library for a DLL: ..\boost\boost_1_32_0\bin\boost\libs\thread\build\libboost_thread.lib\vc-7_1\debug\runtime-link-static\threading-multi\libboost_thread-vc71-mt-sgd-1_32.lib It seems wrong that I need two Boost thread libraries to build with. Hoewver, my project won't build without both. There are apparently some #pragma-like instructions in the Boost source that trigger the linking of these libraries. If I do link with both Boost thread libraries, the project builds but gets bizarre exceptions at runtime that are buried in non-debuggable code. What is the difference between those Boost libraries? Which one is the one that I want? How can I stop the linker directives in the code from including the library that I shouldn't be using?

2 1

Re: boost::bind problems with __cdecl and MSVC
by Daniel Boelzle 10 Mar '05

10 Mar '05

Hello Peter, > This can only happen if your default calling convention is something > other than __cdecl. This is very rare and boost::bind does not provide > explicit support for __cdecl, relying on it being the default. I am not forcing any specific calling convention: no /Gz (stdcall), /Gr (fastcall), nor /Gd (__cdecl) on my command line. MSDN documents that __cdecl is the default for vararg member functions, but thiscall for non-vararg member functions. The reason for decorating member functions with __cdecl is to get independent of the above mentioned switches when including those header files (thiscall cannot be specified, no keyword). regards, --Daniel

2 4

Boost Unit Test with VC 7.1
by DrJekyll 09 Mar '05

09 Mar '05

Dear list member I have the problem with Unit Test. I am just creat new project file and copy the code from the start page http://www.boost.org/libs/test/doc/components/utf/getting_started/index.html but it does not compiled. I think the problem come from the work space configuration but I dont know exactly which point. Could someone share with me his experience on this matter? Best regards XS

2 1

[Foreach] Trouble iterating over Boost.MultiIndex containers
by Eelis van der Weegen 09 Mar '05

09 Mar '05

I'm having trouble using BOOST_FOREACH to iterate over Boost.MultiIndex containers. I've attached a testcase, which fails to compile because of what looks like an ADL collision between range_iterator's end() and boost::mpl::end. I'm using GCC 3.4.2 with foreach.hpp revision 1.22 from the sandbox. Others have reported that GCC 4.0.0 20050130 is also affected. (I'm aware that BOOST_FOREACH isn't part of Boost yet, but it's in the review queue so I thought posting this here was appropriate.) Regards, Eelis #include <boost/multi_index/sequenced_index.hpp> #include <boost/multi_index_container.hpp> #include <boost/foreach.hpp> namespace mi = boost::multi_index; typedef boost::multi_index_container<int, mi::indexed_by<mi::sequenced<> > > C; void f (C const & c) { for (C::const_iterator i = c.begin(); i != c.end(); ++i) { int r = *i; } // ok BOOST_FOREACH(int r, c) {} // errors }

9 54

boost::bind problems with __cdecl and MSVC
by Daniel Boelzle 09 Mar '05

09 Mar '05

Hello, I have problems using wonderful boost::bind with __cdecl member functions like the following: #include <boost/bind.hpp> struct S { void __cdecl foo( int ); }; void bar() { S s; int const n = 5; boost::bind( &S::foo, &s, _1 )( n ); } ... error C2825: 'F::result_type': cannot form a qualified name ... I am using MSVC Version 13.10.3077 and boost 1.32.0. I know there is already a way to use stdcall, so does anybody see a solution for __cdecl? thanks for any help, regards, --Daniel

3 2

[filesystem] VC 8.0, AMD64
by Cory Nelson 09 Mar '05

09 Mar '05

I'm using the March 2005 CTP beta of VS2005, and building for AMD64. I'm getting these errors with filesystem (fresh from CVS): boost\config\abi_prefix.hpp(19) : error C2220: warning treated as error - no 'object' file generated boost\config\abi_prefix.hpp(19) : warning C4103: 'boost\config\abi_prefix.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) boost\filesystem\path.hpp(20) : warning C4103: 'boost\filesystem\path.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) boost\config\abi_suffix.hpp(20) : warning C4103: 'boost\config\abi_suffix.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) boost\filesystem\path.hpp(170) : warning C4103: 'boost\filesystem\path.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) boost\config\abi_prefix.hpp(19) : warning C4103: 'boost\config\abi_prefix.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) boost\filesystem\fstream.hpp(21) : warning C4103: 'boost\filesystem\fstream.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) boost\config\abi_suffix.hpp(20) : warning C4103: 'boost\config\abi_suffix.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) boost\filesystem\fstream.hpp(190) : warning C4103: 'boost\filesystem\fstream.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) -- Cory Nelson http://www.int64.org

2 1

Re: Re: boost::program options question. Implicit()
by Alexis H. Rivera-Rios 09 Mar '05

09 Mar '05

>I think it's the library. But in any case, I plan to >remove the >'implicit' >flag in 1.33. Why do you want it? What about: > > desc.add_options() > ("debug", bool_option(), "enable debugging") > >? >- Volodya Why do I wanted? No special reason, I was learning to use the library and got stuck on that one. The code didn't do what the documentation said it should do. I wasn't aware of the bool_option. Will that let me do something like myprogram --debug or will I have to do something like myprogram --debug=1 ? Thanks, Alexis Programming Tutorial: In Python: To do this, do this In Perl: To do this, do this or this or this or this... In C: To do this, do this, but be careful In C++: To do this, do this, but don't do this, be careful of this, watch out for this, and whatever you do, don't do this __________________________________ Celebrate Yahoo!'s 10th Birthday! Yahoo! Netrospective: 100 Moments of the Web http://birthday.yahoo.com/netrospective/

2 1

[Boost-users] Re:[Foreach]TroubleiteratingoverBoost.MultiIndexcontainers
by Arkadiy Vertleyb 09 Mar '05

09 Mar '05

Thorsten, I admit that my understanding of the problem was too simplistic, and apologize for being judgmental. (although I still think ADL-based solutions should be avoided, if only because of the GCC issue. Or, the GCC support should not be claimed) Regards, Arkadiy

6 18

indirect_iterator of reverse_iterator
by Thomas Matelich 08 Mar '05

08 Mar '05

Hello, I'm a little behind the times and am trying to port my old iterator_adapters code to use the new library (1.32). We have a class which is little more than a wrapper around a vector<shared_ptr<T> >, and I am having a heck of a time with setting its typedef for reverse_iterator and const_reverse_iterator. I just can't get const_reverse_iterator to do assignment and comparison with reverse_iterator. I've tried to make indirect_iterators out of the native reverse iterators, using boost::reverse_iterators of indirect_iterators, and a number of more complicated combinations of the 3. No matter which I try I get errors about the const_reverse_iterator not playing nicely with the reverse_iterator. I think I've read everything on the list archives about indirect_iterator, but perhaps I missed something. I'm going to try my code on g++ (currently using VC 7.1) and then work on a complete example, but I thought I'd throw this out and see if someone can quickly answer it. Thanks, Tom

2 6

Trouble converting johnson_all_pairs to use file IO.
by David E. Konerding DSD staff 08 Mar '05

08 Mar '05

Hi folks, I'm trying to convert the Boost Graph Library example from a graph built in the code, to one that usses the adjacency_list_io supporto load the graph from a file. I was able to convert the dijkstra example this way, and had no problems. I'm getting a weird error when I disable GRAPH_CODE (this example is very close to the true example in the boost source distribution): test.cpp: In function `int main(int, char**)': test.cpp:44: no matching function for call to `johnson_all_pairs_shortest_paths (main(int, char**)::Graph&, int[V][V], boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>)' Here's the actual code;l anybody have suggestions? #include <boost/config.hpp> #include <fstream> #include <iostream> #include <iomanip> #include <vector> #include <boost/property_map.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adjacency_list_io.hpp> #include <boost/graph/johnson_all_pairs_shortest.hpp> int main(int argc, char **argv) { using namespace boost; typedef adjacency_list<vecS, vecS, directedS, no_property, property< edge_weight_t, int, property< edge_weight2_t, int > > > Graph; typedef std::pair < int, int >Edge; #if defined GRAPH_CODE const int V = 5; Edge edge_array[] = { Edge(0, 1), Edge(0, 4), Edge(0, 2), Edge(1, 3), Edge(1, 4), Edge(2, 1), Edge(3, 2), Edge(3, 0), Edge(4, 3) }; const std::size_t E = sizeof(edge_array) / sizeof(Edge); Graph g(edge_array, edge_array + E, V); property_map < Graph, edge_weight_t >::type w = get(edge_weight, g); int weights[] = { 3, -4, 8, 1, 7, 4, -5, 2, 6 }; int *wp = weights; graph_traits < Graph >::edge_iterator e, e_end; for (boost::tie(e, e_end) = edges(g); e != e_end; ++e) w[*e] = *wp++; #else std::ifstream graph_in(argv[1]); Graph g; graph_in >> read( g ); const int V = num_vertices(g); #endif std::vector < int >d(V, (std::numeric_limits < int >::max)()); int D[V][V]; johnson_all_pairs_shortest_paths(g, D, distance_map(&d[0])); return 0; }

2 1

regex: JavaScript RegEx to boost::regex conversion
by pps 08 Mar '05

08 Mar '05

Hello, I have problem creating case less, global match and multi line regexes in boost and I'd like to ask for a few examples of equivalent (Javascript's RegEx <-> boost::regex) regex test js: string.match( /^abc/ ) string.match( /^abc/i) string.match( /^abc/g) string.match( /^abc/m) c++ regex_match(string, regex("^abc"), match_default) regex_match(string, regex("^abc"), match_default | icase) // <- is it correct? regex_match(string, regex("^abc"), ?? ) //global match? regex_match(string, regex("^abc"), ?? ) //multi line? also I'd like to ask what are the proper namespaces/typedefs/enums I have to use for match flags (for example, there's boost::regex_constants::icase and boost::regex::icase etc...) Thank you

2 2

bjam: rule SubInclude unknown in module Jamfile
by Andre Stechert 08 Mar '05

08 Mar '05

Hi, I'm trying to make pmade software's netxx package available via darwinports, but I'm running into some trouble from bjam. In particular, while doing the build, bjam fails like this: ... DEBUG: Assembled command: 'cd "/Users/andrestechert/darwinports/dports-local/devel/netxx/work/netxx -0.4.2" && NETXX_JAM=bjam MACOSX_DEPLOYMENT_TARGET=10.3 bjam --prefix=/opt/local -sTOOLS=darwin -sBOOST_BUILD_PATH=/opt/local/share/boost-build/' Jamfile:4: in modules.load rule SubInclude unknown in module Jamfile</Users/andrestechert/darwinports/dports-local/devel/netxx/work/ netxx-0.4.2>. /opt/local/share/boost-build/build/project.jam:255: in load-jamfile /opt/local/share/boost-build/build/project.jam:67: in project.load /opt/local/share/boost-build/build-system.jam:75: in load /opt/local/share/boost-build//kernel/modules.jam:259: in import /opt/local/share/boost-build//kernel/bootstrap.jam:120: in boost-build /opt/local/share/boost-build//boost-build.jam:1: in module scope ... I can't find any related bugs in the archive and strings `which bjam` | grep SubInclude yields: rule SubInclude which indicates to me that jambase.c is properly including SubInclude into the bjam binary. Anyone have a hint as to why bjam wouldn't be able to find the SubInclude rule? Apologies if this is a newbie question, this is my first adventure with boost.jam... Thanks in advance, Andre

3 3

segfault in boost program options when using gcc 4.0
by Stephen Torri 07 Mar '05

07 Mar '05

I am testing out gcc 4.0 with an application that I am building. I found that there is a segfault in the command line parser for boost program options. While I understand that boost has yet to officially support gcc 4.0 I want to alert the developers to a potential problem. Ofcourse this needs to be investigated to ensure that the compiler is not the cause of the error. If it is then I can forward the test program attached along with the boost developer's response to the gcc developers. --------- G++ compiler ------------ bash-2.05b$ /usr/local/bin/g++ -v Using built-in specs. Target: i686-pc-linux-gnu Configured with: ../gcc/configure : (reconfigured) ../gcc/configure Thread model: posix gcc version 4.0.0 20050226 (prerelease) ---------- Boost version ------------- boost 1.32-r1 (Gentoo 2004.3 profile) --------- Program backtrace --------- Program received signal SIGSEGV, Segmentation fault. __gnu_cxx::__pool<true>::_M_reclaim_block (this=0x80518c0, __p=0x80555d8 "", __bytes=0) at mt_allocator.cc:222 222 const size_t __which = _M_binmap[__bytes]; Current language: auto; currently c++ (gdb) bt #0 __gnu_cxx::__pool<true>::_M_reclaim_block (this=0x80518c0, __p=0x80555d8 "", __bytes=0) at mt_allocator.cc:222 #1 0x0804bf97 in __gnu_cxx::__mt_alloc<std::string, __gnu_cxx::__common_pool_policy<__gnu_cxx::__pool, true> >::deallocate () #2 0x0804bfc1 in std::_Vector_base<std::string, std::allocator<std::string> >::_M_deallocate () #3 0x0804bff9 in std::_Vector_base<std::string, std::allocator<std::string> >::~_Vector_base () #4 0x0804c0a6 in std::vector<std::string, std::allocator<std::string> >::~vector () #5 0x0804c0e5 in boost::program_options::common_command_line_parser::~common_command_line_parser () #6 0x0804c13b in boost::program_options::basic_command_line_parser<char>::~basic_command_line_parser () #7 0x0804e0a3 in boost::program_options::parse_command_line<char> () #8 0x0804a5c2 in main () (gdb) quit Stephen

1 0

boost::unary_traits
by Matthias Kaeppler 07 Mar '05

07 Mar '05

Hello, I have written an adaptor for functions and function objects which allows to invoke operations on the pointees when working on a collection of pointers. For example, it allows to sort a list of pointers by a predicate applying to the pointees. To make it work with normal functions and functors, I utilized boost::unary_traits and boost::binary_traits. This is the class template for the unary version: template< typename Operation > class indirecter_unary : public std::unary_function< typename boost::unary_traits<Operation>::argument_type, typename boost::unary_traits<Operation>::result_type > { typedef typename boost::unary_traits<Operation>::argument_type arg_type; typedef typename boost::unary_traits<Operation>::param_type param_type; typedef typename boost::unary_traits<Operation>::result_type result_type; typedef typename boost::unary_traits<Operation>::function_type function_type; function_type op_; public: explicit indirecter_unary( param_type op ): op_(op) {} result_type operator() (arg_type *arg) const { return op_(*arg); } }; Now, the problem arises when I pass a function which takes references. Like this: bool pred( int& a ) { //... } indirecter_unary< bool ()(int&) > fctor(pred); ext::indirecter_unary<bool ()(int&)>': code/FileBrowser.cpp:90: instantiated from here code/ext/indirect.hpp:80: error: forming pointer to reference type `int&' Line 80 is the line where operator() is defined. The error message indicates that argument_type is obviously not correct in this context. I thought the boost traits would take care of the right argument types? Am I missing something? -- Matthias Kaeppler

4 10

Safe downcast of a shared_ptr?
by steve ahlgren 07 Mar '05

07 Mar '05

Hello : Is there safe/easy way to downcast shared pointers? ie boost::shared_ptr< Derived_Type > dPtr = [appropriate_method_here] ( base_ptr ); Thanks in advance; Steve a.

3 2

[regex] Is there any function to know where the input fails to match a regex?
by jordi 07 Mar '05

07 Mar '05

Hello, Maybe my question is a silly question but I have a recurrent problem and maybe there is an easy solution: I need to create a lot of regex expressions to match several Unix command outputs. Usually, my firsts regex definitions are wrong and they don't match, so when the match fails I would like to know where the "problem" is (more or less) in order to change the regular expression. For example: Input text: "123 hello abc" My first wrong Regex: "(\d)+\s+(\w)+\s+(\d)+" If I try to match this input against the regex using regex_search with the boost::match_continuous flag I only have the false value returned by the function but it doesn't help me to know that the "123 hello" matched the regex because the problem starts at "abc" trying to match "(\d)+". I can simulate what I need checking subexpressions adding every iteration a new "sub-regex" and stopping when the match fails (I do it manually, changing the regex). With my undefined funtion I would obtain: - Input text:"123 hello abc" - Latest rigth Regular expression: "(\d)+\s+(\w)+\s+" Matches: "123 hello " - First wrong regex: "(\d)+\s+(\w)+\s+(\d)+" does not match. -> So, "(\d)+" does not match "abc" I understand that usually this is not as easy as I write in my simple example because of the power of regular expressions but I think a function like that would improve a lot the error reporting capabilities. Is there any way to do what I need or I must to write my own check function? Best regards, Jordi

4 7

Borland compiler error E2437
by Roman Morokutti 07 Mar '05

07 Mar '05

Hi, I am not able to compile function_base.hpp at lines 595(55), 607(55), 616(55), 625(55). Error E2437 D:\boost\boost_1_32_0\boost/function/function_base.hpp 598(55): 'typename' should be followed by a qualified, dependent type name Does anyone know a workaround for this? Greetings Roman

2 1

Problems using boost-regex after being compiled as non root.
by Javier-Elias Vasquez-Vivas 07 Mar '05

07 Mar '05

3 3

RE: [Boost-users] Re: Q: boost::format : can formatting variablea rguments lists be done ?
by Foster, Gareth 07 Mar '05

07 Mar '05

Could you do Logger<DBG> MyLogger; MyLogger.print(); ? -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Dan Dimerman Sent: 22 December 2004 13:03 To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: Q: boost::format : can formatting variablearguments lists be done ? Richard Howells wrote: > Vladimir is right. > > You've seen the problems and crashes that leaving type checking to the > programmer causes. You need the compiler to do the checking for you. > > I suggest using the same kind of scheme as the iostreams library. You might /.../ > ...it will be (mostly) type safe - the type dangerous stuff is isolated to > one place per output type - and you can extend it as you go. You'll likely > need extra formatting stuff and that's where boost::format may help you. > I was thinking about something like: MyLogger::print( const boost::format& f ) and since all format's operator %() return a boost::format, I could with this single function reap all the types handled by it at once. I use a function rather than the operator << because they are actually template functions, with the parameter being the severity. So for _DEBUG versions, the MyLogger::print< DBG >() function instantiates to a proper call to print, while in _RELEASE versions it instantiates to an empty function. I just didn't see a clean way to do this with operators. Dan _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

3 2

Re: Logo Contest: Send In Your votes!
by Joel de Guzman 07 Mar '05

07 Mar '05

Hi, I have to apologize to Mike Mangone. For some reason, I missed his submission dated Feb 16. For those who voted already, please check out his entry (no. 99). If you find his entry compelling, I am willing to make corrections to my tally if any of you wish to resend your votes. Again, pardon me for this slip. http://boost.org/more/logo_contest.htm Send your votes to: boost.logo.contest(a)gmail.com Kind Regards, -- Joel de Guzman http://www.boost-consulting.com http://spirit.sf.net

1 0

Serialization library and memory issues
by Mike Lapshin 06 Mar '05

06 Mar '05

Hello Boost-users, I'm trying to save a simple class to xml_woarchive: class StringContainer { std::map<std::string, std::wstring> mStrings; friend class boost::serialization::access; template<class TArchive> void serialize(TArchive& ar, const unsigned int version) { ar & BOOST_SERIALIZATION_NVP(mStrings); } public: typedef std::map<std::string, std::wstring> StringMap; StringContainer() {} ~StringContainer() {} void addString (const std::string& id, const std::wstring& str); bool isStringExists (const std::string& id) const; const std::wstring& getString(const std::string& id) const; void removeString (const std::string& id); }; // somewhere in main code: StringContainer sc; sc.addString("fps.profilerfl", L"FPS: "); sc.addString("triangles.profilerfl", L"Triangles: "); std::wofstream outfs("strings.xml"); assert(outfs.good()); boost::archive::xml_woarchive oa(outfs); oa << BOOST_SERIALIZATION_NVP(sc); But somewhere after it (i think it is in xml_woarchive destructor) my program falls with "Debug Assertion Failed" (I'm using VC7.1) message: HEAP[test.exe]: Invalid Address specified to RtlValidateHeap( 011B0000, 011F29E8 ) Unhandled exception at 0x77f767cd in test.exe: User breakpoint. By the way, xml file writes as expected: <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="3"> <sc class_id="0" tracking_level="0" version="0"> <mStrings class_id="1" tracking_level="0" version="0"> <count>2</count> <item class_id="2" tracking_level="0" version="0"> <first>fps.profilerfl</first> <second>FPS: </second> </item> <item> <first>triangles.profilerfl</first> <second>Triangles: </second> </item> </mStrings> </sc> </boost_serialization> What i'm doing incorrectly? -- Mike Lapshin

2 2

boost::threads Am I on the right track?
by The Grumpiest Man You Know 06 Mar '05

06 Mar '05

I've had a minor epiphany, or at least I think so, in use of boost::threads. I would be very grateful if someone who actually knew something about C++ and boost's threads support would glance at the attached code. Any comment would be appreciated especially if there's sign that I'm horribly misusing the scraps I've picked up. I have to say that once I stopped trying to relate the pthreads C API to the bits of the docs I could understand my reaction was, "Sweet!" I think the way the threading and locking "disappear" is ... really elegant. Thanks very much for your time and again if I'm OT please tell me where to go, even if it is to hell. :) ------------ #include <iostream> #include <vector> #include <queue> #include <boost/thread/thread.hpp> #include <boost/function.hpp> using namespace std; using namespace boost; mutex::mutex io; struct Throttle { Throttle(void (*fn)(), int svcQLen = 5) : population(1), load(0), acceptable(svcQLen), service(fn) { }; ~Throttle() { cout << "load is " << load << endl; cout << "Population " << population << endl; } void itsBusy() { mutex::scoped_lock myPermission(use); if (++load > acceptable) { workers.create_thread(service); population++; load = 0; }; }; void observe() { workers.join_all(); }; private: mutex use; int population; int load; int acceptable; void (*service)(); thread_group workers; }; template <class T> struct RequestQ : public queue<T> { typedef T value_type; typedef queue<T> cBase; bool empty() { mutex::scoped_lock permit(use); return cBase::empty(); } value_type pop() { mutex::scoped_lock permit(use); value_type it = cBase::front(); cBase::pop(); mutex::scoped_lock doing(io); cout << "Q -> " << it << endl; return it; } void extend(unsigned int by) { mutex::scoped_lock permit(use); value_type next; if (cBase::empty()) { next = 0; // Yeah, assumes integral type conversion } else { next = cBase::back(); } while(by--) { push(*new value_type(++next)); } } private: void push(const value_type& it) { mutex::scoped_lock doing(io); cout << "Q <- " << it << endl; cBase::push(it); } mutex use; }; /* * We have to initialise this before creating any threads but that's * OK 'cos this IS the way we'll create threads. */ Throttle *manager; RequestQ<int> jobs; void go() { for(int range = 0; !jobs.empty(); range = 0) { int mine = jobs.pop(); if (!jobs.empty()) { manager->itsBusy(); } { mutex::scoped_lock doing(io); bool term = false; if (!(mine % 3)) { cout << "fizz "; range=1; term = true; } if (!(mine % 5)) { cout << "buzz "; range += 1; term = true; } if (!(mine % 7)) { cout << "pop! "; range = 0; term = true; } if (!(mine % 11)) { cout << "puff"; range = 2 * (range + 1); term = true; } if (term) { cout <<endl; } } if (range) { jobs.extend(range); sleep(range); } } } int main(int argc, char **argv) { manager = new Throttle(&go); jobs.extend(argc * 10); go(); manager->observe(); delete manager; } -- Blue Skies

1 0

boost serialization linking problems with certain binutils
by Daniel Goller 05 Mar '05

05 Mar '05

hi, im looking for feedback as well as a possible fix for boost serialization with binutils >2.15.90.0.* with binutils 2.15.90.0.* the boost serialization demo links properly with newer (stable on gentoo) binutils we see a myriad of gnu linkonce errors from the linker so i would like to know if anyone here can link the serialization demo.cpp with 2.15.92.* binutils if yes on which distro and the exact version of the binutils better yet, i would like to know how i can build boost serialization also as a shared lib, as none of the other libs which exist in shared and static version have problems with linking with 2.15.92.* bintuils thank you in advance for your input and help Daniel

2 4

Tricky lambda usage?
by Jason House 05 Mar '05

05 Mar '05

"In a nutshell" one can do the following: for_each(a.begin(), a.end(), std::cout << _1 << ' '); (where a is something like std::list<int>) Is there any trick to print out something like std::map<std::string, std::list<int> > ?

3 2

[Foreach]VC70 problem
by Martin 04 Mar '05

04 Mar '05

Just wanted to say that VC70 got problems with BOOST_FOREACH. Apparantly an internal compiler bug sometimes generates the wrong code and causes a "Run- Time check failure #2 - Stack around ... was corrupted". It has happened to me twice now in completly different contexts. In both cases there is no problem if I compile with VC71 or if I replace BOOST_FOREACH with a normal for loop. Unfortunatly I can't find any small example which reproduces the problem. In both cases I can see in the debugger that code uses the wrong stack offset for a local variable.

2 1

make_variant_over an mpl::vector: Compilation fails on gcc
by Johannes Dahlström 04 Mar '05

04 Mar '05

I ran into a bizarre problem trying to build a variant from an MPL vector. The compilation of make_variant_over seems to fail when given any vector which a) uses all its template arguments, and b) contains *only* user-defined types; ones with at least one built-in type work fine! The problem occurs at least with gcc 3.3.5 and gcc 3.4.4 20050203 prerelease, on Debian unstable/x86. The following code demonstrates the problem: //////////////////////////////////////////////////////////////////////// #include <boost/variant.hpp> #include <boost/mpl/vector.hpp> #include <cstdio> // a template for generating dummy types template <int i> struct d { }; typedef boost::mpl::vector < d<0>, d<1>, d<2>, d<3>, d<4>, d<5>, d<6>, d<7>, d<8>, d<9> > vector; boost::make_variant_over<vector>::type v; //////////////////////////////////////////////////////////////////////// The same thing happens with vector10 and others, but lists do seem to work correctly, providing a work-around. Swapping any built-in type for any of the d<>'s makes the code above to compile cleanly. I can post the complete compiler error output if you like, but there's rather much of it :p -Johannes

1 0

Any constructor evaluation in compile time?
by Yutaka Leon Suematsu 04 Mar '05

04 Mar '05

Hi everyone, I am new at the excellent Boost library. It is an incredible source of smart techniques and ticks. I would like to ask if there is a way to evaluate, in compile time, the existence of a specific constructor, except from the constructor default and copy constructor (I know the functions has_trivial_constructor and has_trivial_copy from the type_traits library). For example in the following code, I would like to evaluate the existence of both "A(const Config& config)" and " template <class Random> A(const Config& config, Random& random) " constructors. Class A { A(){.} A(const Config& config){.} template <class Random> A(const Config& config, Random random){.} . } Also, I would like to know why and how the has_trivial_constructor works. Thank you in advance for your kindly help. All the best, Yutaka Leon Suematsu.

6 9

uBlas matrix superclass?
by V. C. 04 Mar '05

04 Mar '05

I am considering using the uBlas library. After a couple of days of researching all available matrix packages for C/C++, I have come to the conclusion that it is the best one in terms of support, ease-of-use, performance(relatively speaking) and documentation. >From what I have been able to gather, I can't figure out whether there is any superclass to all the matrices.. I want to be able to have a list of matrices, some of which may be sparse and some dense... What type should that list be? Or is that impossible (at first glance it appears that inheritance is not really supported for efficiency reasons, hence the widespread templatization)... Thanks in advance for any help.

1 0

[Random] Documentation enhancement
by Richard Jennings 04 Mar '05

04 Mar '05

I would like to suggest an enhancement to the documentation for the random library. The documentation for the number generators advises not to construct generators frequently for various reasons. On some platforms there could also be an issue with memory use where the generators are created on the stack. I have used the suggested mt19937 generator that is about 5000 bytes in size on my system. If I create two of these on the stack then I get a crash. I followed the "very quick start" example that creates the generator on the stack and has a variate_generator like this: boost::mt19937 rng; boost::uniform_int<> six(1,6) boost::variate_generator<boost::mt19937, boost::uniform_int<> > die(rng, six); Thus, each instance of variate_generator has a copy of the generator too. The random_demo.cpp works just fine because it uses an alias for the generator: boost::variate_generator<base_generator_type&, boost::uniform_real<> > thus multiple copies of the variate_generator on the stack are fine. I guess what this comes down to is a warning about creating multiple instances on the stack of generators and/or variate_generators where the engine template parameter to variate_generator is a engine rather than a pointer or reference to an engine. Richard

1 0

Program options: terminating parsing.
by The Grumpiest Man You Know 04 Mar '05

04 Mar '05

As context I would like to say that read "The C++ Programming Language" first edition and thought, "That sounds interesting." and then didn't think of it again 'til about a a couple of months ago, when I read Accelerated C++ on the recommendation of a friend and then updated my original copy to the third edition. So I have NO useful C++ experience, please point out even the most obvious things, I really could be that dumb. I have started a non trivial project that I hope will cement some of the things I've read. And that's where boost comes in. I had some success with using boost_filesystem, so I think I am able to extract basic usage out of the documentation but I've failed to find what I'm looking for in program_options. I would really like to parse a line that has the the form: word [options]... nother option-like-non-option-word... so for instance -F after "word" indicates a legitimate value but -F after "nother" shouldn't set or change the value and indeed might not even have a "value" I've been considering producing a class defining operator() to be used as an additional parser that would recognize the second bare word and make all options thereafter into some list for a dummy option, like the file names in the example. However there is mention of allowing multi word options being "not enabled by default" and I thought that the style argument might be the key, but what I've managed to work out from reading a tarball I downloaded of 1_32_0 seems to use style for changing how single words are interpreted. So before I go crazy trying to implement something that sounds easy to say but beyond my ken, is there a method I'm overlooking for terminating the parsing of the command line before the words are all consumed? Thanks for your time, I'll try to be more brief in future. :) -- Blue Skies

3 6

Problems using boost::filesystem
by steve ahlgren 03 Mar '05

03 Mar '05

Hello : I have a question about boost::filesystem::path. My frustration level is growing quickly because I'm getting exceptions when constructing paths such as these : boostfs::path searchPath( "d:/temp", boostfs::native ); boostfs::path searchPath( "d:/temp" ); boostfs::path searchPath( "d:\\temp", boostfs::native ); boostfs::path searchPath( "d:\\temp" ); Looking at the boost test files [at least some of] these appear to be valid. The key seems to be in the method windows_name(...) in path_posix_windows.cpp. This method searches through the array invalid_chars[] which contains "<>:\"/\\|" ... hence the reason why "d:" causes a failure? I've rebuilt the source from the bjam files, tried compiling them into my own code, compiled as a dll etc. to no avail ... Could someone shed some light on this problem before I go even crazier? Thank you kindly in advance; Steve a.

2 1

Lambda question (deferring evaluation)
by Johan Nilsson 03 Mar '05

03 Mar '05

Hi, would it be possible to implement something the following lines using lambda, without having all values referring to the same shared object: ... #include <boost/shared_ptr.hpp> #include <boost/lambda/lambda.hpp> #include <algorithm> #include "Foo.h" ... using namespace boost; using namespace boost::lambda; std::vector<shared_ptr<Foo> > foos(10); std::for_each(foos.begin(), foos.end(), _1 = shared_ptr<Foo>(new Foo)); Thanks // Johan

4 4

BOOST_CHECK_EQUAL and operator<<
by Patrick Mézard 03 Mar '05

03 Mar '05

Hello, I am currently upgrading from boost-1.30.2 to boost-1.32.0 with MSVC 7.1 and I am running into the following issue: BOOST_CHECK_EQUAL requires the elements to be compared to provide an operator<< taking an std::ostream& as first parameter. I always had names lookups problems with that when the operator was provided by the test and not along with the element. Until now, I had the operator defined in "boost" namespace (that's ugly I know) in the test file. It breaks with 1.32.0 because the problematic function (print_log_value) moved deeped into test tools namespaces. Then I try to revert to a normal definition but it does not work either. For instance : //******************************* #include <boost/test/unit_test.hpp> using boost::unit_test::test_suite; namespace testns { struct Test { Test(std::string const& s_) : s(s_) {} bool operator==(Test const& t) const { return s==t.s; } std::string s; }; namespace { std::ostream& operator<<(std::ostream& o, Test const& t) { return o<<t.s; } void free_test_function() { Test t1("test1"), t2("test2"); BOOST_CHECK_EQUAL(t1, t2); } } //namespace } //namespace testns test_suite* init_unit_test_suite( int, char* [] ) { test_suite* test= BOOST_TEST_SUITE( "Unit test example 1" ); test->add( BOOST_TEST_CASE( &testns::free_test_function )); return test; } //*********************** Does not compile and gives me a: C2679: binary 'operator' : no operator defined which takes a right-hand operand of type 'const testns::Test' (or there is no acceptable conversion), the failure being issued by "void boost::test_tools::tt_detail::print_log_value<T>::operator ()(std::ostream &,const T &)" However, if I define operator<< as a public member of testns::Test it compiles. Same thing if I move it outside the anonymous namespace, with or without static linkage. Note these workaround do not work or cannot be applied if the type is declared by a typedef. In this case, I have to define again the operator in namespace boost.test_tools.tt_detail. Is it to be expected ? Is is an ADL issue ? Or something related to MSVC 7.1 ? What is the proper way to do that ? Patrick Mézard

4 9

reverse_iterators for uBLAS sparse matrices
by Nikos Platis 02 Mar '05

02 Mar '05

Hi, I am relatively new to Boost and I find it an excellent C++ library. During my experiments with the library, I tried the sparse matrix classes offered by uBLAS. Unfortunately, I think that reverse_iterators of these classes do not work correctly. Below is my sample code, which demonstrates some problems; the problems are the same with all three sparse matrix classes. I tried it with gcc 3.4.1 on Linux. Any comments would be appreciated. Thanks in advance, Nikos Platis PS. I post here instead of the uBLAS Yahoo Group because I am still waiting for membership approval... ---------------------------------------------------- #include <iostream> #include <boost/numeric/ublas/matrix_sparse.hpp> #include <boost/numeric/ublas/io.hpp> namespace ublas = boost::numeric::ublas; //typedef ublas::sparse_matrix<double> spmd; //typedef ublas::compressed_matrix<double> spmd; typedef ublas::coordinate_matrix<double> spmd; int main() { // Construct a sample sparse matrix spmd M(5, 5); M(0,0) = 11; M(0,2) = 13; M(1,0) = 21; M(1,1) = 22; M(2,2) = 33; M(2,4) = 35; M(3,3) = 44; M(4,0) = 52; M(4,4) = 55; /* OK */ for (spmd::const_iterator1 it1 = M.begin1(); it1 != M.end1(); ++it1) { for (spmd::const_iterator2 it2 = it1.begin(); it2 != it1.end(); ++it2) { std::cout << it2.index1() << " " << it2.index2() << ": " << *it2 << std::endl; } } std::cout << std::endl << std::endl; /* The following does not compile, error about the const reverse iterators for (spmd::const_reverse_iterator1 it1 = M.rbegin1(); it1 != M.rend1(); ++it1) { for (spmd::const_reverse_iterator2 it2 = it1.rbegin(); it2 != it1.rend(); ++it2) { std::cout << it2.index1() << " " << it2.index2() << ": " << *it2 << std::endl; } } std::cout << std::endl << std::endl; */ /* The following compiles but throws bad_index exception */ for (spmd::reverse_iterator1 it1 = M.rbegin1(); it1 != M.rend1(); ++it1) { for (spmd::reverse_iterator2 it2 = it1.rbegin(); it2 != it1.rend(); ++it2) { std::cout << it2.index1() << " " << it2.index2() << ": " << *it2 << std::endl; } } std::cout << std::endl << std::endl; } ---------------------------------------------------- -- ----------------------------------------------------------------------- Nikos Platis e-mail: nplatis(a)di.uoa.gr Department of Informatics tel: +30 210-727-5106 University of Athens fax: +30 210-727-5114 "The empires of the future are the empires of the mind." - W. Churchill -----------------------------------------------------------------------

1 0

boost regex 1.32/VC7.1 compile problem
by frank fu 02 Mar '05

02 Mar '05

I am trying to move my code from vc6.0 to vc71. Here is the part of code using boost regex: boost::wregex ee(L"[E|e],(\\w+),(.+)$"); boost::wcmatch mr; TString value=L"some char"; if (boost::regex_match(value, mr, ee)) { ... } Those code compiled with UNICODE and was ok on vc6.0. But when I compile with VC71, it gives me error c2664: ============ d:\s\AEM\AEM6.0\source\AEMCore\AEMRulesCfgReg.cpp(176): error C2664: 'bool boost::regex_match<std::char_traits<wchar_t>,std::allocator<_Ty>,std::allocator<boost::sub_match<BidiIterator>>,wchar_t,traits,Allocator>(const std::basic_string<_Elem,_Traits,_Ax> &,boost::match_results<std::basic_string<_Elem,_Traits,_Ax>::const_iterator,std::allocator<boost::sub_match<BidiIterator>>> &,const boost::reg_expression<charT,traits,Allocator> &,boost::regex_constants::match_flag_type)' : cannot convert parameter 2 from 'boost::wcmatch' to 'boost::match_results<BidiIterator,Allocator> &' with [ _Ty=wchar_t, BidiIterator=const unsigned short *, traits=boost::regex_traits<wchar_t>, Allocator=std::allocator<wchar_t>, _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Ax=std::allocator<wchar_t>, charT=wchar_t ] and [ BidiIterator=std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>::const_iterator, Allocator=std::allocator<boost::sub_match<const unsigned short *>> ] ================== also, I got lots warning C4018: '<' : signed/unsigned mismatch, although that's ok for me right now. Thanks for any help. frank

3 4

Weird behaviour when changing states in boost::fsm
by Jan Eickmann 02 Mar '05

02 Mar '05

Hi, I realized a weird behaviour when using boost::fsm. Here's my state setup: I have a parent state which has two substates. One is basicly a noop as InnerInitial, the other is and OptionsDialog. Now, in a custom_reaction's react function in the parent state, I call transit<OptionsDialog> in order to go to the OptionsDialog-substate. What happens is that the parentstate itself is destroyed and reentered, then it enters the OptionsDialog state. Something similar happens when I use transit<ParentState> to go back to the ParentState (which should automatically enter the InnerInitial, no?). It exits the OptionsDialog, then exits ParentState and reenters ParentState (I haven't checked if it enters the InnerInitial). If in the OptionsDialog, I do a transit<NoOpInnerInitial> it just goes there without first destroying the parent-state (just exits OptionsDialog but not ParentState). Is this the expected behaviour, if so, could someone explain how to get the desired behaviour? Thanks, Jan Eickmann

2 1

[program_options] parsing multiple times for different sets of opts
by Liam Routt 02 Mar '05

02 Mar '05

I'm very hopeful that program_options will simplify the mess that is the options parsing in our application, especially as it should allow us to handle command-line, config-fle, and environment-variable options in one logical step. This is all good. My initial tests have run into a small hitch, and I'm wondering whether there is a way to do what I have been trying to do: We have a core engine which has the largest options requirements. For testing, mainly, we wrap that core engine and provide a user utility. I'd like the core engine to be able to handle a broad set of options from all three directions (config, command line, environment). Easy. I'd also like the wrapping utility to have its own (smaller) set of options that control what it does. Ideally this should be as logically seperate from the engine as possible. At present we do this by simply not using command-line options for the core engine, and only using command-line options for the wrapping utility, but that is the fucntionality I most want to add at the moment - the use of multiple methods of setting (most) options at both levels (wrapper and core engine). What I would most like to be able to do is process the command line (for example) twice - once in the outer wrapping context, looking for the options that are relvant there, and once in the core engine, looking for the options there. When I try a test app with this structure, though, I get exceptions thrown when any options are encountered that are not included in both the options_descriptions used, which sort of defeats what I'm trying to do - I want to have two distinct sets of options: one for the wrapper, and one for the core, with (little or) no overlap. I would be happy if I could disable the exception behaviour, allowing the processing to complete and report to me that it encountered some unknown options along the way. This would mean that I would risk ignoring some unknown options in both passes, but I could live with that, I think. I can see a possible alternative, which requires me to pass the wrapper's options_description to the core engine, get it all parsed there, and pass back the map for examination by the wrapper. This would make some additional work for me, but would probably work fine. I guess I'd just like to know whether the other way of approaching things is going to be supported, or whether there is yet another approach I should consider? Take care, Liam -- Liam Routt Ph: (03) 8344-1315 Research Programmer caligari(a)cs.mu.oz.au Computer Science, Melbourne University (or liam(a)routt.net)

2 1

RE: [Boost-users] Weird behaviour when changing states in boost::fsm
by Darryl Green 02 Mar '05

02 Mar '05

Hi Jan, > -----Original Message----- > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Jan Eickmann > Subject: [Boost-users] Weird behaviour when changing states > in boost::fsm > > I have a parent state which has two substates. One is basicly > a noop as > InnerInitial, the other is and OptionsDialog. > Now, in a custom_reaction's react function in the parent > state, I call > transit<OptionsDialog> in order to go to the OptionsDialog-substate. > What happens is that the parentstate itself is destroyed and > reentered, > then it enters the OptionsDialog state. > Something similar happens when I use transit<ParentState> to > go back to > the ParentState (which should automatically enter the InnerInitial, > no?). It exits the OptionsDialog, then exits ParentState and reenters > ParentState (I haven't checked if it enters the InnerInitial). > If in the OptionsDialog, I do a transit<NoOpInnerInitial> it > just goes > there without first destroying the parent-state (just exits > OptionsDialog but not ParentState). > > Is this the expected behaviour, if so, could someone explain > how to get > the desired behaviour? Yes it is expected. See transit() in reference. In summary, calling transit will always exit the current state, and keep exiting back to the icos of the current state and the final state, then work in again from there to reach the destination state. Note tht exit = destruct, enter = construct. There isn't enough information to properly answer your question. For a start I don't properly understand your fsm, or whether this is just a minimal example to illustrate your problem. The obvious answer is that you should just make the inner states react to the event you currently have the parent reacting to. Using the form of custom reaction that allows a transition context and member function to be specified, you can make the transition context the parent state and a member function of the parent can perform action. Of course, if your reason for using a custom reaction is to implement some form of guard, this won't entirely solve the problem. The other way to look at this is to see if you can replace the guard with more states/events (the reaction to the original event conditionally produces the appropriate more specific event to cause the correct action and final state). hth Darryl. ########################################################################## This e-mail is for the use of the intended recipient(s) only. If you have received this e-mail in error, please notify the sender immediately and then delete it. If you are not the intended recipient, you must not use, disclose or distribute this e-mail without the author's prior permission. We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. ##########################################################################

1 0

Debugging a graph visitor
by Stephen Torri 02 Mar '05

02 Mar '05

I am using the default depth_first_search visitor with an graph setup as follows: typedef property< vertex_index_t, uint32_t, property< vertex_name_t, boost::shared_ptr<Component> > > VertexProperty; typedef adjacency_list<setS, // OutEdgeList setS, // VertexList directedS, // Directed VertexProperty> // VertexProperties Graph_Type; typedef graph_traits<Graph_Base::Graph_Type>::vertex_descriptor Vertex; typedef graph_traits<Graph_Base::Graph_Type>::edge_descriptor Edge; The graph contains Component class objects. I want to visit each Component and execute the function run(). The test graph I have is a simple two node graph: node A ---> node B When I use the depth_first_search with my visitor I see that it only visits node A. I do not know why this is the case. I have only implemented the discover_vertex function in it. I have std::cout messages for telling me various steps of run() have been done. I cannot see how to have the visitor say what its doing (e.g. "I'm in node A. Executing run(). Considering moving to node B). What I need assistance on is how do I debug my visitor? I am only sending the graph and the visitor to my call to depth_first_search: // Let Graph Visitor run through the Graph // (visit Input graph) depth_first_search (test_graph_ptr->get_Graph(), visitor(vis)); Stephen

2 2

Re: bjam seg faulting on mac os x 10.3.8
by Andy Espenscheid 02 Mar '05

02 Mar '05

yep, I discovered the $TOP issue yesterday. Had it set as a convienence for another project. Good to know I'm not alone. Thanks for the reply. Andy. > > Message: 1 > Date: Mon, 28 Feb 2005 10:59:40 -0800 > From: "junyi.sun(a)supportlinux.net" <junyi.sun(a)supportlinux.net> > Subject: re: [Boost-users] bjam seg faulting on mac os x 10.3.8 > To: boost-users(a)lists.boost.org > Message-ID: <5.1.0.14.2.20050228104802.00b90540(a)10.0.0.63> > Content-Type: text/plain; charset="us-ascii"; format=flowed > > I saw bjam got segmentation fault with bjam 3.1.10 + boost 1.32 + gcc 3.3.3 > + fedora 2. > After playing it around on different environment, I found that I can always > reproduce the problem when I set environment variable $TOP for my own > development CVS. Once I removed the environment variable $TOP ( I was using > bash shell: run "unset TOP" ), the problem is gone. > I hope this might help. > - Junyi Sun > > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Andy Espenscheid > Sent: Sunday, February 27, 2005 8:46 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] bjam seg faulting on mac os x 10.3.8 > > I am trying to compile boost 1.32.0 on MacOSX 10.3.8 and getting a > Segmentation Fault immediately from bjam immediately. I'm using gcc 3.3. > bjam is crashing with a EXC_BAD_ADDRESS exception. I compiled bjam from the > boost distribution but it has the same behavior. Any pointers would be > greatly appreciated. Seems like I'm doing somehthing dumb. Also, are > binaries available via fink? I seached with fink 0.71 but couldn't find > anything. Thx. >

1 0

Strange error...
by Jason House 01 Mar '05

01 Mar '05

Code that was compiled and tested on windows is now getting ported to unix (by another organization). I'm a bit puzzled by the following error message they are getting: /op_models/FCS_SOSv1.0_Scenarios_v10.5/FCS_SDD/CabWnwSrwPoP.opt32.s1.nt.so: symbol __1cFboostGdetailUsp_counted_base_impl4CpnXtransaction_reservation4nHslot_id_nYchannel_reservation_type___n0APchecked_deleter4n0E____G__vtbl_: referenced symbol not found I believe that it is looking for the implementation of boost::shared_ptr<transaction_reservation<slot_id,channel_reservation_type> Any hints as to what could be wrong? I did not include source code because I suspect the problem is more basic than that. When I asked which compiler was used, he replied "All I know is that we are using SunPro 5.4 for the compiler." -- Jason. 732-578-6378

1 0

[serialization] problem with Borland C++ Builder 6
by Pablo Aguilar 01 Mar '05

01 Mar '05

Hi, I've just started using the serialization library, and am trying to do so with BC++6. If I'm right, it should work just as long as I remove support for xml archives (because Spirit doesn't work on BC++) I've a class Cliente which has an appropriate serialize member fxn. And a manager class called Clientes which stores a std::vector<boost::shared_ptr<Cliente> > When doing: void Clientes::serialize(Archive& ar, unsigned const version) { ar & m_imp->m_clientes; // where m_imp is a pimpl-style struct // m_clientes is of the type specified above } (this is trimmed down code, I can post the original if required) I get the following error: [C++ Error] serialization.hpp(121): E2015 Ambiguity between 'boost::serialization::void serialize< boost::archive::text_iarchive , boost::shared_ptr<cc::servidor::Cliente> > ( boost::archive::text_iarchive & , _STL::vector<boost::shared_ptr<cc::servidor::Cliente> > & , const unsigned int )' and 'boost::serialization::void serialize< boost::archive::text_iarchive , _STL::vector<boost::shared_ptr<cc::servidor::Cliente> > >( boost::archive::text_iarchive & , _STL::vector<boost::shared_ptr<cc::servidor::Cliente> > & , const unsigned int )' (I removed the allocator parts to make the message clearer) So the question is, how do I remove the ambiguity? Thanks for your help... Pablo Aguilar

3 12

boost::indirect_iterator
by Matthias Kaeppler 01 Mar '05

01 Mar '05

Consider this code: vector<int> coll; // ... push back some values vector<int*> ptrcoll; // ... push back pointers to the values of coll indirect_iterator< vector<int*>::iterator > begin(ptrcoll.begin()), end(ptrcoll.end()); sort( begin, end, less<int> ); -- My question: After the sort statement, coll is sorted, right? (and ptrcoll is not). However, I need to sort a vector of pointers according to a predicate which applies to non-pointers. In this case, I want to sort ptrcoll, according to the less-relation on the pointees in coll. How can I achieve that? -- Matthias Kaeppler

2 4

[optional] new assignmet semantic and references
by Fernando Cacciola 01 Mar '05

01 Mar '05

{This is copy of a message on the developers list that needs attention from Boost.Optional Users} Hello people, A few days ago, a problem with Boot.Optional's assignment not properly handling aliasing scenarios (like self assignment) was pointed out. We concluded that the solution was to use T's operator=() directly instead of the Destroy+Construct pattern that I was using. I changed the code, tested it, and I was updating the documentation when I recalled the following long-standing issue: Currently, with the Destroy+Construct pattern, references are re-bound in case of assignment: int a = 123 ; int b = 456 ; int& ra = a ; int& rb = rb ; optional<int&> ora(ra); optional<int&> orb(rb); ora = orb ; // now 'ora' contains a reference to 'b' instead of 'a' b = 789 ; cout << *ora ; Prints 789 cout << a ; Prints 123 This is not the way assignment of reference types work in C++: ra = rb ; // The value of 'a' referenced by 'ra' is changed, not the reference itself. cout << a ; Prints 789 This error in the way optional<T&> treated assignment of reference types was pointed out by Joel de Guzman long ago when he started using Optional in Spirit. However, at the time, Joel explicitely asked me not to change this and keep the current rebinding semantics in order to minimize any impact in Spitit itself (which certainly has, o had, a much larger user base). If I change the code now to use T's operator=(), assignment of optional<T&> will have a _radically_ different semantics. A correct one, that's for sure, but end user code might be fundamentally impacted. Note: if you look at Optional documentation you will discover that assignment is only documented for T not being of reference type. This was intentional.. I left this undocumented becasue I knew back then that the current semantics were wrong but I couldn't fix it at the time because Spirit was (or could be) depending on it; yet I didn't want other users to depend on it as well... Of course, users could have "discovered" the (incorrect) semantics themselves and now rely on it, but I hope that the intentionally missing documentation served to keep the amount of users depending on this incorrect semantics very low. [At least it served _me_ to remember about this since I had forgotten] I really want to 'fix' this, i.e, give it correct semantics, so unless Joel or anyone else speaks now I'll move on, finish the documentation updates and commit the new version. Best, Fernando Cacciola P.S: Joel already agreed in the developers list that this needs to be fixed.

1 0

at<AssocSeq,Key,Default>
by Lemings, Eric B. (Contr) 01 Mar '05

01 Mar '05

Where is at<AssocSeq,Key,Default>' defined in MPL? I can't find the header file that defines it. Thanks, Eric.

3 2

date_time: UTC to local time conversion
by Cory Nelson 01 Mar '05

01 Mar '05

Is there a function in date_time to do UTC to local time conversions? -- Cory Nelson http://www.int64.org

2 2

re: [Boost-users] bjam seg faulting on mac os x 10.3.8
by junyi.sun＠supportlinux.net 28 Feb '05

28 Feb '05

I saw bjam got segmentation fault with bjam 3.1.10 + boost 1.32 + gcc 3.3.3 + fedora 2. After playing it around on different environment, I found that I can always reproduce the problem when I set environment variable $TOP for my own development CVS. Once I removed the environment variable $TOP ( I was using bash shell: run "unset TOP" ), the problem is gone. I hope this might help. - Junyi Sun From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Andy Espenscheid Sent: Sunday, February 27, 2005 8:46 PM To: boost-users(a)lists.boost.org Subject: [Boost-users] bjam seg faulting on mac os x 10.3.8 I am trying to compile boost 1.32.0 on MacOSX 10.3.8 and getting a Segmentation Fault immediately from bjam immediately. I'm using gcc 3.3. bjam is crashing with a EXC_BAD_ADDRESS exception. I compiled bjam from the boost distribution but it has the same behavior. Any pointers would be greatly appreciated. Seems like I'm doing somehthing dumb. Also, are binaries available via fink? I seached with fink 0.71 but couldn't find anything. Thx.

1 0

bjam seg faulting on mac os x 10.3.8
by Andy Espenscheid 28 Feb '05

28 Feb '05

I am trying to compile boost 1.32.0 on MacOSX 10.3.8 and getting a Segmentation Fault immediately from bjam immediately. I'm using gcc 3.3. bjam is crashing with a EXC_BAD_ADDRESS exception. I compiled bjam from the boost distribution but it has the same behavior. Any pointers would be greatly appreciated. Seems like I'm doing somehthing dumb. Also, are binaries available via fink? I seached with fink 0.71 but couldn't find anything. Thx.

3 2

program-options: multi-token for a single value
by Austin Bingham 28 Feb '05

28 Feb '05

I'm wondering if program_options supports the notion of two command-line tokens forming a single value, and, if so, how. For example, one of the values I'd like to pass on via the command-line is `a position in lat-lon. For consistency with other programs my users know, I'd like to use something like this: --position 10:11:12:N 13:14:15:W During parsing, I'd like program_options to recognize that --position requires two associated tokens. I tried to use the multitoken() method, but this didn't seem to do what I wanted. The operator>> I wrote for parsing the tokens was still only being passed a single token. Either multitoken doesn't do what I expect, or I'm missing something. Any ideas? Thanks. Austin Bingham

2 6

RE: [Boost-users] [serialization] problem with Borland C++ Builder 6
by Richard Jennings 28 Feb '05

28 Feb '05

XML serialization is working fine for me with BCB6. With some of my programs I do get error E2015 reported when I do a make. If I do a build (i.e. rebuild all modules from scratch) then it compiles just fine. I haven't looked in to why this is yet. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Pablo Aguilar Sent: 26 February 2005 04:50 To: boost-users(a)lists.boost.org Subject: [Boost-users] [serialization] problem with Borland C++ Builder 6 Hi, I've just started using the serialization library, and am trying to do so with BC++6. If I'm right, it should work just as long as I remove support for xml archives (because Spirit doesn't work on BC++) I've a class Cliente which has an appropriate serialize member fxn. And a manager class called Clientes which stores a std::vector<boost::shared_ptr<Cliente> > When doing: void Clientes::serialize(Archive& ar, unsigned const version) { ar & m_imp->m_clientes; // where m_imp is a pimpl-style struct // m_clientes is of the type specified above } (this is trimmed down code, I can post the original if required) I get the following error: [C++ Error] serialization.hpp(121): E2015 Ambiguity between 'boost::serialization::void serialize< boost::archive::text_iarchive , boost::shared_ptr<cc::servidor::Cliente> > ( boost::archive::text_iarchive & , _STL::vector<boost::shared_ptr<cc::servidor::Cliente> > & , const unsigned int )' and 'boost::serialization::void serialize< boost::archive::text_iarchive , _STL::vector<boost::shared_ptr<cc::servidor::Cliente> > >( boost::archive::text_iarchive & , _STL::vector<boost::shared_ptr<cc::servidor::Cliente> > & , const unsigned int )' (I removed the allocator parts to make the message clearer) So the question is, how do I remove the ambiguity? Thanks for your help... Pablo Aguilar _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Handling "actions" with program_options
by Julio M. Merino Vidal 28 Feb '05

28 Feb '05

Hi everybody, I'm working on a program whose its actual syntax is: vcsme [-c conf_file] [-q] action [action_args] (very similar to the CVS one). I'm trying to convert it to use boost::program_options (to get rid of the getopt(3) call, and to have long options), but I don't know how to do it. So far, I've added the code to handle -c and -q options. This was very easy to do, given the examples on the web. The only annoyance is that the options are accepted everywhere, but I'd prefer to only accept them if they come before the action name (because the action itself might allow options). Unfortunately, I'm stuck with the latest part, the one to handle actions. There must always be an action passed to the program, which may optionally accept arguments. Some example invocations: vcsme -q update vcsme update gtk+ glib NetBSD But I can't see any way to do this with program_options. Using getopt, I do: argc -= optind; argv += optind; after processing the options, so that argv[0] becomes the name of the action, and any remaining entries are its arguments. The same can be achieved with getopt_long. So... is it there any way to do what I want with the actual implementation? Can't see anything relevant in the docs... Thanks, -- Julio M. Merino Vidal <jmmv84(a)gmail.com> http://www.livejournal.com/users/jmmv/ The NetBSD Project - http://www.NetBSD.org/

3 4

Re: [Boost-users] File-based container library?
by Beman Dawes 28 Feb '05

28 Feb '05

At 11:23 AM 2/23/2005, John.Wismar(a)autozone.com wrote: >Does Boost have a library that defines a file-based container, perhaps >based on a B-tree or equivalent, for very large collections? Or does >anyone know of such a thing, or has there been talk about developing one? > >We have a few file-based collections with millions of entries. We don't >especially want to install a database. The file is too large to load into >memory. The file's format could be changed to make it compatible with the >type of collection I'm thinking of, but for the moment, we're doing binary >searches by reading the file on disc. As you might guess, this can be >quite slow, especially when the file is on a DVD and not the HD. > >Anyway, I'd like to be able to write something like: > >//file.data contains 100,000,000 entries >file_map<int, int> some_data("file.data"); >file_map<int, int>::iterator it = some_data.find(56789012); > >and have the container (for example via a B-tree or whatever) be able to >locate the item with very few disc accesses. > >Any libraries that can do this type of thing? In 1999 I did some work on a B-tree implementation for Boost, but became discouraged. For maximum portability and very high performance, it would have had to have a lot of limitations; memcopy'able POD types only, an interface that differed in several ways from the standard library containers, etc. Even with those limitations, the prototype took twice as long for typical operations as the old C code B-tree I've used for 20 years. Perhaps someone else will give it a try; a B-tree is an incredibly valuable tool and it would be great to have a good one in Boost. --Beman

2 1

Problems with file_iterator and skip parsers
by chrono232＠fastmail.fm 28 Feb '05

28 Feb '05

Can anyone explain to me what is wrong with the following: ---------------- my_grammer g; // a grammar, the actual grammar I'm using is too long for me to post file_iterator first<char>( "somefile.txt") file_iterator last<char> = first.make_end(); rule_t<> skp = space_p | comment_p("//") | comment_p("/*","*/"); parse_info< file_iterator<char> > = parse( first, last, *g, skp ); ---------------- I keep getting these errors (from MinGW 3.4.2): 189 C:\Dev-Cpp\include\boost\spirit\core\non_terminal\impl\rule.ipp no matching function for call to `boost::spirit::impl::abstract_parser<do_main_thing()::scanner_t, boost::spirit::nil_t>::do_parse_virtual(const boost::spirit::scanner<boost::spirit::file_iterator<char, boost::spirit::fileiter_impl::mmap_file_iterator<char> >, boost::spirit::scanner_policies<boost::spirit::no_skipper_iteration_policy<boost::spirit::skip_parser_iteration_policy<boost::spirit::rule<do_main_thing()::scanner_t, boost::spirit::nil_t, boost::spirit::nil_t>, boost::spirit::iteration_policy> >, boost::spirit::match_policy, boost::spirit::action_policy> >&)' 61 C:\Dev-Cpp\include\boost\spirit\core\composite\intersection.hpp no matching function for call to `boost::spirit::skip_parser_iteration_policy<boost::spirit::rule<do_main_thing()::scanner_t, boost::spirit::nil_t, boost::spirit::nil_t>, boost::spirit::iteration_policy>::skip_parser_iteration_policy()' 61 C:\Dev-Cpp\include\boost\spirit\core\composite\intersection.hpp no matching function for call to `boost::spirit::skip_parser_iteration_policy<boost::spirit::rule<do_main_thing()::scanner_t, boost::spirit::nil_t, boost::spirit::nil_t>, boost::spirit::iteration_policy>::skip_parser_iteration_policy()' According to the FAQ, this shouldn't happen with grammars. I am a beginner, so please forgive my ignorance. Thanks for any and all help. Also, I've tried making the skip rule a grammar, again, with errors.

2 1

Mac OS X 10.3.8 / gcc 3.3 build hanging boost 1_32_0
by Jwahar Bammi 27 Feb '05

27 Feb '05

OS X newbie trying to compile boost 1.32.0 bjam -sTOOLS=darwin stage on OS X 10.3.8 with stock gcc (gcc 3.3), the build hangs trying to compile boost/libs/serialization/build/libboost_wserialization.a/darwin/release/xml_wgrammar.o the compiler (gcc1) just sits there (i started the build and went to bed, in the morning it was still there) Any hints much appreciated. -- Jwahar Bammi bammi(a)memento-inc.com

3 2

can't compile boost example
by Hongyu Zhang 26 Feb '05

26 Feb '05

I just downloaded boost package, but seemed not able to compile the example programs. My platform is Redhat Linux 7.3, compiler is gcc version 2.96 I followed the installation guide, downloade the boost package and successfully compiled it. I install it to a directory called /home/hzhang/tools/boost Then when I tried to compile an example program, first.cpp, which comes with boost, I type $ g++ first.cpp -I/home/hzhang/tools/boost/include/boost-1_32/ It gave me this error In file included from /home/hzhang/tools/boost/include/boost-1_32/boost/program_options.hpp:15, from first.cpp:9: /home/hzhang/tools/boost/include/boost-1_32/boost/program_options/parsers.hpp:151: parse error before ` >' Did I miss any environmental variable set up or forget to include any necessary paths in the command? Please highlight me, because I cound't find even the simplest compiling command example from boost web page. Thanks a lot! -- Hongyu Zhang Computational biologist Ceres Inc.

2 1

reading bad archive by boost_1.32/serialization
by junyi.sun＠supportlinux.net 25 Feb '05

25 Feb '05

Hi, I have a class using boost_1.32/serialization to save/restore object data and it's working fine for loading & saving its own archive. I tried to make it load an archive saved by an unrelated class in order to verify exception handling of reading wrong/ corrupt archive. It dumps core at basic_iarchive_impl::load_pointer. Is it a known issue ? Anyone has similar experience ? Thanks. Junyi Sun --------------- here the core trace ---------------- Program terminated with signal 11, Segmentation fault. Reading symbols from /usr/lib/libtcl8.4.so...done. Loaded symbols for /usr/lib/libtcl8.4.so Reading symbols from /lib/libcrypt.so.1...done. Loaded symbols for /lib/libcrypt.so.1 Reading symbols from /usr/lib/libstdc++.so.5...done. Loaded symbols for /usr/lib/libstdc++.so.5 Reading symbols from /lib/tls/libm.so.6...done. Loaded symbols for /lib/tls/libm.so.6 Reading symbols from /lib/libgcc_s.so.1...done. Loaded symbols for /lib/libgcc_s.so.1 Reading symbols from /lib/tls/libc.so.6...done. Loaded symbols for /lib/tls/libc.so.6 Reading symbols from /lib/libdl.so.2...done. Loaded symbols for /lib/libdl.so.2 Reading symbols from /lib/ld-linux.so.2...done. Loaded symbols for /lib/ld-linux.so.2 Reading symbols from /lib/libnss_files.so.2...done. Loaded symbols for /lib/libnss_files.so.2 Reading symbols from /lib/libnss_dns.so.2...done. Loaded symbols for /lib/libnss_dns.so.2 Reading symbols from /lib/libresolv.so.2...done. Loaded symbols for /lib/libresolv.so.2 #0 0x081c16cb in boost::archive::detail::basic_iarchive_impl::load_pointer () (gdb) bt #0 0x081c16cb in boost::archive::detail::basic_iarchive_impl::load_pointer () #1 0x081c0d23 in boost::archive::detail::basic_iarchive::load_pointer () #2 0x08060344 in boost::archive::detail::load_pointer_type<boost::archive::text_iarchive, MyObjectP*>::invoke (ar=@0xfef3c240, t=@0xfef3bf74) at iserializer.hpp:450 #3 0x08060304 in load<boost::archive::text_iarchive, MyObjectP*> (ar=@0xfef3c240, t=@0xfef3bf74) at iserializer.hpp:529 #4 0x080602ea in load_override<MyObjectP*> (this=0xfef3c240, t=@0xfef3bf74) at basic_text_iarchive.hpp:60 #5 0x080602c6 in load_override<MyObjectP*> (this=0xfef3c240, t=@0xfef3bf74) at text_iarchive.hpp:59 #6 0x08060298 in operator&<MyObjectP*> (this=0xfef3c240, t=@0xfef3bf74) at interface_iarchive.hpp:92 #7 0x08060260 in serialize<boost::archive::text_iarchive> (this=0xfef3bc80, ar=@0xfef3c240) at nvp.hpp:58 #8 0x0806023d in serialize<boost::archive::text_iarchive, boost::serialization::nvp<MyObjectP*> > (ar=@0xfef3c240, t=@0xfef3bc80, file_version=0) at access.hpp:106 #9 0x0806021b in serialize<boost::archive::text_iarchive, boost::serialization::nvp<MyObjectP*> > (ar=@0xfef3c240, t=@0xfef3bc80, file_version=0) at serialization.hpp:78 #10 0x080601f9 in serialize_adl<boost::archive::text_iarchive, boost::serialization::nvp<MyObjectP*> > (ar=@0xfef3c240, t=@0xfef3bc80, file_version=0) at serialization.hpp:121 #11 0x080601d8 in boost::archive::detail::load_non_pointer_type<boost::archive::text_iarchive, boost::serialization::nvp<MyObjectP*> >::load_only::invoke (ar=@0xfef3c240, t=@0xfef3bc80) at iserializer.hpp:318 #12 0x080601b6 in boost::archive::detail::load_non_pointer_type<boost::archive::text_iarchive, boost::serialization::nvp<MyObjectP*> >::invoke (ar=@0xfef3c240, t=@0xfef3bc80) at iserializer.hpp:366 #13 0x0806019c in load<boost::archive::text_iarchive, boost::serialization::nvp<MyObjectP*> > (ar=@0xfef3c240, t=@0xfef3bc80) at iserializer.hpp:529 #14 0x08060182 in load_override<boost::serialization::nvp<MyObjectP*> > (this=0xfef3c240, t=@0xfef3bc80) at basic_text_iarchive.hpp:60 #15 0x0806015e in load_override<boost::serialization::nvp<MyObjectP*> > (this=0xfef3c240, t=@0xfef3bc80) at text_iarchive.hpp:59 #16 0x08060130 in operator>><boost::serialization::nvp<MyObjectP*> > (this=0xfef3c240, t=@0xfef3bc80) at interface_iarchive.hpp:105 #17 0x080600b8 in operator&<boost::serialization::nvp<MyObjectP*> > (this=0xfef3c240, t=@0xfef3bc80) at interface_iarchive.hpp:111 #18 0x0805fe43 in serialize<boost::archive::text_iarchive, std::string, MyObjectP*> (ar=@0xfef3c240, p=@0xfef3bf70) at utility.hpp:47 #19 0x0805f59f in serialize_adl<boost::archive::text_iarchive, std::pair<std::string, MyObjectP*> > (ar=@0xfef3c240, t=@0xfef3bf70, file_version=1) at serialization.hpp:121 #20 0x0805f48f in boost::archive::detail::iserializer<boost::archive::text_iarchive, std::pair<std::string, MyObjectP*> >::load_object_data (this=0x8a3f6c0, ar=@0xfef3c240, x=0xfef3bf70, file_version=1) at iserializer.hpp:155 #21 0x081c143a in boost::archive::detail::basic_iarchive_impl::load_object () #22 0x081c0d00 in boost::archive::detail::basic_iarchive::load_object () #23 0x0805df95 in boost::archive::detail::load_non_pointer_type<boost::archive::text_iarchive, std::pair<std::string, MyObjectP*> >::load::invoke (ar=@0xfef3c240, t=@0xfef3bf70) at iserializer.hpp:328 #24 0x0805df6c in boost::archive::detail::load_non_pointer_type<boost::archive::text_iarchive, std::pair<std::string, MyObjectP*> >::invoke (ar=@0xfef3c240, t=@0xfef3bf70) at iserializer.hpp:366 #25 0x0805df52 in load<boost::archive::text_iarchive, std::pair<std::string, MyObjectP*> > (ar=@0xfef3c240, t=@0xfef3bf70) at iserializer.hpp:529 #26 0x0805df38 in load_override<std::pair<std::string, MyObjectP*> > (this=0xfef3c240, t=@0xfef3bf70) at basic_text_iarchive.hpp:60 #27 0x0805df14 in load_override<std::pair<std::string, MyObjectP*> > (this=0xfef3c240, t=@0xfef3bf70) at text_iarchive.hpp:59 #28 0x0805dee6 in operator&<std::pair<std::string, MyObjectP*> > (this=0xfef3c240, t=@0xfef3bf70) at interface_iarchive.hpp:92 #29 0x0805deae in serialize<boost::archive::text_iarchive> (this=0xfef3bf60, ar=@0xfef3c240) at nvp.hpp:58 #30 0x0805de8b in serialize<boost::archive::text_iarchive, boost::serialization::nvp<std::pair<std::string, MyObjectP*> > > ( ar=@0xfef3c240, t=@0xfef3bf60, file_version=0) at access.hpp:106 #31 0x0805de69 in serialize<boost::archive::text_iarchive, boost::serialization::nvp<std::pair<std::string, MyObjectP*> > > ( ar=@0xfef3c240, t=@0xfef3bf60, file_version=0) at serialization.hpp:78 #32 0x0805de47 in serialize_adl<boost::archive::text_iarchive, boost::serialization::nvp<std::pair<std::string, MyObjectP*> > > ( ar=@0xfef3c240, t=@0xfef3bf60, file_version=0) at serialization.hpp:121 #33 0x0805de26 in boost::archive::detail::load_non_pointer_type<boost::archive::text_iarchive, boost::serialization::nvp<std::pair<std::string, MyObjectP*> > >::load_only::invoke (ar=@0xfef3c240, t=@0xfef3bf60) at iserializer.hpp:318 #34 0x0805de04 in boost::archive::detail::load_non_pointer_type<boost::archive::text_iarchive, boost::serialization::nvp<std::pair<std::string, MyObjectP*> > >::invoke (ar=@0xfef3c240, t=@0xfef3bf60) at iserializer.hpp:366 #35 0x0805ddea in load<boost::archive::text_iarchive, boost::serialization::nvp<std::pair<std::string, MyObjectP*> > > ( ---Type <return> to continue, or q <return> to quit--- ar=@0xfef3c240, t=@0xfef3bf60) at iserializer.hpp:529 #36 0x0805ddd0 in load_override<boost::serialization::nvp<std::pair<std::string, MyObjectP*> > > (this=0xfef3c240, t=@0xfef3bf60) at basic_text_iarchive.hpp:60 #37 0x0805ddac in load_override<boost::serialization::nvp<std::pair<std::string, MyObjectP*> > > (this=0xfef3c240, t=@0xfef3bf60) at text_iarchive.hpp:59 #38 0x0805dd7e in operator>><boost::serialization::nvp<std::pair<std::string, MyObjectP*> > > (this=0xfef3c240, t=@0xfef3bf60) at interface_iarchive.hpp:105 #39 0x0805d2d2 in boost::serialization::stl::archive_input_map<boost::archive::text_iarchive, std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<std::string const, MyObjectP*> > > >::operator() (this=0xfef3bfae, ar=@0xfef3c240, s=@0xe3693e4) at collections_load_imp.hpp:110 #40 0x0805d192 in load_collection<boost::archive::text_iarchive, std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<const std::string, MyObjectP*> > >, boost::serialization::stl::archive_input_map<boost::archive::text_iarchive, std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<const std::string, MyObjectP*> > > >, boost::serialization::stl::no_reserve_imp<std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<const std::string, MyObjectP*> > > > > (ar=@0xfef3c240, s=@0xe3693e4) at collections_load_imp.hpp:158 #41 0x0805d110 in load<boost::archive::text_iarchive, MyObjectP*, std::string, std::less<std::string>, std::allocator<std::pair<const std::string, MyObjectP*> > > (ar=@0xfef3c240, t=@0xe3693e4) at map.hpp:61 #42 0x0805d0f5 in boost::serialization::free_loader<boost::archive::text_iarchive, std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<std::string const, MyObjectP*> > > >::invoke (ar=@0xfef3c240, t=@0xe3693e4, file_version=0) at split_free.hpp:55 #43 0x0805d0d3 in split_free<boost::archive::text_iarchive, std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<const std::string, MyObjectP*> > > > (ar=@0xfef3c240, t=@0xe3693e4, file_version=0) at split_free.hpp:66 #44 0x0805d0b1 in serialize<boost::archive::text_iarchive, MyObjectP*, std::string, std::less<std::string>, std::allocator<std::pair<const std::string, MyObjectP*> > > (ar=@0xfef3c240, t=@0xe3693e4, file_version=0) at map.hpp:81 #45 0x0805b339 in serialize_adl<boost::archive::text_iarchive, std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<const std::string, MyObjectP*> > > > (ar=@0xfef3c240, t=@0xe3693e4, file_version=0) at serialization.hpp:121 #46 0x0805b03b in boost::archive::detail::iserializer<boost::archive::text_iarchive, std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<std::string const, MyObjectP*> > > >::load_object_data (this=0x8a3f5b0, ar=@0xfef3c240, x=0xe3693e4, file_version=0) at iserializer.hpp:155 #47 0x081c143a in boost::archive::detail::basic_iarchive_impl::load_object () #48 0x081c0d00 in boost::archive::detail::basic_iarchive::load_object () #49 0x08058aa3 in boost::archive::detail::load_non_pointer_type<boost::archive::text_iarchive, std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<std::string const, MyObjectP*> > > >::load::invoke (ar=@0xfef3c240, t=@0xe3693e4) at iserializer.hpp:328 #50 0x08058a7a in boost::archive::detail::load_non_pointer_type<boost::archive::text_iarchive, std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<std::string const, MyObjectP*> > > >::invoke (ar=@0xfef3c240, t=@0xe3693e4) at iserializer.hpp:366 #51 0x08058a60 in load<boost::archive::text_iarchive, std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<const std::string, MyObjectP*> > > > (ar=@0xfef3c240, t=@0xe3693e4) at iserializer.hpp:529 #52 0x08058a46 in boost::archive::basic_text_iarchive<boost::archive::text_iarchive>::load_override<std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<std::string const, MyObjectP*> > > > (this=0xfef3c240, t=@0xe3693e4) at basic_text_iarchive.hpp:60 #53 0x08058a22 in boost::archive::text_iarchive_impl<boost::archive::text_iarchive>::load_override<std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<std::string const, MyObjectP*> > > > (this=0xfef3c240, t=@0xe3693e4) at text_iarchive.hpp:59 #54 0x080579b8 in operator>><std::map<std::string, MyObjectP*, std::less<std::string>, std::allocator<std::pair<const std::string, MyObjectP*> > > > (this=0xfef3c240, t=@0xe3693e4) at interface_iarchive.hpp:83 #55 0x08056615 in encode_function (domain_id=208, bat=0xe728070, info=0xea2c339 "22 serialization::archive 3 0 0 4 1 1 3\n0 0 0 0 1\n1 0 1\n2 0 1\n3 0", info_len=65) at encode.cc:102

1 0

long compilation time using variant and spirit
by Matt P. 24 Feb '05

24 Feb '05

Hello, I have been developing a piece of code using various boost libraries, but I have to pause because the compilation has become unwieldy. It's a 50kloc prgm, which takes about 30min to compile on a pentium 3.5GHz HT and 1GB of memory (gcc 3.4 on linux). The binary, using the static linking with 2 boost libraries (program-options, filesystem) yield a 380M binary. Furthermore, it doesn't compile on msvc 7.1 (c1063, compiler stack overflow), and I had to stop mingw after one hour.... The prgm handles the parsing, storage, and serialization of a big raw string. This string is organized into fragments, about 30 each fragment could be occuring 0 or more times. each fragment contain on average 30 fields. each fragment has little in common with other fragments. my solution was to store the string as a vector of a type Fragment described by typedef variant<fragment1, fragmen2, ..., fragment30> Fragment. typedef vector<Fragment> string_storage. the parsing is handled using a grammar for each fragment, and the grammars are split between the definition and instantiation (manual explicit), as suggested in the FAQ. Most fields have a unique functor which is used as a semantic action to store the data found in the fragment. So this all scheme looked darn good when I had only a couple fragments, and it was working very well too! But now, my computer threatens to go strike whenever I type bjam on the command line. I don't have a clear question, besides the simple 'how well does variant scale'?, or 'does that seem like a not so clever design?'. The variant page mentions an optimization opportunity with 'has_nothrow_copy', but I can't find a good example. Could that help? Thanks, Matt

2 1

special_functions_test
by Gennadiy Rozental 24 Feb '05

24 Feb '05

Hi, Hubert For some reason I couldn't locate message to respond, but here is reply to your last post: > Well, actually, I am held up at the moment by what seems to be > internal Boost.Test problems. > I checked in a few days ago some modifications to the special > functions tests, which take into account the modifications to the > BOOST_CHECK_PREDICATE macro, but compilations still fails (Xcode 1.5): 1. You are using unit_test_ex.hpp. I forgot to remove this header. We don't need it anymore. Boost .Test now works with boost::function out of the box without any extra support. Just use unit_test.hpp 2. I noticed that your test could benefit from BOOST_TEST_TEMPLATE facility. I spend some time and look on attached version that do the trick. Fell free to use it if you want. 3. Usually It's not good idea to do ant thing from within init_test_suite function. This code is not guarded and should only be used for test tree creation. Gennadiy begin 666 special_functions.rar M4F%R(1H'`,^0<P``#0````````#;Q70@D#,`)@,``#4(```"^,CM3-U@6#(= M,PX`( ```&%C;W-H7W1E<W0N:'!P`+#Q:F 1W0S,S/T8$7NO"CCO$JR1)NVS MC(Y,R116R99\<K5O58FD6V<J:2J^$C<N3W>Y7)*VBD@4DVTU4YQG4\"O@-&@ MG1I/C@&@D$ :`#G[_F;F#P(<TTQ1.%A%"2#.8"MD$PR[!B2Q//:,Z_&^*,8' MB,E8;T<R682NN04#((C7(@@!*(:B(E'7LKY<.*..>*^1\/#K97!?"W;^*4XY MS%-0P+\7D:"K-$H.^5V2XR[SN"'O8?T;I*R22 FZ+\1_`%"*XE;2D?O$).32 MN2NXWF',LC.&C5O3T**]=Y5>XN8\.20D-;,AHDR89Y24Z%[@T#O_PE?/24H_ MPIUI9%#T>Z1!EN*505W3N[-AQU/[&&.34KW'5$SFB<;S#)TI!?-R>I1["0=/ M4SKNO_:!RR#'R798@( B;9N2DE)KI^KL.63F6K&:RT:K37"HMZN1]^:C.]TJ M41BZ"..LDTO[0.$B@.F0QP<$CC6<8OP<-E #ZQ6<$]!Y8^+(!R*5-\K*[9<< MTU-$KB)]T9XZB!H?6?->4?1W(),V%T. R[Z1'C?;!B_$+9HMW!&IE\<@](0: M-0BL*MC*$_/3X\B/#9A?#-,3@9?6*03QUL'HH747$?\#\-X^?FVIV^0+9+W; M$\J%WWGG#KYZA"!EALC6HDV35.E#E37!@0Q/N#JRX'7B@AR]G9>6765#)3DO M*AZ]7;T\F=7^?WZU%NCLZQTM0=P=T-$:6GJ)CJS+W)]%1VE@C'NS.+$5R?FW M)J'1NT'#HKD_29:U,^7;H7;?"47.\5<[P75@MZN-$\.TE:JKN>3Y0S/AD:#= MMOA#Q=S]RV?UW-Q&<=HT^U);D%Q4M$/Q!"!Z;^]OVT4ZW\WT:SPZ]N*<ZJGU M7[?LKS="@(L.E[;<U<"Y/U%,X>?H[J JF!V?(4+E#K5CY1D*FI\3V*0[G2M: M^8P=.@44S<1&?R/:+]G$^R2J?A^T_&3!63:>+8I^I@54RT[%?#N4HQD:K%-$ M6Q*M,&J1!W>'4:9&_.V%F/BJ0J#;&B[$;U+VZ57U]@"0]X[F^C_U;%2\;:7C M@V\K[0Y:S>[:.IP=2-5FV"M4=&W\0-P"=""0,P`?`P``*0@```)Y,YW V&!8 M,ATS#@`@````87-I;FA?=&5S="YH<' `\".12!'=#,S,_1@1>Z\*..\2K)&F M[;.,CDS)%';)EGQRM6]5B:1;9RII*KX2)RY/=[E<DK:):!23;353G&=3P330 MT: =&D^.;H! (^)!S]_X;@\"'-1043A810D@S& K9!,0%<Q6<3SV?.OR/BD& M!XC)6&\_,EF$KKD$X]!$:Y$D@(B&JF)5U[(^7#BDCGBOD?#\=;.2+X6K7QLS M#G,4U# OQ>1H*JT2<\Y770*[SN"'O8?S[I*R0\!-T7XD^ *6*W9M63OWB$F) M6&67<;S#F0[.&>[>GH5N]=ZZO;7,>&,Y(7JR%DF3#-(T'0O<&<=_^+-]%)LR M?A4J2J:7H]QT&6XM"@KFG<TN''2^L@8SZE>XZ8F8PI(\HRE"2+Y>4U*/62B$ M]40NZ_]G'*X*CPNR<H@")=FSTDH,Z?]<AR'YT58S66D5:6X4^/5R/ORT9GNT M)1&+G(Y*CEE_:2 (LMA1Z<' =QK,,7X.&N@(**^"SH@\LC5<$<BT)OE97;+C MEFHH*HB;=&:0H L?73=?B3I+.)*V&5' 9-Z1'C';!B_$+9H;F"13+XSCT #3 MI%:PJFL@3]%/CC3X:\'PRS$P3)ZQ2"?G6P>I.N1<2/@/PWML?7R!C<O=L#]( MA[T*UM[6@98;(UJF]DL4HWU2NTP(8GW!TY<#KQ22Y>SLO++K70\*\EZZ'KU= MO3R9E?Y_?K56Z.SK'0TA#(a)[H61I9^GF.K*O<GTNCL+!&1D_,,$5R;FH?4.BQ MH.&"N3=(MC4RJY<#*CX2%T.^KH=Q<6#'Q<::(=BS8IK8B;\H9GPG:#=MKA#\ MN9NW:1Z[FXG,&GM[J2V,7%0S='#B$#TW][?M)J5/IOIU'AU[?*\]U7ZK]OVN M\W0J"*CH>HW+7 N3]12N(GZ>ZD*EH=?Q^QIICJ5CY)^:>M>*,$I=SI6M?+@. MF8* S,1&?R/:+\F$^R2F;A9I_D>"HFDT6M3>B!33IIV*^'<-/J-JH4SQ:TJT MP:96#N\.HQ&WYMA8HU3(TAZMH-B-ZF;-*K:^O<D/>.WOI_]7!4/#M,TX-O)] MH<M9?=O6XK4C51M@K$_1G^**;W0@D#,`= 0``-P2```"UE[C`]5@6#(=,PX` M( ```&%T86YH7W1E<W0N:'!P`/ W!C\,&8T,S0_-@1N[_%8'0'4JXVG-VSC& MY )KUV[!9LD%;MZH)I8V\&II/5\)&MNS_O15+NMI)HXL23242FQN2Z+PS@DT ML)]/PSTG,3_,'T_3"<)'A\ P$\#R()SD@@)M8C0FALZC(148DFDELUO-HT:\ MNP\^9X6=`TR)*Z^^E-HBZS)D^RV_<=:L``1U\\5]?0XP3+F>CW-XQL!V75(L M+U7+GKMQ(OM(_1\&-OO%`:B@S#GL77 +PKY&NU)C7N@B8X(!\ OY>]D&6+AM MW+<#^$8X(a)1)--?/HV0.0,Y3/;T<]_!TX<"/"B^=K3 2#Z)@Y00/$I;#FM''K M';]2WC*RK;WY4*"H?6^A^$"":K>Q05Z2)H<.69[7@SP:DT<LU*B$D'GA&0CE M&B[*$LQZ13++U L]T?\,BTR(7HBFDR,$F'96!,<8B3RO-.0<[*L[]L3RXH;A M&T]1&PQ#1J>S8DV\&LG/5IAE_JL5";9++L,<?' XIJ$L;-VFR"A-/DI[(._Q M<4R&LWL38(FBJ3/#-&PJ*3%%.J+,(''VLW;T>YYH!(6PU36 DWT!Z'_*@1;D M%/85[(\KZN6 :-"./F![$*AAP%XK-.TGW:=!\G82B0W/&"@EXNJ!T&GD+D+Z M#OE:JAA@8:;$[)R=, D#BS? Z_Y1]ZD(9325&I*#3Q=".0LQ^7P--L+'35<! M]W ?GV=75AQ(XL =+_-AP!^??U]'-J4?T_CIOXN?JZ3HRIE,7P`Y7I!2-D>7 M[D4<T2>]TP\WZX#J^((**OXDL1%HK1# PMP4"N8BT5OFO*[-Z\!B& 4D2TV( MEIOWL0%O(G'ERZ]NN?=HLN_[L%_]D>O]\'MY[X3,.DC*#EE$?Q;@J `_[@E8 MAQ2<1.<7(,?<M?+1?*X>&-J>H'ZQ33[&1_^QSO6>AQ0]6A!I[1RO5_['O6C/ M79=WRDC*K$6:$0*@7+H=KVKX;A?S9LF4&HJEK!I!)H.*2UQ7-D5#V<1]V>L^ M"UE*Y'>DR1.>E\YTFG+5`<X831<O(+QHML6*@,LNX9P>V^.V3>_Z][7<IMO8 M+GU'77\SSYDP^ZL;J6X3V+D4V[H0;]\&:_;,-/X'>8MY[O;:I;6(G4K^9+]% MN/2>&G)0,3%FTIC(\B:9)1=O&'%X-C2I0"C9M*'I,F:%@2++*):5?]/!JU- M3$_2L*=G36-3R%<=34JY*F'7'4R(H[4XI*SQ6'NNR>H.36E$4%=M9MD.7#L2 M8(D`57$'+86#7NGC5QV(V!5VY5W%]JPU2&!+Q09DF48#,GUGD<%8L>26S0?W MQ<F2.H -PL=247I*761M=IW#Q!9\J,!O=5%C7)XRKY\>4=[5?#;AWHU8$ZB8 M=22?;?XR6J2PL6_Y>JGB^SSHC_G\_%:5EW_6J6U9N31&J[Y$GW-IVJJYC<FQ M-6M\B[T]N>!>G^F>?2DW9NL/E%#=8S_BS(T:QG2<$\R?P%H8#[X%_B1+S[9, M=T[QG4S^1:_EJ\;]:VW2RUOUK_Z4R)UL:?.>3C;5/$OBKF^MO^TWS'0@D#(` MM@(``$8(```"5XF2;]!@6#(=,PT`( ```'-I;F-?=&5S="YH<' `L& ]60V9 M4,S,_101=Z\*(=TI"-I)VB:7'8 XHK8Q9TBMV[4$TBVR*FDJNB= HGN]%CLK M;71A**=:C5 C@>BZ#H2)PYT<SG,2\<X<Z3G,PYA'VO_3_X(HH*-TD0HAPZ#& M1P8H2.M)Y7W]->@U-E!@^-HC+FGR(:B(\[#0_H8Y+#00"0$BLD)9Y_O@)DRZ MHYH\0X ]/.2DB]JJON3,[<I)*2 Q1YS851L=$_<CSP2O`]CB[68-.YR-#E@' M9%]=7PA2Q6TU4Y7\`QFDK+33V9]EWOE9R4"SGOK+].!=BVQ(>+NE) :M``R) MB- F.B?N:1V_P3Q%H4]7Y%/-"I(>3V!>SD<R@KM-SSX<>PUU!FEU(_LLB@,P M'=^VS&&HRDBYVE#EPQXRE)IK80IJ*%0+'ZH=ZYU+X8:9A&#R`!+2,\TY.KJP M86,*X>%KV!<-O1U\][0L?#Z=*V&_U=*)E:8?(:B61813\_A 0:C#HR%V7+F< MWH&<4/%G]V/,. DH;A,TU.VZF%'D+?MRX>GI"&=Z`YT>+!>^*Z-C" .%B#NP MB.FP,@&&-UL#K(Z;'VP@(^KMT1</9)3>=[\_;K,Q%W#QRRL(I%Z["=A*I0K< MRZWR8Z_FORWU@(9$]@<EWA8']XY9@C)-6=<_HA>J)P87JD;.(1HITQ%Y*I)6 MO,RM^)+^QM4DF#0W\YQYU$[P`?^&Y).?&'KTL#EEXD/1*3Z10[@I1QY_QJ8= M_G"IE19%;.C-.K0MMX*8B-8O/J5Z0['B-EY4K /RH ZE7RC:^R-8KFX(,?MU MEP4[0TCJ:(1!>\2O$'J[H[:I=O!P4![17FW+=>(!Q=L]W#5*C944YW,<]<T= M7XU.R):X54E$!;IJLD0EW_0.[H+6WH\3@ZHOTL]X#%,JWP/@8EY!5HXJ=&\! MW4E\M@2H_+7A78[BL'S3^4#V'70@D#,`N@(``)T(```"8[W"]-)@6#(=,PX` M( ```'-I;FAC7W1E<W0N:'!P`/"$CRD-W5$(S/T8%7O/"M3O2"C@#M4Z7'8D MX0MC5GQ5;M[1##6WJHP*?"?!53W>JR6UL-9FZ ZPA$JXGT3HWH W,YO,YN<Q MOQS/KS<S<Q?DO_1_\)44%&Z2(40X=!D(X,4)'<S2>9]_3GH)'S!!?&T1ES3Y M4M1$>=AG'X8Y;C00`C$BLD)9Y_N@)ES21RQXQP!Z><*4+VJJ^Y,X;D)+24&. M/Q-A56QSGG&\\!7A>R1=C,&G<Q&AE@';%]9/A"EBN)JIE?PC&<E9::>SOLN] MQ6<LZMYL"R_1A78N,2GB[2D@M6@0)4Q'X6HZ)^[I'9_1/&:@3D_*I6XJ2'\> MPJ#3D>I05ZGL\V'%L19 SEU(_LPC(&H#M_;8AGHJDJIF5*+;L>&IKNBPXAKI MJ&8#'ZG#604WAAIF$8"@KQ:1T&?'T].'$QB7#PM?PKA\\_5S7]"Q\/IT+8L' M3T(SN^8?(>BVQ8A3<_A 0:C"3E-\7;LD-Z!G'#P^,;5D#=CSC@(4QPF?5G0, MKBCK?1&L?NW::WL#Q_$ZXY_!AO_%=&UB!(,14C1$=/A1`,,@FP88CI\F;6M. MWKPC8LRSF5[GQL.LZF+V+B+@PBD:7:3M)<->FK<JZWR8ZOFOR8%@M(C1U9PO MD+ _O&6H".7UO7140LDC2E#2Y73*$:,Q,1MRJ26_6A7/`E_N=5M:=/#?*@X\ MZC0(!3=Z&UN/1D%_^Y^O(#=ZL>BCJGJAX4<*A-'>RV('<%OH"K:\H\!4C88, M^BP1UO$;-NUOZ'])`OBL9AM?9&P?OT+,@(,'J7*,PP:1DJ(1!>\2O"'J]H[B MIOG>WIU//7?*::\:QQ=DWG!.,KZ,Z*;ZY)NM6-7\QT0B;_ JDH@+;-6!`"GS MD5MJN;>CQN#JK*F'N!9TE[=*T#%S**Q7-21N!>5"XW0Z,6>_SL@A6CYVGG(? ME-#J=""0/P`2`P``!0D```)?#DDJR&!8,ATS&@`@````<W!E8VEA;%]F=6YC M=&EO;G-?=&5S="YC<' `L&QW%@P!#0S,_101>Z^*T.<4F'6H[1>+:K <<4M8 M#CD%3D HMH032UI:(FD@O"N007_>@1NQM;K9U)J-R52!V"=%P7AI)PYI.'5\ MV3I\,T[I)P9@S@1G#..'.B:8HQQ1BQD='H'X110#9(P[I<CS,9'WHJZ"`.XD M;J0KK\'9"1MPKOI)B'"'A]TCPO?P\/PKYUQD,44&*0R30B_:*(SCAEN)]\)* ML_CCRL0Z=?(R/.!UA=,OQ?TBL5^&N9]88Y@9AEE_) P]V&9;G+-^]=5P+*KV M%RGCZS$@:&0)14QS0FHZ."SI&7O*^(\JKR^VGY(9+6)P&/9=DU)B4-GD,\2" MWNZ<T4F;=U/6B <<@I6QZ5)ZUR1KQCH=_3=EW7V_*%U(@]? %J>-@Y3L==6K M%S/"(G=)G4?F9#2(a)VDQ(U(^R`;S&0H\.I<+:2,QB#P%8KG8KG96@.AA,<IE) MQJ\E[ JOA^W/H,%SE51+8'@20OQM%;8O, *'?\N]H,"G(R)EQ@]O'LPJB712 MSF$<<D+PN []M"_?>FY_V:XW7R^-E:I&33\F)T=.S+5YO<=$)K7+-G;9W'"! MFROP]4J3?<4DLCJH$.Z;7B;51E2.M.<U?O^4D.U 0=;X*SXS_(7%S<RV'5"J M'9;HO:-&ILQBOW=,$U#FPXD]3H6!1(!6W0'5*I-16M/M_6W-PMS2]-82*@&# M0]UMAII'=F;MQ94/7EY[]P" 6U,M;<!0O0E:_X!XB=V'P5C-YFQF@)[ $N>R M`,R/QOG1]?LQ9],"' 7C>.CP0M@6MSJW;UR^OR=&"[AO<V!:<=Z5?K+YH9^> MKO+-GRK9LV?'QO(AA\.0Z<X^ZU*(_T-U&FB0>U\FDQ,-G*^Q2D@'+<\NE&UH M'I"BA)K0=)D+BA7$YTY=3RUSYAA <!: NFHE3-J H"C*C8^.OU107C&)\-+9 M1; ZBD@+9THIO$;LQ<]=!W<KFX#T^S:@O#<//0&C+8/V7('"(RX-GJWE(*,J M?40)LFLU%"_/513GF1Y#@&\T29;].KO2W154YZK;/S\//IAP_,?X@,0]>P! "!P`` ` end

1 1

Assignment library and G++
by Josue Gomes 24 Feb '05

24 Feb '05

Hi, Take this code: #include <boost/assign/std.hpp> #include <boost/assign/list_of.hpp> #include <boost/assign/list_inserter.hpp> #include <map> #include <iostream> #include <string> using namespace std; using namespace boost::assign; const unsigned long USER = 0x0001; const unsigned long ADMINISTRATOR = 0x0004; const unsigned long ALL = USER + ADMINISTRATOR; typedef map<string, long> item_permissions_t; typedef map<string, item_permissions_t> module_permissions_t; int main() { map<string, module_permissions_t> permission_table = map_list_of ("Module1", map_list_of ("Item1", map_list_of ("Feature1", ALL) ("Feature2", ADMINISTRATOR) ) ("Item2", map_list_of ("Feature1", ALL) ("Feature2", ALL) ("Feature3", ADMINISTRATOR) ("Feature4", ADMINISTRATOR) ) ); cout << "modules: " << permission_table.size() << "\n"; cout << "items of module 'Module1': " << permission_table["Module1"].size() << "\n"; cout << "features of item 'Item2' of module 'Module1': " << permission_table["Module1"]["Item2"].size() << "\n"; cout << "permissions of feature 'Feature4' of item 'Item2' of " "module 'Module1': " << permission_table["Module1"]["Item2"]["Feature4"] << "\n"; } It compiles fine with VC 7.1. However g++ 3.3 and 3.4 (both on Linux) refuse to compile it. See the error message (excerpt): sample.cpp:36: instantiated from here /usr/include/c++/3.4/bits/stl_pair.h:90: error: call of overloaded `map(const boost::assign_detail::generic_list<std::pair<const char*, boost::assign_detail::generic_list<std::pair<const char*, long unsigned int> > > >&)' is ambiguous /usr/include/c++/3.4/bits/stl_map.h:166: note: candidates are: std::map<_Key, _Tp, _Compare, _Alloc>::map(const std::map<_Key, _Tp, _Compare, _Alloc>&) [with _Key = std::string, _Tp = item_permissions_t, _Compare = std::less<std::string>, _Alloc = std::allocator<std::pair<const std::string, item_permissions_t> >] /usr/include/c++/3.4/bits/stl_map.h:156: note: std::map<_Key, _Tp, _Compare, _Alloc>::map(const _Compare&, const typename std::_Rb_tree<_Key, std::pair<const _Key, _Tp>, std::_Select1st<std::pair<const _Key, _Tp> >, _Compare, _Alloc>::allocator_type&) [with _Key = std::string, _Tp = item_permissions_t, _Compare = std::less<std::string>, _Alloc = std::allocator<std::pair<const std::string, item_permissions_t> >] the command line is: g++-3.4 -I ../boost_1_32_0/ sample.cpp -o sample Any ideas of what is going on here? Regards, Josue Gomes

2 1

[serialization] editor archive
by Martin Slater 24 Feb '05

24 Feb '05

Hi, I've been using serialization for a while and am extremely happy with it, now I would like to utilise it to automatically populate an editor with object data. Basically I intend to write a new archive type that will serialise to / from an editor interface using the type info of each serialised item to attach suitable editor components. Has anyone done anything like this or have any ideas of problems I may run up against? cheers martin

3 4

object with external linkage in boost/tuple/detail/tuple_basic.hpp
by Michael Benfield 24 Feb '05

24 Feb '05

When I #include<boost/tuple/tuple.hpp> in multiple files and compile them with the Digital Mars compiler, its linker complains about multiple definitions of an object called ignore. The problem is in the file boost/tuple/detail/tuple_basic.hpp, which has this line: detail::swallow_assign const ignore = detail::swallow_assign(); This works when I compile with gcc or the Microsoft compiler, but it shouldn't be there, should it? I thought the only things with external linkage that should go in headers are special cases like inline functions. If I'm wrong and this is a bug in the Digital Mars compiler or linker let me know and I will go report it. Thanks, Mike Benfield

1 0

enable_if for function templates
by Agoston Bejo 23 Feb '05

23 Feb '05

Hi all, I am trying to enable only two version of a function. The caller may choose one of the two versions by specifying a template parameter. I've got two versions for the problem, both of them failing the same way. -------------------------- Version A): integral template parameter -------------------------- #include <iostream> #include <boost/utility/enable_if.hpp> #include <boost/type_traits.hpp> using namespace std; using namespace boost; template<unsigned int N, typename T> enable_if_c<N==1> f(T t) { cout << 1 << endl; } template<unsigned int N, typename T> enable_if_c<N==2> f(T t) { cout << 2 << endl; } int _tmain(int argc, _TCHAR* argv[]) { f<1>(10); // ERROR f<2>(5.5); // ERROR f<3>(7); // ERROR return 0; --- The error message on all 3 lines is: error C2668: 'f' : ambiguous call to overloaded function The compiler's "explanation" for the first one: (for the other two it is much the same except the type) could be 'boost::enable_if_c<B,T> f<1,int>(int)' with [ B=false, T=void ] or 'boost::enable_if_c<B,T> f<1,int>(int)' with [ B=true, T=void ] while trying to match the argument list '(int)' -------------------------- Version B) : type template parameter -------------------------- #include <iostream> #include <boost/utility/enable_if.hpp> #include <boost/type_traits.hpp> using namespace std; using namespace boost; struct A1 {}; struct A2 {}; template<typename U, typename T> enable_if< is_same<U, A1> > g(T t) { cout << 1 << endl; } template<typename U, typename T> enable_if< is_same<U, A2> > g(T t) { cout << 2 << endl; } int _tmain(int argc, _TCHAR* argv[]) { g<A1>(10); // ERROR g<A2>(5.5); // ERROR g<int>(7); // ERROR return 0; } ---- Error messages: error C2668: 'g' : ambiguous call to overloaded function (for all three of them) "Explanation" sample: could be 'boost::enable_if<Cond,T> g<A1,int>(int)' with [ Cond=boost::is_same<A1,A2>, T=void ] or 'boost::enable_if<Cond,T> g<A1,int>(int)' with [ Cond=boost::is_same<A1,A1>, T=void ] while trying to match the argument list '(int)' ----------------- enable_if should actually prevent the compiler from trying to compile the 'false' version, shouldn't it? Thx, Agoston

3 2

[optional] comments about none_t
by Yuval Ronen 23 Feb '05

23 Feb '05

Hi. I checked out the optional library and found it to be of great value. I have, however, a few small suggested improvements (and no, I'm not talking about the pointer/container/discriminated-union semantics debate; I read this discussion in the mail archives and I also saw the resulted library and I'm very happy with what came of it). I'm talking about the detail::none_t part. Should it really be in the detail namespace? Isn't that a little weird? The detail namespace should be "forbidden area" for the users, yet here they are offered to write code like my_optional = boost::detail::none_t(); One might argue that there's the 'none' global variable which will make the code look like my_optional = boost::none; which looks much better. I agree that it looks much better, but it still doesn't make the previous way of thinking (crating a temporary none_t instance) illegal or unsupported. It is unsupported now. And while we're at the global none variable, I have to say that the reason I first tried the temporary-none_t-instance way, is that I didn't know of 'none'. The documentation is very poor on this subject. It's only mentioned in one place in a short, unexplained sentence, and it's in the "Detailed Semantics" section which no one ever bothers to read anyway. In addition to improving the docs, I'd say that it's even better to include the boost/none.hpp header with optional.hpp so it could be easily found and reached. As I understood, the reason why this is not done now, is because some compilers (such as Borland's) have troubles with initialized data and pre-compiled headers. If this is truely the case, then I think it's easily solved. Include as follows: #ifndef BOOST_OPTIONAL_DISCLUDE_NONE #include <boost/none.hpp> #endif while the BOOST_OPTIONAL_DISCLUDE_NONE flag can be set either by the user, or automatically if a troublesome compiler is detected. If Boost.Config could automatically detect and set a BOOST_NO_INITIALIZED_DATA flag, then the optional library is left with fairly simple code. To summarize, I suggest: 1. Lift none_t from detail to boost. 2. Improve docs wrt 'none' global instance. 3. Include none.hpp with optional unless the user/compiler dislikes it. Makes any sense? Yuval

3 5

using boost::format with STLPort
by Alexey Bakhvalov 23 Feb '05

23 Feb '05

Hello, I have a problem when I try to include "boost/format.hpp" from Boost 1.32 in a project that uses STLPort library. I am using MSVC 7.1 and the compiler prints the following error: \boost\format\format_implementation.hpp(216) : error C2244: 'boost::basic_format<Ch,Tr,Alloc>::size' : unable to match function definition to an existing declaration \boost\format\format_class.hpp(58) : see declaration of 'boost::basic_format<Ch,Tr,Alloc>::size' definition 'basic_format<Ch,Tr,Alloc>::size_type boost::basic_format<Ch,Tr,Alloc>::size(void) const' existing declarations 'boost::basic_format<Ch,Tr,Alloc>::size_type boost::basic_format<Ch,Tr,Alloc>::size(void) const' If I switch back to Boost 1.31 or don't use STLPort then the problem goes away. I just wonder what can be the cause of such strange error because I can't see any difference between function's definition and declaration. Also I use many other Boost libraries and don't have this problem with either of them.

3 2

lapack bindings compiled fail with Visual C++ 7.1
by HHSU 23 Feb '05

23 Feb '05

Hi, I used VC7.1 and Boost_1.32_0 to compiled the SVD test file ( ublas_gesvd.cc) which download from http://cvs.sourceforge.net/viewcvs.py/boost-sandbox/boost-sandbox/libs/nume… I get the following error and warring messages: d:\upload\test\ublas_gesvd.cpp(61) : warning C4267: 'argument' : conversion from 'size_t' to 'unsigned int', possible loss of data c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\boost\numeric\ublas\traits.hpp(941) : warning C4267: 'argument' : conversion from 'size_t' to 'const unsigned int', possible loss of data c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\boost\numeric\ublas\matrix_expression.hpp(4462) : see reference to class template instantiation 'boost::numeric::ublas::promote_traits<X,Y>' being compiled with [ X=boost::numeric::ublas::matrix<real_t,boost::numeric::ublas::column_major>::size_type, Y=boost::numeric::ublas::matrix<real_t,boost::numeric::ublas::column_major>::size_type ] d:\upload\test\ublas_gesvd.cpp(84) : see reference to class template instantiation 'boost::numeric::ublas::matrix_matrix_binary<E1,E2,F>' being compiled with [ E1=boost::numeric::ublas::matrix<real_t,boost::numeric::ublas::column_major>, E2=boost::numeric::ublas::matrix<real_t,boost::numeric::ublas::column_major>, F=boost::numeric::ublas::matrix_matrix_prod<real_t,real_t,boost::numeric::ublas::matrix_matrix_binary_traits<real_t,boost::numeric::ublas::matrix<real_t,boost::numeric::ublas::column_major>,real_t,boost::numeric::ublas::matrix<real_t,boost::numeric::ublas::column_major>>::promote_type> ] c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\boost\numeric\bindings\lapack\gesvd.hpp(281) : error C3861: 'assert': identifier not found, even with argument-dependent lookup d:\upload\test\ublas_gesvd.cpp(69) : see reference to function template instantiation 'int boost::numeric::bindings::lapack::gesvd<m_t,v_t,m_t,m_t,std::vector<_Ty>>(const char,const char,MatrA &,VecS &,MatrU &,MatrV &,VecW &)' being compiled with [ _Ty=real_t, MatrA=m_t, VecS=v_t, MatrU=m_t, MatrV=m_t, VecW=std::vector<real_t> ] What I am missing or doing wrong ? Bert.

1 1

boost::format bug?
by Orhun Birsoy 23 Feb '05

23 Feb '05

Hi, I am getting boost::io::too_many_args exceptions for the following line. cout << format(" %1% %3% \n") % 1 % 2 % 3 % 4 % 5; but not for this one cout << format(" %1% %5% \n") % 1 % 2 % 3 % 4 % 5; If the last argument is used in the format, I do not get the exception. Is this a bug? Thanks. Orhun Birsoy -- _____________________________________________________________ Web-based SMS services available at http://www.operamail.com. >From your mailbox to local or overseas cell phones. Powered by Outblaze

2 1

[lexical_cast]: Converting a formatted string
by maha.ramanan＠philips.com 23 Feb '05

23 Feb '05

Hi, I am quite new to the iostreams and lexical cast and hence bear with me of any lack of knowledge. I am using the lexical cast in the following manner: unsigned int data_value = boost::lexical_cast<unsigned int>("0xFF"); The above comes out with a runtime bad_lexical_cast error. I understood, by default, the streams (stringstream used by lexical cast) should be able to automatically identify the radix of the input and convert it automatically. Is my above undestanding correct? Is lexical_cast meant to be used in this situation? Thanks for your help? Ram ======================================================================================= Mahadevan Ramanan Design Technology Centre DTG - Philips Semiconductors Milbrook Industrial Estate Tel: +44 (0) 23 8031 2540 Southampton, Hants SO15 0DJ Fax: +44 (0) 23 8031 2642 UK ====================================================================================== The information contained in this message is confidential and may be legally privileged. The message is intended solely for the addressee(s). If you are not the intended recipient, you are hereby notified that any use, dissemination, or reproduction is strictly prohibited and may be unlawful. If you are not the intended recipient, please contact the sender by return e-mail and destroy all copies of the original message.

1 0

lexical_cast specializations
by Cory Nelson 22 Feb '05

22 Feb '05

How about adding some specializations to use wstringstring when given a wstring? -- Cory Nelson http://www.int64.org

1 0

RE: regex/string algorithm problem
by The Grumpiest Man You Know 22 Feb '05

22 Feb '05

Boy! You guys are SPOOKY good. I wrestle with something 'til I give up and then I go to write a report and while I formulate the words you start feeding back answers! The reason the code I sent "hangs" is because it's iterating over a zero length match. which consumes 0 characters of input per loop. I must do that once a year in any language I use, you think I'd learn huh? If I can reproduce the segfault and I can't see why it's my fault, can I post that too? Or can we skip that and have y'all start channeling me the clues now. :) Thanks again for your time. -- Blue Skies

3 3

shared_ptr: proper removal from STL Containers?
by Jeremy Hill 21 Feb '05

21 Feb '05

Greetings, I have only recently begun exploring boost, and I must say that I have found it very interesting. In particular I've been focusing on boost::shared_ptr. However, I'm not quite sure how to 'deallocate' shared_ptrs that are in a Container, such as a vector. I'd like to issue some pseudocode to help put things in perspective: class Descriptor { public: bool valid; Descriptor() : valid(true) {} } struct InvalidDesc { bool operator()(Desc_ptr &d) { return (*d).valid; } }; class Desc_broker { private: vector< boost::shared_ptr< Descriptor > > desc_list; public: //These functions are, in this order, called elsewhere: void fun_1() { <conditionally invalidate Descriptors> }; void fun_2() { <iterate through desc_list and do stuff> }; void cleanup() { desc_list.erase( remove_if(desc_list.begin(), desc_list.end(), InvalidDesc()), desc_list.end() ); } }; There is the class 'Descriptor' that is contained within a shared_ptr, which is wrapped in the 'Desc_broker' class. Once a Descriptor is invalidated, such as in fun_1() above, it is no longer needed. I'll need to get rid of invalid Descriptors before the vector is iterated through in fun_2(). However, since the shared_ptr for the invalid Descriptor will not go out of scope, to the best of my knowledge I'll need to help it along by using something along the lines of 'cleanup', which will remove all desc_ptrs whose Descriptors are invalid (via std::remove_if and the InvalidDesc predicate). However, this feels wrong to me because it seems like it is against what shared_ptrs are trying to accomplish. And, in fact, Boost agrees--I receive this on cleanup(): assertion "px != 0" failed: file "/usr/local/include/boost/shared_ptr.hpp", line 253 Aborted (core dumped) What is the correct way to remove the invalid Descriptors? Also, I apologize if this is considered the unacceptable topic "Requests for help interpreting the C++ standard." If that is the case, please tell me so that I may not offend in future posts. Thank you, Jeremy Hill

2 2

Re: problem with lambda and function<>
by Arturo_Cuebas＠bpmicro.com 21 Feb '05

21 Feb '05

In my previous post the sample code was a lot more than what what necessary to ask the question. I could have given this simpler example: #include <boost/function.hpp> #include <boost/lambda/lambda.hpp> #include <boost/lambda/bind.hpp> using namespace boost; using namespace boost::lambda; int f(void) { return 5; } int main(void) { int test = 0; (_1 = bind(&f))(test); // No compile error function<int (void)> functorized_f(&f); (_1 = functorized_f)(test); // Compile error return 0; } This is what my question really boils down to: just like naming delayed variables, is it possible to predefine and name the result of a call to bind() outside a lambda expression? /*what goes here?*/ bound_f = bind(&f); (_1 = bound_f)(test);

1 0

boost::filesystem -- handling dead symlinks
by Matthias Kaeppler 21 Feb '05

21 Feb '05

Hello, I wonder if there is any means of telling boost::filesystem::directory_iterator to skip broken symlinks. It's sort of an annoyance working with them, since operations like is_directory will throw when invoked on a broken symlink. I am keeping a vector of boost::filesystem::pathS, and as soon as I operate on a broken symlink, an exception will be thrown. I do catch it, but that doesn't really help since the program will return from the method where the exception was thrown. I would find it much more convenient to simply skip these broken files, instead of jumping out of the procedure (IMO it's not even exceptional behavior, dead symlinks are pretty common). Any idea what I can do about this? -- Matthias Kaeppler

3 4

MPL iterator category
by Philippe Mori 21 Feb '05

21 Feb '05

In C++ Template Metaprogramming book, there is the expression i::category in tables 5.1, 5.2 and 5.3 that says that the result is convertible to mpl::forward_iterator_tag, mpl::bidirectional_iterator_tag and mpl::random_access_iterator_tag respectively. Since a random access iterator is bidirectional iterator which is in turn a forward iterator, I was expecting that i::category for a bidirectional iterator would also be convertible to mpl::forward_tag which is not the case. So if an algorithm has to works differently for random-access iterator but it the same for forward and bidirectional iterator, it seems to me that I would need some extra logic to uses forward iterator algorithm if I have a bidirectional iterator as theree are no implicit conversion. In fact, in the implementation we derives from int_<n> where n is 0, 1 or 2 depending on the iterator type. Philippe

3 2

boost::normal_distribution in boost 1.32
by Roman 21 Feb '05

21 Feb '05

Hi all. I observe boost::normal_distribution always return "nan" with all RNGs whereas other distributions behave normally. I'm talking about boost 1.32 - in earlier version boost::random has different interface.

2 2

Boost 1.32.0 and VS.NET 2005 under AMD64
by p.klotz＠icoserve.com 21 Feb '05

21 Feb '05

There exist a few problems when trying to compile Boost 1.32.0 under AMD64 with VS.NET 2005: * No toolset exists to compile Boost 1.32.0 native on the AMD64 platform (no cross compile). The attached file vc-8_0-amd64-tools.jam fixes that. * InterlockedExchange() in line 44 of lwm_win32.hpp collides with a macro of the same name in WinBase.h One finds in WinBase.h: #elif defined(_M_AMD64) && !defined(RC_INVOKED) ... #define InterlockedExchange _InterlockedExchange I changed the name of Boost's function to InterlockedExchangeBoost() to avoid this problem. * No type long_type exists when compiling with the Microsoft Compiler. The 64Bit part in lwm_win32.hpp seems to have been written for the Intel Compiler. An additional #ifdef now checks if the 64Bit compiler is from Intel or Microsoft. The InterlockedExchange() and long_type issues are fixed by boost_1_32_0-AMD64.patch. Maybe these changes can be integrated in some form in the next version of Boost. Best regards, Peter.

1 0

Creating a mst graph from another, undirected one
by aitor 21 Feb '05

21 Feb '05

Hello, i'm working with a (huge) undirected graph, with severeal internal properties in both vertices and edges, including weights. At one point, i compute the minumim spanning tree of the graph. The question is simple: how can i create another graph (a tree, so a directed graph) from the original undirected graph plus the list of edges conforming the mst ? And how can i do it _efficiently_ (considering that the original graph will be huge) ? Consider this seudo-code: #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/property_map.hpp> #include <boost/graph/properties.hpp> #include <boost/graph/kruskal_min_spanning_tree.hpp> typedef adjacency_list < boost::listS, boost::vecS, boost::undirectedS, VertexProperties, EdgeProperties> UGraph; typedef adjacency_list < boost::listS, boost::vecS, boost::directedS, VertexProperties, EdgeProperties> MSTree; void createGraph() { UGraph g; add_vertices(); add_edges(); compute_edges_weights(); vector<graph_traits<UGraph>::edge_descriptor> mst_edges(num_vertices(g)); kruskal_minimum_spanning_tree(g, back_inserter(mst_edges)); // At this point i want to create another graph of type MSTree from // g and mst_edges. How can i do it efficiently ? } thank you in advance aitor

2 5

Boost graph problem removing last vertex
by gast 128 21 Feb '05

21 Feb '05

Dear all, I have a graph, but when I remove the last vertex, the edge isn't removed. This can even lead to a crash. typedef boost::adjacency_list<boost::listS, boost::vecS, //or listS, same problem boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::string> > > GraphCrash; typedef boost::graph_traits<GraphCrash>::vertex_descriptor vertex_t; typedef boost::graph_traits<GraphCrash>::edge_descriptor edge_t; typedef boost::graph_traits<GraphCrash>::vertex_iterator vertex_iterator; typedef boost::graph_traits<GraphCrash>::edge_iterator edge_iterator; GraphCrash graph; //vertices vertex_t v1 = boost::add_vertex(graph); boost::put(boost::vertex_name, graph, v1, "v1"); vertex_t v2 = boost::add_vertex(graph); boost::put(boost::vertex_name, graph, v2, "v2"); //edges boost::add_edge(v1, v2, graph); //remove last vertex boost::remove_vertex(v2, graph); //should not give any edge, however...: std::pair<edge_iterator, edge_iterator> prEdges; for (prEdges = boost::edges(graph); prEdges.first != prEdges.second; ++prEdges.first) { const edge_t e = *prEdges.first; const vertex_t u = boost::source(e, rGraph); const vertex_t v = boost::target(e, rGraph); } Do I something wrong? I use vc++ 7.1. Wkr, me (btw entering this message through gmane, it bounces back, with error that is is a top posting. Strange...) _________________________________________________________________ Talk with your online friends with MSN Messenger http://messenger.msn.nl/

4 4

regex/string algorithm problem
by The Grumpiest Man You Know 21 Feb '05

21 Feb '05

Hi, I think this is a bug but I'm willing to believe I'm misusing something. As a side point, I'm unsure of how to choose the regex syntax. I think I use boost::regex::perl as the second argument to the constructor but I haven't had much look with either that or the char_classes value. Anyway for me the snippet below the ----s hangs in the second find_all_regex. Ok, it may not hang, it may be building up a nice big core to dump but I only leave it for 20 seconds or so. This started with me trying to use find_regex which segfaulted when I tried to increment the iterator for the first time. I thought that might be me so I tried the safer way of just asking someone else to do all the real work :). This might prompt calls of "known issue." if I haven't messed up. In which case would someone care to hit me with a clue stick as to how I should check before bugging the list? Thanks for your time. Using Debian unstable: ii libboost-regex 1.32.0-2 regular expression library for C++ ii libboost-regex 1.32.0-2 regular expression library for C++ which I'm pretty sure is one for the library and one for the dev headers but I'm a noob there too, so I could be wrong. The compiler is: $ g++ -v Reading specs from /usr/lib/gcc-lib/i486-linux/3.3.5/specs Configured with: ../src/configure -v --enable-languages=c,c++,java,f77,pascal,objc,ada,treelang --prefix=/usr --mandir=/usr/share/man --infodir=/usr/share/info --with-gxx-include-dir=/usr/include/c++/3.3 --enable-shared --with-system-zlib --enable-nls --without-included-gettext --enable-__cxa_atexit --enable-clocale=gnu --enable-debug --enable-java-gc=boehm --enable-java-awt=xlib --enable-objc-gc i486-linux Thread model: posix gcc version 3.3.5 (Debian 1:3.3.5-8) -------------- #include <string> #include <iostream> #include <boost/algorithm/string_regex.hpp> template<class T> std::ostream& operator<<(std::ostream& cout, const std::vector<T>& v) { std::copy(v.begin(), v.end(), std::ostream_iterator<T>(cout, " ")); return cout; } main() { std::string line1("word -opt 5 -opt 45M -flag word -flag -opt word"); typedef boost::find_iterator<std::string::iterator> fi; for (fi i = boost::make_find_iterator(line1, boost::first_finder("word", boost::is_equal())); ! i.eof(); ++i) { std::cout << boost::copy_iterator_range<std::string>(*i) << std::endl; } std::vector<std::string> result; boost::regex rx1(" [-a-z]*"); boost::find_all_regex(result, line1, rx1); std::cout << result.size() << result << std::endl; result.clear(); boost::regex rx2("[-a-z]*"); boost::find_all_regex(result, line1, rx2); std::cout << result.size() << result << std::endl; std::cout << line1 << std::endl; } -- Blue Skies

2 1

Errors in date_time module
by Markus Petermann 20 Feb '05

20 Feb '05

Hello! I tried to build the date_date libraries of Boost 1.31.0 with a gcc 2.95.2 compiler on a SuSE 7.0 Linux system. I discovered several problems: 1. Several header and source files try to include the sstream header file. This header is not available for gcc 2.95.2. I solved this problem by using #if defined(BOOST_NO_STRINGSTREAM) ... #else ... #endif constructions to include the correct header file and use the correct class. 2. In order to trigger the correct header file from error no. 1 the flag BOOST_NO_STRINGSTREAM must be set. This should be done by the config system (e.g. in boost/config/compiler/gcc.hpp). 3. I tried to include the date_time header files into a source file that also uses the Xerces library. This resulted in an error in file boost/date_time/gregorian_calendar.ipp, function gregorian_calendar_base<ymd_type_,date_int_type_>::day_number(const ymd_type& ymd) because of two + operators the compiler can use ( the buildin operator+(int, int) and second one from Xerces ). This error can be solved by doing a static cast to unsigned int for the three classes boost::gregorian::greg_year, greg_month and greg_day. The unsigned int operator is defined for all three classes. I have created two patch files for boost versions 1.31.0 and 1.32.0: http://home.arcor-online.de/markus.petermann/boost_1_31_0.patch http://home.arcor-online.de/markus.petermann/boost_1_32_0.patch Maybe these corrections can be considered for future releases. Best regards, Markus Petermann

4 5

RE: Program options: terminating parsing.
by The Grumpiest Man You Know 20 Feb '05

20 Feb '05

Since I might still be in the moderation queue I don't know how useful this is but ... Thanks for the ears :) I did infact make an object that changed the words to all be a dummy option and it seems to work fine. If there is a simple control I overlooked I'd be happy to hear about it but after sending the late night message and sleeping I think the solution I mumbled is quite fitting. -- Blue Skies

1 0