- Boost-users - lists.boost.org

Call for Papers for Meeting C++ 2014 - one more week
by Jens Weller 13 Apr '14

13 Apr '14

Hello boost community, there is one week left to submit your talk to Meeting C++ 2014: http://meetingcpp.com/index.php/submit-your-talk.html Newsentry at Meeting C++ http://meetingcpp.com/index.php/newsreader/items/call-for-papers-one-more-w… So far 20 talks are submitted, a few of them also cover boost, most C++11/Modern C++. I also could announce the keynotes yesterday: Opening Keynote - Scott Meyers Closing Keynote - Hartmut Kaiser thanks, Jens

1 0

phoenix bind vs boost bind?
by Robert Dailey 13 Apr '14

13 Apr '14

First of all, I'm using boost 1.55.0 on MSVC9. I've been using boost::phoenix in various places in my code base for easier usage of std::for_each and friends. However, I do not create lazy functions for a lot of the functions I bind to because they are only needed in one place most of the time. As a result, I use boost::phoenix::bind the same as I'd use boost::bind(). However I have read in various places that boost::bind is being deprecated. I'm not sure if there is truth to this, but is there a reason to choose one over the other? Is phx::bind() basically an "upgrade" to boost::bind? If I intermingle them, I have a lot of issues out of placeholder ambiguities that results in more boilerplate code (i.e. using boost::phoenix::placeholders::_1 everywhere). Any tips? I haven't used boost in a few years so I just want to make sure I'm not using it incorrectly. Thanks in advance.

5 6

Is selective header including supposed to work?
by Johannes Lorenz 12 Apr '14

12 Apr '14

Hello, I like Qi, but the compile times are terrible sometimes. My example is similar to this in [1], but it needs 3x as much time to compile. I thought this problem might be omitted by including selectively what is needed. So I went into [1] and replaced #include <boost/spirit/include/qi.hpp> by #include <boost/spirit/include/qi_action.hpp> #include <boost/spirit/include/qi_grammar.hpp> #include <boost/spirit/include/qi_uint.hpp> #include <boost/spirit/include/qi_char.hpp> . I got far, but then, there comes up a long error message, beginning like in [2]. My questions are: * is selectively including from "boost/spirit/include" supposed to work, or should this never be done? * if it should work, what is still left to be included in my case? My version of boost is 1.53. Many thanks on advance. Kind regards, Johannes [1] http://www.boost.org/doc/libs/1_41_0/libs/spirit/example/qi/calc2_ast.cpp [2] [...]/usr/include/boost/spirit/home/qi/nonterminal/rule.hpp:176:13: error: no matching function for call to ‘assertion_failed[...] /usr/include/boost/spirit/home/qi/nonterminal/rule.hpp:176:13: note: candidate is: /usr/include/boost/mpl/assert.hpp:79:5: note: template<bool C> int mpl_::assertion_failed(typename mpl_::assert<C>::type) int assertion_failed( typename assert<C>::type ); ^ /usr/include/boost/mpl/assert.hpp:79:5: note: template argument deduction/substitution failed:[...]

3 2

Re: [Boost-users] Is selective header including supposed to work?
by Johannes Lorenz 12 Apr '14

12 Apr '14

Hi, > #include <boost/spirit/include/qi_operator.hpp> sadly, it did not. It did for the AST example, but it does not for mine I uploaded the code on github [3 (mostly) and 4]. Can you please help me with this file? Is there any generic approach if you hit such errors? > BTW, if you care about the compile time, there's Spirit X3 in develope > which utilizes c++11/14 and it claims to compile faster. I am really looking forward to this Regards, Johannes [3] https://github.com/JohannesLorenz/sca-toolsuite/blob/master/src/res/equatio… [4] https://github.com/JohannesLorenz/sca-toolsuite/blob/master/src/res/equatio…

1 0

Building Boost from Modular Boost Repository
by Baptiste Wicht 11 Apr '14

