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

Re: [Boost-users] Problem using regex library in Windows/cygwin
by Diego Molla 01 Mar '07

01 Mar '07

Thanks John, spot on. I've used a new iterator variable for the result of regex_search and it works now. Now the code is: if (regex_search(what[1].str(),what2,attrMarkup)) { > There's at least one issue with your code, in: > if (regex_search(what[1].str(),what,attrMarkup)) { > the result of what[1].str() is a temporary string object: by the time the > call returns the object has gone out of scope, and the iterators stored > in > "what" are invalid. > HTH, John. Diego -- Do you want to know what is going on in Language Technology in Australia and New Zealand? Join ALTA -- http://www.alta.asn.au/ This message is intended for the addressee named and may contain confidential information. If you are not the intended recipient, please delete it and notify the sender. Views expressed in this message are those of the individual sender, and are not necessarily the views of Macquarie University. --------------------------------------------------------------------- Diego MOLLA ALIOD diego(a)ics.mq.edu.au Department of Computing http://www.ics.mq.edu.au/~diego Macquarie University

1 0

[filesystem] ..\foo\bar - invalid path syntax?
by n.torrey.pines 01 Mar '07

01 Mar '07

Hi As you know, on Windows, it is conventional to use backslashes in paths. I am not out to teach Windows users a different convention, let alone "generic syntax". So I'd like to construct paths from strings like ..\foo\bar. The constructors like path(const std::string&) treat this as an invalid syntax however (changing '\' to '/' works fine). Is there a different procedure I should invoke that respects the native platform syntax? I've looked in the docs, but I didn't find it. There are only procedures for native printing. I could of course manually replace '\' with '/' in the string, but such solution probably wouldn't be very robust. Thanks

1 0

[type_traits] is_function
by Cromwell Enage 28 Feb '07

28 Feb '07

Assuming a compiler supports is_function, will this metafunction check for the presence of member functions in a class? For example: struct Foo { void bar(); }; struct Baz { }; Given the right template argument, will is_function detect the bar() function in Foo but return false_ for Baz? If so, what is the right template argument? If not, are there any known workarounds? Cromwell D. Enage ____________________________________________________________________________________ Finding fabulous fares is fun. Let Yahoo! FareChase search your favorite travel sites to find flight and hotel bargains. http://farechase.yahoo.com/promo-generic-14795097

2 2

[Boost-Users][serialization] Floating point precision
by jsanga＠cox.net 28 Feb '07

28 Feb '07

Is there a way to specify the precision of doubles when writing to xml_oarchive? Refer to the output snippet below. <Control class_id="3" tracking_level="0" version="1"> <Type>0</Type> <LowMZ>5.0499999999999998</LowMZ> <HiMZ>5.0999999999999996</HiMZ> I would like 5.05 and 5.1 for Low and High. Stepping through the code with the debugger I ended up in basic_text_oprimitive::save( const double t). void save(const double t) { if(os.fail()) boost::throw_exception(archive_exception(archive_exception::stream_error)); os << std::setprecision(std::numeric_limits<double>::digits10 + 2); os << t; } where it seems the precision is fixed. The only solution I can seem to think of is to split the serialization, and on the output convert my double to string (with the correct precsion) and then serialize the string. Is there a different or better way?

2 1

[Boost.MultiIndex] Problem using dataelement from derived class as key
by Manuel Jung 28 Feb '07

28 Feb '07

Hi, Im having a problem. I derive class B from class A. class a has the member A::id. I want to use this one as key for my MultiIndexContainer. But i get the following compiling errors: test.cpp:41: Fehler: Templateargument »&A::id« konnte nicht in »unsigned int B::*« umgewandelt werden test.cpp:42: Fehler: Templateargument 2 ist ungültig test.cpp:43: Fehler: Templateargument 1 ist ungültig test.cpp:44: Fehler: Templateargument 2 ist ungültig Sorry it on german. A testfile for reproducing my problem is attached. Can someone help? thanks.. Greetings Manuel Jung

2 3

[boost][circular_buffer] problem using copy contructor
by Andreas Rose 28 Feb '07

28 Feb '07

Hello, I'm new to circular_buffer. After reading the documentation i expect the following should work: const int c = 5; boost::circular_buffer<int> cb1(c); assert(cb1.capacity() == c); boost::circular_buffer<int> cb2(cb1); assert(cb2.capacity() == c); //failed, capacity() returns 0 But it does'nt work. After looking into the code of circular_buffer, i think the copy c'tor should be changed into something like this: circular_buffer(const circular_buffer<T, Alloc>& cb) : m_size(cb.size()), m_alloc(cb.get_allocator()) { initialize(cb.capacity()); BOOST_TRY { cb_details::uninitialized_copy(cb.begin(), cb.end(), m_buff, m_alloc); } BOOST_CATCH(...) { deallocate(m_buff, cb.capacity()); BOOST_RETHROW } BOOST_CATCH_END } Or do i missunderstand the documentation? I'm using vs2003 and the latest version of circular_buffer from boost-sandbox in ordinary debug mode. Thanks. Andreas Rose

1 0

Problem using regex library in Windows/cygwin
by Diego Molla 28 Feb '07

28 Feb '07

Hi, I have a problem using the Boost regex library. I have isolated the problem to the attached piece of code. For some reason the output returned by the function that uses regex is garbage. I have tested the same program on a Linux version of boost and it works fine. I wonder if the problem is on the Windows installation. Could someone using Windows or Cygwin test this and tell me if it works? I've just re-installed the cygwin version (1.33.1-3) and I still get the same error. Here is a typical interaction. It should extract the XML attribute and value but instead it returns garbage: [diego@valencia ~...af/src]$ g++ -o regexError.exe regexError.cpp -lboost_regex-gcc-mt [diego@valencia ~...af/src]$ regexError Write a fragment of XML: this <test arg="a1">is a test</test> yeah Write the XML tag to search: test Found element is a test Searching arg="a1" Found attribute 1g with value a1 Write a fragment of XML: this <test a2="more">is another test</test> Write the XML tag to search: test Found element is another test Searching a2="more" Found attribute or with value morY Write a fragment of XML: end [diego@valencia ~...af/src]$ -- Do you want to know what is going on in Language Technology in Australia and New Zealand? Join ALTA -- http://www.alta.asn.au/ This message is intended for the addressee named and may contain confidential information. If you are not the intended recipient, please delete it and notify the sender. Views expressed in this message are those of the individual sender, and are not necessarily the views of Macquarie University. --------------------------------------------------------------------- Diego MOLLA ALIOD diego(a)ics.mq.edu.au Department of Computing http://www.ics.mq.edu.au/~diego Macquarie University

2 1

[graph] patch to automatically build libbgl-viz.so and libbgl-viz.a
by David Baird 28 Feb '07

28 Feb '07

Hi, I'm interested in helping make the BGL easier to use right out-of-the-box. But, I'm not an expert at Boost (or Jamfiles) yet, so please guide me if this is wrong. I tried to patch the Jamfile so that it automatically builds the Graphgiz parser libraries (libbgl-viz.so and libbgl-viz.a). I only tested Jamfile (not Jamfile.v2) on some Gentoo boxes with gcc-4.1.1 and gcc-3.3.5 and it worked nicely. Some other future improvements I would like to do are to improve the Graphviz parser (to be able to parse more varieties of .dot files) and to review the documentation and check it for correctness (I already submitted some patches about half a year ago for a couple mistakes that I found). Please let me know what you think. Without further ado, here's the patch: Index: boost_1_33_1/libs/graph/build/Jamfile =================================================================== --- boost_1_33_1.orig/libs/graph/build/Jamfile +++ boost_1_33_1/libs/graph/build/Jamfile @@ -33,6 +33,21 @@ GRAPHVIZ_DEFS(graphviz_digraph_parser) = } local gGENERATOR_FUNCTION(LIB) = bgl-lib-file ; + dll bgl-viz + : ../src/$(SOURCES).cpp + : <sysinclude>$(BOOST_ROOT) <define>YY_NO_UNISTD_H + <runtime-link>dynamic + <define>BOOST_ALL_DYN_LINK=1 + # Darwin compiler ICEs if we turn optimization on + <darwin><*><debug-symbols>off + <darwin><*><optimization>off + # Intel compiler ICEs if we turn optimization on + <intel-win32><*><optimization>off + <vc-7_1><*><cxxflags>-GR- + : debug <inlining>on #inlining prevents linker name clashes due to truncation! + <debug-symbols>off # Debugging symbols become HUGE + ; + lib bgl-viz : ../src/$(SOURCES).cpp : <sysinclude>$(BOOST_ROOT) <define>YY_NO_UNISTD_H @@ -47,4 +62,7 @@ GRAPHVIZ_DEFS(graphviz_digraph_parser) = ; + install bgl-viz lib + : <dll>bgl-viz <lib>bgl-viz + ; } Index: boost_1_33_1/libs/graph/build/Jamfile.v2 =================================================================== --- boost_1_33_1.orig/libs/graph/build/Jamfile.v2 +++ boost_1_33_1/libs/graph/build/Jamfile.v2 @@ -24,3 +24,5 @@ obj graphviz_digraph_lex : graphviz_lex. <implicit-dependency>graphviz_digraph_parser ; obj graphviz_digraph_parser : graphviz_parser.yy : <bison.prefix>bgl_dir_ <define>GRAPHVIZ_DIRECTED=1 ; + +boost-install bgl-viz ;

1 1

[program_options] unsigned variables silently cast
by Torrey Pines 28 Feb '07

28 Feb '07

Hi With the current implementation, unsigned variables accept negative values, that get silently cast. E.g. on my platform, if "--length" expects size_t, --length -32 assigns it a value 4294967264 without warnings or errors. This behavior surprised me, and I'm using a workaround (parsing an int, and checking its range manually). However, is this an intended feature of the library? Thanks

2 1

[program_options] disable partial matches
by Torrey Pines 28 Feb '07

28 Feb '07

Hi With the current implementation, the user does not have to supply the full option names, e.g. "--he" is as good as "--help", unless there is an ambiguity. Is there any way to disable this, i.e. allow only full matches? Thanks

2 1

[program_options] checking the presence of required arguments
by Torrey Pines 28 Feb '07

28 Feb '07

Hi My program has a bunch of required arguments. I grouped them into one options_description: options_description required("Required options"); required.add_options() /* .... */ ; // ... options_description desc("Allowed options"); desc.add(required).add(other); I'd like to check that all required arguments are in fact supplied without having to do if(vm.count("arg1") == 0) { cerr << "usage error: arg1 is required\n"; return 1; } for each of them. Any suggestions? Thanks

2 1

boost::any template argument deduction
by Digvijoy Chatterjee 28 Feb '07

28 Feb '07

Hi, I have a function template like : template <class A> A what_type ( const boost::any &operand ){ A a; a = boost::any_cast<a>(operand); return a; } The idea is to provide the client code an easy way extract the type hidden by the boost::any value, Now there is no way to make the compiler deduce the type to return from an expression like below: std::string s = "hello"; boost::any a = s; some_op( what_type(a) ); //calls some_op(string &); Instead now the client has to write code using type() which returns std::typeinfo & if ( a.type().name() == "Ss" ) some_op(what_type<string> a); else if ( a.type().name() == "d" ) some_op(what_type<double> a); Or use functions to test type and cast: if ( is_string (a) ) some_op( what_type<string>(a)); else ( is_int(a) ) some_op ( what_type<int>(a)); ….. Is there any elegant way to handle this problem ?? --Digz

1 0

[MPL] Problem with vector
by Daniel 28 Feb '07

28 Feb '07

Hi, I have few Adapter classes. Each of them provide typedef operations which specifies which operations that Adapter supports (vector_c, with 0 or 1 at appropriate positions). I want to assert that two Adapters support different operations. However, my code doesn't compile. Any ideas? Daniel template<unsigned int N1, unsigned int N2> struct Adapter { typedef vector_c<unsigned int, N1, N2> operations; }; template<class TAdapter1, class TAdapter2> struct Check { typedef typename transform< typename TAdapter1::operations, typename TAdapter2::operations, plus<_1, _2> >::type sum_of_operations; typedef typename max_element<sum_of_operations>::type max_of_operations; BOOST_MPL_ASSERT((less_equal<max_of_operations, int_<1> >)); }; int main() { Check< Adapter<0, 1>, Adapter<1, 0> >(); return 0; }

2 1

[signals] slot<Signature>, slot::track() and bind syntactic sugar
by Frank Mori Hess 27 Feb '07

27 Feb '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I've added template parameters to the slot class in thread_safe_signals for specifying its signature, as slot<Signature> or slot1<R, T1>, etc. So now slots can be bound to each other. I've also dropped the automatic discovery of tracked objects, and added slot::track() functions. There is now some syntactic sugar for bind, if a slot constructor is called with more than one argument, then the arguments will automatically be passed through bind(). I tried using bind<R>(), since the slot knows what its result type should be, but gcc gave me ambiguous overload errors when bind<R> was given a function pointer. There is a little test program in the sandbox now too, at boost-sandbox/libs/thread_safe_signals/test/track_test.cpp. I encountered one problem with the bind syntactic sugar, described in the test program's comments. I found the error message unhelpful, therefore it must be a compiler bug :) - -- Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFF5KRY5vihyNWuA4URAo2mAJ45BAJvKKl8rHPXGsgn7a2fjmDLVQCeLb0R ln07v8CCYxbwE7topMmhZQ4= =4kwy -----END PGP SIGNATURE-----

