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

[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

[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

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

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

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

[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

[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

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

upgrade_to_unique_lock doesn't compile with vc2010
by Braden McDaniel 16 Sep '10

16 Sep '10

Using Boost 1.43, this program: # include <boost/thread.hpp> int main() { boost::shared_mutex mutex; boost::upgrade_lock<boost::shared_mutex> lock(mutex); boost::upgrade_to_unique_lock<boost::shared_mutex> write_lock(lock); } ... produces this error when compiled with Visual C++ 2010: C:\Users\braden>cl /I include/boost-1_43 /MD /EHsc upgrade_to_unique_lock_test.cpp Microsoft (R) C/C++ Optimizing Compiler Version 16.00.30319.01 for x64 Copyright (C) Microsoft Corporation. All rights reserved. upgrade_to_unique_lock_test.cpp include/boost-1_43\boost/thread/locks.hpp(823) : error C2679: binary '=' : no operator found which takes a right-hand operand of type 'boost::unique_lock<Mutex>' (or there is no acceptable conversion) with [ Mutex=boost::shared_mutex ] include/boost-1_43\boost/thread/locks.hpp(659): could be 'boost::upgrade_lock<Mutex> &boost::upgrade_lock<Mutex>::operator =(boost::upgrade_lock<Mutex>&)' with [ Mutex=boost::shared_mutex ] include/boost-1_43\boost/thread/locks.hpp(710): or 'boost::upgrade_lock<Mutex> &boost::upgrade_lock<Mutex>::operator =(boost::detail::thread_move_t<T>)' with [ Mutex=boost::shared_mutex, T=boost::upgrade_lock<boost::shared_mutex> ] include/boost-1_43\boost/thread/locks.hpp(717): or 'boost::upgrade_lock<Mutex> &boost::upgrade_lock<Mutex>::operator =(boost::detail::thread_move_t<T>)' with [ Mutex=boost::shared_mutex, T=boost::unique_lock<boost::shared_mutex> ] while trying to match the argument list '(boost::upgrade_lock<Mutex>, boost::unique_lock<Mutex>)' with [ Mutex=boost::shared_mutex ] include/boost-1_43\boost/thread/locks.hpp(820) : while compiling class template member function 'boost::upgrade_to_unique_lock<Mutex>::~upgrade_to_unique_lock(void)' with [ Mutex=boost::shared_mutex ] upgrade_to_unique_lock_test.cpp(7) : see reference to class template instantiation 'boost::upgrade_to_unique_lock<Mutex>' being compiled with [ Mutex=boost::shared_mutex ] I've searched a bit for previous reports of this sort of thing and I haven't found any. Hopefully that means I'm just doing something wrong. -- Braden McDaniel <braden(a)endoframe.com>

7 15

Help with shared_ptr and template
by Mario Chacon 10 Sep '10

10 Sep '10

Hello: I have this problem and I do not how to fix it, I know I cannot write template typedefs, its a limitiation of the C++ syntax, right? or I'm wrong? I saw that the best way is to wrap your typedefs in a struct, which can be templated, but I'm still stack with problems. The best way to explain it's with an example: #include <cstdlib> #include <iostream> #include <boost/shared_ptr.hpp> template< typename tvalue > class CValue { public: CValue( tvalue value ) : value_(value) {}; private: tvalue value_; }; template< typename tvalue > struct Type{ typedef boost::shared_ptr< CValue< tvalue > > pValue; }; int main(int argc, char *argv[]) { Type<bool>::pValue a; return EXIT_SUCCESS; } How can I create a shared_ptr for the template class "CVALUE"?? Please I do not know what else I can prove... :( Thank you.. Mario.. Salu2...

6 8

[1.43.0] Release notice
by Beman Dawes 19 Aug '10

19 Aug '10

Release 1.43.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains two new libraries (functional/factory, functional/forward), a major range library upgrade, plus numerous enhancements and bug fixes for other libraries. For details, including download links, see http://www.boost.org/users/news/version_1_43_0 The release can also be downloaded directly from SourceForge. See http://sourceforge.net/projects/boost/files/ To install this release on your system, see http://www.boost.org/doc/libs/1_43_0/more/getting_started/index.html Thanks to all who contributed, --The Boost release team

4 5

[array] range check (at compile time)
by alfC 23 Jun '10

23 Jun '10

Hi, Lately I find myself using boost::array intesively, specially in small demo programs. Sometimes, when "manually" accessing the elements I type a index out of range. The library can detect these errors once the program is running but I found this a waste, also I was surprised not to see this kind of static check not implemented in the library. So I wanted to see if I could enforce range checking at compile time, and I come out with this solution. namespace boost{ //sorry about the namespace name template<size_t IDX, typename T, size_t N> const T& get(boost::array<T, N> const& arr){ BOOST_STATIC_ASSERT(IDX<N); return arr[IDX]; } template<size_t IDX, typename T, size_t N> T& get(boost::array<T, N>& arr){ BOOST_STATIC_ASSERT(IDX<N); return arr[IDX]; } } #include<iostream> void main(){ boost::array<double, 3> a = {1,2,3}; std::clog<<boost::get<2>(a)<<std::endl; // ok, (namespace specification needed, why?) std::clog<<boost::get<5>(a)<<std::endl; //does not compile return 0; } (I though about using enable_if instead of BOOST_STATIC_ASSERT but that would be too much overengineering.) Is this implemented already in some other way? Alfredo

6 8

BOOST_FOREACH infinite loop issue
by yabcok 11 Jun '10

11 Jun '10

Hi, I have a problem with BOOST_FOREACH never ending under specific conditions described here: http://stackoverflow.com/questions/2881491/need-help-with-boost-foreach-com… Could anyone help me understand what's going on? Best regards, Jacek Ławrynowicz

3 6

[GIL] Some questions about 2D iteration
by Brett Gmoser 08 Jun '10

08 Jun '10

Hello everybody, I've been toying with GIL a bit for the last few days in my spare time, and I've got a few questions that I can't seem to find answers to in the documentation. The following function which I've written works, but I'd like to get a better understanding of how to use iterators to accomplish the same task (the documentation says that view(x, y) = z is inefficient), as well as a few other things. The job of this function is to crop an image, discarding any white background. In other words, find the top-most, left-most, right-most, and bottom-most pixel that isn't the background color (white), and crop the image around those coordinates. template <typename ViewType, typename ImageType> void crop_image(ViewType& src, boost::scoped_ptr<ImageType>& dst) const { int top = 0; int right = 0; int bottom = 0; int left = 0; // Find the top, right, bottom, and left extents. First, find the top. for(int y=0; y < src.height(); ++y) { for(typename ViewType::x_iterator xpos = src.row_begin(y); xpos != src.row_end(y); ++xpos) { if(rgb8_pixel_t(255,255,255) != *xpos) { top = y; break; } } if(top) break; } // ... Do similar things for finding the right, bottom, and left extents. // We should now have the rectangle of the image, and it should be easy to copy everything over. dst.reset(new ImageType(1 + (right - left), 1 + (bottom - top))); for(int x = left; x <= right; ++x) for(int y = top; y <= bottom; ++y) view(*dst)((x - left), (y - top)) = src(x, y); } So, my first question is - is there a better way to do that first chore of finding each extent? Such as a way to use std::find or std::find_if, keeping in mind that I have to do two of the four sides in reverse (bottom-to-top to find bottom-most, right-to-left to find right-most)? The next question is about the final loop which copies from the source view to the newly created destination image. It seems that using iterators, I could do something like this, assuming that I had the above loops find iterator positions for all four extents (left, top, bottom, and right are iterators): // Start the copying process by creating a column iterator for the destination table beginning at column 0. // The top iterator starts at the top-most extent - and we cycle through the source image in a top-to-bottom, // left-to-right fashion. for(typename ImageType::view_t::y_iterator dst_y = view(*dst).col_begin(0); top <= bottom; ++dst_y,++top) { // The left iterator needs to be initialized with whatever row we're on - this appears to be impossible. There doesn't // seem to be any suitable way to do this, so consider it pseudocode. typename ViewType::x_iterator src_x = left.y(); // The destination X iterator also needs to know what Y position to begin on. You'd think you would be able to initialize // it with an iterator position, but it doesn't seem that you can. Again, this doesn't actually compile (it's the // view(*dst).row_begin(y) part). for(typename ImageType::view_t::x_iterator dst_x = view(*dst).row_begin(y); // Here, I need to be able to tell if src_x has hit the right extent. src_x <= right doesn't seem it will work, because // again right doesn't know it's Y position. src_x != right; // And increment both src and destination iterators. ++src_x,++dst_x ) { // Finally do the should-be-simple task of assigning the source pixel to the destination pixel. *dst_x = *src_x; } } If you read the comments, most of this doesn't seem to be possible. I've seen that there is a "transform_pixel_positions" algorithm that may do something close to what I want, but unfortunately I cannot find any documentation on it (other than mentioning that it exists, and a short example that really doesn't help - one of the few examples actually provided by the documentation). It seems to pass a unary argument to a functor, but that doesn't seem useful if I don't have both the X and Y coordinates, or an X iterator and Y iterator. Also, nowhere can I find where it says what the argument passed to the functor actually /is/. So after I figure these few things out, I'm hoping to be able to speed up my program a little bit. Right now everything is pretty slow using that view(x, y) method. I'd appreciate any help that anybody can give, thanks! Brett

4 9

[phoenix][lambda] lambda to phoenix translation: get sig (signature) from actor
by alfC 05 Jun '10

05 Jun '10

hi, what is the translation of boost.lambda typename LambdaExp::template sig<tuple<InputType> >::type in Boost.Phoenix? my best try was: actor<LambdaExp>::result< vector<InputType> >::type but it doesn't compile. Thank you, Alfredo

4 18

[Test] Tests execution order and depends_on method.
by Maria Kozinska 05 Jun '10

05 Jun '10

Hello, I have couple of question to Boost.Test framework. I'd like to ask why test_unit::depends_on(test_unit*) method is not described in User's guide. Is it only for internal use by framework or I can use it freely? I assume, that it can be used to determine precedence of one test before another. What happens if there is a cycle in dependence graph? If a test case fails, are dependant on it tests executed? In what order are executed automatically registered test suites and test cases? And in what order when they are manually registered (without any depends_on)? How this order is affected by depends_on method? Thanks for answer. Greetings, Maria

2 1

[lamda] smart self binding of a function object
by alfC 02 Jun '10

02 Jun '10

Hi, I usually have function-classes that take two arguments. class f{ double operator()(double x, double y) const { x*y+y; } }; called as: f myf; cout << myf(4.,3.); for some purposes I need a function of only one variable (parametrized in the first or second argument. So I end up doing: using boost::function; using namespace boost::lambda; function<double(double)> myf_at5 = bind(&f::operator(), myf, 5., _1); // myf_at5 is myf(5.,*) So, now I can pass myf_at5 to something that accepts a function of one variable. root_finder( myf_at5, ...); since I have access to f I would like to make f smart enough to handle its own binding. Eg. class f{ ... // same as before function<double(double)> operator()(double x_value, YYYY y_arg){ return bind( &f::operator(), //maybe needs cast to double(*) (double,double) *this, x_value, y_arg ); } function<double(double)> operator()(XXXX x_arg, double y_value){ return bind( &f::operator(), //maybe needs cast *this, x_arg, y_value ); } }; The question is: What should be the type of XXXX and YYYY? in such a way that I can just call root_finder( myf(5., _1) , ... ); or more complicated things like root_finder( myf(5., _1 * 2.), ...); in other words, myf(5.,_1) is the same as the old bind(&f::operator(), myf, 5., _1); Thank you, Alfredo answers using other libraries are also accepted :)

5 11

Boost 1.43 - Exception before main() is called
by Rob Yull 01 Jun '10

01 Jun '10

I recently upgrade from boost 1.42 to 1.43. All of a sudden, the project I was working on seems to be throwing an exception before main() is called. I was able to reproduce this error in the example below. Using 1.42, it executes just fine. Using 1.43, an exception is thrown before main is reached. In some of my classes, I have a static mutex variable that I lock before I manipulate other static variables in the class (as seen below). main.cpp - Start #include "Test.hpp" int main() { Test test; return 0; } main.cpp - End Test.hpp - Start #ifndef DEFINE_TEST_HPP #define DEFINE_TEST_HPP #include <boost/thread.hpp> class Test { public: Test(); ~Test(); private: typedef boost::mutex StaticMutex; static StaticMutex s_Mutex; typedef boost::lock_guard<StaticMutex> StaticMutexLock; }; #endif // DEFINE_TEST_HPP Test.hpp - End Test.cpp - Start #include "Test.hpp" Test::StaticMutex Test::s_Mutex; Test::Test() { const StaticMutexLock Lock(s_Mutex); } Test::~Test() { } Test.cpp - End The code above, when using boost 1.43, produces the following error in both VC2010 Express and VC2005 Pro. First-chance exception at 0x7569b727 (KernelBase.dll) in BoostTest.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::exception_detail::bad_alloc_> at memory location 0x0030f6e4.. The call stack (>>> is where the exception is caught). KernelBase.dll!_RaiseException@16() + 0x58 bytes msvcr100d.dll!_CxxThrowException(void * pExceptionObject, const _s__ThrowInfo * pThrowInfo) Line 157 C++ >>>BoostTest.exe!boost::copy_exception<boost::exception_detail::bad_alloc_>( const boost::exception_detail::bad_alloc_ & e) Line 47 C++ BoostTest.exe!boost::exception_detail::get_bad_alloc<42>() Line 80 + 0x9f bytes C++ BoostTest.exe!`dynamic initializer for 'boost::exception_detail::exception_ptr_bad_alloc<42>::e''() Line 94 + 0x28 bytes C++ msvcr100d.dll!_initterm(void (void)* * pfbegin, void (void)* * pfend) Line 873 C BoostTest.exe!__tmainCRTStartup() Line 473 + 0xf bytes C BoostTest.exe!mainCRTStartup() Line 371 C kernel32.dll!@BaseThreadInitThunk@12() + 0x12 bytes ntdll.dll!___RtlUserThreadStart@8() + 0x27 bytes ntdll.dll!__RtlUserThreadStart@8() + 0x1b bytes Did something change between 1.42 and 1.43 that would cause this? -Rob Yull

4 8

[Random] random_device and windows - multiply defined symbols
by Tore Halvorsen 01 Jun '10

01 Jun '10

The release notes for Boost 1.43 says "Put the implementation of random_device in a compiled lib, and added Windows support." Trying to use this library does not seem to work for me, under visual studio 2005, with static libraries. #include <cstdlib> #include <boost/nondet_random.hpp> int main(int argc, char* argv[]) { boost::random_device d; return EXIT_SUCCESS; } 1>libboost_random-vc80-mt-sgd-1_43.lib(random_device.obj) : error LNK2005: "public: static bool const boost::random_device::has_fixed_range" (?has_fixed_range@random_device@boost@@2_NB) already defined in main.obj 1>libboost_random-vc80-mt-sgd-1_43.lib(random_device.obj) : error LNK2005: "public: static unsigned int const boost::random_device::min_value" (?min_value@random_device@boost@@2IB) already defined in main.obj 1>libboost_random-vc80-mt-sgd-1_43.lib(random_device.obj) : error LNK2005: "public: static unsigned int const boost::random_device::max_value" (?max_value@random_device@boost@@2IB) already defined in main.obj 1>Debug\Win32\random_device.exe : fatal error LNK1169: one or more multiply defined symbols found -- Eld på åren og sol på eng gjer mannen fegen og fjåg. [Jøtul] <demo> 2010 Tore Halvorsen || +052 0553034554

2 2

[preprocessor] add pointer to T..
by Manfred Doudar 01 Jun '10

01 Jun '10

Hello, Thinking maybe little to late in the night at my end, but can see how to generate the following: T0* T0*, T1* T0*, T1*, T2* ..and so on Some variant on the below maybe..? Of course, below, you'd get T*0, T*1, etc if tried BOOST_PP_ENUM_PARAMS(n, T*) which doesn't produce a valid token. #include <boost/preprocessor/iteration/local/hpp> #include <boost/preprocessor/repetition.hpp> #define OPERATOR(z, n, _) \ \ BOOST_PP_ENUM_PARAMS(n, T) /**/ #define BOOST_PP_LOCAL_MACRO(n) OPERATOR(_, n, _) #define BOOST_PP_LOCAL_LIMITS(1, 3) #include BOOST_PP_LOCAL_ITERATE() #undef BOOST_PP_LOCAL_MACRO #undef BOOST_PP_LOCAL_LIMITS #undef OPERATOR All help appreciated. Cheers, -- Manfred

3 8

BGL property maps
by Arne Schwabe 01 Jun '10

01 Jun '10

Hi, I trying to wrap my head about the usage of iterator_property_map<RandomAccessIterator, OffsetMap, T, R> What I am trying to do is the following: create a map like color with key a graph_node and value type of a struct like struct foo { int numbervists; int color; } so I can use that in a breadth first like algorithm. The example shows me how to do it for an int but do not know how to change typedef boost::graph_traits<Graph>::edge_descriptor Edge; typedef boost::property_map<Graph, boost::id_tag>::type EdgeID_PMap; EdgeID_PMap edge_id = get(boost::edge_index(), G); boost::iterator_property_map<int*, EdgeID_PMap, int, int&> capacity_pa(capacity, edge_id), flow_pa(flow, edge_id); to use foo instead of int. In my understanding, I would have to change int* to a RandomAccessIterator to to Iterator that has foo as value type. But I am kind of lost how to construct such a thing. Arne

2 1

[preprocessor] variable repetition
by Manfred Doudar 01 Jun '10

01 Jun '10

Hello, Not having a good time with the PP lately, and am struggling over the following - would like to generate: void foo(T1) { bar<T1>(a[0]); } void foo(T1, T2) { bar<T1, T2>(a[0]); bar<T1, T2>(a[1]); } void foo(T1, T2, T3) { bar<T1, T2, T3>(a[0]); bar<T1, T2, T3>(a[1]); bar<T1, T2, T3>(a[2]); } ...and so on. All help most welcome. Cheers, -- Manfred

2 3

GIL YUV color layout
by mailinglist＠squarepx.com 31 May '10

31 May '10

I've been searching for hours to find how to convert from and to yuv color format with gil. Without much luck that is. Can someone give an example how to do this. Another question would be whether gil is the right tool to reconvert image frames for video streaming / playback purposes. Regards Viktor

2 1

[ASIO] Resolve hostname to IPv4 or IPv6
by Alexander Lamaison 31 May '10

31 May '10

I'm trying to add IPv6 support to my program without breaking IPv4. What is the canonical way, if any, to do this win ASIO on Windows. My previous code to take the hostname of a server and resolve it to and IP looked like this: tcp::resolver resolver(m_io); tcp::endpoint endpoint; typedef tcp::resolver::query Lookup; Lookup query( endpoint.protocol(), host, lexical_cast<string>(port), Lookup::all_matching | Lookup::numeric_service); tcp::resolver::iterator endpoint_iterator = resolver.resolve(query); tcp::resolver::iterator end; error_code error = host_not_found; while (error && endpoint_iterator != end) { m_socket.close(); m_socket.connect(*endpoint_iterator++, error); } if (error) BOOST_THROW_EXCEPTION(system_error(error)); I originally though that all_matching would mean this code would resolve an IPv6 address if necessary but it doesn't. So I made the following changes: tcp::resolver resolver(m_io); typedef tcp::resolver::query Lookup; Lookup query( tcp::v6(), host_name, lexical_cast<string>(port), Lookup::all_matching | Lookup::v4_mapped | Lookup::numeric_service); This works on my test IPv6 setup but is it good enough? There are all sorts of things I don't understand like mapping and tunnelling so I'm looking for a best practice for IP-agnostic name resolution. Many thanks. Alex Lamaison -- SFTP for Windows Explorer (http://www.swish-sftp.org)

1 1

[Interprocess] Problem with reserve for vector of weak_ptr
by Gaetan Gaumer 31 May '10

31 May '10

Hello, I'm currently trying to store shared_ptr to data in a vector in fixed_managed_shared_memory. The problem is that my program is crashing during a weak_ptr assignment. Since the problem is difficult to explain, I designed a little example which crash every time for me : #include <iostream> #include <algorithm> #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/smart_ptr/shared_ptr.hpp> #include <boost/interprocess/smart_ptr/weak_ptr.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/allocators/allocator.hpp> using namespace boost::interprocess; struct Foo { Foo( int _x ) : x(_x) {} ~Foo() { std::cout << "Destructing a Foo with x=" << x << "\n"; } int x; /* ... */ }; typedef managed_shared_ptr<Foo, fixed_managed_shared_memory>::type FooSharedPtrType; typedef managed_weak_ptr <Foo, fixed_managed_shared_memory>::type FooWeakPtrType; typedef allocator<FooWeakPtrType, fixed_managed_shared_memory::segment_manager> FooWeakPtrAllocatorType; typedef vector<FooWeakPtrType , FooWeakPtrAllocatorType> FooWeakPtrVectorType; struct FooPtrOps { void operator()( const FooWeakPtrType & a ) { std::cout << a.lock()->x << "\n"; } }; int main() { //Remove existing segment shared_memory_object::remove("MySharedMemory"); //Create a new segment with given name and size fixed_managed_shared_memory segment(create_only, "MySharedMemory", 65536); //Initialize shared memory STL-compatible allocator const FooWeakPtrAllocatorType alloc_inst (segment.get_segment_manager()); //Construct a vector named "MyVector" in shared memory with argument alloc_inst FooWeakPtrVectorType *foo_vector = segment.construct<FooWeakPtrVectorType>("MyVector")(alloc_inst); FooSharedPtrType foo_ptr = make_managed_shared_ptr(segment.construct<Foo>(anonymous_instance)(2), segment); foo_vector->reserve(1); (*foo_vector)[0] = foo_ptr; foo_vector->reserve(2); (*foo_vector)[1] = foo_ptr; foo_vector->reserve(3); (*foo_vector)[2] = foo_ptr; std::cout << "foo_vector:\n"; std::for_each( foo_vector->begin(), foo_vector->end(), FooPtrOps() ); } The crash occurs during the last assignment. Investigating using gdb it seems that just before the assignment the value of (*foo_vector)[2] is : {m_pn = {m_px = 0x0, m_pi = 0x4000000000000fe2}} Obviously the m_pi address is wrong which cause the crash. I think it should be 0x0 like m_px. So, did I do something wrong or did I find a bug ? Thanks for your help. Gaëtan.

4 5

[statistics] chi-square test with boost
by Christine SINOQUET 31 May '10

31 May '10

Hello, I have to implement chi square tests. As I already use the boost library boost_1_38 for other purposes, I would like to use it for this purpose too. However I can find no documentation relative to this or the information I find is not correct. Can somebody indicate me how I can to use accumulators/statistics ? Is the boost_1_38 appropriate ? Which file should I include and which function should I use ? I just need to specify the columns in a matrix I wish to test for independence, the data itself and a threshold alpha. I would like the test statistic in return, as well as the p-value. If my question is not the object of this diffusion list, please tell me. Thank you in advance. Regards.

6 6

Re: [Boost-users] spirit and property_tree headers conflict
by Artem Kozlov 30 May '10

30 May '10

> > On Thu, 27 May 2010 11:11:31 -0700 (PDT), Artem Kozlov<akz328(a)yahoo.com> > wrote: >> Hello, >> >> When attempting to compile a program which includes the following > headers >> (at once): >> >> #include<boost/property_tree/json_parser.hpp> >> #include<boost/spirit/include/qi.hpp> > > I suspect this is because the JSON parser is implemented in > Spirit.Classic. I eventually want to switch to Qi, but until then, I have > no idea what to do. I thought Classic and Qi can coexist, but maybe I'm > doing something wrong. > It should co-exist. What are the problems, exactly? Well, here is the bunch of errors that I see during compilation: /usr/include/boost/spirit/home/classic/attribute/closure_fwd.hpp:33: error: expected type-specifier /usr/include/boost/spirit/home/classic/attribute/closure_fwd.hpp:33: error: expected '>' /usr/include/boost/spirit/home/classic/attribute/closure.hpp:68: error: 'tuple_element' in namespace 'boost::phoenix' does not name a type /usr/include/boost/spirit/home/classic/attribute/closure.hpp:68: error: expected unqualified-id before '<' token /usr/include/boost/spirit/home/classic/attribute/closure.hpp:88: error: invalid use of '::' /usr/include/boost/spirit/home/classic/attribute/closure.hpp:88: error: expected ';' before '<' token /usr/include/boost/spirit/home/classic/attribute/closure.hpp: In constructor 'boost::spirit::classic::closure_context<ClosureT>::closure_context(const ClosureT&)': /usr/include/boost/spirit/home/classic/attribute/closure.hpp:75: error: class 'boost::spirit::classic::closure_context<ClosureT>' does not have any field named 'frame' /usr/include/boost/spirit/home/classic/attribute/closure.hpp: In member function 'ResultT& boost::spirit::classic::closure_context<ClosureT>::post_parse(ResultT&, const ParserT&, const ScannerT&)': /usr/include/boost/spirit/home/classic/attribute/closure.hpp:84: error: 'frame' was not declared in this scope /usr/include/boost/spirit/home/classic/attribute/closure.hpp:84: error: 'tuple_index' is not a member of 'boost::phoenix' /usr/include/boost/spirit/home/classic/attribute/closure.hpp:84: error: expected primary-expression before ')' token /usr/include/boost/spirit/home/classic/attribute/closure.hpp: At global scope: /usr/include/boost/spirit/home/classic/attribute/closure.hpp:128: error: invalid use of '::' /usr/include/boost/spirit/home/classic/attribute/closure.hpp:128: error: expected ';' before '<' token /usr/include/boost/spirit/home/classic/attribute/closure.hpp: In constructor 'boost::spirit::classic::init_closure_context<ClosureT>::init_closure_context(const ClosureT&)': /usr/include/boost/spirit/home/classic/attribute/closure.hpp:115: error: class 'boost::spirit::classic::init_closure_context<ClosureT>' does not have any field named 'frame' /usr/include/boost/spirit/home/classic/attribute/closure.hpp:115: error: 'convert_actors' is not a member of 'boost::phoenix' /usr/include/boost/spirit/home/classic/attribute/closure.hpp:115: error: expected primary-expression before '>' token /usr/include/boost/spirit/home/classic/attribute/closure.hpp: In member function 'ResultT& boost::spirit::classic::init_closure_context<ClosureT>::post_parse(ResultT&, const ParserT&, const ScannerT&)': /usr/include/boost/spirit/home/classic/attribute/closure.hpp:124: error: 'frame' was not declared in this scope /usr/include/boost/spirit/home/classic/attribute/closure.hpp:124: error: 'tuple_index' is not a member of 'boost::phoenix' /usr/include/boost/spirit/home/classic/attribute/closure.hpp:124: error: expected primary-expression before ')' token /usr/include/boost/spirit/home/classic/attribute/closure.hpp: At global scope: /usr/include/boost/spirit/home/classic/attribute/closure.hpp:144: error: 'tuple_element' in namespace 'boost::phoenix' does not name a type /usr/include/boost/spirit/home/classic/attribute/closure.hpp:144: error: expected unqualified-id before '<' token /usr/include/boost/spirit/home/classic/attribute/closure.hpp:149: error: 'attr_t' was not declared in this scope /usr/include/boost/spirit/home/classic/attribute/closure.hpp:149: error: template argument 2 is invalid /usr/include/boost/spirit/home/classic/attribute/closure.hpp:212: error: redeclared with 13 template parameter(s) /usr/include/boost/spirit/home/classic/attribute/closure_fwd.hpp:62: note: previous declaration 'template<class DerivedT, class T0> struct boost::spirit::classic::closure' used 2 template parameter(s) /usr/include/boost/spirit/home/classic/attribute/closure.hpp:213: error: expected template-name before '<' token /usr/include/boost/spirit/home/classic/attribute/closure.hpp:1009: error: 'actor_result' in namespace 'boost::phoenix' does not name a type /usr/include/boost/spirit/home/classic/attribute/closure.hpp:1009: error: expected unqualified-id before '<' token /usr/include/boost/spirit/home/classic/attribute/closure.hpp:1017: error: 'actor_result' in namespace 'boost::phoenix' does not name a type /usr/include/boost/spirit/home/classic/attribute/closure.hpp:1017: error: expected unqualified-id before '<' token /usr/include/boost/spirit/home/classic/attribute/closure.hpp:1032: error: 'actor_result' in namespace 'boost::phoenix' does not name a type /usr/include/boost/spirit/home/classic/attribute/closure.hpp:1032: error: expected unqualified-id before '<' token /usr/include/boost/spirit/home/classic/attribute/closure.hpp:1040: error: 'actor_result' in namespace 'boost::phoenix' does not name a type /usr/include/boost/spirit/home/classic/attribute/closure.hpp:1040: error: expected unqualified-id before '<' token Regards, Artem

2 1

[gil] Compilation errors with MSVC10
by Christian Henning 30 May '10

30 May '10

Hi there, there seems to be some problems with the new MSVC10 compiler and bit_aligned images in gil. The following was compiling fine before I started using MSVC10. Here is some sample code: #include <vector> #include <algorithm> #include <boost/gil/gil_all.hpp> using namespace std; using namespace boost; using namespace boost::gil; int main(int argc, char* argv[]) { typedef bit_aligned_image1_type< 1, gray_layout_t >::type image_t; typedef image_t::view_t view_t; typedef view_t::reference pixel_t; typedef vector< unsigned char > buffer_t; typedef bit_aligned_pixel_iterator< pixel_t > it_t; vector< unsigned char > buf; it_t begin = it_t( &buf.front(), 0 ); it_t end = it_t( &buf.front(), 0 ); image_t img; image_t::view_t v = view( img ); std::copy( begin , end , v.row_begin( 0 ) ); return 0; } The error message is: c:\program files (x86)\microsoft visual studio 10.0\vc\include\xutility(2216): error C2665: 'std::_Copy_impl' : none of the 2 overloads could convert all the argument types Anyone, any idea? I'll keep investigating. Regards, Christian

2 3

boost.MPI for a scheduler design
by Jack Bryan 30 May '10

30 May '10

Hi, I want to design an application program (C++) that can distribute computing tasks on a cluster with MPI installed. I would like to use boost.MPI to do the data communication and Rhapsodia.Schedulerto do the task scheduling. For example, I need to solve a big problem, which can be divided into multiple small tasks. These small tasks can be done independently on different nodes. So, when they are done, they return their results to one node, which combine their results into a solution for the big problem. Right now, the big problem has been programmed with C++. It is a sequential algorithm. I need to design a task/job scheduler that can do the above scheduling on cluster system so that the small tasks can be run in parallel. In this way, we can improve the performance of the sequential algorithm. Does my idea make sense ? Any help is appreciated. thanks Jack May 29 2010 _________________________________________________________________ Hotmail is redefining busy with tools for the New Busy. Get more from your inbox. http://www.windowslive.com/campaign/thenewbusy?ocid=PID28326::T:WLMTAGL:ON:…

2 3

base_from_member problem
by Olaf Peter 29 May '10

29 May '10

Hello, in the example attached I've got the compiler error base_from.cpp: In constructor ‘header_fixture::header_fixture()’: base_from.cpp:48: error: type ‘client::detail::header_grammar<boost::spirit::karma::detail::output_iterator<const char*, mpl_::int_<15>, boost::fusion::unused_type> >’ is not a direct base of ‘header_fixture’ /home/olaf/Projects/programming/cpp/boost/trunk/boost/utility/base_from_member.hpp:69: error: ‘client::detail::string_grammar<boost::spirit::karma::detail::output_iterator<const char*, mpl_::int_<15>, boost::fusion::unused_type> > boost::base_from_member<client::detail::string_grammar<boost::spirit::karma::detail::output_iterator<const char*, mpl_::int_<15>, boost::fusion::unused_type> >, 0>::member’ is protected where the 2nd error is due to the 1st one. Why does it not work? without karma::grammar it compiles. How to fix it? Thanks, Olaf

1 0

Cannot compile boost mpi example
by Hernan Grecco 29 May '10

29 May '10

I have downloaded boost 1.43 and run many of the examples without a problem. However, I am not able to compile any of the parallel graph examples. I traced the problem to using boost MPI. For example when I compile the first example in: http://www.boost.org/doc/libs/1_43_0/doc/html/mpi/tutorial.html I get: /tmp/ccwOi38z.o(.text+0x132): In function `main': : undefined reference to `boost::mpi::environment::environment(int&, char**&, bool)' /tmp/ccwOi38z.o(.text+0x13b): In function `main': : undefined reference to `boost::mpi::communicator::communicator()' /tmp/ccwOi38z.o(.text+0x144): In function `main': : undefined reference to `boost::mpi::communicator::size() const' /tmp/ccwOi38z.o(.text+0x150): In function `main': : undefined reference to `boost::mpi::communicator::rank() const' /tmp/ccwOi38z.o(.text+0x1b1): In function `main': : undefined reference to `boost::mpi::environment::~environment()' /tmp/ccwOi38z.o(.text+0x1e2): In function `main': : undefined reference to `boost::mpi::environment::~environment()' MPI works fine as I have tested with the example in: http://www.boost.org/doc/libs/1_43_0/doc/html/mpi/getting_started.html#mpi.… I am running linux 64 bits, gcc 3.4. Thanks in advance, Hernan

4 4

[phoenix][lambda] lambda to phoenix translation: get arguments from expression
by alfC 29 May '10

29 May '10

Hi I have a phoenix expression of type actor< composite< divides_eval, vector< LambdaExp, composite< minus_eval, vector< argument<0>, value<double> > > > > > f_expr with boost.lambda I could extract the different components (Lambda and the actual value stored by value<double>) from f_expr as: get<0>(f_expr.args) //for lambda and get<1>(get<1>(f_expr.args).args) //for lambda what is the equivalent for Boost.phoenix?, it seems that the phoenix actor doesn't have the member "args". something like at_c<1>(at_c<1>(f_expr)) seems to be in the right direction but it returns something of type value<double> from which I don't know how to extract the value in the same way at_c<1>(f_expr) returns the denominator, but it is not an actor, so it is not a lambda expression. the corresponding lambda type was: lambda_functor<lambda_functor_base< arithmetic_action<divide_action>, tuple< lambda_functor<// LambdaExp >,// lambda_functor<lambda_functor_base< arithmetic_action<minus_action>, tuple< lambda_functor< placeholder<1> >, double const // <-- attention adds const to avoid unreadable errors > > > > > > f_expr Thank you, Alfredo

2 3

[lambda] helping lambda to deduce return type and then avoid 'ret<T>'
by alfC 29 May '10

29 May '10

Hi, the lambda manual says: "The return type deduction system may not be able to deduce the return types of some user defined operators or bind expressions with class objects. A special lambda expression type is provided for stating the return type explicitly and overriding the deduction system. To state that the return type of the lambda functor defined by the lambda expression e is T, you can write:" and indeed for even very simple arithmetic user-defined classes (for example boost.units quantities) the lambda expression is poluted with many many ret<T> statements, for example _1*_1/(_1+x)/(_1-x) becomes ret<anothertype>(ret<usertype>(_1*_1)/ ret<othertype>(ret<usertype>(_1+x)/ret<usertype>(_1-x))); the question is, is there a way to help lambda library to help deducing the return type to avoid the repeated use of ret<T>. Thank you, Alfredo

4 6

spirit and property_tree headers conflict
by Artem Kozlov 28 May '10

28 May '10

Hello, When attempting to compile a program which includes the following headers (at once): #include <boost/property_tree/json_parser.hpp> #include <boost/spirit/include/qi.hpp> , I get a lot of error messages. Is there any way to resolve this conflict and compile the program without dividing it into several translation units? Thanks in advance, Artem

3 2

[Chrono] How to report problems?
by Roland Bock 28 May '10

28 May '10

Hi, after having received a push in the right direction by Howard yesterday, everything works fine so far, except for for the following two details: a) I get some warnings about unused parameters when using the stopclock. For instance: include/boost/chrono/stopwatch_reporter.hpp:81: warning: unused parameter ‘ec’ The fixes are trivial in all cases I encountered. b) The thread_clock part of the tutorial looks pretty broken. Not sure if more things will come up, but if so, where should I send them? Maybe this information would be a nice addition to the FAQ until chrono makes it into boost? Thanks for this cool library! Regards, Roland

3 6

Exposing C++ Instances to Python
by Leonhard Weber 28 May '10

28 May '10

Hello, I'm in the same bind this topic describes: http://lists.boost.org/boost-users/2009/02/44749.php Unfortunately the subject didn't tell about the resolution or approach he took to succeed. Can anyone help me? Basically: I want to expose a C++ Instance to Python at runtime. I have a pointer to the Instance and need to expose that instance to Python. Thankful for any help, Best regards, ~lwk

3 7

[interprocess] user application can't attach shared memory created by Windows service
by Rui Pedro Fernandes 28 May '10

28 May '10

Hi, I'm using version 1.41 in a Windows Server 2008 host. If I run an application as a service (in fact launching it with srvany) that creates a named managed_windows_shared_memory and then execute a user application that tries to attach the shm, the later cannot succeed to attach - error is: "The system cannot find the file specified". On the other hand, if the shared memory is of type managed_shared_memory then all runs fine. Couldn't this indicate that in the windows approach the file mapping object should be created with more global security and access rights? Thanks, Rui

2 2

Re: [Boost-users] Exception on windows::stream_handle!
by Lloyd 28 May '10

28 May '10

I would like to post the reason for this exception, may it will be useful for someone else :) The create file was not created with the "Overlapped IO attribute" It should look like this CreateFile(("MyFile",GENERIC_WRITE,0,NULL,CREATE_NEW,FILE_ATTRIBUTE_NORMAL|FILE_FLAG_OVERLAPPED,NULL); ----- Original Message ----- From: Lloyd To: boost-users(a)lists.boost.org Sent: Wednesday, May 26, 2010 2:35 PM Subject: Exception on windows::stream_handle! Hello, We are trying to create a "windows::stream_handle" from a native Windows HANDLE. But it throws an exception with "The parameter is incorrect". The code is given below. What could be the reason? (Another IOservice is already running in the system) HANDLE FileHandle=CreateFile("MyFile",FILE_WRITE_DATA,0,NULL,CREATE_NEW,FILE_ATTRIBUTE_NORMAL,NULL); if(FileHandle==INVALID_HANDLE_VALUE) { return; } try { io_service ios; windows::stream_handle StreamHandle(ios,FileHandle); ... ... } catch(std::exception& e) { Log(e.what()); //The parameter is incorrect } Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

1 0

simple serialization of boost::variant
by Archie14 28 May '10

28 May '10

I use std::istream and std::ostream for binary serialization ( can't use boost::serialization) and can't find a way to serialize boost::variant<int, double, std::string>. I'll appreciate a code sample or link to the documentation. Thanks.

2 2

[units] User-defined vector class template won't compile
by Terry Golubiewski 28 May '10

28 May '10

I'm trying to make a "simple" cartesian vector class. It should be similar to the quaternion example that you give in the docs, but I can't get it to compile. I've attached a complete program. Here are the error I get when I try to compile it. Lets just focus on fixing the first few errors about no binary '*'. When I understand that, perhaps I'll be able to fix the rest. Thanks, terry try.cpp using native typeof C:/boost/boost_1_43_0\boost/units/operators.hpp(74) : error C2678: binary '*' : no operator found which takes a left-hand operand of type 'double' (or there is no acceptable conversion) C:/boost/boost_1_43_0\boost/units/detail/one.hpp(47): could be 'T boost::units::operator *<T>(const boost::units::one &,const T &)' with [ T=rci::cartesian::vector<3,double> ] C:/boost/boost_1_43_0\boost/units/detail/one.hpp(53): or 'T boost::units::operator *<double>(const T &,const boost::units::one &)' with [ T=double ] C:/boost/boost_1_43_0\boost/units/detail/one.hpp(58): or 'boost::units::one boost::units::operator *(const boost::units::one &,const boost::units::one &)' while trying to match the argument list '(double, rci::cartesian::vector<Dim,Rep>)' with [ Dim=3, Rep=double ] C:/boost/boost_1_43_0\boost/units/operators.hpp(75) : see reference to class template instantiation 'boost::units::multiply_typeof_helper<X,Y>::nested' being compiled with [ X=double, Y=rci::cartesian::vector<3,double> ] C:/boost/boost_1_43_0\boost/units/quantity.hpp(690) : see reference to class template instantiation 'boost::units::multiply_typeof_helper<X,Y>' being compiled with [ X=double, Y=rci::cartesian::vector<3,double> ] try.cpp(255) : see reference to class template instantiation 'boost::units::multiply_typeof_helper<X,Y>' being compiled with [ X=boost::units::quantity<boost::units::si::length>, Y=rci::cartesian::vector<3,double> ] C:/boost/boost_1_43_0\boost/units/operators.hpp(74) : error C2866: 'boost::units::multiply_typeof_helper<X,Y>::nested::_typeof_register_value' : a const static data member of a managed type must be initialized at the point of declaration with [ X=double, Y=rci::cartesian::vector<3,double> ] C:/boost/boost_1_43_0\boost/units/operators.hpp(74) : error C2027: use of undefined type 'boost::type_of::msvc_extract_type<ID>::id2type_impl<__formal>' with [ ID=boost::units::multiply_typeof_helper<double,rci::cartesian::vector<3,double>>::nested ] and [ __formal=true ] C:/boost/boost_1_43_0\boost/units/operators.hpp(74) : error C2146: syntax error : missing ';' before identifier 'type' C:/boost/boost_1_43_0\boost/units/operators.hpp(74) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int C:/boost/boost_1_43_0\boost/units/operators.hpp(74) : error C2602: 'boost::units::multiply_typeof_helper<X,Y>::nested::type' is not a member of a base class of 'boost::units::multiply_typeof_helper<X,Y>::nested' with [ X=double, Y=rci::cartesian::vector<3,double> ] C:/boost/boost_1_43_0\boost/units/operators.hpp(74) : see declaration of 'boost::units::multiply_typeof_helper<X,Y>::nested::type' with [ X=double, Y=rci::cartesian::vector<3,double> ] C:/boost/boost_1_43_0\boost/units/operators.hpp(74) : see declaration of 'boost::units::multiply_typeof_helper<X,Y>::nested' with [ X=double, Y=rci::cartesian::vector<3,double> ] C:/boost/boost_1_43_0\boost/units/operators.hpp(74) : error C2868: 'boost::units::multiply_typeof_helper<X,Y>::nested::type' : illegal syntax for using-declaration; expected qualified-name with [ X=double, Y=rci::cartesian::vector<3,double> ] try.cpp(255) : error C2679: binary '=' : no operator found which takes a right-hand operand of type 'boost::units::quantity<Unit,Y>' (or there is no acceptable conversion) with [ Unit=boost::units::unit<boost::units::length_dimension,boost::units::si::system>, Y=int ] try.cpp(28): could be 'rci::cartesian::vector<Dim,Rep> &rci::cartesian::vector<Dim,Rep>::operator =(const rci::cartesian::vector<Dim,Rep> &)' with [ Dim=3, Rep=boost::units::quantity<boost::units::si::length> ] while trying to match the argument list '(rci::cartesian::vector<Dim,Rep>, boost::units::quantity<Unit,Y>)' with [ Dim=3, Rep=boost::units::quantity<boost::units::si::length> ] and [ Unit=boost::units::unit<boost::units::length_dimension,boost::units::si::system>, Y=int ]

2 2

Boost and ARM like processor
by joel falcou 27 May '10

27 May '10

Is there any return of experience to actually compiles and use Boost on ARM platform (CORTEX 9 or similar). We're currently trying to look at such machien and pondered about the state of C++ compiler on them. More down to earth question, has anybody use tricky template stuff with ARM tool set and were there any problem ? thanks

2 2

[interprocess] managed_shared_memory on Windows XP virtual machine
by Rui Pedro Fernandes 27 May '10

27 May '10

Hi, I found a problem that seems to be an issue in boost.interprocess (1.41): I was using managed_shared_memory (not managed_windows_shared_memory) and all was going fine until the day I run my applications on a virtual machine. The problem is that some applications were randomly not able to attach the shm previously created and the error was: "The system cannot find the file specified". I found that in fact the folder (under ...All Users\Application Data\boost_interprocess) where the shm file was being looked for was not the same as the folder where it was created. Is it possible that the algorithm used to build the name of the folder "thinks" for some reason that there was a system restart ? Cheers, Rui

2 1

Compiling Boost.MPI and mpich2 under Suse Linux
by Michael1984 27 May '10

27 May '10

Hello, I am trying to compile Boost.MPI with Mpich2 under Suse Linux 10.x. After having built Mpich2, involing ./bjam install I am presented with the following error below, however, recompiling mpich2 with -fPIC does not help either. mpich2$ ./configure CXXFLAGS=-fPIC; make; make install Does anybody have any suggestions? Thanks a lot! Michael ... gcc.link.dll bin.v2/libs/mpi/build/gcc-4.3/release/threading-multi/libboost_mpi.so.1.43.0 /usr/lib64/gcc/x86_64-suse-linux/4.3/../../../../x86_64-suse-linux/bin/ld: /mnt/thor2/michael/tools/mpich2/lib/libmpich.a(attr_get.o): relocation R_X86_64_32 against `a local symbol' can not be used when making a shared object; recompile with -fPIC /mnt/thor2/michael/tools/mpich2/lib/libmpich.a: could not read symbols: Bad value collect2: ld returned 1 exit status ... -- View this message in context: http://old.nabble.com/Compiling-Boost.MPI-and-mpich2-under-Suse-Linux-tp286… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

qi::locals
by Xavier Pegenaute 27 May '10

27 May '10

Hi, I would like to do some complex semantic operation, but I am not sure if it is possible to do with Spirit. At the moment it does'nt compile :-) I want a rule like this inside a template class with Iterator, and ActionHandler as template names: 1: qi::rule< 2: Iterator, 3: qi::locals< 4: std::vector<typename ActionHandler::AClass *>, 5: typename ActionHandler::BClass> * 6: >, 7: skipper 8: > rule1; later in the grammar I would like something like this: 9: rule1.name("rule1"); 10: rule1 = 11: ( 12: qi::lit("AClass") > 13: +(qi::int_ > qi::int_ > qi::char_)[ 14: qi::_a.push_back(phoenix::construct< 15: typename ActionHandler::AClass>(qi::_1, qi::_2, qi::_3) 16: ] > 17: -( 18: qi::lit("BClass") > 19: +(qi::int_ > qi::char_)[qi::_b.addPair(qi::_1, qi::_2)] 20: )[phoenix::for_each(qi::_a.begin(), qi::_a.end(), 21: xxx::a_element.setBClass(qi::_b))] 22: )[phoenix::bind(&ActionHandler::addAClassVector, 23: phoenix::ref(handler), qi::_a)] 24: ; I guess I have some problem with: - The rule definition, here seems is expecting the rule's attribute type - Line 14: - qi::_a is an actor, does'nt have push_back method - construct returns a AClass pointer? - Line 19, same as befor, qi::_b is an actor without addPair method - Line 20: - is it possible to use for_each?, I guess phoenix can. - begin/end qi::_a is an actors not a vector Some idea to face it?, or may be is too complex and better do it in some other easier way? Thanks & Regards. Xavi.

2 1

[Bind] binding a functor simple example - compiler error
by Viter :O) 27 May '10

27 May '10

I'm having problems to compile a simple example and I don't Know what could it be the problem. my main.cpp code is the following: -- main.cpp ----------------------------------------------- #include <boost/bind.hpp> #include <iostream> int main() { struct F { int operator() (int a, int b) const { return a + b; } }; F f; std::cout << " f: " << boost::bind(f,1,2)() << std::endl; return 0; } ----------------------------------------------------------- I have the boost headers folder in the relative path "../../include" The command line i'm using to compile the file is @ g++ -I../../include -c main.cpp -o obj/Release/main.o but it returns the following error: no matching function for call to `bind(main()::F&, int, int)' I tried with 2 compilers but I get the same error from both: gcc versión 4.3.3 (Ubuntu 4.3.3-5ubuntu4) gcc version 3.4.5 (mingw-vista special r3) I'm using the Code::Blocks Editor and the MinGW compiler. Coud you help me to compile this simple example? Thanks a lot. \/iter :O)

2 1

Invitation à se connecter sur LinkedIn
by Nguyen Son 27 May '10

27 May '10

LinkedIn ------------Nguyen Son requested to add you as a connection on LinkedIn: ------------------------------------------ Hermann, J'aimerais vous inviter à rejoindre mon réseau professionnel en ligne, sur le site LinkedIn. Nguyen Accept invitation from Nguyen Son http://www.linkedin.com/e/vyhGWmEqB2IKeRN9DMTel5y44rvJcs9rKs7Z6xxi13/blk/I2… View invitation from Nguyen Son http://www.linkedin.com/e/vyhGWmEqB2IKeRN9DMTel5y44rvJcs9rKs7Z6xxi13/blk/I2… ------------------------------------------ DID YOU KNOW LinkedIn can help you find the right service providers using recommendations from your trusted network? Using LinkedIn Services, you can take the risky guesswork out of selecting service providers by reading the recommendations of credible, trustworthy members of your network. http://www.linkedin.com/e/svp/inv-25/ ------ (c) 2010, LinkedIn Corporation

3 2

program_options: validation_error
by Matwey V. Kornilov 27 May '10

27 May '10

Hi, validation_error constructor signature was changed from validation_error(const std::string &); in boost 1.41.0 to validation_error(kind_t, const std::string & = "", const std::string & = ""); in boost 1.42.0+ This way validation_error is backward-incompatible and "Custom Validators" (http://www.boost.org/doc/libs/1_43_0/doc/html/program_options/howto.html#id…) section in html-documentations has an wrong example that uses 'validation_error(const std::string &)' signature.

2 2

Problem compiling simple boost::thread code on Ubuntu9.10 :: GCC4.4.1 vs boost ?
by octopusdesign.net 27 May '10

27 May '10

Hi, I'm looking at developing a cross-platform application in C++ using the QT library && Netbeans on Ubuntu (9.10) and I'd like to be able to use Boost libs for threading so I've installed libboost1.40-all-dev. My version of gcc is :: 4.4.1 I've read there is a problem between this version of gcc and boost and that there is a patch somewhere. I'm a bit of a linux newbie so if anyone knows about this and can point me at the patch, it'd be great. I have followed a very straight forward example of how to use boost::thread from here --> http://www.drdobbs.com/cpp/184401518;jsessionid=OUWYLHI3ITUAHQE1GHOSKHWATMY… Looking at the compiler output my inexperienced eyes are telling me the linker can't find the boost lib(s) it wants ? Any help or advice anyone can give will be greatly appreciated. Regards, Chris My code is as follows :: #include <QtGui/QApplication> #include <qt4/QtGui/qwidget.h> #include "qtMain.h" #include "DummySourceMgr.h" #include "DummySource.h" #include <boost/thread.hpp> void startDSM() { DummySourceMgr * dsm = new DummySourceMgr(); dsm->start(); } int main(int argc, char *argv[]) { // initialize resources, if needed // Q_INIT_RESOURCE(resfile); QApplication app(argc, argv); // create and show your widgets here qtMain * main = new qtMain(); main->show(); boost::thread systest1(&startDSM); systest1.join(); return app.exec(); } When I build in netbeans I get the following compiler output ::-> /usr/bin/make -f nbproject/Makefile-Debug.mk SUBPROJECTS= .clean-conf make[1]: Entering directory `/home/dansonc/NetBeansProjects/StreamLaser' qmake VPATH=. -o qttmp-Debug.mk nbproject/qt-Debug.pro mv -f qttmp-Debug.mk nbproject/qt-Debug.mk /usr/bin/make -f nbproject/qt-Debug.mk distclean make[2]: Entering directory `/home/dansonc/NetBeansProjects/StreamLaser' rm -f moc_qtMain.cpp rm -f ui_qtMain.h rm -f build/Debug/GNU-Linux-x86/DummySource.o build/Debug/GNU-Linux-x86/qtMain.o build/Debug/GNU-Linux-x86/DummySourceMgr.o build/Debug/GNU-Linux-x86/main.o build/Debug/GNU-Linux-x86/moc_qtMain.o rm -f *~ core *.core rm -f dist/Debug/GNU-Linux-x86/StreamLaser rm -f qttmp-Debug.mk make[2]: Leaving directory `/home/dansonc/NetBeansProjects/StreamLaser' make[1]: Leaving directory `/home/dansonc/NetBeansProjects/StreamLaser' CLEAN SUCCESSFUL (total time: 428ms) /usr/bin/make -f nbproject/Makefile-Debug.mk SUBPROJECTS= .build-conf make[1]: Entering directory `/home/dansonc/NetBeansProjects/StreamLaser' qmake VPATH=. -o qttmp-Debug.mk nbproject/qt-Debug.pro mv -f qttmp-Debug.mk nbproject/qt-Debug.mk /usr/bin/make -f nbproject/qt-Debug.mk dist/Debug/GNU-Linux-x86/StreamLaser make[2]: Entering directory `/home/dansonc/NetBeansProjects/StreamLaser' /usr/bin/uic-qt4 qtMain.ui -o ui_qtMain.h g++-4.4 -c -pipe -g -Wall -W -D_REENTRANT -DQT_GUI_LIB -DQT_CORE_LIB -DQT_SHARED -I/usr/share/qt4/mkspecs/linux-g++ -Inbproject -I/usr/include/qt4/QtCore -I/usr/include/qt4/QtGui -I/usr/include/qt4 -I. -I. -Inbproject -I. -o build/Debug/GNU-Linux-x86/DummySource.o DummySource.cpp DummySource.cpp:27: warning: unused parameter 'orig' DummySource.cpp: In member function 'void DummySource::start()': DummySource.cpp:36: warning: unused variable 'n' g++-4.4 -c -pipe -g -Wall -W -D_REENTRANT -DQT_GUI_LIB -DQT_CORE_LIB -DQT_SHARED -I/usr/share/qt4/mkspecs/linux-g++ -Inbproject -I/usr/include/qt4/QtCore -I/usr/include/qt4/QtGui -I/usr/include/qt4 -I. -I. -Inbproject -I. -o build/Debug/GNU-Linux-x86/qtMain.o qtMain.cpp g++-4.4 -c -pipe -g -Wall -W -D_REENTRANT -DQT_GUI_LIB -DQT_CORE_LIB -DQT_SHARED -I/usr/share/qt4/mkspecs/linux-g++ -Inbproject -I/usr/include/qt4/QtCore -I/usr/include/qt4/QtGui -I/usr/include/qt4 -I. -I. -Inbproject -I. -o build/Debug/GNU-Linux-x86/DummySourceMgr.o DummySourceMgr.cpp DummySourceMgr.cpp:15: warning: unused parameter 'orig' g++-4.4 -c -pipe -g -Wall -W -D_REENTRANT -DQT_GUI_LIB -DQT_CORE_LIB -DQT_SHARED -I/usr/share/qt4/mkspecs/linux-g++ -Inbproject -I/usr/include/qt4/QtCore -I/usr/include/qt4/QtGui -I/usr/include/qt4 -I. -I. -Inbproject -I. -o build/Debug/GNU-Linux-x86/main.o main.cpp /usr/bin/moc-qt4 -DQT_GUI_LIB -DQT_CORE_LIB -DQT_SHARED -I/usr/share/qt4/mkspecs/linux-g++ -Inbproject -I/usr/include/qt4/QtCore -I/usr/include/qt4/QtGui -I/usr/include/qt4 -I. -I. -Inbproject -I. qtMain.h -o moc_qtMain.cpp g++-4.4 -c -pipe -g -Wall -W -D_REENTRANT -DQT_GUI_LIB -DQT_CORE_LIB -DQT_SHARED -I/usr/share/qt4/mkspecs/linux-g++ -Inbproject -I/usr/include/qt4/QtCore -I/usr/include/qt4/QtGui -I/usr/include/qt4 -I. -I. -Inbproject -I. -o build/Debug/GNU-Linux-x86/moc_qtMain.o moc_qtMain.cpp g++ -o dist/Debug/GNU-Linux-x86/StreamLaser build/Debug/GNU-Linux-x86/DummySource.o build/Debug/GNU-Linux-x86/qtMain.o build/Debug/GNU-Linux-x86/DummySourceMgr.o build/Debug/GNU-Linux-x86/main.o build/Debug/GNU-Linux-x86/moc_qtMain.o -L/usr/lib -lQtGui -lQtCore -lpthread build/Debug/GNU-Linux-x86/main.o: In function `main': /home/dansonc/NetBeansProjects/StreamLaser/main.cpp:44: undefined reference to `boost::thread::join()' /home/dansonc/NetBeansProjects/StreamLaser/main.cpp:47: undefined reference to `boost::thread::~thread()' /home/dansonc/NetBeansProjects/StreamLaser/main.cpp:47: undefined reference to `boost::thread::~thread()' build/Debug/GNU-Linux-x86/main.o: In function `mutex': /usr/include/boost/thread/pthread/mutex.hpp:40: undefined reference to `boost::thread_resource_error::thread_resource_error()' /usr/include/boost/thread/pthread/mutex.hpp:40: undefined reference to `boost::thread_resource_error::~thread_resource_error()' /usr/include/boost/thread/pthread/mutex.hpp:40: undefined reference to `typeinfo for boost::thread_resource_error' build/Debug/GNU-Linux-x86/main.o: In function `condition_variable': /usr/include/boost/thread/pthread/condition_variable_fwd.hpp:33: undefined reference to `boost::thread_resource_error::thread_resource_error()' /usr/include/boost/thread/pthread/condition_variable_fwd.hpp:33: undefined reference to `boost::thread_resource_error::~thread_resource_error()' /usr/include/boost/thread/pthread/condition_variable_fwd.hpp:33: undefined reference to `typeinfo for boost::thread_resource_error' build/Debug/GNU-Linux-x86/main.o: In function `thread_data_base': /usr/include/boost/thread/pthread/thread_data.hpp:54: undefined reference to `vtable for boost::detail::thread_data_base' build/Debug/GNU-Linux-x86/main.o: In function `thread<void (*)()>': /usr/include/boost/thread/detail/thread.hpp:188: undefined reference to `boost::thread::start_thread()' build/Debug/GNU-Linux-x86/main.o: In function `~thread_data': /usr/include/boost/thread/detail/thread.hpp:40: undefined reference to `boost::detail::thread_data_base::~thread_data_base()' /usr/include/boost/thread/detail/thread.hpp:40: undefined reference to `boost::detail::thread_data_base::~thread_data_base()' build/Debug/GNU-Linux-x86/main.o:(.rodata._ZTIN5boost6detail11thread_dataIPFvvEEE[typeinfo for boost::detail::thread_data<void (*)()>]+0x8): undefined reference to `typeinfo for boost::detail::thread_data_base' collect2: ld returned 1 exit status make[2]: *** [dist/Debug/GNU-Linux-x86/StreamLaser] Error 1 make[2]: Leaving directory `/home/dansonc/NetBeansProjects/StreamLaser' make[1]: *** [.build-conf] Error 2 make[1]: Leaving directory `/home/dansonc/NetBeansProjects/StreamLaser' make: *** [.build-impl] Error 2 BUILD FAILED (exit value 2, total time: 14s)

2 1

Can't find copy_file() with copy_option
by Hite, Christopher 26 May '10

26 May '10

This doesn't work: using namespace boost::filesystem; copy_file(tmpFileName,fname,copy_option::overwrite_if_exists); error: no matching function for call to 'copy_file(std::string&, std::string&, boost::filesystem::copy_option::enum_type)' /fs/tools/L1/boost_1_43_0/boost/filesystem/operations.hpp:742: note: candidates are: void boost::filesystem::copy_file(const boost::filesystem::path&, const boost::filesystem::path&) /fs/tools/L1/boost_1_43_0/boost/filesystem/operations.hpp:744: note: void boost::filesystem::copy_file(const boost::filesystem::wpath&, const boost::filesystem::wpath&) This does: detail::copy_file_api(tmpFileName,fname, copy_option::overwrite_if_exists); Platform is Linux+gcc. It looks like these definitions are the only ones exposed: inline void copy_file( const path & from_path, const path & to_path ) { return copy_file<path>( from_path, to_path ); } inline void copy_file( const wpath & from_path, const wpath & to_path ) { return copy_file<wpath>( from_path, to_path ); } This doesn't fly either though: copy_file<std::string>(tmpFileName,fname,copy_option::overwrite_if_exist s); The version I'm after is there: http://www.boost.org/doc/libs/1_43_0/libs/filesystem/doc/reference.html It would be nice to have a move/rename with this functionality. I'm going to stick with std::rename().

1 0

[Review] Formal Review: Boost.Move
by OvermindDL1 26 May '10

26 May '10

Greetings Boost Developers and Users, It's my pleasure to announce that the review of Ion Gaztañagas' Move library starts May 10th and lasts until May 24th, 2010, unless an extension occurs. What is it? =========== The Boost.Move library would supply an emulated C++1x Move semantics interface, aka RValue References, allowing for a wide variety of easy to use and easy to add in optimization abilities. The most used function it would add would be: val_b = boost::move( val_a ); Which would move val_a to val_b; val_a should not be used after this line. This semantic allows for a vast amount of optimizations, especially in regards to temporaries, see the documentation for further examples and use. Other patterns emulated are && rvalue references for functions/members and constructors. There are also a number of STL containers in the sandbox that support move semantics using this library for higher efficiency. Getting the library =================== The latest version of this library may be downloaded from SVN: http://svn.boost.org/svn/boost/sandbox/move/ and the docs may be viewed here Docs: http://igaztanaga.drivehq.com/libs/move/doc/html/index.html and do note, this library is header-only and is designed to be absolutely generic to be useful in all areas of C++ programming. Writing a review ================ If you feel this is an interesting library, then please submit your review to the developer list (preferably), or to the review manager. Here are some questions you might want to answer in your review: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick - reading? In-depth study? - Are you knowledgeable about the problem domain? And finally, every review should answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Special considerations ====================== If you want or need a primer on the subject, please look at the working draft for C++1x. This linked site has also been shown to be quite useful in describing move usefulness: Want Speed? Pass by Value.: http://cpp-next.com/archive/2009/08/want-speed-pass-by-value/ Move It With Rvalue References: http://cpp-next.com/archive/2009/09/move-it-with-rvalue-references/ And there are further links in that series, but those two will get you started in the domain. Best regards, OvermindDL1, Review Manager (Boost.Move)

8 31

[MPL] what is my base class?
by John Dlugosz 26 May '10

26 May '10

I'm writing a class template, say C<T>, that has essentially different features depending on a classification of type T. So, I implemented Ca and Cb as befitting the two categories, and then make that transparent to the user by making a stub for C that inherits from either of those two, using boost::mpl::if_ to choose between them. However, the constructors have to be brought down manually. To "inherit" them, they need to be forwarded to the base class: C (...args...) : Ca (...args...) {} The problem is, I can't easily name the base class here in the base initialization list. I'm not even sure repeating the if_ metaexpression here would work, since the init list doesn't even like typedefs but wants the literal name of the class. Did I paint myself into a corner? Please help. In one case, it was not a problem to use only a default constructor and call an inherited Initialize function from the body. In the other case, I want to keep my reference member initializers. Thanks, --John 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.

4 8

Invitation to connect on LinkedIn
by Shon Pritchett 26 May '10

26 May '10

LinkedIn ------------Shon Pritchett requested to add you as a connection on LinkedIn: ------------------------------------------ Hermann, I'd like to add you to my professional network on LinkedIn. - Shon Accept invitation from Shon Pritchett http://www.linkedin.com/e/vyhGWmEqB2IKeRN9DMTel5y44rvJcs9rKs7Z6xxi13/blk/I2… View invitation from Shon Pritchett http://www.linkedin.com/e/vyhGWmEqB2IKeRN9DMTel5y44rvJcs9rKs7Z6xxi13/blk/I2… ------------------------------------------ DID YOU KNOW you can be the first to know when a trusted member of your network changes jobs? With Network Updates on your LinkedIn home page, you'll be notified as members of your network change their current position. Be the first to know and reach out! http://www.linkedin.com/ ------ (c) 2010, LinkedIn Corporation

1 0

Review Wizard Report for May 2010
by Ronald Garcia 26 May '10

26 May '10

============================================== Review Wizard Status Report for May 2010 ============================================== News ==== Boost 1.42 Released New Libraries: UUID Revised Libraries: Asio, Circular Buffer, Fusion, Graph, Integer, Iostreams, Program.Options, Property Map, Proto, Regex, Spirit, Unordered, Xpressive Meta State Machine (MSM) Library Accepted Boost 1.43 Released New Libraries: Functional/Factory, Functional/Forward Revised Libraries: Range, Accumulators, Array, Asio, Fusion, Iostreams, Multi-index Containers, Proto, Random, Spirit, Thread, Unordered, Uuid, Wave, Xpressive Open Issues =========== The Constrained Value Library was reviewed in December 2008 but no review result has been reported. We would appreciate it if someone who knows the review manager, Jeff Garland, could contact him. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Time Series (accepted August 2007). * Floating Point Utilities (accepted March 2008). * Futures (accepted April 2009). * Polygon Library (accepted November 2009). * Geometry Library (accepted November 2009). * Meta State Machine (accepted January 2010). The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Switch (accepted provisionally January 2008) * Phoenix (accepted provisionally September 2008) General Announcements ===================== As always, we need experienced review managers. The review queue has grown substantially but we have few volunteers, so manage reviews if possible and if not please make sure to watch the review schedule and participate. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants or library contributors. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "garcia at osl dot iu dot edu" and "phillips at mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. A recent effort is trying to secure at least five people who promise to submit reviews as a precondition to starting the review period. Consider volunteering for this and even taking the time to create the review as early as possible. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report before we do that, please email Ron or John. If you're a library author and plan on submitting a library for review in the next 3-6 months, send Ron or John a short description of your library and we'll add it to the Libraries Under Construction below. We know that there are many libraries that are near completion, but we have hard time keeping track all of them. Please keep us informed about your progress. The included review queue isn't a classic queue. It is more an unordered list of the libraries awaiting review. As such, any library in the queue can be reviewed once the developer is ready and a review manager works with the wizards and the developer to schedule a review. It is not FIFO. Review Queue ============ * Lexer * Shifted Pointer * Logging * Join * Pimpl * Task * Endian * Conversion * Sorting * GIL.IO * AutoBuffer * String Convert * Containers * Type Traits Extensions * Interthreads * Bitfield * Lockfree * Fiber * Chrono * Sequence Properties * Static Size Linear Algebra * Locale -------------------- Lexer ----- :Author: Ben Hanson :Review Manager: Eric Neibler :Download: `Boost Vault <http://boost-consulting.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: A programmable lexical analyser generator inspired by 'flex'. Like flex, it is programmed by the use of regular expressions and outputs a state machine as a number of DFAs utilising equivalence classes for compression. Shifted Pointer --------------- :Author: Phil Bouchard :Review Manager: Needed :Download: `Boost Vault <http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directo… >`__ :Description: Smart pointers are in general optimized for a specific resource (memory usage, CPU cycles, user friendliness, ...) depending on what the user need to make the most of. The purpose of this smart pointer is mainly to allocate the reference counter (or owner) and the object itself at the same time so that dynamic memory management is simplified thus accelerated and cheaper on the memory map. Logging ------- :Author: John Torjo :Review Manager: Gennadiy Rozental :Download: http://torjo.com/log2/ :Description: Used properly, logging is a very powerful tool. Besides aiding debugging/testing, it can also show you how your application is used. The Boost Logging Library allows just for that, supporting a lot of scenarios, ranging from very simple (dumping all to one destination), to very complex (multiple logs, some enabled/some not, levels, etc). It features a very simple and flexible interface, efficient filtering of messages, thread-safety, formatters and destinations, easy manipulation of logs, finding the best logger/filter classes based on your application's needs, you can define your own macros and much more! Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: | `Boost Vault <http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam… >`__ | http://www.ddj.com/cpp/205918714 (documentation) :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Task ---- :Author: Oliver Kowalke :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: Formerly called Thread Pool The library provides: * thread creation policies: * determines the management of worker threads: * fixed set of threads in pool * create workerthreads on demand (depending on context) * let worker threads ime out after certain idle time * channel policies: manages access to queued tasks: * bounded channel with high and low watermark for queuing tasks * unbounded channel with unlimited number of queued tasks * rendezvous syncron hand-over between producer and consumer threads * queueing policy: determines how tasks will be removed from channel: * FIFO * LIFO * priority queue (attribute assigned to task) * smart insertions and extractions (for instance remove oldest task with certain attribute by newest one) * tasks can be chained and lazy submit of taks is also supported (thanks to Braddocks future library). * returns a task object from the submit function. The task it self can be interrupted if its is cooperative (means it has some interruption points in its code -> ``this_thread::interruption_point()`` ). Endian ------ :Author: Beman Dawes :Review Manager: Needed :Download: http://mysite.verizon.net/beman/endian-0.10.zip :Description: Conversion ---------- :Author: Vicente Botet :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=co… >`__ :Description: Generic explicit conversion between unrelated types. Boost.Conversion provides: * a generic ``convert_to`` function which can be specialized by the user to make explicit conversion between unrelated types. * a generic ``assign_to`` function which can be specialized by the user to make explicit assignation between unrelated types. * conversion between ``std::complex`` of explicitly convertible types. * conversion between ``std::pair`` of explicitly convertible types. * conversion between ``boost::optional`` of explicitly convertible types. * conversion between ``boost::rational`` of explicitly convertible types. * conversion between ``boost::interval`` of explicitly convertible types. * conversion between ``boost::chrono::time_point`` and ``boost::ptime``. * conversion between ``boost::chrono::duration`` and ``boost::time_duration``. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=al… >`__ :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 8X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 7X as fast as std::sort on x86 processors. string_sort is roughly 2X as fast as std::sort. GIL.IO ------ :Author: Christian Henning :Review Manager: Needed :Download: `GIL Google Code Vault <http://gil-contributions.googlecode.com/files/rc2.zip >`__ :Description: I/O extension for boost::gil which allows reading and writing of/in various image formats ( tiff, jpeg, png, etc ). This review will also include the Toolbox extension which adds some common functionality to gil, such as new color spaces, algorithms, etc. AutoBuffer ---------- :Author: Thorsten Ottosen :Review Manager: Needed :Download: `Here <http://www.cs.aau.dk/~nesotto/boost/ auto_buffer.zip>`__ :Description: Boost.AutoBuffer provides a container for efficient dynamic, local buffers. Furthermore, the container may be used as an alternative to std::vector, offering greater flexibility and sometimes better performance. String Convert -------------- :Author: Vladimir Batov :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: The library takes the approach of boost::lexical_cast in the area of string-to-type and type-to-string conversions, builds on the past boost::lexical_cast experience and advances that conversion functionality further to additionally provide: * throwing and non-throwing conversion-failure behavior; * support for the default value to be returned when conversion fails; * two types of the conversion-failure check -- basic and better/safe; * formatting support based on the standard I/O Streams and the standard (or user-defined) I/O Stream-based manipulators (like std::hex, std::scientific, etc.); * locale support; * support for boost::range-compliant char and wchar_t-based string containers; * no DefaultConstructibility requirement for the Target type; * consistent framework to uniformly incorporate any type-to-type conversions. It is an essential tool with applications making extensive use of configuration files or having to process/prepare considerable amounts of data in, say, XML, etc. Containers ---------- :Author: Ion Gaztanaga :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.… :Documentation: http://svn.boost.org/svn/boost/sandbox/move/libs/container/doc/html/index.h… :Description: Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that comply with C++03. Type Traits Extensions -------------------------- :Author: Frederic Bron :Review Manager: Needed :Download: http://svn.boost.org/trac/boost/browser/sandbox/type_traits :Description: The purpose of the addition is to add type traits to detect if types T and U are comparable in the sense of <, <=, >, >=, == or != operators, i.e. if t, >=, ==, !=). The following traits are added: is_equal_to_comparable<T,U> is_greater_comparable<T,U> is_greater_equal_comparable<T,U> is_less_comparable<T,U> is_less_equal_comparable<T,U> is_not_equal_to_comparable<T,U> The names are based on the corresponding names of the standard template library (<functional> header, section 20.3.3 of the standard). The code has the following properties: * returns true if t<u is meaningful and returns a value convertible to bool * returns false if t<u is meaningless. * fails with compile time error if t<u is meaningful and returns void (a possibility to avoid compile time error would be to return true with an operator, trick but this has little sens as returning false would be better) InterThreads ------------------- :Author: Vicente J. Botet Escriba :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=in… >`__ :Description: Boost.InterThreads extends Boost.Threads adding some features: * thread decorator: thread_decorator allows to define setup/cleanup functions which will be called only once by thread: setup before the thread function and cleanup at thread exit. * thread specific shared pointer: this is an extension of the thread_specific_ptr providing access to this thread specific context from other threads. As it is shared the stored pointer is a shared_ptr instead of a raw one. * thread keep alive mechanism: this mechanism allows to detect threads that do not prove that they are alive by calling to the keep_alive_point regularly. When a thread is declared dead a user provided function is called, which by default will abort the program. * thread tuple: defines a thread groupe where the number of threads is know statically and the threads are created at construction time. * set_once: a synchonizer that allows to set a variable only once, notifying to the variable value to whatever is waiting for that. * thread_tuple_once: an extension of the boost::thread_tuple which allows to join the thread finishing the first, using for that the set_once synchronizer. * thread_group_once: an extension of the boost::thread_group which allows to join the thread finishing the first, using for that the set_once synchronizer. (thread_decorator and thread_specific_shared_ptr) are based on the original implementation of threadalert written by Roland Schwarz. Boost.InterThreads extends Boost.Threads adding thread setup/cleanup decorator, thread specific shared pointer, thread keep alive mechanism and thread tuples. Bitfield --------------- :Author: Vicente J. Botet Escriba :Review Manager: Needed :Download: http://svn.boost.org/svn/boost/sandbox/bitfield with documentation available at http://svn.boost.org/svn/boost/sandbox/bitfield/libs/bitfield/doc/index.html :Description: Portable bitfields traits. Boost.Bitfield consists of: * a generic bitfield traits class providing generic getter and setter methods. * a BOOST_BITFIELD_DCL macro making easier the definition of the bitfield traits and the bitfield getter and setter functions. Lockfree ------------------ :Author: Tim Blechmann :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… ; :Documentation: http://tim.klingt.org/boost_lockfree/ :Description: boost.lockfree provides implementations of lock-free data structures. lock-free data structures can be accessed by multiple threads without the necessity of blocking synchronization primitives such as guards. lock-free data structures can be used in real-time systems, where blocking algorithms may lead to high worst-case execution times, to avoid priority inversion, or to increase the scalability for multi-processor machines. boost.lockfree provides: * boost::lockfree::fifo, a lock-free fifo queue * boost::lockfree::stack, a lock-free stack the code is available from from my personal git repository: * git://tim.klingt.org/boost_lockfree.git * http://tim.klingt.org/git?p=boost_lockfree.git Fiber ----- :Author: Oliver Kowalke :Review Manager: Needed Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… ; :Description: C++ Library for launching fibers (micro-threads) and synchronizing data between the fibers. Chrono ------ :Author: Vicente Botet :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=ch… ; :Documentation: http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht… . :Description: The Boost Chrono library provides: The C++0x Standard Library's common_type. The C++0x Standard Library's compile-time rational arithmetic. The C++0x Standard Library's time utilities, including: Class template duration Class template time_point Clocks: system_clock monotonic_clock high_resolution_clock typeof registration for classes duration and time_point Process clocks: process_real_CPU_clocks, capturing real-CPU times. process_user_CPU_clocks, capturing user-CPU times. process_system_CPU_clocks, capturing system-CPU times. process_cpu_clock, tuple-like class capturing at once real, user- CPU, and system-CPU times. Stopwatches: stopwatch, capturing elapsed Clock times. stopwatch_accumulator, capturing cummulated elapsed Clock times. scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. Stopclocks or Stopwatch reporters: stopwatch_reporter, convenient reporting of models of Stopwatch results. stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> Support wide characters for stopwatch formatters Sequence Properties ------------------- :Author: Grant Erickson :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=cr… :Description: The creasing algorithm templates define four template functions for determining the order properties of sequences, specifically: * Increasing * Decreasing * Strictly Increasing * Strictly Decreasing The implementation is a fairly trivial composition of the STL adjacent_find, not2 and {greater,less,greater_equal,less_equal}. For the purposes of sequence ordering validation, using these templates is more efficient and straightforward than creating a temporary, sorted version of some sequence and comparing it against the original sequence. Example: :: bool CheckPoints(const Points & inPoints) { const bool strictlyIncreasing = is_strictly_increasing(inPoints.begin(), inPoints.end()); if (!strictlyIncreasing) { cerr << "Points must be in increasing order with " "no duplicate values." << endl; } return strictlyIncreasing; } Static Size Linear Algebra -------------------------- :Author: Emil Dotchevski :Review Manager: Needed :Download: :Description: Locale ------ :Author: Artyom Beilis :Review Manager: Needed :Download: https://sourceforge.net/projects/cppcms/files/boost_locale/boost_locale_for… :Description: Boost.Locale is powerful localization library that provides powerful localization tool extending existing built-in C++ localization facilities in Unicode aware way. Libraries under development =========================== Persistent ---------- :Author: Tim Blechmann :Description: A library, based on Boost.Serialization, that provides access to persistent objects with an interface as close as possible to accessing regular objects in memory. * object ownership concepts equivalent to the ones used by Boost.SmartPtr: shared, weak, scoped (and raw) * ACID transactions, including recovery after a crash and "Serializable" isolation level * concurrent transactions, nested transactions, distributed transactions * concurrent access containers: STL containers whose nodes are implemented as persistent objects and can be accessed without moving the container to memory. Concurrent transactions modifying the container are only repeated in the rare cases the same container node is changed simultanisouly by 2 threads. * extensible by other transactional resources, e.g. an object relational mapper based on the upcoming Boost.Rdb library. Multiple resources can be combined to one database, with distributed transactions among them. Please let us know of any libraries you are currently developing that you intend to submit for review. See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

Problem with signals2 and shared_ptr
by Glenn Macgregor 26 May '10

26 May '10

Hi All, I am using boost 1.41.0 on Windows with Visual Studio 2008 and am seeing what seems to be an issue with signals2 and shared_ptr. The problem is that the shared_ptr does not decrement is reference count after I disconnect the signals2::connection. This is probably best illustrated with some code. ===== Test.h===== #ifndef _CLASS1_H #define _CLASS1_H #include <boost/signals2/signal.hpp> #include <boost/smart_ptr.hpp> class Callee : public boost::enable_shared_from_this<Callee> { public: Callee() : mInt(0) {}; virtual ~Callee() {}; void func1() { mInt++; }; private: int mInt; }; class Caller { public: typedef boost::signals2::signal<void (boost::shared_ptr<Callee>)> OnRun; public: Caller() : mOnRun() {}; ~Caller() {}; void run(boost::shared_ptr<Callee> sp) { boost::signals2::connection conn = mOnRun.connect(boost::bind(&Callee::func1, sp)); _sleep(1000); conn.disconnect(); }; private: OnRun mOnRun; }; #endif ===== End Test.h===== ======main.cpp====== int main(int argc, char **argv) { Caller caller; { boost::shared_ptr<Callee> sp(new Callee); caller.run(sp); } } ======End main.cpp====== Running this in the debugger I would expect to hit a breakpoint in the Callee class before the Caller class, this is not the case I destruct Caller before Callee. Having dug in a bit I see the use_count of the shared pointer go to 2 while in the caller.run which I would expect. The strange thing is the use_count does not decrement after the disconnect or exiting the caller.run function. Is there a way to force the connection/signal to release that shared_ptr? Thanks Glenn

2 1

lambda::bind with A::method throw (char*)
by Archie14 26 May '10

26 May '10

I have a problem compiling this: class A { public: void method(); void methodwiththrow() throw (char*); }; std::vector<A*> lst; // compiles OK. std::for_each (lst.begin(), lst.end(), boost::lambda::bind(&A::method, boost::lambda::_1)); // compile fails. std::for_each (lst.begin(), lst.end(), boost::lambda::bind(&A::methodwiththrow, boost::lambda::_1)); What might be the reason?

1 0

[ASIO|Thread] Advice for removing MFC/ afxwin.h dependancies
by smbrown＠teledyne.com 26 May '10

26 May '10

Hi all, I've inherited a windows C++ application which I've extended and that I'm now preparing for porting to Linux. I'm going through the app removing any MFC code replacing it with standard C++. I use Boost asio and thread and they seem to be requiring me to include afxwin.h before any boost includes or it won't build complaining that Winsock.h or Windows.h has alreday been included. I can bodge around those errors, but then the code doesn't link as new and delete have already been referenced from an afx lib. Is there any general advice for Boost/MFC coexistance or MFC removal? Thanks, Simon ++++ IMPORTANT NOTICE ++++ This email may contain confidential information and will be protected by copyright. It is intended only for the use of the person(s) to whom it is addressed and any unauthorised use (including forwarding or dissemination the contents) may be unlawful. If you receive this email by mistake, please advise the sender immediately by using the reply facility on your email software and delete the email from your computer. Opinions, conclusions and other information in this email that do not relate to the official business of this organisation shall be understood as neither given nor endorsed by it. If this message forms part of a quotation for the supply of goods, the quotation is an invitation to treat only. No contract will come into effect until the Company issuing such quotation issues an acknowledgment of order for the supply of such goods. The contract will be on the terms of such acknowledgment of order. ------------------------------------------------------------------------ Teledyne Defence Limited phone: +44 (0) 1274 531602 web: www.teledynedefence.co.uk ------------------------------------------------------------------------

3 9

boost::asio::deadline_timer::expires_at() seems to have a bug
by Hite, Christopher 26 May '10

26 May '10

See the #if below. I'm pretty sure these should do the same thing. The expires_from_now() version does what I'd expect and calls onTimer() once a second. The expires_at() version never calls onTimer(). Even though 'expires_at() const' returns 1s from now: doit now =2010-May-21 15:07:24.882854 expires_at =2010-May-21 15:07:25.882854 <and nothing more> //********************************************************************** *********** #include <boost/asio.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <iostream> using std::cout; using namespace boost::asio; using namespace boost::posix_time; io_service ioService; deadline_timer timer(ioService); seconds s1(1); void doit(); void onTimer(const boost::system::error_code&){ doit(); //repeat forever } void doit(){ ptime now=microsec_clock::local_time(); cout<< "doit now ="<< now <<std::endl; #if 0 timer.expires_from_now(s1); //works #else timer.expires_at( now+s1); //doesn't work #endif timer.async_wait( onTimer ); cout<< "expires_at ="<< timer.expires_at()<< std::endl ; } void timerTest(){ doit(); io_service::work w(ioService); ioService.run(); } int main(){ timerTest(); return 0; }

2 2

[preprocessor] one comma too many
by Manfred Doudar 26 May '10

26 May '10

Hello, Near sure this is trivial, but I don't see it, and hope someone might point out the obvious: #include <boost/preprocessor/iteration/local.hpp> #include <boost/preprocessor/repetition.hpp> #include <boost/preprocessor/repetition/enum_params.hpp> #define OPERATOR(z, n, _) \ \ BOOST_PP_ENUM_PARAMS(n, T r) /**/ #define BOOST_PP_LOCAL_MACRO(n) OPERATOR(_, n, _) #define BOOST_PP_LOCAL_LIMITS(1, 3) #include BOOST_PP_LOCAL_ITERATE() #undef BOOST_PP_LOCAL_MACRO #undef BOOST_PP_LOCAL_LIMITS #undef OPERATOR ..The above works as expected: T r0 T r0, T r1 T r0, T r1, T r2 However, I would like to replace "T" with the following instead: std::pair<T, T> ie: I want to write something to the effect of: BOOST_PP_ENUM_PARAMS(n, std::pair<T, T> r) Of course, BOOST_PP_ENUM_PARAMS now sees one too many arguments, and errors. Any ideas on how to achieve this would be most appreciated. With thanks in advance, -- Manfred

3 3

Exception on windows::stream_handle!
by Lloyd 26 May '10

26 May '10

Hello, We are trying to create a "windows::stream_handle" from a native Windows HANDLE. But it throws an exception with "The parameter is incorrect". The code is given below. What could be the reason? (Another IOservice is already running in the system) HANDLE FileHandle=CreateFile("MyFile",FILE_WRITE_DATA,0,NULL,CREATE_NEW,FILE_ATTRIBUTE_NORMAL,NULL); if(FileHandle==INVALID_HANDLE_VALUE) { return; } try { io_service ios; windows::stream_handle StreamHandle(ios,FileHandle); .... .... } catch(std::exception& e) { Log(e.what()); //The parameter is incorrect } Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

1 0

PropertyTree compatibility with Visual C++
by Warren Seine 26 May '10

26 May '10

Hi, I'm trying to port a C++ application to Microsoft Windows using the Visual C++ environment (Express edition, if it matters) and I'm having some trouble with Boost.PropertyTree. The following code works with GCC but fails to compile on Visual C++ 10.0: #include <boost/property_tree/ptree.hpp> int main() { using boost::property_tree::ptree; ptree pt; return 0; } Here is a sample of the output: [..]\boost\property_tree\detail\ptree_implementation.hpp(30): error C2440: 'specialization': cannot convert from 'const std::string std::_Pair_base<_Ty1,_Ty2>::* ' to 'const std::basic_string<_Elem,_Traits,_Ax> std::pair<_Ty1,_Ty2>::* ' with [ _Ty1=const std::string, _Ty2=boost::property_tree::basic_ptree<std::string,std::string> ] and [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char>, _Ty1=const std::string, _Ty2=boost::property_tree::basic_ptree<std::string,std::string> ] Can someone reproduce the bug? If so, is there some kind of workaround, even if it requires hacking the library? Thank you, -- Warren Seine

3 3

[thread] race condition detected with valgrind drd
by Jorge Moraleda 26 May '10

26 May '10

Dear all, I must be doing something wrong, but I can't figure out what. I would appreciate some help. Thank you in advance. The following program: #include <boost/thread.hpp> void threadEntry() { } int main (int argc, char *argv[]) { for(size_t t=0; t<10; t++) { boost::thread(threadEntry); } } runs cleanly with valgrind drd, but this other program produces race conditions when run with valgrind drd (see below). The only difference is "new". #include <boost/thread.hpp> void threadEntry() { } int main (int argc, char *argv[]) { for(size_t t=0; t<10; t++) { new boost::thread(threadEntry); } } This problem is not due to the leak, because this other program: #include <boost/thread.hpp> #include <boost/shared_ptr.hpp> void threadEntry() { } int main (int argc, char *argv[]) { std::vector<boost::shared_ptr<boost::thread> > threads; for(size_t t=0; t<10; t++) { boost::shared_ptr<boost::thread> thread(new boost::thread( threadEntry )); threads.push_back(thread); } for (size_t i = 0; i < threads.size(); ++i) { threads[i]->join(); } } which properly manages the heap also produces the same race conditions. I compile using: g++ -g -L /opt/boost/boost/stage/lib -lboost_thread threads.cpp and I test the program using valgrind using: valgrind --tool=drd ./a.out The output of valgrind is: ==3822== drd, a thread error detector ==3822== Copyright (C) 2006-2009, and GNU GPL'd, by Bart Van Assche. ==3822== Using Valgrind-3.5.0-Debian and LibVEX; rerun with -h for copyright info ==3822== Command: ./a.out ==3822== ==3822== Thread 3: ==3822== Conflicting store by thread 3 at 0x0504b350 size 8 ==3822== at 0x4E417B3: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== Allocation context: BSS section of /usr/local/lib/libboost_thread.so.1.42.0 ==3822== Other segment start (thread 2) ==3822== at 0x58D67D1: clone (clone.S:84) ==3822== by 0x5D7493F: ??? (allocatestack.c:743) ==3822== by 0x6B8A90F: ??? ==3822== Other segment end (thread 2) ==3822== at 0x5D7A7C4: pthread_once (pthread_once.S:119) ==3822== by 0x4C28ADD: pthread_once (drd_pthread_intercepts.c:518) ==3822== by 0x4E473B3: boost::detail::get_once_per_thread_epoch() (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E4172F: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== ==3822== Conflicting store by thread 3 at 0x0504b350 size 8 ==3822== at 0x4E417F9: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== Allocation context: BSS section of /usr/local/lib/libboost_thread.so.1.42.0 ==3822== Other segment start (thread 2) ==3822== at 0x58D67D1: clone (clone.S:84) ==3822== by 0x5D7493F: ??? (allocatestack.c:743) ==3822== by 0x6B8A90F: ??? ==3822== Other segment end (thread 2) ==3822== at 0x5D7A7C4: pthread_once (pthread_once.S:119) ==3822== by 0x4C28ADD: pthread_once (drd_pthread_intercepts.c:518) ==3822== by 0x4E473B3: boost::detail::get_once_per_thread_epoch() (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E4172F: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== Other segment start (thread 2) ==3822== at 0x58D67D1: clone (clone.S:84) ==3822== by 0x5D7493F: ??? (allocatestack.c:743) ==3822== by 0x6B8A90F: ??? ==3822== Other segment end (thread 2) ==3822== at 0x5D7A7C4: pthread_once (pthread_once.S:119) ==3822== by 0x4C28ADD: pthread_once (drd_pthread_intercepts.c:518) ==3822== by 0x4E473B3: boost::detail::get_once_per_thread_epoch() (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E4172F: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== ==3822== Conflicting load by thread 3 at 0x05f85288 size 8 ==3822== at 0x5D73AEE: __nptl_deallocate_tsd (pthread_create.c:153) ==3822== by 0x5D74A11: start_thread (pthread_create.c:307) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== Allocation context: BSS section of /lib/libpthread-2.10.1.so ==3822== Other segment start (thread 2) ==3822== at 0x58D67D1: clone (clone.S:84) ==3822== by 0x5D7493F: ??? (allocatestack.c:743) ==3822== by 0x6B8A90F: ??? ==3822== Other segment end (thread 2) ==3822== at 0x5D7A7C4: pthread_once (pthread_once.S:119) ==3822== by 0x4C28ADD: pthread_once (drd_pthread_intercepts.c:518) ==3822== by 0x4E473B3: boost::detail::get_once_per_thread_epoch() (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E4172F: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== ==3822== Thread 4: ==3822== Conflicting load by thread 4 at 0x0504b350 size 8 ==3822== at 0x4E41724: ??? (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E41B28: boost::detail::set_current_thread_data(boost::detail::thread_data_base*) (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4E42124: thread_proxy (in /usr/local/lib/libboost_thread.so.1.42.0) ==3822== by 0x4C32870: vgDrd_thread_wrapper (drd_pthread_intercepts.c:272) ==3822== by 0x5D74A03: start_thread (pthread_create.c:300) ==3822== by 0x58D680C: clone (clone.S:112) ==3822== Allocation context: BSS section of /usr/local/lib/libboost_thread.so.1.42.0 ==3822== Other segment start (thread 3) ==3822== (thread finished, call stack no longer available) ==3822== Other segment end (thread 3) ==3822== (thread finished, call stack no longer available) ==3822== Other segment start (thread 3) ==3822== (thread finished, call stack no longer available) ==3822== Other segment end (thread 3) ==3822== (thread finished, call stack no longer available) ==3822== ==3822== ==3822== For counts of detected and suppressed errors, rerun with: -v ==3822== ERROR SUMMARY: 11 errors from 4 contexts (suppressed: 126 from 76)

2 1

How to: get low level file descriptor for tcp::iostream
by Prince Singh 26 May '10

26 May '10

How to: get the low level file descriptor for a tcp::iostream ? -- Regards, Prince Singh Drishti-Soft Solutions Pvt Ltd 62-A, First Floor, Maruti Industrial Area, Sector - 18, Gurgaon - 122016 Haryana, India. W: http://www.drishti-soft.com B: http://blog.drishti-soft.com

2 2

[lambda] extract a constant subexpression by introspection
by alfC 26 May '10

26 May '10

Hello, I have a lambda expression that is suppoalways constructed as [some lambda expression] / ( _1 - c); where c is a double constant, for example c = 3.14. What I need is a function that given the expression returns the internal value of c, if that is possible: template<class LambdaExp> double c(LambdaExp expr){ ... return c in expr assuming that expr has the form [...]/(_1 - c) } The function may throw an exception or whatever if the expr is not of the form [...]/(_1 - c) Some additional infomation that maybe useful to simplify the solution: the lambda expression returns a double, _1 is meant to be a placeholder for double. optional feature: Also it would be ideal if the function could also recognize *simple* alternative expressions like [..]/(_1 + k) (and return -k) or [...]/( k + _1) (and return -k). Solutions using other lambda-like libraries are welcomed too. Thank you, Alfredo

1 1

[shared_ptr] Error in Constructor
by David A. Greene 26 May '10

26 May '10

Using boost 1.42, the attached fails to compile with g++: shared_ptr_test.cpp: In instantiation of ‘Wrapper<A>’: /usr/include/boost/smart_ptr/detail/sp_convertible.hpp:48: instantiated from ‘boost::detail::sp_convertible<Wrapper, Wrapper<A> >’ /usr/include/boost/smart_ptr/detail/sp_convertible.hpp:67: instantiated from ‘boost::detail::sp_enable_if_convertible<Wrapper, Wrapper<A> >’ shared_ptr_test.cpp:33: instantiated from here shared_ptr_test.cpp :14: error: invalid use of incomplete type ‘struct A’ shared_ptr_test.cpp:5: error: forward declaration of ‘struct A’ This is surprising to me as the code does not use A anywhere. I found BOOST_SP_NO_SP_CONVERTIBLE in shared_ptr.hpp and indeed turning that on fixes the problem. Unfortunately, it doesn't seem to be documented. What's the rationale for the enable_if'd constructor? Is BOOST_SP_NO_SP_CONVERTIBLE an official part of the library? Apparently it is causing gcc to check all doSomething members of Action against shared_ptr<Wrapper > and those checks are causing instantiations of Wrapper<A>. -Dave

3 5

[c++-sig]Python binding for templated constructor
by Sandeep Gupta 25 May '10

25 May '10

Hi, I have a class with a generic constructor as follows : class X { indexes m_idx; template<class strategy> X(){ build_indexes<strategy>() }; My problem is that I am not able to figure out the syntax to export this constructor. Is the above class not well defined ?. Thanks. Sandeep

1 0

Re: [Boost-users] [accumulators] Is there a reset function yet?
by Tim Odenthal 25 May '10

25 May '10

On Friday 21 May 2010 21:23:53 boost-users-request(a)lists.boost.org wrote: > > By the way, does the accumulator do something to prevent an overflow when > > I add up everything into one variable? > > No. It uses native intrinsics for raw performance. If you want anything > fancy, you can use your own UDT for samples that check for overflow. > Some construction required. :-( If you do build such a thing, I would > consider making it an official part of Accumulators. Well I'm absolutely no specialist in this, but for my averaging problem it would be enough to compare the "sum" and each new element to 0.5*std::numeric_limits<T>::max()-std::numeric_limits<T>::epsilon() and save the current value "somewhere" (a std::vector?) when this limit is reached. Then, at extraction, one would have to calculate the weighted sum of the entries of that vector. Do you think that's a good approach? > > > And does it prevent a loss of precision, > > when at a late stage the variable I sum everything into is very big, but > > the thing I add is very small? > > No. See above. Here (not being an expert in numerics) I have no clue how to tackle this. A certain loss of precision has to be accepted, probably, but how much is still acceptable? > > > Maybe it would be a good idea to mention this in the documentation, as > > well... > > Indeed. Could you file a ticket at http://svn.boost.org so this doesn't > get lost? Yes, did that. (Ticket #4255) > > Thanks, > > -- > Eric Niebler Thanks, Tim -- Dipl.-Phys. Tim Odenthal Division of Mechatronics, Biostatistics and Sensors (MeBioS) Email: Tim.Odenthal(a)biw.kuleuven.be Full details at http://www.kuleuven.be/cv/u0064388e.htm

1 0

gcc-xml and boost
by Bo Jensen 25 May '10

25 May '10

I am trying to extract function information from my project into a xml file with gcc-xml. The xml file is to be used to make wrappers for other languages. But I get the below failures. I just add all the include directives into a gcc options file and run it. Do I need to set some flags for gcc-xml to parse it correctly ? In file included from /root/src/types/basictypes.hpp:50, from /root/src/logging/logging.hpp:46, from /root/src/exceptions/exc.hpp:70, from ../model/model.hpp:29, from ../model/model.cpp:25: /external/boost/boost/filesystem/operations.hpp:510: error: expected identifier before 'class' /external/boost/boost/filesystem/operations.hpp:511: error: ISO C++ forbids declaration of 'fail_if_exists' with no type /external/boost/boost/filesystem/operations.hpp:511: error: ISO C++ forbids declaration of 'overwrite_if_exists' with no type /external/boost/boost/filesystem/operations.hpp:511: error: expected ';' before '}' token /external/boost/boost/filesystem/operations.hpp:511: error: expected `;' before '}' token /external/boost/boost/filesystem/operations.hpp:511: error: multiple types in one declaration /external/boost/boost/filesystem/operations.hpp:511: error: invalid use of non-static data member 'boost::filesystem::copy_option::fail_if_exists' /external/boost/boost/filesystem/operations.hpp:515: error: from this location /external/boost/boost/filesystem/operations.hpp: In function 'typename boost::enable_if<boost::filesystem::is_basic_path<Path>, void>::type boost::filesystem::copy_file(const Path&, const Path&, boost::filesystem::copy_option)': /external/boost/boost/filesystem/operations.hpp:511: error: invalid use of non-static data member 'boost::filesystem::copy_option::fail_if_exists' /external/boost/boost/filesystem/operations.hpp:519: error: from this location /usr/include/c++/4.4/cmath: In function 'typename __gnu_cxx::__enable_if<std::__is_arithmetic<_Tp>::__value, int>::__type std::fpclassify(_Tp) [with _Tp = float]': /external/boost/boost/functional/hash/detail/hash_float.hpp:65: instantiated from 'size_t boost::hash_detail::float_hash_value(T) [with T = float]' /external/boost/boost/functional/hash/hash.hpp:299: instantiated from here /usr/include/c++/4.4/cmath:501: error: '__builtin_fpclassify' was not declared in this scope /usr/include/c++/4.4/cmath: In function 'typename __gnu_cxx::__enable_if<std::__is_arithmetic<_Tp>::__value, int>::__type std::fpclassify(_Tp) [with _Tp = double]': /external/boost/boost/functional/hash/detail/hash_float.hpp:65: instantiated from 'size_t boost::hash_detail::float_hash_value(T) [with T = double]' /external/boost/boost/functional/hash/hash.hpp:304: instantiated from here /usr/include/c++/4.4/cmath:501: error: '__builtin_fpclassify' was not declared in this scope /usr/include/c++/4.4/cmath: In function 'typename __gnu_cxx::__enable_if<std::__is_arithmetic<_Tp>::__value, int>::__type std::fpclassify(_Tp) [with _Tp = long double]': /external/boost/boost/functional/hash/detail/hash_float.hpp:65: instantiated from 'size_t boost::hash_detail::float_hash_value(T) [with T = long double]' /external/boost/boost/functional/hash/hash.hpp:309: instantiated from here /usr/include/c++/4.4/cmath:501: error: '__builtin_fpclassify' was not declared in this scope

2 4

ASIO async IO, will the buffer corrupt?
by Lloyd 25 May '10

25 May '10

Hello, we are trying to write a high performane storage server. For that we are using Aynchronous IO with boost::asio. The data will be received at the storage server with the help of boost::asio::async_read(), and the data will be written to the storage with boost::asio::async_write() in the asyn_read() completion handler. Here we are planning to share the data buffer. The async read will be running in a loop, so if the write is not completed and if the next async_read() attempts to access the buffer, will the buffer be corrupted? If we use seperate buffer for each async_read()+async_write() operation, wouldn't it be inefficient? Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

2 2

How to make boost gil io_new extension be able to compile in VS2010?
by blp330 25 May '10

25 May '10

Hi, I post a issue on http://code.google.com/p/gil-contributions/issues/list But it seems like no one noticed. I am trying to compile my code in VS2010 but it will report me that: Detail message: Error 103 error C2668: 'boost::bind' : ambiguous call to overloaded function c:\program files\boost\boost_1_42_0\boost\gil\extension\io_new\detail\bit_operations.hpp line: 63 Does any one know how to solve this problem? Thanks. -- View this message in context: http://old.nabble.com/How-to-make-boost-gil-io_new-extension-be-able-to-com… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

boost::circular buffer- avoid memory allocation
by Lloyd 24 May '10

24 May '10

Hello, We are using circular buffer. The producer generates the data (a 1024byte char buffer) and the consumer reads it from circular buffer. In normal case the producer allocates the memory for each item. we believe this is very inefficient, so that we are going for circular buffer. How can we make the circualr buffer to allocate the memory in advace and make it possible for the producer and consumer to share it. For example if the buffer is of 10 nodes, the totoal memory allocated by circular buffer would be 10*1024, isn't it? How can the producer get the pointer to the next free node available in the circular buffer? (so as to avoid memory allocation by the producer) How can the consumer get pointer to the data to be read next? The sample available in boost::circular buffer describes it with a simple integer based example. I think this kind of problem is not addressed in it. Some hint will be very useful. Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

2 1

Re: [Boost-users] boost/numeric/ublas/matrix_sparse.hpp does not play well with RICE
by John O. Woods 24 May '10

24 May '10

Indeed, reversing the #include order seems to work. I thought I'd tried it, but it's compiling just fine now. Thanks so much, John > Date: Sat, 22 May 2010 12:18:02 -0400 > From: Nat Goodspeed <nat(a)lindenlab.com> > To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> > Subject: Re: [Boost-users] boost/numeric/ublas/matrix_sparse.hpp does > not play well with RICE > Message-ID: <55DB80E1-0E3B-456F-9C8D-E5650C62A409(a)lindenlab.com> > Content-Type: text/plain; charset=us-ascii; format=flowed; > delsp=yes > > On May 21, 2010, at 3:49 PM, "John O. Woods" > <john.woods(a)marcottelab.org> wrote: > > > I've included the current code below. It compiles perfectly if I > > comment the first line. > > > > #include <rice/Data_Type.hpp> > > #include <boost/numeric/ublas/matrix_sparse.hpp> > > int main() { return 0; } > > What if you reverse the order of the #includes? > >

3 2

Problem with bjam trying build Boost MPI
by iono sphere 24 May '10

24 May '10

Hello, I am trying to build MPI on WinXP, Visual C++ 2008 Express edition, trying to follow instructions at http://www.boost.org/doc/libs/1_43_0/doc/html/mpi/getting_started.html#mpi.…, but the problem is shown below: C:\boost_1_43_0>bjam --with-mpi --debug-configuration notice: found boost-build.jam at C:/boost_1_43_0/boost-build.jam notice: loading Boost.Build from C:/boost_1_43_0/tools/build/v2 notice: Searching C:\WINDOWS C:\Documents and Settings\user_a C:\Documents and S ettings\user_a C:\boost_1_43_0\tools/build/v2 C:/boost_1_43_0/tools/build/v2/ker nel C:/boost_1_43_0/tools/build/v2/util C:/boost_1_43_0/tools/build/v2/build C:/ boost_1_43_0/tools/build/v2/tools C:/boost_1_43_0/tools/build/v2/contrib C:/boos t_1_43_0/tools/build/v2/. for site-config configuration file site-config.jam . notice: Loading site-config configuration file site-config.jam from C:/boost_1_4 3_0/tools/build/v2/site-config.jam . notice: Searching C:\Documents and Settings\user_a C:\Documents and Settings\use r_a C:\boost_1_43_0\tools/build/v2 C:/boost_1_43_0/tools/build/v2/kernel C:/boos t_1_43_0/tools/build/v2/util C:/boost_1_43_0/tools/build/v2/build C:/boost_1_43_ 0/tools/build/v2/tools C:/boost_1_43_0/tools/build/v2/contrib C:/boost_1_43_0/to ols/build/v2/. for user-config configuration file user-config.jam . notice: Loading user-config configuration file user-config.jam from C:/Documents and Settings/user_a/user-config.jam . ===============MPI Auto-configuration=============== Did not find Microsoft Compute Cluster Pack in C:\Program Files\Microsoft Comput e Cluster Pack. warning: toolset mpi initialization: can not find tool mpic++ warning: initialized from C:/boost_1_43_0/tools/build/v2/build\project.jam:881 The system cannot find the path specified. The system cannot find the path specified. The system cannot find the path specified. MPI auto-detection failed: unknown wrapper compiler mpic++ Please report this error to the Boost mailing list: http://www.boost.org You will need to manually configure MPI support. warning: toolset mpi initialization: can not find tool mpirun warning: initialized from C:/boost_1_43_0/tools/build/v2/build\project.jam:881 MPI launcher: mpirun -np ... (1) I can see that bjam cannot find mpic++ and also, bjam displayed "The system cannot find the path specified.", do you know what paths are bjam referring to? Also, if I have mpic++, where should I put this so that bjam can detect it? (2) I already got myself a Windows IA32 (binary) of MPICH2 and installed. Because it's binary, there is no need to build. In the bin folder, I can see mpiexec.exe, but no mpic++. I am quite lost. I think I am on the wrong track. Normally, where can we acquire mpic++? Shouldn't it be distributed along with this MPI implementation as well?

2 1

[units][interval] adapt boost.interval for boost.units
by alfC 24 May '10

24 May '10

Hi, what is the best way to make boost.units work together with boost.interval. Something naive as boost::numeric::interval<boost::units::quantity<boost::units::si::energy> > iv(3.*boost::units::si::meter, 4.*boost::units::si::meter); doesn't compile because of an error in boost/numeric/interval/ checking.hpp (error attached below). A work around is to do a typedef suggest by http://lists.boost.org/boost-users/2009/07/49493.php typedef boost::numeric::interval_lib::change_checking< boost::numeric::interval< quantity<si::length> >, boost::units::interval::checking_base< quantity<si::length> > >::type interval_length_type; interval_length_type ival(3.*si::meter, 4.*si::meter); which compiles. do you think there is a better way?, that could allow for the first syntax at the beginning of this message. Thank you, Alfredo the compile error: /g/g91/correaa/usr/include/boost/numeric/interval/checking.hpp: In static member function 'static T boost::numeric::interval_lib::checking_base<T>::empty_lower() [with T = boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-0x00000000000000001l, 1l> >, boost::units::dimensionless_type>, boost::units::homogeneous_system<boost::units::list<boost::units::atomic::electron_mass_base_unit, boost::units::list<boost::units::atomic::elementary_charge_base_unit, boost::units::list<boost::units::atomic::reduced_planck_constant_base_unit, boost::units::list<boost::units::atomic::coulomb_force_constant_base_unit, boost::units::list<boost::units::atomic::boltzman_constant_base_unit, boost::units::dimensionless_type> > > > > >, void>, double>]': /g/g91/correaa/usr/include/boost/numeric/interval/checking.hpp:88: instantiated from 'static T boost::numeric::interval_lib::checking_no_empty<T, Checking, Exception>::empty_lower() [with T = boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-0x00000000000000001l, 1l> >, boost::units::dimensionless_type>, boost::units::homogeneous_system<boost::units::list<boost::units::atomic::electron_mass_base_unit, boost::units::list<boost::units::atomic::elementary_charge_base_unit, boost::units::list<boost::units::atomic::reduced_planck_constant_base_unit, boost::units::list<boost::units::atomic::coulomb_force_constant_base_unit, boost::units::list<boost::units::atomic::boltzman_constant_base_unit, boost::units::dimensionless_type> > > > > >, void>, double>, Checking = boost::numeric::interval_lib::checking_base<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-0x00000000000000001l, 1l> >, boost::units::dimensionless_type>, boost::units::homogeneous_system<boost::units::list<boost::units::atomic::electron_mass_base_unit, boost::units::list<boost::units::atomic::elementary_charge_base_unit, boost::units::list<boost::units::atomic::reduced_planck_constant_base_unit, boost::units::list<boost::units::atomic::coulomb_force_constant_base_unit, boost::units::list<boost::units::atomic::boltzman_constant_base_unit, boost::units::dimensionless_type> > > > > >, void>, double> >, Exception = boost::numeric::interval_lib::exception_create_empty]' /g/g91/correaa/usr/include/boost/numeric/interval/interval.hpp:269: instantiated from 'void boost::numeric::interval<T, Policies>::set_empty() [with T = boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-0x00000000000000001l, 1l> >, boost::units::dimensionless_type>, boost::units::homogeneous_system<boost::units::list<boost::units::atomic::electron_mass_base_unit, boost::units::list<boost::units::atomic::elementary_charge_base_unit, boost::units::list<boost::units::atomic::reduced_planck_constant_base_unit, boost::units::list<boost::units::atomic::coulomb_force_constant_base_unit, boost::units::list<boost::units::atomic::boltzman_constant_base_unit, boost::units::dimensionless_type> > > > > >, void>, double>, Policies = boost::numeric::interval_lib::policies<boost::numeric::interval_lib::rounded_math<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-0x00000000000000001l, 1l> >, boost::units::dimensionless_type>, boost::units::homogeneous_system<boost::units::list<boost::units::atomic::electron_mass_base_unit, boost::units::list<boost::units::atomic::elementary_charge_base_unit, boost::units::list<boost::units::atomic::reduced_planck_constant_base_unit, boost::units::list<boost::units::atomic::coulomb_force_constant_base_unit, boost::units::list<boost::units::atomic::boltzman_constant_base_unit, boost::units::dimensionless_type> > > > > >, void>, double> >, boost::numeric::interval_lib::checking_strict<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-0x00000000000000001l, 1l> >, boost::units::dimensionless_type>, boost::units::homogeneous_system<boost::units::list<boost::units::atomic::electron_mass_base_unit, boost::units::list<boost::units::atomic::elementary_charge_base_unit, boost::units::list<boost::units::atomic::reduced_planck_constant_base_unit, boost::units::list<boost::units::atomic::coulomb_force_constant_base_unit, boost::units::list<boost::units::atomic::boltzman_constant_base_unit, boost::units::dimensionless_type> > > > > >, void>, double> > >]' /g/g91/correaa/usr/include/boost/numeric/interval/interval.hpp:171: instantiated from 'boost::numeric::interval<T, Policies>::interval(const T&, const T&) [with T = boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-0x00000000000000001l, 1l> >, boost::units::dimensionless_type>, boost::units::homogeneous_system<boost::units::list<boost::units::atomic::electron_mass_base_unit, boost::units::list<boost::units::atomic::elementary_charge_base_unit, boost::units::list<boost::units::atomic::reduced_planck_constant_base_unit, boost::units::list<boost::units::atomic::coulomb_force_constant_base_unit, boost::units::list<boost::units::atomic::boltzman_constant_base_unit, boost::units::dimensionless_type> > > > > >, void>, double>, Policies = boost::numeric::interval_lib::policies<boost::numeric::interval_lib::rounded_math<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-0x00000000000000001l, 1l> >, boost::units::dimensionless_type>, boost::units::homogeneous_system<boost::units::list<boost::units::atomic::electron_mass_base_unit, boost::units::list<boost::units::atomic::elementary_charge_base_unit, boost::units::list<boost::units::atomic::reduced_planck_constant_base_unit, boost::units::list<boost::units::atomic::coulomb_force_constant_base_unit, boost::units::list<boost::units::atomic::boltzman_constant_base_unit, boost::units::dimensionless_type> > > > > >, void>, double> >, boost::numeric::interval_lib::checking_strict<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-0x00000000000000001l, 1l> >, boost::units::dimensionless_type>, boost::units::homogeneous_system<boost::units::list<boost::units::atomic::electron_mass_base_unit, boost::units::list<boost::units::atomic::elementary_charge_base_unit, boost::units::list<boost::units::atomic::reduced_planck_constant_base_unit, boost::units::list<boost::units::atomic::coulomb_force_constant_base_unit, boost::units::list<boost::units::atomic::boltzman_constant_base_unit, boost::units::dimensionless_type> > > > > >, void>, double> > >]' lindhard.cpp:205: instantiated from here /g/g91/correaa/usr/include/boost/numeric/interval/checking.hpp:63: error: no matching function for call to 'boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-0x00000000000000001l, 1l> >, boost::units::dimensionless_type>, boost::units::homogeneous_system<boost::units::list<boost::units::atomic::electron_mass_base_unit, boost::units::list<boost::units::atomic::elementary_charge_base_unit, boost::units::list<boost::units::atomic::reduced_planck_constant_base_unit, boost::units::list<boost::units::atomic::coulomb_force_constant_base_unit, boost::units::list<boost::units::atomic::boltzman_constant_base_unit, boost::units::dimensionless_type> > > > > >, void>, double>::quantity(int)' compilation terminated due to -Wfatal-errors.

1 1

Auto dispatch metaprogramming tricks
by Alexander Lamaison 24 May '10

24 May '10

I would like to dispatch messages to a class based simply on the *presence* of a message handler method. Currently, the classes maintain an MPL vector of the messages they handle and must implement a on(message<MESSAGE_ID>) method for each one. The dispatcher uses this compile-time list to build the dispatching code. This means the information is maintained twice and may fall out of sync (e.g. adding the handler but forgetting to update the message vector. Are there any template metaprogramming tricks I can employ to dispatch the message to a handler method if it exists and the default handler otherwise? All this information is available at compile time. The question is are templates are powerful enough to make use of it? Many thanks. Alex

7 18

boost::reg_expression and basic_regex
by Senthil Nathan 24 May '10

24 May '10

Hi, I have been using the regular expressions with the older version of boost::regex, But with the latest version I'm getting the below error. I understand reg_expression is deprecated and need to use basic_regex. But even with that, its the same error. Any ideas on this, would be more useful. typedef boost::reg_expression<char, boost::c_regex_traits<char>, ntl::list_alloc<char> > Exp_type; ../../../include/expr/ExprEngine.h:38: error: wrong number of template arguments (3, should be 2) ../../../include/boost/regex/v4/basic_regex.hpp:597: error: provided for 'template<class charT, class traits> class boost::reg_expression' Thanks rsennat

2 1

Help on creating a custom InputIterator for boost graph adjacency_list()
by Cedric Laczny 24 May '10

24 May '10

Hi, I have a graph with quite some information stored in its vertices and edges. Now I would like to perform some analyses on the general overall topology of the graph. Therefore I don't need this "big graph" but only a graph that has the same number of nodes and matching edges to the "big graph". To this end, I wanted to use the adjacency_list() constructor together with an EdgeIterator that models the InputIterator so the routines of the boost-graph library would take care of creating the new "simple graph", which indeed would be a nice solution. However, I just don't get it how to program an EdgeIterator with the following constraints (taken from http://www.boost.org/doc/libs/1_43_0/libs/graph/doc/adjacency_list.html) The EdgeIterator must be a model of InputIterator. The value type of the EdgeIterator must be a std::pair, where the type in the pair is an integer type. Here's what I experimented with so far: <--- Code ---> template< class EdgeIterator, class Edge > class MyEdgeIterator// : public input_iterator< std::pair<int, int> > { public: MyEdgeIterator() {}; MyEdgeIterator(EdgeIterator& rhs) : actual_edge_it_(rhs) {}; MyEdgeIterator(const MyEdgeIterator& to_copy) {}; bool operator==(const MyEdgeIterator& to_compare) { return actual_edge_it_ == to_compare.actual_edge_it_; } bool operator!=(const MyEdgeIterator& to_compare) { return !(*this == to_compare); } Edge operator*() const { return *actual_edge_it_; } const MyEdgeIterator* operator->() const; MyEdgeIterator& operator ++() { ++actual_edge_it_; return *this; } MyEdgeIterator operator ++(int) { MyEdgeIterator<EdgeIterator, Edge> tmp = *this; ++*this; return tmp; } private: EdgeIterator& actual_edge_it_; } <--- Code-End ---> Especially, I'm having trouble with the fact that the EdgeIterator must return a pair of the vertex indices that the actual edge "points to". I think that this must include something like get(vertex_index_t, adjacency_list(...), source(*EdgeIterator, adjacency_list(...)). But this would mean that e.g. MyEdgeIterator would additionally need the vertex- property map of vetex indices. This seems a bit too much information packed into this one, small iterator. Thank you. Best regards, Cedric

3 6

[BGL] What's the problem when the dijkstra_shortest_paths is used with stanford_graph
by smallpang smallpang 24 May '10

24 May '10

dear everyone I want to construct multicast tree base on the network topology generated by the stanford graph. The source code below can run without error, and have the right output: *The file is open! m:28 n:10 * But when I add the algrithom dijkstra_shortest_paths. The error messages show as below: *Description Resource Path Location Type no matching function for call to ‘num_vertices(Graph* const&)’ MulticastTree2 line 190, external location: /usr/include/boost/graph/dijkstra_shortest_paths.hpp C/C++ Problem Description Resource Path Location Type no matching function for call to ‘out_edges(Vertex*&, Graph* const&)’ MulticastTree2 line 76, external location: /usr/include/boost/graph/breadth_first_search.hpp C/C++ Problem Description Resource Path Location Type no matching function for call to ‘vertices(Graph* const&)’ MulticastTree2 line 375, external location: /usr/include/boost/graph/dijkstra_shortest_paths.hpp C/C++ Problem* I find the num_vertices\out_edges\vertices are redefined in the stanford_graph.hpp. So I change the order of the include files as below: *#include <boost/graph/stanford_graph.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp>* The errors above disappear, and New errors come up: *Description Resource Path Location Type ‘g’ was not declared in this scope MulticastTree2 line 408, external location: /usr/include/boost/graph/named_function_params.hpp C/C++ Problem Description Resource Path Location Type ‘t’ was not declared in this scope MulticastTree2 line 408, external location: /usr/include/boost/graph/named_function_params.hpp C/C++ Problem Description Resource Path Location Type ‘u’ was not declared in this scope MulticastTree2 line 463, external location: /usr/include/boost/pending/relaxed_heap.hpp C/C++ Problem Description Resource Path Location Type expected ‘,’ or ‘...’ before ‘.’ token MulticastTree2 line 402, external location: /usr/include/boost/graph/named_function_params.hpp C/C++ Problem Description Resource Path Location Type expected initializer before ‘.’ token MulticastTree2 line 462, external location: /usr/include/boost/pending/relaxed_heap.hpp C/C++ Problem* It's confusing for me, can you tell me what's the problem is and any way i can try to solve the problems above. Thank you. source code: *#include <boost/config.hpp> #include <iostream> #include <string> #include <fstream> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/stanford_graph.hpp> using namespace boost; int main(int argc, char *argv[]) { Graph* inputG; char *in_filename = "r10-0.gb"; inputG = restore_graph(in_filename); if (inputG){ std::cout << "The file is open!" << "\n"; std::cout << "m:" << inputG->m << "\n"; std::cout << "n:" << inputG->n << "\n"; } else return 0; graph_traits<Graph*>::vertex_descriptor s = *boost::vertices(inputG).first; typedef property_map<Graph*, z_property<long> >::type Distance; Distance d = get(z_property<long>(), inputG); typedef property_map<Graph*, w_property<Vertex*> >::type Parent; Parent p = get(w_property<Vertex*>(), inputG); // dijkstra_shortest_paths(inputG, s, // predecessor_map(get(w_property<Vertex*>(), inputG)). // distance_map(get(z_property<long>(), inputG)). // weight_map(get(edge_length_t(), inputG)) // ); gb_recycle(inputG); return 1; }*

2 2

'Undefined symbols' error when building Mira Groupware on Mac OS X
by Max Bossino 23 May '10

23 May '10

Hi all, I'm having some trouble compiling an app (Mira Groupware of http://miragroupware.org) which uses the Boost 1.42 libraries, on Mac OS X. It's exiting during the 'make' stage with an error about 'Undefined symbols'. I would really appreciate it if someone could offer a helping hand! Judging by the output of CMake, the Boost files are installed and can be found (I've cropped the output to highlight the bit about Boost): ----- MBP:build Max$ cmake ./ -- The C compiler identification is GNU -- The CXX compiler identification is GNU [...] -- Boost version: 1.42.0 -- Found the following Boost libraries: -- thread -- signals -- system -- filesystem ** Mira found Boost version 104200 [...] -- Configuring done -- Generating done -- Build files have been written to: /Users/Max/Documents/Projects/Mira/Branches/build ----- However, this is what happens while trying to 'make' the Server: ----- MBP:mirs Max$ make [ 6%] Built target mira Scanning dependencies of target Files-utility [ 13%] Building CXX object CMakeFiles/Files-utility.dir/src/utilities/files/files.cpp.o [ 20%] Building CXX object CMakeFiles/Files-utility.dir/src/utilities/files/FileUtility.cpp.o [ 26%] Building CXX object CMakeFiles/Files-utility.dir/src/utilities/files/FileServer.cpp.o [ 33%] Building CXX object CMakeFiles/Files-utility.dir/src/utilities/files/FileConnection.cpp.o Linking CXX shared library bin/libFiles-utility.dylib Undefined symbols: "boost::filesystem::detail::remove_api(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)", referenced from: bool boost::filesystem::detail::remove_aux<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >(boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> const&, boost::filesystem::file_status)in FileUtility.cpp.o "boost::system::get_system_category()", referenced from: boost::asio::error::get_system_category() in files.cpp.o boost::system::error_code::error_code()in files.cpp.o __static_initialization_and_destruction_0(int, int)in files.cpp.o __static_initialization_and_destruction_0(int, int)in files.cpp.o boost::system::error_code::error_code()in FileUtility.cpp.o __static_initialization_and_destruction_0(int, int)in FileUtility.cpp.o __static_initialization_and_destruction_0(int, int)in FileUtility.cpp.o boost::asio::error::get_system_category() in FileServer.cpp.o boost::system::error_code::error_code()in FileServer.cpp.o __static_initialization_and_destruction_0(int, int)in FileServer.cpp.o __static_initialization_and_destruction_0(int, int)in FileServer.cpp.o boost::asio::error::get_system_category() in FileConnection.cpp.o boost::system::error_code::error_code()in FileConnection.cpp.o __static_initialization_and_destruction_0(int, int)in FileConnection.cpp.o __static_initialization_and_destruction_0(int, int)in FileConnection.cpp.o "typeinfo for boost::detail::thread_data_base", referenced from: typeinfo for boost::detail::thread_data<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileServer>, boost::_bi::list1<boost::_bi::value<FileServer*> > > >in files.cpp.o typeinfo for boost::detail::thread_data<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileConnection>, boost::_bi::list1<boost::_bi::value<FileConnection*> > > >in FileServer.cpp.o "boost::thread::start_thread()", referenced from: boost::thread::thread<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileServer>, boost::_bi::list1<boost::_bi::value<FileServer*> > > >(boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileServer>, boost::_bi::list1<boost::_bi::value<FileServer*> > >, boost::disable_if<boost::is_convertible<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileServer>, boost::_bi::list1<boost::_bi::value<FileServer*> > >&, boost::detail::thread_move_t<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileServer>, boost::_bi::list1<boost::_bi::value<FileServer*> > > > >, boost::thread::dummy*>::type)in files.cpp.o boost::thread::thread<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileConnection>, boost::_bi::list1<boost::_bi::value<FileConnection*> > > >(boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileConnection>, boost::_bi::list1<boost::_bi::value<FileConnection*> > >, boost::disable_if<boost::is_convertible<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileConnection>, boost::_bi::list1<boost::_bi::value<FileConnection*> > >&, boost::detail::thread_move_t<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileConnection>, boost::_bi::list1<boost::_bi::value<FileConnection*> > > > >, boost::thread::dummy*>::type)in FileServer.cpp.o "boost::filesystem::detail::not_found_error()", referenced from: boost::filesystem::basic_directory_iterator<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >::m_init(boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> const&)in FileUtility.cpp.o "boost::filesystem::detail::symlink_status_api(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, boost::system::error_code&)", referenced from: boost::enable_if<boost::filesystem::is_basic_path<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >, boost::filesystem::file_status>::type boost::filesystem::symlink_status<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >(boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> const&, boost::system::error_code&)in FileUtility.cpp.o "boost::detail::thread_data_base::~thread_data_base()", referenced from: boost::detail::thread_data<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileServer>, boost::_bi::list1<boost::_bi::value<FileServer*> > > >::~thread_data()in files.cpp.o boost::detail::thread_data<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileServer>, boost::_bi::list1<boost::_bi::value<FileServer*> > > >::~thread_data()in files.cpp.o boost::detail::thread_data<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileConnection>, boost::_bi::list1<boost::_bi::value<FileConnection*> > > >::~thread_data()in FileServer.cpp.o boost::detail::thread_data<boost::_bi::bind_t<void, boost::_mfi::mf0<void, FileConnection>, boost::_bi::list1<boost::_bi::value<FileConnection*> > > >::~thread_data()in FileServer.cpp.o "vtable for boost::detail::thread_data_base", referenced from: boost::detail::thread_data_base::thread_data_base()in files.cpp.o boost::detail::thread_data_base::thread_data_base()in FileServer.cpp.o "boost::thread::~thread()", referenced from: _initialize in files.cpp.o FileServer::run() in FileServer.cpp.o "boost::filesystem::detail::dir_itr_first(void*&, void*&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> >&, boost::filesystem::file_status&, boost::filesystem::file_status&)", referenced from: boost::filesystem::basic_directory_iterator<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >::m_init(boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> const&)in FileUtility.cpp.o "boost::filesystem::detail::file_size_api(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)", referenced from: boost::enable_if<boost::filesystem::is_basic_path<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >, unsigned long>::type boost::filesystem::file_size<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >(boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> const&)in FileConnection.cpp.o "boost::filesystem::detail::dir_itr_increment(void*&, void*&, std::basic_string<char, std::char_traits<char>, std::allocator<char> >&, boost::filesystem::file_status&, boost::filesystem::file_status&)", referenced from: boost::filesystem::basic_directory_iterator<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >::increment()in FileUtility.cpp.o "boost::filesystem::detail::create_directory_api(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)", referenced from: boost::enable_if<boost::filesystem::is_basic_path<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >, bool>::type boost::filesystem::create_directory<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >(boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> const&)in FileUtility.cpp.o "boost::system::get_generic_category()", referenced from: __static_initialization_and_destruction_0(int, int)in files.cpp.o __static_initialization_and_destruction_0(int, int)in files.cpp.o __static_initialization_and_destruction_0(int, int)in files.cpp.o __static_initialization_and_destruction_0(int, int)in FileUtility.cpp.o __static_initialization_and_destruction_0(int, int)in FileUtility.cpp.o __static_initialization_and_destruction_0(int, int)in FileUtility.cpp.o __static_initialization_and_destruction_0(int, int)in FileServer.cpp.o __static_initialization_and_destruction_0(int, int)in FileServer.cpp.o __static_initialization_and_destruction_0(int, int)in FileServer.cpp.o __static_initialization_and_destruction_0(int, int)in FileConnection.cpp.o __static_initialization_and_destruction_0(int, int)in FileConnection.cpp.o __static_initialization_and_destruction_0(int, int)in FileConnection.cpp.o "boost::filesystem::detail::status_api(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, boost::system::error_code&)", referenced from: boost::enable_if<boost::filesystem::is_basic_path<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >, bool>::type boost::filesystem::exists<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >(boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> const&)in FileUtility.cpp.o "boost::filesystem::detail::dir_itr_close(void*&, void*&)", referenced from: boost::filesystem::detail::dir_itr_imp<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >::~dir_itr_imp()in FileUtility.cpp.o ld: symbol(s) not found collect2: ld returned 1 exit status make[2]: *** [bin/libFiles-utility.dylib] Error 1 make[1]: *** [CMakeFiles/Files-utility.dir/all] Error 2 make: *** [all] Error 2 ----- The Client exits with a similar error during the build process. Would anyone know why this issue is occurring, and how I could fix it? Thank you in advance. Regards, Max Bossino Project Manager http://miragroupware.org

2 8

[ASIO] async_read buffer: starting byte null
by Matty Spatty 23 May '10

23 May '10

Hello, I have encountered a problem with some code that I cannot get my head around, I have spent quite a while looking for solutions but nothing has come up. When the client sends the first packet it is read fine but the header(first 8 bytes) for the second packet ALWAYS goes wrong, the first byte in the buffer is always null and the rest of the packet is pushed down the char array, e.g. I have done plenty of checks on the data the client sends: Client sends 00080002 Header reads _0008000 Client sends 0008TEST Header reads _0008TES (with _ as null) CODE: This is the first call to async_read, called when the client has connected ----------------- void CClient::start() { Log(MSG_INFO, "[%i] Connected", socket_.native()); boost::asio::async_read(socket_, boost::asio::buffer(packet_.buffer(), CPacket::headerSize), boost::bind(&CClient::recvHeader, shared_from_this(), boost::asio::placeholders::error) ); } The rest of the async_read's are called here ----------------- void CClient::recvMessage(const boost::system::error_code& error) { if (!error && handleMessage()) { packet_.reset(); boost::asio::async_read(socket_, boost::asio::buffer(packet_.buffer(), CPacket::headerSize), boost::bind(&CClient::recvHeader, shared_from_this(), boost::asio::placeholders::error) ); } else { disconnect(); } } Thanks in adavnce, Matty. P.S. I am very inexperienced with boost and not great at C++ so if you see anything I could improve, feedback would be appreciated.

2 4

Building Boost MPI, but no .lib are being built at all. Do you know what is going on?
by iono sphere 23 May '10

23 May '10

I am trying to run a program with Boost MPI, but the thing is I don't have the .lib. So I try to create one by following the instruction at http://www.boost.org/doc/libs/1_43_0/doc/html/mpi/getting_started.html#mpi.… The instruction says "For many users using LAM/MPI, MPICH, or OpenMPI, configuration is almost automatic", I got myself OpenMPI in C:\, but I didn't do anything more with it. Do we need to do anything with it? I also got myself MPICH2 in Program Files, and didn't do anything more with it as well. At this point of the instruction is where I am quite unsure about what exactly do we have to do. Beside that, another statement from the instruction: "If you don't already have a file user-config.jam in your home directory, copy tools/build/v2/user-config.jam there." Well, I simply do what it says. I got myself "user-config.jam" in C:\boost_1_43_0> along with "using mpi ;" into the file. Next, this is what I've done: bjam --with-mpi C:\boost_1_43_0>bjam --with-mpi WARNING: No python installation configured and autoconfiguration failed. See http://www.boost.org/libs/python/doc/building.html for configuration instructions or pass --without-python to suppress this message and silently skip all Boost.Python targets Building the Boost C++ Libraries. warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. warning: Unable to construct ./stage-unversioned warning: Unable to construct ./stage-unversioned Component configuration: - date_time : not building - filesystem : not building - graph : not building - graph_parallel : not building - iostreams : not building - math : not building - mpi : building - program_options : not building - python : not building - random : not building - regex : not building - serialization : not building - signals : not building - system : not building - test : not building - thread : not building - wave : not building ...found 1 target... The Boost C++ Libraries were successfully built! The following directory should be added to compiler include paths: C:\boost_1_43_0 The following directory should be added to linker library paths: C:\boost_1_43_0\stage\lib C:\boost_1_43_0> I see that there are many libs in C:\boost_1_43_0\stage\lib, but I see no trace of libboost_mpi-vc100-mt-1_43.lib or libboost_mpi-vc100-mt-gd-1_43.lib at all. These are the libraries required for linking in mpi applications. What could possibly gone wrong when libraries are not being built?

2 1

ASIO HTTP Server 3 Example: sharing stack data between threads
by Aaron Riekenberg 23 May '10

23 May '10

I was reading through the ASIO HTTP Server 3 example (http://tinyurl.com/35hwtd5) that uses a thread pool to call io_service::run. In both posix_main.cpp and win_main.cpp an http::server3::server object is created on the stack in main(). server has a boost::asio::io_service member (io_service_). main calls server::run, which creates a pool of threads that each call io_service_.run. So at this point the io_service_ object is within main's stack is being shared by multiple threads. Am I missing something or is this a bad thing to do and encourage others to copy? Seems like a simple fix would be to allocate the server object in main on the heap. Thanks, Aaron Riekenberg

2 1

How to deduce (possibly void) return type of member function?
by Terry Golubiewski 23 May '10

23 May '10

If I have a class... struct X { int f(double x); void f(int y); }; ... and a template Y that wants to deduce the return-type of some member functions of T... template<class T> struct Y { typedef typename what_goes_here<T>::type f_double_return_type; typedef typename what_goes here<T>::type f_int_return_type; }; I"ve tried using... typedef BOOST_TYPEOF_TPL(static_cast<X*>(0)->f(double(0))) f_double_type; // this works ... but ... typedef BOOST_TYPEOF_TPL(static_cast<X*>(0)->f(int(0)) f_int_type; // does not work for "void" Of course, I wouldn't know which one returns "void" or not ahead of time. terry

2 5

[profile_templates] Unable to run the template profiler
by Nathan Crookston 22 May '10

22 May '10

All, A template metaprogram I've written consumes too much memory when compiling on VC8. To debug this, I'm trying to use Steven Watanabe's template profiler. Unfortunately, I've been unable to run it successfully on my code. After some casting about I found [1] which resolved some initial problems, it seems. As a sanity check, I tried the following: ncrookston: ~/boost/tools/profile_templates/test $ bjam toolset=msvc error: Unable to find file or target named error: '/boost//regex' error: referred from project at error: '../src I'm definitely not a bjam/boost-build expert. Does anyone have suggestions on how I can fix this? My platform: XP 32-bit using VIsual Studio 2005 (VC8) Thanks, Nate [1] <http://lists.boost.org/Archives/boost/2009/05/152016.php>

3 3

Re: [Boost-users] [msm] submachine interaction
by Christophe Henry 22 May '10

22 May '10

> Hello - > > I've created a state machine in MSM successfully, but cannot figure > out how to interact with a submachine state object. > > Using the tutorial machine in "Defining a submachine", can a playlist > be provided to Playing? I'd like to call a constructor, or a 2 stage > init function of Playing, but haven't figure out how. > > I could use the "FSM" parameter of the on_entry method of the > submachine to pull the playlist, but it appears that FSM is the > submachine itself (Playing), not the containing machine (Player) as it > is for regular states. > > Thanks for you help, > Gordon Smith Hi Gordon, You could call "get_state<player_::Playing&>()" on the player instance but I agree that the current behavior makes little sense, so I just changed it. The "FSM" parameter of on_entry (and on_exit) for a submachine now will be the containing machine (player), so that submachines' entry and exit conditions get the same parameters as substates. Of course, substates of the submachine still get as FSM parameter the submachine, not the containing machine. As we are still far from the release, we still have time to make this change. Should I have broken somebody's code, please shout ;-) I now moved MSM to the trunk, and all changes are now done there, so you need to get: https://svn.boost.org/svn/boost/trunk/boost/msm/back/state_machine.hpp (it is also in the sandbox, just in case). Thanks for the report, Christophe

1 0

Need example of substitution of priority queue
by Eric Fowler 22 May '10

22 May '10

I wish to run a breadth_first_search() on a graph where I am defining the priority queue (I have a hand-rolled sort order). Is there any reason I cannot use std::priority_queue<> to do this? Does anyone have an example, or know of one in the docs? Thanks Eric

2 5

Re: [Boost-users] boost/numeric/ublas/matrix_sparse.hpp does not play well with RICE
by John O. Woods 22 May '10

22 May '10

I have partially resolved the issue. I deleted all boost libraries and headers from my machine and clean re-compiled and installed 1.43. I can now compile with unordered_map successfully. I suspect the compiler was using one version of the libraries and a different version of the headers. Unfortunately, I still cannot #include <boost/numeric/ublas/matrix_sparse.hpp> while also including rice/Data_Type and rice/Constructor. The #undefs Steven recommended don't appear to make a difference. I've included the current code below. It compiles perfectly if I comment the first line. If I replace the Data_Type.hpp header with a different rice header, it still doesn't work -- I've tried Class.hpp, String.hpp, Object.hpp, and Constructor.hpp. FYI, here's the address for rice: http://rice.rubyforge.org/main.html Thanks again, John #include <rice/Data_Type.hpp> #include <boost/numeric/ublas/matrix_sparse.hpp> int main() { return 0; } $ make g++ -I. -I. -I/usr/lib/ruby/1.8/i486-linux -I. -D_FILE_OFFSET_BITS=64 -I/usr/lib/ruby/gems/1.8/gems/rice-1.3.2/ruby/lib/include -fPIC -fno-strict-aliasing -g -g -O2 -fPIC -Wall -g -c main.cpp In file included from /usr/local/include/boost/numeric/ublas/storage_sparse.hpp:23, from /usr/local/include/boost/numeric/ublas/vector_sparse.hpp:16, from /usr/local/include/boost/numeric/ublas/matrix_sparse.hpp:16, from main.cpp:2: /usr/local/include/boost/numeric/ublas/storage.hpp:60: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp:65: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp:79: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp: In member function ‘typename ALLOC::size_type boost::numeric::ublas::unbounded_array<T, ALLOC>::max_size() const’: /usr/local/include/boost/numeric/ublas/storage.hpp:174: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp:174: error: expected ‘;’ before ‘ruby_xmalloc’ /usr/local/include/boost/numeric/ublas/storage.hpp:174: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp: In member function ‘typename ALLOC::size_type boost::numeric::ublas::bounded_array<T, N, ALLOC>::max_size() const’: /usr/local/include/boost/numeric/ublas/storage.hpp:357: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp:357: error: expected ‘;’ before ‘ruby_xmalloc’ /usr/local/include/boost/numeric/ublas/storage.hpp:357: error: expected primary-expression before ‘)’ token In file included from /usr/local/include/boost/numeric/ublas/vector_sparse.hpp:16, from /usr/local/include/boost/numeric/ublas/matrix_sparse.hpp:16, from main.cpp:2: /usr/local/include/boost/numeric/ublas/storage_sparse.hpp: At global scope: /usr/local/include/boost/numeric/ublas/storage_sparse.hpp:240: error: expected primary-expression before ‘)’ token make: *** [main.o] Error 1

4 3

Inconsistent with variant with bool
by Robin 22 May '10

22 May '10

Hi I'm facing a inconsistent behavior with Variant when bool is defined. The below code will return i as 0 typedef boost::variant <int> VariantType; VariantType variant; int i = boost::get <int> (variant)); // default to 0 If I set a bool in the variant typedef boost::variant <bool, int> VariantType; VariantType variant; int i = boost::get <int> (variant)); // this throws fail get Is it intended behavior? Robin

3 2

Sentinel vertex?
by Eric Fowler 22 May '10

22 May '10

Does BGL define a sentinel value that is always invalid as a vertex? I am thinking of something analogous to the null char at the end of ASCIIZ strings. Eric

2 1

Boost.MPI 1.43.0 and openmpi 1.4.2 problems
by Benjamin Behringer 22 May '10

22 May '10

Hi, I'm new to boost and openmpi. I'm on a Mac installed the newest version of openmpi through "port" and compiled boost by myself. There is also an openmpi version coming with my Mac in version 1.2.8. I tried to compile and run a small sample but ran into different problems. So the following example won't work for me with openmpi 1.4.2 (through port) but with openmpi 1.2.8: #include <boost/mpi.hpp> #include <iostream> #include <string> #include <boost/serialization/string.hpp> namespace mpi = boost::mpi; int main(int argc, char* argv[]) { mpi::environment env(argc, argv); mpi::communicator world; if (world.rank() == 0) { world.send(1, 0, std::string("Hello")); std::string msg; world.recv(1, 1, msg); std::cout << msg << "!" << std::endl; } else { std::string msg; world.recv(0, 0, msg); std::cout << msg << ", "; std::cout.flush(); world.send(0, 1, std::string("world")); } return 0; } I compiled with (1.4.2): openmpic++ boost_mpi_test.cpp -lboost_mpi -lboost_serialization -o boost_mpi_test Running that test says: openmpirun -np 2 boost_mpi_test *** The MPI_Pack_size() function was called before MPI_INIT was invoked. *** This is disallowed by the MPI standard. *** Your MPI job will now abort. [pillepalleben:54081] Abort before MPI_INIT completed successfully; not able to guarantee that all other processes were killed! *** The MPI_Pack_size() function was called before MPI_INIT was invoked. *** This is disallowed by the MPI standard. *** Your MPI job will now abort. [pillepalleben:54082] Abort before MPI_INIT completed successfully; not able to guarantee that all other processes were killed! Compiling with (1.2.8): mpic++ boost_mpi_test.cpp -lboost_mpi -lboost_serialization -o boost_mpi_test While the test runs fine: mpirun -np 2 boost_mpi_test Hello, world! So shall I use 1.2.8? Why I'm running in those issues? Thanks in advance, ben

1 0

boost::unit_test main function problem
by Tamas Nagy 22 May '10

22 May '10

Hello! I have a test.cpp file: #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MODULE Hello // nothing It contains nothing, but the 2 defines. I have a long Makefile of a large project. I copied the Makefile of the large project to the _unittest dir. I modified the paths in the Makefile to the proper paths. The large project has a main.cpp, which has a main() function. If i want to compile with the boost::unit_test, actually the test.cpp, it says: In file included from ../_unittest/src/test.cpp:31: ../_prog/src/main.cpp: In function ‘int main(int, char**)’: ../_prog/src/main.cpp:603 error: redefinition of ‘int main(int, char**)’ /usr/include/boost/test/unit_test.hpp:57: error: ‘int main(int, char**)’ previously defined here make: *** [../_unittest/src/test.o] Error 1 So the problem is, that there are 2 entry points. main.cpp cannot be modified to contain only the functions to be tested, because a large project relies on it. So the ideal solution would be let the original project code untouched, create a test binary that tests the functions from the large project. I'm a beginner the boost::test, can you help me solve this problem? Tamas

1 0

where to get Boost.Log?
by Kenny Riddile 22 May '10

22 May '10

I know it isn't part of the official distribution yet, but where can I get the latest usable version of Boost.Log?

2 1

[accumulators] Is there a reset function yet?
by Tim Odenthal 21 May '10

21 May '10

Hi! I just discovered this nice functionality in boost, but while trying something as simple as calculating a mean from a set of numbers, I hit a strange drawback: It seems to be impossible to use the same accumulator again for a different set of numbers, because I cannot clear/ reset it. I found some old (ok, March 2009) discussions about this, but nothing in the documentation. By the way, does the accumulator do something to prevent an overflow when I add up everything into one variable? And does it prevent a loss of precision, when at a late stage the variable I sum everything into is very big, but the thing I add is very small? Maybe it would be a good idea to mention this in the documentation, as well... Many thanks in advance for any help Tim

3 2

[msm] submachine interaction
by Gordon Smith 21 May '10

21 May '10

Hello - I've created a state machine in MSM successfully, but cannot figure out how to interact with a submachine state object. Using the tutorial machine in "Defining a submachine", can a playlist be provided to Playing? I'd like to call a constructor, or a 2 stage init function of Playing, but haven't figure out how. I could use the "FSM" parameter of the on_entry method of the submachine to pull the playlist, but it appears that FSM is the submachine itself (Playing), not the containing machine (Player) as it is for regular states. Thanks for you help, Gordon Smith

1 0

Variant bool bug
by Robin 21 May '10

21 May '10

Hi When I add a bool into the variant, the get int version fails (VC2008 SP1, boost 1.42.0, sorry earlier was mentioning wrong version 1.37.0) typedef boost::variant <bool, int, string> VariantType; VariantType variant; variant = "hello world"; string stringTest = boost::get <string> (variant); cout << stringTest.c_str () << endl; variant = 5; int intTest = boost::get <int> (variant); // Fails cout << intTest << endl; Robin

2 1

Variant bool bug
by Robin 21 May '10

21 May '10

Hi When I add a bool into the variant, the get int version fails (VC2008 SP1, boost 1.37) typedef boost::variant <bool, int, string> VariantType; VariantType variant; variant = "hello world"; string stringTest = boost::get <string> (variant); cout << stringTest.c_str () << endl; variant = 5; int intTest = boost::get <int> (variant); // Fails cout << intTest << endl; Robin

1 0

recursive variant with mpl::vector
by Surya Kiran Gullapalli 21 May '10

21 May '10

Hello all, I'm trying to create a recursive variant over an MPL vector.<http://?shva=1#drafts/128ba01f42cb2169> attached is the code. I'm trying to add a templated function isType, which will return true if the type stored in variant is the type queried for or false otherwise. This doesn't work for recursive types. In the example, I expect the program outputs "Map Type" because the type stored in the variant is a map. but it says the type is not map. The problem is mpl::contains returns false for map type. (The type stored in mpl vector is boost::recursive_wrapper< map ... >, where as, I'm querying for map...). what is the way forward from here. Thanks, Surya.

1 1

Re: [Boost-users] unable to build boost graph 1.43 with gcc 3.4.5 (Adam Spargo)
by Vial, Florent 21 May '10

21 May '10

>Have you set your include path correctly? >-I"." >-I"libs/graph/src" >seems unlikely???? I ran ./bootstrap.sh ./bjam --build-dir="/tmp/boost_143.build.gcc34" threading=multi link=static runtime-link=shared --prefix="/usr/local/boost1430-gcc34" --without-mpi --without-python --without-serialization --without-test --without-wave address-model=64 -d+2 --layout=tagged cxxflags="-fPIC" -j8 Running the same 2 commands also fails building boost 1.42 with the same error, but successfully builds boost 1.41. Florent A new star is born - ALEXA the most versatile digital camera system. Get all the latest information from arridigital.com and YouTube.----------------------------------------------------------------------- On Thu, 20 May 2010, Vial, Florent wrote: > Hi, > > trying to build boost 1.43 with gcc 3.4.5, i obtain following error: > > "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall > -pthread -m64 -fPIC -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." > -I"libs/graph/src" -c -o > "/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/re > le ase/address-model-64/link-static/threading-multi/graphml.o" > "libs/graph/src/graphml.cpp" > ./boost/property_tree/detail/xml_parser_read_rapidxml.hpp: In function > `void > boost::property_tree::xml_parser::read_xml_internal(std::basic_istream > <t ypename Ptree::key_type::value_type, std::char_traits<typename > Ptree::key_type::value_type> >&, Ptree&, int, const std::string&) > [with Ptree = boost::property_tree::basic_ptree<std::string, > std::string, std::less<std::string> >]': > ./boost/property_tree/xml_parser.hpp:52: instantiated from `void > boost::property_tree::xml_parser::read_xml(std::basic_istream<typename > Ptree::key_type::value_type, std::char_traits<typename > Ptree::key_type::value_type> >&, Ptree&, int) [with Ptree = > boost::property_tree::ptree]' > libs/graph/src/graphml.cpp:49: instantiated from here > ./boost/property_tree/detail/xml_parser_read_rapidxml.hpp:108: error: > non-constant `(((int)f_c) | 3072)' cannot be used as template argument > ./boost/property_tree/detail/xml_parser_read_rapidxml.hpp:108: error: > no matching function for call to > `rapidxml::xml_document<char>::parse(char*)' > ...skipped > <p/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/r > el > ease/address-model-64/link-static/threading-multi>libboost_graph-mt.a( > cl > ean) for lack of > <p/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/r > el ease/address-model-64/link-static/threading-multi>graphml.o... > ...skipped > <p/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/r > el > ease/address-model-64/link-static/threading-multi>libboost_graph-mt.a > for lack of > <p/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/r > el ease/address-model-64/link-static/threading-multi>graphml.o... > ...skipped <pstage/lib>libboost_graph-mt.a for lack of > <p/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/r > el > ease/address-model-64/link-static/threading-multi>libboost_graph-mt.a... > ...failed updating 1 target... > > any workaround coming to mind ? > > Thank you, > Florent Arnold & Richter Cine Technik GmbH & Co. Betriebs KG Sitz: Munchen - Registergericht: Amtsgericht Munchen - Handelsregisternummer: HRA 57918 Personlich haftender Gesellschafter: Arnold & Richter Cine Technik GmbH Sitz: Munchen - Registergericht: Amtsgericht Munchen - Handelsregisternummer: HRB 54477 Geschaftsfuhrer: Franz Kraus; Dr. Martin Prillmann

1 0

[serialization] Is it possible to force newer boost-serialization to be compatible with older versions?
by Mariusz Wojtysiak 21 May '10

21 May '10

Hello, I implementing client-server application. Data sent between sites are serialized using boost-serialization as text archive. Unfortunately very often both client and server work on different operating systems and may be compiled with different boost versions :- ( I noticed that when boost-library versions are different on server and client, then archive_exception is thrown with message ""unsupported version". Is there a way to force serialization library to be compatible with older versions, e.g. by calling: archive.set_library_version() ? Regards, Mariusz Wojtysiak

1 0

Re: [Boost-users] boost/numeric/ublas/matrix_sparse.hpp does not play well with RICE
by John O. Woods 21 May '10

21 May '10

I attempted to compile this -- #ifdef ValueType # undef ValueType #endif #ifdef key_equal # undef key_equal #endif #include <boost/unordered_map.hpp> int main() { return 0; } -- but no luck, same set of errors. Steven: I have preprocessor output, but no clue what to do with it. It's quite long. Thanks for your continued assistance, both of you. John

2 1

Re: [Boost-users] [iostreams]Can I write data directly to the device of a stream?
by 鑫炜廖 21 May '10

21 May '10

BTW, what's the differences between stream and stream_buffer, filtering_stream and filtering_streambuf besides different base classes they derived from ? Their members look all the same...

2 1

Re: [Boost-users] boost/numeric/ublas/matrix_sparse.hpp does not play well with RICE
by John Woods 21 May '10

21 May '10

The first error, with matrix_sparse, is 4.2.1 and 4.4.3 (two machines, one karmic and the other lucid). The unordered_map error I can confirm with 4.2.1, and shall try 4.4.3 later. How does one check preprocessor output? Many thanks, John

2 1

[iostreams] boost::ostreams::file_descriptor_sink closing file handle
by Scott Quiring 20 May '10

20 May '10

Hi, I'm using file_descriptor_sink to obtain a stream to a given file handle. It's important that the file remain open past the lifetime of that object, so I send in false as the second parameter to the constructor (close_on_exit). It seems the file is being closed anyway. Here is an example: #include <iostream> #include <boost/iostreams/stream.hpp> #include <boost/iostreams/device/file_descriptor.hpp> int main(int argc, const char *argv[]) { std::cout << "foo" << std::endl; { boost::iostreams::stream<boost::iostreams::file_descriptor_sink> stream(fileno(stdout), false); stream << "bar" << std::endl; } std::cout << "baz" << std::endl; return 0; } Here we expect foo bar baz to be written, when only foo bar is written. Note that the output is the same regardless of whether true or false is sent into the constructor. Is this a boost bug, or is there something I'm missing here? I'm using gcc 4.3.4 on Ubuntu 10.04 if that makes any difference. Thanks, Scott Quiring

1 0

boost/numeric/ublas/matrix_sparse.hpp does not play well with RICE
by John O. Woods 20 May '10

20 May '10

Hi there, Cross-posted this to the RICE listserv, but they cannot reproduce. I can reproduce it on karmic and lucid (ubuntu), separate machines, in boost 1.43.0. RICE is a C++ interface for Ruby (not unlike boost python). If I include boost numeric ublas matrix_sparse and either rice/Data_Type.hpp or rice/Constructor.hpp, I get a lot of errors -- even if I do nothing with them. For example, this works: #include <boost/numeric/ublas/matrix_sparse.hpp> int main() { return 0; } So does this: #include <rice/Data_Type.hpp> int main() { return 0; } But if I put both #includes in, it gives the following errors: $ make g++ -I. -I. -I/usr/lib/ruby/1.8/i486-linux -I. -D_FILE_OFFSET_BITS=64 -I/usr/lib/ruby/gems/1.8/gems/rice-1.3.2/ruby/lib/include -fPIC -fno-strict-aliasing -g -g -O2 -fPIC -Wall -g -c main.cpp In file included from /usr/local/include/boost/numeric/ublas/storage_sparse.hpp:23, from /usr/local/include/boost/numeric/ublas/vector_sparse.hpp:16, from /usr/local/include/boost/numeric/ublas/matrix_sparse.hpp:16, from main.cpp:5: /usr/local/include/boost/numeric/ublas/storage.hpp:60: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp:65: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp:79: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp: In member function ‘typename ALLOC::size_type boost::numeric::ublas::unbounded_array<T, ALLOC>::max_size() const’: /usr/local/include/boost/numeric/ublas/storage.hpp:174: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp:174: error: expected ‘;’ before ‘ruby_xmalloc’ /usr/local/include/boost/numeric/ublas/storage.hpp:174: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp: In member function ‘typename ALLOC::size_type boost::numeric::ublas::bounded_array<T, N, ALLOC>::max_size() const’: /usr/local/include/boost/numeric/ublas/storage.hpp:357: error: expected primary-expression before ‘)’ token /usr/local/include/boost/numeric/ublas/storage.hpp:357: error: expected ‘;’ before ‘ruby_xmalloc’ /usr/local/include/boost/numeric/ublas/storage.hpp:357: error: expected primary-expression before ‘)’ token In file included from /usr/local/include/boost/numeric/ublas/vector_sparse.hpp:16, from /usr/local/include/boost/numeric/ublas/matrix_sparse.hpp:16, from main.cpp:5: /usr/local/include/boost/numeric/ublas/storage_sparse.hpp: At global scope: /usr/local/include/boost/numeric/ublas/storage_sparse.hpp:240: error: expected primary-expression before ‘)’ token make: *** [main.o] Error 1 ruby_xmalloc does not seem to exist in that file, so I gather it's having some kind of syntax hiccup that is leaking into later #includes. Here are other relevant details: $ sudo gem list --local |grep rice rice (1.3.2, 1.3.1) I seem to get the same bug with both boost 1.41 and boost 1.43, though sometimes I have trouble telling which one I'm including. Should this be a bug report, or am I missing something stupid? *(I'd be eternally grateful if you'd reply to me as well as to the list.)* Thanks so much, John PS: extconf.rb below. Works fine for other projects, as long as I don't use matrix_sparse. require 'rubygems' require 'mkmf-rice' dir_config("boost") have_library("stdc++") have_library("boost") have_library("boost_filesystem") if RUBY_VERSION =~ /1.9/ then $CPPFLAGS += " -DRUBY_19" end create_makefile('main') -- John Woods Marcotte Lab Center for Systems and Synthetic Biology The University of Texas at Austin

3 3

[BGL] Upper limits on graph size
by Adam Spargo 20 May '10

20 May '10

Hi, I am working on genome assembly software and hope that the BGL can save me a lot of development time, but before I make the investment in learning the library can somebody advise me on whether it is appropriate. My initial test sets will be quite small. However in the end I will want to scale up to on the order of a billion nodes, quite sparsely connected. We have the RAM and many CPUs, but will the code scale up this far? Thanks in advance, Adam. -- Dr Adam Spargo High Performance Assembly Group email: aws(a)sanger.ac.uk Wellcome Trust Sanger Institute Tel: +44 (0)1223 834244 x7728 Hinxton, Cambridge CB10 1SA Fax: +44 (0)1223 494919 -- The Wellcome Trust Sanger Institute is operated by Genome Research Limited, a charity registered in England with number 1021457 and a company registered in England with number 2742969, whose registered office is 215 Euston Road, London, NW1 2BE.

3 7

[MPL] what is my base class?
by John Dlugosz 20 May '10

20 May '10

I'm writing a class template, say C<T>, that has essentially different features depending on a classification of type T. So, I implemented Ca and Cb as befitting the two categories, and then make that transparent to the user by making a stub for C that inherits from either of those two, using boost::mpl::if_ to choose between them. However, the constructors have to be brought down manually. To "inherit" them, they need to be forwarded to the base class: C (...args...) : Ca (...args...) {} The problem is, I can't easily name the base class here in the base initialization list. I'm not even sure repeating the if_ metaexpression here would work, since the init list doesn't even like typedefs but wants the literal name of the class. Did I paint myself into a corner? Please help. 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.

1 0

[BGL] Graph of an Iterator
by Hossein Haeri 20 May '10

20 May '10

Dear all, Is there any way to deduce the graph a graph-iterator is iterating over? So, for example for: typedef graph_type::vertex_iterator iterator; iterator begin, end; tie(begin, end) = vertices(g); is there anything like graph_type gg = graph_of(begin); so that gg == g? TIA, --Hossein

2 3

Re: [Boost-users] [BGL] VertexProperties as a Nested Type
by Hossein Haeri 20 May '10

20 May '10

Dear Jeremiah, > It looks like property_map is the right name. Could > you please post the entire file so I know which line numbers > those errors are referring to? Sure. Please find that in the attachments. TIA, --Hossein

2 2

[regex] validating expressions
by Jeff Flinn 20 May '10

20 May '10

Is this the correct way to validate a regex expression? bool validateExpression(std::string e) { using namespace boost; return !expression.empty() && !regex(e, regex_constants::no_except).empty(); } This passes all of my existing unit tests except for the following strings which boost::regex reports as valid. "[[[A-Z]]" "[A-Z]??" Both Qt's QRegExp and http://www.regexplanet.com/simple/index.html report the first is invalid. Qt's QRegExp reports the second as invalid, while http://www.regexplanet.com/simple/index.html report it as valid. Is boost::regex right or remiss? Is there a better on line regex validator? Thanks, Jeff

3 5

unable to build boost graph 1.43 with gcc 3.4.5
by Vial, Florent 20 May '10

20 May '10

Hi, trying to build boost 1.43 with gcc 3.4.5, i obtain following error: "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -m64 -fPIC -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." -I"libs/graph/src" -c -o "/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/rele ase/address-model-64/link-static/threading-multi/graphml.o" "libs/graph/src/graphml.cpp" ./boost/property_tree/detail/xml_parser_read_rapidxml.hpp: In function `void boost::property_tree::xml_parser::read_xml_internal(std::basic_istream<t ypename Ptree::key_type::value_type, std::char_traits<typename Ptree::key_type::value_type> >&, Ptree&, int, const std::string&) [with Ptree = boost::property_tree::basic_ptree<std::string, std::string, std::less<std::string> >]': ./boost/property_tree/xml_parser.hpp:52: instantiated from `void boost::property_tree::xml_parser::read_xml(std::basic_istream<typename Ptree::key_type::value_type, std::char_traits<typename Ptree::key_type::value_type> >&, Ptree&, int) [with Ptree = boost::property_tree::ptree]' libs/graph/src/graphml.cpp:49: instantiated from here ./boost/property_tree/detail/xml_parser_read_rapidxml.hpp:108: error: non-constant `(((int)f_c) | 3072)' cannot be used as template argument ./boost/property_tree/detail/xml_parser_read_rapidxml.hpp:108: error: no matching function for call to `rapidxml::xml_document<char>::parse(char*)' ...skipped <p/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/rel ease/address-model-64/link-static/threading-multi>libboost_graph-mt.a(cl ean) for lack of <p/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/rel ease/address-model-64/link-static/threading-multi>graphml.o... ...skipped <p/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/rel ease/address-model-64/link-static/threading-multi>libboost_graph-mt.a for lack of <p/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/rel ease/address-model-64/link-static/threading-multi>graphml.o... ...skipped <pstage/lib>libboost_graph-mt.a for lack of <p/tmp/boost_143.build.gcc34/boost/bin.v2/libs/graph/build/gcc-3.4.5/rel ease/address-model-64/link-static/threading-multi>libboost_graph-mt.a... ...failed updating 1 target... any workaround coming to mind ? Thank you, Florent Arnold & Richter Cine Technik GmbH & Co. Betriebs KG Sitz: Munchen - Registergericht: Amtsgericht Munchen - Handelsregisternummer: HRA 57918 Personlich haftender Gesellschafter: Arnold & Richter Cine Technik GmbH Sitz: Munchen - Registergericht: Amtsgericht Munchen - Handelsregisternummer: HRB 54477 Geschaftsfuhrer: Franz Kraus; Dr. Martin Prillmann A new star is born - ALEXA the most versatile digital camera system. Get all the latest information from arridigital.com and YouTube.

3 2

boost::lambda::bind - how to address the member variable in the expression?
by Archie14 20 May '10

20 May '10

Example: struct A { int i; }; class C { public: void store(int i); }; boost::ptr_vector<A> lst; C c; std::for_each (lst.begin(), lst.end(), boost::lambda::bind(&C::store, c, boost::lambda::_1.i)); Question: construct boost::lambda::_1.i is invalid. I understand why it is so, but can't find a way to reference member variable in this case. Any advise or referral to the specific paragraph in boost::lambda documentation is appreciated. Thanks.

2 1

[regex] function to escape regex control characters like QRegExp::escape?
by Jeff Flinn 20 May '10

20 May '10

Is there a function to escape regex control characters like RegExp::escape already in boost::regex or perhaps boost::expressive? Thanks, Jeff

2 2

Boost::Spirit problem
by Xavier Pegenaute 20 May '10

20 May '10

Hi, I have a problem converting "const boost::phoenix::actor<boost::spirit::argument<0> >&" to int, anyone know how I can do it?, looking in the documentation seems it should work as it is, but it does not ..., any idea? PD: Find attached a simple example of the problem. Thanks a lot. Xavi.

2 1

[iostreams]Can I write data directly to the device of a stream?
by Comet 20 May '10

20 May '10

Hi, I assumed that stream wrote data directly to it's associated device, but after a few tests I found I was wrong. I wrote this code snippet: <--- Code ---> int main() { using namespace std; using namespace boost::iostreams; string src; src.assign(10 * 1024, 'a'); size_t size = src.size(); // ContainerDevice is from boost::iostreams::example typedef ContainerDevice<std::vector<char> > MyDevice; vector<char> container; string str; container.reserve(size); str.reserve(size); for (size_t i = 0; i < 1000000; ++i) { // Version 1 MyDevice device(container); stream<MyDevice> io(device); io.write(src.c_str(), src.size()); io.flush(); container.clear(); // Version 2 #if 0 str.insert(str.end(), src.begin(), src.end()); container.insert(container.end(), str.begin(), str.end()); str.clear(); container.clear(); #endif } return 0; } <--- Code-End ---> The first version(write data to the device by stream) is slower than the second(copy data, then copy again to device), so I guess stream do some unnecessary copy operations (eg: copy data to inner buffer, then copy again from buffer to device). I tried replacing stream<MyDevice> io(device); with stream<MyDevice> io(device, 0, 0); to set inner buffer size to 0, but the result was much more slower. I set a breakpoint at ContainerDevice::write(const char_type* data, std::streamsize n) then found n passed was always 1, which means every call wrote only 1 byte. If there is a way to write data directly to the device, my program will be very efficient. thanks.

1 0

[units] How to assign "ft" to an si::length?
by Terry Golubiewski 20 May '10

20 May '10

I am having trouble seeing how to use mixed units. The program below compiles and runs. See the changes I "wish" I could make as comments. terry #include <boost/units/systems/si.hpp> #include <boost/units/base_units/us/foot.hpp> #include <boost/units/quantity.hpp> #include <boost/units/io.hpp> #include <iostream> #include <iomanip> using namespace std; using namespace boost; using namespace boost::units; int main() { static const si::length m = si::meter; // static const si::length ft = ???; typedef quantity<si::length> Length; Length x = 2.0 * m; Length y = 3.0 * m; // instead of "m" use "ft"; cout << "x=" << x << " y=" << y << endl; Length z = x + y; cout << "x+y=" << z << endl; // display result in "ft" return 0; } // main

3 10

[thread] Getting the current thread object
by Postal Peon 20 May '10

20 May '10

Is there a call to get the current running thread object? (e.g. boost::this_thread::instance()). I think some older boost release had the ability to get the current thread via the default constructor (prior to 1.34). Arnold

2 1

Re: [Boost-users] Boost-users Digest, Vol 2362, Issue 3
by Edward Rankin 20 May '10

20 May '10

On Tue, May 18, 2010 at 2:39 AM, <boost-users-request(a)lists.boost.org>wrote: > > > Edward Rankin wrote: > > On Mon, May 17, 2010 at 6:53 PM, <boost-users-request(a)lists.boost.org > > <mailto:boost-users-request@lists.boost.org>> wrote: > > > > > > Hi, > > I have a large project and for what ever reason if I add > xpressive.hpp > > in my precompiled header, it completly kills intelligence. So I > > figured > > I'd move the stuff I want to use off to a lib. Works fine in debug > but > > if I build the release, this lib tries to link in the Microsoft > > debug libs. > > > > In my project: > > 1>mfcs90.lib(nolib.obj) : warning LNK4098: defaultlib 'mfc90d.lib' > > conflicts with use of other libs; use /NODEFAULTLIB:library > > 1>mfcs90.lib(nolib.obj) : warning LNK4098: defaultlib 'mfcs90d.lib' > > conflicts with use of other libs; use /NODEFAULTLIB:library > > and just this one in the test solution: > > 1>msvcrt.lib(cinitexe.obj) : warning LNK4098: defaultlib > 'msvcrtd.lib' > > conflicts with use of other libs; use /NODEFAULTLIB:library > I just realised that your issue might have nothing to do with boost. The warning messages above mention mfcs90.lib which boost definitely doesn't use. Something strange is going on, but it is unlikely to have anything to do with boost. > > > > I have been able to recreate the problem in a small solution that > > should > > not dependent on my directories other than setting the boost path: > > > > <http://lakeweb.net/downloads/RaVpath.zip> > > (20k) vc 2008 (9.0) boost 1_42 > > > > And I don't know, this may have nothing to do with boost, but I have > > other dlls and libs without this problem. It is coming from > > 'boost::filesystem' as best as I can determine. > > > > And maybe someone has seen this before and knows off the top of > > their head. > > > > Thanks, Dan. > > > > > > What's happening here is that the libs you built were built against > > the microsoft debug libs. You will need to build a separate set of > > libs which were built against the microsoft release libs. This means > > when you are compiling your actual program in release mode, you will > > need to point the linker to the new set of libs you built. > > Hi Edward, > Thanks. I do think I have all this in place. This may be my problem and > boost is the wrong place to ask. But I have: > > TestCon.cpp > #ifdef _DEBUG > #pragma comment( lib, > "C:\\cpp\\ReserveAnalyst_9\\RaVpath\\static_libd\\RaVPathd.lib" ) > #else > #pragma comment( lib, > "C:\\cpp\\ReserveAnalyst_9\\RaVpath\\static_lib\\RaVPath.lib" ) > #endif > > and in the static_lib 'should' be only release dependent. I see here I > forgot to set the path relative for the test case. Should have been: > "..\\static_lib\\RaVPath.lib" > > I'm not sure how VS chooses libs but I have checked the .vcproj directly > and only NDEBUG is used for static_lib. And I don't have this trouble > with any other lib or dll I build. > You seem to be doing everything right. You might want to try from scratch building this lib and see this error still occurs. It could be some obscure setting we have overlooked. > And thanks OvermindDL1, > I see I would qualify for the $99 license. I'll give this strong > consideration. (Visual Assist X) > I use this at work too, and it is pretty cool tool. > > Best, Dan. > > Regards, Edward

1 0

[BGL] VertexProperties as a Nested Type
by Hossein Haeri 19 May '10

19 May '10

Dear all, What is my chance to get VertexProperties back in adjacency_list<OutEdgeList, VertexList, Directed, VertexProperties, EdgeProperties, GraphProperties, EdgeList> as a nested type? So, for example: typedef adjacency_list<vecS, vecS, directedS, string> graph_type; where VertexProperties == string. What nested type can I use to get to string from graph_type? It would have made a lot of sense for example if the following piece of code worked: typedef graph_traits<graph_type>::vertex_type my_type; and, as a result, my_type == string. Is a similar thing possible? TIA, --Hossein

2 5

Re: [Boost-users] [BGL] Is adjacency_iterator not Equality Comparable?
by Hossein Haeri 19 May '10

19 May '10

Dear Jeremiah, > Could you please send a complete program that I can try to compile here? Please find a minimalist (but different) example in the attachments. I currently do know what's wrong but it's probably still better for my next question to attach the file. Consider the following line in my attached code: iterator pos = find(begin, end, "3"); I know that this line doesn't compile because the value type of vertex iterator is not necessarily the same as VertexProperties. But, then, is there a simple way to find the vertex iterator that points to "3"? (I mean something as succinct as the above line of code. I DO already know that it's possible to pass an ugly function object to help find(). But, that's far too ugly.) TIA, --Hossein

2 2

[gil]Building io extensions with Visual Studio
by Mariusz Kwiczala 19 May '10

19 May '10

Hello, Is it any script, bat to automate compilation of gil io extensions? I would like use gil and io extension with Visual Studio 2010. Could anyone help me write below bat J or give me some advise how to automate building of gil io extensions? Built.bat Rem build boost @echo off call "%VS100COMNTOOLS%vsvars32.bat" bjam variant=debug threading=multi link=shared bjam variant=release threading=multi link=shared rem build gil io extensions .. .. . Mariusz

1 0

Boost on xcode(mac osx 10.6.3)
by Rob Biermann 19 May '10

19 May '10

Hi guys, im trying to add boost in a C++ project on Mac OS X for a while, but im stuck with reference errors. Undefined symbols: "boost::system::get_generic_category()", referenced from: __static_initialization_and_destruction_0(int, int)in Main.o __static_initialization_and_destruction_0(int, int)in Main.o __static_initialization_and_destruction_0(int, int)in Main.o "boost::system::get_system_category()", referenced from: boost::asio::error::get_system_category() in Main.o __static_initialization_and_destruction_0(int, int)in Main.o __static_initialization_and_destruction_0(int, int)in Main.o ld: symbol(s) not found collect2: ld returned 1 exit status I builded librarys with bjam, i linked them in the LIBRARY_SEARCH_PATHS: LIBRARY_SEARCH_PATHS = /Users/*usr*/boost_1_43_0/bin.v2/libs/date_time/build/darwin-4.2.1/release/threading-multi /Users/*usr*/boost_1_43_0/bin.v2/libs/filesystem/build/darwin-4.2.1/release/link-static/threading-multi /Users/*usr*/boost_1_43_0/bin.v2/libs/system/build/darwin-4.2.1/release/link-static/threading-multi / users/*usr*/boost_1_43_0/stage/lib <<Not sure if this is right, but no documentation shows right options Also i made sure the include paths are correct: HEADER_SEARCH_PATHS = /users/*usr*/boost_1_43_0 I looked on the web for answeres, but lots of info was not on mac, and they only suggested to do things without any form of instructions. I got boost working on microsoft visual studio 2008 on windows 7, so i know it should work, but i am not sure if it is supposed to work on xcode. If anyone has more experience with this, can you please help me? :) Thanks in advance. EDIT: I'm trying to include asio.hpp in boost folder

3 2

Bug in darwin.jam of boost 1.43 prevents Mac OS X backwards compatibility
by Manfred Schwind 19 May '10

19 May '10

After debugging problem that my app did not launch on older Mac OS X versions, I figured out that darwin.jam of boost 1.43 has a nasty bug: These lines: case mac* : { flags darwin.compile OPTIONS <macosx-version-min>$(version-feature) : -miphoneos-version-min=$(version[2-]:J=.) ; flags darwin.link OPTIONS <macosx-version-min>$(version-feature) : -miphoneos-version-min=$(version[2-]:J=.) ; } Should be: case mac* : { flags darwin.compile OPTIONS <macosx-version-min>$(version-feature) : -mmacosx-version-min=$(version[2-]:J=.) ; flags darwin.link OPTIONS <macosx-version-min>$(version-feature) : -mmacosx-version-min=$(version[2-]:J=.) ; } ("macosx" instead of "iphoneos". Seems to be a copy&paste bug.) To get backwards compatible binaries it's essential to pass the appropriate -mmacosx-version-min option to the compiler. But because of this bug, this option was never passed, so my built boost libraries where not backwards compatible. It took me a whole day to figure this out. First I checked all my build settings of my app. The bjam build settings looked OK, so it was not obvious that the boost libraries were the cause of all the trouble. Just wanted to let you know, in case other people have the same problem. Mani -- http://mani.de - friendly software iVolume - listen to music hands-free LittleSecrets - the encrypted notepad Sahara - sand in your pocket Watchdog - baffle the curious

1 0

[MPL] - for_each operators with decision branching
by Noah Roberts 19 May '10

19 May '10

I have a project in which I use these things I call "records" to attach data to edges and vertexes in a boost::graph. They are visitable (acyclic visitor described by Alexandrescu) and I have metafunctions that will take their most derived type and give me a list of "fields" that they contain. I can then write generic processors to do things like build editors for them or perform operations that can effect any field of a particular type or concept. Thus I often find myself using mpl::for_each and writing things like this: struct operator { template < typename MetaField > void operator()(MetaField const&, boost::enable_if< some_test >::type * = 0); template < typename MetaField > void operator()(MetaField const&, boost::disable_if<some_test>::type * = 0); }; I imagine that this is common enough that there may already be a utility to write things like this but I don't see one in the docs. Is it out there? What about something that would make this type of thing easy: struct operator { template < typename MetaField > void operator()(MetaField const&, boost::enable_if< test_a >::type * = 0); template < typename MetaField > void operator()(MetaField const&, boost::enable_if< and_< not_ <test_a>, test_b>>::type * = 0) void operator()(MetaField const&, boost::enable_if<not_<or_<test_a, test_b>>>::type * = 0); }; That's supposed to be an if, elseif, else construct. -- http://crazyeddiecpp.blogspot.com/

2 1

Re: [Boost-users] [proto, fusion] Segfault in for_each
by Eric Niebler 19 May '10

19 May '10

On 5/19/2010 10:01 AM, David Greene wrote: > On Thursday 13 May 2010 23:16:31 David A. Greene wrote: >> On Monday 10 May 2010 21:15:42 Eric Niebler wrote: >>>> I've been wrestling with this for days. Any ideas on how to debug >>>> this? >>> >>> Nope. But it'd probably help if you sent around a self-contained repro. >> >> Ok, here's a smallish testcase. gdb shows the same problem: an invalid >> proto expression reference. > > Hey Eric, > > No rush to take a look at this, but I wanted to make sure you got the > testcase since I haven't seen a reply. Sorry for not responding sooner. I got it. This came in during the melee of BoostCon. And now I'm down with a cold. I hope to look at it soon. -- Eric Niebler BoostPro Computing http://www.boostpro.com

1 1

Boost.Regex Can't compile / link programs..
by John Mc Murray 19 May '10

19 May '10

Hello all, I am trying to evaluate boost, I've heard some good things about it... I've managed to set it up mostly successfully. On boosts page: http://www.boost.org/doc/libs/1_43_0/more/getting_started/windows.html#get-… I've managed to compile the first program which does not use any separately compiled libs.. When I try to compile the second program which uses the regex lib, I get a link error... There are many link errors, but I am only posting the first one from gcc's output: C:\DOCUME~1\John\LOCALS~1\Temp\ccgmT8rw.o:reg.cpp:(.text$_ZN5boost9re_detail27cpp_regex_traits_char_layerIcEC2ERKNS0_21cpp_regex_traits_baseIcEE[boost::re_detail::cpp_regex_traits_char_layer<char>::cpp_regex_traits_char_layer(boost::re_detail::cpp_regex_traits_base<char> const&)]+0x55): undefined reference to `boost::re_detail::cpp_regex_traits_char_layer<char>::init()' When I comment out the 3 lines in the code snippet below (marked with //comment out), but I leave the one line boost::smatch matches; it does compile.. Does that mean that I have Regex installed correctly, but I am maybe missing a lib when I try to compile Here is how I'm trying to compile: g++ -I ../boost_1_43_0 -L ../boost_1_43_0/stage/lib -luser32 -lpthread -lboost_program_options-mgw44-mt-1_43 -lboost_regex-mgw44-mt-1_43 -lboost_thread-mgw44-mt-1_43 -o r reg.cpp Maybe I don't need to include all those libs, but I keep adding libs, hoping that something will work Also, if I remove the args to boost::regex, boost::regex pat("^Subject: (Re: |Aw: )*(.*)"); to boost::regex pat(); then the software compiles with no warnings... Anyone know what's up here? Oh, I'm using this on windows (MinGW - g++) now, but once its working here I'll need to redo it all on Linux (Mandriva). Thanks... John /***************************************************************************/ #include <boost/regex.hpp> #include <iostream> #include <string> int main() { std::string line; boost::regex pat("^Subject: (Re: |Aw: )*(.*)"); //comment out while (std::cin) { std::getline(std::cin, line); boost::smatch matches; if (boost::regex_match(line, matches, pat)) //comment out std::cout << matches[2] << std::endl; // comment out } } /***************************************************************************/ -- John Mc Murray john(a)softsmart.co.za www.softsmart.co.za Cell: 083 784 6313 Tel: 011 083 7085 Fax: 086 650 5573 Make money from your website or blog. Join our affiliate program now! www.softsmart.co.za/affiliates

3 3

Product between a matrix row and a complete matrix
by Alex34 19 May '10

19 May '10

I need to multiply a matrix <double> single row with a complete matrix <double> to obtain an accessible vector of values with uBLAS Can someone very kindly provide me a snippet on how to do this (in the previous post I tried without success: "Problem with prod function") or a paper about matrix operations with uBLAS? I need matrix calculations with uBLAS but the documentation is really lacking in explaining a lot of things. Please help me or provide me a guide or a tutorial or anything I can study to solve my problem Sincerely, Paul

1 0

boost::any, string conversion and serialization
by Archie14 19 May '10

19 May '10

How to get a string representation of of boost::any value? for example, is the following approach correct? boost::any t(2); std::string str = boost::any_cast<std::string>(t); In addition, from searching archieves I understand that there is no serialization for boost::any. Currently I plan to examine "name" in type_info returned from boost::any::type() and serialize accordingly. I'll appreciate any advise for better approach.

3 4

Serialization of a class which contains a pointer
by Nguyen Kim Son 19 May '10

19 May '10

Hello, I've tried a simple example with the serialization of a class that contains an int and a pointer to int (named "nothing" in the code) but after having tried both ar & (*b) and ar & b (b is the second variable), I have not been succeeded to send the class via the call "send" (in boost::mpi). My code is found at: http://www.copypastecode.com/29170/ Does anyone has an idea of why it doesn't work? Thank you in advance! Son. -- --------------------------------------------------------- Son NGUYEN KIM Antibes 06600 Tel: 06 48 28 37 47

2 1

Get IP address of a client
by Rouven Walter 19 May '10

19 May '10

2 1

Problems linking statically under linux
by Vial, Florent 19 May '10

19 May '10

Hi all, I recently need to link my application statically to the boost libraries. I am on a RHEL 5.3 (x86_64) system and compiling/linking with gcc 4.1.2. I built my boost 1.43.0 static libraries using follwing command line: ./bjam --build-dir="/tmp/boost_143.gcc41" threading=multi link=static runtime-link=static --prefix="/usr/local/boost1430-gcc41" --without-mpi --without-python --without-serialization --without-test --without-wave address-model=64 -d+2 --layout=tagged cxxflags="-fPIC -pipe -march=nocona -msse2 -pthread -Wno-multichar -DLINUX" My tools/build/v2/user-config.jam contains only using gcc ; I'll just take the example of the thread library for describing my problem. I can see that the all the wished libraries built fine, with a typical compile line being: "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -m64 -fPIC -pipe -march=nocona -msse2 -pthread -Wno-multichar -DLINUX -DBOOST_ALL_NO_LIB=1 -DBOOST_THREAD_BUILD_LIB=1 -DBOOST_THREAD_POSIX -DNDEBUG -I"." -c -o "/tmp/boost_143.build.gcc41/boost/bin.v2/libs/thread/build/gcc-4.1.2/rel ease/address-model-64/link-static/runtime-link-static/threading-multi/pt hread/thread.o" "libs/thread/src/pthread/thread.cpp" When i "su" and add "install" to the bjam command line above, all files install properly and /usr/local/boost1430-gcc41/lib is populated with static libraries like libboost_thread-mt-s.a Now i build my library that uses the boost thread library. A typical compile line is : /usr/bin/g++ -Wall -g -O3 -g -g -pipe -march=nocona -msse2 -pthread -Wno-multichar -DLINUX -fPIC -pthread -c -o obj/myfile.o myfile.cpp -I../include -I./ -I/usr/local/boost1430-gcc41/include/boost-1_43 -I/usr/local/cppunit1121-gcc41/include -I../include/mylib AR ../lib/libmylib.a Now i try to build the unit test for that library using : ar -rsc ../lib/libmylib.a obj/myfile.o LD /home/florent/dev/mylib/MylibTestMain /usr/bin/g++ -o /home/florent/dev/mylib/MylibTestMain obj/MylibTestMain.o obj/AUnitTest.o obj/AnotherUnitTest.o -L../lib -lmylib -L/usr/local/cppunit1121-gcc41/lib -lcppunit -ldl -L/usr/local/lib64 -L/usr/local/boost1430-gcc41/lib -lboost_thread-mt-s And i get a lot of undefined references: obj/AUnitTest.o: In function `AUnitTest::testAFunction()': undefined reference to `boost::thread_group::thread_group()' undefined reference to `boost::thread_group::join_all()' undefined reference to `boost::thread_group::~thread_group()' undefined reference to `boost::mutex::~mutex()' ... <snip> So my question is: how do i link properly statically with the boost libraries ? Is there any defined that i should be aware of while compiling my unit tests ? Thank you in advance, Florent Arnold & Richter Cine Technik GmbH & Co. Betriebs KG Sitz: Munchen - Registergericht: Amtsgericht Munchen - Handelsregisternummer: HRA 57918 Personlich haftender Gesellschafter: Arnold & Richter Cine Technik GmbH Sitz: Munchen - Registergericht: Amtsgericht Munchen - Handelsregisternummer: HRB 54477 Geschaftsfuhrer: Franz Kraus; Dr. Martin Prillmann A new star is born - ALEXA the most versatile digital camera system. Get all the latest information from arridigital.com and YouTube.

1 0

Serialization: C4308 warning with MSVC9
by Political Confusion 19 May '10

19 May '10

I'm using Boost 1.43 with MSVC9 SP1 and Windows SDK v7 on Windows 7. I've created a class like the "A Very Simple Case" example (i.e. added 'access' as friend and a templated serialize function). In serialize, I just archive 10 ints (signed and unsigned). It compiles fine, but when I add program code to save my class to a text_oarchive, I get a warning: c:\third-party\boost_1_43_0\boost\mpl\print.hpp(51) : warning C4308: negative integral constant converted to unsigned type Line 51 of print.hpp is: enum { n = sizeof(T) + -1 }; Calling sizeof() on my class gives a 44. I do not get any warning when I load my class with text_iarchive. And both save and load appear to work fine.

2 6

BoostCon 2011 Hotel Reservation Billing
by David Abrahams 19 May '10

19 May '10

FYI, last year the Meadows' move to an automated reservation system caused some issues with the amount people were charged for reservations. After inquiring specifically into billing for 2011 reservations, this is what I heard back from Doug Crawford: > I met with our reservations team. > For your group, we'll go back to manual deposits. > Aspen Meadows will agree to the following: > Room reservations will be accepted with 1 night deposit > > Balance due 30 days prior to arrival > > Reservations made 30 days or less prior to arrival will be > charged in full. > > Standard reservations cancellations policies apply - > reservations are non refuncable less than 14 days of arrival. ^----------------sounds intriguing, but I think this is meant to say “non-refundable.” ;-) Cheers, -- Dave Abrahams Meet me at BoostCon: http://www.boostcon.com BoostPro Computing http://www.boostpro.com

1 0

Spirit: parsing tab separated values and no_skip
by Mauricio Gomes 18 May '10

18 May '10

Hi Harmut, Did you uncomment the line: //#include <boost/spirit/include/qi_no_skip.hpp> ? It is commented out in the code below. If I include this line, compilation fails. You also have to check optimizations because the code below is not using no_skip[] in the grammar so there is a chance that a smart compiler that is not in debug mode might ignore the non-used code. In my case I am in debug mode, no optmizations and including the qi_no_skip.hpp header suffices to get the error. Thanks for your attention ! 1. Re: Spirit: parsing tab separated values and no_skip > compilation error. (Hartmut Kaiser) > ---------------------------------------------------------------------- > > Message: 1 > Date: Thu, 13 May 2010 18:28:19 -0500 > From: "Hartmut Kaiser" <hartmut.kaiser(a)gmail.com> > To: <boost-users(a)lists.boost.org> > Subject: Re: [Boost-users] Spirit: parsing tab separated values and > no_skip compilation error. > Message-ID: <0d5301caf2f3$fa1c64e0$ee552ea0$(a)gmail.com> > Content-Type: text/plain; charset="iso-8859-1" > > > I am a beginner with Spirit. I just read the tutorial and I am playing > > around with some examples. > > Environment: boost 1.43, Windows Vista, Code::Blocks, mingw, gcc 4.5. > > > > My goal is to build a tab separated values parser. > > If you have an example on how to parse something like: > > string/t/tdouble/tdouble > > it would be great. Contiguous tabs should be considered as one tab, not > an > > empty field. > > > > To start I just tried to parse a tab separated list of strings but I am > > having some difficulties. > > > > Is there another skip parser to be used instead of space (for full code > > see the end of the message below) ? > > I have changed the commas to tabs in the code below but it failed. I > guess > > it was because it was skipping them (space skipper). > > > > ??????? bool r = phrase_parse(first, last, > > > > ??????????? //? Begin grammar > > ??????????? ( > > ??????????????? +(char_ - ',') % ',' > > ??????????? ) > > ??????????? , > > ??????????? //? End grammar > > > > ??????????? space, v); > > > > This code works with commas but it fails with '\t'. > > > > I tried to use no_skip[] but it failed to compile the header #include > > <boost/spirit/include/qi_no_skip.hpp>: > > > > C:\boost_1_43_0\boost\spirit\home\qi\directive\no_skip.hpp|30|error: > > 'no_skip' is not a member of 'boost::spirit::tag'| > > > > For full error message see the end of the message below. > > > > Any suggestions ? > > > > Thank you for your attention, > > Mau. > > > > #include <boost/config/warning_disable.hpp> > > #include <boost/spirit/include/qi.hpp> > > #include <boost/spirit/include/phoenix_core.hpp> > > #include <boost/spirit/include/phoenix_operator.hpp> > > #include <boost/spirit/include/phoenix_stl.hpp> > > //#include <boost/spirit/include/qi_no_skip.hpp> > > > > #include <iostream> > > #include <string> > > #include <vector> > > > > #define VECTOR_TYPE std::string > > > > namespace client > > { > > ??? namespace qi = boost::spirit::qi; > > ??? namespace ascii = boost::spirit::ascii; > > > > ??? > ////////////////////////////////////////////////////////////////////// > > ///// > > ??? //? Our number list compiler > > ??? > ////////////////////////////////////////////////////////////////////// > > ///// > > ??? //[tutorial_numlist4 > > ??? template <typename Iterator> > > ??? bool parse_numbers(Iterator first, Iterator last, > > std::vector<VECTOR_TYPE>& v) > > ??? { > > ??????? using qi::double_; > > ??????? using qi::phrase_parse; > > ??????? using qi::_1; > > ??????? using ascii::space; > > ??????? using qi::char_; > > > > ??????? bool r = phrase_parse(first, last, > > > > ??????????? //? Begin grammar > > ??????????? ( > > ??????????????? +(char_ - ',') % ',' > > ??????????? ) > > ??????????? , > > ??????????? //? End grammar > > > > ??????????? space, v); > > > > ??????? if (first != last) // fail if we did not get a full match > > ??????????? return false; > > ??????? return r; > > ??? } > > ??? //] > > } > > > > > ////////////////////////////////////////////////////////////////////////// > > // > > //? Main program > > > ////////////////////////////////////////////////////////////////////////// > > // > > int > > main() > > { > > ??? std::cout << > > "/////////////////////////////////////////////////////////\n\n"; > > ??? std::cout << "\t\tA comma separated list parser for Spirit...\n\n"; > > ??? std::cout << > > "/////////////////////////////////////////////////////////\n\n"; > > > > ??? std::cout << "Give me a comma separated list of numbers.\n"; > > ??? std::cout << "The numbers will be inserted in a vector of numbers\n"; > > ??? std::cout << "Type [q or Q] to quit\n\n"; > > > > ??? std::string str; > > ??? while (getline(std::cin, str)) > > ??? { > > ??????? if (str.empty() || str[0] == 'q' || str[0] == 'Q') > > ??????????? break; > > > > ??????? std::vector<VECTOR_TYPE> v; > > ??????? if (client::parse_numbers(str.begin(), str.end(), v)) > > ??????? { > > ??????????? std::cout << "-------------------------\n"; > > ??????????? std::cout << "Parsing succeeded\n"; > > ??????????? std::cout << str << " Parses OK: " << std::endl; > > > > ??????????? for (std::vector<VECTOR_TYPE>::size_type i = 0; i < v.size(); > > ++i) > > ??????????????? std::cout < > > > ??????????? std::cout << "\n-------------------------\n"; > > ??????? } > > ??????? else > > ??????? { > > ??????????? std::cout << "-------------------------\n"; > > ??????????? std::cout << "Parsing failed\n"; > > ??????????? std::cout << "-------------------------\n"; > > ??????? } > > ??? } > > > > ??? std::cout << "Bye... :-) \n\n"; > > ??? return 0; > > } > > This example compiles fine for me (VC10, g++ 4.5). Is it supposed to fail? > > Regards Hartmut >

2 1

BoostCon 2011 Dates and Hotel Discount (this week only!)
by David Abrahams 18 May '10

18 May '10

Hi All, BoostCon #4 was a resounding success, with 95 registrants—attendance holding steady in the face of a poor economy—and nothing but smiles all ’round. One participant was heard to say “after last year, I thought about not coming because I was sure nothing could possibly be cooler that experience, but this is even better.” I'll have more to say about the event soon, but for now a couple important details about next year: 1. Next year, BoostCon is scheduled a week later: May 15-20, 2011 which avoids a conflict with Mother's Day, a perennial issue for some attendees… and is a bit less likely to bring us snow ;-) 2. Because BoostCon has been an excellent regular customer, the Aspen Meadows is offering a $20/night discount for any Boost participant who books on or before **this Friday**, May 21 2010. After taxes, etc., that's more than a $100 savings. Use the following link to make your reservation: https://resweb.passkey.com/Resweb.do?mode=welcome_ei_new&eventID=2547965&fr… Lastly, the Meadows wants you to know that your companies or universities are welcome back for other meetings, and requests that, if you had a good hotel experience this year, you please post positive feedback on http://tripadvisor.com. See you next year, if not before! Cheers, -- Dave Abrahams Meet me at BoostCon: http://www.boostcon.com BoostPro Computing http://www.boostpro.com

1 0

Re: [Boost-users] shared_ptr question
by Peter Dimov 18 May '10

18 May '10

David Michael Bond wrote: ... > I looked into it more and it seems if I comment out the memcpy in the > get_ether_header function I do not get the segfault. > > ether_header Frame::get_ether_header( ) { > ether_header ret ; > memcpy( &ret, this->bytes.get(), this->size ) ; > return ret ; > } > > Its fine to return that stack var right there right? That should just copy > the memory into the return value for the stack? It's fine to return a stack variable, but it may not be fine to memcpy into it, depending on how ether_header is defined and whether this->size may exceed sizeof(ether_header). To investigate further, you might want to look at the stack backtrace when the segfault occurs. Your shared_ptr use seems fine, so it's probably ~Frame that is crashing (unless there is memory damage).

2 1

[BGL] Is adjacency_iterator not Equality Comparable?
by Hossein Haeri 18 May '10

18 May '10

Dear all, [Boost 1.42, GCC 3.4.5 under MinGW in WinXP] I have a piece of program like this: typedef graph_type::adjacency_iterator iterator; iterator begin, end; boost::tie(begin, end) = boost::adjacent_vertices(curr_, *graph_ptr_); //... ArrFreq nextArr = l.front(); //... iterator i = find(begin, end, nextArr); And, I get the error message in the P.S. once I try the last line above. I was wondering if that's because: 1) adjacency_iterator is not equality comparable. Or, 2) the value type of adjacency_iterator is not comparable with the graph's vertex type. Or, 3) even something else? TIA, --Hossein P.S. /lib/gcc/mingw32/3.4.5/../../../../include/c++/3.4.5/bits/stl_algo.h:172: error: no match for 'operator==' in '((boost::iterator_facade<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, ArrFreq, TransRule::Type, boost::no_property, boost::listS>, size_t, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, TransRule::Type, boost::no_property> >*, std::vector<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, TransRule::Type, boost::no_property> >, std::allocator<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, TransRule::Type, boost::no_property> > > > >, size_t, boost::detail::edge_desc_impl<boost::directed_tag, size_t>, ptrdiff_t>, ptrdiff_t>, size_t, boost::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::random_access_traversal_tag>, size_t, ptrdiff_t>*)(&__first))->boost::iterator_facade<I, V, TC, R, D>::operator* [with Derived = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, ArrFreq, TransRule::Type, boost::no_property, boost::listS>, size_t, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, TransRule::Type, boost::no_property> >*, std::vector<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, TransRule::Type, boost::no_property> >, std::allocator<boost::detail::sep_<size_t, boost::property<boost::edge_bundle_t, TransRule::Type, boost::no_property> > > > >, size_t, boost::detail::edge_desc_impl<boost::directed_tag, size_t>, ptrdiff_t>, ptrdiff_t>, Value = size_t, CategoryOrTraversal = boost::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::random_access_traversal_tag>, Reference = size_t, Difference = ptrdiff_t]() == __val' FlowGraph.cpp:148: note: candidates are: bool operator==(const ArrFreq&, const ArrFreq&) bool operator==(const Arrangement&, const Arrangement&)

2 1

error boost spirit
by khaled hamidouche 18 May '10

18 May '10

Hello with Joel Falcou we are wondring to write a parser to parse mathematical expression like (N1*3+N2/N3) ... with N1, N2, N3 are variables where their value are in an std vector so I take the calc example and I change it. my code looks like this #include <boost/config/warning_disable.hpp> #include <boost/spirit/include/qi.hpp> #include <boost/spirit/include/phoenix_operator.hpp> #include <boost/spirit/home/phoenix/container.hpp> #include <iostream> #include <string> #include <vector> namespace client { namespace qi = boost::spirit::qi; namespace ascii = boost::spirit::ascii; void do_add() { std::cout << "add\n"; } /////////////////////////////////////////////////////////////////////////// // Our calculator grammar /////////////////////////////////////////////////////////////////////////// template <typename Iterator> struct calculator : qi::grammar<Iterator, int(), ascii::space_type> { calculator(std::vector<int> const & vec) : calculator::base_type(expression), vect(vec) { using qi::_val; using qi::_1; using qi::uint_; using ascii::char_; int index; // vect.resize(3); // // // vect[0]=10; // vect[1]=11; // vect[2]=12; //vect=vec; expression = term [_val = _1] >> *( ('+' >> term [_val += _1]) | ('-' >> term [_val -= _1]) ) ; term = factor [_val = _1] >> *( ('*' >> factor [_val *= _1]) | ('/' >> factor [_val /= _1]) ) ; factor = uint_ [_val = _1] | char_ >>uint_ [_val = at(vect,_1)] | '(' >> expression [_val = _1] >> ')' | ('-' >> factor [_val = -_1]) | ('+' >> factor [_val = _1]) ; } qi::rule<Iterator, int(), ascii::space_type> expression, term, factor; std::vector<int> vect; }; } /////////////////////////////////////////////////////////////////////////////// // Main program /////////////////////////////////////////////////////////////////////////////// int main() { std::cout << "/////////////////////////////////////////////////////////\n\n"; std::cout << "Expression parser...\n\n"; std::cout << "/////////////////////////////////////////////////////////\n\n"; std::cout << "Type an expression...or [q or Q] to quit\n\n"; using boost::spirit::ascii::space; typedef std::string::const_iterator iterator_type; typedef client::calculator<iterator_type> calculator; std::vector<int> vec(3); vec[0]=10; vec[1]=11; vec[2]=12; calculator calc(vec); // Our grammar std::string str; int result; while (std::getline(std::cin, str)) { if (str.empty() || str[0] == 'q' || str[0] == 'Q') break; std::string::const_iterator iter = str.begin(); std::string::const_iterator end = str.end(); bool r = phrase_parse(iter, end, calc, space, result); if (r && iter == end) { std::cout << "-------------------------\n"; std::cout << "Parsing succeeded\n"; std::cout << "result = " << result << std::endl; std::cout << "-------------------------\n"; } else { std::string rest(iter, end); std::cout << "-------------------------\n"; std::cout << "Parsing failed\n"; std::cout << "stopped at: \": " << rest << "\"\n"; std::cout << "-------------------------\n"; } } std::cout << "Bye... :-) \n\n"; return 0; } when I compile I get this error /home/hamidou/LLVM/parser /main.cpp:296: instantiated from here /usr/local/include/boost-1_42/boost/spirit/home/phoenix/core/detail/function_eval.hpp:135: error: invalid initialization of reference of type ‘int&’ from expression of type ‘const int’ Process terminated with status 1 (0 minutes, 11 seconds) 1 errors, 1 warnings when I remove the use of the vector vect inside my grammar it works fine !! So, please what I did wrong ?? Thank you so much for helping me

2 1

Re: [Boost-users] shared_ptr question
by Soumen Ghosh 18 May '10

18 May '10

I'm not sure but can you test it following way: Defer this declaration " boost::shared_ptr<Frame> rx" in following way and see if that helps ... boost::shared_ptr<Frame> &rx = processing_queue.back( ) ; Regards, ~ Soumen On Tue, May 18, 2010 at 9:30 AM, David Michael Bond <david.bond(a)iol.unh.edu>wrote: > Hello, > I am learning shared_ptrs and I am running into a segfault. I'm fairly > certain it's because of some misunderstanding I have. > > Here is some code. I have altered it to just so the relevant data: > > ---- START CODE ---- > std::deque<boost::shared_ptr<Frame> > processing_queue ; > void this_is_called() { > boost::shared_ptr<Frame> rx ; > interface->open( "eth0" ) ; > while( running ) { > interface->rx_frame( this->processing_queue ) ; > if( !processing_queue.empty( ) ) { > rx = processing_queue.back( ) ; > if( rx ) { > std::cout > << "Received Frame of Ethertype " > << ntohs( rx->get_ether_header( ).ether_type ) > << "." << std::endl ; > } > } > } > } > } > > // rx frame from interface and add onto processing_queue > boost::shared_ptr<Frame> last_rx_frame ; // (CLASSXX member) > void CLASSXX::rx_frame( std::deque<boost::shared_ptr<Frame> >& > processing_queue ) { > // Do some stuff to receive frame.. (int size= # bytes in frame) > last_rx_frame.reset(new Frame( )) ; > last_rx_frame->bytes.reset( new u_char[size]) ; > memcpy( last_rx_frame->bytes.get(), frame_bytes, size) ; > last_rx_frame->size = size ; > processing_queue.push_back( this->last_rx_frame ) ; > } > > ---- END CODE ---- > > The program receives one frame and successful and outputs it: > Received Frame of Ethertype 0x800. > But the second time when it gets to 'rx = processing_queue.back( ) ;' I > have > a segfault. > > My understanding of shared_ptrs is that when this assignment is done rx > will > have its ref count decremented (possibly leading to it being deleted). The > back of the processing_queue will then become rx do to the assignment and > that shared ptrs reference count will be increased by one. Anyone know what > my misconception is? Any idea what's causing the segfault? > > Thanks! > -David > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

2 1

Re: [Boost-users] linking for release, has debug baggage
by Edward Rankin 18 May '10

18 May '10

On Mon, May 17, 2010 at 6:53 PM, <boost-users-request(a)lists.boost.org>wrote: > > Message: 3 > Date: Sun, 16 May 2010 20:25:14 -0700 > From: Dan Bloomquist <danb(a)lakeweb.net> > To: boost-users(a)lists.boost.org > Subject: [Boost-users] linking for release, has debug baggage > Message-ID: <4BF0B71A.7020804(a)lakeweb.net> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > > Hi, > I have a large project and for what ever reason if I add xpressive.hpp > in my precompiled header, it completly kills intelligence. So I figured > I'd move the stuff I want to use off to a lib. Works fine in debug but > if I build the release, this lib tries to link in the Microsoft debug libs. > > In my project: > 1>mfcs90.lib(nolib.obj) : warning LNK4098: defaultlib 'mfc90d.lib' > conflicts with use of other libs; use /NODEFAULTLIB:library > 1>mfcs90.lib(nolib.obj) : warning LNK4098: defaultlib 'mfcs90d.lib' > conflicts with use of other libs; use /NODEFAULTLIB:library > and just this one in the test solution: > 1>msvcrt.lib(cinitexe.obj) : warning LNK4098: defaultlib 'msvcrtd.lib' > conflicts with use of other libs; use /NODEFAULTLIB:library > > I have been able to recreate the problem in a small solution that should > not dependent on my directories other than setting the boost path: > > <http://lakeweb.net/downloads/RaVpath.zip> > (20k) vc 2008 (9.0) boost 1_42 > > And I don't know, this may have nothing to do with boost, but I have > other dlls and libs without this problem. It is coming from > 'boost::filesystem' as best as I can determine. > > And maybe someone has seen this before and knows off the top of their head. > > Thanks, Dan. > What's happening here is that the libs you built were built against the microsoft debug libs. You will need to build a separate set of libs which were built against the microsoft release libs. This means when you are compiling your actual program in release mode, you will need to point the linker to the new set of libs you built. Edward

2 2

Re: [Boost-users] shared_ptr question
by Michael Jackson 18 May '10

18 May '10

On 5/18/10 12:00 AM, in article 37128.3139721074$1274188512(a)news.gmane.org, "David Michael Bond" wrote: > rx = processing_queue.back( ) ; > if( rx ) { I think your problem is the misunderstanding of the shared_ptr. The shared_ptr is a class that _wraps_ another pointer (whether valid or not) and keeps a reference count to how many other variables are using the pointer. The following line: if (rx) is only testing if the wrapper is valid, NOT the actual pointer itself that is being wrapped. What you really want is: If (rx.get() != NULL) -- Mike Jackson

2 2

Re: [Boost-users] shared_ptr question
by richard.carless＠uk.bnpparibas.com 18 May '10

18 May '10

I think it's down to your use of reset. Why not just assign? last_rx_frame = new Frame; On the multiple thread note, when you put these functions on seperate threads you will need to marshal the use of the queue. Cheers Rich Internet david.bond(a)iol.unh.edu Sent by: boost-users-bounces(a)lists.boost.org 18/05/2010 14:23 Please respond to boost-users(a)lists.boost.org To boost-users(a)lists.boost.org cc Subject Re: [Boost-users] shared_ptr question No, but eventually I will be accessing the shared_ptrs from different threads. -David From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of richard.carless(a)uk.bnpparibas.com Sent: Tuesday, May 18, 2010 9:22 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] shared_ptr question are you running these functions on different threads? Internet david.bond(a)iol.unh.edu Sent by: boost-users-bounces(a)lists.boost.org 18/05/2010 05:00 Please respond to boost-users(a)lists.boost.org To Boost-users(a)lists.boost.org cc Subject [Boost-users] shared_ptr question Hello, I am learning shared_ptrs and I am running into a segfault. I'm fairly certain it's because of some misunderstanding I have. Here is some code. I have altered it to just so the relevant data: ---- START CODE ---- std::deque<boost::shared_ptr<Frame> > processing_queue ; void this_is_called() { boost::shared_ptr<Frame> rx ; interface->open( "eth0" ) ; while( running ) { interface->rx_frame( this->processing_queue ) ; if( !processing_queue.empty( ) ) { rx = processing_queue.back( ) ; if( rx ) { std::cout << "Received Frame of Ethertype " << ntohs( rx->get_ether_header( ).ether_type ) << "." << std::endl ; } } } } } // rx frame from interface and add onto processing_queue boost::shared_ptr<Frame> last_rx_frame ; // (CLASSXX member) void CLASSXX::rx_frame( std::deque<boost::shared_ptr<Frame> >& processing_queue ) { // Do some stuff to receive frame.. (int size= # bytes in frame) last_rx_frame.reset(new Frame( )) ; last_rx_frame->bytes.reset( new u_char[size]) ; memcpy( last_rx_frame->bytes.get(), frame_bytes, size) ; last_rx_frame->size = size ; processing_queue.push_back( this->last_rx_frame ) ; } ---- END CODE ---- The program receives one frame and successful and outputs it: Received Frame of Ethertype 0x800. But the second time when it gets to 'rx = processing_queue.back( ) ;' I have a segfault. My understanding of shared_ptrs is that when this assignment is done rx will have its ref count decremented (possibly leading to it being deleted). The back of the processing_queue will then become rx do to the assignment and that shared ptrs reference count will be increased by one. Anyone know what my misconception is? Any idea what's causing the segfault? Thanks! -David _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users ___________________________________________________________ This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorised copying, disclosure or distribution of the material in this e-mail is prohibited. Please refer to http://www.bnpparibas.co.uk/en/information/legal_information.asp?Code=ECAS-… for additional disclosures. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users ___________________________________________________________ This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorised copying, disclosure or distribution of the material in this e-mail is prohibited. Please refer to http://www.bnpparibas.co.uk/en/information/legal_information.asp?Code=ECAS-… for additional disclosures.

2 1

Re: [Boost-users] shared_ptr question
by richard.carless＠uk.bnpparibas.com 18 May '10

18 May '10

are you running these functions on different threads? Internet david.bond(a)iol.unh.edu Sent by: boost-users-bounces(a)lists.boost.org 18/05/2010 05:00 Please respond to boost-users(a)lists.boost.org To Boost-users(a)lists.boost.org cc Subject [Boost-users] shared_ptr question Hello, I am learning shared_ptrs and I am running into a segfault. I'm fairly certain it's because of some misunderstanding I have. Here is some code. I have altered it to just so the relevant data: ---- START CODE ---- std::deque<boost::shared_ptr<Frame> > processing_queue ; void this_is_called() { boost::shared_ptr<Frame> rx ; interface->open( "eth0" ) ; while( running ) { interface->rx_frame( this->processing_queue ) ; if( !processing_queue.empty( ) ) { rx = processing_queue.back( ) ; if( rx ) { std::cout << "Received Frame of Ethertype " << ntohs( rx->get_ether_header( ).ether_type ) << "." << std::endl ; } } } } } // rx frame from interface and add onto processing_queue boost::shared_ptr<Frame> last_rx_frame ; // (CLASSXX member) void CLASSXX::rx_frame( std::deque<boost::shared_ptr<Frame> >& processing_queue ) { // Do some stuff to receive frame.. (int size= # bytes in frame) last_rx_frame.reset(new Frame( )) ; last_rx_frame->bytes.reset( new u_char[size]) ; memcpy( last_rx_frame->bytes.get(), frame_bytes, size) ; last_rx_frame->size = size ; processing_queue.push_back( this->last_rx_frame ) ; } ---- END CODE ---- The program receives one frame and successful and outputs it: Received Frame of Ethertype 0x800. But the second time when it gets to 'rx = processing_queue.back( ) ;' I have a segfault. My understanding of shared_ptrs is that when this assignment is done rx will have its ref count decremented (possibly leading to it being deleted). The back of the processing_queue will then become rx do to the assignment and that shared ptrs reference count will be increased by one. Anyone know what my misconception is? Any idea what's causing the segfault? Thanks! -David _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users ___________________________________________________________ This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorised copying, disclosure or distribution of the material in this e-mail is prohibited. Please refer to http://www.bnpparibas.co.uk/en/information/legal_information.asp?Code=ECAS-… for additional disclosures.

2 1

[date-time] converting milliseconds to time_duration - overflow issue
by Johan Ditmar 18 May '10

18 May '10

Hello, When I convert a (large) number of milliseconds to a time_duration, I noticed a truncation error. This is shown in the following example: BOOST_AUTO_TEST_CASE(test_time_duration) { static const boost::posix_time::ptime ref(boost::gregorian::date(1400,1,1)); static const boost::posix_time::ptime now(boost::gregorian::date(2010,5,18)); boost::int64_t elapsed = (now-ref).total_milliseconds(); boost::posix_time::time_duration d1 = boost::posix_time::millisec(elapsed); BOOST_CHECK_EQUAL(d1.total_milliseconds(), elapsed); } error in "test_time_duration": check d1.total_milliseconds() == elapsed failed [814839926290 != 19261584000000] This is caused by an overflow issue in the constructor of subsecond_duration (called by boost::posix_time::millisec): template<class base_duration, boost::int64_t frac_of_second> class subsecond_duration : public base_duration { public: typedef typename base_duration::traits_type traits_type; explicit subsecond_duration(boost::int64_t ss) : base_duration(0,0,0,ss*traits_type::res_adjust()/frac_of_second) {} }; Shouldn't this constructor check whether traits_type::res_adjust()>frac_of_second and then do “base_duration(0,0,0,ss*(traits_type::res_adjust()/frac_of_second))” (note the brackets)? Thanks, Johan _________________________________________________________________ http://clk.atdmt.com/UKM/go/195013117/direct/01/

1 0

Boost + Android NDK
by NuSkooler 18 May '10

18 May '10

I've searched the archives quite a bit and haven't run into any answers to this -- if I'm missing something please let me know. I've been working on getting Boost to work with the Android NDK (modified "Crystax" version with RTTI & exceptions) under Cygwin. I now have it working, but what I've come up with seems to be very messy and a couple of the modifications break the standard Linux build. I'm hoping someone can provide pointers to clean this up a bit (and/or this may be useful to anyone out there trying to do the same thing). Step 1: I had to build bjam.exe under Cygwin. This required the following simple patch: --- c:\Unzipped\boost-build\jam_src\expand.c 2007-09-30 23:12:48.000000000 -0600 +++ c:\dev\ghoti\client\external\boost-build\jam_src\expand.c 2010-04-29 14:25:38.322025800 -0600 @@ -749,7 +749,7 @@ assert(l != 0); assert(list_next(l) == 0); # ifdef OS_CYGWIN - assert( !strcmp( l->string, "c:\\foo\\bar" ) ); + //assert( !strcmp( l->string, "c:\\foo\\bar" ) ); # else assert( !strcmp( l->string, cygpath ) ); # endif Step 2: Build Boost under Cygwin against the modified NDK: user-config.jam - Added this entry: # Android ARM Linux Compiler using gcc : arm : /cygdrive/c/dev/ghoti/client/external/android/android-ndk-r3-crystax/build/prebuilt/windows/arm-eabi-4.4.0/bin/arm-eabi-g++ : \ <cxxflags>-I$NDK_ROOT/build/platforms/android-5/arch-arm/usr/include/ \ <cflags>-nostdlib \ <cxxflags>-DBOOST_THREAD_LINUX \ <cxxflags>-DBOOST_HAS_PTHREADS \ <cxxflags>-pthread \ <cxxflags>-D__arm__ \ <cxxflags>-D_REENTRANT \ <cxxflags>-D_GLIBCXX__PTHREADS \ <cxxflags>-DBOOST_HAS_GETTIMEOFDAY \ <cxxflags>-DBOOST_HAS_THREADS \ <cxxflags>-DANDROID \ <cxxflags>--sysroot=$NDK_ROOT/build/platforms/android-5/arch-arm <cxxflags>-D__NEW__ \ <cxxflags>-D__SGI_STL_INTERNAL_PAIR_H \ <cxxflags>-fno-short-enums \ <architecture>arm \ <linkflags>-lc \ <linkflags>-nostdlib \ <linkflags>-Wl,-rpath-link=$NDK_ROOT/build/platforms/android-5/arch-arm/usr/lib/ \ <linkflags>-L$NDK_ROOT/build/platforms/android-5/arch-arm/usr/lib/ \ ; Don't need to link in librt: --- c:\Unzipped\boost_1_42_0\tools\build\v2\tools\gcc.jam 2009-10-28 01:47:51.602868000 -0600 +++ c:\dev\ghoti\client\external\boost_1_42_0\tools\build\v2\tools\gcc.jam 2010-04-30 15:37:39.383973800 -0600 @@ -906,7 +906,8 @@ case * : { option = -pthread ; - libs = rt ; + # BDA: + #libs = rt ; } } ----- --- c:\Unzipped\boost_1_42_0\tools\build\v2\tools\stlport.jam 2009-05-22 05:36:46.841847000 -0600 +++ c:\dev\ghoti\client\external\boost_1_42_0\tools\build\v2\tools\stlport.jam 2010-04-30 15:30:31.864521000 -0600 @@ -198,7 +198,9 @@ # name: stlport_<toolset>(_stldebug)? local name = stlport ; - name = $(name)_$(toolset) ; + # BDA: + #name = $(name)_$(toolset) ; + if [ feature.get-values <runtime-debugging> : $(raw) ] = "on" { name = $(name)_stldebug ; Building: bjam toolset=gcc-arm target-os=linux stdlib=stlport define=_LITTLE_ENDIAN Again, all of this seems very messy. Some of it may not even be necessary. STLPort was something I was messing with; I'm not sure if it's ultimately required (the patch/stdllib=stlport). Any pointers greatly appreciated!

3 2

An error in MTL4(Matrix template Library).Can anyone with kindness help me?
by fmingu 18 May '10

18 May '10

I am using Dev-C++ with gcc 4.4.1 and boost 1.37.0 and MTL 4 (MTLVERSION 4\nMTLRELEASE beta-1\nMTLREVISION 6916 ) for matrix computation. And my code is the following : #define MATRIXCOLS 3 #define MATRIXROWS 3 #include <boost/numeric/mtl/mtl.hpp> using namespace mtl; using namespace mtl::matrix; typedef dense2D<double> Matrix; typedef dense_vector<double> Vec; ................................. using namespace mtl; using namespace mtl::matrix; const unsigned xd= 2, yd= 5, n= xd * yd; Matrix Kk(n,n),Hk(n,n),Rk(n,n);hessian_setup(Kk, 3.0);hessian_setup(Hk, 3.0); Rk=trans(Hk); Vec hxkk_1(n,0.0),zk(n,0.0),hxkk(n,0.0),hxkk_11(n,0.0); hxkk=zk-Hk*hxkk_1; hxkk= Kk*hxkk; //the * line ............................... and it is complied OK. But when it ran to the (*) line the result is : This application has requested the Runtime to terminate it in an unusual way, please contact the application's support team for more information. I found that the mailinglist in http://osl.iu.edu/research/mtl/mtl4/ is quite a place that almost no letters. When I use hxkk*=Kk; instead of the * line,even it can not be complied. So I write letter here for any experts to give me some advices. Can any one with kindness help me?

1 0

Re: [Boost-users] [Asio]Question about error_code when socket::close
by Comet 18 May '10

18 May '10

> BTW, you also can try to use a trivial custom allocator that would > eliminate some heap allocations in completion handlers (unrelated to > shared_ptr): > http://www.boost.org/doc/libs/1_42_0/doc/html/boost_asio/example/allocation… Thanks! that would be very helpful.

1 0

shared_ptr question
by David Michael Bond 18 May '10

18 May '10

Hello, I am learning shared_ptrs and I am running into a segfault. I'm fairly certain it's because of some misunderstanding I have. Here is some code. I have altered it to just so the relevant data: ---- START CODE ---- std::deque<boost::shared_ptr<Frame> > processing_queue ; void this_is_called() { boost::shared_ptr<Frame> rx ; interface->open( "eth0" ) ; while( running ) { interface->rx_frame( this->processing_queue ) ; if( !processing_queue.empty( ) ) { rx = processing_queue.back( ) ; if( rx ) { std::cout << "Received Frame of Ethertype " << ntohs( rx->get_ether_header( ).ether_type ) << "." << std::endl ; } } } } } // rx frame from interface and add onto processing_queue boost::shared_ptr<Frame> last_rx_frame ; // (CLASSXX member) void CLASSXX::rx_frame( std::deque<boost::shared_ptr<Frame> >& processing_queue ) { // Do some stuff to receive frame.. (int size= # bytes in frame) last_rx_frame.reset(new Frame( )) ; last_rx_frame->bytes.reset( new u_char[size]) ; memcpy( last_rx_frame->bytes.get(), frame_bytes, size) ; last_rx_frame->size = size ; processing_queue.push_back( this->last_rx_frame ) ; } ---- END CODE ---- The program receives one frame and successful and outputs it: Received Frame of Ethertype 0x800. But the second time when it gets to 'rx = processing_queue.back( ) ;' I have a segfault. My understanding of shared_ptrs is that when this assignment is done rx will have its ref count decremented (possibly leading to it being deleted). The back of the processing_queue will then become rx do to the assignment and that shared ptrs reference count will be increased by one. Anyone know what my misconception is? Any idea what's causing the segfault? Thanks! -David

1 0

Please help with rebuild on Windows
by John Dlugosz 18 May '10

18 May '10

I want to use the program-options library, and the copy of boost used by this application suite is 1.38. Using Visual Studio 2008, debug build, the resulting program crashes in the variables_map constructor. My assumption is that the compiler options don't match: in particular, a stupid thing called _HAS_ITERATOR_DEBUGGING=0 is infectious as it causes the STL to generate different code and different sized objects. The layout of the boost files doesn't match the documentation, in that bjam.exe is in a subdirectory, and there is no such thing as bootstrap. Anyway, I try: D:\boost_1_38_0> bin\bjam link=static threading=multi variant=debug toolset=msvc-9.0 --define=_HAS_ITERATOR_DEBUGGING=0 Libs\program_options\build and it indeed makes a file with the same name as the one my program is linking to: libboost_program_options-vc90-mt-gd-1_38.lib, which I copy over the original. It made no difference. I don't think that's the specific problem, though, since it crashes on the constructor, not on some later usage from a different translation unit. The call tree is: foo.exe!std::_Tree<std::_Tmap_traits<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::program_options::variable_value,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<std::basic_string<char,std::char_traits<char>,std::allocator<char> > const ,boost::program_options::variable_value> >,0> >::_Init() Line 1180 + 0xe bytes foo.exe!std::_Tree<std::_Tmap_traits<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::program_options::variable_value,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<std::basic_string<char,std::char_traits<char>,std::allocator<char> > const ,boost::program_options::variable_value> >,0> >::_Tree<std::_Tmap_traits<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::program_options::variable_value,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<std::basic_string<char,std::char_traits<char>,std::allocator<char> > const ,boost::program_options::variable_value> >,0> >(const std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > & _Parg=less, const std::allocator<std::pair<std::basic_string<char,std::char_traits<char>,std::allocator<char> > const ,boost::program_options::variable_value> > & _Al={...}) Line 511 foo.exe!std::map<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::program_options::variable_value,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<std::basic_string<char,std::char_traits<char>,std::allocator<char> > const ,boost::program_options::variable_value> > >::map<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::program_options::variable_value,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<std::basic_string<char,std::char_traits<char>,std::allocator<char> > const ,boost::program_options::variable_value> > >() Line 104 foo.exe!boost::program_options::variables_map::variables_map() Line 172 + 0x40 bytes foo.exe!main(int argc=1, char * * argv=0x01f84190) Line 179 + 0xb bytes 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.

3 7

[filesystem] iterator VC 10.0
by Commander Pirx 17 May '10

17 May '10

Hi, I tried to compile the following lines with VC 10: void path_adapter::convert( const boost::filesystem::path& p) { typedef boost::filesystem::path::const_iterator const_path_iterator; for (const_path_iterator pos = p.begin(); pos < p.end(); ++pos) { //... } } and got the error: error C2039: 'distance_to': is not an element of 'boost::filesystem::basic_path<String,Traits>::iterator' Seems to be a problem of the new iterator facade implementation. I had no trouble with this method until Boost 1.43.0. Any idea how to fix this? Pirx!

2 2

BOOST_FIXTURE_TEST_SUITE problem
by Olaf Peter 17 May '10

17 May '10

Hi, the simple snippet doesn't compile on 1.43 or trunk: #include <boost/test/unit_test.hpp> struct F { F() : i( 0 ) { BOOST_TEST_MESSAGE( "setup fixture" ); } ~F() { BOOST_TEST_MESSAGE( "teardown fixture" ); } int i; }; BOOST_FIXTURE_TEST_SUITE( s, F ) $ g++ -I ../boost/1.43/include/ rr.cpp -c rr.cpp:10: error: expected ‘}’ at end of input which results into: ... namespace s { static boost::unit_test::ut_detail::auto_test_unit_registrar s_registrar10( "s" ); typedef F BOOST_AUTO_TEST_CASE_FIXTURE; where the closing '}' is really missing. Does I miss something? Thanks, Olaf

2 1

Re: [Boost-users] Boost-users Digest, Vol 2362, Issue 3
by NuSkooler 17 May '10

17 May '10

> Are you using the trunk's version of STLPort? The STLPort in trunk has > modifications for use in android. Though it assumes it doesn't have RTTI > and exceptions. > You would need to add -D__ANDROID__ as well, since it is this that > STLPort checks for. > I'm still trying to compile and your email was *very* valuable. > Maybe creating a android.jam in the tools/ dir in boost.build would be > better. Glad the post has been helpful -- I probably should have re-tested without the STLPort references. Originally I had been using the standard non-modified NDK and the STLPort from the "ndk-wrappers" posts found on the NDK group. Later I found RTTI and exceptions just too hard to live without and upgraded to the Crystax modified NDK which contains it's own STL (no need for a external STLPort). I'll try re-compiling without any STLPort references now. A android.jam would be great -- So far I've found the jam build system very overwhelming though... I have no clue where to start on something like that. Bryan

1 0

Re: [Boost-users] [Asio]Question about error_code when socket::close
by 鑫炜廖 17 May '10

17 May '10

> Then you need to do reference counting yourself. You must count pending > asynchronous I/O operations and destroy the object when the counter is > decreased to 0. I don't think there is much else you can do? > Boris Thanks, that's a good idea and what I intended to do. Some what ugly, but can be hidden under the table :-)

2 2

Re: [Boost-users] [Asio]Question about error_code when socket::close
by Comet 17 May '10

17 May '10

> That is because you are most likely using the inefficient creation > style, probably like this: > shared_ptr<myClass> myPtr(new myClass(arg1,arg2)); > Which will also new a struct inside the shared_ptr that holds that > pointer and bookkeeping information. If you have read the shared_ptr > documentation, the efficient creation style is this: > shared_ptr<myClass> myPtr = make_shared<myClass>(arg1,arg2); > Which will new both your class and the bookkeeping information in the > same place in memory, increasing both the speed of creation (only one > new), and speed of accessing (better cache coherency). > When creating your objects at the same time (literally) as the > shared_ptr, that should fix most of those speed issues. That's not the point, make_shared can be used only when the object is created,but what I said is as follows: class Session : public boost::enable_shared_from_this<Session> { public: static void HandleRead(boost::weak_ptr<Session> session, const boost::system::error_code& error, size_t bytes_transferred) { if (session.expired()) return; ... } void Read() { // this line is very slow, // because boost::bind(&Session::HandleRead,shared_from_this(), ...) // causes extra new/delete operations socket_.async_read_some(boost::asio::buffer(...), boost::bind(&Session::HandleRead, shared_from_this(), _1, _2)); ... } void Close() { socket_.close(); } private: boost::asio::ip::tcp::socket socket_; }; std::set<boost::shared_ptr<Session> > session_set; boost::shared_ptr<Session> session = boost::make_shared<Session>(); session_set.insert(session); session->Read(); .... session->Close(); session_set->erase(session); // session is destroyed here, if I replace static void HandleRead(weak_prt ...) with void HandleRead(...) and boost::bind(&Session::HandleRead, shared_from_this()...), with boost::bind(&Session::HandleRead, this, ...); the question I asked emerges: void HandleRead(const boost::system::error_code& error, size_t bytes_transferred) { if (error) //should I erase shared_from_this() from session_set? this object may have been destroyed... } .... session->Close(); session_set->erase(session); // session is destroyed here. if I don't do this here, where should I do ? HandleRead may not be registered ever...

2 1

Re: [Boost-users] [fusion]simple fusion seq_size fails to compile
by Pete Bartlett 17 May '10

17 May '10

>The attached works; however, it just seems a lot of effort for such a simple task. >Anybody have a simpler way? Well, as you said the simpler way is to use the size function provided :-). Also your size implementation is somewhat unsatisfying in the sense that it uses empty which internally uses the library's size (meta)function. In fact I think size has to be implemented as a "core" function (i.e. not built up from other publically available functions) because it is implementation is necessarily quite different for different types of fusion sequence (e.g. array and an MPL sequence). Not an expert, Pete

2 1

[Function][Bind] Strange problem with g++ 4.5
by Maxime van Noppen 17 May '10

17 May '10

Hi, I've got a very strange problem with Boost.Function used in conjunction with Boost.Bind with g++ 4.5.0. Here is the minimal test case: ----------------gtest.cc--------------------------------- #include <boost/bind.hpp> #include <boost/function.hpp> #include <iostream> int fun(const int* id) { std::cout << "id: " << id << std::endl; std::cout << *id << std::endl; return 0; } int main() { typedef boost::function<int ()> func_t; int id = 42; std::cout << "id: " << &id << std::endl; func_t f = boost::bind(&fun, &id); //std::cout << f << std::endl; func_t g = f; g(); return 0; } ------------------------------------------------- When compiled with -O2 the program crashes: ------------------------------------------------- $ g++ -O2 gtest.cc && ./a.out id: 0x7fff3f7f85ec id: 0 Segmentation fault ------------------------------------------------- The problem seems to be inlining, when compiled with -O0 or -O2 -fno-inline everything works fine: ------------------------------------------------- $ g++ -O2 -fno-inline gtest.cc && ./a.out id: 0x7fff32b81a9c id: 0x7fff32b81a9c 42 $ g++ -O0 gtest.cc && ./a.out id: 0x7fff960b270c id: 0x7fff960b270c 42 ------------------------------------------------- What is very strange is that if I uncomment the std::cout of f everything works fine: ------------------------------------------------- $ g++ -O2 gtest.cc && ./a.out id: 0x7fff738619ac 1 id: 0x7fff738619ac 42 ------------------------------------------------- If the Boost.Function is not copied to g (ie, use f) everything works. Everything works fine with g++ (GCC) 4.4.3 20100316 (prerelease). I'm using Linux x86_64 with boost 1.42 and 1.43. Any idea of what may be going wrong here? -- Maxime

2 4

Re: [Boost-users] [Asio]Question about error_code when socket::close
by Comet 17 May '10

17 May '10

> void Read() { > // this line is very slow, > // because boost::bind(&Session::HandleRead,shared_from_this(), ...) > // causes extra new/delete operations My test result: ---------------------------------- raw ptr version ------------------------ a.cc: class A { public: void f() {} }; int main() { A a; boost::function<void ()> f; for (size_t i = 0; i < 100000000; ++i) { f = boost::bind(&A::f, &a); } } gcc a.cc -O2 time ./a.out real 0m1.235s user 0m1.232s sys 0m0.000s ------------------------------------ shared_ptr version ---------------------- a.cc: class A { public: static void f(boost::weak_ptr<A>) {} }; int main() { boost::shared_ptr<A> a = boost::make_shared<A>(); boost::function<void ()> f; for (size_t i = 0; i < 100000000; ++i) { f = boost::bind(&A::f, a); } } gcc a.cc -O2 time ./a.out real 0m25.925s user 0m25.898s sys 0m0.000s

1 0

linking for release, has debug baggage
by Dan Bloomquist 17 May '10

17 May '10

Hi, I have a large project and for what ever reason if I add xpressive.hpp in my precompiled header, it completly kills intelligence. So I figured I'd move the stuff I want to use off to a lib. Works fine in debug but if I build the release, this lib tries to link in the Microsoft debug libs. In my project: 1>mfcs90.lib(nolib.obj) : warning LNK4098: defaultlib 'mfc90d.lib' conflicts with use of other libs; use /NODEFAULTLIB:library 1>mfcs90.lib(nolib.obj) : warning LNK4098: defaultlib 'mfcs90d.lib' conflicts with use of other libs; use /NODEFAULTLIB:library and just this one in the test solution: 1>msvcrt.lib(cinitexe.obj) : warning LNK4098: defaultlib 'msvcrtd.lib' conflicts with use of other libs; use /NODEFAULTLIB:library I have been able to recreate the problem in a small solution that should not dependent on my directories other than setting the boost path: <http://lakeweb.net/downloads/RaVpath.zip> (20k) vc 2008 (9.0) boost 1_42 And I don't know, this may have nothing to do with boost, but I have other dlls and libs without this problem. It is coming from 'boost::filesystem' as best as I can determine. And maybe someone has seen this before and knows off the top of their head. Thanks, Dan.

2 1

[thread] Reader/Writer starvation
by Jérémy Coulon 17 May '10

17 May '10

Hi, According to the documentation of Boost 1.34 (before the major rewrite of boost::thread), the read/write lock was offering different scheduling policies. Some of those policies were providing a solution to the starvation problem that usually occurs with this kind of lock. http://www.boost.org/doc/libs/1_34_1/doc/html/thread/concepts.html#thread.c… http://www.boost.org/doc/libs/1_34_1/doc/html/thread/concepts.html#thread.c… But I don't find any reference to starvation and scheduling policies in the current Boost documentation (1.37). So, I am wondering if this starvation problem is solved in the current boost::thread implementation ? What scheduling policy is actually the default one ? Can the documentation be improved ? Thanks. Jeremy

2 1

Re: [Boost-users] [Asio]Question about error_code when socket::close
by 鑫炜廖 17 May '10

17 May '10

Igor R <boost.lists <at> gmail.com> writes: > > > I want to distinguish the error_code set by calling socket::close from any other ways (like system error, network > > error, etc), otherwise, I can't determine whether I should delete the object in async handlers, because > some have already been deleted after I call socket::close. If boost::asio::error::operation_aborted > definitely means "socket::close is called", I can distinguish this situation. > > It seems to be rather error-prone approach. One day, when your > application will have grown a bit, you'll find yourself hunting weird > segfaults / access-violations. > But when should I delete the object after I call socket::close? May be there's no async handler, so just deleting object in handlers leads to memory leak. > > I've tried using boost::weak_ptr with boost::bind,but the performance decrease dramatically. > > Did you run a performance profiler with fully-optimized application > and really discovered that the bottle-neck is in shared_ptr's?! This > would be really surprising... > I've tested it separately, when binding a weak_ptr/shared_ptr with a member function, it will cause extra new/delete operations, but raw pointer will not(gcc 4.4.1, boost 1.4.3).The former way is about 20 times slower,as a frequently operation, it seems not acceptable.

2 1

Re: [Boost-users] [fusion]simple fusion seq_size fails to compile
by Pete Bartlett 16 May '10

16 May '10

>Compilation of attachment 1 with gcc-4.5, produces errors in attachment 2. When the >'#if 1' on line 24 is changed to '#if 0', it compiles OK. > >What am I doing wrong? > >TIA. In the second "inner" instantiation of seq_size (ie the one taking in an empty sequence), what return type /could/ pop_front have? So intuitively a compile error is what I would expect here - and I think a literal reading of the documentation agrees because an empty sequence does not satisfy the fusion Sequence concept.

2 2

[fusion]simple fusion seq_size fails to compile
by Larry Evans 16 May '10

16 May '10

Compilation of attachment 1 with gcc-4.5, produces errors in attachment 2. When the '#if 1' on line 24 is changed to '#if 0', it compiles OK. What am I doing wrong? TIA. -regards, Larry /home/evansl/download/gcc/4.5-20100408/install/bin/g++ -c -Wall -ftemplate-depth-300 -O0 -g3 -fno-inline -std=gnu++0x -I/home/evansl/prog_dev/boost-svn/ro/trunk -DTEMPLATE_DEPTH=300 fusion_list_nil_function_specialization.cpp -MMD -o /home/evansl/prog_dev/boost-svn/ro/trunk/sandbox-local/build/gcc4_5n/sandbox/variadic_templates/libs/composite_storage/sandbox/fusion_list_nil_function_specialization.o In file included from /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/container/list/cons_iterator.hpp:14:0, from /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/container/list/cons.hpp:16, from /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/container/list.hpp:10, from fusion_list_nil_function_specialization.cpp:4: /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/container/list/detail/next_impl.hpp: In instantiation of 'boost::fusion::extension::next_impl<boost::fusion::cons_iterator_tag>::apply<boost::fusion::cons_iterator<boost::fusion::void_> >': /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/iterator/next.hpp:52:9: instantiated from 'boost::fusion::result_of::next<boost::fusion::cons_iterator<boost::fusion::void_> >' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/iterator/detail/distance.hpp:36:9: instantiated from 'boost::fusion::distance_detail::next_distance<boost::fusion::cons_iterator<boost::fusion::void_>, boost::fusion::cons_iterator<const boost::fusion::nil> >' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/mpl/eval_if.hpp:38:31: instantiated from 'boost::mpl::eval_if<boost::fusion::result_of::equal_to<boost::fusion::cons_iterator<boost::fusion::void_>, boost::fusion::cons_iterator<const boost::fusion::nil> >, boost::mpl::identity<mpl_::int_<0> >, boost::fusion::distance_detail::next_distance<boost::fusion::cons_iterator<boost::fusion::void_>, boost::fusion::cons_iterator<const boost::fusion::nil> > >' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/iterator/detail/distance.hpp:46:5: instantiated from 'boost::fusion::distance_detail::linear_distance<boost::fusion::cons_iterator<boost::fusion::void_>, boost::fusion::cons_iterator<const boost::fusion::nil> >' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/iterator/distance.hpp:37:13: instantiated from 'boost::fusion::extension::distance_impl<boost::fusion::cons_iterator_tag>::apply<boost::fusion::cons_iterator<boost::fusion::void_>, boost::fusion::cons_iterator<const boost::fusion::nil> >' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/iterator/distance.hpp:66:9: instantiated from 'boost::fusion::result_of::distance<boost::fusion::cons_iterator<boost::fusion::void_>, boost::fusion::cons_iterator<const boost::fusion::nil> >' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/view/iterator_range/iterator_range.hpp:33:74: instantiated from 'boost::fusion::iterator_range<boost::fusion::cons_iterator<boost::fusion::void_>, boost::fusion::cons_iterator<const boost::fusion::nil> >' fusion_list_nil_function_specialization.cpp:25:52: instantiated from 'unsigned int seq_size(const FusionSeq&) [with FusionSeq = boost::fusion::iterator_range<boost::fusion::cons_iterator<const boost::fusion::nil>, boost::fusion::cons_iterator<const boost::fusion::nil> >]' fusion_list_nil_function_specialization.cpp:25:52: instantiated from 'unsigned int seq_size(const FusionSeq&) [with FusionSeq = boost::fusion::list<int>]' fusion_list_nil_function_specialization.cpp:35:45: instantiated from here /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/container/list/detail/next_impl.hpp:37:54: error: invalid use of incomplete type 'struct boost::fusion::extension::next_impl<boost::fusion::cons_iterator_tag>::apply<boost::fusion::cons_iterator<boost::fusion::void_> >::cons_type' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/container/list/list_fwd.hpp:15:12: error: forward declaration of 'struct boost::fusion::extension::next_impl<boost::fusion::cons_iterator_tag>::apply<boost::fusion::cons_iterator<boost::fusion::void_> >::cons_type' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/container/list/detail/next_impl.hpp:45:17: error: invalid use of incomplete type 'struct boost::fusion::extension::next_impl<boost::fusion::cons_iterator_tag>::apply<boost::fusion::cons_iterator<boost::fusion::void_> >::cons_type' /home/evansl/prog_dev/boost-svn/ro/trunk/boost/fusion/container/list/list_fwd.hpp:15:12: error: forward declaration of 'struct boost::fusion::extension::next_impl<boost::fusion::cons_iterator_tag>::apply<boost::fusion::cons_iterator<boost::fusion::void_> >::cons_type' ,,,

1 0

[statechart] transition exception
by Christophe Bourez 16 May '10

16 May '10

Hi, Is it possible to transit<> back to the source state when an exception is thrown by the handler of a transition ? Pls, note that the handler of the transition can be used by several transitions in the state diagram. The state machine, being in a transition, is between two stable states. The exception can be handled by the innermost common outer state (or anyone above). In an handler of this state, is it possible to force transit<> to the source state of the transition that throws the exception ? Or is it possible to manage it differently ? Thank you for your help, Christophe

2 1

Problem with "prod" function
by gicatena＠libero.it 16 May '10

16 May '10

The following code is not working for me: --------------------------------------- using namespace boost::numeric::ublas; matrix<double> m (3, 3); matrix<double> o (3, 3); for (unsigned i = 0; i < m.size1 (); ++ i) for (unsigned j = 0; j < m.size2 (); ++ j) { m (i, j) = 3 * i + j; o (i, j) = 3 * i + j; } std::cout << m << o << std::endl; matrix_vector_binary2< matrix_row< matrix<double> >, matrix<double>, double > D; D = prod(row(m, 1),o); --------------------------------------- the error is 1>c:\program files (x86) \boost\boost_1_42\boost\numeric\ublas\matrix_expression.hpp(3809) : error C2825: 'F': must be a class or namespace when followed by '::' 1> c:\users\alex\desktop\testngage\testngage\testngage.cpp(21) : see reference to class template instantiation 'boost::numeric::ublas:: matrix_vector_binary2<E1,E2,F>' being compiled 1> with 1> [ 1> E1=boost::numeric::ublas::matrix_row<boost::numeric::ublas:: matrix<double>>, 1> E2=boost::numeric::ublas::matrix<double>, 1> F=double 1> ] 1>c:\program files (x86) \boost\boost_1_42\boost\numeric\ublas\matrix_expression.hpp(3809) : error C2039: 'result_type' : is not a member of '`global namespace'' 1>c:\program files (x86) \boost\boost_1_42\boost\numeric\ublas\matrix_expression.hpp(3809) : error C2146: syntax error : missing ';' before identifier 'value_type' 1>c:\program files (x86) \boost\boost_1_42\boost\numeric\ublas\matrix_expression.hpp(3809) : error C4430: missing type specifier - int assumed. Note: C++ does not support default- int 1>c:\program files (x86) \boost\boost_1_42\boost\numeric\ublas\matrix_expression.hpp(3810) : error C2146: syntax error : missing ';' before identifier 'const_reference' 1>c:\program files (x86) \boost\boost_1_42\boost\numeric\ublas\matrix_expression.hpp(3810) : error C4430: missing type specifier - int assumed. Note: C++ does not support default- int 1>c:\program files (x86) \boost\boost_1_42\boost\numeric\ublas\matrix_expression.hpp(3810) : error C4430: missing type specifier - int assumed. Note: C++ does not support default- int 1>c:\program files (x86) \boost\boost_1_42\boost\numeric\ublas\matrix_expression.hpp(3811) : error C2146: syntax error : missing ';' before identifier 'reference' 1>c:\program files (x86) \boost\boost_1_42\boost\numeric\ublas\matrix_expression.hpp(3811) : error C4430: missing type specifier - int assumed. Note: C++ does not support default- int 1>c:\program files (x86) \boost\boost_1_42\boost\numeric\ublas\matrix_expression.hpp(3811) : error C4430: missing type specifier - int assumed. Note: C++ does not support default- int 1>c:\users\alex\desktop\testngage\testngage\testngage.cpp(21) : error C2512: 'boost::numeric::ublas::matrix_vector_binary2<E1,E2,F>' : no appropriate default constructor available 1> with 1> [ 1> E1=boost::numeric::ublas::matrix_row<boost::numeric::ublas:: matrix<double>>, 1> E2=boost::numeric::ublas::matrix<double>, 1> F=double 1> ] 1>c:\users\alex\desktop\testngage\testngage\testngage.cpp(23) : error C2679: binary '=' : no operator found which takes a right-hand operand of type 'boost:: numeric::ublas::matrix_vector_binary2<E1,E2,F>' (or there is no acceptable conversion) 1> with 1> [ 1> E1=boost::numeric::ublas::matrix_row<boost::numeric::ublas:: matrix<double>>, 1> E2=boost::numeric::ublas::matrix<double>, 1> F=boost::numeric::ublas::matrix_vector_prod2<boost::numeric:: ublas::matrix_row<boost::numeric::ublas::matrix<double>>,boost::numeric::ublas:: matrix<double>,double> 1> ] 1> c:\program files (x86) \boost\boost_1_42\boost\numeric\ublas\matrix_expression.hpp(4075): could be 'boost::numeric::ublas::matrix_vector_binary2<E1,E2,F> &boost::numeric::ublas:: matrix_vector_binary2<E1,E2,F>::operator =(const boost::numeric::ublas:: matrix_vector_binary2<E1,E2,F> &)' 1> with 1> [ 1> E1=boost::numeric::ublas::matrix_row<boost::numeric::ublas:: matrix<double>>, 1> E2=boost::numeric::ublas::matrix<double>, 1> F=double 1> ] 1> while trying to match the argument list '(boost::numeric::ublas:: matrix_vector_binary2<E1,E2,F>, boost::numeric::ublas::matrix_vector_binary2<E1, E2,F>)' 1> with 1> [ 1> E1=boost::numeric::ublas::matrix_row<boost::numeric::ublas:: matrix<double>>, 1> E2=boost::numeric::ublas::matrix<double>, 1> F=double 1> ] 1> and 1> [ 1> E1=boost::numeric::ublas::matrix_row<boost::numeric::ublas:: matrix<double>>, 1> E2=boost::numeric::ublas::matrix<double>, 1> F=boost::numeric::ublas::matrix_vector_prod2<boost::numeric:: ublas::matrix_row<boost::numeric::ublas::matrix<double>>,boost::numeric::ublas:: matrix<double>,double> 1> ] where am I getting wrong?

3 2

[MPL] searching a vector at runtime
by Alexander Lamaison 16 May '10

16 May '10

I'm trying to recursively traverse an MPL vector_c but I'm not sure what the base-case type should be. I want to pick a type from a mpl::vector at runtime and use it to dispatch a call to an overloaded function. Basically tag-dispatch with the tags being looked up in an MPL collection. The runtime value is an unsigned it so I just store unsigned ints in a vector_c. Then I want to traverse this vector and compare each item to the runtime value. If I find a match, I want to use it to call an overloaded function. Here's how I'm trying to do it so far: template<typename ID> class message { ... } template<typename Sequence> // MAP is a vector_c struct dispatcher { template<typename T> static result dispatch(T* obj, unsigned int message_id, int arg) { typedef boost::mpl::front<Sequence>::type head; typedef boost::mpl::pop_front<Sequence>::type tail; if (head::value == message_id) return obj->handle(message<head::value>, arg); else return dispatcher<tail>::dispatch(obj, message_id, arg); } }; template<> struct dispatcher<boost::mpl::void_> // WHAT SHOULD THIS TYPE BE? { template<typename T> static result dispatch(T* obj, unsigned int message_id, int arg) { return obj->default_message_handler(message_id, arg); } }; struct handler { result handle(message<MESSAGE1>) { /* do stuff 1 */ } result handle(message<MESSAGE2>) { /* do stuff 2 */ } result default_message_handler(unsigned int id, int arg) {} } I'm stuck on what to make the dispatcher base case which is reached when pop_front is called on a list with one item. At first I though the resulting type was void_ but apparently this doesn't match. I'm new to MPL. Can someone explain what I'm doing wrong here or if there's an altogether better way? Many thanks. Alex Lamaison

2 3

mpl: copy algorithm question
by Hicham Mouline 16 May '10

16 May '10

Hello, I need to copy a range_c into a vector_c because I need to transform that sequence, and I have difficulties transforming range_c . This code works typedef boost::mpl::range_c<std::size_t, 2u, 10> range_t; typedef boost::mpl::vector_c<std::size_t> all_dims1_t; typedef boost::mpl::copy< range_t, boost::mpl::back_inserter<all_dims1_t> >::type all_dims_t; but then I need the 10 to be a template parameter, so I wrap it in this struct template <std::size_t max_dim> struct S { typedef boost::mpl::range_c<std::size_t, 2u, max_dim> range_t; typedef boost::mpl::vector_c<std::size_t> all_dims1_t; typedef boost::mpl::copy< range_t, boost::mpl::back_inserter<all_dims1_t> >::type all_dims_t; }; The error is: error: type 'boost::mpl::copy<...>' is not derived from type 'S<max_dim>' Really strange? Regards,

2 2

multi_array: once more about a number of dimensions known only at runtime
by Hicham Mouline 16 May '10

16 May '10

Hello, I have been directed to this discussion: http://lists.boost.org/boost-users/2009/08/50601.php when I asked this question before. There are interesting solutions from OvermindDL1 and from Jesse Perla. Basically, define a variant over all the possible multi_array types as: template <typename T, std::size_t max_dim > class multi_array_runtime_dims { typedef variant< multi_array<T, 2>, multi_array<T, 3>, ... multi_array<T, max_dim> > type; }; Setting up the extents can be done at runtime as well. I wonder if there has been further thought about the issue, and also what the library designers thinks about it. Regards,

1 0

[thread] windows.h threads and boost.thread can work together?
by martabm 16 May '10

16 May '10

Hi everyone. In an existing and large visual c++ application, I want to port threads from windows.h ones (CreateThread function) to boost.thread. Due to the size of the application I must do it progressively, so it means, during a while, the coexistence of windows threads with boost threads. Is it a bad idea? Can they work together? Threads here are synchronized by events and critical sections which also I want to port to boost Condition Variables and Mutexes. I'm using a visual C++ 2008, with win32. Thank you in advance, Marta.

3 3

boost iostreams zlib_compressor not compatible with zlib.NET
by Johan Ditmar 16 May '10

16 May '10

Hello, I would like to send compressed data between my C# to a C++ application in ZLIB format. In C++, I use the iostreams::zlib_compressor/zlib_decompressor. In C# I am currently using the ZOutputStream available in the zlib.NET library. First of all, when I compress the same data using both libraries, the results look different: 1.boost::iostreams::zlib_compressor: FF 13 49 48 00 00 01 00 01 00 00 00 63 61 60 60 F8 00 C4 C1 25 45 99 79 E9 23 87 04 00 2.zlib.NET (zlib.ZOutputStream): FF 13 49 48 00 00 01 00 01 00 00 00 78 9C 63 61 60 60 F8 00 C4 C1 25 45 99 79 E9 23 87 04 00 4F 31 63 8D (Note the 78 9C pattern that is present in zlib.NET, but not in boost). Furthermore, when I decompress data in zlib_decompressor that I compressed in zlib.NET, I am not able to read from the stream suggesting something is wrong. It does work when I try to decompress data compressed in the zlib_compressor. Does anybody know what is behind this incompatibility and whether there is an easy solution? Thank you, Johan _________________________________________________________________ http://clk.atdmt.com/UKM/go/197222280/direct/01/ We want to hear all your funny, exciting and crazy Hotmail stories. Tell us now

2 1

[Program Options] Linking both statically and dynamically
by Anthony Foglia 16 May '10

16 May '10

We are trying to link boost program options both statically and dynamically in an executable but when the executable finishes, it glibc reports a "double free or corruption" error. The odd linking arises because we have a common library for our project with some modifications to program options (in particular a parser with built-in help and version options), but our executable code still refers to program options directly (both because it needs to use functions and classes from program options, and because the code hasn't been updated to use our custom parser.) We are linking dynamically to the system-wide program options library, but our utility library is built and linked to statically. (Our build system is boost-build, which determines the linker line.) Should such a linking be possible? Our workaround is to force all linking to program options to be static, which I think I've figured out. -- Anthony Foglia Princeton Consultants (609) 987-8787 x233

2 3

[Asio]Question about error_code when socket::close
by Comet 15 May '10

15 May '10

The documentation says, " Any asynchronous send, receive or connect operations will be cancelled immediately, and will complete with the boost::asio::error::operation_aborted error." Is this the only way that boost::asio::error::operation_aborted be passed to async handlers? I want to distinguish the error_code set by calling socket::close from any other ways (like system error, network error, etc), otherwise, I can't determine whether I should delete the object in async handlers, because some have already been deleted after I call socket::close. If boost::asio::error::operation_aborted definitely means "socket::close is called", I can distinguish this situation. I've tried using boost::weak_ptr with boost::bind,but the performance decrease dramatically. thx.

2 1

Class generation using inherit_linearly
by Peter Nyssen 15 May '10

15 May '10

Dear boost users, I'm clearly missing something w.r.t. mpl_inherit and lamba functions. Could someone enlighten me as to why the following code fails to compile? The integer template argument in the lambda expression seems to be the cause? //-------------------------- #include <boost/mpl/inherit.hpp> #include <boost/mpl/inherit_linearly.hpp> #include <boost/mpl/placeholders.hpp> #include <boost/mpl/vector.hpp> using namespace boost; using namespace boost::mpl::placeholders; template <int C, class T> struct Wrap { T value; }; typedef mpl::vector< int, long > myMemberTypes; typedef mpl::inherit_linearly< myMemberTypes, mpl::inherit<_1, Wrap<5, _2> > >::type MyClass; //-------------------------- Many thanks, Peter

2 1

[Spirit] question about alternative list expressions
by philip tucker 15 May '10

15 May '10

/* Hello, This code (second copy attached) compiles to recognize dotlists, ie "a", "a.b", etc. I want to report on incomplete list errors of the following kind a. a.# The parser now detects such errors by failing to parse them completely. Instead I want to expect an id after a '.'. In dotlist_grammar() I wanted to replace this expression start %= (id % '.') ; with this one start %= (id >> (*('.' > id))) ; // XXX but it won't compile. Neither will this start %= (id >> (*('.' >> id))) ; // XXX What's wrong? Is there a difference between the synthesized attributes of the two alternative list expressions? Or is it a different bug? P.S. Both expressions seem to work for int_ instead of id. Thanks. */ #include <boost/config/warning_disable.hpp> #include <boost/spirit/include/qi.hpp> #include <boost/fusion/include/adapt_struct.hpp> #include <boost/spirit/include/phoenix_core.hpp> #include <boost/spirit/include/phoenix_operator.hpp> #include <boost/spirit/include/phoenix_fusion.hpp> #include <boost/spirit/include/phoenix_stl.hpp> #include <boost/spirit/include/phoenix_object.hpp> #include <boost/fusion/include/adapt_struct.hpp> #include <boost/fusion/include/io.hpp> #include <boost/fusion/sequence.hpp> #include <boost/fusion/include/sequence.hpp> #include <boost/algorithm/string/trim.hpp> #include <iostream> namespace ecgp { using namespace std; namespace qi = boost::spirit::qi; namespace ascii = boost::spirit::ascii; namespace fusion = boost::fusion; namespace phoenix = boost::phoenix; typedef ascii::space_type space; // structures, etc. struct structure { vector<string> dotlist; int filler; // fusion requires >1 members?! void print(ostream& o) const { int i=0; BOOST_FOREACH(string s, dotlist) { if(++i > 1) o << '.'; o << s; } } }; ostream& operator<<(ostream& o, structure const & c) { c.print(o); return o; }; } BOOST_FUSION_ADAPT_STRUCT( ecgp::structure, (std::vector<std::string>, dotlist) (int, filler) // fusion requires >1 members?! ) namespace ecgp { // actions void print_str(string const & v) { cout << "str: "; cout << v << endl; } void print_dotlist(vector<string> const & v) { cout << "dotlist: "; int i=0; BOOST_FOREACH(string s, v) { if(++i > 1) cout << '.'; cout << s; } cout << endl; } void print_structure(structure const & v) { cout << "structure: "; print_dotlist(v.dotlist); cout << endl; } // grammars template <typename Iterator> // recognize an identifier struct id_grammar : qi::grammar<Iterator, string(), space> { id_grammar() : id_grammar::base_type(start) { using ascii::alpha; using qi::lexeme; start %= lexeme[ +alpha ] [ &print_str ] ; } qi::rule<Iterator, string(), space> start; }; template <typename Iterator> // recognize a dotlist, ie (string % '.') struct dotlist_grammar : qi::grammar<Iterator, vector<string>(), space> { dotlist_grammar() : dotlist_grammar::base_type(start) { using qi::int_; using qi::lexeme; start %= // (id >> (*('.' > id))) // XXX (id % '.') [ &print_dotlist ] ; } id_grammar<Iterator> id; qi::rule<Iterator, vector<string>(), space> start; }; template <typename Iterator> struct structure_grammar : qi::grammar<Iterator,structure(),space> { structure_grammar() : structure_grammar::base_type(start) { using qi::eps; using qi::int_; start %= ( dotlist >> (int_ | eps) // filler ) [ &print_structure ] ; } dotlist_grammar<Iterator> dotlist; qi::rule<Iterator, structure(), space> start; }; } int main() { using namespace std; using namespace ecgp; using namespace boost; typedef string::const_iterator string_iterator; string s; cout << "enter a dotlist:\n"; while (getline(cin, s)) { trim(s); string_iterator iter = s.begin(); string_iterator end = s.end(); string target(iter, end); structure list_container; structure_grammar<string_iterator> g; bool r = phrase_parse(iter, end, g, boost::spirit::ascii::space, list_container); if (r && iter == end) { cout << "OK: " << target; cout << endl << endl; } else { cout << "FAIL"; if(! r) cout << "(p)"; if(iter != end) cout << "(e)"; cout << ": " << target; cout << endl << endl; } cout << "enter a dotlist:\n"; } return 0; }

2 2

statechart not working...
by Noah Roberts 14 May '10

14 May '10

Why isn't this statechart doing anything? struct mouse_move : sc::event<mouse_move> {}; struct lock_fly : sc::event<lock_fly> {}; struct unlock_fly : sc::event<unlock_fly> {}; struct arrow_outer; struct arrow_tool : sc::state_machine<arrow_tool,arrow_outer> {}; struct unlocked; struct arrow_outer : sc::simple_state<arrow_outer, arrow_tool, unlocked> {}; struct locked : sc::simple_state<locked, arrow_outer> { locked() { std::cerr << "locked\n"; } ~locked() { std::cerr << "unlocking\n"; } typedef sc::transition<unlock_fly, unlocked> reactions; }; struct unlocked : sc::simple_state<unlocked, arrow_outer> { unlocked() { std::cerr << "unlocked\n"; } ~unlocked() { std::cerr << "locking\n"; } typedef sc::transition<lock_fly,locked> reations; }; int main() { arrow_tool tool; tool.initiate(); //tool.process_event(mouse_move()); tool.process_event(lock_fly()); //tool.process_event(mouse_move()); tool.process_event(unlock_fly()); //tool.process_event(mouse_move()); std::cin.get(); } I expect: unlocked locking locked unlocking unlocked locking I get: unlocked locking My events are obviously not triggering transitions. From what I can tell it's almost exactly like the stopwatch example with some different names and no self-transition in the outermost state. I've stepped through the program and it seems that the event processor ends up passing everything down as an unrecognized event. -- http://crazyeddiecpp.blogspot.com/

1 1

[GIL] How do you use GIL?
by Lubomir Bourdev 14 May '10

14 May '10

If you are using GIL in your project and don’t mind being quoted, could you please email me your name, your project/company or university and any optional comments? We will be giving a tutorial for Boost.GIL at the CVPR 2010 conference in San Francisco on June 13. CVPR is an international conference in computer vision attended by many people from both industry and academia. This is an opportunity to promote the boost libraries in general. Thanks, Lubomir

1 0

[MPI] Test Processor Counts
by Belcourt, Kenneth 14 May '10

14 May '10

Hi, While running the trunk tests, we've found that occasionally the system load average jumps up over 100 and occasionally hits 200. As you can imagine for 8 to 32 core systems, this adversely impacts users on those systems. The issue is that I'm running the trunk tests in parallel, usually -j8 to -j32 and when the MPI tests run, we run into the high load problem. Some of the MPI tests run up to 17 processors so the combination of parallel testing and large processor count tests cause this issue. Now the high load average may last for only 5 to 15 minutes or so but this is enough to trigger a sysadmin question asking what I'm up. I'm looking for a solution that wouldn't require significantly reducing testing throughput. Possible solutions might include serializing the execution of the MPI tests using something like the link-semaphore in Boost.Build, reducing the processor counts of the MPI tests, only running the larger tests on unchecked or unknown MPI implementations, setting up an MPI machine file to run the MPI tests off of the local system that built the executable, etc... Any other ideas on how to manage this? Thanks. -- Noel

1 0

Re: [Boost-users] Boost-users Digest, Vol 2359, Issue 1
by Mauricio Gomes 14 May '10

14 May '10

Hi Harmut, Did you uncomment the line: //#include <boost/spirit/include/qi_no_skip.hpp> ? It is commented out in the code below. If I include this line, compilation fails. You also have to check optimizations because the code below is not using no_skip[] in the grammar so there is a chance that a smart compiler that is not in debug mode might ignore the non-used code. In my case I am in debug mode, no optmizations and including the qi_no_skip.hpp header suffices to get the error. Thanks for your attention ! 1. Re: Spirit: parsing tab separated values and no_skip > compilation error. (Hartmut Kaiser) > ---------------------------------------------------------------------- > > Message: 1 > Date: Thu, 13 May 2010 18:28:19 -0500 > From: "Hartmut Kaiser" <hartmut.kaiser(a)gmail.com> > To: <boost-users(a)lists.boost.org> > Subject: Re: [Boost-users] Spirit: parsing tab separated values and > no_skip compilation error. > Message-ID: <0d5301caf2f3$fa1c64e0$ee552ea0$(a)gmail.com> > Content-Type: text/plain; charset="iso-8859-1" > > > I am a beginner with Spirit. I just read the tutorial and I am playing > > around with some examples. > > Environment: boost 1.43, Windows Vista, Code::Blocks, mingw, gcc 4.5. > > > > My goal is to build a tab separated values parser. > > If you have an example on how to parse something like: > > string/t/tdouble/tdouble > > it would be great. Contiguous tabs should be considered as one tab, not > an > > empty field. > > > > To start I just tried to parse a tab separated list of strings but I am > > having some difficulties. > > > > Is there another skip parser to be used instead of space (for full code > > see the end of the message below) ? > > I have changed the commas to tabs in the code below but it failed. I > guess > > it was because it was skipping them (space skipper). > > > > ??????? bool r = phrase_parse(first, last, > > > > ??????????? //? Begin grammar > > ??????????? ( > > ??????????????? +(char_ - ',') % ',' > > ??????????? ) > > ??????????? , > > ??????????? //? End grammar > > > > ??????????? space, v); > > > > This code works with commas but it fails with '\t'. > > > > I tried to use no_skip[] but it failed to compile the header #include > > <boost/spirit/include/qi_no_skip.hpp>: > > > > C:\boost_1_43_0\boost\spirit\home\qi\directive\no_skip.hpp|30|error: > > 'no_skip' is not a member of 'boost::spirit::tag'| > > > > For full error message see the end of the message below. > > > > Any suggestions ? > > > > Thank you for your attention, > > Mau. > > > > #include <boost/config/warning_disable.hpp> > > #include <boost/spirit/include/qi.hpp> > > #include <boost/spirit/include/phoenix_core.hpp> > > #include <boost/spirit/include/phoenix_operator.hpp> > > #include <boost/spirit/include/phoenix_stl.hpp> > > //#include <boost/spirit/include/qi_no_skip.hpp> > > > > #include <iostream> > > #include <string> > > #include <vector> > > > > #define VECTOR_TYPE std::string > > > > namespace client > > { > > ??? namespace qi = boost::spirit::qi; > > ??? namespace ascii = boost::spirit::ascii; > > > > ??? > ////////////////////////////////////////////////////////////////////// > > ///// > > ??? //? Our number list compiler > > ??? > ////////////////////////////////////////////////////////////////////// > > ///// > > ??? //[tutorial_numlist4 > > ??? template <typename Iterator> > > ??? bool parse_numbers(Iterator first, Iterator last, > > std::vector<VECTOR_TYPE>& v) > > ??? { > > ??????? using qi::double_; > > ??????? using qi::phrase_parse; > > ??????? using qi::_1; > > ??????? using ascii::space; > > ??????? using qi::char_; > > > > ??????? bool r = phrase_parse(first, last, > > > > ??????????? //? Begin grammar > > ??????????? ( > > ??????????????? +(char_ - ',') % ',' > > ??????????? ) > > ??????????? , > > ??????????? //? End grammar > > > > ??????????? space, v); > > > > ??????? if (first != last) // fail if we did not get a full match > > ??????????? return false; > > ??????? return r; > > ??? } > > ??? //] > > } > > > > > ////////////////////////////////////////////////////////////////////////// > > // > > //? Main program > > > ////////////////////////////////////////////////////////////////////////// > > // > > int > > main() > > { > > ??? std::cout << > > "/////////////////////////////////////////////////////////\n\n"; > > ??? std::cout << "\t\tA comma separated list parser for Spirit...\n\n"; > > ??? std::cout << > > "/////////////////////////////////////////////////////////\n\n"; > > > > ??? std::cout << "Give me a comma separated list of numbers.\n"; > > ??? std::cout << "The numbers will be inserted in a vector of numbers\n"; > > ??? std::cout << "Type [q or Q] to quit\n\n"; > > > > ??? std::string str; > > ??? while (getline(std::cin, str)) > > ??? { > > ??????? if (str.empty() || str[0] == 'q' || str[0] == 'Q') > > ??????????? break; > > > > ??????? std::vector<VECTOR_TYPE> v; > > ??????? if (client::parse_numbers(str.begin(), str.end(), v)) > > ??????? { > > ??????????? std::cout << "-------------------------\n"; > > ??????????? std::cout << "Parsing succeeded\n"; > > ??????????? std::cout << str << " Parses OK: " << std::endl; > > > > ??????????? for (std::vector<VECTOR_TYPE>::size_type i = 0; i < v.size(); > > ++i) > > ??????????????? std::cout < > > > ??????????? std::cout << "\n-------------------------\n"; > > ??????? } > > ??????? else > > ??????? { > > ??????????? std::cout << "-------------------------\n"; > > ??????????? std::cout << "Parsing failed\n"; > > ??????????? std::cout << "-------------------------\n"; > > ??????? } > > ??? } > > > > ??? std::cout << "Bye... :-) \n\n"; > > ??? return 0; > > } > > This example compiles fine for me (VC10, g++ 4.5). Is it supposed to fail? > > Regards Hartmut > > --------------- > Meet me at BoostCon > www.boostcon.com > > > > >

1 0

[signals] What's special about iterators passed to combiners?
by Boris Schaeling 14 May '10

14 May '10

A reader of my book noticed that the sample program at http://en.highscore.de/cpp/boost/src/4.2.8/main.cpp which uses a combiner to return the smallest value of all slot values is buggy. The combiner's implementation is rather simple as iterators are simply forwarded to std::min_element(): template <typename T> struct min_element { typedef T result_type; template <typename InputIterator> T operator()(InputIterator first, InputIterator last) const { return *std::min_element(first, last); } }; As simple as the implementation is: This combiner does not return the smallest value but always the value the first iterator refers to (at least with VC++ 2008 and g++ 4.2.1). This can be easily tested by swapping the return values of the two functions func1() and func2() in the sample program. First I was trying to find a fix - temporarily copying the values to a container is all what is needed: T operator()(InputIterator first, InputIterator last) const { std::vector<T> v(first, last); return *std::min_element(v.begin(), v.end()); } Then I was trying to understand what's special about the iterators. Please look at the following code and guess whether the values printed will be different or not: T operator()(InputIterator first, InputIterator last) const { InputIterator temp = first; ++first; std::cout << *first << std::endl; std::cout << *temp << std::endl; } If you think you get two different values then you'll be as surprised as I am: Both iterators temp and first return the second value in the range [first, last). I can't find any explanation in the Boost.Signals documentation. I wouldn't be surprised though if this is a known issue because there is a sample combiner called maximum used (see http://www.boost.org/doc/libs/1_43_0/doc/html/signals/tutorial.html#id17304…) which doesn't use an algorithm from the C++ standard (I guess intentionally?). Anyway: Is this a bug? If it isn't is there a recommended work-around (apart from temporarily copying values to a container)? Then it's probably not safe to use any C++ standard algorithm in combiners? Could this be added to the FAQ or anywhere else in the Boost.Signals documentation? Boris

3 3

[Boost.Units] quantity<unit> problem with template specialisation algorithm?
by Thomas Shorrock 14 May '10

14 May '10

Hello, many thankyous to the developers of Boost.Units and Boost libraries generally, I have been using them for a few years now and this is my first difficulty. I have been having some problems when using template specialisation (g++ 4.4.3) with Boost.Units (Boost 1_42_0). When calling a specialised template function I have found that I need to be very careful with the argument, In short, specialised_templated_function(1.0 * boost::units::si::metre) works fine specialised_templated_function(1 * boost::units::si::metre) specialised function is not found (default tried) This caught me out for a while and so I thought I would report it in case it is a small bug. If this is not a Boost issue then my appologies. In detail, here is the code to reproduce: #include <iostream> #include <boost/units/systems/si.hpp> namespace bu = boost::units; /** Convert arbitrary units into seconds * When a distance is provided, the speed parameter is used to calculate the time. * Otherwise the speed variable is ignored. */ template<class unit> bu::quantity<bu::si::time> any2second(const unit& t, const bu::quantity<bu::si::velocity>& speed =1*bu::si::meters_per_second) { return bu::quantity<bu::si::time>(t); } /* Specialisations for quantity<length> */ template<> bu::quantity<bu::si::time> any2second(const bu::quantity<bu::si::length>& d, const bu::quantity<bu::si::velocity>& speed) { return bu::quantity<bu::si::time>(d / speed); } int main() { //The following use the default function and work fine std::cout<<"any2second(1.0*s) = "<<any2second(1.0*bu::si::second)<<std::endl; std::cout<<"any2second(1*s) = "<<any2second(1*bu::si::second)<<std::endl; //The following uses the specialised function and works fine std::cout<<"any2second(1.0*m) = "<<any2second(1.0*bu::si::metre, 1*bu::si::meters_per_second)<<std::endl; //The following tries to use the defualt function rather than the specialisation. //It does not compile because (correctly) a metre cannot be converted into a second. //std::cout<<"any2second(1*m) = "<<any2second(1*bu::si::metre, 1*bu::si::meters_per_second)<<std::endl; return 0; } Many thanks, Tom The Institute of Cancer Research: Royal Cancer Hospital, a charitable Company Limited by Guarantee, Registered in England under Company No. 534147 with its Registered Office at 123 Old Brompton Road, London SW7 3RP. This e-mail message is confidential and for use by the addressee only. If the message is received by anyone other than the addressee, please return the message to the sender by replying to it and then delete the message from your computer and network.

3 2

[date_time] how to generate a random date?
by Saygin Arkan 14 May '10

14 May '10

Hi, Does boost's date provide a random date generation? Or somehow should I generate my own date and then pass as a parameter? date GeneratorUtils::getRandomDate() { int year, month ,day; day = 1 + rand() % 29; month = 1 + rand() % 11; year = 1980 + rand() % 25; date d(year, month, day); return d; } currently this is my implementation, but sometimes it returns invalid month value. terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::gregorian::bad_day_of_month> >' what(): Day of month is not valid for year Probably because of something like 29th Feb or sth like that. I rarely saw that exception. I could modify the code easiy but I just wanted to know that if such a functionality exists? Thanks a lot, I've started to adore boost after uuid & date =) -- Saygin

3 3

[proto, fusion] Segfault in for_each
by David A. Greene 14 May '10

14 May '10

I'm using boost 1.42. As part of a proto transform, I am flattening an expression tree of comma operators and sending it to fusion::transform followed by fusion::for_each, something like this: for_each(transform(flatten(expr), func1), func2) I am getting a segmentation fault in for_each. func1 does not appear to be invoked. Program output: Building type list: comma( comma( function( terminal(int_) , terminal(32) ) , function( terminal(float_) , terminal(32) ) ) , function( terminal(int_) , terminal(16) ) ) 3 items Program received signal SIGSEGV, Segmentation fault. 0x0804d52d in boost::proto::result_of::child_c<Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::comma, boost::proto::argsns_::list2<Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list2<Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<Builder::keyword::int_>, 0l> > const&, Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<int const&>, 0l> > >, 2l> > const&, Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list2<Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<Builder::keyword::float_>, 0l> > const&, Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<int const&>, 0l> > >, 2l> > const&>, 2l> > const&, 0l>::call (e=...) at /usr/include/boost/proto/traits.hpp:1544 (gdb) print e $1 = (const Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::comma, boost::proto::argsns_::list2<Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list2<Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<Builder::keyword::int_>, 0l> > const&, Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<int const&>, 0l> > >, 2l> > const&, Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list2<Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<Builder::keyword::float_>, 0l> > const&, Builder::Wrapper<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<int const&>, 0l> > >, 2l> > const&>, 2l> > &) @0x0: <error reading variable> Note the null expression reference. fusion::distance on a begin/end pair from the same sequence works as expected so I believe the sequence is at least well-formed. I've been wrestling with this for days. Any ideas on how to debug this? Thanks! -Dave

4 5

Spirit: parsing tab separated values and no_skip compilation error.
by Mauricio Gomes 13 May '10

13 May '10

Hi, I am a beginner with Spirit. I just read the tutorial and I am playing around with some examples. Environment: boost 1.43, Windows Vista, Code::Blocks, mingw, gcc 4.5. My goal is to build a tab separated values parser. If you have an example on how to parse something like: string/t/tdouble/tdouble it would be great. Contiguous tabs should be considered as one tab, not an empty field. To start I just tried to parse a tab separated list of strings but I am having some difficulties. Is there another skip parser to be used instead of space (for full code see the end of the message below) ? I have changed the commas to tabs in the code below but it failed. I guess it was because it was skipping them (space skipper). bool r = phrase_parse(first, last, // Begin grammar ( +(char_ - ',') % ',' ) , // End grammar space, v); This code works with commas but it fails with '\t'. I tried to use no_skip[] but it failed to compile the header #include <boost/spirit/include/qi_no_skip.hpp>: C:\boost_1_43_0\boost\spirit\home\qi\directive\no_skip.hpp|30|error: 'no_skip' is not a member of 'boost::spirit::tag'| For full error message see the end of the message below. Any suggestions ? Thank you for your attention, Mau. #include <boost/config/warning_disable.hpp> #include <boost/spirit/include/qi.hpp> #include <boost/spirit/include/phoenix_core.hpp> #include <boost/spirit/include/phoenix_operator.hpp> #include <boost/spirit/include/phoenix_stl.hpp> //#include <boost/spirit/include/qi_no_skip.hpp> #include <iostream> #include <string> #include <vector> #define VECTOR_TYPE std::string namespace client { namespace qi = boost::spirit::qi; namespace ascii = boost::spirit::ascii; /////////////////////////////////////////////////////////////////////////// // Our number list compiler /////////////////////////////////////////////////////////////////////////// //[tutorial_numlist4 template <typename Iterator> bool parse_numbers(Iterator first, Iterator last, std::vector<VECTOR_TYPE>& v) { using qi::double_; using qi::phrase_parse; using qi::_1; using ascii::space; using qi::char_; bool r = phrase_parse(first, last, // Begin grammar ( +(char_ - ',') % ',' ) , // End grammar space, v); if (first != last) // fail if we did not get a full match return false; return r; } //] } //////////////////////////////////////////////////////////////////////////// // Main program //////////////////////////////////////////////////////////////////////////// int main() { std::cout << "/////////////////////////////////////////////////////////\n\n"; std::cout << "\t\tA comma separated list parser for Spirit...\n\n"; std::cout << "/////////////////////////////////////////////////////////\n\n"; std::cout << "Give me a comma separated list of numbers.\n"; std::cout << "The numbers will be inserted in a vector of numbers\n"; std::cout << "Type [q or Q] to quit\n\n"; std::string str; while (getline(std::cin, str)) { if (str.empty() || str[0] == 'q' || str[0] == 'Q') break; std::vector<VECTOR_TYPE> v; if (client::parse_numbers(str.begin(), str.end(), v)) { std::cout << "-------------------------\n"; std::cout << "Parsing succeeded\n"; std::cout << str << " Parses OK: " << std::endl; for (std::vector<VECTOR_TYPE>::size_type i = 0; i < v.size(); ++i) std::cout << i << ": " << v[i] << std::endl; std::cout << "\n-------------------------\n"; } else { std::cout << "-------------------------\n"; std::cout << "Parsing failed\n"; std::cout << "-------------------------\n"; } } std::cout << "Bye... :-) \n\n"; return 0; } Error messages when compiling with the no_skip include file: C:\boost_1_43_0\boost\spirit\home\qi\directive\no_skip.hpp|30|error: 'no_skip' is not a member of 'boost::spirit::tag'| C:\boost_1_43_0\boost\spirit\home\qi\directive\no_skip.hpp|30|error: 'no_skip' is not a member of 'boost::spirit::tag'| C:\boost_1_43_0\boost\spirit\home\qi\directive\no_skip.hpp|30|error: template argument 2 is invalid| C:\boost_1_43_0\boost\spirit\home\qi\directive\no_skip.hpp|36|error: 'boost::spirit::no_skip' has not been declared| C:\boost_1_43_0\boost\spirit\home\qi\directive\no_skip.hpp|37|error: 'boost::spirit::no_skip_type' has not been declared| C:\boost_1_43_0\boost\spirit\home\qi\directive\no_skip.hpp|79|error: 'no_skip' is not a member of 'boost::spirit::tag'| C:\boost_1_43_0\boost\spirit\home\qi\directive\no_skip.hpp|79|error: 'no_skip' is not a member of 'boost::spirit::tag'| C:\boost_1_43_0\boost\spirit\home\qi\directive\no_skip.hpp|79|error: template argument 1 is invalid| ||=== Build finished: 8 errors, 0 warnings ===| -- Mauricio Gomes Pensar Digital 55-11-9698-1683 (Brazil - mobile)

2 1

How do I do reverse routing?
by Stephen Woodbridge 13 May '10

13 May '10

Hi all, A Dijkstra solution builds the tree outward from a source node. Is there and easy was to change the sense of the route so the calculated result is based on a tree inward to the a sink node? Is there an example of this anywhere? I could not find one. Thanks, -Steve

2 2

metafunction question
by John Dlugosz 13 May '10

13 May '10

A co-worker mentioned an interesting issue. I thought some metaprogramming, or at least more advanced insight into STL, might apply here. Consider a class derived from an STL collection. It features a special find(x) function that works with his search criteria. It returns an iterator into the collection. There are two forms needed: iterator find(x); const_iterator find(x) const; and the annoying part is that they contain exactly the same code. The implementation uses the inherited iterators and collection features to do the finding. The larger question is, is there a better way to approach that? The immediate question is, my thought of using a template helper requires the return type to be determined based on the constness of the incoming parameter for the collection type. Is there a handy metafunction for that already in existance? --John -silly company footer automatically added, sorry. 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

Re: [Boost-users] How can I use random library in a class? Can any one with kindness help me?
by Pete Bartlett 13 May '10

13 May '10

>Can anyone tell me why? You need to initialize the base class, not the base class's members. So: class Usedchild:public Used{ public: Usedchild(Matrix inputmatrix, Vec inputvec):Used(inputmatrix,inputvec){}; }; should work. It may also be worth your while to look at a text on C++ syntax before diving too deep into the complicated parts of Boost.

1 0

How can I use random library in a class? Can any one with kindness help me?
by fmingu 13 May '10

13 May '10

How can I use random library in a class? Can any one with kindness help me? I am using boost(version boost_1_37_0) random library in Dev-C++ with gcc. and the code is: #include "boost/random/normal_distribution.hpp" #include <boost/random.hpp> ................................. class TransferedSignal{ public: TransferedSignal(){ one(0.0,1.0) ; die(rng, one); }; double output(){ return die(); }; private: boost::mt19937 rng; boost::uniform_real<> one; boost::variate_generator<boost::mt19937&, boost::uniform_real<> > die; }; int main(int argc, char *argv[]) { TransferedSignal transferedsignal(); for (int i=0; i<100;i++) transferedsignal.output(); system("PAUSE"); return 0; } But the complier told me that: mainprojectme13.cpp: In constructor 'TransferedSignal::TransferedSignal()': mainprojectme13.cpp:154: error: no matching function for call to 'boost::variate_generator<boost::mt19937&, boost::uniform_real<double> >::variate_generator()' F:/CB2009/boost_1_37_0/boost/random/variate_generator.hpp:97: note: candidates are: boost::variate_generator<Engine, Distribution>::variate_generator(Engine, Distribution) [with Engine = boost::mt19937&, Distribution = boost::uniform_real<double>] F:/CB2009/boost_1_37_0/boost/random/variate_generator.hpp:87: note: boost::variate_generator<boost::mt19937&, boost::uniform_real<double> >::variate_generator(const boost::variate_generator<boost::mt19937&, boost::uniform_real<double> >&) mainprojectme13.cpp:155: error: no match for call to '(boost::uniform_real<double>) (double, double)' mainprojectme13.cpp:156: error: no match for call to '(boost::variate_generator<boost::mt19937&, boost::uniform_real<double> >) (boost::mt19937&, boost::uniform_real<double>&)' F:/CB2009/boost_1_37_0/boost/random/variate_generator.hpp:100: note: candidates are: typename Distribution::result_type boost::variate_generator<Engine, Distribution>::operator()() [with Engine = boost::mt19937&, Distribution = boost::uniform_real<double>] mainprojectme13.cpp: In function 'int main(int, char**)': mainprojectme13.cpp:173: error: request for member 'output' in 'transferedsignal', which is of non-class type 'TransferedSignal()' And I do not know how to solve it. Shauld I define "boost::variate_generator<Engine, Distribution>::variate_generator() " in the random library? But God knows what will be happened after that. Can any one with kindness help me? Thanks a lot.

2 2

[Range] Documentation problem in 1.43.0
by dariomt＠gmail.com 13 May '10

13 May '10

Hi, Some pages in the Boost.Range docs have a problem. E.g. the link http://www.boost.org/doc/libs/1_43_0/libs/range/doc/html/range/reference/al… shows this error message: Error extracting file: No matching files were found. Regards

1 0

[thread] Compiling libraries compatible with Boost.Thread using g++ on Linux
by Jorge Moraleda 12 May '10

12 May '10

Dear Boost.Thread experts, I wrote some libraries that are not multithreaded, but are supposed to be reentrant. I am compiling them from source. When I produce an executable that links these static libraries and invokes functions from these libraries from multiple threads via Boost.Threads, valgrind drd reports some race conditions in what appears to be straight forward memory access allocated with calloc. To be clear: the library function allocates some memory with calloc and later releases it. This memory is local to the function. I am wondering if I need to use any especial compiler flags when compiling the static libraries to make sure they are reentrant and compatible with Boost.Thread. In particular should I use or not use "-pthread" when compiling the libraries? Should I use "-pthread" when compiling and linking the final executable? I use gcc version 4.4.4 (Debian 4.4.4-1) and boost 1.42 (compiled from source because I am using Boost.Log). Thank you. Jorge Moraleda

1 0

[interprocess][boost 1.42.0] message_queue: mac OSX rosetta cfm app ==> macho dylib ==> macho app
by Jeff Flinn 12 May '10

12 May '10

I'm not able to see a shared message_queue which is created in an OSX mach-o bundled dylib(created with XCode 3.1.2), called from a CFM based app running under Rosetta(created with CodeWarrior 9.x) with a mach-o based app(created with XCode 3.1.2) waiting to receive message(s). I can send messages until the message count maxes out, but am blocked on the receive end. Has anyone else been (un)lucky enough to deal with this situation? I've been searching for info on just how Rosetta works and what it's implications are, without luck. Thanks, Jeff

1 0

Termination of breadth first search
by Eric Fowler 12 May '10

12 May '10

I noticed the Boost doc for dijkstra_shortest_paths() <http://www.boost.org/doc/libs/1_43_0/boost/graph/dijkstra_shortest_paths.hpp> says that the algorithm terminates when the priority queue is empty, which implies visiting every vertex, which is not necessary to find the shortest path between two vertices. I would like to use the algorithm to find the shortest path to a known vertex, which means stopping it before the queue is empty. At what point can I (the library client) decide to end a BFS search? Eric

2 1

[uuid] to string problem
by Saygin Arkan 12 May '10

12 May '10

Hi, I'm a newbie on boost. I've downloaded and used some features. I couldn't find how to cast uuid into string. #include "boost/date_time/gregorian/gregorian.hpp" #include <boost/uuid/uuid.hpp> #include <boost/uuid/uuid_generators.hpp> #include <boost/uuid/random_generator.hpp> #include <boost/uuid/string_generator.hpp> ... date GeneratorUtils::getRandomDate() { int year, month ,day; day = rand() % 30; month = rand() % 12; year = 1980 + rand() % 25; string str_date = "" + day + month + year ; date d(from_simple_string(str_date)); return d; string GeneratorUtils::getRandomID(){ random_generator gen; uuid u = gen(); return u.uuid_to_string(); // ERROR } It does not accept any to_string() function. Is there a way to convert from uuid to string in C++? (by the way, I can use the other things such as date d, uuid u etc.) -- H. Saygin Arkan Tampere University of Tech. CS / III - +358466646156

6 18

boost::thread - many compiler warnings
by Manfred Schwind 12 May '10

12 May '10

Hi, we are using boost to develp cross-platform stuff. I am the Mac developer. The Mac is a 64 bit Intel machine, development environment is Xcode, of course, using gcc as compiler. To create code as robust as possible I always turn on as many warning levels as possible. Usually I am using this: -Wall -Wextra -Wconversion -Wshorten-64-to-32 This worked great with all basic boost stuff that we've used previously. Now I tried just to include thread.hpp and I get many many compiler warnings! I just do: #include "boost/thread.hpp" The warnings are just two kinds of warnings: 1.) warning: implicit conversion shortens 64-bit value into a 32-bit value 2.) warning: missing initializer for member '...' An example for the first warning can be found in gregorian_calender.ipp (just showing relevant parts): template<typename ymd_type_, typename date_int_type_> BOOST_DATE_TIME_INLINE int gregorian_calendar_base<ymd_type_,date_int_type_>::week_number(const ymd_type& ymd) { ... unsigned long week = (juliantoday + day - julianbegin + 4)/7; if ((week >= 1) && (week <= 52)) { return week; } ... Here's clearly missing a cast to tell the compiler that it's ok to return the unisigned long as int. On most 64 bit systems, long is 64 bit but int is 32 bit. The second warning is caused by the following line in conversion.hpp: std::tm datetm = {}; // zero initialization is needed for extension members, like tm_zone In this line I get the "missing initializer" warning for every member of the struct, e.g. tm::tm_sec, tm::tm_min, tm::tm_hour etc. What's the intension by initializing with empty braces? IMO this is not a standard initialization method. Is there any chance that these errors get fixed? Any ideas how to use thread.hpp without reducing my warning levels? Does anyone have the same problems? Regards, Manfred Schwind -- http://mani.de - friendly software iVolume - listen to music hands-free LittleSecrets - the encrypted notepad Sahara - sand in your pocket Watchdog - baffle the curious

6 5

[GIL] does gil::variant<mpl::vector3<A, B, C> > constructor accept instances of gil::variant<mpl::vector2<A, B> > ?
by Nicolas Lelong 12 May '10

12 May '10

Hi ! the question is in the subject, but I can elaborate a bit. I have the set of all views supported by my application, defined as : typedef mpl::vector9< gray8_view_t , rgb8_view_t, bgr8_view_t, rgba8_view_t, bgra8_view_t , rgb32f_view_t, bgr32f_view_t, rgba32f_view_t, bgra32f_view_t > gil_all_views_t; typedef any_image_view<gil_all_views_t> any_view; Then I have a function, reading a file and returning an any_image_view, of a different type : typedef boost::mpl::vector3<boost::gil::gray8_view_t, boost::gil::bgr8_view_t, boost::gil::bgra8_view_t> tga_views_t; typedef boost::gil::any_image_view<tga_views_t> any_tga_view; The ' tga_views_t' is a subset of 'gil_all_views_t'. It seems that I cannot construct an 'any_view' instance, from an 'any_tga_view' ; I receive a bad_cast exception. Is there an existing function or construct I could use for this ? If I'm not mistaken, boost::variant (not the gil one) allow such constructs : it extracts the type of the value contained in the 'foreign' variant, and assigns this value to the new variant. Anyone could tell me what is the rationale behind having a special variant for boost::gil ? performance ? Wouldn't it be easier to replace it by boost::variant ? Thanks is advance, cheers, Nicolas.

4 5

Never mind ...
by Eric Fowler 12 May '10

12 May '10

bool b_eric_is_a_numnut; MYEDGEPROPS my_edge_props( param ); tie(e01, b_eric_is_a_numnut) = add_edge(v0, v1, my_edge_props, my_graph); All I needed. It was the return, not the parameter. Thanks. Eric

1 0

Problems compiling with bundled properties and add_edge()
by Eric Fowler 12 May '10

12 May '10

I am using bundled properties: typedef unsigned position_type; template<typename T> class POS { public: ... }; template<typename T> struct LEN { T len_sq; }; typedef POS<position_type> POSITION; typedef LEN<position_type> LENGTH; typedef adjacency_list<vecS, vecS, bidirectionalS, POSITION, LENGTH> DG; typedef graph_traits<DG>::vertex_descriptor Vertex; typedef graph_traits<DG>::edge_descriptor Edge; ...and I am calling add_edge() like this [from within the graph class so (*this) resolves to the graph object]: LENGTH l; l.len_sq = whatever; e01 = add_edge(v0, v1, l, *this); The g++ compiler is punishing me with huge error reports that say: ../main.cpp: In constructor ‘DelaunayGraph<T>::DelaunayGraph(const int&, const int&) [with T = unsigned int]’: ../main.cpp:126: instantiated from here ../main.cpp:101: error: no match for ‘operator=’ in ‘((DelaunayGraph<unsigned int>*)this)->DelaunayGraph<unsigned int>::e01 = boost::add_edge [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, POS<unsigned int>, LEN<unsigned int>, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, POS<unsigned int>, LEN<unsigned int>, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_bundle_t, POS<unsigned int>, boost::no_property>, boost::property<boost::edge_bundle_t, LEN<unsigned int>, boost::no_property>, boost::no_property, boost::listS>::config, Base = boost::bidirectional_graph_helper_with_property<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, POS<unsigned int>, LEN<unsigned int>, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_bundle_t, POS<unsigned int>, boost::no_property>, boost::property<boost::edge_bundle_t, LEN<unsigned int>, boost::no_property>, boost::no_property, boost::listS>::config>](((DelaunayGraph<unsigned int>*)this)->DelaunayGraph<unsigned int>::v0, ((DelaunayGraph<unsigned int>*)this)->DelaunayGraph<unsigned int>::v1, ((const boost::property<boost::edge_bundle_t, LEN<unsigned int>, boost::no_property>&)(& boost::property<boost::edge_bundle_t, LEN<unsigned int>, boost::no_property>(((const LEN<unsigned int>&)((const LEN<unsigned int>*)(& l)))))), ((boost::vec_adj_list_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, POS<unsigned int>, LEN<unsigned int>, boost::no_property, boost::listS>, boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, POS<unsigned int>, LEN<unsigned int>, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_bundle_t, POS<unsigned int>, boost::no_property>, boost::property<boost::edge_bundle_t, LEN<unsigned int>, boost::no_property>, boost::no_property, boost::listS>::config, boost::bidirectional_graph_helper_with_property<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, POS<unsigned int>, LEN<unsigned int>, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_bundle_t, POS<unsigned int>, boost::no_property>, boost::property<boost::edge_bundle_t, LEN<unsigned int>, boost::no_property>, boost::no_property, boost::listS>::config> >&)(&((DelaunayGraph<unsigned int>*)this)->DelaunayGraph<unsigned int>::<anonymous>.boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, POS<unsigned int>, LEN<unsigned int>, boost::no_property, boost::listS>::<anonymous>)))’ /usr/include/boost/graph/detail/edge.hpp:35: note: candidates are: boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>& boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>::operator=(const boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>&) make: *** [main.o] Error 1 Yow. It doesn't like the LENGTH param. What can I do? I tried adding an assignment operator and copy constructor, no go. What am I doing wrong? Eric

1 0