11 Apr '14

Hi, I wanted to test some experimental features of Boost Spirit X3, so I tried to install Boost from the "Modular Boost" Git repository, but without success. I followed the instructions on https://svn.boost.org/trac/boost/wiki/TryModBoost and the b2 command failed: /home/wichtounet/src/modular-boost/tools/build/src/build/feature.jam:493: > in feature.validate-value-string from module feature > error: "none" is not a known value of feature <optimization> > error: legal values: "off" "speed" "space" > /home/wichtounet/src/modular-boost/tools/build/src/build/property.jam:273: > in validate1 from module property > /home/wichtounet/src/modular-boost/tools/build/src/build/property.jam:299: > in property.validate from module property > /home/wichtounet/src/modular-boost/tools/build/src/tools/builtin.jam:377: > in variant from module builtin > /usr/share/boost-build/site-config.jam:9: in modules.load from module > site-config > /home/wichtounet/src/modular-boost/tools/build/src/build-system.jam:249: > in load-config from module build-system > /home/wichtounet/src/modular-boost/tools/build/src/build-system.jam:351: > in load-configuration-files from module build-system > /home/wichtounet/src/modular-boost/tools/build/src/build-system.jam:524: > in load from module build-system > /home/wichtounet/src/modular-boost/tools/build/src/kernel/modules.jam:289: > in import from module modules > /home/wichtounet/src/modular-boost/tools/build/src/kernel/bootstrap.jam:139: > in boost-build from module > /home/wichtounet/src/modular-boost/boost-build.jam:17: in module scope > from module > I tried adding optimization=speed on the command line, but it didn't changed a thing. I tried the master and develop branches. Is there some configuration that is necessary ? Or is there another procedure to follow ? Thanks -- Baptiste Wicht, HES-SO University of applied Sciences My personal website - http://baptiste-wicht.com

2 4

nearest neighbors search with boost
by Georgios Samaras 11 Apr '14

11 Apr '14

I just find out that boost supports nearest neighbor searching, will amazes me. However, I do not want just to use the nearest() method, I want to study it and understand it. Is there any relevant documentation, specifically on how NNS is performed in R-tree? Are the code files that implement this method visible to the user? I downloaded the latest .tar file. Thank you in advance, Georgios PS - Hello Boost world! :)

2 1

possible bug with boost::is_convertible
by Matei David 11 Apr '14

11 Apr '14