1 0

[multi index] warning when used in copy constructor: should be explicitly initialized
by Christoph 27 Feb '07

27 Feb '07

Using gcc with option -W I get the following warning when using a Boost.MultiIndex container inside a copy constructor: /usr/local/include/boost-1_33_1/boost/multi_index_container.hpp: In copy constructor 'boost::multi_index::multi_index_container<Value, IndexSpecifierList, Allocator>::multi_index_container(const boost::multi_index::multi_index_container<Value, IndexSpecifierList, Allocator>&) [with Value = ListenMonitor::ListenZeile, IndexSpecifierList = boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<ListenMonitor::ListenZeile>, mpl_::na, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, Allocator = std::allocator<ListenMonitor::ListenZeile>]': liste.hpp:139: instantiated from here /usr/local/include/boost-1_33_1/boost/multi_index_container.hpp:204: warning: base class 'struct boost::multi_index::detail::header_holder<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<ListenMonitor::ListenZeile> >, boost::multi_index::multi_index_container<ListenMonitor::ListenZeile, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<ListenMonitor::ListenZeile>, mpl_::na, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<ListenMonitor::ListenZeile> > >' should be explicitly initialized in the copy constructor The 'ListenMonitori::Listenzeile' stuff is from me. But the issue does not depend on that. I would assume that copying a multi index is not forbidden and using Is there a way to get rid of that warning? I am trying hard to produce warning free code, and in this case I am not sure if the warning is just ugly or if it is a real problem in the code. [gcc --version: gcc (GCC) 4.1.2 20061115 (prerelease) (SUSE Linux) ] I have attached a trivial example that demonstrates the issue. I have modified the example/basic.cpp: I have added a trivial class XXX that contains employee_set. When copying objects of XXX the above warning is issued by gcc. Best regards Christoph

3 9

Possible bugs in date_time package
by Gregory J. Sharp 27 Feb '07

27 Feb '07

I'm trying to use the date_time/ptime module to parse strings. Platform: MacOS X 10.4.7 on Intel Compiler: gcc 4.0.1 I have three potential bugs, so far. Perhaps I'm unreasonable in hoping that the following strings should be acceptable to time_from_string. 1. time_from_string( "2006-12-06" ) != time_from_string( "2006-12-06 00:00:00" ) 2. time_from_string( "2006/12/06" ) throws an exception (probably related to 1) even though time_from_string( "2006,12,06" ) doesn't throw. 3. time_from_string( "2006-12-06 " ) throws an exception because it passes a null string to str_from_delimited_time_duration(), which tries to read the first character of the string, even though there isn't one. I think 1 & 2 are probably caused by parse_delimited_time() doing a split on ' ' and getting nothing to pass to parse_delimited_time_duration(). -- Gregory J. Sharp email: gregor(a)mail.lepp.cornell.edu Wilson Synchrotron Laboratory url: http://www.lepp.cornell.edu/ ~gregor Cornell University ph: +1 607 255 4882 Ithaca, NY 14853 fax: +1 607 255 8062

2 4

multi_index uses serialization?
by Javier Gonzalez 27 Feb '07

27 Feb '07

Hi, I have a simple question. Isn't there a way to create multi_indices without using the serialization library? I don't intend to stream them! thanks, Javier Gonzalez

5 6

State of the Endian library
by Mateusz Loskot 27 Feb '07

27 Feb '07

Hi, What's the state of the Endian library announced [1] by Beman Dawes? Is there any plan to include it to the Boost collection? May be it's already there, but I can not find it? [1] http://thread.gmane.org/gmane.comp.lib.boost.devel/143279 Cheers -- Mateusz Loskot http://mateusz.loskot.net

1 0

shared_ptr and RTTI
by Florin Trofin 27 Feb '07

27 Feb '07

Hello, A few years back, boost::shared_ptr did not require RTTI. I recently discovered that it does now. I understand that there are some benefits that RTTI brings to the new implementation, but I would have expected that there is some compile flag that can be turned on/off. Florin.

1 0

[BGL] How to use an array in bundled property?
by Shufei Fan 27 Feb '07

27 Feb '07

