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

[interprocess] Determine size of managed_shared_memory
by Kai Benndorf 12 Oct '19

12 Oct '19

Hi all, I want to create a managed_shared_memory in exactly the size I needed. Therefore I do something like this: size = sizeof( common_managed_shared_memory ); size += sizeof( MyClassInSharedMem ); managed_shared_memory segment(create_only, "name", size ); MyClassInSharedMem allocates itself some memory by segment->allocate(). I added this also to the size, but get a boost::interprocess::bad_alloc exception on allocating this additional memory. Are there some magic bytes I forgot to add? Many thanks in advance Kai

3 2

[statechart] Passing parameters from event to State Local Storage
by Christophe Bourez 16 Nov '16

16 Nov '16

I need to maintain a parameter into the state local storage. This parameter is initially contained in the event that causes the transition to the target state. I give hereafter a small illustrative example. typename sc = boost::statechart; class EvTest : public sc::event<EvTest> { public: EvTest(std::size_t val) : value(val) {} std::size_t getValue() const { return this->value; } private: std::size_t value; }; class MyStateMachine; class StSource; class StTarget; class StSource : public sc::simple_state<StSource, MyStateMachine> { public: typedef sc::custom_reaction<EvTest> reactions; sc::result react(const EvTest &event) { // How to pass event.getValue() to the target state ? transit<StTarget>(); } }; class StTarget : public sc::simple_state<StTarget, MyStateMachine> { public: StTarget(std::size_t val) : val(value) {} private: std::size_t value; }; Thanks, Christophe

5 6

Statechart serialization
by mbrodeur65 04 Mar '15

04 Mar '15

Hi, I'm looking for a solution to serialize boost::statechart objects. I'm aware that this feature is on the statechart library todo list but was wondering if there are any workaround to achieve this with the latest boost release (1.34) ? thanks for your help ! mbrodeur65 -- View this message in context: http://www.nabble.com/Statechart-serialization-tf4131326.html#a11749139 Sent from the Boost - Users mailing list archive at Nabble.com.

4 4

[Statechart] How to decide between post_event and process_event atrun time ?
by Philippe DAVID 22 Jul '14

22 Jul '14

Hi, I have a method in which I want to post/process an event. The thing is, this method can be called from outside the state machine (so I need to call process_event), or indirectly by a reaction of the state machine (in this case I must call post_event since process_event is not reentrant). I don't want to write 2 distinct methods to do this (one that calls post, and the other process), I would much rather prefer adding a 'if' in my method that tells me if I have to call process_event or post_event (if I'm being called indirectly by the state machine or not). Is there a way to do this with statechart ? regards, Philippe

3 3

[asio] resolver::cancel() problem
by Matthew Edwards 14 Mar '14

14 Mar '14

In my application (and a separate test program) it seems as though the cancel() function on the resolver does not work as intended. For async resolves, the cancel functionality should abort them immediately and pass an 'operation aborted' error code to the callback handler. In my tests, I will resolve an invalid domain (this causes the resolve to take a few seconds, to demonstrate the problem), sleep for 100ms, then call cancel on the resolver object. No cancelling actually occurs, and the callback is simply triggered after a few seconds with a "No host found" error code, not the expected operation aborted. Has anyone experienced this before, or know how I might be using the resolver incorrectly?

3 2

[BGL] Having a cost function as weight map
by Maxime van Noppen 06 Sep '13

06 Sep '13

Hi, I can't find how to do this pretty basic thing : having a function instead of a field to compute the cost of edges for various path finding algorithms. I couldn't find the answer in the documentation and Google was of no help. Did I miss something obvious ? Example : ------------------- #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> struct my_edge { double cost() const { return cost_ * 2; } double cost_; }; struct my_node { }; int main() { typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS, my_node, my_edge > graph_t; typedef boost::graph_traits<graph_t>::vertex_descriptor vertex_t; graph_t graph; vertex_t v /*= ... */; using boost::weight_map; // Works : boost::dijkstra_shortest_paths(graph, v, weight_map(boost::get(&my_edge::cost_, graph))); // Doesn't compile : //boost::dijkstra_shortest_paths(graph, v, // weight_map(boost::get(&my_edge::cost, graph))); } ------------------- Thanks ! -- Maxime

4 8

can't get first example in boost tutorial to work
by 7stud 11 Mar '13

11 Mar '13

I'm trying to install boost on mac osx 10.4.7. I followed the tutorial "Getting Started on Unix Variants" found here: http://www.boost.org/doc/libs/1_35_0/ more/getting_started/unix-variants.html Following the instructions in the tutorial, I installed boost in /usr/local as instructed, so my directory structure is: /usr/local/boost_1_34_1/boost But when I run the first example in the tutorial: #include <boost/lambda/lambda.hpp> #include <iostream> #include <iterator> #include <algorithm> int main() { using namespace boost::lambda; typedef std::istream_iterator<int> in; std::for_each(in(std::cin), in(), std::cout << (_1 * 3) << " " ); } I get the error(among others): error: boost/lambda/lambda.hpp: No such file or directory If I change the include path to: #include </user/local/boost_1_34_1/boost/lambda/lambda.hpp> I get the error(among others): error: boost/lambda/core.hpp: No such file or directory But core.hpp is in the lambda directory: /usr/local/boost_1_34_1/boost/lambda$ ls algorithm.hpp control_structures.hpp lambda.hpp bind.hpp core.hpp loops.hpp casts.hpp detail numeric.hpp closures.hpp exceptions.hpp switch.hpp construct.hpp if.hpp I'm using the Xcode 2.4 IDE to run my C++ programs. I also tried to execute the program from the command line with the original include path: #include <boost/lambda/lambda.hpp> but I get the same error: ~/2testing/dir1$ g++ prog1.cpp prog1.cpp:1:35: error: boost/lambda/lambda.hpp: No such file or directory prog1.cpp: In function 'int main()': prog1.cpp:8: error: 'boost' has not been declared prog1.cpp:8: error: expected namespace-name before ';' token prog1.cpp:8: error: '<type error>' is not a namespace prog1.cpp:11: error: '_1' was not declared in this scope I get the same errors again with the full include path: #include </user/local/boost_1_34_1/boost/lambda/lambda.hpp> $ g++ prog1.cpp In file included from prog1.cpp:1: /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:14:33: error: boost/lambda/core.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:21:52: error: boost/lambda/detail/operator_actions.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:22:61: error: boost/lambda/detail/operator_lambda_func_base.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:23:63: error: boost/lambda/detail/operator_return_type_traits.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:26:45: error: boost/lambda/detail/operators.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:30:46: error: boost/lambda/detail/member_ptr.hpp: No such file or directory prog1.cpp: In function 'int main()': prog1.cpp:8: error: 'boost' has not been declared prog1.cpp:8: error: expected namespace-name before ';' token prog1.cpp:8: error: '<type error>' is not a namespace prog1.cpp:11: error: '_1' was not declared in this scope What path should I be using? Or, should I set an environment variable somewhere?

6 16

Re: [Boost-users] asio HTTP Server 3 example memory leak
by admin＠thefireflyproject.us 25 Aug '12

25 Aug '12

2 1

[multi_array] operator= requires resize - why?
by Markus Werle 04 Jun '12

04 Jun '12

Hi! IMHO the behaviour of operator= for multi_array is a little bit broken. A lot of preconditions required: template <typename ConstMultiArray> multi_array_ref& operator=(const ConstMultiArray& other) { [...] // make sure the dimensions agree assert(other.num_dimensions() == this->num_dimensions()); assert(std::equal(other.shape(),other.shape()+this->num_dimensions(), this->shape())); Besides the fact that I get mad about asserts instead of exceptions (please change this to a way users may choose) why do we have such an odd behaviour here? >From page 1, line 3 of the docs I cite: "The interface design is in line with the precedent set by the C++ Standard Library containers" - this is not true for operator=, since std::<container>::operator= works fine for me all the time _without_ any resize. Could we please change the behaviour of multi_array::operator= to take care of resize where in need to? IMHO operator= should result in a true copy ignoring previous state. Markus

6 18

[build] cannot specify different version of gcc
by Brodie Thiesfield 25 Aug '11

25 Aug '11

Hi, I'm trying to build boost on CentOS 5.5 using the /usr/bin/gcc44 compiler and I'm running into difficulties with documentation not fitting reality. How do I make this work? What I've tried... Note: I've removed /usr/bin/gcc and /usr/bin/g++ to force errors when gcc44 and g++44 are not used. Using ./bootstrap.sh Building Boost.Jam with toolset ... tools/jam/src/### ### No toolset specified. Please use --toolset option. Setting CC=/usr/bin/gcc44 and CXX=/usr/bin/g++44 (note that this won't work if gcc and g++ exist because then it will default to the gcc toolkit and not the gcc-4.4 toolkit that I want). This builds a number of things (looking at the bootstrap.log) but still gives the following error. Ignoring the error and calling ./bjam then fails. Building Boost.Jam with toolset ... tools/jam/src/### ### No toolset specified. Please use --toolset option. Using ./bootstrap.sh --toolset=gcc gives an error: unrecognized option: --toolset=gcc Using ./bootstrap.sh --with-toolset=gcc gives an error: Building Boost.Jam with toolset gcc... Failed to build Boost.Jam -> bootstrap.log shows that it is trying to build with gcc, which doesn't exist, therefore error. Using ./bootstrap.sh --with-toolset=gcc-4.4 gives an error: Building Boost.Jam with toolset gcc... Failed to build Boost.Jam -> bootstrap.log shows ### Unknown toolset: gcc-4.4 Creating ~/user-config.jam as: import toolset.using ; using gcc : 4.4 : g++44 ; export BOOST_USER_CONFIG=~/user-config.jam Then calling the same ./bootstrap.sh command lines above show no difference. How in the world do I get this thing to use /usr/bin/gcc44 and /usr/bin/g++44 to compile? I think that I'm going to have to create local links ./gcc -> /usr/bin/gcc44 and add the current directory to the path just to get this to build the way that I want it to. This seems crazy. Regards, Brodie

3 3

MSVC Visualizers Update
by Filip Konvička 28 Jul '11

28 Jul '11

Hi all, I've just updated the Boost visualizers wiki page at https://svn.boost.org/trac/boost/wiki/DebuggerVisualizers I updated the visualizer for Boost.MultiIndex, which did not work since Boost 1.35. I also added new visualizers for Boost.DateTime (ptime and time_duration) and a simple boost::shared_ptr visualizer. The visualizers are available for checkout via SVN at https://svn.boost.org/svn/boost/sandbox/boost_docs/subprojects/DebuggerVisu… Cheers, Filip

6 7

[multi-array] Extracting dimension information from a multi-array
by Ryan McConnehey 15 Jul '11

15 Jul '11

4 7

Asio unhandled exception
by Łukasz Majewski 20 May '11

20 May '11

Hello, I created a server single thread async (linux) and clinet (win). Every time client is close while server is writing to the socket connected to this client exception appears: terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::system::system_error>>' what(): Transport endpoint is not connected Aborted and server is terminated. I dont know why this exception is unhandled. int main( int argc, char** argv ) { try { boost::asio::io_service io_service; quotation_server server( io_service ); while ( true ) { try { io_service.run(); } catch( ... ){} } } catch ( std::exception& e ) { LOG << e.what() << std::endl; } catch( ... ) { LOG << "Unexpected exception" << std::endl; } return 0; }

2 1

vs 2010 can't find correct boost lib version?
by Li, Tieniu 30 Mar '11

30 Mar '11

I built boost with visual studio 2010. Libraries of *-vc100-* are generated correctly. When trying to using boost.thread, VS 2010 generated error message: can't find *-vc90-*.lib. Any idea and fixing? Thanks a lot.

4 4

[BGL] Separating twin vertices
by Shaun Jackman 19 Mar '11

19 Mar '11

Hi, I have a directed graph where every vertex has a twin vertex. It is known ahead of time which pairs of vertices are twins. I want to remove as few vertices as possible from the graph such that no vertex and its twin is in the same connected component. Could someone suggest an appropriate algorithm? I've just started delving into the BGL. So far I'm suitably impressed! Cheers, Shaun

2 5

Simple serial port demonstration with boost asio asynchronous I/O
by Jeff Gray 26 Jan '11

26 Jan '11

A couple of weeks ago I posted a simple asynchronous demonstration of a telnet client using boost asio TCP network code. I have changed this code to turn it into a simple serial terminal application using the serial port support in the new version of boost asio. It required no changes at all the the read or write code. I just altered the initialization to use a serial port instead of a socket. Note that this is not intended to show how a fully functional application would work. There are plenty of areas that are not handled in this code. But it shows the idea and it's easy to build on this once you've got it working. Hope this helps someone else get started... Jeff

3 2

[units] subtract_typeof_helper<> help!
by Terry Golubiewski 04 Jan '11

04 Jan '11

I'm trying to use boost::geometry and boost::units together. For some reason boost::geometry doesn't represent the difference of two points as vectors. So, I'm making my own Vector class and defining Vector = Point - Point. The sample program below doesn't compile because I need to tell the units library about the special properties of point subtraction (I think). terry #include <boost/geometry/geometry.hpp> #include <boost/units/systems/si.hpp> #include <boost/units/quantity.hpp> #include <boost/units/io.hpp> #include <iostream> #include <iomanip> using namespace std; using namespace boost; using namespace boost::geometry; using namespace boost::units; typedef point<double, 3, cs::cartesian> Point; class Vector { Point _impl; friend Vector operator-(const Point& lhs, const Point& rhs); explicit Vector(Point p) : _impl(p) { } public: Vector() : _impl(0) { } Vector(double dx, double dy, double dz=0) : _impl(dx, dy, dz) { } friend ostream& operator<<(ostream& os, const Vector& v) { return os << dsv(v._impl); } }; // Vector inline Vector operator-(const Point& lhs, const Point& rhs) { Point tmp(lhs); subtract_point(tmp, rhs); return Vector(tmp); } inline ostream& operator<<(ostream& os, const Point& pt) { return os << dsv(pt); } int main() { Point p1(1, 2, 3); Point p2(4, 5, 6); typedef quantity<si::length, Point> Position; typedef quantity<si::length, Vector> Displacement; Position start( p1 * si::meters); Position finish(p2 * si::meters); Displacement disp(finish - start); cout << "disp=" << disp << endl; return EXIT_SUCCESS; } // main

7 16

Range - Char literal question
by Rao, Anant 10 Dec '10

10 Dec '10

Hi, I need to iterate thru strings (For various reasons, I can't use string or vector<char> containers). I found that boost::range exactly fits the bill for me. I get all the convenience of an iterator (from as_literal.hpp). I have a piece of code char* char_s = "I am fine"; char *cp; std::size_t sz = strlen(char_s); const char* str_end1 = str_begin( char_s ) + sz; for (cp = str_begin(char_s); cp != str_end(char_s); ++cp) cout << *cp; I have couple of questions: 1. In the loop, boost::range seems to be calling strlen every iteration. This is an overhead. I was wondering if there's a way I can pass in the length myself so that boost::range would use it and avoid calling strlen(). 2. If it's not possible, is there a way for me to use iterators (boost or non-boost) over char strings? Thanks so much in advance for your help, Anant The information contained in this email message and its attachments is intended only for the private and confidential use of the recipient(s) named above, unless the sender expressly agrees otherwise. Transmission of email over the Internet is not a secure communications medium. If you are requesting or have requested the transmittal of personal data, as defined in applicable privacy laws by means of email or in an attachment to email, you must select a more secure alternate means of transmittal that supports your obligations to protect such personal data. If the reader of this message is not the intended recipient and/or you have received this email in error, you must take no action based on the information in this email and you are hereby notified that any dissemination, misuse or copying or disclosure of this communication is strictly prohibited. If you have received this communication in error, please notify us immediately by email and delete the original message.

7 15

[statechart] optional<event> - warning
by Igor R 07 Dec '10

07 Dec '10

Hello, When I define optional<my_event>, I get a warning (MSVC10): warning C4291: 'void *boost::statechart::event<MostDerived>::operator new(size_t,void *)' : no matching operator delete found; memory will not be freed if initialization throws an exception In class statechart::event I see 2 overloads of operator new: void * operator new( std::size_t size ) void * operator new( std::size_t, void * p ) But only 1 operator delete: void operator delete( void * pEvent ) i.e., no placement delete. Is this intentional? Thanks.

2 4

Usage of Boost.Optional
by John Dlugosz 29 Nov '10

29 Nov '10

I have a situation where 'optional' is a good fit. However, I can't quite figure out how to use it for what I want. It appears to be geared around passing and returning instances, but I want to use it as a member. Consider: class C { D* d; // ... real code has much more stuff, naturally public: D(params) : d(0) { // ... if (I_ended_up_needing_d) d= new D (blahblah); // ... } ~D() { delete d; // harmless if zero } }; There is a single ownership of d by the instance, and it is not polymorphic but an exact type known at compile time. Making it a pointer adds overhead of using the heap, makes it harder to write EH-safe code for the constructor in more realistic situations, and requires adding explicit code to the destructor. Using a smart pointer only adds overhead, might take care of the EH and housekeeping, but still uses the heap. The 'optional' class provides for in-place storage, which it can use for an initialized instance, or it could be nil. That's exactly what I want. But, how do I tell optional<D> to construct at some point within the 'if' statement of my code? Assigning requires duplicating the object, and this type is not meant to be copied and has copy constructing and assignment disabled. Based on how the class works, I should be able to say "turn it on, now" and use an in-place factory. But the function to do that is not present in the class. class C { optional<D> d; public: D(params) : d(boost::none_t) { if (I_ended_up_needing_d) d.reset (in_place(blahblah)); } }; Am I missing something, or is the class missing something? I'm using Boost 1.43 in the project, and basing the above on the documentation for that version. The 'news' for 1.44 does not list Optional as having changed. Thanks, --John (sorry about the corporate footer) TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

6 11

[thread][repost] recursive shared mutex
by JOAQUIN M. LOPEZ MUÑOZ 29 Nov '10

29 Nov '10

[Trying my luck again with this query.] Hi, Boost.Threads provides a recursive mutex and a shared mutex, but no recursive *and* shared mutex. Would it be a good idea to add this to the library? How hard is it to construct a recursive shared mutex from boost::sahred_mutex (i.e. adding reentrancy to boost::shared_mutex)? Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

5 7

Another decompression issue?
by Bryan 27 Nov '10

27 Nov '10

I'm using Boost 1.43 and I've run across a situation where I'm getting unexpected results when reading the uncompressed stream. I originally thought that it was an issue with my data format interpretation, but it turns out that something seems to be consuming a character from the input stream. Here's a sample of reading the stream a character at a time: cur = 80, next = 80 cur = 80, next = 38 cur = 38, next = 8c cur = 8c, next = c cur = b4, next = db <--- Cur != previous next cur = db, next = 1 cur = 1, next = 1 cur = 1, next = dd This debugging output shows the discontinuity in the stream. The code is pretty simple: boost::iostreams::filtering_istream instream; std::fstream infile; uint8_t d; instream.push(boost::iostreams::bzip2_decompressor()); infile.open("file.bz2", std::ios::binary|std::ios::in); instream.push(infile); while (true){ instream >> d; fprintf(stderr, "cur = %x, next = %x\n", d, instream.peek()); } Reading a large chunk of data from the stream via read() does not have the same issue. I see that there are a few changes for compression in 1.44 [Fix several issues with compression and decompression (#2318, #4091, #3348, #2783, #1579, #3853). ] but it's unclear if this is one of them. Thanks in advance for any help. B

2 1

Linker error on windows
by Lars Mogensen 22 Nov '10

22 Nov '10

Hi, I am using BOOST to do math and have not been able to get the "findroot_demo.cpp" example of root finding to work. There seem to be a reference to rint(), which is not implemented in the C++ library for windows. How can I solve this - my understanding of BOOST is that it is cross-platform? 1>------ Build started: Project: boostfindzero, Configuration: Debug Win32 ------ 1>Compiling... 1>findroot_demo.cpp 1>Linking... 1>findroot_demo.obj : error LNK2019: unresolved external symbol _rint referenced in function "public: static double __cdecl boost::numeric::interval_lib::detail::x86_rounding::to_int(double const &)" (?to_int@x86_rounding@detail@interval_lib@numeric@boost@@SANABN@Z) 1>D:\dokumenter\lvm_AM\Visual Studio 2008\Projects\boostfindzero\Debug\boostfindzero.exe : fatal error LNK1120: 1 unresolved externals 1>Build log was saved at "file://d:\dokumenter\lvm_AM\Visual Studio 2008\Projects\boostfindzero\boostfindzero\Debug\BuildLog.htm" 1>boostfindzero - 2 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== Thanks in advance. /Lars

4 8

[netlib] throwing exceptions with http_client.cpp
by Christian Henning 19 Nov '10

19 Nov '10

Hi there, I'm trying to run http_client.cpp taken from the netlib examples. But unfortunately it's throwing a lot of exceptions. The line: cout << body(response) << endl; results into the following exceptions: First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x002cece0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. Unhandled exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x002cece0.. here is my stack: msvcr100d.dll!_CxxThrowException(void * pExceptionObject=0x000000000030ee20, const _s__ThrowInfo * pThrowInfo=0x000000013f526cd8) Line 157 C++ test_netlib_vc10.exe!boost::exception_detail::clone_impl<boost::system::system_error>::rethrow() Line 421 C++ test_netlib_vc10.exe!boost::rethrow_exception(const boost::shared_ptr<boost::exception_detail::clone_base const > & p={...}) Line 413 C++ test_netlib_vc10.exe!boost::detail::future_object_base::wait(bool rethrow=true) Line 170 + 0x11 bytes C++ test_netlib_vc10.exe!boost::detail::future_object<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >::get() Line 331 C++ test_netlib_vc10.exe!boost::shared_future<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >::get() Line 847 + 0x12 bytes C++ test_netlib_vc10.exe!boost::network::http::async_message<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::network::tags::http,boost::network::tags::simple>,boost::network::tags::async>,boost::network::tags::tcp>,boost::network::tags::default_string> >::body() Line 107 + 0x18 bytes C++ test_netlib_vc10.exe!boost::network::http::impl::body_wrapper<boost::network::http::basic_response<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::network::tags::http,boost::network::tags::simple>,boost::network::tags::async>,boost::network::tags::tcp>,boost::network::tags::default_string> > >::operator std::basic_string<char,std::char_traits<char>,std::allocator<char> >() Line 30 + 0x12 bytes C++ test_netlib_vc10.exe!boost::network::http::body<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::network::tags::http,boost::network::tags::simple>,boost::network::tags::async>,boost::network::tags::tcp>,boost::network::tags::default_string> >(const boost::network::http::basic_response<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::network::tags::http,boost::network::tags::simple>,boost::network::tags::async>,boost::network::tags::tcp>,boost::network::tags::default_string> > & message={...}) Line 41 + 0x1f bytes C++ test_netlib_vc10.exe!main(int argc=2, char * * argv=0x00000000004f7850) Line 86 + 0x15 bytes C++ test_netlib_vc10.exe!__tmainCRTStartup() Line 555 + 0x19 bytes C test_netlib_vc10.exe!mainCRTStartup() Line 371 C I'm using boost trunk with Visual Studio 10 compiling x64 bit code. Anyone any idea what going on here? Thanks, Christian

4 12

Interest in B-tree library for Boost?
by Beman Dawes 17 Nov '10

17 Nov '10

A Boost B-tree library would provide disk-based associative containers that scale all the way from really, really, small to really, really, large. B-trees perform well on hardware ranging from ancient floppy disk drives all the way up to humongous disk arrays. They are the technology behind most high-performance disk file systems and databases. If you don't know what a B-tree is, or think that "B-tree" is an abbreviation for "Binary tree", you might want to read the Wikipedia B-Tree article: http://en.wikipedia.org/wiki/B-tree. Knuth and other computer science texts also supply descriptions. See http://mysite.verizon.net/beman/btree/index.html for a more complete description of the proposed library. A preliminary implementation is available. Download http://mysite.verizon.net/beman/btree/btree-preview-1.zip, and unpack into a current Boost distribution. A few existing Jamfiles will be overwritten. The only compilers tested and working so far are VC++ 10 and GCC/MinGW 4.5. You can view the library online at http://github.com/Beman/Boost-Btree There is no detailed documentation yet, but if you know how to use std::map and other standard library associative containers, you already know most of what you need to know. Critical differences are documented in the Library Characteristics section of the index.html page referenced above. Initial timing tests have been very encouraging. The time test compares the btree_map implementation to std::map. As expected, a btree_map is many times slower than a std::map, given a cold operating system file cache and constraining the btree_map's caching to a minimum. But at the other extreme, when the O/S file cache is warm and the btree_map's cache is as large as the file, the btree_map is very similar in speed to std::map.The btree library's code is still very new, so timings and everything else may be subject to lots of revision. Any interest? --Beman

5 11

[StateChart] event processing order in async machine
by Igor R 16 Nov '10

16 Nov '10

Hello, I've got an async. state machine (1.44, MSVC10), and sometimes I observe a very strange behavior: events being processed not in the order they are queued. I spent some time trying to investigate this issue, but due to the asynchronous nature of the processing, it's quite not trivial. So, before I start sinking too deep, I'd like to ensure I don't miss something trivial. Unfortunately, I don't have at the moment any self-contained code, but a very simplified model of my FSM is as follows. Assume there are 2 events: Ev1, Ev2. The both are queued to the FMS from the same thread, always in the same order: Ev1, Ev2. The FSM processes them in another thread. The FMS has some "entry" chain of states that defer the both events: S1 /[defer(Ev1, Ev2)] --> S2 /[defer(Ev1, Ev2)] and finally 2 orthogonal sub-states, one of them ignores the both events, and the other processes the both: ...S2 --> S3<S3_1, S3_2>, S3_1 /[custom_reaction(Ev1), in_state_reaction(Ev2)] What I see is that *sometimes* the reaction for Ev2 is invoked *before* the reaction for Ev1. This "sometimes" really puzzles me: I'm absolutely sure that the order of queuing is always the same - so where can be a "race"? Any idea would be appreciated!

2 19

[Program Options] Positional args in help message
by Lindley M French 10 Nov '10

10 Nov '10

The examples for how to use positional arguments are great and seem to work fine. However, I'm wondering if there's an automatic way to include that information in the help message. In particular, since the tutorial goes to the trouble of telling you how to exclude the positional options from the options help, it would be nice to know what to replace it with. I could manually write a line detailing the usage before outputting the options description, of course, but I was wondering if there was anything in PO to handle this automatically.

3 2

boost MPI issue on windows
by Nick Collier 08 Nov '10

08 Nov '10

Hi, I've got an MPI application that uses the boost mpi libraries. It runs fine on OSX and Linux when compiled using both debug and more optimized compiler flags. Unfortunately, on windows, the application only runs when compiled using Visual Studio 2008 debug configuration. When I run the executable compiled in the release configuration it crashes, but not in the same place every time in my code. It does only occur though when I make communicator::send and communicator::recv calls, sending and receiving vectors of ints. In those cases, I get exceptions like: {routine_=0x00d37d38 "MPI_Send" result_code_=805931010 message="MPI_Send: Invalid count, error stack: MPI_Send(176): MPI_Send(buf=0x001BF950, count=-1833296, MPI_PACKED, dest=1, tag=2001, MPI_COMM_WORLD) failed MPI_Send(101): Negative count, value is -1833296" } Sometimes its for a send and sometimes for a receive, but the exception is always for a "negative count" which looks suspiciously like an uninitialized integer. I figured I'm doing something wrong either in how I've compiled the boost libraries or in my own code (although its odd that it works in both linux and osx). Any suggestions obviously appreciated. This is for boost-1.39. We are prevented from using anything newer because the machine we ultimately deploy on has boost-1.39 installed. On windows, I'm using microsoft's mpi implementation (based on MPICH2) under windows 7. The boost mpi libraries are compiled in both static debug and release mt versions. thanks very much, Nick

6 31

What's so cool about Boost.MPI?
by David Abrahams 08 Nov '10

08 Nov '10

Just wanted to call some attention to this article I wrote about Boost.MPI: http://daveabrahams.com/2010/09/03/whats-so-cool-about-boost-mpi/ I think it might be useful to link that from the Boost.MPI docs, too. -- Dave Abrahams BoostPro Computing http://www.boostpro.com

12 12

[Asio]What's the behavior of socket.async_write() after socket.close() is called?
by 鑫炜廖 05 Nov '10

05 Nov '10

Hi, If I call socket.close() but I still have some data in my buffer, can I call async_write() later? When I call socket.close(), maybe an async_write operation is running, when it's complete I want to send data in another buffer(data written while previous async_write() is running, before socket.close() was called), but the socket is closed.Does it work in this situation?If not, what's the alternative way? The code looks like this: char front_buffer[kBufferSize]; char back_buffer[kBufferSize]; void HandleWrite(...) { //socket is closed. Does this work? socket.async_write(back_buffer, ...); } socket.async_write(front_buffer, HandleWrite); // write data to back_buffer socket.close();

5 10

[mpl] Iterator Concept Checking?
by Stirling Westrup 04 Nov '10

04 Nov '10

I am writing some algorithms to operate on MPL sequences, and I would like to use some form of concept checking to ensure that the types passed in that are supposed to be iterators are, in fact, iterators. The MPL library doesn't seem to have is_XXX_iterator<T> checks, and I have run into some difficulties in determining how to write them. The MPL documents state that a random_access_iterator is a 'refinement' of a bidirectional_iterator which is a 'refinement' of a forward_iterator, but its not clear what refinement means in this context. I initially assumed that this meant that a random_access_iterator_tag was derived from a bidirectional_iterator_tag which was derived from a forward_iterator_tag. This does not appear to be the case, so the obvious test for an iterator (checking that the class contains a member named 'category' that is a type derived from the iterator tag of the least acceptable iterator) will not work. I am sure I could cobble together something that would work by examining the internals of the library, but I would far rather have some guidance on the correct way to see if an iterator matches a given iterator model, within the API of the library. Does anyone have any suggestions? -- Stirling Westrup Programmer, Entrepreneur. https://www.linkedin.com/e/fpf/77228 http://www.linkedin.com/in/swestrup http://technaut.livejournal.com

2 3

Polymorphic serialization with polymorphic archives problems... [part 2]
by Bogdan 03 Nov '10

03 Nov '10

First I would like to confirm I tested Robert Ramey's fix (@60273) for multiple registrations and it looks good in my runs. Thank you Robert! On the other hand, I am under the impression there is a bug in void_caster::recursive_unregister(), although I am not 100% certain about the reason: that function member is called in the destructors of the void caster template classes and makes use of the void_caster_registry singleton (more specifically the type_set). I believe it searches the set for all the void caster entries that are descendants of the current one (i.e., the one being destroyed) and performs the following ops: - delete the shortcuts. - remove the corresponding entries from the set. However, void_caster::recursive_unregister() DOESN'T REMOVE FROM THE REGISTRAR the entry corresponding to the current void_caster(). This creates the problem below: consider a scenario where a dll containing some serialization functionality is loaded explicitly at runtime (i.e., using LoadLibrary() on Windows or dlopen on Unix). There are no parent-child relationships among the serialized classes registered by that DLL: all serialized classes are derived from one abstract base. While unloading the library, its void_caster singletons are destroyed but there are no shortcuts to remove from the global registrar since there are no parent-child relationships. All entries corresponding to those are still in the global registrar and POINT TO THE void_caster SINGLETONS ALREADY DESTROYED AND DISCARDED. When the main process exits, the registrar traversal repeats for whatever process-bound void_caster singletons are about to be destroyed. During these subsequent traversals, void_caster::recursive_unregister() visits the entries left after the previous explicit dll download and tries to identify the parent-child relationship. In doing so, it accesses the dangling vc pointers generating access violations: void_cast.cpp(Line 286): const void_caster * vc = *it; void_cast.cpp(Line 287): if(vc->m_parent == this){ //<--------------------- here is the access violation I can reproduce the crash systematically, but I am not sure about the reason or whether a simple unregistration is enough. I believe this is (again) a question for Robert, but I thank for any feedback I might get. Bogdan

2 1

[proto] : Using proto with NVIDIA CUDA nvcc (redux)
by Manjunath Kudlur 03 Nov '10

03 Nov '10

I remember there were postings in this mailing list before about trying to using proto with NVIDIA's CUDA compiler, and Joel Falcou has contributed some code to make proto work with nvcc. Well, I was trying few experiments with the most recent CUDA compiler release (3.2). I believe one of the exciting things about using proto with CUDA is the ability to write mini programs in different DSELs using proto and ship the mini programs over to the "device" side and execute it there. This idiom will look as follows : template<typename F> __global__ void kernel(F f) { f(...); } kernel<<<blocksize, gridsize>>>(a+b /* a big proto expression */); I tried to write the simplest form of the above use case : #include <boost/proto/proto.hpp> namespace proto=boost::proto; template<typename> struct expr; struct domain : proto::domain<proto::pod_generator<expr> > {}; template<typename E> struct expr { BOOST_PROTO_BASIC_EXTENDS(E, expr<E>, domain) }; template<typename F> __global__ void kernel(F f) { } struct term {}; expr<proto::terminal<term>::type> a = {{{}}}; expr<proto::terminal<term>::type> b = {{{}}}; expr<proto::terminal<term>::type> c = {{{}}}; int main() { kernel<<<1,1>>>(proto::deep_copy(b+c)); return 0; } Note the deep_copy when passing proto expression to kernel functions. Since proto captures terminals by reference, the host side pointers that are held in proto expressions won't make sense on the device side, so at the very least, we have to make copies of terminals before passing to the device. Now, compiling the above program with nvcc (CUDA 3.2, host compiler gcc 4.4.3, Ubuntu 10.04) results in the following error (besides spewing a bunch of warnings) : $ nvcc -v -keep t.cu -I $HOME/boost/boost-trunk/ ... t.cudafe1.stub.c: In function ‘void __device_stub__Z6kernelI4exprIN5boost5proto7exprns_10basic_exprINS2_3tag4plusENS2_7argsns_5list2IS0_INS4_IS6_NS8_IS0_INS4_INS5_8terminalENS7_4termI4termEELl0EEEESE_EELl2EEEES0_INS4_IS9_NSA_IiEELl0EEEEEELl2EEEEEvT_(_Z4exprIN5boost5proto7exprns_10basic_exprINS1_3tag4plusENS1_7argsns_5list2IS_INS3_IS5_NS7_IS_INS3_INS4_8terminalENS6_4termI4termEELl0EEEESD_EELl2EEEES_INS3_IS8_NS9_IiEELl0EEEEEELl2EEEE&)’: t.cudafe1.stub.c:8: error: invalid cast from type ‘const expr<boost::proto::exprns_::basic_expr<boost::proto::tag::address_of, boost::proto::argsns_::list1<expr<boost::proto::exprns_::basic_expr<boost::proto::tag::plus, boost::proto::argsns_::list2<expr<boost::proto::exprns_::basic_expr<boost::proto::tag::plus, boost::proto::argsns_::list2<expr<boost::proto::exprns_::basic_expr<boost::proto::tag::terminal, boost::proto::argsns_::term<term>, 0l> >, expr<boost::proto::exprns_::basic_expr<boost::proto::tag::terminal, boost::proto::argsns_::term<term>, 0l> > >, 2l> >, expr<boost::proto::exprns_::basic_expr<boost::proto::tag::terminal, boost::proto::argsns_::term<int>, 0l> > >, 2l> >&>, 1l> >’ to type ‘char*’ t.cudafe1.stub.c:8: error: invalid cast from type ‘const expr<boost::proto::exprns_::basic_expr<boost::proto::tag::address_of, boost::proto::argsns_::list1<expr<boost::proto::exprns_::basic_expr<boost::proto::tag::plus, boost::proto::argsns_::list2<expr<boost::proto::exprns_::basic_expr<boost::proto::tag::plus, boost::proto::argsns_::list2<expr<boost::proto::exprns_::basic_expr<boost::proto::tag::terminal, boost::proto::argsns_::term<term>, 0l> >, expr<boost::proto::exprns_::basic_expr<boost::proto::tag::terminal, boost::proto::argsns_::term<term>, 0l> > >, 2l> >, expr<boost::proto::exprns_::basic_expr<boost::proto::tag::terminal, boost::proto::argsns_::term<int>, 0l> > >, 2l> >&>, 1l> >’ to type ‘size_t’ # --error 0x1 -- The CUDA compiler works by splitting the original C++ code into "host" code and "device" code. The device code is completely lowered to C. So it seems like the above error is when passing a proto expression to the C-lowered version of device code. The proto expression is a simple POD type, so I am perplexed by the above error. (BTW, when the host compiler is gcc 4.1.3, the above program causes a segmentation fault in gcc, but that's for another forum). This might well be CUDA compiler's problem, but I dug a little deeper. I transformed the proto expression into a simpler POD type as follows : #include <boost/proto/proto.hpp> namespace proto=boost::proto; struct filler {}; template<typename tag, typename C0, typename C1=filler> struct myexpr { C0 c0; C1 c1; }; struct myadd {}; struct myterm {}; struct xform_callable : proto::callable { template<typename> struct result; template<typename This, typename LHS> struct result<This(LHS&)> { typedef myexpr<myterm, LHS> type; }; template<typename LHS> typename result<xform_callable(LHS&)>::type operator()(LHS &l) { myexpr<myterm, LHS> e = {l}; return e; } template<typename This, typename tag, typename LHS, typename RHS> struct result<This(tag, LHS, RHS)> { typedef myexpr<tag, LHS, RHS> type; }; template<typename tag, typename LHS, typename RHS> typename result<xform_callable(tag, LHS, RHS)>::type operator()(tag, LHS l, RHS r) { myexpr<tag, LHS, RHS> e = {l, r}; return e; } }; struct xform : proto::or_< proto::when<proto::plus<proto::_, proto::_>, xform_callable(myadd(), xform(proto::_left), xform(proto::_right))> , proto::when<proto::terminal<proto::_>, xform_callable(proto::_value)> > {}; template<typename> struct expr; struct domain : proto::domain<proto::pod_generator<expr> > {}; template<typename E> struct expr { BOOST_PROTO_BASIC_EXTENDS(E, expr<E>, domain) }; template<typename F> __global__ void kernel(F f) { } struct term {}; expr<proto::terminal<term>::type> a = {{{}}}; expr<proto::terminal<term>::type> b = {{{}}}; expr<proto::terminal<term>::type> c = {{{}}}; int main() { kernel<<<1,1>>>(xform()(b+c)); return 0; } The above program compiles fine with CUDA 3.2. That leaves me with the question : what does a proto expression contain more than myexpr above, that causes nvcc to fail? Again, this might be CUDA compiler's problem and they are the ones that should fix it. However, if someone in this forum can think of a simple fix to proto (or some other boost library that is actually causing the problem), that would be great too. The uniform template expansion across device and host code in CUDA programs is a powerful feature, and I envision some cool libraries that can be written using proto with CUDA. So making proto work with CUDA is a big win. Manjunath

5 12

Re: [Boost-users] [1.44 MSM meta state machine] accessing objects fromactions
by Christophe Henry 02 Nov '10

02 Nov '10

> Currently my queue object is a member of the state machine itself, so I > can write > > struct Send_ : public msm::front::state_machine_def<Send_> > { > string m_next_line_to_send; > socket m_socket; > string get_next_send_line(); > }; > > and in my a_send action > void operator()(Event &const &evt, Fsm &fsm, S&, T&) > { > fsm.m_next_line_to_send=fsm.get_next_send_line(); > fsm.m_socket.async_write(fsm.m_next_line_to_send); > } > > This works well as long as I am not using sub-statemachines. > > Here is my problem: > I would like to use a substate machine for the actual sending. The main > state machine has the states Disconnected, Working, Error, Shutdown. The > Working state should actually be a substate machine. > > The problem is, when a_send gets called by the substate machine Working, > the fsm object is of type Working. Correct. There is no "fsm call stack" yet. This gets complicated if you have a submachine of a submachine of ... For the moment I don't have this. > How can I access the member variables of the parent of a substate > machine? Or is there a better way of accessing the objects the state > machine should work with from actions? For the moment, all we can do is adding a pointer to the main fsm's data in the submachine. It is less elegant with the 1.44 than the coming 1.45: With 1.44 (for example inside the on_entry method of Send_): Send_::Working& w = fsm.get_state<Send_::Working&>(); w.data = &fsm.data; // w.data is a pointer True, this is not really nice. With the upcoming 1.45 (or trunk for the moment), you could use the new constructors: Send myfsm (msm::back::states_ << Working(data) ); //data being externally defined and Working_ having a corresponding constructor But this won't work for your case where data is contained in Send_ (and therefore does not exist at the time of construct). You can however reuse the same syntax with the new set_states method: Replace the version with get_state by: fsm.set_states(msm::back::states_ << Working(fsm.data)); //data being defined in Send_ and Working_ having a corresponding constructor. The whole explanation is there (http://svn.boost.org/svn/boost/trunk/libs/msm/doc/HTML/ch03s05.html#backend…) > The tutorial explains state machines very nicely with the example of a > CD player. But all the actions are empty and nowhere is explained, how > you would actually access a CD player member variable or other such > object so that you could actually manipulate the player to do something. Seems that I need to improve my doc here. It's too late for the 1.45 but I'll do it for the 1.46. I agree that this is still not perfect and it's on my list but the list is still pretty long so I hope this solution will be ok for the time being. Regards, Christophe

2 3

[Review][Ratio] Boost.Ratio has been ACCEPTED
by Anthony Williams 02 Nov '10

02 Nov '10

The following message is a courtesy copy of an article that has been posted to gmane.comp.lib.boost.devel as well. Hi, I am pleased to announce that Boost.Ratio has been ACCEPTED into Boost. There were not as many reviews for Boost.Ratio as for some libraries, but they were overwhelmingly positive. Boost.Ratio is an important building block for other upcoming submissions, and provides an implementation of the C++0x rational arithmetic facilities. A few changes were requested by the reviewers, which I will list below. I know that Vicente has already started working on some of these. These changes should be addressed before the library appears in a Boost release. * Some of the macros had names with RATIO_RATIO in. These should be changed to just RATIO * The ratio_add, ratio_sub, ratio_multiply and ratio_divide templates should derive from the resulting ratio type as well as providing the nested ::type member, in order to closely emulate the template alias facility from C++0x * The typos in the documentation should be fixed, and the documentation reviewed for correctness and clarity (though several of the reviewers made positive comments on the quality of the documentation). * The library needs more tests under the Boost Software License. * All references to names from the boost namespace should be qualified with boost:: to avoid potential name clashes and ambiguity with names from the global namespace. * Sections commented out with #if 0 should be removed * The extensions beyond the facilities required by the C++0x draft should be able to be enabled or disabled through use of a configuration macro. * References to the tests, examples and documentation from within the code should be checked for correctness. I would like to thank Vicente for submitting the library and those that took the time to write a review. Anthony -- Author of C++ Concurrency in Action http://www.stdthread.co.uk/book/ just::thread C++0x thread library http://www.stdthread.co.uk Just Software Solutions Ltd http://www.justsoftwaresolutions.co.uk 15 Carrallack Mews, St Just, Cornwall, TR19 7UL, UK. Company No. 5478976

2 1

Is it possible to use boost:serialization with Managed c++?
by سیّد امین میرزایی 02 Nov '10

02 Nov '10

We have a native c++ class that is serialized perfectly using * boost::serialization*. Now we want to change some of its member fields to *property*, so we could use them in *PropertyGrids*. When we changed the class definiction to *ref class X*, we got a huge number of these compilation errors: #1: error C2893: Failed to specialize function template 'boost::archive::text_oarchive &boost::archive::detail::interface_oarchive<Archive>::operator <<(T &)' d:\someAddress\someFile.cpp 58 #2: error C2784: 'std::basic_ostream<_Elem,_Traits> &std::operator <<(std::basic_ostream<_Elem,_Traits> &,const std::_Smanip<_Arg> &)' : could not deduce template argument for 'std::basic_ostream<_Elem,_Traits> &' from 'boost::archive::text_oarchive' d:\someAddress\someFile.cpp 58 We have a lot of tiny classes here, so it would be a pain to write a wrapper for each of them! Here is the sample class we used: ref class gps_position2 { public: template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & seconds; } public: gps_position(){}; gps_position(float s) { this->seconds = s; } property float seconds; }; And here is the main test code: int main() { std::ofstream ofs("out.txt"); gps_position2 g(24.567f); // save data to archive { boost::archive::text_oarchive oa(ofs); // write class instance to archive oa << g; } // ................ return 0; } Is it even possible to use *boost::serialization* with managed classes? p.s. If we change the class usage code to this: ... gps_position2^ g = gcnew gps_position2(24.567f); ... then we get only 1 error: error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' D:\path\to\Boost\boostw\boost\archive\detail\check.hpp 60

2 1

std::string corrupt after including boost
by Simon Adler 01 Nov '10

01 Nov '10

Hello, I think the behavior of the std::string is just an example but in my application it seems to me the first stl element that is used. I have a larger project working with CLR in MC++. I included boost, because of boost::thread. Because auf the .net and CLR linking I compiled boost als shared libs and included BOOST_DYN_LINK in the preprocessor definitions. Compilation works fine. If i start the application in Debug mode i get strange behavior of my strings which results in a crash. For example an assignment like std::string test = "123"; will result in a string representation with additional malformed signs in front of the "123". I knew some behavior like this because of the Flags: #define _HAS_ITERATOR_DEBUGGING 0 #define _SECURE_SCL 0 #define _SCL_SECURE_NO_WARNINGS I usually not using them, but i have the suspicion that boost is using them and i got errors from there. Has anyone an idea what are possible solutions? Is boost introducing additional Macros that were changing the stl? Greetings Simon Adler

9 15

Boost.Regex for variable argument term?
by Joost Kraaijeveld 01 Nov '10

01 Nov '10

Hi, I am trying to make a regex that matches a term with an arbitrary number of arguments. It has the format: TERM KEY(-?PRE:COL[,-?PRE:COL]*) with at least 1 PRE:COL and at most N (comma separated) PRE:COL, each of them possible prefixe with 1 '-' char I have the following: ^([[:word:]])[[:blank:]]*KEY\$-?[[:word:]]+:[[:word:]]+(,-?([[:word:]])+:([[:word:]]+))*\$ But this does not work: e.g. the string KEY1 KEY(TEK:KDE),NOCASE,OPT,PRIMARY has the following matches (notice the empty matches): what[0] = KEY1 KEY(TEK:KDE),NOCASE,OPT,PRIMARY what[1] = KEY1 what[2] = TEK what[3] = KDE what[4] = what[5] = what[6] = and the string KEY1 KEY(RKM:KEN,RKM:REL,RKM:VAL),NOCASE,OPT,PRIMARY has the following matches (notice match 4 and the lack of the last PRE:COL pair): auxWhat[0] = KEY1 KEY(RKM:KEN,RKM:REL,RKM:VAL),NOCASE,OPT,PRIMARY auxWhat[1] = KEY1 auxWhat[2] = RKM auxWhat[3] = KEN auxWhat[4] = ,RKM:VAL auxWhat[5] = RKM auxWhat[6] = VAL Is there a regex that sort of does does what I want? TIA -- Met vriendelijke groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl

2 1

[Boost.Spirit] Skippers for sub-grammars
by Vitaly Budovski 01 Nov '10

01 Nov '10

Hello, I've decided to break up my parser into sub-grammars to improve both the readability and compile time. I'm now trying to specify a skip parser for one of the sub-grammars, but I don't know how to do it. I'm familiar with specifying a skip parser in the parse functions, but not in the grammar itself. Could somebody please provide an example? Thanks. #include <boost/spirit/include/qi.hpp> #include <string> #include <iostream> using namespace boost::spirit; using namespace boost::spirit::ascii; template<class Iterator> struct sub_grammar_skipper: qi::grammar<Iterator> { sub_grammar_skipper(): sub_grammar_skipper::base_type(start) { start = ( *((char_ - eol) - lit(':')) >> lit(':') >> *blank >> *(char_ - eol) >> eol ) ; } qi::rule<Iterator> start; }; template<class Iterator> struct sub_grammar: qi::grammar<Iterator> { sub_grammar(): sub_grammar::base_type(start) { string = ( *(char_ - eol) ) ; name %= ( lit("NAME:") >> *blank >> string >> eol ) ; start = ( name ) ; } qi::rule<Iterator, std::string()> string; qi::rule<Iterator, std::string()> name; qi::rule<Iterator> start; }; template<class Iterator> struct test_grammar: qi::grammar<Iterator/*, sub_grammar_skipper<Iterator> */> { test_grammar(): test_grammar::base_type(start) { start = ( sg >> int_ ) ; } sub_grammar<Iterator> sg; qi::rule<Iterator/*, sub_grammar_skipper<Iterator> */> start; }; int main() { std::string str("NAME: John\nBLAH: blah\n10"); typedef std::string::const_iterator iterator; iterator first = str.begin(); iterator last = str.end(); test_grammar<iterator> tg; bool r = parse(first, last, tg); if(r && first == last) { std::cout << "Success!\n"; } else { std::cerr << "Failed to parse at: " << std::string(first, last) << std::endl; return 1; } return 0; }

5 6

Re: [Boost-users] Spirit Porting
by Avi Bahra 01 Nov '10

01 Nov '10

Hartmut Kaiser wrote: >Just forget the IBM compiler. It's not up to the task to compile any of >Spirit V2 code. We talked to Michel Wong at BoostCon about this and he said >that his compiler team resources are very limited and that he does not >expect this to be fixed too soon. I was also under the impression that spirit classic would be deprecated, some time in the future, and had pencilled time to port to Spirit Qi. My main motivation for porting to QI, was the performance of spirit classic is atrocious. Currently I building on AIX and use the new IBM compiler (v11.1) but If I understand correctly you are saying dont bother trying to port from classic->Qi. ? Is it possible to provide more detailed information, about what parts of spirit Qi(I assume this is V2) the IBM compiler cant cope with ? Best regards, Ta, Avi

5 5

[netlib] compilation issues with netlib 0.7
by Christian Henning 31 Oct '10

31 Oct '10

Hi there, when compiling basic tests of netlib 0.7 one has to include boost/thread.hpp. A small change is also needed in line of parse_uri.hpp[28] from #if SPIRIT_VERSION > 0x2030 to #if SPIRIT_VERSION >= 0x2030 I'm using Visual Studio 10 Express. Also the time it takes to compile a simple test is very high. I hope this will change with the upcoming 0.8 version. Thanks for making such lib happen. It will be a great addition to boost. Regards, Christian

2 2

Windows API callback, using boost::bind
by Lloyd 31 Oct '10

31 Oct '10

hi, We have a class and it has a member function. When this function is called, it calls a Windows API. One of the argument of the windows API is a callback function. Naturally this callback function has to be a *non member* function. Is there any way by which I can pass a *member* function in the place of callback function. I heard about boost::bind, with bind is it possible? Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

6 6

RFC: Spirit Porting
by Bryce Lelbach 31 Oct '10

31 Oct '10

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 This is possibly better suited for the Spirit mailing list; however, I would like to get as broad an audience as possible here. Recently, I ported the Boost.Serialization XML grammar from Spirit Classic to Spirit Qi. It was a pretty straightforward port, but I did expect an increase in the compile-time complexity of building the grammar. My reasons for this line of thinking were as follows: * Spirit 2.x is fully attributed, while Spirit 1.x is not. This increases both the amount of data that we're dealing with (every parser/generator component must have an attribute), as well as adding additional compile-time checks and transformations which much be applied to that data. * To make Spirit fully attributed, Spirit 2.x uses frameworks that Spirit Classic did not use; Boost.Proto and Boost.Fusion (Fusion was created for Spirit 2.x, I believe), as well as a newer version of Boost.Phoenix. To my knowledge, this new XML grammar is the first Boost component to use Spirit 2.x (Wave uses Spirit Classic). I believe this means this is the first time that software using Spirit 2.x has been placed under the scrutiny of Boost testing. Certainly, Spirit 2.x and the underlying libraries it uses undergo rigorous testing, but in my mind, testing a library and testing software that uses said library are two very different processes. My question stems partially from the thoughts of Serialization's maintainer, Robery Ramey: "Basically, my view is that we cannot ship something that doesn't work at least as well as the previous version." My question for you: Can software that uses Spirit Classic be ported to Spirit 2.x and retain the same level of compiler/platform compatibility without significant refactoring of the fundamental structure of the Spirit components of the software? Please do note that I believe that there is room in the Serialization XML grammar for refactoring, and I certainly don't mean to imply that the authors of Spirit, Proto, Fusion or Phoenix are at fault here in any way. - -- Bryce Lelbach aka wash http://groups.google.com/group/ariel_devel -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) iEYEARECAAYFAkzJF3UACgkQO/fqqIuE2t7j2wCgumHhaOfOEOvmZ/090cm5o7+x f9QAoOhPvph24tlpCnuTrnUdtZ6BGD6/ =Dfkl -----END PGP SIGNATURE-----

5 7

[regex] perl compatibility
by Christian Henning 31 Oct '10

31 Oct '10

Hi there, I was under the expression that a regular expression which works with perl would also work with boost::regex. The following very simple test program doesn't work: if( boost::regex_match( "query", boost::regex( "q[u]" ))) { cout << "match" << endl; } else { cout << "no match" << endl; } whereas the perl equivalent works just fine: $text = "query"; if($text =~ m/q[u]/) { print "match!\n"; } else { print "no match\n"; } Meaning the perl code matches the regex inside $text and the boost::regex doesn't match. Can someone tell me what's wrong here with my thinking? And yes, I'm very new to regex overall. ;-) Thanks, Christian

2 2

[BGL] kolmogorov_max_flow: vertices output colors
by Olivier Tournaire 30 Oct '10

30 Oct '10

Hi all, I am currently havong a problem with the Kolmogorov max flow usage in the BGL. The probelm is that at the end of the algorithm, some vertices are gray. What is there real status: do they belong to the tree or sink. None of both? Why? Hope you could help Regards, Olivier

2 1

warnings with VS2008 and Boost 1.44
by gast128 29 Oct '10

29 Oct '10

Dear all, we try to use Boost 1.44 with our applications and we got the follow warnings: -gamma.hpp(1053) : warning C4701 -token_functions.hpp(220) : warning C4127 -find_format_store.hpp(74) : warning C4100 We have here a 'treat warning as error' polciy, so in effect we may have to add an extra header for some libraries which disables the warning locally and then includes the Boost library header (thru the #pragma push / pop mechanism).

3 6

help using String Algorithms search and replace
by John Dlugosz 29 Oct '10

29 Oct '10

I need to (among other tasks) un-encode some substitutions in a string that use URL-encoding. That is, locate all occurrences of "%nn" and replace with the character whose ordinal is 0xnn. I looked at boost/algorithm/string.hpp, but the instructions are not at all clear. The tutorial/example is too simple, and the reference it points to for more info is quite unenlightening. Could someone show me how to do that, or point to an example that's more along those lines? Thanks, --John ===begin corporate footer=== TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

2 2

compile-time string literal manipulation?
by Stiles Watson 29 Oct '10

29 Oct '10

I'm a new to metaprogramming so please bare with the stupid questions: I have a requirement to convert string literals to a specified format at compile-time. In otherwords, given a literal like "3A689", I need to verify the value and, if not valid, generate a correct value such that: //pseudocode const char ch[] = verify<"3A689">::valid_value; would result in something like: const char ch[] = "03A689X"; Can I use Boost to write a template to do this? I know that is extremely vague, but does anyone have any thoughts? Thanks.

7 7

boost MPI please recommend a debugger for MPI
by Jack Bryan 29 Oct '10

29 Oct '10

Hi, Would you please recommend a debugger, which can do debugging for parallel processes on Open MPI systems ? I hope that it can be installed without root right because I am not a root user for ourMPI cluster. Any help is appreciated. Thanks Jack Oct. 28 2010

2 1

Re: [Boost-users] Boost-users Digest, Vol 2525, Issue 4
by Romeo Macapobre 28 Oct '10

28 Oct '10

> * Spirit 2.x is fully attributed, while Spirit 1.x is not. What does "fully attributed" mean? -- apprenons francais [rmacapobre-french.blogspot.com] apprenons max [rmacapobre.blogspot.com]

1 0