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

[boost][accumulators]: runtime accumulator_set construction?
by Stephen Nuchia 14 Aug '09

14 Aug '09

Forgive me, my brain still thinks in C... or C++'86 on a good day. Looking at the documentation for Accumulators, and given what I think I understand about C++ metaprogramming, it looks as though the dependency resolution mechanisms in the accumulator framework operate only at compile time. Is this right? Is runtime specification of a set of features possible? Thank you, -swn

2 1

Re: [Boost-users] randomize_property question
by mcorbion＠mobigis.fr 14 Aug '09

14 Aug '09

Ok so I still can't use the randomize property but I've done a workaround. I created an AbstractGraph class which has a m_Graph adjacency_list type of graph. And nodes uses the bundled property : struct City { int pos_X; int pos_Y; }; My workaround test function uses the property map given to randomly set the values, but it's still too specific : template <typename Graph, typename BundProp,typename RandomGenerator> void AbstractGraph::test(bundle_property_map<Graph,unsigned int,BundProp,int> p_PMap, RandomGenerator& p_ewrg){ AbstractGraph::N_iterator l_NodeStart; AbstractGraph::N_iterator l_NodeEnd; AbstractGraph::GetNodes(l_NodeStart,l_NodeEnd); for (; l_NodeStart != l_NodeEnd; ++l_NodeStart) { p_PMap[*l_NodeStart] = p_ewrg(); } } called this way in the main : mt19937 l_Gen(1988); boost::uniform_int<> RandRange(1,10); boost::variate_generator<boost::mt19937&, boost::uniform_int<> > ew2rg(l_Gen, RandRange); typedef property_map<Graph, int(City::*)>::type t_PMapCity; t_PMapCity l_PMap=get(&City::pos_X,m_Graph); test<Graph,City>(l_PMap,ew2rg); I would like to include the two line that generates the property_map from the main to the test function. I've tried this : template <typename Graph, typename PropertyTagType,typename RandomGenerator> void AbstractGraph::test2( ??? p_PropertyTagName,RandomGenerator& p_ewrg){ typedef property_map<Graph, PropertyTagType>::type t_PMap; t_PMap l_PMap=get(PropertyTagName,m_Graph); AbstractGraph::N_iterator l_NodeStart; AbstractGraph::N_iterator l_NodeEnd; AbstractGraph::GetNodes(l_NodeStart,l_NodeEnd); for (; l_NodeStart != l_NodeEnd; ++l_NodeStart) { p_PMap[*l_NodeStart] = p_ewrg(); } } called this way : test2<Graph,int(City::*)>(l_Gen, &City::pos_X); But I can't figure any type for &City::pos_X in order to write the header for test2 allowing the function to work with float, char ... Thanks in advance M.CORBION

2 1

Re: [Boost-users] [interprocess]files locations for mutex and named shm
by Mike Spertus 14 Aug '09

14 Aug '09

Ion Gazta?aga wrote > Mike Spertus escribi?: > >> > I'm being bitten by the surprise discovery that different Windows users >> > can't(?) communicate via named shared memory using Boost Interprocess as >> > in the post below from 2008-09-18 (Changing all processes to use the >> > same TMP directory is not an option for us due to interoperability >> > requirements). Is there a workaround? Was anything ever done about the >> > proposed solution below? Another alternative would be to make it >> > possible to specify the "Boost Interprocess temp directory". >> > > For boost 1.40 I've changed the TMP directory for the Common Documents > directory, searching that folder using the registry. In theory, that > folder is accessible by all processes and should be present in all > systems. Nevertheless, I'll add the option to specify the temp directory > to my to-do list, maybe using an environment variable? > > Best, > > Ion > > Hi Ion, Thanks for the response. boost 1.40 will be a big help. Among other things, I have found that this results in a much more serious problem, which is that boost interprocess named mutexes do not provide mutual exclusion because the service and application will use different directories to hold the shared memory mappings that back the mutex. As far as specifying the temp directory, providing an API instead of an envar would prevent conflict with other apps using boost::interprocess if we distribute our application and have to set a global envar in our installer. Thanks again, Mike

1 0

how to know my own IP address
by Paolo Viotti 14 Aug '09

14 Aug '09

Hi, I'm using the boost library to create and manage a UDP socket. I was wondering if there is a way to know the public address of my machine using the boost classes. With this code udp::endpoint thisendpoint(udp::v4(), UDPPORT); boost::asio::ip::address myaddress = thisendpoint.address(); std::cout<< "__My IP address: " << myaddress.to_string() << std::endl; I can only print the any_address (0.0.0.0)... thanks, p_viotti

5 4

randomize_property question
by mcorbion＠mobigis.fr 14 Aug '09

14 Aug '09

Hello I'm currently trying to create a randomly made graph and I'm having problem populating the properties using the randomize_property. Just like this man http://lists.boost.org/boost-users/2005/09/14033.php I'm wondering if it's even possible to use randomize_property with the bundled properties? I hope so because the bundled properties are in my opinion much more easy to use. Here's the bundled property I would like to randomize (which is quite basic): struct City { int pos_X; int pos_Y; }; I've tried to get from it the property class needed using vertex_bundle_type<Graph>::type this way : randomize_property<vertex_bundle_type<Graph>::type>(m_Graph,l_Gen); I then looked in the source code and it seems that the function merely takes a property_map and randomly changes the values. So I tried this (I was desperate^^) using the way "get" works with bundled property : randomize_property<&City::pos_X>(m_Graph,l_Gen); Here's the source code for randomize_property boost/graph/random.hpp 169 template<class Property, class G, class RandomGenerator> 170 void randomize_property(G& g, RandomGenerator& rg, 171 Property, vertex_property_tag) 172 { 173 typename property_map<G, Property>::type pm = get(Property(), g); 174 typename graph_traits<G>::vertex_iterator vi, ve; 175 for (tie(vi, ve) = vertices(g); vi != ve; ++vi) { 176 pm[*vi] = rg(); 177 } 178 } I know that for my short example and, by inspiring me from the source, I could do it manually but I'd rather do it using genericity. Hope there isn't too much broken english. Thanks M.Corbion

1 0

[Program options] changing output format of options_description
by Roman Shmelev 14 Aug '09

14 Aug '09

Hi! I'm using boost::program_options and my program obtains many parameters. When name or default value of param is long, I get smth like this while trying to cout << desc_obj; fullname-of-important-file, f (=/fold1/fold2/fold3/file.ext) The description if so narrow :( And I wish if it was like this: fullname-of-important-file, f (=/fold1/fold2/fold3/file.ext) The description is here. Such formatting is much more beautiful, IMHO. [empty line?] another-param (=value) Another long long long long description Is there any way to do this? some switcher..

3 6

minor boost::interprocess::vector bug (?)
by Bob Walters 13 Aug '09

13 Aug '09

I have encountered a minor bug with boost::interprocess::vector<> which involves a situation where std::uninitialized_copy() is invoked with a NULL pointer value, and length of 0. I’m not sure if that is truly an error, but unfortunately the MWVC (9.0) debug library has an assertion which gets tripped by the null pointer value, so I've had little choice but to patch my copy of the code to prevent that call from happening. Let me know if you want me to create a trac item for this problem. The problem occurs when an empty vector (created by the single allocator argument constructor) is swapped with a vector that has an established capacity. Specifically, I see this with the following code: boost::interprocess::vector<char,char_alloc_type> *buffer = somewhere_in_shared_memory; // can’t construct ovectorstream to use buffer directly, but can swap it into place: boost::interprocess::basic_ovectorstream< buffer_t<void_alloc_t> > vstream(buffer->get_allocator()); vstream.swap_vector(*buffer); On msvc (9.0), somewhere below priv_range_insert(), a call gets issued to std::uninitialized_copy with a null pointer and length of 0. My solution to this was to modify vector::swap as follows: diff -r ./containers/container/vector.hpp ../../../../boost_1_39_0/boost/interprocess/containers/container/vector.hpp 1206,1208c1206,1210 < this->reserve(new_size); < containers_detail::default_construct_aux_proxy<T, T*, size_type> proxy(n); < priv_range_insert(this->cend().get_ptr(), n, proxy); --- > if (n>0) { > this->reserve(new_size); > containers_detail::default_construct_aux_proxy<T, T*, size_type> proxy(n); > priv_range_insert(this->cend().get_ptr(), n, proxy); > } Again, let me know if you want me to create a ticket for this problem.

1 0

[statechart] Can inner states be defined for a state in orthogonal region?
by Gordon Smith 13 Aug '09

13 Aug '09