I defined an double array inside bundled vertex property, and have trouble finding ways of accessing it. Neither can I find any where in the document an example on it. Your input will be much appreciated! my graph is defined as follows: struct Node{ // this is hard to access double mode[3]; }; struct Edge{ //no problem access them double nPixels; unsigned short nTh;}; typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, Node, Edge> Graph; //Graph object colGraph Graph colGraph; I have no problem with accessing the 'nPixels' in Edge property, boost::property_map<Graph, double Edge::*>::type ew = get(&Edge::nPixels, *colGraph);//edge weight But I am in a great deal of trouble finding ways of accessing 'mode' in Node property. //compiler error here boost::property_map<Graph, double Node::*>::type nm = get(&Node::mode, *colGraph);//node modeerror message is : //---------------------------------------------------- c:\...\xxx.cpp(236) : error C2440: 'initializing' : cannot convert from 'boost::property_map<Graph,Property>::type' to 'boost::bundle_property_map<Graph,Descriptor,Bundle,T>' with [ Graph=boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS,Node,Edge>, Property=double (Node::* )[3] ] and [ Graph=Graph, Descriptor=boost::property_map<Graph,double Node::* >::descriptor, Bundle=Node, T=double ] No constructor could take the source type, or constructor overload resolution was ambiguous//---------------------------------------------------- neither the following works(I added '[3]' in the parameter list): boost::property_map<Graph, double Node::*[3]>::type nm = get(&Node::mode, *colGraph);//node mode This time errors are raised in the 'property.hpp' file, they are: //---------------------------------------------------- c:\Boost\include\boost-1_33_1\boost\pending\property.hpp(40) : error C2825: 'PropertyTag::kind': cannot form a qualified name c:\Boost\include\boost-1_33_1\boost\graph\properties.hpp(198) : see reference to class template instantiation 'boost::property_kind<PropertyTag>' being compiled with [ PropertyTag=double Node::* [3] ] c:\shufei\VCProjects\edison\segm\GA.cpp(236) : see reference to class template instantiation 'boost::property_map<Graph,Property>' being compiled with [ Graph=Graph, Property=double Node::* [3] ]c:\Boost\include\boost-1_33_1\boost\pending\property.hpp(40) : error C2039: 'kind' : is not a member of 'operator``global namespace'''c:\Boost\include\boost-1_33_1\boost\pending\property.hpp(40) : error C2146: syntax error : missing ';' before identifier 'type'c:\Boost\include\boost-1_33_1\boost\pending\property.hpp(40) : error C2955: 'boost::type' : use of class template requires template argument list c:\Boost\include\boost-1_33_1\boost\type.hpp(14) : see declaration of 'boost::type'c:\Boost\include\boost-1_33_1\boost\pending\property.hpp(40) : fatal error C1903: unable to recover from previous error(s); stopping compilation//----------------------------------------------------thanks, _________________________________________________________________ Connect to the next generation of MSN Messenger http://imagine-msn.com/messenger/launch80/default.aspx?locale=en-us&source=…

1 0

faq How to compile graph?
by fcvcnet 27 Feb '07

27 Feb '07

Hi all, I know BGL just a few days. I need yours help. Now I only want to use the graph in the boost1.33.1 , how can I compile the only one component graph in vc6 or vs2005. So much thanks to your detail reply. Thanks again.

4 4

[lambda] beginner's woes
by Imre Palik 27 Feb '07

27 Feb '07

Hi, I try to use boost::lambda in the following function: string build_headers(shared_ptr<connection> conn, vector<wstring> headers) { if (headers.empty()) return ""; return accumulate(++headers.begin(), headers.end(), string(1, '\'') + conn->quote(headers[0]) + '\'', (_1 + ", '" + bind(&connection::quote, var(conn), _2) + '\'')); } and wisual studio gives me the following error message error C2664: 'boost::lambda::bind' : cannot convert parameter 1 from 'overloaded-function' to 'SOCKET' 1> Context does not allow for disambiguation of overloaded function Could anybody help me decypher this message? What is this 'SOCKET' and how does it come into the picture? Thanks ImRe

1 0

[signals] slot with no SlotFunction template parameter
by Frank Mori Hess 26 Feb '07

26 Feb '07

I'm implementing a more feature-full slot class with some of the things that have been discussed recently. In particular, it is templated only on signature. It uses a templated constructor to store the slot function in a pimpl object that is templated by both signature and slot function type. So now I'm about to rip out the SlotFunction parameter everywhere from thread_safe_signals, as there no longer seems to be any need for it. I feel like I might be overlooking something though. Is there any reason to keep it? -- Frank

2 2

[signals] thread-safe post-disconnect() cleanup
by Frank Mori Hess 26 Feb '07

26 Feb '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 We could implement a thread-safe post-disconnect callback by using the existing tracking functionality. That is, the connection body could hold a "cleanup" shared_ptr with a custom deleter. The custom deleter would run the user's cleanup callback. A weak_ptr copy of the cleanup shared_ptr would be kept just like it was any other tracked object. When disconnect() is called, the cleanup shared_ptr would be reset. If the signal is being invoked concurrently when disconnect() is called, the cleanup code won't get run until the last invocation is done with the slot and destroys its copy of the cleanup shared_ptr. BTW, I've added support for a two-parameter version of signals::track() to thread_safe_signals/track.hpp. It seems to work okay, the only thing I don't like about it is it implies there a coupling required between the value and the tracked shared_ptr, when really there isn't. - -- Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFF3iTv5vihyNWuA4URAkzWAKDHL0MjcFGmAvKbWoBYmhNN5RiCMACgypCS SLJPrYcUaR0u4YTTS35lEZQ= =dCrK -----END PGP SIGNATURE-----

5 58

Re: [Boost-users] [boost::any] - reference vs pointer
by Benjamin Winkler 26 Feb '07

26 Feb '07

References can not be copied. Thus, you can't make boost::any contain a reference (which is what mean when you write boost::any<double&>, I assume). In your example, msgargs.push_back(dref) calls the any-constructor any(const T&) with T being double, and this copies the value, not the reference itself. When you call msgargs.push_back(dptr), it calls the any(const T&) with T being double*. The value is copied again, only this time, the value is a pointer. Benjamin Winkler >Hi all, > >I've been trying out boost::any in a messaging system to package up function arguments. A message >call is basically > >Message::Call(std::vector<boost::any>& args) >{ >try >...a few any_cast<..> >...fire the actual function... >catch >...etc >} > >It's all good, except for one niggling problem. Say I have a double-precision value that I need >changed inside the message, so it needs to be passed as a double* or a double& in an argument. The >problem is, if I create a double& inside a boost::any, it doesn't point to the right memory location >once I'm inside the message, and it looks like it's copying the original dereferenced value and >giving me a reference to the copy. If I create a double* inside a boost::any, I get a new pointer >inside the message like the reference, but because the pointer target is correct everything works. >The code looks like this: > >... >... >std::vector<boost::any> args; >double d = 1.5; >double* dptr = &d; >msgargs.push_back(dptr);//works fine... >double& dref = d; >msgargs.push_back(dref);//seems to copy d instead of a reference to d... >... >msg->Call(args); >... > >I can live with this, I just have to pass "large" objects by pointer so they don't get copied. BUT: > Can anyone tell me why references are creating a copy of the original and not a copy of the >reference, or how I could avoid the copying? Or am I doing something dumb? > >Damien >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users >

3 2

[FileSystem] Getting modified date and time from a file?
by Lawrence Spector 26 Feb '07

26 Feb '07

Does boost provide a portable way to do this? I didn't see an obvious way; I was hoping others might have ideas. Thanks in advance, Lawrence

5 5

[program_options] Documentation of configuration file format?
by Tarjei Knapstad 26 Feb '07

26 Feb '07

I can't seem to find any documentation on what kind of file formats are accepted when calling boost::program_options::parse_config_file(...) Am is missing it or is it missing? :) -- Tarjei

4 7

BoostCon'07 Registration Now Open
by info＠boostcon.com 26 Feb '07

26 Feb '07

The following message is a courtesy copy of an article that has been posted to comp.lang.c++.moderated,comp.std.c++,comp.lang.c++ as well. I'm pleased to announce that the official website for the inaugural Boost conference is up and registration is open: http://www.boostcon.com Due to the very high quality of the submissions we've received, our program committee has been able to assemble a lineup of speakers and topics the likes of which I haven't seen anywhere (http://www.boostcon.com/program) Combine that with the relaxed atmosphere of the conference venue (http://www.boostcon.com/location) and I think we can all look forward to a truly unique and memorable week of working and learning together. I invite you to visit http://www.boostcon.com/registration to register. -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

Filesystem library questions
by Manish Motwani 26 Feb '07

26 Feb '07

Hi, We're creating a new cross-platform dispersed storage technology. Backing up a file from one platform and restoring to another (or the same) is a requirement. We have found boost to be very useful for threads, date/time, program options, etc. We're also currently using the boost filesystem libarary, but we can't figure out why many of the file-metadata query and modifier functions are missing. Can someone from boost let us know if there's any way of querying complete file-metadata (including read/write/execute permissions on windows and linux, ACLs, creation-time in windows, etc.). I found only the following function in version 1.32 (the one we're using): last_write_time (read and write modification time). symbolic_link_exists (check if a file is a sym link). And these new functions have been added since: create_hard_link create_symlink .. and some functionality to get the type of file is also there in the trunk version. But what about the rest of metadata filesystems (POSIX, NTFS, FAT32, HFS, etc) provide? Is this ever going to be included in the library? Is there a way to access this information any other way? I suspect these questions may have been asked by others, so can someone point me to where I can find code to complement the boost filesystem library to handle file-metadata? Thanks, Manish

1 0

Boost date time and MinGW
by Franck Guillaud 25 Feb '07

25 Feb '07

Hello World, I'm doing some experiments to use boost (1.33.1) under Win XP and with MinGW (5.1.3) environment. Boost was compiled with bjam with no particular options. I'm facing some problems on linking with boost_date_time. Here is the simple test program: #include <iostream> #include <string> #include <boost/date_time/posix_time/posix_time.hpp> using namespace std; using namespace boost::posix_time; int main (int argc, char** argv) { char dummy; ptime d1(min_date_time); ptime d2(max_date_time); cout << "min:" << to_simple_string(d1) << endl; cout << "max:" << to_simple_string(d2) << endl; cin.get(dummy); return 0; } Compiling lines are : g++ -DUSE_DATE_TIME_PRE_1_33_FACET_IO -I"E:\dev\boost_1_33_1" -O0 -g3 -Wall -c -fmessage-length=0 -MMD -MP -MF"main.d" -MT"main.d" -o"main.o" "../main.cpp" g++ -L"E:\dev\boost_1_33_1\stage\lib" -o"TestBOOST.exe" ./main.o -lboost_date_time-mgw-mt-d-1_33_1 I get the error (simplified output) : E:/dev/boost_1_33_1/boost/date_time/gregorian/greg_weekday.hpp: undefined reference to `boost::gregorian::greg_month::as_long_string() const' If I remove the lines with *to_simple_string*, I get no error. From the docs [*] it seems there may be a problem for streams support for some compilers, so I tryed to define USE_DATE_TIME_PRE_1_33_FACET_IO in my project, but with no effect. Does it needs to be done when compiling boost ? Is there any other way to solve my link problem ? (appart not using string output for dates :-) ) Thanks for any help. Franck,e- [*] http://www.boost.org/doc/html/date_time/details.html#date_time.buildinfo

2 2

Any reasons why an exception would not be caught by BOOST_CHECK_THROW?
by Stephen Torri 25 Feb '07

25 Feb '07

I have an exception class that is not getting caught my BOOST_CHECK_THROW. Here is a similar setup to what I have: class Base_Exception : public virtual std::exception { public: virtual ~Base_Exception() throw{} virtual const char* what () const throw() = 0; virtual const char* name () const throw() = 0; boost::uint32_t const& id () const throw(); private: boost::uint32_t id; }; class Child_Exception : public virtual Base_Exception { public: enum ERROR_ID { INVALID_API_INPUT, CANNOT_FIND_TARGET, INTERNAL_LIBRARY_ERROR, }; Child_Exception ( ERROR_ID message_id ); virtual ~Child_Exception () throw () {} virtual const char* what () const throw(); virtual const char* name () const throw(); private: static const char* m_exception_name; static const char* m_messages[]; }; I find that when I use the BOOST_CHECK_THROW ( expression, Child_Exception ) that I still get the test crashing with an uncaught exception. Here is the actual output: terminate called after throwing an instance of 'libreverse::errors::API_Exception' what(): Internal library error has occurred. At this point consider the library unreliable. unknown location(0): fatal error in "test_wrong_sources": signal: SIGABRT (application abort requested) *** errors detected in test suite "Architecture Type Detector suite"; see standard output for details FAIL: test_arch_type_detector I can send the whole test file but I hope this is enough to understand the nature of the problem. Is there a FAQ about BOOST_CHECK_THROW? Stephen

1 0

[graph] birected -> directed adapter?
by Jens Müller 25 Feb '07

25 Feb '07

http://www.boost.org/libs/graph/doc/reverse_graph.html reverses edge directions. Is there an adapter (i.e., has someone written such a thing) that combines in and out edges in a bidirected graph and gives a view as if the graph were undirected? I'd need this for doing BFS independent of edge directions in a bidirected graph.

1 0

Bug in options_description.cpp when offer a long program options to boost::program_options
by Jack Shi 25 Feb '07

25 Feb '07

If you provide a long program options description while using boost, you will encounter such issue, if you using debug version, you will see a debug assertion failed alert, if you using release version, your program will be crashed. following codes can be used to reproduce this issue #include <iostream> #include <boost/program_options.hpp> using namespace std; int main(int argc, char* argv[]) { namespace po = boost::program_options; po::options_description desc("supported options"); desc.add_options() ("help,h", "display this help message,this help will be printed out if you not provide option here!"); std::cout << desc << "\n"; } I have trace this issue, it is located in function format_paragraph in the file options_description.cpp, namespace { void format_paragraph(std::ostream& os, std::string par, unsigned first_column_width, unsigned line_length) { ...... // prevent chopped words // if (lastchar != ' ') && // ((exists(lastchar + 1) && (lastchar + 1 != ' ')) if ((*(line_end - 1) != ' ') && ((line_end < par_end) && (*line_end != ' '))) { // find last ' ' in the second half of the current paragraph line string::const_iterator last_space = find(reverse_iterator<string::const_iterator>(line_end - 1), reverse_iterator<string::const_iterator>(line_begin - 1), ' ') .base(); if (last_space != line_begin - 1) { ...... } if option description is long enough, the find function will be called, and "reverse_iterator<string::const_iterator>(line_begin - 1)" will lead to this issue, may "line_begin - 1" access a invalid space. If there have some guys to confirm it was a bug in boost?

2 1

[conversion] lexical_cast behaviour changed from 1_33_1
by Paul O'Neill 25 Feb '07

25 Feb '07

Compiling the following code on MSVC80, sp1 has different behaviour in the latest CVS head compared to 1_33_1? double dbl(88.8); std::cout << boost::lexical_cast<std::string>(dbl) << std::endl; boost1.33.1 = 88.8 boost::CVS = 88.799999999999997 Any ideas as I prefer the old behaviour? Thanks.

1 0

boost RegEx problem: Invalid content of repeat range
by Michael Radzewitz 25 Feb '07

25 Feb '07

Hello everyone, i have a problem with libboost_regex-gcc-mt-1_33_1.a on a debian Linux and a simple function to test some Names: bool is_valid_name(const char *s) { if(!s) return false; const char* re = "^[a-zA-Z][.*0-9a-zA-Z._-]{4,60}$"; static const boost::regex e(re); return regex_match(s,e); } Everything works well when i put this Funtion in a simple Programm and run it. When I put the same Function in my cgi which is wrapped through fastCgi and handled by an apache webserver i get the following Error message: Invalid content of repeat range so in a simple programm the range check {4,60} in boost regex works but in a more complex program it didd'nt. I have testet the same function on Linux using: libboost_regex-gcc-mt-1_33_1.a and free BSD using: libboost_regex.so.3 and get with both libs the same error message. It would be nice if someone can help me find a solution or tell me what went wrong here. Thanks in advance!

2 1

Boost Preprocessor Question
by Eric Lemings 24 Feb '07

24 Feb '07

Greetings, I was wondering if the following can be done with Boost Preprocessor. Given a list of preprocessor macro names, write a simple program that prints whether each macro is defined and its value if it is defined. In particular, I'd like to know if the following example program could be reduced/simplified with Boost: #include <iostream> using namespace std; #define STRING(x) #x #define STRINGIZE(x) STRING(x) #define IS " is " #define NOT "not " #define DEFINED "defined." #define VALUE " Its value is " extern int main () { #if defined __mips cout << STRING(__mips) IS DEFINED; cout << VALUE STRINGIZE(__mips) << endl; #else cout << STRING(__mips) IS NOT DEFINED << endl; #endif #if defined __unix cout << STRING(__unix) IS DEFINED; cout << VALUE STRINGIZE(__unix) << endl; #else cout << STRING(__unix) IS NOT DEFINED << endl; #endif #if defined __sgi cout << STRING(__sgi) IS DEFINED; cout << VALUE STRINGIZE(__sgi) << endl; #else cout << STRING(__sgi) IS NOT DEFINED << endl; #endif #if defined _COMPILER_VERSION cout << STRING(_COMPILER_VERSION) IS DEFINED; cout << VALUE STRINGIZE(_COMPILER_VERSION) << endl; #else cout << STRING(_COMPILER_VERSION) IS NOT DEFINED << endl; #endif #if defined __GNUC__ cout << STRING(__GNUC__) IS DEFINED; cout << VALUE STRINGIZE(__GNUC__) << endl; #else cout << STRING(__GNUC__) IS NOT DEFINED << endl; #endif return 0; } Thanks, Eric.

2 1

Error in using boost lambda in a template
by Meryl Silverburgh 24 Feb '07

24 Feb '07

Hi, I have code which uses Boost lambda in a template like this: template<class T> bool lessThanXY( T& src, T& dest ) { return (src.getY() < dest.getY()); } template<class T1, class T2> void sortXY(T1& list) { ::sort( list.begin(), list.end(), bind(::lessThanXY<T2>, *(_1), *(_2) ) ); } But when I instantiate the template like this, I get the following compile error: class Rect; typedef list<Rect*> RectList; void sortXYRectList(RectList& rl) { sortXYWithThreshold<RectList, Rect>(rl); } /usr/include/boost/lambda/detail/lambda_traits.hpp:389: error: ignoring 'const' qualifiers added to function type 'bool ()(Rect&, Rect&)const' gmake[5]: *** [RectUtils.o] Error 1 Can you please tell me how to fix my problem ? I did not use 'const' anywhere in my template, why I get this error: error: ignoring 'const' qualifiers added to function type 'bool ()(Rect&, Rect&)const'

1 0

[graph] internal predecessor map
by Jens Müller 24 Feb '07

24 Feb '07

Can I store an edge_descriptor of a predecessor edge as an internal/bundled property? I am currently doing this: struct EdgeProperties; struct VertexProperties { double x; double y; double weight; int dist; boost::graph_traits< boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, VertexProperties, EdgeProperties> >::edge_descriptor pred; int app_height; bool mark; }; struct EdgeProperties { double length; }; int main() { using namespace boost; typedef adjacency_list<vecS, vecS, bidirectionalS, VertexProperties, EdgeProperties> Graph; } This is legal, isn't need? Obviously the definition of EdgeProperties is not needed where it is first used. But is this the proper way to do it, or is there a more elegant way?

1 1

mixing CVS and release
by Torrey Pines 24 Feb '07

24 Feb '07

Hi In general, is it possible to use a CVS version of one Boost component and release versions of everything else (within one program)? If so, is there a description of a procedure for doing that somewhere?

2 1

[program_options] crash in VC++2005
by n.torrey.pines 24 Feb '07

24 Feb '07

In VC++2005 debug mode (Ctrl-F5), this little program aborts: +++++++++++++ begin ++++++++++++++++++++++++ #include <iostream> #include <boost/program_options.hpp> int main(int argc, char * argv[]) { boost::program_options::options_description desc("Allowed options"); desc.add_options() ("some_option", "\ This option description SHOULD be long enough not to fit in one line"); std::cout << desc << '\n'; } ++++++++++++ end +++++++++++++++++++++++++++ The debug assertion failure message is: File: C:\Program Files\Microsoft Visual Studio 8\VC\INCLUDE\xstring Line: 173 Through multiple trials, I found that the error occurs if and only if the option description is long enough not to fit in one line in the window. This is boost-1_33_1 Since I have no prior experience with program_options, perhaps I'm using it incorrectly?

3 3

[serialization] size_t vs unsigned warnings
by n.torrey.pines 23 Feb '07

23 Feb '07

Hi Line 36 in collections_save_imp.hpp says: unsigned int count = s.size(); I'm getting many pages of warnings in VC++2005 stemming from this line. Would it make sense to change that to std::size_t count = s.size() ? If so, should I just edit the line? recompile boost? I'd like to take care of that warning. Thanks

3 3

[Serialization] xml serialization to file and boost::archive::xml_archive_exception (unrecognized XML syntax)
by Andreas Willich 23 Feb '07

23 Feb '07

Hi all I have a annoying problem with xml serialization to a file or std::cout. I want to serialize my own classes to a file via filestream and everytime I get a xml_archive_exception with the error message unrecognized XML syntax. What I want to serialize is a child class from a class hierachy. When I only serialize the part of the mother class (with BOOST_SERIALIZATION_BASE_OBJECT_NVP) it works, but when I also want to save the members of the child classes I get this exception. I have exported every class with BOOST_CLASS_EXPORT and at the base class I have a BOOST_IS_ABSTRACT(baseClass). Gcc brings no warnings or errors and when I use a text archive, all works fine. Has someone an idea what I do wrong or some suggestions? Thanks Andreas Here is my build environment: GCC: Using built-in specs. Target: i686-pc-linux-gnu Configured with: /var/tmp/portage/sys-devel/gcc-4.1.1-r3/work/gcc-4.1.1/configure --prefix=/usr --bindir=/usr/i686-pc-linux-gnu/gcc-bin/4.1.1 --includedir=/usr/lib/gcc/i686-pc-linux-gnu/4.1.1/include --datadir=/usr/share/gcc-data/i686-pc-linux-gnu/4.1.1 --mandir=/usr/share/gcc-data/i686-pc-linux-gnu/4.1.1/man --infodir=/usr/share/gcc-data/i686-pc-linux-gnu/4.1.1/info --with-gxx-include-dir=/usr/lib/gcc/i686-pc-linux-gnu/4.1.1/include/g ++-v4 --host=i686-pc-linux-gnu --build=i686-pc-linux-gnu --disable-altivec --enable-nls --without-included-gettext --with-system-zlib --disable-checking --disable-werror --disable-libunwind-exceptions --disable-multilib --disable-libmudflap --disable-libssp --disable-libgcj --enable-languages=c,c++,fortran --enable-shared --enable-threads=posix --enable-__cxa_atexit --enable-clocale=gnu Thread model: posix gcc version 4.1.1 (Gentoo 4.1.1-r3) Glibc: 2.5 BOOST: CVS Build RC_1_34_0 from 19.02.2007 BJAM: Boost.Jam Version 3.1.13. OS=LINUX. Copyright 1993-2002 Christopher Seiwald and Perforce Software, Inc. Copyright 2001 David Turner. Copyright 2001-2004 David Abrahams. Copyright 2002-2005 Rene Rivera. Copyright 2003-2005 Vladimir Prus.

2 2

VS2005 Toolset for builidng boost targeting x64.
by Michael Doris 23 Feb '07

23 Feb '07

Hi I've had a good search but I can't find out how I might go about building boost targetting x64 using Visual Studio 2005. I've had no problem targetting 32-bit windows. Thanks, Mike Doris

1 0

[multi_index] index based on case-insensitive strings
by Boris 23 Feb '07

23 Feb '07

struct employee { std::string name; }; typedef multi_index_container< employee, indexed_by< hashed_unique<member<employee, std::string, &employee::name> > > > mi; If I want to change the index to make it case-insensitive I have to write my own key extractor, right? Would the following code then be correct (it is based on boost::multi_index::member)? template<class Class, std::string Class::*PtrToMember> struct caseinsensitive_string { typedef std::string result_type; template<typename ChainedPtr> std::string operator()(const ChainedPtr& x) const { return operator()(*x); } std::string operator()(const Class& x) const { return boost::algorithm::to_lower_copy(x.*PtrToMember); } std::string operator()(Class& x) const { return boost::algorithm::to_lower_copy(x.*PtrToMember); } std::string operator()(const boost::reference_wrapper<const Class>& x) const { return operator()(x.get()); } std::string operator()(const boost::reference_wrapper<Class> x) const { return operator()(x.get()); } }; With the following typedef I get a container which does not change the name of an employee (I want to retain the name without making it lower- or uppercase) but refuses items with the same case-insensitive name? typedef multi_index_container< employee, indexed_by< hashed_unique<caseinsensitive_string<employee, &employee::name> > > > mi2; Boris

2 4

[regex] Support for right-to-left parsing?
by Geraint Bundy 23 Feb '07

23 Feb '07

Hello, Does Boost::Regex support "backwards" or right-to-left parsing (like .NET's regex)? If not, then is it possible to emulate this behaviour using normal parsing? Thanks, Geraint

2 1

Linker error when using boost::wregex (MSVC)
by Fernando Cuenca 23 Feb '07

23 Feb '07

Hi, I'm trying to use the regex library (from boost 1.33) with the MSVC.NET 2003 and I'm getting the following linker error when using the wide character version of the classes: libboost_regex-vc71-mt-1_33_1.lib(usinstances.obj) : error LNK2005: "public: static bool __cdecl std::char_traits<unsigned short>::eq(unsigned short const &,unsigned short const &)" (?eq@?$char_traits@G@std@@SA_NABG0@Z) already defined in msvcprt.lib(MSVCP71.dll) libboost_regex-vc71-mt-1_33_1.lib(usinstances.obj) : error LNK2005: "public: static unsigned int __cdecl std::char_traits<unsigned short>::length(unsigned short const *)" (?length@?$char_traits@G@std@@SAIPBG@Z) already defined in msvcprt.lib(MSVCP71.dll) Declaring a single wregex object is enough to get the error. Everything works fine for regular regex objects (using regular std::strings.) Any ideas how to solve this problem? Thanks in advance. Saludos! Fernando. -------------------------------------------------------------------------------------------------------------------- Confidentiality Notice: The information in this email is confidential and may be privileged. It is intended solely for the addressee(s). If the reader of this message is not the intended recipient, any disclosure, copying, distribution, retention or action taken or omitted to be taken in reliance on it is prohibited. If you have received this communication in error, please notify us immediately by replying to the message or by telephoning either 905-624-1260 or 1-888-672-5471 and deleting it and any attachments from your computer system.

2 1

[multi_index] function to force to recreate indexes?
by Boris 23 Feb '07

23 Feb '07

I have two multi_index_containers with smart pointers which refer to the same objects (at least some of the pointers refer to the objects). When I access and modify an object via an index of one of the two multi_index_containers the indexes of that container are recreated as far as I understand. But how do I make the other multi_index_container recreate its indexes? I can't and don't need to modify the object again. Is there anything to force a multi_index_container to recreate its indexes? Boris

3 9

iterator_range error
by abir basak 23 Feb '07

23 Feb '07

I am facing problem related to iterator_range. It's type is not propagating properly, when I return such thing from a function. (compiler VS 7.1 ,Windows ) The code below shows it. This is an extension of a vector, which returns range. typedef std::pair<std::size_t,std::size_t> pair_t; typedef std::vector<std::size_t> index_t; template<typename T> class vector_e : private std::vector<T>{ public: typedef vector_e<T> self_type; typedef typename std::vector<T>::iterator iterator; typedef typename std::vector<T>::const_iterator const_iterator; typedef typename std::vector<T>::pointer pointer; typedef typename std::vector<T>::const_pointer const_pointer; typedef typename std::vector<T>::reference reference; typedef typename std::vector<T>::const_reference const_reference; typedef typename std::vector<T>::difference_type difference_type; typedef typename std::vector<T>::size_type size_type; //typedef sub_range_t<self_type> range; //typedef sub_range_t<const self_type> const_range; typedef typename std::vector<T>::size_type size_type; typedef typename boost::permutation_iterator<typename iterator,typename index_t::const_iterator> index_iterator; typedef typename boost::permutation_iterator<typename const_iterator,typename index_t::const_iterator> const_index_iterator; //typedef sub_range_t<self_type,index_iterator,const_index_iterator> index_range; //typedef sub_range_t<self_type,const_index_iterator,const_index_iterator> const_index_range; typedef boost::iterator_range<index_iterator> index_range; typedef boost::iterator_range<const_index_iterator> const_index_range; typedef boost::sub_range<self_type> range; typedef boost::sub_range<const self_type> const_range; vector_e() : std::vector<T>(){} using std::vector<T>::begin; using std::vector<T>::end; using std::vector<T>::operator []; using std::vector<T>::insert; const_iterator const_begin()const{ return begin(); } const_iterator const_end()const{ return end(); } index_iterator begin_i(const index_t& i){ return boost::make_permutation_iterator(begin(),i.begin()); } const_index_iterator begin_i(const index_t& i)const{ return boost::make_permutation_iterator(begin(),i.begin()); } index_iterator end_i(const index_t& i){ return boost::make_permutation_iterator(begin(),i.end()); } const_index_iterator end_i(const index_t& i)const{ return boost::make_permutation_iterator(begin(),i.end()); } range get_range(const pair_t& r){ return boost::make_iterator_range(begin()+r.first,begin()+r.second); } const_range get_range(const pair_t& r)const{ return boost::make_iterator_range(begin()+r.first,begin()+r.second); } index_range get_range(const index_t& i){ index_iterator b = boost::make_permutation_iterator(begin(),i.begin()); index_iterator e = boost::make_permutation_iterator(begin(),i.end()); return boost::make_iterator_range(b,e); } const_index_range get_range(const index_t& i)const{ const_index_iterator b = boost::make_permutation_iterator(begin(),i.begin()); const_index_iterator e = boost::make_permutation_iterator(begin(),i.end()); return boost::make_iterator_range(b,e); } }; Now, to use it like this, typedef vector_e<trace> trace_buffer; typedef boost::permutation_iterator<trace_buffer::iterator,index_t::iterator> index_iterator; typedef boost::sub_range<trace_buffer> trace_range; typedef boost::iterator_range<index_iterator> trace_index_range; trace_buffer traces; struct character{ index_t index; trace_index_range get_traces(){ index_iterator b = boost::make_permutation_iterator(traces.begin(),index.begin()); index_iterator e = boost::make_permutation_iterator(traces.begin(),index.end()); //return boost::make_iterator_range(b,e); return traces.get_range(index);///This doesn't work, while previous commented line works ! } }; Thus to say, I am unable to forward a call to iterator_range from one function to another preserving the type. (Previously the same problem was there with sub_range with 1.33.1 download. Now that one is solved with a later cvs version ) . Any help is appreciated .... thanks' abir -- Abir Basak, Member IEEE Software Engineer, Read Ink Technologies B. Tech, IIT Kharagpur email: abir(a)abirbasak.com homepage: www.abirbasak.com

2 1

guid
by Christian Henning 23 Feb '07

23 Feb '07

Hi there, I find it a bit weird why the guid needs to be built. I think the designer did it because of the sha1 lib. But how about having guid lib header only when you want everything but the create_v5 part? I think that would make sense. I wouldn't mind reorganizing the code. Christian

3 2

[serialization] conditional serialization of members and base classes
by n.torrey.pines 23 Feb '07

23 Feb '07

Hi The logic I want to implement is: * b contains a * when saving b, save a, followed by other data * when loading b, load a into a temporary, if it matches b.m_a, load other data Would you expect the following code to work? class b { a m_a; // a is serializable vector<int> m_v; // other data template<class Archive> void save(Archive& ar, const unsigned version) const { ar & m_a; ar & m_v; } template<class Archive> void load(Archive& ar, const unsigned version) { a tmp; ar & tmp; if(tmp == m_a) ar & m_v; } // ... }; Now, what if b is derived from a instead of containing it? Would this work? class b : public a { vector<int> m_v; // other data template<class Archive> void save(Archive& ar, const unsigned version) const { ar & boost::serialization::base_object<a>(*this); ar & m_v; } template<class Archive> void load(Archive& ar, const unsigned version) { a tmp; ar & tmp; if(tmp == static_cast< const a& >(*this)) ar & m_v; } // ... }; Thanks!

2 3

[Review][Bimap] Bimap review extended until March 2nd
by Ion Gaztañaga 22 Feb '07

22 Feb '07

Hi to all, Bimap review has been extended until March 2nd. I encourage all boosters to give a try to this great library. The links are: Start reading the documentation here: http://tinyurl.com/y95qng And download the library here: http://boost-consulting.com/vault/index.php?&directory=Containers Regards, Ion

1 0

feature request: documentation on possible linker problems
by Maarten Nieber 22 Feb '07

22 Feb '07

Hi, is it possible to add some documentation about possible linker conflicts when boost is used inside dlls and static libs? At the moment, my colleagues worry about using boost in our dlls or static libs, because when we give our (binary) libraries to a third party, the boost symbols in our libraries might give a conflict with boost symbols in the executable of the third party. I tried to solve this puzzle myself, but could not find a conclusive answer, which leads me to believe that this issue may be relevant for the boost documentation. Notably, I'm interested to know if this problem can occur if we only use boost header files but not binaries. Thanks in advance, Maarten Nieber ____________________________________________________________________________________ No need to miss a message. Get email on-the-go with Yahoo! Mail for Mobile. Get started. http://mobile.yahoo.com/mail

1 0

(no subject)
by Maarten Nieber 22 Feb '07

22 Feb '07

Hi, is it possible to add some documentation about possible linker conflicts when boost is used inside dlls and static libs? At the moment, my colleagues worry about using boost in our dlls or static libs, because when we give our (binary) libraries to a third party, the boost symbols in our libraries might give a conflict with boost symbols in the executable of the third party. I tried to solve this puzzle myself, but could not find a conclusive answer, which leads me to believe that this issue may be relevant for the boost documentation. Notably, I'm interested to know if this problem can occur if we only use boost header files but not binaries. Thanks in advance, Maarten Nieber ____________________________________________________________________________________ Be a PS3 game guru. Get your game face on with the latest PS3 news and previews at Yahoo! Games. http://videogames.yahoo.com/platform?platform=120121

1 0

Re: [Boost-users] How to access bundled properties individually?
by Shufei Fan 22 Feb '07

22 Feb '07

This question is regarding to BGL, I should have included it on the title. Actually, thank goes to Aaron Windsor. From: fansf(a)hotmail.comTo: boost-users(a)lists.boost.orgSubject: How to access bundled properties individually?Date: Thu, 22 Feb 2007 19:39:10 +0000 First, Thank Doug for answering my previous question on parallel edges. Now, my question is:How to access bundled property individually? I defined my graph like this: struct Node{ int label; int mode[3]; //...;};struct Edge{ double nCommBord;}; typedef boost::adjacency_list< boost::setS, boost::vecS, boost::undirectedS, Node, Edge> Graph;but when I want to access property nCommBord of Edge, there seems to be wrong with my property_map type definition. Anyone can point out for me, what is the right version(I cannot seem to find any comment on this kind of usage)? //get edgeWeight propertyproperty_map<Graph, &Edge::nCommBord>::type p_e = get(&Edge::nCommBord, *rowGraph); The error:c:\...\VCProjects\...xxx.cpp(55) : error C2974: 'boost::property_map' : invalid template argument for 'Property', type expected c:\Boost\include\boost-1_33_1\boost\graph\properties.hpp(205) : see declaration of 'boost::property_map'Thanks, Shufei Connect to the next generation of MSN Messenger Get it now! _________________________________________________________________ Explore the seven wonders of the world http://search.msn.com/results.aspx?q=7+wonders+world&mkt=en-US&form=QBRE

1 0

How to access bundled properties individually?
by Shufei Fan 22 Feb '07

22 Feb '07

First, Thank Doug for answering my previous question on parallel edges. Now, my question is: How to access bundled property individually? I defined my graph like this: struct Node{ int label; int mode[3]; //...;};struct Edge{ double nCommBord;}; typedef boost::adjacency_list< boost::setS, boost::vecS, boost::undirectedS, Node, Edge> Graph; but when I want to access property nCommBord of Edge, there seems to be wrong with my property_map type definition. Anyone can point out for me, what is the right version(I cannot seem to find any comment on this kind of usage)? //get edgeWeight propertyproperty_map<Graph, &Edge::nCommBord>::type p_e = get(&Edge::nCommBord, *rowGraph); The error: c:\...\VCProjects\...xxx.cpp(55) : error C2974: 'boost::property_map' : invalid template argument for 'Property', type expected c:\Boost\include\boost-1_33_1\boost\graph\properties.hpp(205) : see declaration of 'boost::property_map' Thanks, Shufei _________________________________________________________________ Connect to the next generation of MSN Messenger http://imagine-msn.com/messenger/launch80/default.aspx?locale=en-us&source=…

1 0

[mpl::math] exponential metafunction for complex types
by Chris Weed 22 Feb '07

22 Feb '07

Hi, I am getting the wrong result for the exponential of complex numbers such as the following: #include <boost/mpl/math/double.hpp> #include <boost/mpl/math/complex_number.hpp> #include <iostream> int main() { typedef boost::mpl::math::string_c_to_double<'-',2,'.',0>::type minus_two; typedef boost::mpl::times<minus_two,boost::mpl::math::pi<boost::mpl::math::double_tag> >::type minus_two_pi; typedef boost::mpl::math::complex_number<double_zero,minus_two_pi> imag_minus_two_pi; std::cout << imag_minus_two_pi() << std::endl; std::cout << boost::mpl::math::exponential<imag_minus_two_pi>::type() << std::endl; return 0; } This prints: 0-6.28319i 1.0329-0.0109834i which should be 0-6.28319i 1.0000-0.00000i Chris

3 6

[multi_index] view with less items than in container possible?
by Boris 22 Feb '07

22 Feb '07

The various indexes of the multi_index_container help to access items in a container differently. Is it also possible to create an index somehow with access to less items in the container? If there is for example a container with employees and I often need to iterate over female employees only is there a way to create an index for this (there could be a bool in the employee class to indicate who is female)? Boris

2 1

boost_1_30_0\boost\crc.hpp(389) : warning C4245: 'initializing' : conversion from 'int' to 'const boost::detail::mask_uint_t<16>::least', signed/unsigned mismatch
by ERIC BERTRAND 22 Feb '07

22 Feb '07

I have this warning on Visual studio 2005. I want to get rid of theses warning. It apperas at line BOOST_STATIC_CONSTANT( least, sig_bits = (~( least(0u) )) ); if I cast (least)(~( least(0u) )) I have not the warning. I want to be sure this is acceptable. Can someone confirm to me? Thanks -- --------------------------------------------------------- erbere erbere(a)gmail.com

2 1

sub_range, assign and permutation_iterator related problem
by abir basak 22 Feb '07

22 Feb '07

Hi, It is an extension to one my previous post, where I needed help while giving access to a sub_range for of an container. In that problem , Mr Thorsten Ottosen, provided answer to all of my queries (Many thanks to him ). This time I am interested to provide indexed access to a vector with a sub_range ,using permutation_iterator. Here some codes are creating problem, while I am using sub_range with permutation iterator. To specify, I am providing a small test code. typedef std::pair<std::size_t,std::size_t> pair_t; template<typename T> class vector_e : private std::vector<T>{ public: typedef vector_e<T> self_type; typedef typename std::vector<T>::iterator iterator; typedef typename std::vector<T>::const_iterator const_iterator; typedef boost::sub_range<self_type> range; typedef boost::sub_range<const self_type> const_range; typedef typename std::vector<T>::size_type size_type; typedef std::vector<int> index_type; typedef typename boost::permutation_iterator<typename iterator,index_type::const_iterator> index_iterator; typedef typename boost::permutation_iterator<typename const_iterator,index_type::const_iterator> const_index_iterator; vector_e() : std::vector<T>(){} using std::vector<T>::begin; using std::vector<T>::end; using std::vector<T>::operator []; using std::vector<T>::insert; index_iterator begin_i(const index_type& i){ return boost::make_permutation_iterator(begin(),i.begin()); } const_index_iterator begin_i(const index_type& i)const{ return boost::make_permutation_iterator(begin(),i.begin()); } index_iterator end_i(const index_type& i){ return boost::make_permutation_iterator(begin(),i.end()); } const_index_iterator end_i(const index_type& i)const{ return boost::make_permutation_iterator(begin(),i.end()); } range get_range(const pair_t& range){ return boost::make_iterator_range(begin()+range.first,begin()+range.second); } const_range get_range(const pair_t& range)const{ return boost::make_iterator_range(begin()+range.first,begin()+range.second); } range get_range(const index_type& i){ return boost::make_iterator_range(boost::make_permutation_iterator(begin(),i.begin()), boost::make_permutation_iterator(begin(),i.end())); } }; int main(int argc,char** argv) { using namespace boost; using namespace boost::assign; using namespace boost::lambda; using boost::lambda::_1; typedef vector_e<int> elem_t; typedef std::vector<int> index_t; elem_t v; int a[] = {00,10,20,30,40,50,60,70,80,90,100}; v.insert(v.end(),a,a+11); const elem_t& cv = const_cast<elem_t&>(v); //v+= 00,10,20,30,40,50,60,70,80,90,100; std::cout<<"original array : "; std::for_each(v.begin(),v.end(),std::cout<<_1<<" "); ///For continuous ranges. elem_t::range r = v.get_range(std::make_pair(1,5)); std::cout<<std::endl<<" range (1,5) : "; ///working fine std::for_each(r.begin(),r.end(),std::cout<<_1<<" "); ///working fine elem_t::const_range cr = v.get_range(std::make_pair(1,5)); std::cout<<std::endl<<" c_range (1,5) : "; std::for_each(cr.begin(),cr.end(),std::cout<<_1<<" "); ///working fine elem_t::const_range cr1 = cv.get_range(std::make_pair(1,5)); std::cout<<std::endl<<" c_range1 (1,5) : "; std::for_each(cr1.begin(),cr1.end(),std::cout<<_1<<" "); index_t i; i+=0,2,6,4,9; std::cout<<std::endl<<" index : "; std::for_each(i.begin(),i.end(),std::cout<<_1<<" "); std::cout<<std::endl<<"index range "; //working fine std::for_each(v.begin_i(i),v.end_i(i),std::cout<<_1 << " "); std::cout<<std::endl<<"c index range "; ///working fine std::for_each(cv.begin_i(i),cv.end_i(i),std::cout<<_1 << " "); ///not working (and its const counter part ) elem_t::range ir = v.get_range(i); } The error it is giving in visual studio 7.1 for sub_range of permutation_iterator is, E:\boost_1_33_1\boost\range\iterator_range.hpp(60): error C2440: 'type cast' : cannot convert from 'boost::range_iterator<C>::type' to 'boost::range_iterator<C>::type' with [ C=const boost::iterator_range<vector_e<int>::index_iterator> ] and [ C=vector_e<int>::self_type ] The questions are 1) Can anyone point out the problem ? (Is sub_range is typed by iterator by any chance, or typed by container only ? ) 2) This is aux question. How to make assign library work for my inherited container (vector_e here ), like the commented line ? any help is appreciated, and thanks to the community . abir -- Abir Basak, Member IEEE Software Engineer, Read Ink Technologies B. Tech, IIT Kharagpur email: abir(a)abirbasak.com homepage: www.abirbasak.com

1 1

[BGL] Dijkstra visitor for examine edge event
by Alejandro Marcos Aragón 22 Feb '07

22 Feb '07

Hi everyone, I posted this message but I haven't received any response so I decided to post it again. I am trying to store all the vertices with their respective distances from a source within the Dijkstra shortest path algorithm. For that I plan to use a std::vector<std::queue > >. I was able to have the visitor working but I don't know how to access to those values that are computed automatically by the algorithm (d_v, d_u, for example). The code I wrote is as follows: template <class Tag> struct vis : public default_dijkstra_visitor { vis() { } template <class Edge, class Graph> void edge_relaxed(Edge e, Graph& g){ cout<<"VISITOR!!!"<<endl; cout<<"Edge -> "<<e<<endl; } private: std::vector<std::queue<Vertex> > storage; }; template <class Tag> vis<Tag> target_visit(Tag) { return vis<Tag>(); } void Dijkstra() { // maps needed by the algorithm IndexMap indexmap = get(vertex_index, *gPtr); WeightMap weightmap = get(edge_weight, *gPtr); // define containers for the predecessor vertices and // for distances std::vector<Vertex> pred(num_vertices(*gPtr)); std::vector<double> dist(num_vertices(*gPtr)); // vertex to compute Dijkstra's algorithm on Vertex source = vertex(get_source(), *gPtr); // Dijkstra's algorithm dijkstra_shortest_paths(*gPtr, source, predecessor_map(&pred[0]).distance_map(&dist[0]).visitor(target_visit(on_examine_edge()))); ... Any help will be appreciated. a^2

2 3

[BGL] merger parallel edges
by Shufei Fan 22 Feb '07

22 Feb '07

Hi, I am new to Boost Graph Library. I have two questions. I defined my graph like this: struct Node{ int label; int mode[3]; //...;}; struct Edge{ double nCommBord;}; typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, Node, Edge> Graph;Somewhere in my program, I construct it using add_edge() method. What I want is, I allow parallel edges, but I all parallel ones being merged(weight summed together). Can I add edges one by one, and use an general method to 'magically' merge them?(is there a function doing merging?) My second question is, where should I find a complete list of usage of all the library methods(say, manual for add_edge) Thanks, Regards, Shufei _________________________________________________________________ Invite your mail contacts to join your friends list with Windows Live Spaces. It's easy! http://spaces.live.com/spacesapi.aspx?wx_action=create&wx_url=/friends.aspx…

2 1

[signals] connection::add_tracked() proposal
by Frank Mori Hess 21 Feb '07

21 Feb '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'd like to propose we add an add_tracked() function to the connection object. This would allow an arbitrary shared_ptr/weak_ptr to be added to the list of objects tracked for the slot. The justification is to allow for situations where an object needed by the slot is not directly owned by a shared_ptr, or doesn't directly correspond to an argument of the bound function. For example, the bound argument might be contained inside another object which is in turn managed by a shared_ptr. We could actually dump boost::track() entirely if we wanted, if we have add_tracked(). - -- Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFF3Gxq5vihyNWuA4URAmS+AJkB3tgE/8p7GlCY+xq+UwfTFjZwigCgoQh0 fgQdVgH73Oh3j1g34HNy+JY= =3UVL -----END PGP SIGNATURE-----

4 9

Serialization newbie question
by Surya Kiran Gullapalli 21 Feb '07

21 Feb '07

Hello all, I'm a newbie to boost serialization and i need some help. I'm using boost serialization, to serialize a class, which contains 3 std::string members. After i serialize i add it to a database. The database I'm using is berkeley-db. The database API needs key/data pair, both in void* type. Now for my problem, the key is std::string, so I'm passing in key as (void *)key.c_str(), I know its crude, but i'm just starting. Now for the data part, I've to serialize the complete class. As, boost::archive::binary_oarchive, takes ostream& as argument for constructor, I've done like this. std::ostringstream os ; boost::archive::binary_oarchive oa (os) ; oa << class_obj ; so the class_obj has been written to os. so i'm sending data to db api as (void *)os.str().c_str(). To retrieve data, I'm using something like this data=db.get_data() ; istringstream is((char *)data) ; boost::archive::binary_iarchive (is) ; The code compiled fine and at run time i'm getting exception basic::string::resize during construction of binary_iarchive. Obviously i was doing wrong. My question is how to serialize data and write it to memory than to a file? and how do i access it again? Thanks in advance, Surya

2 3

Boost Serialization library with Berkeley-DB
by Surya Kiran Gullapalli 21 Feb '07

21 Feb '07

Hello all, Has any body ever used Boost serialization library with Berkeley-DB database to store/retrieve data. I'd like some pointers on how to use it?. Sample code would be most appreciated. Thanks, Surya

1 0

How to build guid lib?
by Christian Henning 21 Feb '07

21 Feb '07

Hi there, it's not as easy as I thought it would be. I copied the guid files in the appropriate folders in my boost/ directory. And then I tried: bjam -sTOOLS=vc-7_1 --with-guid But that doesn't work. So, how do I do that? I really have no clue about bjam, etc. Thanks in advance, Christian

4 10

[graph] Crash in breadth_first_search
by Jens Müller 21 Feb '07

21 Feb '07

Can someone help me with the following program? It crashes with Boost 1.33.1 on gcc34 (GCC) 3.4.3 20050113 (Red Hat 3.4.3-16): $ ./1 make_map_as_colormap entered writing something to MapAsColorMap Speicherzugriffsfehler I have tracked down the crash to this line in <boost/graph/breadth_first_search.hpp>: for (tie(ei, ei_end) = out_edges(u, g); ei != ei_end; ++ei) { But I don't know what happens there ... I'm quite sure the bug is NOT in my color map proxy ... Thanks a lot in advance! Cheers, Jens // //======================================================================= // Copyright 2007 University of Karlsruhe // Author: Jens Mueller // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= // #ifndef BFS_DISTMAP_8737 #define BFS_DISTMAP_8737 /* Use distance map (or anything else which suits the following requirements) as a color map. Write operations are just ignored. Read operations work as follows: When the value in the underlying map equals a specified value, e.g. -1 in a distance map, or the null pointer in a predecessor map, the 'White' value is returned, otherwise the 'Black' value is returned. Note: This only is usable for application where there is no need to distinguish gray and black non-tree edge targets. Note: Setting the value in the underlying map so that it no longer corresponds to a 'White' value will have to be done by the visitor on the discover_vertex event. */ /* Template parameters: - ColorValue (default value used by helper function: default_color_type) - ReadablePropertyMap (underlying map) */ /* Runtime parameters: - ReadablePropertyMap pm - ReadablePropertyMap::value_type white (must be == comparable) */ #include <boost/property_map.hpp> #include <iostream> template<typename ReadablePropertyMap, typename ColorValue> class MapAsColorMap { private: typename boost::property_traits<ReadablePropertyMap>::value_type white_; const ReadablePropertyMap& pm_; public: typedef typename boost::property_traits<ReadablePropertyMap>::key_type key_type; typedef ColorValue value_type; typedef ColorValue reference; typedef boost::read_write_property_map_tag category; ColorValue get(key_type key); MapAsColorMap(const ReadablePropertyMap& pm, typename boost::property_traits<ReadablePropertyMap>::value_type white): white_(white), pm_(pm) { /* nothing */ }; }; template<typename ReadablePropertyMap> MapAsColorMap<ReadablePropertyMap, boost::default_color_type> make_map_as_colormap(const ReadablePropertyMap& pm, typename boost::property_traits<ReadablePropertyMap>::value_type white) { std::cout << "make_map_as_colormap entered" << std::endl; return MapAsColorMap<ReadablePropertyMap, boost::default_color_type>(pm, white); } template<typename ReadablePropertyMap, typename ColorValue> ColorValue MapAsColorMap<ReadablePropertyMap, ColorValue>::get(key_type key) { std::cout << "get entered" << std::endl; std::cout << key << " " << boost::get(pm_, key) << std::endl; return (boost::get(pm_, key)==white_) ? boost::color_traits<ColorValue>::white() : boost::color_traits<ColorValue>::black(); } template<typename ReadablePropertyMap, typename ColorValue> ColorValue get(MapAsColorMap<ReadablePropertyMap, ColorValue> pmap, typename boost::property_traits<ReadablePropertyMap>::key_type key) { return pmap.get(key); } template<typename ReadablePropertyMap, typename ColorValue> void put(MapAsColorMap<ReadablePropertyMap, ColorValue> pmap, typename boost::property_traits<ReadablePropertyMap>::key_type key, typename boost::property_traits<ReadablePropertyMap>::value_type value) { std::cout << "writing something to MapAsColorMap" << std::endl; /* nothing */ } #endif

3 7

local variable shadow
by Chris Saunders 21 Feb '07

21 Feb '07

I find local variable shadow warnings helpful, but when I include various boost libraries, I have to remove a lot of shadowing within the boost functions themselves. Note that I'm not refering to name conflicts with my own code. How can I submit patches to remove these type of warnings? Thanks, -Chris

3 3

[boost::program_options] got stuck with some options scenario
by Ovanes Markarian 21 Feb '07

21 Feb '07

I have some requirement for input parameters: Some of my input parameters represent a pair of files. Is there any way to parse this kind of a form: -I "file1" "file1_related_file" Trying to use the construct with: po::value< std::pair<std::string,std::string> >() produces a compilation error within a lexical cast, that there is no operator >> defined. I know I could pass smth like: -I "fiel1+related_file", but then I would need to split the string, what I would like to do, since I see this as a task of program_options lib. With Kind Regards, Ovanes Markarian

1 0

question about pool::get_next_size/set_next_size
by Stefan Felkel 21 Feb '07

21 Feb '07

Hi, is there a way to access pool::get_next_size, pool::set_next_size from my own fast_pool_allocator without modifying the boost source (1.33.1). This my_fast_pool_allocator is a copy of fast_pool_allocator that tries to allocate the requested memory with next_size divided by 2 if malloc returns NULL. I added static member functions get_next_size/set_next_size to singleton_pool which works, but is there a way without modifying the boost source. If not, would it make sense to add these two methods in a future boost release. This is the allocate method of my_fast_pool_alloctor: template <typename T, typename UserAllocator, typename Mutex, unsigned NextSize> class my_fast_pool_allocator { ... static pointer allocate(const size_type n) { typedef boost::singleton_pool<boost::fast_pool_allocator_tag, sizeof(T), UserAllocator, Mutex, NextSize> mypool; pointer ret = NULL; for( ; !ret; ) { if (n == 1 ) { ret = static_cast<pointer>( mypool::malloc() ); } else { ret = static_cast<pointer>( mypool::ordered_malloc(n) ); } size_t nsize = mypool::get_next_size(); if( !ret ) // not enough memory available { if( nsize <= n ) // even less than we really need break; nsize >>= 1; // request half the size nsize = std::max( nsize, n ); // at least as much as we really need } mypool::set_next_size(nsize); } if (ret == 0) throw std::bad_alloc(); return ret; } ... }; Regards, Stefan

1 0

question about boost::interval
by Marco Correia 21 Feb '07

21 Feb '07

Hi, I'm a little bit confused about the documentation in http://www.boost.org/libs/numeric/interval/doc/rounding.htm, in the subsection "Transcendental functions". Does the "Please note" paragraph means that the provided classes for transcendal functions (_opp and _std) do not guarantee the inclusion property? From what I understood it says that it depends on the implementation of the std::* math functions, that, in most cases, don't obey current rounding mode. Am I getting this right? In case I am, does anyone knows if I'm safe with gcc std library (perhaps by using the -frounding-math switch)? Thanks! Marco -- Marco Correia <mvc(a)di.fct.unl.pt>

2 2

missing files?
by Jan Van den bosch 21 Feb '07

21 Feb '07

Hi, I'm trying to build the examples of the Channel event framework ( channel.sourceforge.net) Apparently, the Boost archives at sourceforge (.zip, .tar.gz and .tar.bz2 files) are missing several necessary files, like serialization/array.hpp. When I do a CVS checkout of Boost however, those files are included. Are they still part of Boost? Thanks in advance, Jan

1 0

split_iterator<string::iterator> example
by Meryl Silverburgh 21 Feb '07

21 Feb '07

hi, Can someone please tell me where I can find example of split_iterator<string::iterator> If I have 2 split_iterator<string::iterator>s, how can I compare the 2 strings that the split_iterator pointing to? Thank you.

2 13

[Boost][bind] problem using bind with non-copyable class members?
by Darren Garvey 21 Feb '07

21 Feb '07

Hi, I'm trying to use bood::bind and I'm having a problem with compilation when I'm passing an object that holds a std::stringstream. The errors are to do with std::ios_base and std::streambuf's copy constructors being private, but as far as I knew (and understand from the docs), boost::bind passes by reference, so nothing should be copied. I'm sure I'm missing something fundamental here, so any enlightening would be very welcome. My setup is gcc 4.1.2 on Ubuntu 6.10. Here's an example program that fails: #include <sstream> > #include <boost/bind.hpp> > #include <boost/thread.hpp> > > using namespace boost; // sorry > using namespace std; // oops > > > struct holder > { > std::ostringstream oss; > }; > > void sub_main( holder& h ) > { > return; > } > > class event_handler > { > public: > void operator() ( holder& h ) > { > thread t( bind( &sub_main, h ) ); > t.join(); > } > }; > > int main( int, char** ) > { > event_handler e_h; > holder h; > > e_h(h); > > return 0; > } Regards, Darren

2 2

[signals] building sandbox documentation?
by Frank Mori Hess 20 Feb '07

20 Feb '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Timmo, Do you know a bjam command to build the signals documentation in boost-sandbox/libs/signals/doc ? I'd like to update them to reflect the changes we've made for thread safety. Do I have to copy the files over to a real boost source tree to get them to build? I am not very familiar with bjam. - -- Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFF2xd85vihyNWuA4URAkBBAJ43BFzalbQSbzMaKNWuaEPR3tEpUQCdE67i 7ozVU/0NcLWKVW8gNv4KR5E= =WB61 -----END PGP SIGNATURE-----

2 2

Re: [Boost-users] Cannot build boost on MSVS8 per instructions
by DAVID CRAVEY 20 Feb '07

20 Feb '07

Hi All, I am having the same errors as in this post: http://lists.boost.org/boost-users/2006/09/22001.php I have tried downloading the boost-jam both binary: boost-jam-3.1.13-1-ntx86.zip (I get the same error as the above post) And from source: boost-jam-3.1.13.zip I get a "Debug Assertion Failed!" error when I run build.bat Program: C:\Boost\boost-jam-3.1.13\bootstrap\jam0.exe File: dtoxtm64.c Line: 67 Expression: ( ( ( long )( yr - 1990) >= BASE_YEAR) && ( ( long )( yr - 1990 ) <= _MAX_YEAR64 ) ) Running the prebuilt bjam.exe file in the Threads build directory (running from Visual Studio 2005 Command Prompt): C:\Boost\boost_1_33_1\libs\thread\build>bjam "-sTOOLS=vc-8_0" Built three library files. So I think the bjam.exe file probably is not corrupt. If I run (from Visual Studio 2005 Command Prompt): C:\Boost\boost_1_33_1>bjam "-sTOOLS=vc-8_0 --with-threads" I get the same 00012f2a error as before. Other Notes: I have Visual C++ 2003 Standard and Visual Studio 2005 Pro Installed. Starting with the appropriate command prompt, I get the same error on both at Offset 0001f2fa. My machine is an Dell Latitude Centrinio Running Windows XP Pro SP2. Any help would be greatly appreciated! Thanks, David Cravey

3 2

Boost serilaization onexit problem
by gast128 20 Feb '07

20 Feb '07

Dear all, We use (too many) singletons in our program and now the program crashes in Boost Serialization because in an onexit function a static member (oserializer::instantiate) of Boost Serialization is already destroyed. Is there a way to force an intialisation of these static members so that they are destroyed after my singleton destroys? The code can be reproduced by the follwing snippet: // #define BOOST_ALL_DYN_LINK #define BOOST_LIB_DIAGNOSTIC #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/version.hpp> struct Foo { Foo() : m_i(0) {} template <class Archive> void serialize(Archive& ar, const unsigned int /*version*/) { ar & BOOST_SERIALIZATION_NVP(m_i); } int m_i; }; void f (); void test_serialize (); //---------------------------------------------------------------------------- // Function main //---------------------------------------------------------------------------- // Description : main //---------------------------------------------------------------------------- int main() { atexit(&f); test_serialize(); return 0; } void f() { test_serialize(); } void test_serialize() { std::ofstream ofs("test.xml"); boost::archive::xml_oarchive oa(ofs); const Foo foo; oa << BOOST_SERIALIZATION_NVP(foo); } wkr, me

2 2

[Review][Bimap] Reviewers needed for Bimap review
by Ion Gaztañaga 20 Feb '07

20 Feb '07

Hi to all, Bimap review started 5 days ago and we're having some good comments but no thorough reviews. I would like to encourage people to write a Bimap review, because we still have five more days and I would propose extending that if that's necessary. Container and STL experts, we need you! I think that Bimap is a great library and I'm pretty sure you'll be happy to review it once you start reading the docs. Start reading the documentation here: http://tinyurl.com/y95qng And download the library here: http://boost-consulting.com/vault/index.php?&directory=Containers Regards, Ion

1 0

Using Boost string library
by Meryl Silverburgh 20 Feb '07

20 Feb '07

Hi, I need to compare 2 strings in this format (a integer separator by '/': /1/1 /1/1/2 /1/1/3 so "/1/1" is less than "/1/1/2" and "/1/1/2" is less than " "/1/1/3". Is there anything in Boost string library to help me to write such a comparison? Is there a string iterator which literates base on the separator '/'? My idea is to find an iterator to loop thru the string based on separator '/'. Thanks for any idea.

3 14

signals newbie
by V12 20 Feb '07

20 Feb '07

hi ppl, i am new to using boost signals lib and have the following doubts: i have an event manager class which has a member function loadmap(). this class also has a signal s_ChangeMap to connect to the above function . now when i tried to do: s_ChangeMap.connect(&LoadMap); i get the following error: error C2276: '&' : illegal operation on bound member function expression the same error also occurs when i try to connect the signal to a function of a different class what should i do to get rid of this. am i missing on some understanding of the working of the signals system or is it something related to the scope of a connection?? please help me , thanx -- View this message in context: http://www.nabble.com/signals-newbie-tf3257471.html#a9056554 Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Re: [Boost-users] [program options] some docs suggestion
by Ovanes Markarian 20 Feb '07

20 Feb '07

On Tue, February 20, 2007 13:18, Vladimir Prus wrote: > Ovanes Markarian wrote: > >> It would be really helpful to know that varaibles map is a derivative of std::map<...>. > > I recall I was going to document this, but don't see it :-( > I'll add this to my TODO. > > - Volodya > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > The varaible_map class has double colons after its name. http://www.boost.org/doc/html/variables_map.html class variables_map : : public boost::program_options::abstract_variables_map { ... }; May be something was stripped off during documentation generation? With Kind Regards, Ovanes Markarian With Kind Regards, Ovanes Markarian

1 0

[multi_array] suggestion
by Николай Широковский 20 Feb '07

20 Feb '07

Hello. I`ve been using Boost.MultiArray for a while and found that next features for MultiArray concept would be usefull. 1. Index permutations, which result is multiarray again. Most encontered in 2d dimential arrays used as matrices, and feature become matrix transposition. 2. This feature is possibly less agreed with Boost.MultiArray concept, nevertheless. It would be useful to have an iterator over all elements, not subcontainers, possibly with custom ordering differ from that used on construction for memory layout. Than i can easily use an STL algorithms on iterators. Having operation of creating subarray and array views i can manage wich part of multi_array object is exposed to algorithm. I hadly see an using of this iterator with stl::adjacent_difference as it interpret iterator as "really sequence", but in my work i will have some code look better using std::transform with such iterator.

1 0

Fwd: [bimap] Review of the Bimap library begins today Feb 15
by Matias Capeletto 20 Feb '07

20 Feb '07

---------- Forwarded message ---------- From: Matias Capeletto <matias.capeletto(a)gmail.com> Date: Feb 18, 2007 2:39 PM Subject: Re: [Boost-users] [bimap] Review of the Bimap library begins today Feb 15 To: boost(a)lists.boost.org On 2/18/07, Gottlob Frege <gottlobfrege(a)gmail.com> wrote: > On 2/15/07, Ion Gaztañaga <igaztanaga(a)gmail.com> wrote: > > Hello everyone, > > > > The review of the proposed Boost Bimap library written by Matias > > Capeletto starts today (February 15th, 2007) and ends after 10 days > > (February 25, 2007). Hi Gottlob, > So far: > A: namespace: > --------------------- > > from the 'One Minute Tutorial': > > That is more or less all that is needed to start using the > bidirectional map. The following two lines must also be added: > > #include <boost/bimap/bimap.hpp> > using namespace bimap; > > 2 points: > - I prefer not to use 'using'. I know I don't have to, but I don't > like that the docs imply that I do. Ok, the "must" in the docs is maybe to strong. I can reword that. > more importantly: > - is it going to be in 'bimap' or in 'boost'? We have to put everything inside a namespace, I do not want to pollute the boost namespace. > B: 'relation' > ---------------- > > I think I understand the philosophical reasoning for preferring > 'left/right' over 'first/second', and thus the impetuous for creating > 'relation'. However... Two issues to talk about here. 1) The new notation left/right used instead of first/second. 2) A new name for 'relation'. We have to introduce the new notation. In the context of maps, the notation first/second is used in places where the first element has different meaning than the second one. left/right is symmetrical and implies that both sides are at the same level, that there is no special side.This is the key point to grasp. This is explained here: http://cablemodem.fibertel.com.ar/mcape/boost/libs/bimap/boost_bimap/the_tu… > - I think 'relation' is too generic a word to abscond. >From the dictionary: "A logical or natural association between two or more things" I like 'relation'. But we can talk about other names. > - how about: > - couple > - duo The thing is that these words are very similar to "pair" and the idea is to mark the difference. > - or probably just 'bipair' That was my original choice. 'relation' sounds better to me but let see what other people think about this. > - or maybe even consider that std::pair, although not perfect, might > make things easier: Using left/right instead of first/second is an important design decision. Here is where things start mixing up. > - it can be used in other algorithms The new notation is used in very different contexts. The algorithms written for first/second has no sense in the contexts where left/right are used. If you want to use algorithms that works with map/pair notation you have to pass one of the side views to it. > - it is already well known That is true and in the context of maps it have a very established meaning different from what we want to express with left/right. This is a point for the new notation. > - the nature of typing code forces order - ie note that bimap<X, Y> > is different than bimap<Y, X> (although philosophically the same). (Side Note: Using tags they are exactly the same.) > Even with 'left/right' you still have order - left corresponds to the > *first* type listed in the bimap, 'right' corresponds to the *second* > type passed in. Or is it bimap<Right, Left>? I don't think so. You still have order. The important thing to understand is that we are not looking to eliminate that order. We want to express that the two things are equally important. > But other than that, so far so good. Looks like something I'd use. > And the docs are snazzy. Thanks! Matias

5 6

[program options] some docs suggestion
by Ovanes Markarian 20 Feb '07

20 Feb '07

It would be really helpful to know that varaibles map is a derivative of std::map<...>. I was wondering where the variables_map::count(...) come from in getting started example... if (vm.count("help")) { cout << desc << "\n"; return 1; } Only after looking into the source of variables_map helped :( With Kind Regards, Ovanes Markarian

2 1

[program_options] unknown options in config files
by Sebastian Weber 20 Feb '07

20 Feb '07

Hello! I'm using program_options to parse command line options and configuration files. I absolutley need the unknown option feature. For the command line options this works fine. However, the configuration file parsing always throws an option unknown exception when I parse cfg-files with non-registered options. Right right I circumvent this by catching the corresponding exception. But this is not very nice and I can as well not be sure that all options have been parsed in the cfg-file, depending upon the first occurence of an unknown option, right? So, is there a possibility to process unknown options in cfg-files? Thanks a lot in advance. Greetings, Sebastian

1 0

Boost in embedded systems
by Peter Poulsen 20 Feb '07

20 Feb '07

I know this sounds insane, but our developers are very happy with boost (who can blame them :-)), and want to have boost available on our embedded systems. We only have 64 mb of flash memory available for the entire system (OS, hardware monitoring and applications) and I simply cannot get boost down to a reasonable size. Am I trying to do an impossible task, or can somebody give me some good advice on how to build boost so it has a more reasonable size? Of course what should be done is removing some of the features, and I can probably negotiate with developers about what features we can provide and which have to go. Which one should I try to get rid of first? /peter -- A: Because it messes up the order in which people normally read text. Q: Why is it such a bad thing? A: Top-posting. Q: What is the most annoying thing on usenet and in e-mail?

5 4

Updated date_time_zonespec.csv for 2007?
by Brendon Oliver 20 Feb '07

20 Feb '07

Does anybody have a date_time_zonespec.csv file updated for the US DST changes this year? I've googled the mailing lists & looked at sourceforge (I see there was a bug raised 5 Feb, but no responses since). I also downloaded a 1.34 alpha tarball but there's no date_time_zonespec.csv file in there :-( . I've looked at updating the file myself (the syntax is pretty straight-forward), I'm just worried about missing particular zones. Cheers, - Brendon. -- Conversation, n.: A vocal competition in which the one who is catching his breath is called the listener. 10:19:19 up 61 days, 19:45, 2 users, load average: 0.34, 0.26, 0.25

2 3

[signals] thread_safe_signals feature-complete
by Frank Mori Hess 20 Feb '07

20 Feb '07

Hi all, I've finished thread_safe_signals. To get thread safety you have to include an additional header file thread_safe_signals/multi_threaded.hpp and set the last template parameter to boost::signals::multi_threaded. I've done a little benchmarking. With thread-safety off and connecting 10 slots, it appears to have about the same overhead as cvs boost.signals (which is much less than the latest release of boost.signals). When 1 slot is connected, it has more overhead, a little less than a factor of 2 when running a single empty slot. Turning thread-safety on increases overhead by about 50% for the 1 slot case and 100% for the 10 slot case. It is able to invoke slots concurrently though, which should be a win if the slot is non-trivial. -- Frank

4 38

any boost library for referring a portion of the container ?
by abir basak 19 Feb '07

19 Feb '07

Hi, I am having a few containers whose some portion I want to refer to another class (sometime I need to refer to a continuous portion, while sometime need a non-continuous portion) . At present I have written all of these myself. But wondering if a few portion can be substituted by some boost library. Just to make the concept clear, I am elaborating the structure and why it is done in that way. In the program it takes the user handwriting (as entered using digital pen etc) and analysis them. as user writes, I register points (x,y coord) and put them in an deque (in actual case I am using boost::circular_buffer_space_optimized ). Now, a second deque (or other container) stores another structure Trace, which has 2 index pointing start & end of that continuous writing until pen up occurs. These have to be 2 index rather than iterator, as iterator may get (and usually gets ) invalidated while more points are added in the point deque. Thus Trace refers deque<Point> Now from the trace structure I return the points for the trace (boost::sub_range ) using the 2 index and the deque (i.e from deque<Point> get iterator, add index as offset , make sub_range and return). Now these are the continues portions , referred by 2 index. Next, some such things can be even not continuous. In that case I store all index to which it points (in a vector ) and return a sub_range kind of structure (named index_range ) which takes these index and a container, and iterates over it jumping by those specific offsets. Example can be a Character class which refers some of those traces , not necessarily continuous (like user writes a dot much later than the i , thus Character i contains index of the vertical stroke of the i & dot ) Similarly more hierarchy are constructed, like Trace => Page, and Character => Word => Line => Paragraph => Page etc. Most of them contains 2 index and with the help of the container returns a boost sub_range , while some contains a vector of index (size_t) and returns index_range (created by me) . So far I found it is the ONLY way to create a level of hierarchy/ view from different set of dynamic data. (The other can be storing everything as a pointer in the container, and creating by new, in that case no problem arises as the objects are not movable, but in C++ it is quite bad solution) A Graphical representation is like, =============== deque<Point> ===================== <=remove old data => add new data | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | =============== deque<Trace> ==================== | 1 | 2 | =============== deque<Page> ===================== These are for continuous data (i.e 2 index struct & boost::sub_range ) ================ deque<Trace> ==================== |1,3,4| 2 | 5,6 | 7,9 | 8 | ... ================== deque<Character> =============== | 1,2,4, 5 | 3 | .... ================== deque<Word> ===================== | 1 | 2 | 3 | .... (assuming past a line user doesn't correct word, they can be made a pair of index ! ) ================== deque<Line> ===================== .... ================== deque<Paragraph> ================ etc... My question , 1) had anyone faced these kind of design , where a class referrers a portion of STL container ? and multiple view from same set of data exists (otherwise I could had Trace contains the points , instead of having index of the portion, if Trace is the only view for the points ) 2) Any boost library / other library is there to help these kind of design ? I had posted a same kind of topic in C++ newsgroup also, but it seems their people are more concerned with answering C++ standard based question . I think, boost may be the better news group to ask this question, as boosters work in a broader area. Thanks to all, esp to those who share their thought on it ... abir -- Abir Basak, Member IEEE B. Tech, IIT Kharagpur email: abir(a)abirbasak.com homepage: www.abirbasak.com

2 5

[boost::lexical_cast] problems casting hex numbers
by Ovanes Markarian 19 Feb '07

19 Feb '07

Thanks a lot for lexical_cast it is a very useful function. Currenlty I face a problem with it and I think it would be useful addon ;) Unfortunately it can not be used (or I was unable to figure out how) to cast hex or octal numbers from strings to numeric. If it is not possible, are there some concerns which disallow this? the expression: lexical_cast<size_t>("0x015e") throws a bad_lexical_cast With Kind Regards, Ovanes

1 0

BoostCon 2007 update
by David Abrahams 19 Feb '07

19 Feb '07

A couple of quick items: 1. The conference format has changed. For many practical reasons, the "two 3-day tracks with one day of overlap on Wednesday" format proved unworkable. Among those: * Many (most) sessions don't fall neatly into the library-user/library-developer track distinction. We see this as a good thing, as it means we have more material that's of broad interest. * It made the hotel reservation pattern very difficult; we were afraid many people would be shut out of rooms at the conference hotel and also that the hotel would not be able sell the entire reserved room block, which could cost the (non-profit) conference a lot of money, as we had to agree to be liable for unsold room nights. Instead, we're running two tracks concurrently all week. We thought attendees should be prepared for that change. 2. We expect the new boostcon website will go live and registration for the conference will open in the next couple of days. We're just clearing away a few final details. In the meantime, the existing http://www.boostcon.com has the old information. Regards, and see you at BoostCon, -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

Boost::Date_Time -New IO Tutorial
by Steve Johns 19 Feb '07

19 Feb '07

Jeff, Thanks for your answers to my earlier posts. This is a great library, and I'm enjoying learning it. :^) I notice here: http://www.crystalclearsoftware.com/libraries/date_time/release_1_33/date_t… that a tutorial on the new IO is supposed to be found here: libs/date_time/examples/tutorial This dir is not part of my Boost distro. Is there a URL I can use to access this?

2 1

Problem in building boost 1_33_1 on solaris 5.9
by Shobha_Hubballi＠i2.com 19 Feb '07

19 Feb '07

Hi, I am trying to build boost1_33_1 on solaris 2.9 with CC 5.5 compiler. Libraries like filesystem, serialization, program_options are not built. But other libraries like thread are built perfectly. The libraries which I am not able build I am getting following same error for all libraries /data/tdm/boost_1_33_1/boost/iterator/iterator_facade.hpp", line 838: Error: Could not find a match for boost::iterator_core_access::equal<boost::iterator_core_access::Facade1, boost::iterator_core_access::Facade2>(const boost::filesystem::path::iterator, const boost::filesystem::path::iterator, boost::is_convertible<boost::filesystem::path::iterator, boost::filesystem::path::iterator>). "/opt3/SUNWspro/prod/include/CC/Cstd/./algorithm.cc", line 2370: Where: While instantiating "boost::operator!=<boost::filesystem::path::iterator, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::bidirectional_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int, boost::filesystem::path::iterator, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::bidirectional_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int>(const boost::iterator_facade<boost::filesystem::path::iterator, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::bidirectional_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int>&, const boost::iterator_facade<boost::filesystem::path::iterator, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::bidirectional_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int>&)". Please tell me how to solve this problem Thanks

2 3

[Program option] Parsing string to vector<string>
by Seweryn Habdank-Wojewódzki 19 Feb '07

19 Feb '07

Dear all I have question. to the type of object stored in variables_map. In the example multiple_sources.cpp There is line: config.add_options() //... ("include-path,I", po::value< vector<string> >()->composing(), "include path") ; But independently of the case all time result vector has size = 1, so in fact above is equivalent: config.add_options() //... ("include-path,I", po::value< string >()->composing(), "include path") ; And still there is some parsing job to do. How can it be improved? I have tested this example using config file like below: # # Comment out this line to use hard-coded default value of 10 # optimization = 1 include-path = /opt /usr /home/ Regards. -- |\/\/| Seweryn Habdank-Wojewódzki `\/\/'

1 1

vc8 / 2005 linker problems in program_options
by Andrew Schweitzer 19 Feb '07

19 Feb '07

I'm having problems building programs with program_options and vc8/2005. I'm getting linker errors... any suggestions? I suspect I'm doing something obvious wrong. Linking against 1.33.1, I have $(BOOST_ROOT)\bin\boost\libs in "Additional Library directories". I get "already defined" and "unresolved" errors when I try to use program_options code that builds in vc71. For example: //no problem here... #include <boost/program_options.hpp> using namespace std; using namespace boost; using namespace boost::program_options; void func() { //but with this I get linker errors variables_map l_vm; } //...such as: 1>libboost_program_options-vc80-mt-gd-1_33_1.lib(variables_map.obj) : error LNK2005: "class std::basic_ostream<char,struct std::char_traits<char> > & __cdecl std::operator<<<char,struct std::char_traits<char>,class std::allocator<char> >(class std::basic_ostream<char,struct std::char_traits<char> > &,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &)" (??$?6DU?$char_traits@D@std@@V?$allocator@D@1@@std@@YAAAV?$basic_ostream@DU?$char_traits@D@std@@@0@AAV10@ABV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@0@@Z) already defined in msvcprtd.lib(MSVCP80D.dll) //and: 1>libboost_program_options-vc80-mt-gd-1_33_1.lib(options_description.obj) : error LNK2019: unresolved external symbol "__declspec(dllimport) public: class std::reverse_iterator<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator> __thiscall std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::rbegin(void)const " (__imp_?rbegin@?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@QBE?AV?$reverse_iterator@Vconst_iterator@?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@2@XZ) referenced in function "public: bool __thiscall boost::program_options::option_description::match(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &,bool)const " (?match@option_description@program_options@boost@@QBE_NABV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@_N@Z) Any suggestions?

1 0

bjam crashes
by Andrew Schweitzer 18 Feb '07

18 Feb '07

Hi there. When I run bjam 3.1.12 or 3.1.13, bjam crashes. Any ideas, suggestions? I wouldn't be surprised if I'm doing something obvious wrong. I'm trying to build on XP Pro, VC7, VC8. 1.33.1 Bjam 3.1.10 vc7 or vc8 Works! 1.33.1 Bjam 3.1.12 vc7 or vc8 kaboom 1.33.1 Bjam 3.1.13 vc7 or vc8 kaboom cvs Bjam 3.1.10 vc7 or vc8 says bjam >= v12 needed. cvs Bjam 3.1.12 vc7 or vc8 kaboom cvs Bjam 3.1.13 vc7 or vc8 kaboom Thanks Andy

2 2

interprocess on fedora core 4
by Jan 18 Feb '07

18 Feb '07

When bjam is run on the examples folder on fedora core 4 it generates linker errors. Such as: ../../../bin/boost/libs/interprocess/example/process_a_example/gcc/release/runtime-link-static/process_a_example.o(.text+0x340): In function `main': process_a_example.cpp: undefined reference to `sem_post' NB: Does this help? [root@localhost example]# gcc -v Using built-in specs. Target: i386-redhat-linux Configured with: ../configure --prefix=/usr --mandir=/usr/share/man --infodir=/usr/share/info --enable-shared --enable-threads=posix --enable-checking=release --with-system-zlib --enable-__cxa_atexit --disable-libunwind-exceptions --enable-libgcj-multifile --enable-languages=c,c++,objc,java,f95,ada --enable-java-awt=gtk --with-java-home=/usr/lib/jvm/java-1.4.2-gcj-1.4.2.0/jre --host=i386-redhat-linux Thread model: posix gcc version 4.0.2 20051125 (Red Hat 4.0.2-8) Thanks

2 1

Boost compilation error
by Gunjan 18 Feb '07

18 Feb '07

I am not able to compile Boost libraries through command line (gcc compiler on Windows). It is giving the error: fatal error C1083: Cannot open include file: 'boost/config.hpp': No such file or directory I searched on the net and found this is a common problem and should get solved by adding the path for Boost libraries to the include environment variable. But it is not happening. My observation is that its not identifying the path correctly. If I change the path manually (changing it to ‘”config.hpp” instead of <boost/config.hpp>), it proceeds with compilation. But that is not desired and practical. Can someone help me solving this problem? Thanks in advance.

1 0

[Program options] Some questions about composing.
by Seweryn Habdank-Wojewódzki 18 Feb '07

18 Feb '07

Hi all Is that possible to use "unsigned int" type in: config.add_options() ("source-columns,c", po::value< vector<unsigned int> >()->composing(), "List of columns. Can be: 1 2 34 5 2."); If I change "unsigned int" to "std::string" it works good. I mean I can use: -c 1 2 34 5 2 and it works. Regards. -- |\/\/| Seweryn Habdank-Wojewódzki `\/\/'

1 0

[property map] copying dynamic_properties
by gavinband＠tiscali.co.uk 18 Feb '07

18 Feb '07

Dear all, I have boost 1.33.0. It looks to me like boost::dynamic_properties (in dynamic_property_map.hpp) does not have a supplied copy-constructor, and so it has a default copy-constructor. However, since dynamic_properties allocates dynamic_property_map objects on the heap, and holds them by pointer, this is not sufficient. This is causing a segfault in the code pasted below. Either dynamic_properties should be given a copy constructor and assignment operator (which seems useful to me) or it should be noncopyable. Or perhaps it could use shared_ptrs instead of regular pointers to avoid this problem? Thanks, Gavin. #include <boost/dynamic_property_map.hpp> int main() { std::map<long,long> my_map; boost::associative_property_map<std::map<long,long> > apm(my_map); boost::dynamic_properties dp; dp.property("property",apm); boost::dynamic_properties dp2(dp); // crash occurs when dp is destructed. return 0; } ___________________________________________________________ Tiscali Broadband only 9.99 a month for your first 3 months! http://www.tiscali.co.uk/products/broadband/

1 0

[iterator] make_zip_iterator
by Erik Åldstedt Sund 18 Feb '07

18 Feb '07

Hi, just a short question: Why does not the zip_iterator header have the following (or something along the lines of the following) creator function: template <typename Iter1Type, typename Iter2Type> boost::zip_iterator<boost::tuple<Iter1Type, Iter2Type> > make_zip_iterator(Iter1Type i, Iter2Type j) { return boost::make_zip_iterator(boost::make_tuple(i, j)); } That would make creating a zip_iterator much simpler. Instead of writing the following: std::set<double> s; std::vector<int> v; // populate s and v.... std::for_each(boost::make_zip_iterator(boost::make_tuple(s.begin(), v.begin())), boost::make_zip_iterator(boost::make_tuple(s.end(), v.end())), my_functor_that_does_something_useful()); you could write the following: std::set<double> aSet; std::vector<int> aVector; // populate aSet and aVector.... std::for_each(boost::make_zip_iterator(aSet.begin(), aVector.begin()), boost::make_zip_iterator(aSet.end(), aVector.end())), my_functor_that_does_something_useful()); Regards, Erik Åldstedt Sund

5 5