Hi, I found a situation where (with gcc 4.8.2 & 1.55) I cannot compile a call to boost::is_convertible, but I can compile a similar call to std::is_convertible. I don't know yet if this is a bug. Is it undefined behaviour to pass is_convertible a type with a deleted or private copy ctor? Before I go into the details, I'd like to ask, which type_traits library should we prefer these days, post c++11? Intuition says std should be more stable/portable, is that wrong? If it is indeed std, is there a way (perhaps a macro?) to make boost mirror std (I'm talking about type_traits only). The reason for having such a mirror option is not for new code, but for other boost libraries which need type_traits. E.g, I came across this issue from boost::iterator. Here is the discordant code: #include <type_traits> #include <boost/type_traits/is_convertible.hpp> struct A { A() = default; A(const A&) = delete; // or private: A(const A&) = default; }; struct Ref_A { // proxy reference to A operator A& () { return *_ptr; } A* _ptr; }; int main() { (void)std::is_convertible< Ref_A, A >::value; (void)boost::is_convertible< Ref_A, A >::value; } I compile with: {g++|clang++} -std=c++11 -I${BOOST_INCLUDE} -Wall -Wextra -c With gcc 4.8.2, the call to boost::is_convertible fails, complaining that the copy ctor of A is deleted (or private.) The similar call to std::is_convertible compiles ok. With clang 3.4, both calls compile. The reason for the discrepancy is that boost/type_traits/intrinsics.hpp defines the macro BOOST_IS_CONVERTIBLE(T,U) for clang, but not for gcc. Because of that, at the bottom of boost/type_traits/is_convertible.hpp, clang uses the macro to implement is_convertible, whereas gcc uses is_convertible_impl_dispatch instead (which is the one that fails). A temporary fix I found is to define that macro to defer to std: #include <type_traits> #include <boost/type_traits/intrinsics.hpp> #ifndef BOOST_IS_CONVERTIBLE #define BOOST_IS_CONVERTIBLE(T, U) (std::is_convertible<T, U>::value) #endif #include <boost/type_traits/is_convertible.hpp> As I was asking above, is there a way to do that systematically for all type_traits? Thanks, M

1 0

[asio] Crash when posted handlers execute in one thread only?
by Sohail Somani 10 Apr '14

10 Apr '14

Hi, Not sure if there is a race condition in the code below, or if I am not stopping the service in a sanctioned manner but when run, the code consistently crashes on OSX 10.9 with Boost 1.55 and Clang. The only regular pattern was that the crash occurs when all the posted completion handlers execute in one thread only. When the completion handlers execute across both threads, there is no crash. This seems to me like there could be an initialization bug somewhere. I'll try and create a smaller test case. Thanks for any ideas or suggestions. The code: #define LOG(msg) { \ boost::mutex::scoped_lock lock(log_mutex); \ std::cout << "[" << boost::this_thread::get_id() \ << "] " << msg << std::endl; \ } void test() { boost::mutex log_mutex; LOG("Boost version: " << BOOST_LIB_VERSION); for(int ii = 0; ii < 100; ++ii) { LOG("Iteration: " << ii); boost::asio::io_service service; boost::asio::io_service::work work(service); boost::thread_group group; auto fun = [&](){ LOG("Starting service"); service.run(); LOG("Completing service"); }; group.create_thread(fun); group.create_thread(fun); int ntasks = 10; volatile int val = 2; std::vector<volatile int> ints(ntasks,val); for(int ii = 0; ii < ntasks; ++ii) { service.post([&ints,ii,&log_mutex]() { LOG("Task: " << ii); ints[ii] = 1; }); } service.post([&service,&log_mutex](){ LOG("Stopping service"); service.stop(); }); group.join_all(); for(int ii = 0; ii < ntasks; ++ii) { if(ints[ii] != 1) { LOG(ii << "->" << ints[ii]); } } } LOG("Done test"); } int main() { try { test(); } catch(...) { std::cout << "Exception in main()" << std::endl; } } The output + stack trace: ... [0x7fff7aeb9310] Iteration: 91 [0x104681000] Starting service [0x104704000] Starting service [0x104704000] Task: 0 [0x104704000] Task: 1 [0x104704000] Task: 2 [0x104704000] Task: 3 [0x104704000] Task: 4 [0x104704000] Task: 5 [0x104704000] Task: 6 [0x104704000] Task: 7 [0x104704000] Task: 8 [0x104704000] Task: 9 [0x104704000] Stopping service [0x104704000] Completing service [0x104681000] Completing service Program received signal EXC_BAD_ACCESS, Could not access memory. Reason: KERN_INVALID_ADDRESS at address: 0x0000000104703c57 0x00007fff8b06cdf3 in _pthread_cond_updateval () (gdb) where #0 0x00007fff8b06cdf3 in _pthread_cond_updateval () #1 0x00007fff8b06c91e in _pthread_cond_signal () #2 0x00000001000048d0 in boost::asio::detail::posix_event::signal_and_unlock<boost::asio::detail::scoped_lock<boost::asio::detail::posix_mutex> > () at build/boost/include/boost/asio/detail/posix_event.hpp:62 #3 0x00000001000048d0 in boost::asio::detail::task_io_service::wake_one_idle_thread_and_unlock () at build/boost/include/boost/asio/detail/task_io_service.hpp:484 #4 0x00000001000048d0 in boost::asio::detail::task_io_service::wake_one_thread_and_unlock (this=<value temporarily unavailable, due to optimizations>, lock=<value temporarily unavailable, due to optimizations>) at posix_event.hpp:493 #5 0x0000000100004776 in boost::asio::detail::scoped_lock<boost::asio::detail::posix_mutex>::~scoped_lock () at task_io_service.ipp:278 #6 boost::asio::detail::scoped_lock<boost::asio::detail::posix_mutex>::~scoped_lock () at build/boost/include/boost/asio/detail/scoped_lock.hpp:52 #7 0x0000000100004776 in boost::asio::detail::task_io_service::post_immediate_completion (this=<value temporarily unavailable, due to optimizations>, op=<value temporarily unavailable, due to optimizations>, is_continuation=<value temporarily unavailable, due to optimizations>) at scoped_lock.hpp:279 #8 0x0000000100001952 in test () at task_io_service.hpp:70 #9 0x0000000100002ca0 in main () at app/exe/testcpp/main.cpp:64 (gdb) info threads 2 0x00007fff985fc662 in kevent64 () * 1 0x00007fff8b06cdf3 in _pthread_cond_updateval ()

3 5

Re: [Boost-users] [Graph] Questions and remarks
by Jeremiah Willcock 10 Apr '14

10 Apr '14

On Sun, Apr 6, 2014 4:14 AM PDT Albert Yiamakis wrote: >Hello, > >Some questions and remarks regarding Boost.Graph: > >i) Why does write_graphviz require a VertexEdgeListGraph? I was unable >to invoke it on an adjacency_list using sets as containers for vertices >and edges; instead I had to switch to vectors. However, the function is >meant to output - does the efficiency of the traversal really matter? The issue is more likely to be a missing vertex index map than that concept constraint. Graphs with setS as vertex container do not have that by default, and I believe the graphviz writer needs that. You can look online for how to create that map. >ii) Would it be possible to mutate the graph in the visitors of an >algorithm? For instance, generating the graph during a breadth-first >search, by adding vertices and edges. Presumably, it would be the user's >responsibility to color the vertices appropriately. (Interestingly, >visitors take a non-const reference to the graph - but compilation >failed at some other point). That would almost always be dangerous because of iterator and descriptor invalidation. The loop variables, current source vertex, etc. would often become invalid (and thus invalid to use) because of the structural modifications. > >iii) The documentation of the distance_recorder states that > >"A WritablePropertyMap where the key type and the value type are the >vertex descriptor type of the graph." > >which has to be a mistake. It seems this has already been pointed out in >the past >(http://boost.2283326.n4.nabble.com/BGL-distance-recorder-td2571349.html) > >but is yet to be corrected. Yes, that does appear to be a bug. -- Jeremiah Willcock

1 0

Re: [Boost-users] [Graph] Run-time weight search
by Jeremiah Willcock 10 Apr '14

10 Apr '14

On Tue, Apr 8, 2014 5:38 AM PDT Sensei wrote: >Dear all, > >after many speculations and your previous advice I've come to the conclusion that I still need your help :) > >The setting is simple: I have an oriented graph, and I have two nodes. I wish to find all paths from one node to the other. > >Some restrictions apply: >- I *cannot* calculate weights except at run-time when needed, it's too costly; >- I can, if you say it's needed, restrict the path length to a certain threshold. > >What can I relax? The "all paths". Since weights are costly, I could set for just the best path, i.e., the one with the lowest weight. I don't think it would be possible to find the optimum path, in case I cannot search for all possible paths, but I can be easily wrong. > >I'm not that skilled with BGL, so any help would be quite appreciated! I've read the Table of Contents, but at first I cannot see if this can be done. > You might consider using A* search instead of a normal shortest path algorithm. You don't need a heuristic function (just use one that always returns zero). There is a function_property_map type that you can use to turn a weight-computing function into a property map. -- Jeremiah Willcock

1 0