I'm unable to compile the machine below that includes inner states within a state in an orthogonal region. The error is: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' {{{ struct SerialPort : public state_machine< SerialPort, StateTXWrapper > {} struct StateTXWrapper: simple_state< StateTXWrapper, SerialPort, mpl::list< StateTXNotReady, StateStart > > {}; // Orthogonal 0 struct StateMrf : simple_state< StateMrf, StateTXWrapper::orthogonal< 0 > > {}; struct StatePortClosed : simple_state< StatePortClosed, StateTXWrapper::orthogonal< 0 > > {}; struct StateOpenPort : simple_state< StateOpenPort, StatePortClosed > {}; struct StateOpenPortWait : simple_state< StateOpenPortWait, StatePortClosed > {}; }}} The assert is invoked for StateOpenPort and StateOpenPortWait: BOOST_STATIC_ASSERT( ( mpl::less< orthogonal_position, typename context_type::no_of_orthogonal_regions >::value ) ); Is it possible to have such inner states? Boost version 1.38 Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 15.00.30729.01 for 80x86

2 1

[serialization - newbie] serializing/deserializing singleton class objects
by Soumen 13 Aug '09

13 Aug '09

Hi, This is query was posted as part of different question. Doing a fresh post with a new topic as earlier one didn't fetch any response - assuming it may got lost in the original context. I'm trying to serialize/deserialize singleton class objects. My code is similar to following for save/restore: void save(boost::archive::binary_oarchive &archive) { MyData *data = MyData::instance(); if (data) archive << data; } void restore(boost::archive::binary_iarchive &archive) { MyData::cleanup(); archive >> (MyData *) MyData::instance(); } My save function works - stores data on disk. But the restore function doesn't compile. I get error like following: error: no match for ‘operator>>’ in ‘archive >> (MyData *) MyData::instance()’ /boost/1_35_0/include/boost/archive/detail/interface_iarchive.hpp:62: note: candidates are: Archive& boost::archive::detail::interface_iarchive<Archive>::operator>>(T&) [with T = MyData*, Archive = boost::archive::binary_iarchive] If I change the 2nd line of restore function in following way, the error message almost remains same: MyData *inst = MyData::instance(); archive >> (MyData *) inst; Please guide me what I'm doing wrongly. Regards, ~ Soumen -- View this message in context: http://www.nabble.com/-serialization---newbie--serializing-deserializing-si… Sent from the Boost - Users mailing list archive at Nabble.com.

3 10

Re: [Boost-users] question about multi_array use
by Alle Meije Wink 13 Aug '09

13 Aug '09

> On Sat, Aug 8, 2009 at 4:51 PM, Alle Meije Wink<a.m.wink(a)gmail.com> wrote: > >>> You could always just wrap up each of the possible dimensions in a >>> struct that can handle the (de)serialization and everything too, >>> perhaps use crtp to put identical functionality in a non-virtual base >>> class. > >> Overmind, I guess compared to what I had in mind (define the data container >> of the image [template?] class as a multi_array with a dimensionality given >> as a size_t parameter), the CRTP struct you are talking about specifies all >> of the possible types. Is that correct? >> >> If I understand it correctly then this does what I want, but does that mean >> that in the worst-case scenario, I have to write out the functionality for >> all different dimensionalities? If the parameterised template class idea is >> possible, that would save some typing! > > I could see using fusion (mostly the "apply" construct) would make it > generic to any number of dimensions. Boost.Fusion is amazing for such > work, think MPL, but it works at runtime too. > I like the look of boost::Fusion in terms of advanced generic C++ programming, but in terms of finding a concise description of my image template class / class / data type, this may be overshooting the aim a bit. Plus I will need to read up on template metaprogramming! Coming back to the original idea: my images are stored as files which have a (on-disc 1-dimensional) sequence of intensities, and a header containing a number dims (dimensionality) and an array dim[8] (maximum of 8 dimensions). The problem that images can have different (but all built-in) data types can be circumvented with template programming, which is great compared to the old C-style casting to double. But talking about C-style, dealing with dimensions was possible in a fast way (in terms of both coding and runnning) with malloc and pointers (to pointers (to pointers)). Previously this is how I used to implement operations on images: casting everything to double, using pointers to get to image elements. I was hoping that by using templates to abstract from element type, and multi_array to cover different dimensionalities, it would be possible code image operations only once, for all types and dimensionalities. From what I understand, the curious recursion way matches most closely what I was looking for (and is still as close to generic programming as possible?). The scopira narray class http://www.scopira.org/api/narray_8h-source.html seems to do something similar. If there is another way to do this then I'm still very interested! Thanks, Alle Meije

3 3

Re: [Boost-users] question about multi_array use
by Alle Meije Wink 13 Aug '09

13 Aug '09

Dear OverMind Hope I'm not making this thread too long, I've tried to search the archives but did not get further than browsing. After looking at different options, your idea of wrapping the different dimensions/dimensionalities in a struct sounds like the best idea, and closest to the type of data and problems I'm dealing with. Would you have a few more clues (maybe code, maybe URLs) as to how to shape this? I had a look at http://en.wikipedia.org/wiki/Curiously_recurring_template_pattern but that is a very broad description. As I understand it, the struct that encapsulates the possible dimensionalities and the CRTP class refer to the same solution? Or are they different things? Thanks! Alle Meije > Date: Fri, 7 Aug 2009 18:09:11 -0600 > From: OvermindDL1 <overminddl1(a)gmail.com> > Subject: Re: [Boost-users] question about multi_array use > > You could always just wrap up each of the possible dimensions in a > struct that can handle the (de)serialization and everything too, > perhaps use crtp to put identical functionality in a non-virtual base > class. > >> On Fri, Aug 7, 2009 at 2:04 PM, Anton Daneyko<self(a)mezhaka.com> wrote: >> Hello, >> >> I might be wrong, but it seems the answer is "no you can't do that", because >> the dimensionality is a template parameter multi_array<int, 2> and >> multi_array<int, 3> are different types. However I would like to hear some >> else' opinion as well. >> >> Regards, >> Anton Daneyko. >> >> On Fri, Aug 7, 2009 at 3:48 PM, Alle Meije Wink <a.m.wink(a)gmail.com> wrote: >>> Hello, >>> >>> I would like to use the multi_array container to handle imaging data. The >>> image data can be anything up to 8-dimensional (usually up to 4) and >>> dimension information is found in records that accompany the binary data. >>> >>> Would it be possible to create an image class that takes the >>> dimensionality and extents list as parameters, so that images of all >>> dimensionalities can be treated as one class? >>> >>> For example, could the dimensionality be passed as a size_t argument? >>> >>> What I understand from the multi_array paper is that the extents list >>> would only be required whan the array is initialised.

1 0

[BGL] Does put override const?
by Caligula 13 Aug '09

13 Aug '09

In the code snippet below (which is inside a vis object) if the line //g[*ei].edge_Weight = "Heavy"; is uncommented, compiling gives :error const discarded ( or something to that effect) because of the const in (const Graph & g) . But then how come put(m_eWeight_map, *ei, "Heavy"); compiles successfully and successfully changes the value? Does put(m_eWeight_map, *ei, "Heavy"); override the const in void Change_data(const Graph & g) ? template < typename Graph > void Change_data(const Graph & g) //void Change_data(Graph & g) { typename graph_traits< Graph >::edge_iterator ei, ei_end; for(tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) { put(m_eWeight_map, *ei, "Heavy"); //g[*ei].edge_Weight = "Heavy"; } } Thanks - Caligula

2 1

What's the status of boost.chrono?
by Tan, Tom (Shanghai) 13 Aug '09

13 Aug '09

Back in May, Vicente Botet Escriba volunteered to take up this library when Beman dropped it. What's the status now? I really like and use the process_clocks and timers alot, which seems not be in the c++0x standard library. When can we have it in the boost trunk so that we can build it with a boost release? Thanks.

1 0

memory overhead of boost::function<>
by Zachary Turner 12 Aug '09

12 Aug '09

Is there an easy way to calculate the minimum and maximum memory overhead required by a single instance of boost::function? It's not easy to trace through the code and find all instances of allocations / deallocations and member variables. sizeof(boost::function<T>) appears to be 32 on my machine for all values of T but I'm not sure if there are certain types of functions which might be less than this or more than this. Is there any way to reduce the memory overhead of boost::function? 32 is quite a bit on an x86 architecture, considering a normal function pointer on the same machine takes only 4 bytes. I was thinking of using boost::function<> as the basis for a generic inter-object messaging system where there may be thousands of objects in the systems any of which might want to communicate via event sinks / sources implemented via boost::function<> and callback registration. But if the memory overhead is 32-bytes per object at a minimum, and possibly more with more complicated function objects or on 64-bit architectures, then it seems like it could quickly grow out of hand if there were many listeners.

2 1

[Test] Making use of boost::exception_diagnostic_information and friends
by Alexander Lamaison 12 Aug '09

12 Aug '09

Are there any plans to let the Boost.Test runner make use of the extra information that the Boost.Exception library is able to 'inject' into exceptions? Currently, when an exception is caught by the test runner and it is derived from std::exception, the report includes the what() string but is not able to give any infomation about the location the exception was thrown from: unknown location(0): fatal error in "cfstr_shellidlist_multiple_items": std::runtime_error: All items in a DataObject must have the same parent. When an exception is thrown using the BOOST_THROW_EXCEPTION() macro, extra information including the location it was thrown from are added to the exception: http://www.boost.org/doc/libs/1_39_0/libs/exception/doc/BOOST_THROW_EXCEPTI…. This allows callers to pass an exception to diagnostic_infotmation() and get a string detailing the exact nature of the exception thrown. It should be possible to let the test runner extract this information in the same way that diagnostic_infomation does and use it to improve the test runner output. Many thanks. Alex

4 17

[mpi] what is the equivalent of MPI_COMM_SELF?
by alfC 12 Aug '09

12 Aug '09

Is there something equivalent to the constant MPI_COMM_SELF in Boost.MPI? It is easy to refer the MPI_COMM_WORLD since this is the default constructor of boost::mpi::communicator, but it seems that the only way to have the equivalent of MPI_COMM_SELF is to do boost::mpi::communicator self(MPI_COMM_SELF, boost::mpi::communicator::comm_attach); does it make sense to define a global object with that name to refer to the communicator in current process? (this can be handy to switch to serial bahavior and parallel executrion when debugging the code, I guess). Thanks, Alfredo

3 3

[BGL] Can't correctly copy data
by Caligula 12 Aug '09

12 Aug '09

Hi, I've been working on this bug for a few weeks now. Its sort of a show stopper for me. I'm not able to correctly copy a simple string datum from one element to another such element. Just go to http://pastebin.com/m6f57be95 And see pastebin references. Either I'm doing something wrong or BGL is seriously flawed. Thanks Caligula

3 6

[Boost.Array] Checked iterator in debug mode
by dariomt＠gmail.com 12 Aug '09

12 Aug '09

Hi list, I can see that boost::array::operator[] has bounds checking in debug mode. Is there a way to get checked iterators also? Like safe STL style. If not, would that be a useful addition to boost::array? And if I was to add checked iterators to boost::array, do you have any recommendations? Any boost::detail::checked_iterator I can reuse? Thanks!

1 0

[serialization] boost::system::error_category
by Rutger ter Borg 12 Aug '09

12 Aug '09

Dear list, I'm trying to write serialization code for Boost.System's error_codes, however I'm having trouble to serialize/deserialize an error_category, which are polymorphic singleton objects. I guess when saving, type information needs to be stored, like with polymorphic pointers? When loading, a global function (get_generic_category(), get_system_category(), etc.) could be used to obtain a reference to the singleton object. Is there any way to use the exported type information in such way that a reference to the correct singleton is obtained? Any suggestions on how to approach this? Thanks in advance, Kind regards, Rutger ter Borg

1 1

mpl::map ---> fusion::map conversion problems
by Zachary Turner 11 Aug '09

11 Aug '09

Hello, I'm trying to convert an MPL map to a fusion map using boost::fusion::result_of::as_map. I have the following code, with some of the leading-in code omitted for brevity although I don't think it's relevant: //listener_info_types := mpl::list< pair<handler<E>, token<H> > > typedef typename boost::mpl::transform< handler_types, token_types, parameterize_pair<boost::mpl::_1, boost::mpl::_2> >::type listener_info_types; //listener_info_lookup = mpl::map<EventType, pair<handler<E>, token<H> > typedef typename boost::mpl::transform< SupportedEvents, listener_info_types, boost::mpl::inserter< boost::mpl::map<>, boost::mpl::identity<boost::mpl::_1> > >::type listener_info_lookup; typedef typename boost::fusion::result_of::as_map<listener_info_lookup>::type fusion_listener_map; Deleting the last line and everything works. I've successfully used a similar technique to convert mpl vectors to fusion vectors in the past, is it not possible for maps? Or more likely I'm just doing something wrong? I can post more code if necessary including full type definitions leading up to all these previous typedefs, but basically I have a class parameterized initially with an mpl::list of some number of types. I then do a sequence of mpl::transform calls, none of which with use a custom inserter. The end result of all of that is listener_info_types above. So listener_info_types should be an mpl::list. The next call should then create an mpl::map, (SupportedEvents is the initial type used to parameterize the class, so an mpl::list as previously mentioned). Any suggestions? Thanks Zach

2 2

casting with boost
by zeev mintz 11 Aug '09

11 Aug '09

hi, i'm trying to do some simple casts using boost, to and from webToolkit widgets, i.e int i = 42; WString str; str = boost::lexical_cast<WString>(i); i get a compilaton error that goes something like this: lexical_cast.hpp(768): no operator ">>" matches these oprands... could it be a matter of updating my boost version? ( i'm using boost version 1.35) is there another way to make conversions without boost? thanks, Shalev.

2 1

Synchronous problem with asio
by Dan Benčík 11 Aug '09

11 Aug '09

Dear everybody, I have a problem using asio. My client/server application requires only synchronous communication. So, using the examples for synchro from the boost homepage, I have set up two procedures to send and receive data. Their code is as follows: void vReceive(tcp::socket & socket, std::string & szDest){ char szTmp_Buf [BUF_LEN + 1]; szDest = ""; std::cout << "Entering vReceive . . ." << std::endl; for (;;){ char szBuf [BUF_LEN]; boost::system::error_code error; uInt uiBytes_Recv = socket.read_some(boost::asio::buffer(szBuf), error); std::cout << " Read " << uiBytes_Recv << " bytes" << std::endl; if (error == boost::asio::error::eof) break; // Connection closed cleanly by peer. else if (error) throw boost::system::system_error(error); // Some other error. memcpy((void*) szTmp_Buf, (void*) szBuf, uiBytes_Recv ); szTmp_Buf[ uiBytes_Recv ] = '\0'; szDest += szTmp_Buf; }; std::cout << "Received" << szDest << std::endl; std::cout << "Leaving vReceive . . ." << std::endl << std::endl; }; void vSend(tcp::socket & socket, std::string & szSrc){ std::cout << "Entering vSend . . . " << std::endl; std::cout << "Sending " << szSrc << std::endl; boost::system::error_code ignored_error; boost::asio::write(socket, boost::asio::buffer(szSrc), boost::asio::transfer_all(), ignored_error); std::cout << "Leaving vSend . . . " << std::endl << std::endl; }; These procedures are just wrappers for the lines of code extracted from the boost examples. In my test applications, the client calls vReceive(socket, szDate); vSend(socket, std::string("Chop Suey!") ); vReceive(socket, szDate); vSend(socket, std::string("Halo")); and the server calls vSend(socket, message); vReceive(socket, szReceived); vSend(socket, message); vReceive(socket, szReceived); just to test the functionality. The problem is that both applications freeze after the first information exchange, as I have depicted on the following picture ( http://eubie.sweb.cz/asio_problem.JPG ). It seems that vReceive() procedure on the client side doesn´t finish while vSend() finishes on the server side. So, does anybody have any idea, what might be wrong? Just in case someone wanted to replicate the problem, I uploaded the complete sources to http://eubie.sweb.cz/asio_problem.rar file. Thank you all in advance, Daniel.

3 3

[Boost-users] http://www.boost.org/doc/libs/1_39_0/libs/regex/doc/vc71-performance.html
by Jerry Jeremiah 11 Aug '09

11 Aug '09

I have a couple questions. http://www.boost.org/doc/libs/1_39_0/libs/regex/doc/vc71-performance.htm l references PCRE 3.9 but http://www.pcre.org/ says that the current version is PCRE 7.9. I would really like to see current values for performance comparisons. Where would I get the software for this comparison? Is the source part of the Boost library? Thanks, Jerry

2 1

2d array arg, f( int m, int n, int a[m][n] ) with multi_arrays ?
by Denis-B 11 Aug '09

11 Aug '09

Folks, how can I do the following with multi_arrays please ? void f( int m, int n, int a[m][n] ) // legal C99 ? dunno -- would be nice { ... a[j][k] = ... } ... int *a; // m*n ints, e.g. an image f( m, n, a ); thanks, cheers -- denis -- View this message in context: http://www.nabble.com/2d-array-arg%2C-f%28-int-m%2C-int-n%2C-int-a-m--n--%2… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

[Serialization] Stream error when serializing float and unsigned int
by D Kruithof 10 Aug '09

10 Aug '09

Hello All, When serializing this class: class { float a; unsigned int b; }; i get a stream error upon de-serializing, when 'a' has the value infinity. Is this a bug? I included a (very small) program which shows the error. It crashes on iteration 3. I use the mingw 3.4.5 compiler with boost 1.38 (no changes have been made to serialization since 1.38) on windows XP. Thanks, D Kruithof

2 1

[mpi] building boost::mpi libs
by James C. Sutherland 10 Aug '09

10 Aug '09

I have successfully built the boost MPI libraries on my mac. When trying on Linux I am having problems with the compiler not including the path for mpi.h. For example, I get errors like: > gcc.compile.c++ bin.v2/libs/mpi/build/gcc-3.4.6/release/threading- > multi/python/datatypes.o > In file included from ./boost/mpi/python/config.hpp:15, > from ./boost/mpi/python/serialize.hpp:23, > from libs/mpi/src/python/datatypes.cpp:13: > ./boost/mpi/config.hpp:20:17: mpi.h: No such file or directory I am not familiar with bjam. My MPI installation is in a non-standard location and I added > using mpi : /uufs/chpc.utah.edu/sys/pkg/mpich2/std/bin/mpicxx ; to my user-config.jam file. How do I tell bjam to look somewhere special for the mpi headers? Thanks for any tips. James

2 2

[statechart] Non-Const Machine Pass-throughs and state_cast
by Grant Erickson 10 Aug '09

10 Aug '09

I am using Boost::Statechart for the first time, throwing in the bin a history of hand-coded and other class-based implementations of my own design, to realize a rather simple machine consisting of four events (start/stop/suspend/resume) and four states (stopped/running/stopped-suspended/running-suspended). The machine is effectively a timer and wraps another internal timer class that can be stopped/started and suspended/resumed. This is all the machine does. The internal timer class can get/set its interval and can also get/set a delegate, that is called (if set) when the timer fires. These internal timer management interfaces are "passed through" to the state machine interface, such that application/test code is as follows: ...(TimerDelegate & inDelegate, float inInterval) { Timer theTimer; theTimer.initiate(); BOOST_ASSERT(!theTimer.IsSuspended()); BOOST_ASSERT(!theTimer.IsRunning()); DisplayState(theTimer); theTimer.SetDelegate(inDelegate); theTimer.SetInterval(inInterval); cout << "The delegate is " << theTimer.GetDelegate() << endl; cout << "The interval is " << theTimer.GetInterval() << endl; BOOST_ASSERT(!theTimer.IsSuspended()); BOOST_ASSERT(!theTimer.IsRunning()); DisplayState(theTimer); theTimer.process_event(Events::Start()); BOOST_ASSERT(!theTimer.IsSuspended()); BOOST_ASSERT(theTimer.IsRunning()); DisplayState(theTimer); The delegate does the real work of the program and receives events that drive the timer machine. Where I have run into a problem is that my machine "pass through" setter methods allowing the delegate to be set or the timer interval to be changed (neither of which materially alter the state of the machine) cannot be called as they are non-const qualified whereas their corresponding getters work fine since they are const qualified. I've worked around this in the short term by qualifying the setters as const and then qualifying the data members as mutable; however, this strikes me as flat-out ugly and wrong. Is there a better way to accomplish this? Am I misusing the template/design pattern? I suppose I could applying a const_cast(); however, that seems just as bad as my existing workaround. class InternalTimer; struct TimerDelegate { virtual void TimerDidFire(const InternalTimer &inTimer) const = 0; }; class InternalTimer { public: InternalTimer(void); : ~InternalTimer(void); TimerDelegate *GetDelegate(void) const; float GetInterval(void) const; void SetDelegate(TimerDelegate *inDelegate); void SetInterval(float inInterval); void Start(void); void Stop(void); private: TimerDelegate * mDelegate; float mInterval; }; struct ITimerManagement { public: virtual TimerDelegate *GetDelegate(void) const = 0; virtual float GetInterval(void) const = 0; virtual void SetDelegate(TimerDelegate * inDelegate) = 0; virtual void SetInterval(float inInterval) = 0; }; struct IRunning { public: virtual bool IsRunning(void) const; protected: IRunning(bool inRunning); private: bool mRunning; }; struct ISuspended { public: virtual bool IsSuspended(void) const; protected: ISuspended(bool inSuspended); private: bool mSuspended; }; struct Active; struct Timer : state_machine< Timer, Active > { public: TimerDelegate * GetDelegate(void) const { return (state_cast< const ITimerManagement & >().GetDelegate()); } float GetInterval(void) const { return (state_cast< const ITimerManagement & >().GetInterval()); } void SetDelegate(TimerDelegate *inDelegate) { state_cast< ITimerManagement & >().SetDelegate(inDelegate); // XXX } void SetInterval(float inInterval) { state_cast< ITimerManagement & >().SetInterval(inInterval); // XXX } bool IsRunning(void) const { return (state_cast< const IRunning & >().IsRunning()); } bool IsSuspended(void) const { return (state_cast< const ISuspended & >().IsSuspended()); } }; struct Timer; struct Stopped; struct Running; struct StoppedSuspended; struct RunningSuspended; struct Active : ITimerManagement, simple_state< Active, Timer, Stopped > { virtual TimerDelegate * GetDelegate(void) const { return (mInternalTimer.GetDelegate()); } virtual float GetInterval(void) const { return (mInternalTimer.GetInterval()); } virtual void SetDelegate(TimerDelegate *inDelegate) { mInternalTimer.SetDelegate(inDelegate); } virtual void SetInterval(float inInterval) { mInternalTimer.SetInterval(inInterval); } void Start(void) { mInternalTimer.Start(); } void Stop(void) { mInternalTimer.Stop(); } private: InternalTimer mInternalTimer; }; struct Running : IRunning, ISuspended, state< Running, Active > { public: typedef mpl::list< transition< Events::Stop, Stopped >, transition< Events::Suspend, RunningSuspended > > reactions; Running(my_context inContext) : my_base(inContext), IRunning(true), ISuspended(false) { context< Active >().Start(); } ~Running(void) { context< Active >().Stop(); } }; Regards, Grant

2 3

Re: [Boost-users] [Accumulators] Questions about the library
by dhruva 10 Aug '09

10 Aug '09

Hello, > Date: Thu, 25 Jun 2009 03:41:49 -0700 (PDT) > From: adish > Subject: Re: [Boost-users] [Accumulators] Questions about the library > To: boost-users(a)lists.boost.org > > > > > > ? ?2. If my platform does not support HW floating point ops, and all my > > > ? ?sample values are, e.g. ints, is there a way to specify that the > > > *computation > > > ? ?*and *return value itself* (i.e. result_type, e.g. the mean) will be done > > > ? ?in ints (naturally, at the cost of precision)? > > > > I have used UDT as I needed some extra information from the results (as I was > working on data from a time series). The reverse, using a POD like int must be > possible. Instead of the first argument being float/double, use an int. If that > does not work, you can wrap an int in a UDT, implement some of the operators > like '=', '<', '/' depending on the accumulator you plan to use (I did that as I > needed to send a UDT). > > Using an int still returns a float -- which is quite sensible. You might be able to write a custom extractor which can return an int. I have not explored it. I always thought the type you give as input is the type that gets returned. > By UDT do you mean User Defined Type? > This is an interesting approach. > I didn't realize that the result_type depends on the value type in > that way, I didn't see any UDTs mentioned in the docs. Yes, I mean writing a class/struct. I had to overload '<', '>', '+=' and '/' and I use it for variance, mean, median, min, max and my implementation of percentile. Remember to specialize std::numeric_limits for the UDT you write. Else, the min and/or max will have values that you have not added in the accumulator (garbage values). I had a tough time debugging it and finding the solution. Also, on Windows, you need to derive your specialization from _Num_base. As for implementing a generic rolling type: 1. You need to store your values in a circular buffer. 2. Each time you add a value into the buffer, pass the contents to a pristine accumulator. This may be sub optimal but works. Especially for those calculations where it is not easy to remove the effect of the first data that you want to pop. I had to do it this way because I was dealing with time series. If I want a rolling computation for a 1 hour window, I might add 1 sample and may have to remove more than 1 sample to ensure first-last is 1 hour window in the buffer. -dhruva Love Cricket? Check out live scores, photos, video highlights and more. Click here http://cricket.yahoo.com

3 2

[serialization] Uninitialized member in xml_archive_exception
by Gevorg Voskanyan 10 Aug '09

10 Aug '09

Hi, A coworker of mine has found an issue in boost::archive::xml_archive_exception - the constructor does not initialize the 'code' member. As the issue is not fixed in trunk yet, I went ahead and created the ticket #3331 to track it. Given the triviality of the fix, any chance it making into 1.40 ? Thanks, Gevorg

2 1

how to Sort boost collection class using multi sorting options/criteria
by ch.asad＠gmail.com 10 Aug '09

10 Aug '09

Hi I am using boost collection class. I did sorting e.g apply a quick/bubble sort algo , but i want to do sorting using multiple criteria. how we can implement using boost. Do boost have any classes or functions through which I can easily sort the data using multiple options? Thanks. Asad -- View this message in context: http://www.nabble.com/how-to-Sort-boost-collection-class-using-multi-sortin… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

How shared_from_this() work when it inherited from more than one time
by R. P. Janaka 10 Aug '09

10 Aug '09

please can anyone explain the reason for the following behavior #include <iostream> #include <boost/enable_shared_from_this.hpp> using namespace std; class A; typedef boost::shared_ptr<A> A_sptr_t; class B; typedef boost::shared_ptr<B> B_sptr_t; class A : public boost::enable_shared_from_this<A> { public: A() {} virtual ~A() {} }; class B : public A, public boost::enable_shared_from_this<B> { public: B() {} virtual ~B() {} void f(void) { cout << "this is working " << boost::enable_shared_from_this<B>::shared_from_this() << endl; } }; int main() { B_sptr_t b(new B()); b->f(); return 0; } the program will be terminated with the following message terminate called after throwing an instance of 'boost::bad_weak_ptr' what(): boost::bad_weak_ptr Aborted -- Regards, R. P. Janaka

5 8

[Asio] io_service::work::reset()
by Robert Jones 10 Aug '09

10 Aug '09

boost version 1.39.0 The documentation on io_service includes an example of calling work.reset(), which is a pretty essential piece of functionality. The documentation page on io_service::work does not list reset() as a member function. Am I missing something? - Rob.

1 1

[MultiIndex] how to reindex
by Igor R 10 Aug '09

10 Aug '09

Hello, Is it possible to rebuild container indices? I couldn't find any appropriate method in the docs, and even the "swap-trick" doesn't seem to work. The only way that worked so far was to rebuild the container from scratch...

1 1

[signals2, bind] connecting a slot with unrelated signature
by Igor R 09 Aug '09

09 Aug '09

Hello, Lets assume we've got an arbitrary signal that we don't know it's exact signature, and a function we'd like to connect as a slot. The function ignores all the signal arguments: void callback() { std::cout << "kuku" << std::endl; } int main() { signals2::signal<void(int, double, int)> sig; sig.connect(boost::bind(callback)); sig(); } The above compiles and works. Now I'd like not just to ignore signal's args, but to pass my own param: void callback(int cookie) { std::cout << cookie << std::endl; } int main() { signals2::signal<void(int, double, int)> sig; // I'd like to bind cookie=5 and to connect such a binder to the signal. // Is this possible without defining "manual" functors? sig.connect(???); sig(); }

2 3

[Test] BOOST_TEST_NO_MAIN with pre-built BoostPro libraries
by Alexander Lamaison 09 Aug '09

09 Aug '09

Is it possible to create one's own main() implementation when using the pre-built Boost libraries from BoostPro? The difficulty seems to be that, even if I define BOOST_TEST_NO_MAIN before including unit_test.hpp, the main method still exists in the pre-built library and this causes a linker conflict. The existing code I'm wokring on specifies /FORCE to the linker to make our main override the library main but I think that's a horrible solution and would really like to try something else. Even better would be if there were a way to only invoke our code, which includes calls to framework::run(test), if a particular command-line argument were present. In all other cases it would be nice to have the default test runner behaviour. I think this may be wishful thinking though. Any advice is greatly appreciated. Alex

2 3

Praise for boost.units
by Adrien Guillon 09 Aug '09

09 Aug '09

Just wanted to shower praise upon boost.units, which has finally filled a need I've had for a very long time. I am currently working with engineers to rebuild a simulation model, and boost.units has forced everyone to be consistent with their units... it has also forced the engineers to spend a few minutes arguing amongst themselves about the units of this variable or the other every once in a while... "is that a newton per meter squared?! No.. newton times meter... no it's... newton something else"... exactly what it should do! Good library! AJ

1 0

Re: [Boost-users] question about multi_array use
by Alle Meije Wink 09 Aug '09

09 Aug '09

Dear Overmind and Anton, thanks for your answers. Let's see if I understand! Yes, multi_array<int, 2> and multi_array<int,3> are different types (classes?). But I wouldn't mind using a template class to wrap it if that meant I could code it once, instead of 8 times for 8 different possible dimensionalities. Would it be able to define a template class in the way I described? Overmind, I guess compared to what I had in mind (define the data container of the image [template?] class as a multi_array with a dimensionality given as a size_t parameter), the CRTP struct you are talking about specifies all of the possible types. Is that correct? If I understand it correctly then this does what I want, but does that mean that in the worst-case scenario, I have to write out the functionality for all different dimensionalities? If the parameterised template class idea is possible, that would save some typing! Best wishes, Alle Meije > From: OvermindDL1 <overminddl1(a)gmail.com> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] question about multi_array use > Message-ID: > <3f49a9f40908071709rbd1ad80k4c5170093588f4d(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > On Fri, Aug 7, 2009 at 2:04 PM, Anton Daneyko<self(a)mezhaka.com> wrote: > >> Hello, >> >> I might be wrong, but it seems the answer is "no you can't do that", because >> the dimensionality is a template parameter multi_array<int, 2> and >> multi_array<int, 3> are different types. However I would like to hear some >> else' opinion as well. >> >> Regards, >> Anton Daneyko. >> >> On Fri, Aug 7, 2009 at 3:48 PM, Alle Meije Wink <a.m.wink(a)gmail.com> wrote: >> >>> Hello, >>> >>> I would like to use the multi_array container to handle imaging data. The >>> image data can be anything up to 8-dimensional (usually up to 4) and >>> dimension information is found in records that accompany the binary data. >>> >>> Would it be possible to create an image class that takes the >>> dimensionality and extents list as parameters, so that images of all >>> dimensionalities can be treated as one class? >>> >>> For example, could the dimensionality be passed as a size_t argument? >>> >>> What I understand from the multi_array paper is that the extents list >>> would only be required whan the array is initialised. >>> > > You could always just wrap up each of the possible dimensions in a > struct that can handle the (de)serialization and everything too, > perhaps use crtp to put identical functionality in a non-virtual base > class. >

2 1

[Boost.Test] Controlling Windows debug trace output
by Alexander Lamaison 08 Aug '09

08 Aug '09

I've recently noticed the Boost.Test outputs anything output using the Windows debug trace functions such as ATLTRACE. Thanks for this! This makes these trace functions so much more useful. However, I was wondering if there was some way to control this output. Ideally, I don't want my automoated test runs to output all these tracelines. Is there a flag to the test runnner that will turn them of? Many thanks. Alex Lamaison

2 4

Boost::asio, set tcp_nodelay, bad file descriptor?
by Alex Black 08 Aug '09

08 Aug '09

I'm experimenting with turning off the Nagle algorithm to possibly improve the performance of my socket server, I'm processing lots of small requests and I'd like as little latency as possible. Here is a code snippet: void CBaseWebServer::StartAccept() { try { shared_ptr<tcp::socket> pSocket(new tcp::socket(m_IoService)); boost::asio::ip::tcp::no_delay option(true); pSocket->set_option(option); m_pAcceptor->async_accept(*pSocket, bind(&CBaseWebServer::HandleAccept, this, pSocket, boost::asio::placeholders::error)); } catch ( ... ) { cout << "Unexpected exception caught in " << BOOST_CURRENT_FUNCTION << endl << boost::current_exception_diagnostic_information(); } } I'm getting an exception on the set_option line: Unexpected exception caught in void CBaseWebServer::StartAccept() Throw in function (unknown) Dynamic exception type: N5boost16exception_detail10clone_implINS0_19error_info_injectorINS_6syst em12system_errorEEEEE std::exception::what: Bad file descriptor What am I doing wrong here? Thanks! - Alex

4 15

[BGL] Bug - Can't correctly copy bundled data
by Caligula 08 Aug '09

08 Aug '09

Hi, I've been working on this bug for a few weeks now. Its sort of a show stopper for me. I'm not able to copy a simple string datum from one element in a bundled property struct to another such element. Just go to http://pastebin.org/7125 And see pastebin references. I have found an ugly workaround for now, but I would really like it to work properly. Hope someone can/will help me with this. I'm also having trouble with copy_graph. I think people should be able to store and retrieve high level elements such as graphs, subgraphs, vertices, adges and their data. BGL seems to be deficient in this regard. Thanks Caligula

1 0

[Singals]problem about add a new connection in slot callback
by mos 08 Aug '09

08 Aug '09

Hi! I'm afraid i can't discribe the problem very well, so please see the code: #include <boost/signal.hpp> #include <iostream> using namespace std; typedef boost::signal<void ()> signal_t; typedef boost::signals::connection connection_t; signal_t g_signal; void test_b() { cout << "b" << endl; } void test_a() { cout << "a" << endl; g_signal.connect(test_b); } int _tmain(int argc, _TCHAR* argv[]) { connection_t t = g_signal.connect(test_a); g_signal(); t.disconnect(); g_signal(); return 0; } int the function test_a , I perfer call test_b next signal that mean output is "a b" but test_b is called immediately and the output is "a b b" how can I solve the problem? mos.

2 1

question about multi_array use
by Alle Meije Wink 08 Aug '09

08 Aug '09

Hello, I would like to use the multi_array container to handle imaging data. The image data can be anything up to 8-dimensional (usually up to 4) and dimension information is found in records that accompany the binary data. Would it be possible to create an image class that takes the dimensionality and extents list as parameters, so that images of all dimensionalities can be treated as one class? For example, could the dimensionality be passed as a size_t argument? What I understand from the multi_array paper is that the extents list would only be required whan the array is initialised. Best wishes Alle Meije

3 2

[BGL] Bug - Can't correctly copy bundled data.
by Caligula 07 Aug '09

07 Aug '09

Hi all, Been working on this bug for a few weeks now. Its sort of a show stopper for me. Not able to copy a simple string datum from one element in a bundled property struct to another such element. See attachment. Hope someone can/will help me with this. Thanks -Caligula

2 2

[boost-users]Shared_ptr and std::find
by Ryan McConnehey 07 Aug '09

07 Aug '09

Is it possible to have std::find compare the class that the shared_ptr is pointing too? I have a list of shared_ptr of a class called FundamentalTypes. The class has it's own operator==. I'd like to search the list with std::find using the class's operator==. I've included the class with the key elements I'm referring too. Ryan class FundamentalTypes { public: FundamentalTypes(std::string const& name) : m_name(name) bool operator==(FundamentalTypes const& rhs) { return (rhs.m_name == m_name) ? true : false; } std::string m_name; }; template<typename T> class Type : public FundamentalTypes { Type(std::string const& name) : FundamentalTypes(name) }; //main typedef shared_ptr<FundamentalTypes> sharedTypes typedef std::list<sharedTypes> TypesList sharedTypes value = sharedTypes(new Type<short>("bob")); TypesList m_list; TypesList::iterator itor = std::find(m_list.begin(), m_list.end(), value);

3 3

Re: [Boost-users] [interprocess]files locations for mutex and named shm
by Mike Spertus 07 Aug '09

07 Aug '09

I'm being bitten by the surprise discovery that different Windows users can't(?) communicate via named shared memory using Boost Interprocess as in the post below from 2008-09-18 (Changing all processes to use the same TMP directory is not an option for us due to interoperability requirements). Is there a workaround? Was anything ever done about the proposed solution below? Another alternative would be to make it possible to specify the "Boost Interprocess temp directory". Mike Eugen Stoianovici wrote: > > Ion Gaztañaga wrote: > > Eugen Stoianovici wrote: > >> Ion Gaztañaga wrote: > >>> You can't, unless you modify the code in: > >>> > >>> boost/interprocess/detail/temp_dir_helper.hpp > >>> > >>> Why do you want to change the location of those files? > >>> > >>> Ion > >> This is only a problem if you run processes with different users. Ex: > >> if you're using shared memory between an user app and a service, the > >> service will look for the segment in C:\Windows\Temp\ and the user > >> app will look for it in C:\Documents and settings\user\local > >> settings\etc. > >> My changes should go in the temp_dir_helpers.hpp file, right? > > > > Good point. I'll try to see if I can unify this when I have a bit of > > time. Maybe we can find a common directory for all processes. Any hint > > or suggestion? > > > On XP C:\Windows\Temp would be a good idea but i don't know if it is > writable by all users. I'm going to look into it when i get the chance, > but for now, changing the "TMP" env to something else is enough for me. > > Thanks again, > Eugen Stoianovici

2 1

[Serialization] Zero-sized arrays
by Roland Kaminski 07 Aug '09

07 Aug '09

Hi, i am planning to use the boost serialization library to implement checkpointing for an ASP/Sat solver. Unfortunately, the solver implements one (very special) optimization that makes use of a zero-sized array at the end of a class. I have found no way to store something like this using the library. There is a small program in the attachment that contains data structures similar to the ones used in the solver code. This would need a mechanism to control the allocation of memory during deserialization. Do you see any possibility do serialize something like this? Regards and thanks, Roland

3 11

Parsing Sparse Matrix to Get JA, IA, A Vector
by Peverall Dubois 07 Aug '09

07 Aug '09

Does boost has a library to parse a sparse matrix to get the index the non-zero element value? E.g. given this matrix: 1 2 0 0 0 3 9 0 0 1 4 0 We hope it to return A = [ 1 2 3 9 1 4 ] IA = [ 1 3 5 7 ] JA = [ 1 2 2 3 2 3 ] Let NNZ denote the number of nonzero entries of Matrix. The first array is A, which is of length NNZ, and holds all nonzero entries of M in left-to-right top-to-bottom order. The second array is IA, which is of length m + 1 (i.e., one entry per row, plus one). IA(i) contains the index in A of the first nonzero element of row i. Row i of the original matrix extends from A(IA(i)) to A(IA(i+1)-1). The third array, JA, contains the column index of each element of A, so it also is of length NNZ. Is there any implementation for handling such a large matrix to give us A, IA and JA, without having have to slurp all the files into RAM? Because the actual dimension is very large 10^6 to 10^7. Regards, G.V.

2 1

Inconsistent behavior of fusion::find with vector and adapted struct.
by Mike Tegtmeyer 06 Aug '09

06 Aug '09

I seem to have found an inconsistency in how fusion::find works with fusion::vector and an adapted struct. Basically, attempting to find a non-const type on a const vector with a non-const member works but requires a const-member find for an adapted struct. (See code below). Is this something that was just overlooked or there a technical reason for this behavior. In any case is there some way to identify a adapted struct in the general case (as apposed to the tag of the specific type) that can be used for a workaround? Thanks in advance, Mike #include <boost/fusion/adapted/struct/adapt_struct.hpp> #include <boost/fusion/container/vector/vector.hpp> #include <boost/fusion/algorithm/query/find.hpp> #include <boost/type_traits.hpp> #include <string> #include <iostream> namespace b = boost; namespace bf = boost::fusion; namespace demo { struct employee { std::string name; int age; }; } // demo::employee is now a Fusion sequence BOOST_FUSION_ADAPT_STRUCT( demo::employee, (std::string, name) (int, age)) int main(void) { typedef bf::vector<int,float> V1; // Find against non-const V1 V1 v1(1,2.0); BOOST_MPL_ASSERT_NOT(( b::is_same<bf::result_of::find<V1,int>::type,bf::result_of::end<V1>::type> )); assert(*bf::find<int>(v1) == 1); // Find against const V1 const V1 const_v1(3,4.0); BOOST_MPL_ASSERT_NOT(( b::is_same<bf::result_of::find<const V1,int >::type,bf::result_of::end<const V1>::type> )); assert(*bf::find<int>(const_v1) == 3); // Find against non-const employee demo::employee e1 = {"Foo",18}; BOOST_MPL_ASSERT_NOT(( b::is_same<bf::result_of::find<demo::employee,int>::type,bf::result_of::end<demo::employee>::type> )); assert(*bf::find<int>(e1) == 18); // Find against const employee const demo::employee const_e1 = {"Bar",21}; #if 0 BOOST_MPL_ASSERT_NOT(( b::is_same<bf::result_of::find<constdemo::employee, int>::type,bf::result_of::end<const demo::employee>::type> )); assert(*bf::find<int>(const_e1) == 21); #else // note that the find key is a const int for this to work and is inconsistent with fusion::vector BOOST_MPL_ASSERT_NOT(( b::is_same<bf::result_of::find<constdemo::employee, const int>::type,bf::result_of::end<const demo::employee>::type> )); assert(*bf::find<const int>(const_e1) == 21); #endif return 0; }

2 2

[mpi] irecv / send problem
by Nick Collier 06 Aug '09

06 Aug '09

I running into an issue where an irecv followed by a send results in deadlock. A simple test case, class Item { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive& ar, const unsigned int version) { ar & val; } public: int val; Item() : val(1) { } }; struct Receipt { boost::mpi::request request; std::vector<Item> items; }; int main(int argc, char **argv) { mpi::environment env(argc, argv); mpi::communicator world; Receipt receipt; vector<Item> msg(100000); int other = world.rank() == 0 ? 1 : 0; cout << world.rank() << " irecv from " << other << endl; receipt.request = world.irecv(other, 0, receipt.items); cout << world.rank() << " sending to " << other << endl; world.send(other, 0, msg); receipt.request.wait(); cout << "Done" << endl; } Run with mpirun -np 2, this never completes. It does complete with vector<Item> msg(10) however. Nick

5 7

[lambda] Help figuring out variable substitution, lazy functions, etc.? Should I be looking at Phoenix
by Jesse Perla 06 Aug '09

06 Aug '09

I have been trying to prevent variable substitution with boost::lambda and cannot figure out how to prevent variable substitution. Here is a (simplified) version: double first_moment(double x) { return x; } //And create a function auto myfunc = first_moment(_1); cout << myfunc(2.0); ... This doesn't compile, and every permutation I can think of using protect, etc. fails as well. Now I realize that this looks like a job for "bind" (which works fine of course) but this is a simplified pattern of the notation I want. Is there any way to do this with protect, unlambda, etc. around the _1? Are other libraries like Phoenix a better place to look for this kind of functionality? Do people see Phoenix as the evolution of boost lambda or are these likely to remain in parallel? Should I stick with C++0X lambdas? Thanks, Jesse

3 3

Terminate an io_service properly
by Robert Gruendler 06 Aug '09

06 Aug '09

Hi, i'm trying to create a simple socket server wich should be able to shut down when receiving a specific message. I've tried to alter the blocking tcp echo server example of the boost::asio library, but i'm not sure how to properly end the main "listening" loop from within the session thread. here's the modified asio example. when i try to close the acceptor from within the session thread, i get an exception "*The file handle supplied is not valid". *i assume this is the wrong place to close the acceptor / stop the io_service, but i don't know where else i can do this: using boost::asio::ip::tcp; const int max_length = 1024; typedef boost::shared_ptr<tcp::socket> socket_ptr; boost::asio::io_service io_service; tcp::acceptor* acceptor; void session(socket_ptr sock) { try { for (;;) { char data[max_length]; boost::system::error_code error; size_t length = sock->read_some(boost::asio::buffer(data), error); if (error == boost::asio::error::eof) break; // Connection closed cleanly by peer. else if (error) throw boost::system::system_error(error); // Some other error. std::string message = data; if (message.compare("SHUTDOWN") == 0) { //how to terminate the server through an incoming message ? acceptor->close(); io_service.stop(); } boost::asio::write(*sock, boost::asio::buffer(data, length)); } } catch (std::exception& e) { std::cerr << "Exception in thread: " << e.what() << "\n"; } } void server(boost::asio::io_service& io_service, short port) { acceptor = new tcp::acceptor(io_service, tcp::endpoint(tcp::v4(), port)); std::cout << "server started" << std::endl; for (;;) { if (acceptor->is_open()) { socket_ptr sock(new tcp::socket(io_service)); acceptor->accept(*sock); boost::thread t(boost::bind(session, sock)); } else break; } std::cout << "server stopped"; } int main(int argc, char* argv[]) { try { server(io_service, 22222); } catch (std::exception& e) { std::cerr << "Exception: " << e.what() << "\n"; } delete acceptor; return 0; }

3 2

Boost Software License implications for derivative works
by Naik, Roshan 06 Aug '09

06 Aug '09

The Boost Software License (BSL) requires derivative works to include the text of the Boost License itself. I am considering the use of the Boost preprocessor library (only) to implment certain parts of Castor <http://www.mpprogramming.com/cpp> (an open source C++ library) which is already covered under the MIT license. My real concern is, by including the BSL text in Castor, I dont want it to look as if Castor is covered by BSL when it is actually covered by MIT license. As Boost::pp would be used internally it would be shipped as part of the library. Would it suffice if boost::pp headers were simply bundled as-is, along with the licensing text that appears at the top each header ? That way it would appear as if only those headers are covered by BSL and the rest of Castor is covered by MIT. - Roshan

3 2

Why does auto_link.hpp assume that debug versions of STLPort are built with _STLP_DEBUG?
by Max Motovilov 06 Aug '09

06 Aug '09

Subj. Is there a [relatively non-invasive] way to break this dependency? As far as I can tell, STLPort itself makes no such assumption and builds in non-_STLP_DEBUG mode by default. I cannot use _STLP_DEBUG mode for other reasons... The platform is Windows Mobile 5, Visual Studio 2008 (VC9) Regards, ...Max...

2 3

Why is size param required for BOOST_PP_TUPLE_TO_LIST(size, tuple) ?
by Mathieu Malaterre 06 Aug '09

06 Aug '09

Hi there, I am looking at: http://www.boost.org/doc/libs/1_39_0/libs/preprocessor/doc/ref/tuple_to_lis… Just ouf of curiosity why is size required ? Can't the number of argument be deduced using the preprocessor ? Eg.: http://groups.google.com/group/comp.std.c/browse_thread/thread/77ee8c8f92e4… Thanks, -- Mathieu

2 1

[program options] the default value is to long.
by W Eryk Wolski 06 Aug '09

06 Aug '09

At runtime I am getting the following error: Assertion failed: line_length > first_column_width, file libs\program_options\src\options_description.cpp, line 460 It's due to a quite long default value (path to file) ("input-baf" , po::value<std::string>()->default_value(filename),"\t baf file to process") Is there a way to increase first_column_width? Thanks in advance. -- Witold Eryk Wolski Heidmark str 5 D-28329 Bremen tel.: 04215261837

1 0

bjam options
by mike_wilson 06 Aug '09

06 Aug '09

Hi, Was wondering if anyone know how to use the bjam options just to build the multi thread library? Thanks. -- View this message in context: http://www.nabble.com/bjam-options-tp24845152p24845152.html Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

boost.array query
by Sean Farrow 06 Aug '09

06 Aug '09

Hi: I'm using boost.array in a call (waitForMultipleObjects) to be specific. I am passing the c_array() (i.e void const *) if I do this do I need to use 0 or can I still use 1-based indices for my switch statement.Any help appreciated. Sean.

2 1

[coroutine] Stack corruption?
by Pavel Shevaev 06 Aug '09

06 Aug '09

Guys, I'm playing around with Boost.Coroutine experimental package[1] and it looks like it's corrupting the stack. I can't say for sure if it's a stack corruption, however, my application produces a seg.fault when running acceptance tests and gdb can't fully show the core dump backtrace saying "Backtrace stopped: previous frame inner to this frame (corrupt stack?)". If there are any coroutine users around, could you please give any tips on proper usage of this package, its limitations, etc? I had really high hopes for this package and really don't want to go back to the ugly non-coroutine logic. Thanks P.S. I'm using gcc-4.3.3 on linux x86(_64) [1] http://www.crystalclearsoftware.com/soc/coroutine/index.html -- Best regards, Pavel

2 4

Compiling With Boost’s UBlas Numeric Binding Library to Solve Ax=b Linear System
by Peverall Dubois 06 Aug '09

06 Aug '09

I am using Numeric Library Bindings for Boost UBlas to solve a simple linear system: __BEGIN__ #include<boost/numeric/ublas/matrix.hpp> #include<boost/numeric/ublas/io.hpp> #include<boost/numeric/bindings/traits/ublas_matrix.hpp> #include<boost/numeric/bindings/lapack/gesv.hpp> #include <boost/numeric/bindings/traits/ublas_vector2.hpp> namespace ublas = boost::numeric::ublas; namespace lapack= boost::numeric::bindings::lapack; int main() { ublas::matrix<float,ublas::column_major> A(3,3); ublas::vector<float> b(3); for(unsigned i=0;i < A.size1();i++) for(unsigned j =0;j < A.size2();j++) { std::cout << "enter element "<<i << j << std::endl; std::cin >> A(i,j); } std::cout << A << std::endl; b(0) = 21; b(1) = 1; b(2) = 17; lapack::gesv(A,b); std::cout << b << std::endl; return 0; } __END__ I tried compiling it with the following command: g++ -I/home/foolb/.boost/include/boost-1_38 -I/home/foolb/.boostnumbind/include/boost-numeric-bindings solve_Axb_byhand.cc -o solve_Axb_byhand but fail with the following error: media/disk/tmp/ccbd973l.o: In function `boost::numeric::bindings::lapack::detail::gesv(int, int, float*, int, int*, float*, int, int*)': solve_Axb_byhand2.cc:(.text._ZN5boost7numeric8bindings6lapack6detail4gesvEiiPfiPiS4_iS5_[boost::numeric::bindings::lapack::detail::gesv(int, int, float*, int, int*, float*, int, int*)]+0x59): undefined reference to `sgesv_' collect2: ld returned 1 exit status __END__ What's wrong with my approach? - G.V

1 0

Xpressive Character Literals
by Etienne Philip Pretorius 05 Aug '09

05 Aug '09

Hello List, Just a quick question; Xpressive seems not to compile when I use 0x?? instead of 'a' for regular expressions. Eg. sregex characters = +(set=0x20,0x0A,0x0D,0x20,0x33); Is there perhaps a way to accomplish this in Xpressive? Thank you, Etienne

2 2

Boost example programme compilation error (Sun C++5.8 on Solaris 5.8)
by Bernd Zwatschka 05 Aug '09

05 Aug '09

Hi, we're new to Boost and trying to compile the example programme from the getting started page (compiler version: Sun C++ 5.8 2005/10/13, OS: Solaris 5.8) with Boost release 1_39. I'm getting the following error upon compilation: "/finag/ZwatschB/boost_1_39_0/boost/lambda/detail/operator_lambda_func_base.hpp" , line 212: Error: Initializing std::ostream & requires an lvalue. "test.cc", line 12: Where: While instantiating "std::for_each<std::istream_iterator<int, char, std::char_traits<char>, int>, boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda:: bitwise_action<boost::lambda::leftshift_action>, boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lam According to the release notes, Boost has been tested on C++ 5.8 on Solaris 5.10, so I'm assuming our configuration of compiler / OS is to blame? Is there a way of getting the 1_39 release working on Solaris 5.8 or do we have to switch to an earlier version of Boost? Or could there be another reason for the compilation error? Any pointers on this would be much appreciated. Thanks, Bernd

2 1

Help in altering SSL example
by Ed Curren 05 Aug '09

05 Aug '09

Hello everyone, First, please excuse me if this question has already been asked and addressed. I searched what I was able to of the list and did not find information helpful to me. I am using the boost asio SSL examples as my starting point. At the moment the example simply takes a chunk of the overall data sent to the server and writes it back to the client, (simple echo). My goal is to have the server collect the entire message then move onto a message parsing routine that I will write. I have read through the code of many of the examples, and tried an endless combination of ideas in the code, but all have failed to read the entire message and then move onto a parsing function. Would someone please be kind enough to show me how to accomplish this? Thanks very much.

2 1

Important: Boost server downtime on August 5, 2009
by Doug Gregor 05 Aug '09

05 Aug '09

The Boost mailing lists, web server, and Subversion server will be offline tomorrow (Wednesday, August 5th) from 8:00AM EDT to 9:00AM EDT while we upgrade the mailman software. My apologies for the late notice. - Doug

2 1

[Serialization] unregistered void cast - revisited
by Soumen 05 Aug '09

05 Aug '09

Hi, I'm getting "unregistered void cast" exception while serialization. I've followed the header file order recommended for serialization. i.e. #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> #include <boost/serialization/serialization.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/is_abstract.hpp> //only in files where class is ABC #include <boost/serialization/export.hpp> //Followed by other headers like utility, map, vector, string Do I need to do something else as well? I've few derived classes for which I don't have any data. I've tried exporting those as well. But I still get the error. Regards, ~ Soumen -- View this message in context: http://www.nabble.com/-Serialization--unregistered-void-cast---revisited-tp… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[date_time] unexpected behaviour from microsec_clock::local_time on 32 bit system.
by werasm＠gmail.com 05 Aug '09

05 Aug '09

Hi all, I have the following little program (I'm using mingw 3.4.2 (32bit) ): #include <boost/date_time/posix_time/posix_time.hpp> #include <iostream> int main() { using namespace boost; using namespace boost::posix_time; //Time now (since epoch in seconds)... static const ptime secSinceEpoch( second_clock::local_time() ); //Time now (since epoch in micros)... static const ptime microsecSinceEpoch( microsec_clock::local_time() ); //Elapsed should be close to zero... time_duration elapsed = microsecSinceEpoch - secSinceEpoch; std::cout << "elapsed: " << elapsed.total_milliseconds() << std::endl; return 0; } It outputs: "elapsed: -1240428644900", whereas I expected it to output a positive value. It therefore seems that microsec_clock::local_time() wraps. Is 64-bits a pre-requisite for this library to work correctly or is there some remedy? Kind regards, Werner

1 0

time_facet format flags %F and %f and "."
by Mark Stapper 05 Aug '09

05 Aug '09

Hello, I've been using time_facet to create this foolish timestamp I have to send to another program. in doing so i discovered that %f returns the fractional seconds without a leading ".", and %F does this WITH a leading ".". bug or feature? Greetz, Mark

1 0

Spring layout algorithm for animation
by Kaspar Fischer 04 Aug '09

04 Aug '09

Dear list, I am interested in spring layout algorithms and have seen this: http://www.boost.org/doc/libs/1_36_0/libs/graph/doc/kamada_kawai_spring_lay… I would like to show an animation of the process of laying out the graph and wonder whether this is possible with the Kamada-Kawai algorithm, and with the Boost implementation in particular? Or does/will Boost provide another spring layout algorithm that is suitable for animation? I intend to use such an animation in a GUI where the user initially sees a small graph (a center node with neighbours, shown in a circular layout) and can double-click on nodes to add their neighbours -- at this point I want to visually refine the graph (i.e., change its layout) using a spring-based algorithm. Many thanks, Kaspar

1 0

Re: [Boost-users] prim_minimum_spanning_tree
by Line Blander Reinhardt 04 Aug '09

04 Aug '09

Well Prims is not supposed to have problems with negative cycles. However Dijkstra does. I believe the problem lies in prim_minimum_spanning_tree use of Dijkstra. Thanks Line ________________________________________ Fra: me22.ca(a)gmail.com [me22.ca(a)gmail.com] På vegne af Scott McMurray [me22.ca+boost(a)gmail.com] Sendt: 4. august 2009 18:14 Til: Line Blander Reinhardt Emne: Re: [Boost-users] prim_minimum_spanning_tree 2009/8/4 Line Blander Reinhardt <lbre(a)man.dtu.dk>: > Have done thanks. Was just wondering if it had been fixed in newer versions. > I think it fundamentally cannot be fixed, as the algorithm doesn't provide a way to detect the problematic conditions. ~ Scott

1 0

Python Boost Graph Library API
by Claudio Martella 04 Aug '09

04 Aug '09

Hello list, I'm currently trying to implement my program, which makes extensive use of graph operations, with the py bgl module. I haven't found any API in the documentation that relates to the py language bindings. Could you please point me to the API of the python bindings of BGL? Or to the proper mailling list to ask for? TIA /CM -- Claudio Martella claudio.martella(a)gmail.com

2 1

prim_minimum_spanning_tree
by Line Blander Reinhardt 04 Aug '09

04 Aug '09

Hi all Is it really true that prim_minimum_spanning_tree cannot handle negative cycles?? I was surprised to find that when I have negative cycles the boost function crashes in Dijkstra. Has this error been fixed?? Or is it just viewed as a feature?? Thanks Line

2 2

Re: [Boost-users] [boost users][tuple] foreach with tuple
by pete＠pcbartlett.com 04 Aug '09

04 Aug '09

>typedef vector<tuple<int,int> > vec_type; >vec_type l_listLeftLines; >foreach (vec_type::reference i_pair, l_listLeftLines) >{...} It is a bit of a pain to have to resort to the typedef. Because I iterate over std::maps quite a lot, I've semi-seriously toyed with the idea of a submitting a feature request for BOOST_FOREACH_PAIR( std::pair<T1,T2> const& my_pair , my_container_with_a_pair_value_type ) which through a bit of PP_CAT and PP_COMMA somehow does the "right" thing. Given the potential for confusion though, I assumed Eric would reject the request :-).

2 1

iterator_range !is_singular assertion
by Bradley Russell 04 Aug '09

04 Aug '09

We recently upgraded our software to 1.36. Still using Visual Studio 2003. Started getting these ! is_singular assertions. I think I have tracked it down to being NDEBUG. For example if my exe does not have NDEBUG defined and I call a dll that does then the assertion happens. I have found a little bit of information about it online http://www.nabble.com/Bug-in-iterator_range-when-NDEBUG-not-defined-but-boos t-asserts-are-enabled-td17161844.html This link has a proposed patch replacing #ifndef NDEBUG with #ifndef BOOST_DISABLE_ASSERTS in the range/iterator_range.hpp In limited testing this patch seems to fix the issue. I am wondering if this is a good fix or is it something more fundamental. Thanks, Bradley Russell Programmer NPC International (620)231-3390 x 122 ---------------------------------------------------------------------------- -------- NOTICE: This electronic mail message and any attached files are confidential. The information is exclusively for the use of the individual or entity intended as the recipient. If you are not the intended recipient, any use, copying, printing, reviewing, retention, disclosure, distribution or forwarding of the message or any attached file is not authorized and is strictly prohibited. If you have received this electronic mail message in error, please advise the sender by reply electronic mail immediately and permanently delete the original transmission, any attachments, and any copies of this message from your computer system.

1 0

setsockopt SO_RCVTIMEO for udp::socket in boost::asio
by Евгений Шубин 04 Aug '09

04 Aug '09

> Hello. > I tried a simple program with clear sockets: > #include <stdlib.h> > #include <sys/socket.h> > #include <netinet/in.h> > #include <arpa/inet.h> > #include <cstring> > #include <unistd.h> > #include <iostream> > > using namespace std; > > /* > * > */ > int main(int argc, char** argv) > { > if (argc < 2) > { > cout << "Few parameters" << endl; > return 1; > } > > unsigned int taddr = inet_addr(argv[1]); > if(INADDR_NONE == taddr) > { > cout << "wrong address" << endl; > return 1; > > } > > int sock = socket(AF_INET, SOCK_DGRAM, 0); > if( sock < 0 ) > { > cout << "socket error" << endl; > return 1; > } > > sockaddr_in sin; > memset(&sin, 0, sizeof(sin)); > sin.sin_family = AF_INET; > > unsigned short port = 3334; > sin.sin_port = htons(port); > > sin.sin_addr.s_addr = taddr; > int ret = connect( sock, reinterpret_cast<const sockaddr *>(&sin), sizeof(sin) ); > if ( ret < 0 ) > { > cout << "connect error" << endl; > return 1; > } > > timeval tv; > memset( &tv, 0, sizeof(tv) ); > tv.tv_sec = 5; > > ret = setsockopt( sock, SOL_SOCKET, SO_RCVTIMEO, &tv, sizeof(tv) ); > if( ret < 0 ) > { > cout << "sockopt error" << endl; > return 1; > } > > char hello[] = "hello"; > send(sock, hello, sizeof(hello), 0); > > char msg[256]; > cout << "Recived "<< recv(sock, msg, sizeof(msg), 0) << endl; > > close(sock); > > return (EXIT_SUCCESS); > } > > This program just send buffer via connected udp socket and then wait for response. Recv may block only for 5 seconds. All work fine. > When I try to make same with boost.asio recieve method does not return if there is no response. > I use boost 1.37/ > > #include <boost/asio.hpp> > #include <iostream> > #include <vector> > using boost::asio::ip::udp; > using namespace std; > > int > main() > { > try > { > boost::asio::io_service serv; > udp::socket s( > serv, > udp::endpoint( > udp::v4(), > 3333 > ) > ); > > udp::resolver::query query(udp::v4(), "127.0.0.1", "3334"); > udp::resolver resolver(serv); > udp::resolver::iterator iterator = resolver.resolve(query); > s.connect(*iterator); > int sock = s.native(); > cout << sock << endl; > timeval tv; > memset( &tv, 0, sizeof(tv) ); > tv.tv_sec = 5; > cout << setsockopt( sock, SOL_SOCKET, SO_RCVTIMEO, &tv, sizeof(tv) ) << endl; > > string h("hello"); > s.send(boost::asio::buffer(h)); > vector<char> v(12); > cout << s.receive(boost::asio::buffer(v)) << endl; > cout << v.size() << endl; > } > catch(boost::system::system_error &err) > { > cout << err.what() << endl; > } > } > I tested both programs with nc -lu 3334 > ooh! I use Linux. > > >

1 0

[boost users][tuple] foreach with tuple
by Oliver Kania 04 Aug '09

04 Aug '09

Hello , I have a problem getting boost foreach to work with a vector of tuples of type tuple<int,int>: #define foreach BOOST_FOREACH .... vector<tuple<int,int> > l_listLeftLines; .... foreach (boost::tuple<int,int>& i_pair, l_listLeftLines) { ..... } The visual studio compiler gives me the following : 1>d:\projects\software\lib_msvc\ptw2ddatalib20\source\ptwfieldcheckalgorithm.cpp(227) : warning C4002: too many actual parameters for macro 'BOOST_FOREACH' 1>d:\projects\software\lib_msvc\ptw2ddatalib20\source\ptwfieldcheckalgorithm.cpp(227) : error C2143: syntax error : missing ')' before '>' ..... and a long tail of more errors best regards, Oliver

3 2

Re: [Boost-users] [boost users][tuple] foreach with tuple
by pete＠pcbartlett.com 04 Aug '09

04 Aug '09

On Tue 04/08/09 09:02 , Matthieu Brucher <matthieu.brucher(a)gmail.com> wrote: >Hi, > >Try with: >foreach ((boost::tuple<int,int>& i_pair), l_listLeftLines) > >The issue is that < and > are not delimiters for the macro, so you >have actually 3 parameters if you don't add the parenthesis. >From memory the extra parentheses solution isn't good enough either. You have to go with one of the workarounds described in the "pitfalls" section of the documentation: http://www.boost.org/doc/libs/1_39_0/doc/html/foreach/pitfalls.html Pete

1 0

[boost users][tuple] foreach problem resolved
by Oliver Kania 04 Aug '09

04 Aug '09

Sry for the trouble folks. This is actually documented: one solution is to predeclare the loop variable : tpl<int,int> i_pair; //4. for both the right and the left spike, get the biggest set. foreach (i_pair, l_listLeftLines) { ... } best regards, Oliver

1 0

variant: bounded types derive from same base class
by Hicham Mouline 04 Aug '09

04 Aug '09

Hello, I have a library with an abstract base class ABC and derived classes D1... Dn. These classes cannot be changed. User code wants to write code that depends on which concrete type the object being passed. User writes: void f( const ABC& abc ) { Tag t = abc.GetTag() ; // Tag is an enum for all the derived types, delivered by the lib Switch (t) { case: case: case: } } /// SO ugly, nevertheless if some case is missing, g++ for e.g. prints warnings I am told this is the visitor pattern I then looked at boost::variant<> The lib could deliver typedef boost::variant<D1, ... , Dn> ABCDerived; and the user could write visitors to visit ABCDerived objects, here the user is enforced to implement all cases in the visitor. but then the function f expects ABC objects. Can I still do: void f( const ABC& abc ) { // how to write code to use the visitors with abc ? } Rds,

3 8

[serialization - newbie] serializing multiple objects in one archive
by Soumen 04 Aug '09

04 Aug '09

Hi, I've to serialize and deserialize multiple objects. Can I serialize them in one archive and deserialize from the same correctly? Say something like following is my save/restore function: void save(boost::archive::binary_oarchive &archive) { string version = tool.getversion(); MyData *data = MyData::instance(); MyDifferentData *differentData = MyDifferentData::instance(); if (data && differentData) { archive << version; archive << data; archive << differentData; } } void restore(boost::archive::binary_iarchive &archive) { string version = tool.getversion(); string serializedToolversion; MyData::cleanup(); MyDifferentData::cleanup(); archive >> serializedToolVersion; if (version == serializedToolVersion) { archive >> (MyData *) MyData::instance(); archive >> (MyDifferentData *) MyDifferentData::instance(); } } Or do I need to serialize each of these into different archives? Regards, ~ Soumen -- View this message in context: http://www.nabble.com/-serialization---newbie--serializing-multiple-objects… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

bimap intellisense problems in VC++ 2008
by Donald Adu-Poku 03 Aug '09

03 Aug '09

Hi all, I'm having some intellisense problems with with boost::bimaps::bimap of the current boost build (boost 1.39) . The problem is that no intellisense on bimap is generated at all, intellisense goes as far as the boost::bitmaps namespace. My programme however compiles just fine. I have the boost library included in my project (..Programme Files\boost\boost_1_39), linked needed libraries (Programme Files\boost\boost_1_39\lib) and have my include statement (#include <booost/bimap.hpp>). I have also forced the regeneration of the project's intellisense database on suspicion that it might have been corrupted, this however did not resolve the problem . Is there anything I have missed? Thank you //Donald

3 6

Boostcon Keynote (finally!) available.
by Marshall Clow 03 Aug '09

03 Aug '09

at http://boostcon.blip.tv Thank you, everyone, for your patience. More videos from Boostcon will be going up there in the near future. -- Marshall

1 0

reference_wrapper
by er 03 Aug '09

03 Aug '09

Hi All, 1) I don't understand this part of reference_wrapper: template<class T> class reference_wrapper { operator T& () const { return *t_; } }; Could someone please explain it? 2) Is there already a reference wrapper for n-ary functors which exposes the same result_type (if it exists) as the n-ary functor, but whose arguments types are arbitrary (deduced from the arguments)?

3 4

Compiler warnings when using boost::accumulators with gcc
by Rob Wheeler 03 Aug '09

03 Aug '09

If I turn on gcc's -Wextra option when compiling code that uses an accumulator with tag::max, I get a screen full of compiler warnings: [wheeler@cib: /var/tmp/acc] cat acc.cpp #include <iostream> #include <boost/accumulators/accumulators.hpp> #include <boost/accumulators/statistics/stats.hpp> #include <boost/accumulators/statistics/max.hpp> using namespace boost::accumulators; int main() { accumulator_set<double, stats<tag::max> > acc; acc(1.2); acc(2.3); acc(3.4); acc(4.5); std::cout << "Max: " << max(acc) << std::endl; return 0; } [wheeler@cib: /var/tmp/acc] g++ -W -I /opt/ros/include/boost-1_37/ acc.cpp -o acc /opt/ros/include/boost-1_37/boost/concept_check.hpp: In instantiation of ‘boost::UnaryFunction<boost::numeric::functional::as_min<const double, void>, double, const double&>’: /opt/ros/include/boost-1_37/boost/concept/detail/has_constraints.hpp:40: instantiated from ‘const bool boost::concept::not_satisfied<boost::UnaryFunction<boost::numeric::functional::as_min<const double, void>, double, const double&> >::value’ /opt/ros/include/boost-1_37/boost/concept/detail/has_constraints.hpp:43: instantiated from ‘boost::concept::not_satisfied<boost::UnaryFunction<boost::numeric::functional::as_min<const double, void>, double, const double&> >’ /opt/ros/include/boost-1_37/boost/mpl/if.hpp:67: instantiated from ‘boost::mpl::if_<boost::concept::not_satisfied<boost::UnaryFunction<boost::numeric::functional::as_min<const double, void>, double, const double&> >, boost::concept::constraint<boost::UnaryFunction<boost::numeric::functional::as_min<const double, void>, double, const double&> >, boost::concept::requirement<boost::UnaryFunction<boost::numeric::functional::as_min<const double, void>, double, const double&> > >’ /opt/ros/include/boost-1_37/boost/concept/detail/general.hpp:19: instantiated from ‘boost::concept::requirement_<void (*)(boost::UnaryFunction<boost::numeric::functional::as_min<const double, void>, double, const double&>)>’ /opt/ros/include/boost-1_37/boost/accumulators/numeric/detail/function1.hpp:67: instantiated from ‘typename boost::detail::function1<F>::result<boost::detail::function1<F> ()(const A0&)>::type boost::detail::function1<F>::operator()(const A0&) const [with A0 = double, F = boost::numeric::functional::as_min<mpl_::arg<-0x00000000000000001>, boost::numeric::functional::tag<mpl_::arg<-0x00000000000000001> > >]’ /opt/ros/include/boost-1_37/boost/accumulators/statistics/max.hpp:36: instantiated from ‘boost::accumulators::impl::max_impl<Sample>::max_impl(const Args&) [with Args = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::accumulators::tag::accumulator, boost::accumulators::accumulator_set<double, boost::accumulators::stats<boost::accumulators::tag::max, 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>, void> >, boost::parameter::aux::empty_arg_list>, Sample = double]’ /opt/ros/include/boost-1_37/boost/accumulators/framework/depends_on.hpp:282: instantiated from ‘boost::accumulators::detail::accumulator_wrapper<Accumulator, Feature>::accumulator_wrapper(const Args&) [with Args = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::accumulators::tag::accumulator, boost::accumulators::accumulator_set<double, boost::accumulators::stats<boost::accumulators::tag::max, 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>, void> >, boost::parameter::aux::empty_arg_list>, Accumulator = boost::accumulators::impl::max_impl<double>, Feature = boost::accumulators::tag::max]’ /opt/ros/include/boost-1_37/boost/accumulators/framework/depends_on.hpp:215: instantiated from ‘static boost::fusion::cons<typename boost::fusion::result_of::value_of<Iterator>::type, typename boost::accumulators::detail::build_acc_list<typename boost::fusion::result_of::next<Iterator>::type, Last, boost::fusion::result_of::equal_to<typename boost::fusion::result_of::next<Iterator>::type,Last>::value>::type> boost::accumulators::detail::build_acc_list<First, Last, false>::call(const Args&, const First&, const Last&) [with Args = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::accumulators::tag::accumulator, boost::accumulators::accumulator_set<double, boost::accumulators::stats<boost::accumulators::tag::max, 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>, void> >, boost::parameter::aux::empty_arg_list>, First = boost::fusion::mpl_iterator<boost::mpl::v_iter<boost::mpl::v_item<boost::accumulators::detail::accumulator_wrapper<boost::accumulators::impl::max_impl<double>, boost::accumulators::tag::max>, boost::mpl::vector0<mpl_::na>, 0>, 0l> >, Last = boost::fusion::mpl_iterator<boost::mpl::v_iter<boost::mpl::v_item<boost::accumulators::detail::accumulator_wrapper<boost::accumulators::impl::max_impl<double>, boost::accumulators::tag::max>, boost::mpl::vector0<mpl_::na>, 0>, 1l> >]’ /opt/ros/include/boost-1_37/boost/accumulators/framework/depends_on.hpp:234: instantiated from ‘typename boost::accumulators::detail::meta::make_acc_list<Sequence>::type boost::accumulators::detail::make_acc_list(const Sequence&, const Args&) [with Sequence = boost::mpl::v_item<boost::accumulators::detail::accumulator_wrapper<boost::accumulators::impl::max_impl<double>, boost::accumulators::tag::max>, boost::mpl::vector0<mpl_::na>, 0>, Args = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::accumulators::tag::accumulator, boost::accumulators::accumulator_set<double, boost::accumulators::stats<boost::accumulators::tag::max, 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>, void> >, boost::parameter::aux::empty_arg_list>]’ /opt/ros/include/boost-1_37/boost/accumulators/framework/accumulator_set.hpp:145: instantiated from ‘boost::accumulators::accumulator_set<Sample, Features, Weight>::accumulator_set() [with Sample = double, Features = boost::accumulators::stats<boost::accumulators::tag::max, 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>, Weight = void]’ acc.cpp:9: instantiated from here /opt/ros/include/boost-1_37/boost/concept_check.hpp:325: warning: non-static reference ‘const double& boost::UnaryFunction<boost::numeric::functional::as_min<const double, void>, double, const double&>::arg’ in class without a constructor

1 0

Re: [Boost-users] boost 1.40 beta
by Guiliani, Florent 03 Aug '09

03 Aug '09

boost-users-request(a)lists.boost.org wrote: > Date: Wed, 29 Jul 2009 14:27:39 +0100 > From: Avi Bahra <avibahra(a)googlemail.com> > Subject: [Boost-users] boost 1.40 beta > To: boost-users(a)lists.boost.org > > Does any know the schedule for release of boost 1.40 beta ? > > Best regards, > Ta, > Avi > According to: http://www.boost.org/development/ it will be the first of August. -- Florent,

3 2

[parameter] How to create make_ functions with boost::parameter returning templated classes?
by jesseperla 03 Aug '09

03 Aug '09

I want to write a make_ function for a complicated template, but can't figure out how to determine the deduced types for the return type: Say my class is: template<class F> struct templated_class { F f_; double y_; templated_class(F f, double y) : f_(i), y_(y){} }; I tried variations on the following for the template argument of templated_class: BOOST_PARAMETER_NAME(y) BOOST_PARAMETER_NAME(f) BOOST_PARAMETER_FUNCTION( (templated_class<typename boost::parameter::binding<ArgumentPack, tag::f>::type>), make_templated_class, tag, (required (f, *) ) (optional (i, *, 2.0) ) ) { return templated_class<typename boost::parameter::binding<ArgumentPack, tag::f>::type>(f, y); } This doesn't work. The parameter::binding was my attempt to extract the type, but ArgumentPack doesn't exist. Is this the right general method? What template parameter can I use for the metafunction? Thanks, Jesse

1 0

Boost's Linear Algebra Solution for y=Ax
by Peverall Dubois 03 Aug '09

03 Aug '09

Does boost have one? Where A, y and x is a matrix and vectors respectively. Either y or x can be unknown. - G.V.

2 1

[Serialization: Newbie] Compilation Problem Text Archive
by Soumen 03 Aug '09

03 Aug '09

Hi, I'm facing some compilation problem when I use text archive. But the same code works fine when I use binary archive. And it does write something on disk with specified file name (I'm yet to finish the restore part. Otherwise, I could've said it works). Do I need to do something differently? The error I get is something like following: ------------------------------------------------------------------------------------------ /boost/1_35_0/include/boost/archive/detail/oserializer.hpp: In function ‘void boost::archive::save(Archive&, T&) [with Archive = boost::archive::text_oarchive, T = TableMgr*]’: /boost/1_35_0/include/boost/archive/detail/common_oarchive.hpp:64: instantiated from ‘void boost::archive::detail::common_oarchive<Archive>::save_override(T&, int) [with T = TableMgr*, Archive = boost::archive::text_oarchive]’ /boost/1_35_0/include/boost/archive/basic_text_oarchive.hpp:75: instantiated from ‘void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = TableMgr*, Archive = boost::archive::text_oarchive]’ /boost/1_35_0/include/boost/archive/detail/interface_oarchive.hpp:64: instantiated from ‘Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = TableMgr*, Archive = boost::archive::text_oarchive]’ /remote/gsoumen/hiers/trunk/code/cmds/Cmds.cpp:1518: instantiated from here /boost/1_35_0/include/boost/archive/detail/oserializer.hpp:564: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ cc1plus: warnings being treated as errors ------------------------------------------------------------------------------------------ My code is something like following: #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> //I use binary archive hpp when I use binary archive mode #include <boost/serialization/serialization.hpp> #include <boost/serialization/utility.hpp> std::ofstream ofs(fileName.c_str(), ios_base::out); // with bin archive I also use ios_base::binary boost::archive::text_oarchive oarchive(ofs); //for bin archive, oarchive is of binary_oarchive type TableMgr *tblMgr = TableMgr::instance(); if (tblMgr) { oarchive << tblMgr; } //I've TableMgr::serialize() defined ... Regards, ~ Soumen -- View this message in context: http://www.nabble.com/-Serialization%3A-Newbie--Compilation-Problem-Text-Ar… Sent from the Boost - Users mailing list archive at Nabble.com.

2 6

any C++ portable library to create pdf documents?
by Frédéric Bron 03 Aug '09

03 Aug '09

I have looked in in the vault but could not find any library to create pdf documents. Does anybody knows a good one written in portable C++? Regards, Frédéric

3 2

[asio] AES encryption/decryption
by Igor R 03 Aug '09

03 Aug '09

Hello all, Does someone have an experience with the subj? In my application I need an AES-encrypted socket. I try to accomplish this by building a custom asio socket that performs all the needed encryption (with openssl) and delegates the i/o to its service. However, I encountered an issue that seems to be unsolvable with the current approach: from one hand, every read opeartion has to return the number of *decrypted* bytes, but from the other hand, bytes_readable command returns the size of the available *encrypted* data. Sometimes this causes severe problems: void connection::read() { asio::socket_base::bytes_readable command(true); socket_.lowest_layer().io_control(command); size_t canRead = command.get(); if (canRead) // this line creates completion condition that might never be met, because read_some() would return less than canRead asio::read(socket_, input_, asio::transfer_at_least(canRead), err); } I'd appreciate any idea - probably I'm going the wrong way, and there's some more appropriate design that would give better results? Thanks.

2 1

[Test] strange test behavior
by Emre Guney 02 Aug '09

02 Aug '09

Greetings, I have the following class to test a class named Scoring (implements a graph using Boost Graph Library). If the line marked with //!!! below is uncommented the scores yielded by _s.getNetwork().getVertexScore(*it) are garbage values (like 2.57117366e+29 ). If it is commented test fails but the values are initial (sensible) values. When I run the same function apart from the tests, the function behaves correctly and gives correct calculated scores. There should be a context problem but I could not figure it out. I would be grateful for any suggestions and ideas. class TestScoring { Scoring _s; public: TestScoring() { _s = Scoring("test_vertices_small.txt", "test_edges_small.txt"); } ~TestScoring() { } void test_calculatedScores() { float vertex_scores[] = { 0.75, 4.0/3, 1.5, 1.0/3, 0.005 }; std::size_t n_vertex = sizeof(vertex_scores)/sizeof(float); //!!! this call changes the behavior of the test //!!! _s.run(1,2); VertexIterator it, itEnd; for(boost::tie(it, itEnd) = _s.getNetwork().getVertexIterator(); it != itEnd; it++) { BOOST_CHECK_CLOSE(_s.getNetwork().getVertexScore(*it), vertex_scores[_s.getNetwork().getVertexIndex(*it)], 0.00001f); } } }; // TestScoring is called from the following suite class TestSuiteScoring: public test_suite { public: TestSuiteScoring(): test_suite("test_suite_scoring") { shared_ptr<TestScoring> instance(new TestScoring()); test_case *calculatedScores = BOOST_CLASS_TEST_CASE( &TestScoring::test_calculatedScores, instance); add(calculatedScores); } ~TestScoring() { //instance.release(); } }; Emre

2 1

Remove elements from accumulator
by Archie14 02 Aug '09

02 Aug '09

I am trying to use accumulator to calculate statistics in "rolling window", traversing the data. I searched accumulators library for a method to remove first N elements from the accumulator and did not find one. Question: is is possible to remove first N values from the accumulator?

2 1

non-POD C++ objects and Boost.Interprocess
by Selçuk Cevher 02 Aug '09

02 Aug '09

Hi, Is it possible to pass user-defined "non-POD" C++ class objects to message queues and retrieve them back on the receiver side using Boost.Interprocess ? Thanks.

2 1

Valgrind's DRD tool produces false positives when used with Boost.Thread?
by Seth Fowler 01 Aug '09

01 Aug '09

Hi all, I've been trying to debug some data races in an application that uses Boost.Thread. I tried running valgrind's DRD tool against my binary to see if it could locate the source of the problem. It produced more errors than I expected, so I progressively removed portions of my application unless I was left with almost nothing. I found that even with the most minimal program I could produce, the DRD tool still reported errors - in fact, it even reported errors with the examples included with the Boost distribution! I was able to reproduce this behavior on Mac OS X 10.5.7 with Boost 1.39, and on Ubuntu 9.04 with Boost 1.37. Here are steps to reproduce the problem: 1. Build the sample program thread.cpp included in the Boost distribution in libs/thread/example. For Boost 1.39, I used the following command: g++ -L<Boost lib directory> -lboost_thread-xgcc40-mt-1_39 thread.cpp - o thread 2. Run it using valgrind's DRD tool: valgrind --tool=drd --var-info=yes ./thread On Mac OS X 10.5.7, I get the following output: ==20729== drd, a thread error detector. ==20729== Copyright (C) 2006-2009, and GNU GPL'd, by Bart Van Assche. ==20729== Using Valgrind-3.5.0.SVN and LibVEX; rerun with -h for copyright info ==20729== Command: ./thread ==20729== --20729-- ./thread: --20729-- dSYM directory is missing; consider using --auto-run- dsymutil=yes setting alarm for 5 seconds... ==20729== Conflicting load by thread 1 at 0x00012018 size 4 ==20729== at 0x58B1: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x390C: boost::thread::join() (in ./thread) ==20729== by 0x9A13: main (in ./thread) ==20729== Allocation context: Data section of ./thread ==20729== Other segment start (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x5993: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x39BC2: pthread_mutex_unlock (drd_pthread_intercepts.c:633) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment start (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x58D2: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x39BC2: pthread_mutex_unlock (drd_pthread_intercepts.c:633) ==20729== by 0x5988: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== ==20729== Conflicting load by thread 1 at 0x00012014 size 4 ==20729== at 0x58B4: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x390C: boost::thread::join() (in ./thread) ==20729== by 0x9A13: main (in ./thread) ==20729== Allocation context: Data section of ./thread ==20729== Other segment start (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x5993: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x39BC2: pthread_mutex_unlock (drd_pthread_intercepts.c:633) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment start (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x58D2: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x39BC2: pthread_mutex_unlock (drd_pthread_intercepts.c:633) ==20729== by 0x5988: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== ==20729== Conflicting load by thread 1 at 0x00013b5c size 4 ==20729== at 0x993A: boost::detail::get_once_per_thread_epoch() (in ./thread) ==20729== by 0x58BA: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x390C: boost::thread::join() (in ./thread) ==20729== by 0x9A13: main (in ./thread) ==20729== Allocation context: Data section of ./thread ==20729== Other segment start (thread 2) ==20729== at 0x227FF0: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x58D2: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== ==20729== Conflicting load by thread 1 at 0x00013b5c size 4 ==20729== at 0x9972: boost::detail::get_once_per_thread_epoch() (in ./thread) ==20729== by 0x58BA: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x390C: boost::thread::join() (in ./thread) ==20729== by 0x9A13: main (in ./thread) ==20729== Allocation context: Data section of ./thread ==20729== Other segment start (thread 2) ==20729== at 0x227FF0: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x58D2: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== ==20729== Conflicting load by thread 1 at 0x00397680 size 4 ==20729== at 0x20038D: pthread_setspecific (in /usr/lib/ libSystem.B.dylib) ==20729== by 0x997F: boost::detail::get_once_per_thread_epoch() (in ./thread) ==20729== by 0x58BA: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x390C: boost::thread::join() (in ./thread) ==20729== by 0x9A13: main (in ./thread) ==20729== Allocation context: Data section of /usr/lib/libSystem.B.dylib ==20729== Other segment start (thread 2) ==20729== at 0x227FF0: thread_start (in /usr/lib/libSystem.B.dylib) ==20729== Other segment end (thread 2) ==20729== at 0x396B3: pthread_mutex_lock (drd_pthread_intercepts.c: 580) ==20729== by 0x58D2: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in ./thread) ==20729== by 0x30CC: thread_proxy (in ./thread) ==20729== by 0x3707B: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==20729== by 0x228154: _pthread_start (in /usr/lib/libSystem.B.dylib) ==20729== by 0x228011: thread_start (in /usr/lib/libSystem.B.dylib) alarm sounded... ==20729== ==20729== ERROR SUMMARY: 5 errors from 5 contexts (suppressed: 725 from 8) The output on linux is similar. Does this indicate a problem with valgrind's DRD tool, Boost.Thread, or both? Does any workaround exist? Thanks in advance, - Seth Fowler

1 0

Boost.test applicability
by Joel Falcou 01 Aug '09

01 Aug '09

I have a alrge number of numeric functions (~300) overloaded on various types. What I want to do is having some automated test that check if those functions returns proper values and behave correctly in term of precision. I get a look at Boost.Test but i can't really see if it's applicable to my need and, if it is, how exactly am I supposed to generate that much test and cover all cases (random value testing, singular value test, nan/inf handling etc...). My first idea was to use Boost.preprcoessor file iteration to quickly generate BOOST_TEST_CASE functions but I'm not sure this is a scalable practice. Other point, I saw that there is check in Boost.test which check for an arbitrary precision result. However it uses raw value (like 0.001) where having a check based on ULP or RMS maybe better. Is there anyway to integrate those test using existing test framework ? Thanks in advance

3 4

copy_graph - accessing property maps
by Caligula 01 Aug '09

01 Aug '09

If you use copy_graph(g, g2) how can you access the corresponding property maps in g2? Thanks -Caligula

1 0

boost::lambda::bind temporary function objects.. and raw C
by Tomasz Mloduchowski 31 Jul '09

31 Jul '09

Hello everyone! I have a rather challenging question, that perhaps can be resolved without too much dark magic. A little background: I'm patching an executable (x86 platform, but could be easily extended to other architectures). players: void TargetFunc(some parameters); void Hook(some parameters); method: Grab first 5 bytes of TargetFunc. Back them up. Replace them with a jmp Hook. Make Hook finish as follows: Restore the backup of 5 bytes. Call TargetFunc again, this time the real one, not the jmp. Replace the 5 bytes with jmp Hook, getting ready for the next invocation. In a nutshell - typical trampoline. Now, I want to write a framework for this. I would prefer to be able to have some code reuse. Can either mem_fn or bind be helpful here? I'm trying to understand how they work. I feel like they are creating extra 'functions' with some game about parameters. Ideas? cheers, Tomasz

3 2

Multi Index Insertion with hashed index - non-primitive key
by Jason Leger 31 Jul '09

31 Jul '09

Hey Everyone, I am basically trying to create a sorted hash map using boost multiindex. I am following the examples but I am unable to insert my object into the container when I use a non-primitive key. Is it possible to use a non-primitive key? Any help or pointers would be appreciated. Thanks J.O. #include <inttypes.h> #include <boost/multi_index_container.hpp> #include <boost/multi_index/hashed_index.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/identity.hpp> #include <boost/multi_index/member.hpp> using namespace ::boost; using namespace ::boost::multi_index; #include <iostream> struct Key { uint32_t k1; uint32_t k2; Key(uint32_t k1, uint32_t k2) : k1(k1), k2(k2) {} bool operator==(const Key &key) const { if (k1 != key.k1) return false; if (k2 != key.k2) return false; return true; } }; struct KeyEqual { bool operator()(const Key &key1, Key &key2) const { return key1 == key2; } }; struct KeyHash { std::size_t operator()(const Key& key)const { return boost::hash<uint32_t>()(key.k1) + boost::hash<uint32_t>()(key.k2); } }; struct Data { Key key; int value; Data(const Key& key, int value): key(key), value(value) {} bool operator<(const Data& data)const { return (value < data.value); } }; typedef multi_index_container< Data, indexed_by< // sort by Data::operator< ordered_unique<identity<Data> >, // hashed on key hashed_unique<member<Data,Key,&Data::key> > > > DataSet; typedef DataSet::nth_index<1>::type HashIndex; int main() { DataSet dataSet; HashIndex &hashIndex = dataSet.get<1>(); Key newKey(1,2); Data newData(newKey,3); dataSet.insert(newData); // *** Error - See below *** // find an Data by key Data data=*(hashIndex.find(newKey,KeyHash(),KeyEqual())); }; This is the error I get: g++ -I../include -rdynamic -DCOREDUMP -DLINUX -pthread -pipe -Wall -W -g -DDEBUG -c mIndex.cc -o mIndex.o mIndex.cc: In member function ‘size_t boost::hash<T>::operator()(const T&) const [with T = Key]’: /usr/include/boost/multi_index/hashed_index.hpp:957: instantiated from ‘void boost::multi_index::detail::hashed_index<KeyFromValue, Hash, Pred, SuperMeta, TagList, Category>::unchecked_rehash(size_t) [with KeyFromValue = boost::multi_index::member<Data, Key, &Data::key>, Hash = boost::hash<Key>, Pred = std::equal_to<Key>, SuperMeta = boost::multi_index::detail::nth_layer<2, Data, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, 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<Data> >, TagList = boost::mpl::vector0<mpl_::na>, Category = boost::multi_index::detail::hashed_unique_tag]’ /usr/include/boost/multi_index/hashed_index.hpp:942: instantiated from ‘void boost::multi_index::detail::hashed_index<KeyFromValue, Hash, Pred, SuperMeta, TagList, Category>::reserve(size_t) [with KeyFromValue = boost::multi_index::member<Data, Key, &Data::key>, Hash = boost::hash<Key>, Pred = std::equal_to<Key>, SuperMeta = boost::multi_index::detail::nth_layer<2, Data, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, 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<Data> >, TagList = boost::mpl::vector0<mpl_::na>, Category = boost::multi_index::detail::hashed_unique_tag]’ /usr/include/boost/multi_index/hashed_index.hpp:629: instantiated from ‘boost::multi_index::detail::hashed_index_node<typename SuperMeta::type::node_type>* boost::multi_index::detail::hashed_index<KeyFromValue, Hash, Pred, SuperMeta, TagList, Category>::insert_(typename boost::call_traits<typename boost::multi_index::detail::hashed_index_node<typename SuperMeta::type::node_type>::value_type>::param_type, boost::multi_index::detail::hashed_index_node<typename SuperMeta::type::node_type>*) [with KeyFromValue = boost::multi_index::member<Data, Key, &Data::key>, Hash = boost::hash<Key>, Pred = std::equal_to<Key>, SuperMeta = boost::multi_index::detail::nth_layer<2, Data, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, 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<Data> >, TagList = boost::mpl::vector0<mpl_::na>, Category = boost::multi_index::detail::hashed_unique_tag]’ /usr/include/boost/multi_index/ordered_index.hpp:556: instantiated from ‘boost::multi_index::detail::ordered_index_node<typename SuperMeta::type::node_type>* boost::multi_index::detail::ordered_index<KeyFromValue, Compare, SuperMeta, TagList, Category>::insert_(typename boost::call_traits<typename boost::multi_index::detail::ordered_index_node<typename SuperMeta::type::node_type>::value_type>::param_type, boost::multi_index::detail::ordered_index_node<typename SuperMeta::type::node_type>*) [with KeyFromValue = boost::multi_index::identity<Data>, Compare = std::less<Data>, SuperMeta = boost::multi_index::detail::nth_layer<1, Data, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, 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<Data> >, TagList = boost::mpl::vector0<mpl_::na>, Category = boost::multi_index::detail::ordered_unique_tag]’ /usr/include/boost/multi_index_container.hpp:465: instantiated from ‘std::pair<typename boost::multi_index::detail::multi_index_base_type<Value, IndexSpecifierList, Allocator>::type::node_type*, bool> boost::multi_index::multi_index_container<Value, IndexSpecifierList, Allocator>::insert_(const Value&) [with Value = Data, IndexSpecifierList = boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, 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<Data>]’ /usr/include/boost/multi_index/detail/index_base.hpp:148: instantiated from ‘std::pair<typename boost::multi_index::detail::multi_index_node_type<Value, IndexSpecifierList, Allocator>::type*, bool> boost::multi_index::detail::index_base<Value, IndexSpecifierList, Allocator>::final_insert_(typename boost::call_traits<Value>::param_type) [with Value = Data, IndexSpecifierList = boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, 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<Data>]’ /usr/include/boost/multi_index/ordered_index.hpp:252: instantiated from ‘std::pair<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::ordered_index_node<typename SuperMeta::type::node_type>, mpl_::na>, bool> boost::multi_index::detail::ordered_index<KeyFromValue, Compare, SuperMeta, TagList, Category>::insert(typename boost::call_traits<typename boost::multi_index::detail::ordered_index_node<typename SuperMeta::type::node_type>::value_type>::param_type) [with KeyFromValue = boost::multi_index::identity<Data>, Compare = std::less<Data>, SuperMeta = boost::multi_index::detail::nth_layer<1, Data, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::identity<Data>, mpl_::na, mpl_::na>, boost::multi_index::hashed_unique<boost::multi_index::member<Data, Key, &Data::key>, 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<Data> >, TagList = boost::mpl::vector0<mpl_::na>, Category = boost::multi_index::detail::ordered_unique_tag]’ mIndex.cc:94: instantiated from here mIndex.cc:79: error: ‘struct hash_value’ is not a function, /usr/include/boost/functional/hash/hash.hpp:290: error: conflict with ‘template<class K, class T, class C, class A> size_t boost::hash_value(const std::multimap<K, T, C, A>&)’ /usr/include/boost/functional/hash/hash.hpp:487: error: in call to ‘hash_value’ /usr/include/boost/functional/hash/hash.hpp:487: error: no matching function for call to ‘hash_value(const Key&)’ /usr/include/boost/functional/hash/hash.hpp:105: note: candidates are: size_t boost::hash_value(int) /usr/include/boost/functional/hash/hash.hpp:110: note: size_t boost::hash_value(unsigned int) /usr/include/boost/functional/hash/hash.hpp:115: note: size_t boost::hash_value(long int) /usr/include/boost/functional/hash/hash.hpp:120: note: size_t boost::hash_value(long unsigned int) /usr/include/boost/functional/hash/hash.hpp:229: note: size_t boost::hash_value(float) /usr/include/boost/functional/hash/hash.hpp:234: note: size_t boost::hash_value(double) /usr/include/boost/functional/hash/hash.hpp:239: note: size_t boost::hash_value(long double) make: *** [mIndex.o] Error 1

2 1

Re: [Boost-users] Boost.Date_time and leap seconds
by Steve Allen 31 Jul '09

31 Jul '09

On Jul 30, 8:04 am, Andrzej Krzemienski <akrze...(a)gmail.com> wrote: > - The rationale at the end says that leap seconds would be difficult > to implement. > - My experiments with simple ptime subtraction suggest no leap second support. > > I am really confused. The confusion cannot go away for retrospective calculations with UTC. See the javascript program and text on this web page http://www.ucolick.org/~sla/leapsecs/epochtime.html The scenario in that example helps to explain why it is that the international committees have been unable to produce a consensus on changes to UTC. The delegates are constrained by the legal history of the nations they represent. -- Steve Allen <sla(a)ucolick.org> WGS-84 (GPS) UCO/Lick Observatory Natural Sciences II, Room 165 Lat +36.99855 University of California Voice: +1 831 459 3046 Lng -122.06015 Santa Cruz, CA 95064 http://www.ucolick.org/~sla/ Hgt +250 m

1 0

[Graph] Problem with the add_edge() function
by Willard Mapurisa 31 Jul '09

31 Jul '09

Hi All I am having problem with the add_edge function. I have a graph that has more than 3 million edges from a triangulation. When I try to fill the graph with these edges the program terminates. I have filled the graph with approximately 1 500 000 successfully but it will not take in more. Sample code is below //Code typedef adjacency_list < listS, vecS, undirectedS, VertexProperty, EdgeProperty > sGraph m_graph; m_graph = sGraph(m_scan.size()); // scan size is 2 500 000 pair<graph_traits<sGraph>::edge_descriptor, bool> e; typedef graph_traits < sGraph >::vertex_descriptor Vertex u, v; //Filling the graph FORALLfacets { if(!facet->upperdelaunay) { qh_makeridges(facet); FOREACHridge_(facet->ridges) { if(!ridge->seen) { int i = 0; v_id.clear(); FOREACHvertex_(ridge->vertices) { v_id.push_back(qh_pointid (vertex->point)); i++; } //add edges to the graph u = v_id[0]; v = v_id[1]; e = add_edge(u, v , m_graph);//terminates after filling the graph with approximately 2 000 000 edges ridge->seen = 1; float d = m_scan[u].distance3D(m_scan[v]); //put(edge_length_t(), m_graph, e.first, d); } } } } I have recently started using Boost Graph Libraries and would like yo know if I am doing something wrong. Thanks WTM -- -------------------------------------------- Willard Mapurisa, ComputaMaps Private Bag X20, Constantia 7848, South Africa tel: +27.21.700 8140, fax: +27.21.701 9520, cell: +27.79.8045714 e-mail: wmapurisa(a)computamaps.com Manufacturers of digital maps and imagery http://www.computamaps.com --------------------------------------------

2 1

Serialization with pointer to const object
by Soumen 31 Jul '09

31 Jul '09

Hi, I'm using gcc 4.2.2 and boost 1.35. If I try to serialize pointer to some const objects, I'm getting compilation problem. Is there any limitation? Or I need to do certain things differently? I couldn't figured any solution over net. If there already exist any topic which points to solution, please point me to that. Otherwise, guide me to resolve the problem at hand. I'm new to boost. Say, my data member in the class myClass is const myType *ptr; In the serialize() routine, I'm doing it in following way: template< class Archive > void myClass::serialize(Archive &ar, const unsigned int version) { ar & ptr; // I've tried "ar & const_cast< myType* >(ptr)" and // "ar & (myType *) ptr" as well - it didn't work /* serialize other members */ } Regards, - Soumen -- View this message in context: http://www.nabble.com/Serialization-with-pointer-to-const-object-tp24639258… Sent from the Boost - Users mailing list archive at Nabble.com.

4 13

Boost Serialization: undefined reference to `__assert'
by Kesseli Pascal 31 Jul '09

31 Jul '09

Hello everyone Today, I just happened to download the latest version of cygwin, including gcc 3.4.4. While a simple hello world works perfectly fine, trying to compile this code using a statically linked libserialization.a results in dozens of linker errors, all stating "undefined reference to `__assert'". #include <boost/assign/list_of.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/lambda/lambda.hpp> #include <boost/serialization/vector.hpp> #include <iostream> #include <fstream> using namespace boost::lambda; using namespace boost::assign; using namespace boost::archive; using namespace boost::serialization; using namespace std; int main() { { vector<string> v = list_of("123")("Boost")("Serialization"); ofstream ofs("test.xml"); xml_oarchive oxml(ofs); oxml << make_nvp("VectorTest", v); } { vector<string> v; ifstream ifs("test.xml"); xml_iarchive ixml(ifs); ixml >> make_nvp("VectorTest", v); for_each(v.begin(), v.end(), cout << _1 << "\n"); } return 0; } Is this a problem or known issue when using cygwin? I'm using eclipse in addition, by the way. The code works perfectly fine on other platforms, so I imagine it must be a problem when using the serialization library with cygwin. Thanks in advance for any help you can offer me here and best regards Pascal Kesseli

4 3