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

C++Now 2014 Student Volunteer Program Accepting Applications - Please help spread the word
by Bryce Adelstein-Lelbach 28 Jan '14

28 Jan '14

C++Now, presented by Boost in-cooperation with the ACM, is an international gathering of C++ programmers. In 2013, the conference launched a Student/Volunteer Program to enable young coders to attend the conference. This year, we are again are inviting students with an interest in C++ programming to attend the May 12-17, 2014 conference in Aspen, CO as Student/Volunteers. The program is an excellent way for students with any interest in C++ to learn about C++ and make lasting connections with the C++ community. "Attending has truly been one of the most inspirational moments of my life. I had the opportunity to learn, socialize and have a great time in general. I hope to attend this conference yearly now and make a lasting impact in the computer science community." - Grant Mercer, 2013 C++Now Student/Volunteer. "All of the attendees had knowledge to share. Although the talks can be seen online, nothing can compare to being surrounded by over a hundred C++ enthusiasts." - Alex Duchene, 2013 C++Now Student/Volunteer Student/Volunteers will receive free registration. A limited number of applicants will receive stipends for travel expenses. Volunteers will handle various tasks during the conference, such as assisting presenters, setting up presentation rooms, running A/V equipment and helping with the conference picnic. Students from all fields of study are welcome to apply. However, this conference covers advanced C++ topics, and applicants should have ample experience with the C++ programming language and be familiar with general computer science topics. Applications will be accepted until February 15th, 2014. Application decisions will be sent out by March 18th, 2014. You can learn more about the program and some of the students who have participated at http://cppnow.org/volunteer. -- Bryce Adelstein-Lelbach, Student/Volunteer Chair

1 0

Forthcoming Boost.Fiber review
by Nat Goodspeed 28 Jan '14

28 Jan '14

Hi all, The review of Boost.Fiber by Oliver Kowalke is scheduled from Monday, January 6th to January 12th. ----------------------------------------------------- About the library: Boost.Fiber provides a framework for micro-/userland-threads (fibers) scheduled cooperatively. The API contains classes and functions to manage and synchronize fibers similar to Boost.Thread. Each fiber has its own stack. A fiber can save the current execution state, including all registers and CPU flags, the instruction pointer, and the stack pointer and later restore this state. The idea is to have multiple execution paths running on a single thread using a sort of cooperative scheduling (versus threads, which are preemptively scheduled). The running fiber decides explicitly when it should yield to allow another fiber to run (context switching). Boost.Fiberinternally uses coroutines from Boost.Coroutine <http://ok73.funpic.de/boost/libs/coroutine/index.html>; the classes in this library manage, schedule and, when needed, synchronize those coroutines. A context switch between threads usually costs thousands of CPU cycles on x86, compared to a fiber switch with a few hundred cycles. A fiber can only run on a single thread at any point in time. docs: http://ok73.funpic.de/boost/libs/fiber/doc/html/index.html<http://ok73.ok.funpic.de/boost/libs/coroutine/doc/html/> git: https://github.com/olk/boost-fiber src: http://ok73.ok.funpic.de/boost.fiber.zip<http://ok73.ok.funpic.de/boost.coroutine.zip> --------------------------------------------------- Naturally, you need not wait until the review formally opens to start reviewing the Fiber library. Please always state in your review whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - 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? Nat Goodspeed Boost.Fiber Review Manager ------------------------------

7 25

making a geometry half closed
by Sean Farrow 27 Jan '14

27 Jan '14

Hi, >From what I understand any boost geometry is fully closed. Is there a way of making a geometry half closed, such that the bottom row is not included? I'm needing to do this with a Box2D$Values. Any help appreciated. Cheers Sean.

6 8

[Geometry] Issues when registering a windows point type
by Sean Farrow 26 Jan '14

26 Jan '14

Hi, I'm having an Issue when trying to register a windows POINT type. I'm registering the Point structure from windef.h as follows: BOOST_GEOMETRY_REGISTER_POINT_2D(POINT, LONG, boost::geometry::cs::cartesian, x, y); I'm getting the following in my build log: 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2870: 'boost' : a namespace definition must appear either at file scope or immediately within another namespace definition 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2143: syntax error : missing ';' before '<' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2913: explicit specialization; 'boost::geometry::traits::tag' is not a specialization of a class template 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2059: syntax error : '<' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2143: syntax error : missing ';' before '{' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2447: '{' : missing function header (old-style formal list?) 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2143: syntax error : missing ';' before '<' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2913: explicit specialization; 'boost::geometry::traits::dimension' is not a specialization of a class template 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2059: syntax error : '<' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C3083: 'mpl': the symbol to the left of a '::' must be a type 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2039: 'int_' : is not a member of 'boost' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2143: syntax error : missing ';' before '<' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2143: syntax error : missing ';' before '<' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2913: explicit specialization; 'boost::geometry::traits::coordinate_type' is not a specialization of a class template 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2059: syntax error : '<' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2143: syntax error : missing ';' before '<' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2913: explicit specialization; 'boost::geometry::coordinate_system' is not a specialization of a class template 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2059: syntax error : '<' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C3083: 'cs': the symbol to the left of a '::' must be a type 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2039: 'cartesian' : is not a member of 'boost::geometry' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2143: syntax error : missing ';' before '<' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2913: explicit specialization; 'boost::access' is not a specialization of a class template 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2059: syntax error : '<' 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): error C2267: 'set' : static functions with block scope are illegal 1>c:\work\pantheon studios\o2\disesupport\supportfunctions.cpp(37): fatal error C1903: unable to recover from previous error(s); stopping compilation I'd rather not have to define my own point structure if at all possible! Any help appreciated to solve this. Cheers Sean.

2 2

Help compiling/linking boost example
by zaphod742 . 25 Jan '14

25 Jan '14

I installed boost-all-dev using apt-get on Ubuntu. I am trying to compile this example program of sync_client.cpp http://www.boost.org/doc/libs/1_45_0/doc/html/boost_asio/example/http/clien… I get this error .. $ sudo g++ sync_client.cpp -I usr/local/include/boost -L /usr/local/lib /tmp/ccaVkCWp.o: In function `__static_initialization_and_destruction_0(int, int)': sync_client.cpp:(.text+0xd61): undefined reference to `boost::system::generic_category()' sync_client.cpp:(.text+0xd6d): undefined reference to `boost::system::generic_category()' sync_client.cpp:(.text+0xd79): undefined reference to `boost::system::system_category()' /tmp/ccaVkCWp.o: In function `boost::system::error_code::error_code()': sync_client.cpp:(.text._ZN5boost6system10error_codeC2Ev[_ZN5boost6system10error_codeC5Ev]+0x17): undefined reference to `boost::system::system_category()' /tmp/ccaVkCWp.o: In function `boost::asio::error::get_system_category()': sync_client.cpp:(.text._ZN5boost4asio5error19get_system_categoryEv[boost::asio::error::get_system_category()]+0x5): undefined reference to `boost::system::system_category()' /tmp/ccaVkCWp.o: In function `boost::asio::detail::posix_tss_ptr_create(unsigned int&)': sync_client.cpp:(.text._ZN5boost4asio6detail20posix_tss_ptr_createERj[boost::asio::detail::posix_tss_ptr_create(unsigned int&)]+0x19): undefined reference to `pthread_key_create' /tmp/ccaVkCWp.o: In function `boost::asio::detail::posix_thread::~posix_thread()': sync_client.cpp:(.text._ZN5boost4asio6detail12posix_threadD2Ev[_ZN5boost4asio6detail12posix_threadD5Ev]+0x26): undefined reference to `pthread_detach' /tmp/ccaVkCWp.o: In function `boost::asio::detail::posix_thread::join()': sync_client.cpp:(.text._ZN5boost4asio6detail12posix_thread4joinEv[boost::asio::detail::posix_thread::join()]+0x2b): undefined reference to `pthread_join' /tmp/ccaVkCWp.o: In function `boost::asio::detail::posix_tss_ptr<boost::asio::detail::call_stack<boost::asio::detail::task_io_service>::context>::~posix_tss_ptr()': sync_client.cpp:(.text._ZN5boost4asio6detail13posix_tss_ptrINS1_10call_stackINS1_15task_io_serviceEE7contextEED2Ev[_ZN5boost4asio6detail13posix_tss_ptrINS1_10call_stackINS1_15task_io_serviceEE7contextEED5Ev]+0x15): undefined reference to `pthread_key_delete' /tmp/ccaVkCWp.o: In function `boost::asio::detail::posix_tss_ptr<boost::asio::detail::call_stack<boost::asio::detail::strand_service::strand_impl>::context>::~posix_tss_ptr()': sync_client.cpp:(.text._ZN5boost4asio6detail13posix_tss_ptrINS1_10call_stackINS1_14strand_service11strand_implEE7contextEED2Ev[_ZN5boost4asio6detail13posix_tss_ptrINS1_10call_stackINS1_14strand_service11strand_implEE7contextEED5Ev]+0x15): undefined reference to `pthread_key_delete' collect2: ld returned 1 exit status How can I solve this error?

1 0

Fwd: [boost] Boost.Fiber review January 6-15
by Nat Goodspeed 23 Jan '14

23 Jan '14

SUMMARY The review of the proposed Boost.Fiber library ended on January 15, 2014. The verdict is: not in its present form. The lively discussions during the course of the review indicate considerable interest in this library, however, and every submitted review can be read as: perhaps, if certain changes are made. This produced a long list of suggestions, which constitutes the bulk of this report. On behalf of the Boost community, I would like to commend Oliver Kowalke for the work he has put into the Fiber library so far. I encourage him to continue to evolve this library and to bring it back for a mini-review. Rather than considering the subject library as a whole, a Boost mini-review zooms in on particular issues. That seems an appropriate tool to use for further evaluation of the Fiber library -- always subject, of course, to the approval of the Review Wizards. I received seven formal votes, abbreviated here: Niall Douglas: YES, IF Eugene Yakubovich: YES, AND Antony Polukhin: YES, IF Vicente J. Botet Escriba: NO, UNTIL Agustín K-ballo Bergé: NO, IN CURRENT STATE Hartmut Kaiser: NO, IN CURRENT FORM Thomas Heller: NO, IN CURRENT FORM I thank each of these reviewers, and indeed everyone who investigated the Fiber library and participated in the discussions. If you feel that I have misrepresented your position, or have omitted or garbled an important point, please respond: the archived mail thread should accurately reflect the will of the community, even if this message does not. >From the long list of suggestions, a few key themes emerged. PERFORMANCE Many respondents requested performance tests (specifics below). There were a number of suggestions about possible performance pitfalls in the current implementation, such as use of STL containers (with consequent heap allocations) and locks for thread safety. Several people suggested implementing performance tests *before* starting any such optimizations, which seems like sensible advice. Niall Douglas pointed out that picking some fixed number of fibers is less interesting than showing how resource consumption rises with the number of fibers: "I think it isn't unreasonable for a library to enter Boost if it has good performance *scaling* to load (e.g. O(log N)), even if performance in the absolute or comparative-to-near-alternatives sense is not great. "Absolute performance can always be incrementally improved later, whereas poor performance scaling to load usually means the design is wrong and you're going to need a whole new library with new API. "This is why I really wanted to see performance scaling graphs. If they show O(N log N) or worse, then the design is deeply flawed and the library must not enter Boost. Until we have such a graph, we can't know as there is no substitute for empirical testing." Given the truth of that last observation, I have recast certain suggested optimizations as requests for measured performance cost. Performance requests include: - empty function (create, schedule, execute, delete one fiber) - same with one yield - overhead of using a future object - tests as described in [1]; such tests should allow comparing with TBB, qthreads, openmp, HPX - construct and join a single fiber vs. construct and join a single thread (empty function) - construct and join several fibers vs. construct and join several threads (empty function) - construct and detach a single fiber vs. construct and detach a single thread (empty function) - cost of STL containers (std::vector, std::map, std::deque) - cost of fiber interruption support (same as next bullet?) - cost of thread safety: intra-thread fibers vs. inter-thread fibers - cost of round_robin_ws vs. round_robin scheduler - cost of building on Coroutine vs. building on Context Once Fiber performance tests are available, I trust the community will assist Oliver in running them on systems otherwise unavailable to him. There was some disagreement on whether it is essential for the Fiber library to attain a certain level of performance before it should be accepted. Respondents fall into two broad camps. Some see fibers as lightweight threads (without the overhead of kernel context switching). They assert that since the API is that of std::thread, the only reason to accept a separate library would be astounding performance. They note that on some hardware it is already plausible to run hundreds of thousands of concurrent std::threads. Others see fibers as a tool for organizing code based around asynchronous operations (rather than chains of callbacks). They assert that for such purposes, eliminating the kernel from context switching is sufficient performance guarantee. I myself maintain that cooperative context switching provides important functionality you cannot reasonably get from std::thread. The Fiber library attempts to address both use cases. (It was suggested that if its primary target were code organization, perhaps it should be renamed something other than "Fiber.") In any case, the community clearly wants to see Fiber performance data. Some requested CPU cycles to eliminate clock speed differences, also memory consumption. ARMv7 data was requested for "extra bonus points." DOCUMENTATION Many respondents requested additional documentation, or clarifications. Requests include: - Rationale page explaining what's there, what's not and why. Explain distinction between Coroutine library and Fiber library. If certain Fiber functionality is intended to support yet another library (rather than being complete in itself), call out what would need to be added. - A section on how to install and run the tests and examples. The need to embed in a Boost tree is implied but not stated. Mention the need to build the library and link with it. - Explain synchronization between fibers on different threads. Must the code take more care with this than with synchronizing fibers on the same thread? - Clarify that an exception raised by a fiber function calls std::terminate(), as with std::thread, rather than being consumed. - More clearly explain migrating a fiber from one scheduler to another. - Document async() in a way compatible with the C++ standard. - Clarify thread-local effect of set_scheduling_algorithm(). There was a request to put this function in a this_thread nested namespace to further clarify. - Move algorithm class documentation to "Extension" or "Customization" section. Clarify that it's not part of the baseline library functionality, but a customization point. - Document fiber::id. - Better document promise/future for void and R& (per C++ standard). - Document thread safety of each support class (or method, if it varies by method). - Document complexity guarantees per API. - Document exception safety per API. - Document supported architectures (perhaps link to Coroutine library's list); state minimum compiler versions. - Document the get/set overloads of thread_affinity() and priority() separately. Perhaps rename setters to set_thread_affinity() and set_priority(). - Explain how portable is fiber priority, if it's specific to a scheduler. What does priority mean when you migrate a fiber from one thread (one scheduler instance) to another? - Document the library's ASIO support. Link to Coroutine's ASIO yield functionality; ensure that ASIO yield is adequately explained. In particular, distinguish it from this_fiber::yield. - Better explain (and/or comment) publish-subscribe example, also other existing examples. In addition to the documentation requests above, there were requests for additional examples: - Simple example of ASIO callback implementation vs. the same logic using Fiber's ASIO support, a la [4]. - Example of a fiber pool. - Example of an arbitrary thread B filling a future on which a fiber in thread A is waiting. - Example of an arbitrary thread B posting to an asio::io_service running fibers in thread A. - Either defend fibers::condition_variable from spurious wakeups in existing examples, OR document the stronger condition_variable guarantee. - Example of M:N threading with ASIO. That might involve either one io_service per CPU, with fiber migration; or a single io_service with run() calls from each CPU, grouping fibers for each CPU into strands. - Example of one thread with many fibers making service requests on a pool of worker threads performing blocking calls. - Example of using thread_specific_ptr to manage lifespan of user-specified scheduler. - Example of the owner of a fiber changing the fiber's thread affinity vs. the fiber itself. When would you use each tactic? - Load example programs into an Examples appendix so that Google searches can turn up library documentation. LIBRARY API - Four people overtly approved the close parallel with std::thread and its support classes. - Allocating a default scheduler object, rather than specifying a default template param, was praised. - Three people called out the set difference between Boost.Thread features and Fiber (e.g. future::get_exception_ptr()). One wants these implemented immediately; another says they can be added later; the third simply requests that they be documented, with rationale. - Two people frowned on introducing operator bool methods not found in std::thread or Boost.Thread. - C++11 support was mentioned, notably Boost macros such as BOOST_RV_REF and BOOST_EXPLICIT_OPERATOR_BOOL. Also mentioned were: C++11 idioms; C++11 std::thread patterns; move construction; initializer lists; rvalue this overloads; deleting operators. - The fiber constructor and async() should accept a move-only callable. - At least for a C++11 compiler, fiber constructor and async() should accept variadic parameters. These should support move-only types, like Boost.Thread. C++03 support for variadic parameters would be nice, but is less important. - Every API involving time point or duration should accept arbitrary clock types, immediately converting to a canonical duration type for internal use. - Queues should support value_pop() returning item by value. This supports an item type without a default constructor. - Nested scoped_lock typedef has been deprecated in thread library. Remove in Fiber library. - Align the return type of shared_future::get() with the standard. In general, ensure that parameter types and return types are aligned with the standard. - A couple of people were bothered by the use of types in the detail namespace as parameters or return values in the algorithm API. (I note, however, that extending e.g. Boost.Range can involve touching its detail namespace. A customization point for a library may be a bit of a gray area.) - There was a suggestion to rename algorithm to scheduler. In that case, presumably set_scheduling_algorithm() could be renamed set_scheduler(). - There was a request to rename round_robin_ws to round_robin_work_stealing. - A couple of people consider the algorithm API too monolithic, pointing to redundancies in the round_robin, round_robin_ws and asio round_robin implementations. They suggested teasing out distinct classes, so that (for instance) a user-coded scheduler might be able to override a single method to respect fiber priority. In fact Eugene Yakubovich offered to experiment with refactoring the algorithm class this way. - There was a request for set_scheduling_algorithm() to return the previous pointer. (It might be useful for the requester to explain the anticipated use case. An earlier iteration of set_scheduling_algorithm() did return the previous pointer; Oliver intentionally changed that behavior.) - fiber_group got one thumbs-up and two thumbs-down. Options: retain; improve to use move support rather than fiber*; discard. There is an opportunity to improve on thread_group; naturally there is risk in diverging from thread_group. - Request deferred futures for lazy evaluation. - There was a suggestion to introduce a global object to coordinate thread-specific fiber schedulers, in the hope that the global object could perform all relevant locking and the thread-specific fiber schedulers could themselves be thread-unsafe. - There was a request to unify steal_from() and migrate_to() into a single method. I infer that this is predicated on the previous suggestion. - Request future::then() et al, per [5]. (Someone please clarify the present status of N3784?) - Request enriched barrier support per [6] and [7]. (Someone please clarify the present status of N3817?) - There are two fiber properties specific to particular schedulers: thread_affinity (used only by round_robin_ws) and priority (as yet unused by any scheduler). What if a user-coded scheduler requires a fiber property that does not yet exist? Is there a general approach that could subsume the present support for thread_affinity and priority, in fiber and this_fiber? Could the initial values for such properties be passed as part of the fiber constructor's attributes parameter? - One use case was surfaced that may engage the previous bullet: the desire to associate a given fiber with any of a group of threads, such as the set of threads local to a NUMA domain or physical CPU. IMPLEMENTATION - Replace std::auto_ptr with boost::scoped_ptr. The former produces deprecation warnings on GCC. - Reduce redundancy between try_lock() and lock(). - boost::fibers::asio::detail::yield_handler::operator()() calls algorithm::spawn() before algorithm::run(). Does this allow the scheduler to choose the next fiber to run, e.g. a user-coded scheduler that respects fiber priority? - Add memory transaction support to spinlock a la [8]. - Intel TSX lock avoidance would be nice. LINKS [1] https://github.com/STEllAR-GROUP/hpx/tree/master/tests/performance [2] http://stellar.cct.lsu.edu/pubs/isc2012.pdf [3] http://stellar.cct.lsu.edu/pubs/scala13.pdf [4] https://ci.nedprod.com/job/Boost.AFIO%20Build%20Documentation/Boost.AFIO_Do… [5] http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2013/n3784.pdf [6] http://www.boost.org/doc/libs/1_55_0/doc/html/thread/synchronization.html#t… [7] http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3817.html#barrier_… [8] https://github.com/BoostGSoC/boost.afio/blob/master/boost/afio/detail/ Nat Goodspeed Boost.Fiber Review Manager ________________________________

1 0

[Graph] initialize_vertex change vertex color (visitor)
by The Maschine 23 Jan '14

23 Jan '14

Hi all, I would like to build a visitor (for dikstra) with the initialise_vertex acting as 'colour map' modifier. I want to exclude some vertices from the search based on a condition. So I want to set some vertices 'black' in the init part of the algorithm. class dijkstra_2step : public boost::default_dijkstra_visitor { public: dijkstra_2step(std::vector<Weight> dists, double threshold): distances(dists), threshold(threshold) {} // THIS PART IS NOT CORRECT!!!! // void initialize_vertex(boost::graph_traits <unGraph>::vertex_descriptor u, const unGraph& g){ if( distances[u] > threshold ) color[u] = black; // ?????? } ////////// std::vector<Weight> distances; double threshold; }; Any help for the above visitor? How to I access the colour? I couldn't find something online. Thanks

3 12

[qi::phrase_parse] how to retain minus as string
by Uthpal Urubail 23 Jan '14

23 Jan '14

I am trying to store minus as the string in the key. I think its getting conflict with to(a-z) symbol key = +qi::char_(".a-zA-Z0-9") | qi::lexeme[('[' >> +qi::char_("@ + - * . ( , ) $ a-zA-Z0-9 ") >> ']')]; value = +qi::char_("a-zA-Z0-9") ; I have the string like below: std::string input = “[(@vala - @valb) * @valc]:real"; Can someone help me to resolve this? Regards, UJ

2 1

Build boost using CMake
by Chameera Wijebandara 23 Jan '14

23 Jan '14

Hi, I am new to the Boost. And I have to build Boost libraries with CMake. Any Suggestions? -- Thanks, Chameera

2 1

Server failing when BOOST_ASIO_ENABLE_HANDLER_TRACKING is active
by Gonzalo Garramuno 22 Jan '14

22 Jan '14

Trying to track down when the socket closes on my program, I turned on asio debugging. Server fails when BOOST_ASIO_ENABLE_HANDLER_TRACKING is active. Its stack trace is: g Scanning dependencies of target mrViewer [ 9%] Building CXX object mrViewer/src/CMakeFiles/mrViewer.dir/core/mrvServer.o Linking CXX executable ../../../bin/mrViewer [100%] Built target mrViewer # gga@gga-laptop1 /media/Linux/code/applications/mrViewer # mar ene 01 10:04 [8] $ mrViewer /media/Linux/movies/Tangled.mov [opengl] Using hardware shader profile: NVidia NV30 [opengl] mrViewer supports YUV images through shaders. [psql] Connected to database 'assets2d_development'. The code: boost::asio::io_service io_service; tcp::endpoint listen_endpoint(tcp::v4(), s->port); server rp(io_service, listen_endpoint, s->ui); io_service.run(); fails with: @asio|1357088683.200673|0|socket@0x7f303d8d2d00.close Got signal 11, faulty address is 0x1, from 0x4d222a [bt] Execution path: [bt] mrViewer(_ZN5boost4asio6detail15task_io_service16shutdown_serviceEv+0x3a) [0x4d222a] [bt] mrViewer(_ZN5boost4asio6detail15task_io_service16shutdown_serviceEv+0x3a) [0x4d222a] [bt] mrViewer() [0x4dd2c9] [bt] mrViewer(_ZN3mrv13server_threadEPKNS_10ServerDataE+0x408) [0x4e0e58] [bt] /usr/lib/libboost_thread.so.1.48.0(+0xdda9) [0x7f304e191da9] [bt] /lib/x86_64-linux-gnu/libpthread.so.0(+0x7e9a) [0x7f304f7f0e9a] [bt] /lib/x86_64-linux-gnu/libc.so.6(clone+0x6d) [0x7f304da1ccbd] without the #define the code works reliably except sometimes the socket closes unexpectedly.

4 5

Re: [Boost-users] Interprocess: rbtree_best_fit ABI change from 1.53 to 1.55 ?
by Arunski, Kevin 22 Jan '14

22 Jan '14

> El 22/01/2014 16:14, Arunski, Kevin escribió: > > Hello, I have been using a boost::interprocess::map stored in a > > managed mapped file segment, using the rb_best_fit allocation > > algorithm. > > > > I have observed that starting in boost 1.55, I cannot interoperate > > with instances of this allocator that were created by programs > > compiled by boost 1.53. > > > > It appears that the size of a boost::intrusive multiset object has > > changed, and this changes the representation of the rb_best_fit > > algorithm within the shared memory region. > > Sorry about that. That must be a bug. Can you tell me please the sizes > you get in both versions? Sure. In code compiled with boost 1.53, this type: boost::interprocess::rbtree_best_fit<boost::interprocess::null_mutex_family,boost::interprocess::offset_ptr<void,__int64,unsigned __int64,0>,0> has size = 56 member m_header.m_imultiset has size 32 In code compiled with boost 1.55: the same type has size = 72 member m_header.m_imultiset has size 48

2 1

Interprocess: rbtree_best_fit ABI change from 1.53 to 1.55 ?
by Arunski, Kevin 22 Jan '14

22 Jan '14

Hello, I have been using a boost::interprocess::map stored in a managed mapped file segment, using the rb_best_fit allocation algorithm. I have observed that starting in boost 1.55, I cannot interoperate with instances of this allocator that were created by programs compiled by boost 1.53. It appears that the size of a boost::intrusive multiset object has changed, and this changes the representation of the rb_best_fit algorithm within the shared memory region. The toolchain is unchanged between the two programs, in both cases it is Visual Studio 2012 on x64, linked against the release runtime library. The only change is that one was compiled using boost 1.53, while the other was compiled with boost 1.55. Is this the expected behavior? Is there a way to utilize boost interprocess in this way with reasonable certainty that the shared memory representation of it will not change between boost releases?

2 1

vector clock
by Kenneth Adam Miller 22 Jan '14

22 Jan '14

Does boost have either a vector clock or lamport clock of any kind?

2 1

boost multiprecision & STL map - resubmit
by tridiak＠ihug.co.nz 21 Jan '14

21 Jan '14

Ok. Better framed question. The following is compiled on XCode 5.0.1. Clang : Apple LLVM version 5.0 (clang-500.2.79) (based on LLVM 3.3svn) Target: x86_64-apple-darwin12.5.0 Thread model: posix Boost v 1.55.0. Build 2.0-m12. Not sure how to fix it. map complains about constructor ambiguity and I am not sure how to fix it. I am a casual hobbyist programmer and not a C++ expert. Looking at boost headers confuses me. Any help would be appreciated. //--------------------------------------------------------------------- Header File #ifndef boostTest_test_h #define boostTest_test_h #include #include #include using namespace boost::multiprecision; typedef std::map TestMap; #endif //------------------------------------------------------------------------- C++ file #include #include "test.h" int main(int argc, const char * argv[]) { static TestMap tm; std::string s="hello"; int128_t n=128; tm[n]=s;

3 2

odeint - solving an ODE with time-dependent parameter numerically
by Arijit Hazra 21 Jan '14

21 Jan '14

Hello All, I am trying to solve an ode with time-dependent parameters by using boost. I have just started using boost and I think boost library's odeint library is the best option for my problem. Would anyone please explain me how I can solve a Initial Value Problem --a system of ODE --with a time-dependent parameter. e.g. dy1/dt = a1(t) * y2 -b1(t)* y3 -c1(t) y1; dy2/dt = a2(t) * y1 -b2(t)* y1 -c2(t) y3; dy3/dt = a3(t) * y2 -b3(t)* y3 -c3(t) y1; y(0)=c; My idea so far after going through the manuals and help files. is that for fixed time-step if I form a vector of a,b,c and assume a,b,c to be constant over that time-period I can solve using boost library. But this is mathematically less accurate and computationally expensive as far my understanding .For solving an ODE numerically *y*˙(*t*)=*f*(*y*(*t*), *t*) generally the problem is all about function evaluation for explicit methods and Jacobian evaluation for Implicit methods at specific points in *t* and *y*. e.g a step of explicit Euler is *yn*+1=*yn*+(*tn*+1−*tn*)⋅*f*(*yn*,*tn*). For time-dependent parameter, treating it as part of *f*, the function evaluation (respectively, for implicit methods, also treat it as part of the Jacobian evaluation) is the standard procedure. A similar strategy applies to more complicated methods for solving ODEs (multistage methods such as Runge-Kutta, implicit methods for stiff systems, etc.). This strategy is different and mathematically more accurate than assuming parameters are constant over a time step like a multistage method. Would anyone please help me to solve this problem using boost? Thank you in advance. With Best Regards, Arijit Hazra

4 4

Sort boost composite container
by Uthpal Urubail 21 Jan '14

21 Jan '14

I am having below composite container. I am looking to sort the container by member<CA,std::string,&CA::card> at the end. Can some one help me to achieve this? typedef multi_index_container< CA, indexed_by< ordered_unique< composite_key< CA, member<CA,std::string,&CA::name>, member<CA,std::string,&CA::displayName>, member<CA,std::string,&CA::card> > > > > duplicateBook; Regards, UJ

3 2

[BGL] A* implementation
by Knut Krause 21 Jan '14

21 Jan '14

Hi, I'm still considering to use the BGL for my large scale path finding problem. Sadly I don't fully understand the implementation of A* used in boost. Does it use optimizations like bidirectional A* and so on or can I activate those somehow? I think otherwise I'd have to implement my own version of A*. Regards Knut

1 0

Help regarding how to start
by Mihir Thakkar 21 Jan '14

21 Jan '14

I was having a look at the To-Do list & Challenges of BGL. I found few of them already implemented. I would like to contribute, I would appreciate if someone can help from where to find the things which are not yet implemented, (like if boost has an updated To-Do list) I am interested in GUI, mathematics and general algorithms. Thanks!

1 0

Cross compiling boost Windows -> Arm
by Marius Adrian DOBRESCU 21 Jan '14

21 Jan '14

Hello. I have a problem compiling boost with arm-none-linux-gnueabi-g++ on Windows. Shared library dependencies paths seems to be hard-coded with Windows paths: Example: build\bin.v2\libs\filesystem\build\gcc-arm\release\target-os-linux\threading-multi\... I tried to build with --prefix. Not working. Hardcode-dll-paths not working too. Tried to specify an explicit -rpath. The so shared libraries are compiled with hard-coded paths inside, with backslash \\\ and I cannot use them on linux-arm. On stage directory they are hard-coded too. Any idea how can I disable this behavior and what options should I pass to boost and where? I want simple libraries without full rpaths and the build must be done on Windows with gcc-gnueabi. Thanks. Adrian

2 3

[Serialization] 1.49 to 1.55 problems
by John M. Dlugosz 21 Jan '14

21 Jan '14

I did search for "serialization incompatible version" on Google and found issues regarding certain older versions. I checked the release notes as far back as were on the web site, and didn't see anything. I tried building a program with Boost 1.55, and found it would not interoperate with existing programs that were built with Boost 1.49. Taking the error at face value, I need to configure the code to write the old version. How would I do that? —John

4 5

Using BGL for huge grid graphs
by Knut Krause 21 Jan '14

21 Jan '14

Hi, I'm planning on using the BGL on huge graphs the represent a grid where each vertex is a cell connected to it's 8 neighbours. I think something around 2,500,000,000 vertices would be a good number to approach but it would be great if it could handle (a lot) more later. If I got this graph I have to find the shortest path between two vertices. Does anyone here have experiences with graphs that large? Is this even worth a try on "normal" hardware? The edge weights would be stored in the vertices. So if you want to go from (a) to (b) you'd have to pay the cost stored in (b). The graph is not directed either. I read about BGLs CSR graph http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/compressed_sparse_row.h… but since I honestly have no clue how to use BGL yet I thought I'd first hear your opinons. Regards Knut

2 3

Re: [Boost-users] Cannot compile with multiprecision :: eval_*()functions
by Anderson Lebowski 21 Jan '14

21 Jan '14

looks like I went to the wrong track. Yes, merely the pow function works. Thank you very much! On Mon, Jan 20, 2014 at 8:42 AM, John Maddock <john(a)johnmaddock.co.uk>wrote: > I am trying to use eval_pow() and eval_powm() >> > > Those are internal details, you shouldn't really be using them in user > code. > > > My code is like this and I am using Visual Studio 12: >> >> #include <boost/multiprecision/cpp_int.hpp> >> ... >> boost::multiprecision::cpp_int pow("1234567"); >> boost::multiprecision::cpp_int base(3); >> boost::multiprecision::cpp_int result = 0; >> >> boost::multiprecision::default_ops::eval_pow(result, base, pow); >> >> I cannot figure out what's going on wrong when I compile it, the error >> message is like the following, Can anyone shed some light please? >> > > The eval_* functions take *Backends* and not *numbers* as arguments. > > In any case there is (deliberately) no integer pow function which accepts > an arbitrary precision exponent value - even 2^INT_MAX would run the > machine out of memory in a trice. > > What's wrong with: > > result = pow(base, 1234567); > > and let the expression template code handle memory management? > > John. > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

Cannot compile with multiprecision :: eval_*() functions
by Anderson Lebowski 20 Jan '14

20 Jan '14

Hi folks, I am trying to use eval_pow() and eval_powm() My code is like this and I am using Visual Studio 12: #include <boost/multiprecision/cpp_int.hpp> ... boost::multiprecision::cpp_int pow("1234567"); boost::multiprecision::cpp_int base(3); boost::multiprecision::cpp_int result = 0; boost::multiprecision::default_ops::eval_pow(result, base, pow); I cannot figure out what's going on wrong when I compile it, the error message is like the following, Can anyone shed some light please? D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(146): error C2039: 'unsigned_types' : is not a member of 'boost::multiprecision::number<boost::multiprecision::backends::cpp_int_backend<0,0,signed_magnitude,unchecked,std::allocator<boost::multiprecision::limb_type>>,et_on>' 1> D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(191) : see reference to class template instantiation 'boost::multiprecision::detail::canonical_imp<Val,Backend,boost::mpl::int_<1>>' being compiled 1> with 1> [ 1> Val=unsigned char 1> , Backend=double_type 1> ] 1> D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/integer_ops.hpp(309) : see reference to class template instantiation 'boost::multiprecision::detail::canonical<unsigned char,double_type>' being compiled 1> KeyGen.cpp(152) : see reference to function template instantiation 'void boost::multiprecision::default_ops::eval_powm<boost::multiprecision::cpp_int,int>(Backend &,const Backend &,const Backend &,Integer)' being compiled 1> with 1> [ 1> Backend=boost::multiprecision::cpp_int 1> , Integer=int 1> ] 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(146): error C2146: syntax error : missing ',' before identifier 'unsigned_types' 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(146): error C2065: 'unsigned_types' : undeclared identifier 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(148): error C2977: 'boost::mpl::find_if' : too many template arguments 1> D:\Develop\C++\boost_1_55_1\boost/mpl/find_if.hpp(33) : see declaration of 'boost::mpl::find_if' 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(148): error C2955: 'boost::mpl::find_if' : use of class template requires template argument list 1> D:\Develop\C++\boost_1_55_1\boost/mpl/find_if.hpp(33) : see declaration of 'boost::mpl::find_if' 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(136): error C2039: 'signed_types' : is not a member of 'boost::multiprecision::number<boost::multiprecision::backends::cpp_int_backend<0,0,signed_magnitude,unchecked,std::allocator<boost::multiprecision::limb_type>>,et_on>' 1> D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(191) : see reference to class template instantiation 'boost::multiprecision::detail::canonical_imp<Val,Backend,boost::mpl::int_<0>>' being compiled 1> with 1> [ 1> Val=int 1> , Backend=double_type 1> ] 1> D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/integer_ops.hpp(310) : see reference to class template instantiation 'boost::multiprecision::detail::canonical<Integer,double_type>' being compiled 1> with 1> [ 1> Integer=int 1> ] 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(136): error C2146: syntax error : missing ',' before identifier 'signed_types' 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(136): error C2065: 'signed_types' : undeclared identifier 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(138): error C2977: 'boost::mpl::find_if' : too many template arguments 1> D:\Develop\C++\boost_1_55_1\boost/mpl/find_if.hpp(33) : see declaration of 'boost::mpl::find_if' 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/number_base.hpp(138): error C2955: 'boost::mpl::find_if' : use of class template requires template argument list 1> D:\Develop\C++\boost_1_55_1\boost/mpl/find_if.hpp(33) : see declaration of 'boost::mpl::find_if' 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/integer_ops.hpp(336): error C2780: 'enable_if<boost::multiprecision::backends::is_trivial_cpp_int<boost::multiprecision::backends::cpp_int_backend<MinBits,MaxBits,SignType,Checked,Allocator>>,void>::type boost::multiprecision::backends::eval_right_shift(boost::multiprecision::backends::cpp_int_backend<MinBits,MaxBits,SignType,Checked,Allocator> &,T)' : expects 2 arguments - 1 provided 1> D:\Develop\C++\boost_1_55_1\boost/multiprecision/cpp_int/bitwise.hpp(355) : see declaration of 'boost::multiprecision::backends::eval_right_shift' 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/integer_ops.hpp(336): error C2780: 'enable_if_c<!boost::multiprecision::backends::is_trivial_cpp_int<boost::multiprecision::backends::cpp_int_backend<MinBits,MaxBits,SignType,Checked,Allocator>>::value,void>::type boost::multiprecision::backends::eval_right_shift(boost::multiprecision::backends::cpp_int_backend<MinBits,MaxBits,SignType,Checked,Allocator> &,boost::multiprecision::double_limb_type)' : expects 2 arguments - 1 provided 1> D:\Develop\C++\boost_1_55_1\boost/multiprecision/cpp_int/bitwise.hpp(298) : see declaration of 'boost::multiprecision::backends::eval_right_shift' 1>D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/integer_ops.hpp(336): error C2780: 'void boost::multiprecision::default_ops::eval_right_shift(T &,const T &,const V)' : expects 3 arguments - 1 provided 1> D:\Develop\C++\boost_1_55_1\boost/multiprecision/detail/default_ops.hpp(758) : see declaration of 'boost::multiprecision::default_ops::eval_right_shift' ------------------------------ Thanks, -Anderson Lebowski

2 1

Boost.Mock ?
by Mathieu Champlon 20 Jan '14

20 Jan '14

Hello, I initially sent the following message to the boost-dev mailing list, but I'm thinking this might reach more potential users here on boost-users. Would a library for mock objects be of interest ? The documentation can be found here : http://mat007.users.sourceforge.net/boost_mock/ An archive is also available for download there : http://sourceforge.net/projects/mat007.u/files/boost-mock.zip It's been converted from turtle (http://turtle.sourceforge.net/) which was mentioned on the mailing-lists a couple of times in the past. There is a catch in that it needs Boost.Test from the release branch and doesn't compile with the trunk. The changes are minimal though and I can provide a patch if anyone is interested. Is anyone already using the library who would like to see it in Boost ? Or is anyone using another mock object library who wants to give it a go ? Or even better has anyone tried it and decided to user another library who would like to comment on it ? I would be highly interested in any feedback ! Thank you, MAT.

6 9

how to sort boost composite container
by Uthpal Urubail 20 Jan '14

20 Jan '14

I am using below composite container. Finally I am looking to sort

1 0

Question for Boost.Threads and Boost.Test
by young 20 Jan '14

20 Jan '14

According to Boost document, Boost.Test can only be statically linked. Boost.Threads can only be dynamically linked. Then what boost_unit_test_framework-vc100-mt-1_53.lib for? Is it for dynamically linked dll? what libboost_thread-vc100-mt-1_53.lib for? Is it for static library? -- View this message in context: http://boost.2283326.n4.nabble.com/Question-for-Boost-Threads-and-Boost-Tes… Sent from the Boost - Users mailing list archive at Nabble.com.

4 6

[Test] Where to learn about boost::itest::mock_object?
by Mateusz Loskot 20 Jan '14

20 Jan '14

Hi, I'm looking for a simple mocking library to use together with Boost.Test. There is Turtle (aka Boost.Mock) and googlemock. During retrospection of the big thread on Boost.Test future [1], I found this curious post by Gennadiy [2] about mock_object. I had no idea such facility lives in Boost.Test and it looks it's been there for very long time. I can't find any documentation about mock_oboject, only a couple of examples. So, I have a few questions: Is the mock_object an internal feature or is it dedicated (and ready) to use by Boost.Test users? What are basic features of this mocking facility? How does it compare to Turtle or googlemock? [1] http://thread.gmane.org/gmane.comp.lib.boost.devel/234297 [2] http://thread.gmane.org/gmane.comp.lib.boost.devel/234297/focus=234621 [3] find /home/mloskot/dev/boost/_svn/trunk/libs/test -type f | xargs grep mock_object Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

4 4

[Geometry] Registering the Windows RECT structure
by Sean Farrow 19 Jan '14

19 Jan '14

Hi all, Does anybody know whether the Windows RECT structure is known to the boost geometry library. The RECT structure is declared as follows: typedef struct _RECT { LONG left; LONG top; LONG right; LONG bottom; } RECT, *PRECT; Members left The x-coordinate of the upper-left corner of the rectangle. top The y-coordinate of the upper-left corner of the rectangle. right The x-coordinate of the lower-right corner of the rectangle. bottom The y-coordinate of the lower-right corner of the rectangle. If there is no registration, is there an example that shows how to do this? Any help appreciated. Regards Sean.

3 2

[xpressive] Accessing named capture from another scope in the semantic action
by Roger 19 Jan '14

19 Jan '14

Hi! Is it possible access captured group from another scope in the semantic action? Can I write a lazy function somehow and access another scope? The following code results in ”bad_lexical_cast” exception, likely due to the named capture "Year" is an empty string in the "outer scope". const sregex yyyymmdd = (Year=_d>>_d>>_d>>_d) >> (Month= _d>>_d) >> (Day= _d>>_d); sregex rx = yyyymmdd [ tm_year(t) = as<int>(Year) - 1900 /*, … */ ] // bad lexical cast: source type value could not be interpreted as target >> hhmmss [ tm_hour(t) = as<int>(Hour) /*, …*/ ] ; In my case the regex has no recursion, no captured repeated groups, so I can't understand really why I got nested result set. Dumping the nested result tree indicates that the values are captured in another ”scope”. But this is in the match_result<> set, and I can't figure out if there is any equivalent set available inside the semantic action. 20140119190000 #rx day = hour = minute = month = second = year = 20140119 #yyyymmdd day = 19 hour = minute = month = 01 second = year = 2014 190000 #hhmmss day = hour = 19 minute = 00 month = second = 00 year = I’m asking mostly for educational reason. Thanks for any hints! perrog Code: mark_tag Year(1),Month(2),Day(3),Hour(4),Minute(5),Second(6), Micro(7); const sregex yyyymmdd = (Year=_d>>_d>>_d>>_d) >> (Month= _d>>_d) >> (Day= _d>>_d); const sregex hhmmss = (Hour=_d>>_d)>>(Minute=_d>>_d)>>(Second=_d>>_d); bool is_datetime(std::string const& input) { // …don’t need any semantic actions when validating… smatch ignore; sregex rx = yyyymmdd >> hhmmss; return regex_match(input, ignore, rx); } bool get_datetime(std::string const& input, struct tm *time) { local<struct tm*> t(time); function<int tm::*>::type tm_year = { &tm::tm_year }; function<int tm::*>::type tm_hour = { &tm::tm_hour }; // … sregex rx = yyyymmdd [ tm_year(t) = as<int>(Year) - 1900 /*, … */ ] // bad lexical cast: source type value could not be interpreted as target >> hhmmss [ tm_hour(t) = as<int>(Hour) /*, …*/ ] ; smatch ignore; return regex_match(input, ignore, rx); }

2 1

boost multiprecision & STL map
by tridiak＠ihug.co.nz 19 Jan '14

19 Jan '14

I have a boost/C++ error which I am having a difficult time figuring out. Compiler error : Call to member function '__construct_node' is ambiguous Where StellarID()==0) {return errInvalidID;} if (stellarObjects.find(obj->StellarID())!= stellarObjects.end()) { return errStellarObjectIDClash; } stellarObjects[obj->StellarID()]=obj;

2 1

[coroutine] Launch a thread in a coroutine
by Pierre Talbot 18 Jan '14

18 Jan '14

Hi, Is it possible to launch a thread in a coroutine? Such that this code would work: #include <iostream> #include <thread> #include <boost/coroutine/all.hpp> std::thread t; void push_data2(boost::coroutines::coroutine<std::string>::push_type sink) { sink("test2"); } void push_data(boost::coroutines::coroutine<std::string>::push_type& sink) { sink("test1"); t = std::thread(push_data2, std::move(sink)); } int main() { boost::coroutines::coroutine<std::string>::pull_type source(push_data); auto b = boost::begin(source); auto e = boost::end(source); std::cout << *b << std::endl; ++b; std::cout << *b << std::endl; t.join() return 0; } Output: test1 parser: /usr/local/include/boost/smart_ptr/intrusive_ptr.hpp:162: T* boost::intrusive_ptr<T>::operator->() const [with T = boost::coroutines::detail::push_coroutine_base<std::basic_string<char> >]: Assertion `px != 0' failed. Aborted (core dumped)

2 4

[chron] time_point convertible?
by Oliver Kowalke 17 Jan '14

17 Jan '14

are the time_point-types of the clock-types from boost.chrono convertible into each other? chrono::system_clock::time_point t = convert_fun( chrono::steady_clock::now() ) etc. ?

7 11

[serialization] test_dll_exported in VS2012
by Stefan Gradinger 17 Jan '14

17 Jan '14

Hi! I am currently trying to run the test_dll_exportet test in Visual Studio 2012, with polymorphic_derived2.cpp in a DLL and test_dll_exportet.cpp in the executable. Compiling and Linking works fine, but when I run the test, I get an "unregistered void cast class polymorhpic_derived2<-polymorhpic_base" error at line 85 of test_dll_exportet.cpp. Running the same test using the library_test tool (library_test --toolset=msvc-11.0) yields no errors. Does anybody have an idea what the cause for this problem might be? -- View this message in context: http://boost.2283326.n4.nabble.com/serialization-test-dll-exported-in-VS201… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

Re: [Boost-users] [msm] [mpl] wrong number of template arguments (21, should be 20)
by Kamel Zaarouri, Mr 17 Jan '14

17 Jan '14

Hi, I added a new transition to my statemachine that is built around boost::msm and I got this error when compiling. error: wrong number of template arguments (21, should be 20) /boost/mpl/aux_/sequence_wrapper.hpp:154: error: provided for 'template<class T0, class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class T10, class T11, class T12, class T13, class T14, class T15, class T16, class T17, class T18, class T19> struct boost::mpl::vector' I went to add in the beginning of the header file before any boost includes: #define BOOST_MPL_LIMIT_LIST_SIZE 30 But that didn't fix it. I also tried adding in the makefile.am AM_CFLAGS = \ -DBOOST_MPL_LIMIT_LIST_SIZE=30 \ But that didn't fix it either. And then I hacked boost/mpl/limits/list.hpp and I changed the default value of BOOST_MPL_LIMIT_LIST_SIZE from 20 to 30 and I still have this error. Any idea? Thanks, Kamel

2 3

[enable_if] Problem with conversion operator in VS2012
by dariomt＠gmail.com 17 Jan '14

17 Jan '14

Hi all, I'm trying to follow the example given in http://www.boost.org/doc/libs/1_55_0/libs/utility/enable_if.html#sec:enable… But VS2012 compiler gives: error C4519: default template arguments are only allowed on a class template Is this supposed to work with VS2012? Is there some other way to use enable_if in a conversion operator with VS2012? Thnaks!

3 2

Compress to buffer
by Kenneth Adam Miller 16 Jan '14

16 Jan '14

I have an object for which operator << is defined, myobj. I want to compress into a buffer, and I know that this can be done with boost. I would prefer a buffer that dynamically resizes, but that only allocates new space, preferably treating discontiguous space brought on by new allocations as though the whole buffer was one piece; I don't want to find that it's copying data at all. So vector won't work as a buffer; there's no need for it to be contiguous, just as fast as possible. I've been trying to do this with filtering_istreambuf by pushing a bzip2_compressor (any compression filter will work). So far, it's giving me a lot of trouble. I did find an example where a string was passed to a function, but they went through a process where they first moved the string into an stringstream. I don't want to settle for that extra copy either. What would be nice is to be able to do something like compressor << myobj compressor.buf(); //returns compressed myobj output

3 18

Boost.Heap (i.e fibonacci_heap) handle_type handles are persistent across calls?
by Tassos Souris 16 Jan '14

16 Jan '14

Hello to everyone When i use, say a fib_heap fb1 and fib_heap fb2. I add some data to fb1 using the push method and keep the handles returned from those calls. I do the same with fb2. Then i do some modification to the heaps. Lets say i do fb1.merge(fb2). Can i use the handles i obtained from the push calls on fb2 to update the data that was originally in fb2 and now in fb2?? That is the first time i obtain a handle_type from the push() method, it remains valid until the item is removed from the heap?? I tested the above scenario and seems to work but the documentation doesn't say anything and i would like another opinion. Thanks

1 0

Trying to extract sub library from Boost using BCP
by Colin Burn 16 Jan '14

16 Jan '14

I'm trying to extract "just what I need" from Boost to reduce the checkin footprint. So far I'm doing the following (On Windows): bootstrap.bat b2 tools/bcp md extract dist\bin\bcp boost/thread.hpp boost/shared_ptr.hpp boost/enable_shared_from_this.hpp boost/asio.hpp boost/thread/thread.hpp boost/bind.hpp boost/thread/lock_types.hpp boost/thread/condition_variable.hpp .\extract cd extract ..\b2but this gives me an error: boostcpp.jam: No such file or directory link.jam: No such file or directory Jamroot:137: in modules.load ERROR: rule "boostcpp.set-version" unknown in module "Jamfile<C:\temp\boost_1_55_0\extract>". C:/temp/boost_1_55_0/tools/build/v2/build\project.jam:311: in load-jamfile C:/temp/boost_1_55_0/tools/build/v2/build\project.jam:64: in load C:/temp/boost_1_55_0/tools/build/v2/build\project.jam:145: in project.find C:/temp/boost_1_55_0/tools/build/v2\build-system.jam:535: in load C:\temp\boost_1_55_0\tools\build\v2/kernel\modules.jam:289: in import C:\temp\boost_1_55_0\tools\build\v2/kernel/bootstrap.jam:139: in boost-build C:\temp\boost_1_55_0\boost-build.jam:17: in module scopeWhat am I doing wrong? What is the correct way to compile the extracted sub-library? Thanks Colin

1 0

[Geometry] Calculating the centre of a rectangle
by Sean Farrow 16 Jan '14

16 Jan '14

Hi All, I'm in the process of needing to calculate the centre point of a rectangle, given the top left and bottom right co-ordinates. Before I write this myself, I was wondering whether boost Geometry already has something to do this. Any help appreciated. Cheers Sean.

2 1

Re: [Boost-users] [Asio] signal_set not blocking/queueing signals on shutdown (Slava)
by Marat Abrarov 16 Jan '14

16 Jan '14

> >> I've written an io_service+signal_set signal handling implementation > >> in a thread of my application that triggers an orderly shutdown when > >> (among other things) the user presses Ctrl+C. > >> > > I first hear about asio signals, but I believe purpose of these signal > facility in asio is only to help you to implement *waiting* for signals, > like SIGCHLD, or SIGUSR{12}, whateverer you may choose for your IPC > communication. You should not misuse asio for general signal handling. > Normally signals are instantaneous things to be delivered right now right > here without any regard in which state the target is. I personally agree with Benjamin and think that the main goal of asio::signal_set is to provide the Asio way to handle signals. Look at the Asio examples (http://www.boost.org/doc/libs/1_55_0/doc/html/boost_asio/examples/cpp03_exa mples.html) - the "HTTP Servers" series. They use asio::signal_set for the same goal/reason as Benjamin does. Regards, Marat Abrarov.

1 0

[Asio] signal_set not blocking/queueing signals on shutdown
by Benjamin Shadwick 16 Jan '14

16 Jan '14

I've written an io_service+signal_set signal handling implementation in a thread of my application that triggers an orderly shutdown when (among other things) the user presses Ctrl+C. According to the Boost.Asio documentation for signal_set ( http://www.boost.org/doc/libs/1_55_0/doc/html/boost_asio/reference/signal_s…) just having a signal_set (with inherent dependency on an io_service) with registered signals and not in a wait state is supposed to be enough to cause signals to be blocked/queued. After I stop the io_service and cancel the wait state on the signal_set, however, it appears that signal blocking/queueing is no longer occurring. I say this because hitting Ctrl+C during orderly shutdown after the io_service has stopped causes my application to instantly terminate (and in one case generate a core file). Is there something about stopping the io_service and/or canceling the async wait on the signal_set that is causing the note about signal queueing in the signal_set documentation to no longer apply? Thanks in advance.

2 2

[boost::shared_ptr] Easy to violate the One Definition Rule / C++11 / Check für standard used to compile Boost
by beet 15 Jan '14

15 Jan '14

Hi there, from what I can see, boost::shared_ptr has a different definition, depending on whether Boost is compiled in C++98 oder C++11 mode. For example, in C++11-mode, shared_ptr has a move-constructor. By default, however, Boost seems to be compiled in C++98 mode, even with a compiler like gcc 4.8 (Ubuntu 13.10 / 64 bit / Boost 1.55), that is perfectly capable of compiling in C++11 mode. So, while boost::shared_ptr is header-only, all Boost libraries that use boost::shared_ptr will assume the C++98 version. The build-environment of one of my applications checks the compiler (currently gcc and CLang) and, depending on the version, activates C++11 support, so that I can use some C++11-checks (such as override), that can easily be #defined away for C++98 . So what may happen here is that my main application uses a different boost::shared_ptr than the Boost libraries I want to link with. To me this seems to violate the one-definition rule (and may happen with other Boost libraries as well). Indeed I'm seeing some strange errors, where "if(!p) {raise_error();}" triggers for a shared_ptr<derived_class> p, but I can still access member functions of a base_class that derived_class is derived from. Now, while I'm not yet sure that the above is the cause of this problem, I'd like to make sure that my build system chooses the appropriate C++ standard for compilation. Hence: Is there any way I can check (e.g. through some #define provided by Boost) what C++ standard it has been compiled with ? Thanks and Best Regards, Beet

2 1

[Units] conversion between double and millimeter
by Richel Bilderbeek 15 Jan '14

15 Jan '14

Hello Boost.Units users, When I convert a double to a unit (e.g. meter) and back, this works as expected. When I convert a double to a prefixed unit (e.g. millimeter) and back, this fails to compile. The code below shows how I'd expect it to work. What do I overlook? Thanks, Richel Bilderbeek const double x_in_mm = 1.0; const Length x(x_in_mm * milli * meter); //This works as expected: const double x_again_in_m = x / meter; //Why doesn't this: const double x_again_in_mm = x / (milli * meter); //Fails

2 1

[log] Default logging configuration for trivial logger
by Ben Pope 15 Jan '14

15 Jan '14

Hi, I'm using the trivial logging interface, but I need to tweak the default configuration. I want to be able to flush after every log entry, and I also want to be able to do file rolling. As far as I can tell, in order to configure it this way, I pretty much need to configure the whole thing from scratch including formatters, but I can't find the code that sets up the default logger to replicate it. Any pointers? Cheers, Ben

1 0

boost.log: how to view open log files
by Georg.Kellerer＠lfu.bayern.de 14 Jan '14

14 Jan '14

Hi, currently i am writeng a windows service and use the boost.log library for logfile creation. The serive should run long and I want to view the log files when the service is running. At the moment the logfile is written to the disk when the service ends and the file always has a size of 0 bytes. Is there a way to configure boost.log in a way that the log entries are written to disk immideately and that the logfile is not locked for reading by another application so that I can view my logfile? Thanks a lot, Georg

3 3

Thread_group semantics
by Kenneth Adam Miller 14 Jan '14

14 Jan '14

When a thread_group is assigned a task using post, does that task get executed sequentially? Is there a list, so that, when too many posts are added to it, it keeps track of them?

3 11

[program-options] Line width ignored on add()-ed options_description?
by Rhys Ulerich 13 Jan '14

13 Jan '14

I've got a "primary" options_description instance to which I add() other "secondary" options_description instances. I want operator<< to print the primary and all secondary instances with the primary instance's line width. I expect that this should happen automagically because, after construction, I cannot adjust the private m_line_length member of the secondary instances through any public means. However, it does not. A small re-create follows my signature. In my applications, I do not control the construction of the secondary instances and so I cannot adjust the secondary instance's construction-time width setting. Is this behavior a deliberate design decision? Some minor rework to options_description::print(...) within src/options_description.cpp would make it possible. Thanks, Rhys #include <iostream> #include <boost/program_options.hpp> int main() { static const char lengthy[] = "123456789 123456789 123456789 123456789 " "123456789 123456789 123456789 123456789 " "123456789 123456789 123456789 123456789 " "123456789 123456789 123456789 123456789 " "123456789 123456789 123456789 123456789 " "123456789 123456789 123456789 123456789 " "123456789 123456789 123456789 123456789 "; boost::program_options::options_description foo(255); // Linewidth 255 foo.add_options() ( "foo", lengthy ); boost::program_options::options_description bar; // Default line width bar.add_options() ( "bar", lengthy ); // foo should either dictate bar's line width, or... // I should be able to change it via a public interface... // ... but I seemingly cannot. foo.add(bar); // Option --foo has a nice long width, // but option --bar is truncated. std::cout << foo; }

1 0

UDP bind problems
by ustulation 13 Jan '14

13 Jan '14

{Windows 7, MinGW 4.8, boost 1.55} I'm having some problems with UDP binds. I've a client that broadcasts datagrams for listeners listening on specific port and binds to a port itself if the listeners want to communicate something back. The port on which the client needs to bind is X and the servers are listening on Y. Problem: If I simulate a client-crash (eg., by causing segmentation fault by dereferencing a nullptr) after binding the UDP socket to the port, then once the client application is no longer running (no longer listed in Windows Task Manager) netstat -ano | find "X" still shows that someone is bound to port X and ip address of 0.0.0.0 (the client had specified the IP address as any address). The PID cannot be found in Windows Task Manager. However when I downloaded application TCPView I can see that a *<non-existent>* process is still bound to 50000. On starting the client (without making it crash this time) subsequently I get two behaviors: <1> On some machines the client is unable to bind to the socket again (although reuse_address option is set to true) and the error message is: An attempt was made to access a socket in a way forbidden by its access permissions. <2> On other machines the client binds successfully but the read handler is not called and the client does not receive any datagram on port X although the servers are unicasting to the client port X. Infact <2> is true even for launching multiple instances of the client on the same machine even if none of the clients were deliberately made to crash and exist as zombie processes. Only the 1st one gets datagrams. Here is how client socket is set up: if(!m_udpSocket.is_open()) { m_udpSocket.open(m_localEndpoint.protocol(), errorCode); //m_localEndpoint is address 0.0.0.0 and port X if(errorCode) { std::cerr << "Unable to open socket: " << errorCode.message() << std::endl; } else { m_udpSocket.set_option(boost::asio::socket_base::reuse_address(true), errorCode); if(errorCode) { std::cerr << "Reuse address option set failure. " << errorCode.message() << std::endl; } m_udpSocket.set_option(boost::asio::socket_base::broadcast(true), errorCode); if(errorCode) { std::cerr << "Socket cannot send broadcast. " << errorCode.message() << std::endl; } else { m_udpSocket.bind(m_localEndpoint, errorCode); if(errorCode) { std::cerr << "Socket cannot bind...!! " << errorCode.message() << std::endl; } } } } Can you explain why do I get <1> and <2> and what can I do to avoid them and make socket bind even if there is some other process bound to that socket? I need to support Windows, Linux and MAC -- View this message in context: http://boost.2283326.n4.nabble.com/UDP-bind-problems-tp4657731.html Sent from the Boost - Users mailing list archive at Nabble.com.

3 4

Fast IPC between Linux and Windows on the same host
by U.Mutlu 13 Jan '14

13 Jan '14

Hi, what is the fastest cross-platform IPC mechanism between Linux and Windows on the same physical host? Additional info: Host OS is Linux (Debian), Windows XP is hosted in VirtualBox. Of course TCP/IP sockets is a possibility, but I need something much faster. My preference would be to use shared memory, but is it possible in such an heterogene environment? And: can Boost.Interprocess be used for this scenario? Thx -- U.Mutlu DACOS Notdienstanlagen GmbH, Germany

4 6

using iterator_range with wchar_t
by Sean Farrow 13 Jan '14

13 Jan '14

Hi All, I'm sorry if this has already been covered. I'm trying to use iterator_range with a wchar_t. My code is as follows: std::wstring buttonName =L"jar:file:/C:/Program%20Files/diseMP/4.5.6/O2-LIVE/lib/client/ClientResources.jar!/branding/default/buttons/FindButtonActive.png"; bool isGraphical =false; isGraphical =boost::algorithm::starts_with(buttonName, L"jar:file:/") && boost::algorithm::ends_with(buttonName, L".png"); boost::iterator_range<wchar_t> range =boost::algorithm::find_last(buttonName, L"/"); I'm getting the following errors: 1>------ Build started: Project: TestApp, Configuration: Debug Win32 ------ 1> TestApp.cpp 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(30): error C2039: 'value_type' : is not a member of 'boost::detail::iterator_traits<Iterator>' 1> with 1> [ 1> Iterator=wchar_t 1> ] 1> c:\program files (x86)\boost\boost\range\iterator_range_core.hpp(141) : see reference to class template instantiation 'boost::iterator_value<Iterator>' being compiled 1> with 1> [ 1> Iterator=wchar_t 1> ] 1> c:\work\panthion studios\o2\testapp\testapp.cpp(11) : see reference to class template instantiation 'boost::iterator_range<IteratorT>' being compiled 1> with 1> [ 1> IteratorT=wchar_t 1> ] 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(30): error C2146: syntax error : missing ';' before identifier 'type' 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(30): error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(30): error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\program files (x86)\boost\boost\range\iterator_range_core.hpp(141): error C2039: 'type' : is not a member of 'boost::iterator_value<Iterator>' 1> with 1> [ 1> Iterator=wchar_t 1> ] 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(49): error C2039: 'difference_type' : is not a member of 'boost::detail::iterator_traits<Iterator>' 1> with 1> [ 1> Iterator=wchar_t 1> ] 1> c:\program files (x86)\boost\boost\range\iterator_range_core.hpp(145) : see reference to class template instantiation 'boost::iterator_difference<Iterator>' being compiled 1> with 1> [ 1> Iterator=wchar_t 1> ] 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(49): error C2146: syntax error : missing ';' before identifier 'type' 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(49): error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(49): error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\program files (x86)\boost\boost\range\iterator_range_core.hpp(145): error C2039: 'type' : is not a member of 'boost::iterator_difference<Iterator>' 1> with 1> [ 1> Iterator=wchar_t 1> ] 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(36): error C2039: 'reference' : is not a member of 'boost::detail::iterator_traits<Iterator>' 1> with 1> [ 1> Iterator=wchar_t 1> ] 1> c:\program files (x86)\boost\boost\range\iterator_range_core.hpp(159) : see reference to class template instantiation 'boost::iterator_reference<Iterator>' being compiled 1> with 1> [ 1> Iterator=wchar_t 1> ] 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(36): error C2146: syntax error : missing ';' before identifier 'type' 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(36): error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\program files (x86)\boost\boost\iterator\iterator_traits.hpp(36): error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\program files (x86)\boost\boost\range\iterator_range_core.hpp(159): error C2039: 'type' : is not a member of 'boost::iterator_reference<Iterator>' 1> with 1> [ 1> Iterator=wchar_t 1> ] 1>c:\program files (x86)\boost\boost\type_traits\is_abstract.hpp(72): error C2139: 'boost::iterator_range<IteratorT>' : an undefined class is not allowed as an argument to compiler intrinsic type trait '__is_abstract' 1> with 1> [ 1> IteratorT=wchar_t 1> ] 1> c:\program files (x86)\boost\boost\type_traits\is_abstract.hpp(144) : see reference to class template instantiation 'boost::detail::is_abstract_imp<T>' being compiled 1> with 1> [ 1> T=boost::iterator_range<wchar_t> 1> ] 1> c:\program files (x86)\boost\boost\mpl\aux_\preprocessed\plain\or.hpp(51) : see reference to class template instantiation 'boost::is_abstract<T>' being compiled 1> with 1> [ 1> T=boost::iterator_range<wchar_t> 1> ] 1> c:\program files (x86)\boost\boost\mpl\if.hpp(63) : see reference to class template instantiation 'boost::mpl::or_<T1,T2>' being compiled 1> with 1> [ 1> T1=boost::is_abstract<boost::iterator_range<wchar_t>>, 1> T2=boost::is_array<boost::iterator_range<wchar_t>> 1> ] 1> c:\program files (x86)\boost\boost\range\iterator_range_core.hpp(174) : see reference to class template instantiation 'boost::mpl::if_<T1,T2,T3>' being compiled 1> with 1> [ 1> T1=boost::mpl::or_<boost::is_abstract<boost::iterator_range<wchar_t>>,boost::is_array<boost::iterator_range<wchar_t>>>, 1> T2=boost::iterator_range<wchar_t>, 1> T3=boost::iterator_range<wchar_t> 1> ] ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== Does anyone have any clues as to why this is happening or alternatively any working example? Help appreciated as always. Regards Sean.

2 1

Boost.Fiber review January 6-15
by Nat Goodspeed 13 Jan '14

13 Jan '14

Hi all, The review of Boost.Fiber by Oliver Kowalke begins today, Monday January 6th, and closes Wednesday January 15th. ----------------------------------------------------- About the library: Boost.Fiber provides a framework for micro-/userland-threads (fibers) scheduled cooperatively. The API contains classes and functions to manage and synchronize fibers similar to Boost.Thread. Each fiber has its own stack. A fiber can save the current execution state, including all registers and CPU flags, the instruction pointer, and the stack pointer and later restore this state. The idea is to have multiple execution paths running on a single thread using a sort of cooperative scheduling (versus threads, which are preemptively scheduled). The running fiber decides explicitly when it should yield to allow another fiber to run (context switching). Boost.Fiber internally uses coroutines from Boost.Coroutine; the classes in this library manage, schedule and, when needed, synchronize those coroutines. A context switch between threads usually costs thousands of CPU cycles on x86, compared to a fiber switch with a few hundred cycles. A fiber can only run on a single thread at any point in time. docs: http://olk.github.io/libs/fiber/doc/html/ git: https://github.com/olk/boost-fiber src: http://ok73.ok.funpic.de/boost.fiber.zip The documentation has been moved to another site; see the link above. If you have already downloaded the source, please refresh it; Oliver has added some new material. --------------------------------------------------- Please always state in your review whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - 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? Nat Goodspeed Boost.Fiber Review Manager ________________________________

1 1

[Log 2.0] rotating files size limiation
by Ovanes Markarian 13 Jan '14

13 Jan '14

Hello *, I am a bit stuck to implement a very simple scenario with boost log. I need to limit the size of entire rotation log. My current logger configuration looks like that: void setup_logging( channel_settings_t const& settings , std::string const& log_file , std::string const& log_level ) { config_logger_attributes(logging::core::get(), settings, log_level); using namespace logging::aux::default_attribute_names; //add logging to file (which implicitly deletes the default console logger) logging::add_file_log ( keywords::auto_flush = true, keywords::open_mode = std::ios::out | std::ios::app, keywords::file_name = log_file+"_%N.log", keywords::rotation_size = 50 * 1024, // Just for test limit to 50K keywords::format = //"%TimeStamp%: [%Channel%] |ThreadId| <%Severity%> %Message%" expr::format("%1% : [%2%] |%3%| <%4%> %5%") % expr::attr< boost::posix_time::ptime >(timestamp()) % expr::attr<std::string>(channel()) % expr::attr<attrs::current_thread_id::value_type>(thread_id()) % trivial::severity % expr::smessage )->locked_backend()->set_file_collector ( sinks::file::make_collector ( keywords::target = "logs" , keywords::max_size = 200 * 1024 // just for test limit to 200K ) ) ; } Unfortunately, I can't find what the target keyword means, despite the fact that it is a target directory. Target directory relating to smth or should there be a full path? Should this target directory exist? I did a test and rotating log files just grow upon the 200K limit. I just want to have let's say 3 or 4 last rotated log files, the rest should be removed? We already ran into the situation, where the logger used all disc space and the server crashed :( Any help if very appreciated! Thanks, Ovanes

1 1

Does Boost.Test cover 'golden file approach'?
by Journeyer J. Joh 13 Jan '14

13 Jan '14

Hello, I know almost nothing about 'golden file approach'. http://weblogs.java.net/blog/alexeyp/archive/2007/02/testing_command.html >From this blog, you can find the term 'golden file approach'. I want to know if Boost.Test cover this kind of testing. Can I implement 'golden file approach' with Boost.Test? If so please provide me more information about it. Thank you very much. ---------------------------------------- Journeyer J. Joh o o s a p r o g r a m m e r a t g m a i l d o t c o m ----------------------------------------

3 5

lockfree::queue restrictions and performance on linux
by Leon Mlakar 13 Jan '14

13 Jan '14

Hello, after quite a while I'm back to using Boost (and back to the list) and quite happy to see that it made significant progress since I last last used it. One of the libraries that got my attentions is lockfree, the lockfree::queue in particular, since it almost completely meets my needs. Except that I've been wondering why is it that it places the requirement for the trivial destructor on the items it stores? I mean, that really reduces its usability. Is this something inherent to its design? I guess that this has been discussed during the review but a quick digging through the archives didn't come up anything on this. The reason for asking is that I have forced the queue to accept std::shared_ptr and this seems to work almost fine, except that there seem to be an extra reference left to the item last popped, but that's something I can live with. Another thing was its performance - I ran a sort of quick benchmark (queue of shared_ptr's to item containing atomic<int> as a counter, items were popped from the queue and immediately pushed back after decrementing the counter) and its perfromance was next to stellar on OSX (with multiple consumers and producers something like forty times faster than std::queue with mutex) but very poor on Linux. While I can understand that locking runs fast on Linux due to its spinlock/futex implementation of mutexes, I have no explanation for the poor performance of lockless::queue (with two producer/consumer threads std::queue with mutex was about 15 times faster and about 20 times slower than when run on OSX on the similar hardware). Did anybody else observe the same poor performance behavior? I used Boost 1.54 and tested with both gcc 4.8 and clang 3.5 and got similar results with both. Regards, Leon

2 3

[Boost::any] Memory management using dynamic libraries
by Eugenio Bargiacchi 13 Jan '14

13 Jan '14

I'm building a framework which needs to allow communication between shared libraries which are loaded at runtime. Each shared library provides its own implementation of an abstract interface contained in the framework (called Module), and all Modules are called sequentially multiple times doing the work they need to do. Since modules need to communicate with each other with custom data types, I though of using an std::unordered_map<std::string,boost::any> kept by the framework and shared with the Modules. The map is filled and read by the modules when their code is called through the Module interface which the framework knows (virtual functions). However after a bug I realized that each boost::any value is allocated by the modules, which is logical, since the framework itself has no knowledge of the types that will be stored in the map, and thus the code to allocate them must reside in the libraries themselves. I was wondering whether this could be a problem both during overwriting of a map value (since boost::any has to destroy its old contents) and during program shutdown. This could maybe be because modules use their own allocators. The problem that I had, for example, resulted in a segfault if I tried to unload the modules from memory before the destruction of the map (which is owned by the framework), during boost::any destruction. I assume this happened because the contents of boost::any were created in memory that was then unloaded during the unloading of the shared libraries, resulting in the segfault. And this yet does not take into account custom allocators! So I'm wondering what the best approach here would be. If I would need to keep track of the current "owner" of each single boost::any value allocated, and use it to manually destroy instances when required, or if there is a better way, maybe using some particular boost::any property. Many thanks in advance!

3 3

[Test] using output_test_stream to compare in the middle of a file
by Lloyd 13 Jan '14

13 Jan '14

Hi, We need to test a function which reads a "record" from a binary file. We want to compare the buffer with the "record" in input file.We know the offset of the record in input file. How can we compare the output_test_stream with a certain offset (and length) of the file? or is there any alternative for this? Thanks, Lloyd

2 1

Boost.Test segfault clang++3.3 macports cmake
by Dave Gomboc 13 Jan '14

13 Jan '14

I am getting a segmentation fault when attempting to use Boost.Test. I suspect that I don't have something set up correctly -- your assistance in remedying this would be appreciated. I am using clang++-mp-3.3 as installed by MacPorts on OS X 10.8.4. Here's the crash, which occurs after Boost.Test reports "*** No errors detected". Program received signal EXC_BAD_ACCESS, Could not access memory. Reason: 13 at address: 0x0000000000000000 0x000000010006f6d6 in boost::unit_test::test_unit::~test_unit () (gdb) bt #0 0x000000010006f6d6 in boost::unit_test::test_unit::~test_unit () #1 0x000000010003bb5f in boost::unit_test::master_test_suite_t::~master_test_suite_t () #2 0x000000010003bcdd in boost::unit_test::framework_impl::~framework_impl () #3 0x00007fff8f465307 in __cxa_finalize () #4 0x00007fff8f466f57 in exit () #5 0x00007fff96ddc7e8 in start () (gdb) Here's a somewhat simplified version of what I have: ==== UseBoostUnitTestFramework.hpp ==== #pragma clang diagnostic push #pragma clang diagnostic ignored "-Wall" #pragma clang diagnostic ignored "-Wdisabled-macro-expansion" #pragma clang diagnostic ignored "-Wexit-time-destructors" #pragma clang diagnostic ignored "-Wextra-semi" #pragma clang diagnostic ignored "-Wglobal-constructors" #pragma clang diagnostic ignored "-Wmissing-prototypes" #pragma clang diagnostic ignored "-Wsign-conversion" #pragma clang diagnostic ignored "-Wundef" #pragma clang diagnostic ignored "-Wweak-vtables" #include <boost/test/unit_test.hpp> #pragma clang diagnostic pop ==== HaveBoostUnitTestFrameworkDefineMain.cpp ==== #define BOOST_TEST_MODULE All_Tests #include "UseBoostUnitTestFramework.hpp" /* commenting out the next 3 lines makes no difference */ namespace boost { namespace unit_test { namespace framework { master_test_suite_t & master_test_suite(); } } } // namespace boost::unit_test::framework ==== CMakeLists.txt ==== cmake_minimum_required(VERSION 2.8.10 FATAL_ERROR) cmake_policy(VERSION 2.8.10) project (Foo) add_definitions(-DBOOST_TEST_DYN_LINK) add_library (foo SHARED Foo1.hpp more files... UseBoostUnitTestFramework.hpp Foo1.cpp more files... ) find_package(Boost COMPONENTS unit_test_framework REQUIRED) include_directories(${Boost_INCLUDE_DIRS}) file(GLOB_RECURSE test_source_files *.unit_tests.cpp) link_directories(${Boost_LIBRARY_DIRS}) add_executable(all_tests HaveBoostUnitTestFrameworkDefineMain.cpp ${test_source_files}) target_link_libraries(all_tests foo ${Boost_UNIT_TEST_FRAMEWORK_LIBRARY} ) set(CTEST_OUTPUT_ON_FAILURE TRUE) enable_testing() add_test(all_tests all_tests) set(CMAKE_C_COMPILER "clang-mp-3.3") set(CMAKE_C_FLAGS "-Weverything --std=c11 -O3 -DNDEBUG") set(CMAKE_CXX_COMPILER "clang++-mp-3.3") set(CMAKE_CXX_FLAGS "-ferror-limit=1 --std=c++1y -stdlib=libc++ -Weverything -Wno-c++98-compat -Wno-c++98-compat-pedantic -Wno-padded -O3 -DNDEBUG") ==== Foo1.hpp ==== (has declarations, but nothing that depends on Boost at all -- nor does any other non-test file) ==== Foo1.cpp ==== (has definitions, but nothing that depends on Boost at all -- nor does any other non-test file) ====Foo1.unit_tests.cpp ==== #include "Foo1.hpp" #include <string> #pragma clang diagnostic push #pragma clang diagnostic ignored "-Wglobal-constructors" #include "UseBoostUnitTestFramework.hpp" BOOST_AUTO_TEST_SUITE(Bar1) BOOST_AUTO_TEST_CASE(foobar1) { BOOST_CHECK_EQUAL(std:string("a"), std::string("a")); } BOOST_AUTO_TEST_CASE(foobar2) { BOOST_CHECK_EQUAL(true, true); } BOOST_AUTO_TEST_SUITE_END() BOOST_AUTO_TEST_SUITE(Bar2) BOOST_AUTO_TEST_CASE(barfoo1) { BOOST_CHECK_EQUAL(1, 1); } BOOST_AUTO_TEST_CASE(barfoo2) { BOOST_CHECK_EQUAL(0, 0); } BOOST_AUTO_TEST_SUITE_END() #pragma clang diagnostic pop

3 2

[predef] [rfc] Mutually exclusive definitions?
by Rene Rivera 13 Jan '14

13 Jan '14

After going back and re-reading various commentaries for the review of Boost.Predef and some after the review I'm questioning a design choice of Boost.Predef. Currently Boost.Predef will define multiple symbols when, for example, a compiler "emulates" another compiler. The current common occurrence of this is the GCC compiler which many other compilers emulate by defining the GCC version macros. This is no longer the case for the OS definitions though. The OS definitions are mutually exclusive. And hence in order to make for a more consistent behavior I am considering changing the library to make not just OS defs mutually exclusive. But also making compiler, library, and architecture mutually exclusive. And I'm asking for some general feedback as to what the most useful approach, from using Boost.Predef, is likely to be. In particular I'm considering the following choices: 1. Simple mutual exclusion of BOOST_ARCH_*, BOOST_COMP_*, BOOST_LIB_C_*, BOOST_LIB_STD_*, and of course BOOST_OS_* definitions. 2. Mutual exclusion of the base/real definitions with the addition of *_EMULATED definitions when multiple defs detected. For example for GCC we would have BOOST_COMP_GCC_EMULATED indicated the version of the GCC being emulated. 3. No mutual exclusion of base definitions but with the addition of a "flag" definition when multiple defs are detected. For example with GCC it would have the usual BOOST_COMP_GCC but also have a "#define BOOST_COMP_GCC_IS_EMULATED". 4. Do nothing and live with multiple definitions and the current discrepancy in behavior for BOOST_OS definitions. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

1 0

[test] floating point comparison
by Matthijs Möhlmann 13 Jan '14

13 Jan '14

Hello all, I've the following test program: #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MAIN #define BOOST_TEST_MODULE Master test suite #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_CASE(TestCase) { BOOST_REQUIRE_CLOSE_FRACTION(45.00f, 45.17f, 0.004f); } When I compile it with the following line: g++ -o main.o -c -Werror -Wall -std=c++11 -fvisibility=hidden -fvisibility-inlines-hidden -DBOOST_SPIRIT_USE_PHOENIX_V3 -DUTEST -g main.cpp g++ -o main main.o -lboost_unit_test_framework I get the following output: Running 1 test case... *** No errors detected If I lower the tolerance to 0.0004f then I'll get the following: Running 1 test case... main.cpp(8): fatal error in "TestCase": difference{0.00376352} between 45.00f{45} and 45.17f{45.1699982} exceeds 0.00039999999 *** 1 failure detected in test suite "Master test suite" Why does it say that the difference is 0.00376352 and not 0.17....... ? Regards, Matthijs Möhlmann

4 4

BOOST.TEST Mixing automatic and manual test registratioI
by Manuel Maier 13 Jan '14

13 Jan '14

Hi, Is it possible to mix manual and automatic test registration in Boost,.Test. Example: BOOST_AUTO_TEST_SUITE( ExampleTestSuite ) BOOST_AUTO_TEST_CASE( testcase1 ) { BOOST_TEST_MESSAGE("Test 1 in Example Test Suite"); BOOST_WARN_EQUAL(1, 1); BOOST_REQUIRE_MESSAGE(5 > 1, "Here is an example message. Something may be wrong"); } BOOST_AUTO_TEST_SUITE_END() Now I want to manually add a testcase to this testsuite. This seems to be important for me, as there is no automatic registration version for BOOST_PARAM_TEST_CASE(...) I also made a manualTestRegstration: test_suite* TestSuiteA = BOOST_TEST_SUITE("test_suiteA"); void manualTestCaseRegistration() { TestSuiteA->add( &test_case ); framework::master_test_suite().add( TestSuiteA ); } Is it possible to add a manual testcase(e.g.: test_case_b) to the ExampleTestSuite? Searching the internet I stumbled over following thread: https://svn.boost.org/trac/boost/ticket/7000 But it seems to me this patch never made it to release(at least until now). In fact( I guess) this could/would be exactly the feature I am looking for. Kind Regards and thanks for help Manuel _____________________________________________ Manuel Maier, B. Eng. Business Unit "Motion" / Research & Development Bernecker + Rainer Industrie-Elektronik Ges.m.b.H. B&R Strasse 1 5142 Eggelsberg Austria Tel: +43 7748 6586 Fax: +43 7748 6586 - 24 Email: manuel.maier(a)br-automation.com http://www.br-automation.com ____________________________________________________________ Firmenbuchnummer: Landesgericht Ried im Innkreis / FN 111651 v

3 3

[boost.test] How to register custom exception for auto test?
by Jörg Becker 13 Jan '14

13 Jan '14

Hi, I'm using the test library of boost 1.49.0 for my unit tests. It works fine so fare, but if my program throws an error, I get the default error message unknown location(0): fatal error in "excption1_test": unknown type, witch hides the original error message. I tried to register an error translator, but without success. Here is what I tried (modified test/test/custom_exception_test.cpp to use auto test with global fixture): #define BOOST_TEST_MODULE "boost test custom_exception_test" #include <boost/test/unit_test.hpp> #include <boost/test/unit_test_monitor.hpp> using namespace boost::unit_test; BOOST_AUTO_TEST_SUITE( custom_exception_testsuite ) struct my_exception1 { explicit my_exception1( int res_code ) : m_res_code( res_code ) {} int m_res_code; }; void throw_my_exception1() { throw my_exception1( 12 ); } void my_exception1_translator( my_exception1 ) { BOOST_TEST_MESSAGE( "Caught my_exception1" ); } class my_config { public: my_config () { unit_test_monitor.register_exception_translator<my_exception1>( &my_exception1_translator ); } }; BOOST_GLOBAL_FIXTURE( my_config ) BOOST_AUTO_TEST_CASE( excption1_test ) { throw_my_exception1(); } BOOST_AUTO_TEST_SUITE_END() Can anybody tell me what I'm missing? Thanks, Jörg

3 5

[BOOST]BOOST_AUTO_TEST_CASE_TEMPLATE vs BOOST_AUTO_TEST_CASE
by Hemanth Choudary M V (RBEI/ETA1) 13 Jan '14

13 Jan '14

Hi, Scenario1: Both files are present in the same Project BoostUnitTest. fileA: typedef boost::mpl::list<long long,unsigned char> test_types; BOOST_AUTO_TEST_SUITE(MySuite) BOOST_AUTO_TEST_CASE_TEMPLATE( my_test, T, test_types ) { BOOST_CHECK_EQUAL( sizeof(T), (unsigned)4 ); } BOOST_AUTO_TEST_SUITE_END() fileB: typedef boost::mpl::list<long long,unsigned char> test_types; BOOST_AUTO_TEST_SUITE(MySuite) BOOST_AUTO_TEST_CASE_TEMPLATE( my_test, T, test_types ) { BOOST_CHECK_EQUAL( sizeof(T), (unsigned)4 ); } BOOST_AUTO_TEST_SUITE_END() As shown above, MySuite is extended across 2 files fileA and fileB. The BOOST_AUTO_TEST_CASE_TEMPLATE name is same across the both the files and and the suite name is also same across both the files.. Boost is able to differentiate between the 2 test cases and the test cases are executed. Scenario2: fileA: BOOST_AUTO_TEST_SUITE(MySuite) BOOST_AUTO_TEST_CASE( my_test) { BOOST_CHECK_EQUAL(1,1); } BOOST_AUTO_TEST_SUITE_END() fileB: BOOST_AUTO_TEST_SUITE(MySuite) BOOST_AUTO_TEST_CASE_TEMPLATE( my_test ) { BOOST_CHECK_EQUAL( 1,1 ); } BOOST_AUTO_TEST_SUITE_END() In the scenario2, I get a compile time error (Error 1 error LNK2005: "public: void __thiscall mySuite::insuite2::test_method(void)" (?test_method@insuite2@mySuite@@QAEXXZ) already defined in BoostUnitTest.obj) which basically suggests that one or more multiply defined symbols are found. Why is the behaviour different in these 2 scenarios? How is Boost able to differenciate between the 2 test cases in Scenario1? Mit freundlichen Grüßen / Best Regards, Hemanth Choudary MV RBEI/ETA1

3 2

[Boost.Test] Detail lost when using BOOST_*_NO_THROW
by Adam Nielsen 13 Jan '14

13 Jan '14

Hi again, While developing tests I sometimes find that functions that should not throw exceptions do. Because this is an unexpected situation, I would like to know what exception has been thrown so I know what problem to look for in my test design. Unfortunately the Boost.Test framework only provides a terse message like this: test.cpp(123): fatal error in "fnTest": exception thrown by test(); It doesn't tell you which exception was thrown, nor the reason why. Is there some way to tell Boost.Test to include the exception message (from what()) if the exception derives from std::exception? This would make problem solving much quicker as you would not have to run the tests through a debugger to see which exception is being thrown and why. There is some discussion about this on Stack Overflow[1] but the consensus seems to be the best solution is not to use BOOST_*_NO_THROW. If you don't use these and an exception is thrown, a lot more detail is provided. Assuming this is a limitation in Boost.Test, would it be possible to add this as a feature so that future versions include the same level of detail whether you use BOOST_*_NO_THROW or not? Many thanks, Adam. [1] http://stackoverflow.com/questions/15133259/boost-check-no-throw-how-to-get…

3 2

--run_test and using this to run a subset of Testcases.
by Manuel Maier 13 Jan '14

13 Jan '14

Hi I am looking for help considering running sets of Testcases/Testsuites. First off, is there a possibility to do a negative selection. i.e. tell boost.test to NOT run certain Testcases/testsuites? Further is it possible to run sets of Testcases(which may reside in different testsuites)? Assume following test tree: MASTER suite1 case1 case2 suite2 testcase1 testcase2 suite3 subsuite testcase1 Now lets say I wanna run testcase case1, testcase2 and the subsuite testsuite. Is this even possible? Kind Regards and thanks a lot for help Manuel Maier _____________________________________________ Manuel Maier, B. Eng. Business Unit "Motion" / Research & Development Bernecker + Rainer Industrie-Elektronik Ges.m.b.H. B&R Strasse 1 5142 Eggelsberg Austria Tel: +43 7748 6586 Fax: +43 7748 6586 - 24 Email: manuel.maier(a)br-automation.com http://www.br-automation.com ____________________________________________________________ Firmenbuchnummer: Landesgericht Ried im Innkreis / FN 111651 v

5 6

[Boost.Test] Unable to perform init at startup
by Adam Nielsen 12 Jan '14

12 Jan '14

(Apologies for the last message, I am using an unfamiliar keyboard and accidentally pressed the 'send' keyboard combination.) Hi all, I'm having a bit of a problem trying to figure out how to perform some class init while manually registering my tests. I want to run a set of tests which all share the same class instance (this is a factory class that creates the objects to be tested.) I am creating a number of global class instances and using boost::bind in the constructor to register the tests with Boost.Test. This works fine, except that I need to create the factory class before the tests can be run. In case the factory class fails, I want to use some of the Boost.Test checks in the initialisation function. However when I do this, I get this runtime error: terminate called after throwing an instance of 'std::runtime_error' what(): can't use testing tools before framework is initialized I am assuming this means I need to wait with the construction of my factory class until Boost.Test is ready, but I am unsure how to do this. I am #defining BOOST_TEST_MODULE, and when I try to declare a function called init_unit_test() as suggested in the docs it tells me the function already exists. If I remove the BOOST_TEST_MODULE #define, then it complains that main() is not implemented. I am a bit confused because I do not understand the reason for having init_unit_test() if you cannot implement it. If you choose not to use the Boost auto function then it seems you must implement your own main(), so I would expect your init code would go there, so there is no need for the init_unit_test() function? Is there some other way not mentioned in the docs to manually register tests (which are class member functions) but where the class can call Boost.Test functions in its constructor? Many thanks, Adam.

2 2

Using boost asio with client certificate "sslv3 handshake failure"
by Jeff Perkins 12 Jan '14

12 Jan '14

We are trying to connect to our server using boost asio and getting the error "handshake: sslv3 alert handshake failure". We have tried changing the ssl type, setting verify peer to none and a few other things with no success. The pem file we are using originated as a p12 file that we used openssl to output to a pem file for use in this project. Within the pem file there is both an encrypted private key and certificate. I have searched stackoverflow of a solution but the only similar thing that came up was openssl not being installed correctly which doesn't appear to be the problem in this case. Is there something I'm missing in my call back as I'm not passing a purpose or length, although I cannot find appropriate values to pass as purpose in the boost docs. - std::size_t max_length, // The maximum size for a password. - password_purpose purpose // Whether password is for reading or writing. using boost::asio::ip::tcp; boost::system::error_code ec; boost::asio::io_service io_service; boost::asio::ssl::context ctx(io_service, boost::asio::ssl::context::sslv23); ctx.set_password_callback(my_password_callback); ctx.use_private_key_file("/key1.pem",boost::asio::ssl::context_base::pem, ec); namespace ssl = boost::asio::ssl; typedef ssl::stream ssl_socket; ssl_socket sockconn(io_service, ctx); tcp::resolver resolver(io_service); tcp::resolver::query query(" tech.loopfish.com", "https"); boost::asio::connect(sockconn.lowest_layer(), resolver.resolve(query)); sockconn.lowest_layer().set_option(tcp::no_delay(true)); sockconn.set_verify_mode(boost::asio::ssl::verify_peer); sockconn.set_verify_callback(ssl::rfc2818_verification("tech.loopfish.com ")); sockconn.handshake(ssl_socket::client);

1 0

[Boost.Graph] How to build a directed graph
by Lucas Soltic 10 Jan '14

10 Jan '14

Hello, I’m trying to build a DAG thanks to BGL, the source code builds fine but crashes at runtime. And I’m a bit lost on the reason. I don’t even know if my typedefs are correct according to my purpose: simply building a DAG whose nodes are « Classes » with arcs that point to « parents ». I’ve written the following: #include <list> #include <boost/graph/directed_graph.hpp> class MyClass {}; typedef MyClass* Vertex; typedef std::pair<Vertex, Vertex> Edge; typedef boost::directed_graph<Vertex, Edge> ClassInheritanceGraph; static ClassInheritanceGraph g_parentClassGraph; void buildGraph(void) { std::list<Edge> edges; edges.push_back(std::make_pair(new MyClass, new MyClass)); edges.push_back(std::make_pair(new MyClass, new MyClass)); std::list<Edge>::iterator edgesIt; for (edgesIt = edges.begin(); edgesIt != edges.end(); edgesIt++) { Vertex child = edgesIt->first; Vertex parent = edgesIt->second; boost::add_edge(child, parent, g_parentClassGraph); } } int main() { buildGraph(); return 0; } The program crashes on boost::add_edge() with a segfault. The point is I don’t know if I’m correctly using BGL. I don’t really know what is the proper way (I don’t understand everything from the BGL documentation…). I tried to debug the program but with all those template arguments I don’t understand the error (http://pastebin.com/BRgz3uL7 in case you want to make nightmares :) ). Thus in case someone understands what’s wrong here I would be really grateful for some help! Thanks, Lucas

1 0

[iterator] error while accessing member of result of brackets-operator
by Sebastian Pfützner 10 Jan '14

10 Jan '14

Hello, the following code does not compile with the last line in main(). The error message is main.cpp: In function 'int main()': main.cpp:37:8: error: 'boost::detail::operator_brackets_result<It, S, S&>::type' has no member named 'i' it[3].i = 0; ^ What could be the problem? #include <boost/iterator/iterator_facade.hpp> struct S { int i; float f; }; class It : public boost::iterator_facade<It, S, boost::random_access_traversal_tag> { private: friend class boost::iterator_core_access; static S s; reference dereference() const { return s; } bool equal(It const&) const { return true; } void increment() {} void decrement() {} void advance(difference_type n) {} difference_type distance_to(It const&) const { return 0; } }; int main() { It it; (*(it + 3)).i = 0; S& s = it[3]; s.i = 0; it[3].i = 0; } -- Sebastian Pfützner s.pfuetzner(a)onlinehome.de ICQ-ID: 39965036

2 3

boost process : how to use it
by Vincent R. 09 Jan '14

09 Jan '14

Hi, What is the status of boost:process, when looking on internet you can find different version that are more or less compatible. Not an ideal situation and I am a bit surprised that this lib doesn't get more love from c++ dev. Anyway after a long time coding in easier language I decided to do a small project under linux that consists in a tcp server running on linux that start some process initiated by a client and sends the output. So I have downaloaded the most "official" version I could find here http://www.highscore.de/boost/process/ and I tried the following code : #include <cassert> #include <iostream> #include <map> #include <string> #include <sstream> #include <vector> #include <boost/asio.hpp> #include <boost/enable_shared_from_this.hpp> #include <boost/process.hpp> namespace asio = boost::asio; namespace bp = boost::process; using asio::ip::tcp; bp::child start_child() { std::string exec = boost::process::find_executable_in_path("dpkg"); std::vector<std::string> args; args.push_back("-l"); bp::context ctx; ctx.stderr_behavior = bp::capture_stream(); return bp::launch(exec, args, ctx); } int main(int argc, char *argv[]) { std::string value; bp::child c = start_child(); bp::pistream &is = c.get_stderr(); std::string line; while (std::getline(is, line)) { value += line + "\r\n"; } c.wait(); std::cout << "OUTPUT: " << value << std::endl; return 0; } My first question is how can I merge the stderr with stdout because some commands use stdout and some others stderr ? My second question is : why the code above doesn't work properly and doesn't handle the arguments I am passing ? Indeed when I run the code I get the following output : OUTPUT: dpkg: error: need an action option it means that the -l is not taken in consideration. Thanks for any help

6 8

Re: [Boost-users] How to create distributed_property_map (??????? ?????)
by Николай Кинаш 09 Jan '14

09 Jan '14

So, now i have: struct centrality_t { typedef vertex_property_tag kind; }; typedef property<centrality_t, double> VertexCentrality; typedef boost::adjacency_list<listS, distributedS<mpi_process_group,vecS>, undirectedS, VertexCentrality> Graph; typedef boost::unique_rmat_iterator<boost::minstd_rand, Graph> RMATGen; struct no_self_loops { no_self_loops() {} bool operator()(const std::pair<int,int>& e) { return e.first != e.second; } }; template <typename G> struct VertexKey { typedef int value_type; typedef typename graph_traits<G>::vertex_descriptor key_type; typedef read_write_property_map_tag category; typedef int* reference; }; int main(int argc, char* argv[]) { boost::mpi::environment env(argc, argv); boost::minstd_rand gen; unsigned int SCALE = atoi(argv[1]); unsigned int EDGE_FACTOR = atoi(argv[2]); unsigned int N = pow(2, SCALE); unsigned int E = EDGE_FACTOR * N; Graph g( boost::make_filter_iterator<no_self_loops> ( RMATGen(gen, N, E, 0.45, 0.15, 0.15, 0.25), RMATGen()), boost::make_filter_iterator<no_self_loops>(RMATGen(), RMATGen()), N); typedef boost::property_map<Graph, centrality_t>::type LocalMap; typedef boost::parallel::distributed_property_map<mpi_process_group, LocalMap, VertexKey<Graph> > CentralityMap; LocalMap local_map = get(centrality_t(), g); mpi_process_group process_groupe; //VertexKey<Graph> vertex_key; CentralityMap centrality_map(process_groupe, local_map); //brandes_betweenness_centrality(g, centrality_map); } network.cpp: In function ‘int main(int, char**)’: network.cpp:78: error: no matching function for call to ... /opt/boost_1_54_0_icc/boost/property_map/parallel/ distributed_property_map.hpp:329: note: candidates are: boost::parallel::distributed_property_map<ProcessGroup, GlobalMap, StorageMap>::distributed_property_map(const ProcessGroup&, const GlobalMap&, const StorageMap&) Is this right arguments centrality_map(process_groupe, local_map) ? Or it must be: VertexKey<Graph> vertex_key; CentralityMap centrality_map = boost::parallel::make_distributed_property_map(process_groupe, local_map, vertex_key); In this case: network.cpp:78: instantiated from here /opt/boost_1_54_0_icc/boost/property_map/parallel/impl/distributed_property_map.ipp:140: error: request for member ‘first’ in ‘p’, which is of non-class type ‘double’ /opt/boost_1_54_0_icc/boost/property_map/parallel/impl/distributed_property_map.ipp:142: error: request for member ‘second’ in ‘p’, which is of non-class type ‘double’ /opt/boost_1_54_0_icc/boost/property_map/parallel/impl/distributed_property_map.ipp:142: error: request for member ‘second’ in ‘p’, which is of non-class type ‘double’ Any suggestions? Thanks.

2 1

[boost-users][asio] Can't read socket
by Miklós Tóth 08 Jan '14

08 Jan '14

Hi Community, I've a problem with named-pipe communication. Please help me investigate this. I'm totally clueless now. I have a Connector class. I want to read some data from a socket. This is it: class Connector { public: Connector(boost::asio::io_service& io_service) : _io_service(io_service), _socket(io_service) { _endpoint.address(boost::asio::ip::address::from_string("127.0.0.1")); _endpoint.port(4242); _socket.async_connect(_endpoint, boost::bind(&Connector::handle_accept, this, boost::asio::placeholders::error)); } void close() { _io_service.post(boost::bind(&Connector::do_close, this)); _io_service.stop(); } private: void handle_accept(const boost::system::error_code& error) { if (error) { throw ConnectorError(_T("Cannot estabilish connection.")); } boost::asio::async_read(_socket, boost::asio::buffer(_readbuffer, 1024), boost::bind(&Connector::handle_read, this, boost::asio::placeholders::error)); } void handle_read(const boost::system::error_code& error) { if (!error) { if (_readbuffer.empty()) { boost::this_thread::sleep(boost::posix_time::milliseconds(100)); } else { std::string string_buffer; std::copy(_readbuffer.begin(), _readbuffer.end(), std::back_insert_iterator<std::string>(string_buffer)); std::cout << string_buffer << std::endl; _readbuffer.clear(); } boost::asio::async_read(_socket, boost::asio::buffer(_readbuffer, 1024), boost::bind(&Connector::handle_read, this, boost::asio::placeholders::error)); } } void do_close() { _socket.close(); } boost::asio::io_service& _io_service; boost::asio::ip::tcp::socket _socket; boost::asio::ip::tcp::endpoint _endpoint; std::vector<char> _readbuffer; }; This is how I use it: boost::asio::io_service io_service; Connector connector(io_service); boost::thread async_io_thread(boost::bind(&boost::asio::io_service::run, &io_service)); while (1) { //... stuff } connector.close(); async_io_thread.join(); But whenever I send a data package, this class is unable to read it from the socket. The readbuffer is always empty. I have a python code to test the sending application. import sys import socket s = socket.socket() address = '127.0.0.1' port = 4242 try: s.connect((address, port)) except Exception, e: sys.stdout.write('conn err %s:%d. exception: %s' % (address, port, `e`)) try: data = s.recv(1024) print data while True: more = s.recv(1024) print more if not more: break except Exception, e: sys.stdout.write('read err %s:%d. exception: is %s' % (address, port, `e`)) It works perfectly. As far as I know these the two code snippet should work the same. Clearly I'm missing something. Regards, Miklos

2 2

GSoc 2k14
by Aman Jain 07 Jan '14

07 Jan '14

Hey, I wanna to do Gsoc this year by contributing to some C++ libraries and I am beginner. Actually, I want to contribute by modifying libraries I have once made some part of String library by myself using OOPS I have talked at IRC channel and according to my interest someone suggested me to contribute to https://github.com/boostorg/algorithm Can some one help me out how should I continue ? How to use git-hub here for contribution and bug fixing ? Regards, Aman

1 0

[ANN] Registration for C++Now 2014 is Open
by Boris Kolpackov 07 Jan '14

07 Jan '14

Hi, Registration is now open for the eighth annual C++Now conference (formerly BoostCon) which will be held in Aspen, Colorado, USA, May 12th to 17th, 2014. C++Now is a general C++ conference for C++ experts and enthusiasts. It is not specific to any library/framework or compiler vendor and has three tracks with presentations ranging from hands-on, practical tutorials to advanced C++ design and development techniques. In particular, one of the tracks is dedicated exclusively to tutorials. Last year the conference sold out pretty quickly and we expect it to happen again this year. As a result, we encourage anyone interested in attending to register early. Additionally, early bird hotel reservations end January 10th. For more information on registering, visit: http://cppnow.org/2014/01/2014-registration-is-open/ For early bird hotel reservations, visit: http://cppnow.org/location/lodging/ For general information about the conference, visit: http://cppnow.org/about/ Boris

1 0

[Boost Graph Library] read_graphviz example
by Robert Johannes Langenberg 07 Jan '14

07 Jan '14

Hello, I've recently started using the boost graph library to read a graph in dot format generated with pygraphviz and run some analysis on it. I get the basic example http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/read_graphviz.html#exam… to compile, but it then segfaults when reading the file because it can't find the property "colors" (stack trace below). Now I understand that I didn't define this property but I also have no idea how to do it. Debugging it, i find the name="colors", key=0 and value="red" for the function call below: #11 0x000000010001b40c in boost::put<unsigned long, std::string> (name=@0x100205880, dp=@0x7fff5fbff5f8, key=@0x100204d78, value=@0x100205888) at dynamic_property_map.hpp:292 292 boost::shared_ptr<dynamic_property_map> new_map = dp.generate(name, key, value); For a general understanding of what's happening: What is "key" good for? In the example, where is the variable vertex_color declared? What is this "mass" property and why does it contain vertex_color? What is the type vertex_color_t? The documentation didn't help me, maybe there are easier starting points or i've just looked in the wrong parts of http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/table_of_contents.html If someone could point me to a proper example/tutorial/documentation it'd be greatly appreciated. Best regards, Robert Langenberg Stacktrace: Program received signal SIGABRT, Aborted. 0x00007fff971e8d46 in __kill () (gdb) where #0 0x00007fff971e8d46 in __kill () #1 0x00007fff8fa28f83 in abort () #2 0x00007fff8f35c9eb in abort_message () #3 0x00007fff8f35a39a in default_terminate () #4 0x00007fff8df32887 in _objc_terminate () #5 0x00007fff8f35a3c9 in safe_handler_caller () #6 0x00007fff8f35a424 in std::terminate () #7 0x00007fff8f35b58b in __cxa_throw () #8 0x0000000100016eae in boost::throw_exception<boost::exception_detail::error_info_injector<boost::property_not_found> > (e=@0x7fff5fbfedb8) at throw_exception.hpp:70 #9 0x0000000100016ff0 in boost::exception_detail::throw_exception_<boost::property_not_found> (x=@0x7fff5fbfee90, current_function=0x100061188 "boost::shared_ptr<boost::dynamic_property_map> boost::dynamic_properties::generate(const std::string&, const Key&, const Value&) [with Key = long unsigned int, Value = std::basic_string<char, std::cha"..., file=0x100061008 "/Users/rlangenb/workspace/boost_1_55_0/boost/property_map/dynamic_property_map.hpp", line=268) at throw_exception.hpp:87 #10 0x000000010001ae6e in boost::dynamic_properties::generate<unsigned long, std::string> (this=0x7fff5fbff5f8, name=@0x100205880, key=@0x100204d78, value=@0x100205888) at dynamic_property_map.hpp:268 #11 0x000000010001b40c in boost::put<unsigned long, std::string> (name=@0x100205880, dp=@0x7fff5fbff5f8, key=@0x100204d78, value=@0x100205888) at dynamic_property_map.hpp:292 #12 0x000000010000bf4a in boost::detail::graph::mutate_graph_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_name_t, std::string, boost::property<boost::vertex_color_t, float, boost::no_property> >, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::property<boost::graph_name_t, std::string, boost::no_property>, boost::listS> >::set_node_property (this=0x7fff5fbff340, key=@0x100205880, node=@0x1002063d0, value=@0x100205888) at graphviz.hpp:775 #13 0x000000010001f006 in boost::read_graphviz_detail::translate_results_to_graph (r=@0x7fff5fbff140, mg=0x7fff5fbff340) at read_graphviz_new.cpp:770

1 0

Re: [Boost-users] [graph][BGL][PBGL] Use of dynamic_properties in parallel
by bminano 07 Jan '14

07 Jan '14

I have found the problem. It seems a cast problem in the dynamic_properties class. I have proposed a patch in the Ticket #9549. I am sorry, I am new to proposing patches so maybe that was not the correct way. -- View this message in context: http://boost.2283326.n4.nabble.com/graph-BGL-PBGL-Use-of-dynamic-properties… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

How to create distributed_property_map
by Николай Кинаш 05 Jan '14

05 Jan '14

Hello. I try to calculate brandes_betweenness_centrality. #include <boost/graph/use_mpi.hpp> #include <boost/mpi/environment.hpp> #include <boost/mpi/communicator.hpp> #include <boost/graph/distributed/mpi_process_group.hpp> #include <boost/graph/parallel/process_group.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/distributed/adjacency_list.hpp> #include <boost/graph/small_world_generator.hpp> #include <boost/random/linear_congruential.hpp> #include <boost/graph/distributed/betweenness_centrality.hpp> #include <boost/graph/distributed/graphviz.hpp> #include <boost/graph/rmat_graph_generator.hpp> #include <boost/random/linear_congruential.hpp> #include <iostream> #include <algorithm> #include <math.h> using namespace boost; using namespace graph; using namespace distributed; namespace mpi = boost::mpi; typedef boost::adjacency_list<listS, distributedS<mpi_process_group,vecS>, undirectedS> Graph; typedef boost::unique_rmat_iterator<boost::minstd_rand, Graph> RMATGen; struct no_self_loops { no_self_loops() {} bool operator()(const std::pair<int,int>& e) { return e.first != e.second; } }; int main(int argc, char* argv[]) { boost::mpi::environment env(argc, argv); boost::minstd_rand gen; unsigned int SCALE = atoi(argv[1]); unsigned int EDGE_FACTOR = atoi(argv[2]); unsigned int N = pow(2, SCALE); unsigned int E = EDGE_FACTOR * N; Graph g( boost::make_filter_iterator<no_self_loops> ( RMATGen(gen, N, E, 0.45, 0.15, 0.15, 0.25), RMATGen()), boost::make_filter_iterator<no_self_loops>(RMATGen(), RMATGen()), N); typedef boost::property_map<Graph, vertex_index_t>::type LocalMap; boost::parallel::distributed_property_map<mpi_process_group, LocalMap, ||||||> centrality_map; //brandes_betweenness_centrality(g, centrality_map); } What should be here "|||||" ? I see http://www.boost.org/doc/libs/1_55_0/libs/graph_parallel/doc/html/distribut… template<typename ProcessGroup, typename LocalPropertyMap, typename Key, typename GhostCellS = gc_mapS> Key: The key_type of the distributed property map, which must model the Global Descriptor concept But don`t understand, is not work - typedef property_traits<LocalMap>::key_type key_type; Can you provide example?

1 0

Is there a 1 line wonder for counting iterator and back_inserter - say a counting iterator where the start and step can be specified?
by Brian Davis 05 Jan '14

05 Jan '14

Is there a 1 line wonder for counting iterator and back_inserter - say a counting iterator where the start and step can be specified? The following code creates an vector of angles from zero to N-1 * angle step; std::vector angles; float angle_step = 0.275; int number_angles = 293; std::copy( boost::counting_iterator<float>(0), boost::counting_iterator<float>(number_angles), std::back_inserter(angles) ); std::copy( boost::make_transform_iterator(angles.begin(), boost::bind1st(std::multiplies<float>(), angle_step )), boost::make_transform_iterator(angles.end(), boost::bind1st(std::multiplies<float>(), angle_step )), angles.begin() ); Is there or could there be a counting iterator or other mechanism to do this in 1 line? Say where the start and step could be specified? Thanks

2 1

Re: [Boost-users] Boost-users Digest, Vol 3673, Issue 1
by Markus Lenger 04 Jan '14

04 Jan '14

Hi Larry! The error must be somewhere else in your code. The following program behaves exactly as expected: #include <boost/regex.hpp> #include <string> #include <iostream> int main() { boost::match_results<std::string::const_iterator> match; boost::match_flag_type flags = boost::match_default; boost::regex re(std::string("^XXX_(\\d{3})_\\d{3}$"), boost::regex::perl | boost::regex::icase); std::string the_text = "XXX_123_456"; bool rc = boost::regex_search(the_text,match,re,flags); if (rc) { std::cout << "Number is " << match[1] << std::endl; return 0; } std::cout << "No match found" << std::endl; return 1; } --------- max@switters:~/tmp$ g++ test_regex.cpp -l boost_regex max@switters:~/tmp$ ./a.out Number is 123 Am 2014-01-03 18:00, schrieb boost-users-request(a)lists.boost.org: > Message: 1 > Date: Thu, 2 Jan 2014 16:40:55 -0500 > From: "Larry" <lknain(a)nc.rr.com> > To: <boost-users(a)lists.boost.org> > Subject: [Boost-users] [Regex] Subexpression matching during search > Message-ID: <D06A753E760144CDA0A00B03E0D0DFEE@XV2W> > Content-Type: text/plain; charset="utf-8" > > I have probably missed something in the doc that answers my query but I just can?t see it. > > This is using Perl syntax. > > I had a regex: > > ^(XXX_\d{3,3})_\d{3,3}$ > > It compiles OK but does not match anything in a regex_search. If I remove the parenthesis > > ^XXX_\d{3,3}_\d{3,3}$ > > I get matches. Any clues as to what I am missing? > > > Extract of regex related code lines: > > reg.regex = new boost::regex(reg.reg,boost::regex::perl | boost::regex::icase); > > boost::match_results<string::const_iterator> match; > boost::match_flag_type flags = boost::match_default; > std::string::const_iterator xstart, xend; > > xrc = boost::regex_search(xstart,xend,match,*((*rgi).regex),flags); > > Larry

2 1

[Regex] Subexpression matching during search
by Larry 03 Jan '14

03 Jan '14

I have probably missed something in the doc that answers my query but I just can’t see it. This is using Perl syntax. I had a regex: ^(XXX_\d{3,3})_\d{3,3}$ It compiles OK but does not match anything in a regex_search. If I remove the parenthesis ^XXX_\d{3,3}_\d{3,3}$ I get matches. Any clues as to what I am missing? Extract of regex related code lines: reg.regex = new boost::regex(reg.reg,boost::regex::perl | boost::regex::icase); boost::match_results<string::const_iterator> match; boost::match_flag_type flags = boost::match_default; std::string::const_iterator xstart, xend; xrc = boost::regex_search(xstart,xend,match,*((*rgi).regex),flags); Larry

2 2

[ASIO] Async TCP/UDP server design help
by Terry Lazoki 02 Jan '14

02 Jan '14

I'm having hard time understanding the boost asio design and how i can use it to tackle my problem. My problem: Designing a tcp/udp server that is time efficient. 1. User sends packet through tcp 2. Server receives packet and processes it to build a large tree (n > 20000) 3. Server then parses the new tree and sends a summary packet through udp to another client Conditions/Limitations: - Has to be time efficient, receiving, processing and sending has to be done as fast as possible. - Processing the packet is heavy and can cause delays if its done in the same thread - Parsing the tree is also a little heavy when sending it through udp, can cause delays too Design 1 (2 threads): Thread 1: ASIO TCP and UDP. TCP receives packets and adds it to a circular buffer. While at the same time, processes the shared tree and sends packet through udp. Thread 2: Server grabs packet from circular buffer and processes it Some problems here: - I dont understand the async part here. What happens when tcp receives a packet, if the current thread is continuously parsing the tree and sending packets through udp. Do i need to separate the udp part to another thread? - I have 3 parts of the program that i need to run concurrently, well its really 2 parts and receiving packets through tcp. Any help is appreciated. Thanks,

3 2

Problems installing old BOOST version
by squid squid 02 Jan '14

02 Jan '14

Greetings Everyone I'm a phd student in chemometrics and drug design. I am fairly new to ubuntu C programing although I'm rather experienced in C programing in windows. I have recently come accross a number of codes written in 2005 which I'm interested in learning how they work. Those codes needs BOOST library to complie, however they won't compile on the newest BOOST version installed on my ubuntu 12.04. I set the gcc compiler on lenient so that it ignores all those error messages. The code did compile and ran afterwards. However, when I used GDB debugger to watch how the program flows I noticed that there are likely errors in the way the program runs probably due to using a different BOOST version rather than it's original. Hence I like to install the BOOST version corresponding to the code I downloaded. To do that, I installed Ubuntu 6.02 and downloaded BOOST 1.33.1 both of which were created in late 2005. I downloaded BOOST from: http://www.boost.org/users/history/ but I didnt found any detailed instruction on how to install it. Only vague description on using BOOST jam, I played around with BOOST jam for quite awhile and got roughly the installation outline as follows: -*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-* Unpack the trazball in /usr/share/ goto the directory /usr/share/boost_1_33_1/tools/build/jam_src run the script ./build.sh the script creats an executable called bjam, copy that file into /usr/share/boost_1_33_1/ run bjam with: ./bjam "-sTOOLS=gcc" install -*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-* My problems starts when running the ./build.sh script, resulting in tons of error messages and no bjam file created. The errors look like: -*-*-*-*-*-*-*-*-*-*-*-*-*-* ... ... search.c:187: error too many arguments to function 'timestamp' In file included from subst.c:2: jam.h:398:24: error: sys/types.h: No such file or directory jam.h:399:23: error: sys/stat.h: No such file or directory ... ...lots more errors.... -*-*-*-*-*-*-*-*-*-*-*-*-* I would greatly appreciate any info on how to deal with this issue. Sincerely

1 0

Mysterious early data termination using filtering_iostreams zlib_compressor
by Kenneth Adam Miller 31 Dec '13

31 Dec '13

I'm using intel's pin tool (pintool.org) and the boost library's filtering_stream in order to compress data before it goes to a file. I already have functioning code that does that, but at the very end of the execution of the target, right before the PIN_AddFiniFunction callback gets executed the stream of bytes in the compressed version ends (I assume this because the decompressed version is generated by subsequently opening another filtering_stream and using a zlib_decompressor and reading the entire compressed file out). I don't know why the stream ends early... This makes getting help kind of hard, because the files that are being produced are hundreds of megabytes, and differ by just a little kb. So even the diff is large, but I think the salient point is that the data included in the compressed/decompressed version is the same aside from the end. To make this easy for anybody helping, I've included a link to my repo where I've created a reproducible mini example, which should be able to be downloaded, built, and run without any hassel on the latest ubuntu: https://github.com/KennethAdamMiller/Boost-PinTool (It's a drop in replacement for debug trace; you just drop the appropriate files into the DebugTrace folder in your PIN_ROOT/source/tools/, then type make. There are very clear instructions! :) ) link to boost's filtering_stream: http://www.boost.org/doc/libs/1_54_0/libs/iostreams/doc/classes/filtering_s… After you build and run the tool, you should see debugtrace.out and decompressed.xml (the xml part I'm too lazy to change even as I type; it's just text). Go to the bottom of each, you can see that debugtrace.out ends with the line containing "eof" properly, but that the decompressed.xml does not... Can anybody tell me what the issue is? I'm quite certain that everything *should* have went into the FilteringStream that went into the ofstream... please help, I have no idea why it's terminating this way...

1 0

Matrix Vector Multiplication in MPI (Coordinate Storage Format)
by ozhan fenerci 30 Dec '13

30 Dec '13

I wrote a serial code for a matrix-vector multiplication in a Coordinate Storage Format(COO). COO method has already made a big speed-up. My matrix is in a tridiagonal form. I want to parallelize the code and see how the parallelizm improves the code. My matrix could grow up to 2.000.000*2.000.000. Any efficient parallelization approach doesn't come to my mind (I have written some basic mpi programs but not much more. So my experience is limited.) Could you give me some headstart? Thanks. Özhan Fenerci #include <boost/numeric/ublas/banded.hpp> #include <boost/numeric/ublas/io.hpp> #include <vector> #include <iostream> #include "mpi.h" #include <stdio.h> int main(int argc, char *argv[] ) { using namespace boost::numeric::ublas; using std::cout; using std::endl; int numprocs, rank, chunk_size, i,j; int max, mymax,rem; int totalNonZeros; //totalNonZeros of TriDiagonal Matrix MPI_Status status; //b=A*x banded_matrix<double> A (10, 10, 1, 1); //vector<double> x(10); //vector<double> b(10); int* x = new int[10]; int* b = new int[10]; /* Initialize MPI */ MPI_Init( &argc,&argv); MPI_Comm_rank( MPI_COMM_WORLD, &rank); MPI_Comm_size( MPI_COMM_WORLD, &numprocs); //MPI_Status status; if (rank == 0) { for (signed i = 0; i < signed (A.size1 ()); ++ i) { for (signed j = std::max (i - 1, 0); j < std::min (i + 2, signed (A.size2 ())); ++j) A (i, j) = i + j; x[i]= 1; } } if(rank == 0) { cout << A <<endl<<endl; totalNonZeros = 0; for (signed i = 0; i < signed (A.size1 ()); ++ i) { for (signed j = std::max (i - 1, 0); j < std::min (i + 2, signed (A.size2 ())); ++ j) if( A(i,j) !=0) totalNonZeros++; } } cout<<"Number ot NonZeros "<<totalNonZeros<<endl; if(rank == 0) { int * row_idx = new int[totalNonZeros]; // row index array int * col_idx = new int[totalNonZeros]; // col index array int * val = new int[totalNonZeros]; //val array int index=0; for (signed i = 0; i < signed (A.size1 ()); ++ i) { for (signed j = std::max (i - 1, 0); j < std::min (i + 2, signed (A.size2 ())); ++ j) if( A(i,j) !=0) { row_idx[index] = i; col_idx[index]=j; val[index] = A(i,j); index++; } } //Clear out result for ( int k=0; k<A.size1(); ++k) { b[k]= 0; } //Matrix-vector Multiply for (int index=0 ; index <totalNonZeros;++index){ b[row_idx[index]] = b[row_idx[index]]+ val[index]*x[col_idx[index]]; cout<<b[3]<<endl; } //delete row_idx; // delete col_idx; //delete val; } MPI_Finalize(); return 0;

2 1

unit and functional testing of boost statechart
by rahul baruah 29 Dec '13

29 Dec '13

Hello All, I like to do unit and functional testing of our implemented statemachine written using boost - statechart. Is there any framework for that?? anyone did any unit testing and suggestion?? Regards Rahul Protim Baruah

2 1

[Boost] Command Line to run a specific Boost Test Case using BOOST_AUTO_TEST_CASE_TEMPLATE
by Hemanth Choudary M V (RBEI/ETA1) 29 Dec '13

29 Dec '13

Hi, I would like to run this boost test case using the command line. Please note that the list contains data types that have 2 or more words. I need to know what to pass in the Command Line for -run_test=__________ #define BOOST_TEST_MODULE example #include <boost/test/included/unit_test.hpp> #include <boost/test/test_case_template.hpp> #include <boost/mpl/list.hpp> //____________________________________________________________________________// typedef boost::mpl::list<long long,unsigned char> test_types; BOOST_AUTO_TEST_CASE_TEMPLATE( my_test, T, test_types ) { BOOST_CHECK_EQUAL( sizeof(T), (unsigned)4 ); } //_ Mit freundlichen Grüßen / Best Regards, Hemanth Choudary MV RBEI/ETA1

3 2

Re: [Boost-users] [serialization] Registering/exporting shared_ptr<T> in a library
by Martin Weinberg 29 Dec '13

29 Dec '13

On 12/28/2013 06:34 PM, Robert Ramey wrote: > > > On Saturday, December 28, 2013 2:15:44 PM UTC-8, Martin Weinberg wrote: > > I have a shared library for derived and base classes. My code passes > instances of derived classes T using boost::shared_ptr<B> to the base > class. This all works as expected. > > I've used the BOOST_CLASS_EXPORT_KEY and BOOST_CLASS_EXPORT_IMPLEMENT > macros to register both the classes Tand shared_ptr<T> typedefs to > all > the classes. > > If I attempt to serialize a base class pointer, > boost::serialization can > not find the serialize member for the shared_ptr to the derived > class. > > > a) double check the documentation boost/serialization/case > studies/shared_ptr<T> revisited > > b) Make sure you'r doing the following > > class A {...}; > class B : public A {...} > ... > A * = new B; // note we create a B and cast the address to an A* !!! > > ... should be no problem from here on out. > > Robert Ramey Thanks. What I'm doing is: shared_ptr<A> t(new B); and then: ar & A; It's ok if I put: BOOST_CLASS_EXPORT(shared_ptr<A>) BOOST_CLASS_EXPORT(shared_ptr<B>) in the caller but not if I put them in the library. Trying to understand if there's a way to put registration in the library rather than the main source.

1 1

[serialization] Registering/exporting shared_ptr<T> in a library
by Martin Weinberg 28 Dec '13

28 Dec '13

I have a shared library for derived and base classes. My code passes instances of derived classes T using boost::shared_ptr<B> to the base class. This all works as expected. I've used the BOOST_CLASS_EXPORT_KEY and BOOST_CLASS_EXPORT_IMPLEMENT macros to register both the classes Tand shared_ptr<T> typedefs to all the classes. If I attempt to serialize a base class pointer, boost::serialization can not find the serialize member for the shared_ptr to the derived class. However, if I don't register the shared_ptr<T> for each derived class T in the shared library, but instead use BOOST_EXPORT_CLASS(shared_ptr<T>) in main(), everything works fine. Is there a workaround so that I don't need BOOST_EXPORT_CLASS(shared_ptr<T>) in main() for every possible derived class? Thanks. I can provide a trivial example that illustrates this issue if that would help.

1 0

Boost [Regex] (grep Falg) Why doesn't this pattern match?
by Asmita Gaikwad 27 Dec '13

27 Dec '13

Hi, Environment: Windows 7 (32 bit), Visual Studio 2010 (Visual C++) I am trying to use Boost REGEX regex_match algorithm. I am using its grep flag. My code is as follows and here (a)* matches string "aaa", but still b comes out to be false. 1 2 3 4 5 6 7 8 9 10 11 bool MatchWithGrep(string& pattern, string& data) { const boost::regex e(pattern.c_str(), boost::regex::grep); return regex_match(data.c_str(), e); } I am passing following parameters bool b = MatchWithGrep("(a)*\\n123", "aaa"); In Boost Help, following is documented. Link - http://www.boost.org/doc/libs/1_55_0/libs/regex/doc/html/boost_regex/syntax/ basic_syntax.html When an expression is compiled with the flag grep set, then the expression is treated as a newline separated list of POSIX-Basic expressions, a match is found if any of the expressions in the list match, for example: boost::regex e("abc\ndef", boost::regex::grep); will match either of the POSIX-Basic expressions "abc" or "def". Considering this, in my example i have 2 basic expressions (a)* and 123. (Since its c++ string \\n <file:///\\n> will be taken as \n internally. I had debugged the code and i can see value of variable pattern as "(a)*\n123" in watch window). Presence of any should give me bool b as true. And my data is "aaa". So it should give true. But i am getting false. Can anyone help me to find what's wrong with my code? Thanks & Regards, Asmita EDISPHERE Software Private Limited Email: asmita.gaikwad(a)edisphere.com| Website: <http://www.edisphere.com/> http://www.edisphere.com

3 2

filesystem temp_directory_path() returns undefined data
by Philipp Kraus 26 Dec '13

26 Dec '13

Hello, I have build Boost 1.55 on OSX 10.8.5 and I have written a short example to get the temporary path of my system. So I run std::cout << temp_directory_path() << std::endl, and it results "B?@?e/test/libboost_hA?@??%UP^?" I have build Boost with bjam myself and otool results the correct linked file. How can I solved the error? Thanks a lot Phil

1 0

compilation
by Mihir Thakkar 25 Dec '13

25 Dec '13

hello all i cloned the git repository by following command. i use ubuntu12.10 1) git clone --recursive https://github.com/boostorg/boost.git modular-boost 2) ./bootstrap.sh 3) ./b2 headers after this on running the following command for separately compiled libraries, 4) ./b2 and i got the error like following. gcc.compile.c++ bin.v2/libs/iostreams/build/ gcc-4.7/release/link-static/threading-multi/bzip2.o libs/iostreams/src/bzip2.cpp:20:56: fatal error: bzlib.h: No such file or directory compilation terminated. "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -DBOOST_ALL_NO_LIB=1 -DBOOST_IOSTREAMS_USE_DEPRECATED -DNDEBUG -I"." -c -o "bin.v2/libs/iostreams/build/gcc-4.7/release/link-static/threading-multi/bzip2.o" "libs/iostreams/src/bzip2.cpp" ...failed gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.7/release/link-static/threading-multi/bzip2.o... ...skipped <pbin.v2/libs/iostreams/build/gcc-4.7/release/link-static/threading-multi>libboost_iostreams.a(clean) for lack of <pbin.v2/libs/iostreams/build/gcc-4.7/release/link-static/threading-multi>bzip2.o... ...skipped <pbin.v2/libs/iostreams/build/gcc-4.7/release/link-static/threading-multi>libboost_iostreams.a for lack of <pbin.v2/libs/iostreams/build/gcc-4.7/release/link-static/threading-multi>bzip2.o... ...skipped <pstage/lib>libboost_iostreams.a for lack of <pbin.v2/libs/iostreams/build/gcc-4.7/release/link-static/threading-multi>libboost_iostreams.a... gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.7/release/threading-multi/bzip2.o libs/iostreams/src/bzip2.cpp:20:56: fatal error: bzlib.h: No such file or directory compilation terminated. "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_IOSTREAMS_DYN_LINK=1 -DBOOST_IOSTREAMS_USE_DEPRECATED -DNDEBUG -I"." -c -o "bin.v2/libs/iostreams/build/gcc-4.7/release/threading-multi/bzip2.o" "libs/iostreams/src/bzip2.cpp" ...failed gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.7/release/threading-multi/bzip2.o... ...skipped <pbin.v2/libs/iostreams/build/gcc-4.7/release/threading-multi>libboost_iostreams.so.1.55.0 for lack of <pbin.v2/libs/iostreams/build/gcc-4.7/release/threading-multi>bzip2.o... ...skipped <pstage/lib>libboost_iostreams.so.1.55.0 for lack of <pbin.v2/libs/iostreams/build/gcc-4.7/release/threading-multi>libboost_iostreams.so.1.55.0... ...skipped <pstage/lib>libboost_iostreams.so for lack of <pstage/lib>libboost_iostreams.so.1.55.0... ...failed updating 2 targets... ...skipped 6 targets... i would appreciate if someone would guide me how to solve the problem. thank you!

2 1

[program_options] with DOxygen?
by Mauricio Carneiro 25 Dec '13

25 Dec '13

I am writing a tool with command line options coordinated by boost program options. The API is well documented with Doxygen, but I would like Doxygen to also document the command line options for the tools extracting the information from the boost program_options variables. This would make the HTML useful also for the users, not just the developers. Does anyone know if there is such an integration between boost program_options and doxygen? If not, is there some other tool out there that produces HTML command line usage based on boost program_options? Merry christmas! Mauricio Carneiro, Ph.D. http://www.broadinstitute.org/~carneiro/

1 0

STL MAP Insertion and Updates ..!!
by Rahul Mathur 25 Dec '13

25 Dec '13

Hi, Looking for clue for below. Having a code which has to be inserted and updated with following status - 1. Insert with unique ID and initially with two values (viz . v1[1100] & v2[1000]) 2. If v1 [viz 1100] is NOT accepted exit. 3. Else value v2[1000] is accepted. With v2 being accepted, further insert with same unique ID on which v2 was accepted but now either with three values of v3[1001] or v4[1002] or v5[1003] and UPDATE the STL MAP. 4. Print the FINAL value (v2 or v3 or v5) of STL MAP with given unique ID. Did wrote below lines which works until value v1 [1000] insertion - --- #include <iostream> #include <algorithm> #include <map> #include <iterator> using namespace std; struct TBag { int UnqID; short value_code; TBag():UnqID(1234),value_code(1000){} }; TBag ms_var1; typedef std::map<int, short> map1; class Apple { map1 abc; public: void TypeInsert ( TBag *ms_var ); }; void Apple::TypeInsert ( TBag *ms_var ) { // Insert the 'UnqID' with messages of either TC = 1000 or 1100 only. typedef std::pair <map1::iterator, bool> itr; itr it1 = abc.insert( std::make_pair( ms_var->UnqID, ms_var->value_code ) ); typedef std::pair <map1::iterator, bool> itr; //Searching for value of Value Code = 1000 if (ms_var->value_code == 1100) { std::cout << "Value Error." << endl; exit (1); } if (it1.second) { // Checking correct insertion happened with 1000 std::cout << "Unq ID (" << it1.first->first << ") => " << "Value Code (" << it1.first->second << ")" << endl; std::cout << "The Status is .." << it1.first->first << " & " << it1.first->second << endl ; // INSERT now with Value code of either 1001 or 1002 or 1003 & finally UPDATE the STL MAP std::cout << "Final Status:" << endl ; for( map<int, short>::iterator iter = map1.begin(); iter != map1.end(); ++iter ) std::cout << iter->first << " " << iter->second << endl ; std::cout << "All Status successful." << endl; } else std::cout << "Status Error." << endl; } int main () { Apple ms; ms.TypeInsert( &ms_var1 ); return 0; } --- Any help is well appreciated ..:) ~ XoXo

2 1

Re: [Boost-users] How to use the optional with property_tree‏
by 王郁槐 25 Dec '13

25 Dec '13

I still don't understand，could you please figure it out？thanks. 发送自魅族手机 -------- 原始邮件 -------- 发件人：Olivier Tristan <o.tristan(a)uvi.net> 时间：周四 12月19日 22:08 收件人：boost-users(a)lists.boost.org 主题：Re: [Boost-users] How to use the optional with property_tree‏ >Those following lines from your code should give you a hint > >if (child2) >{ >child2.get().put_value(strValue); >} >else >{ >child2.get().put_value(strValue); >} > > > >Le 19/12/2013 12:34, 王郁槐 a écrit : >> Could anyone help? Why the below code will crash on the below line? I'm using the boost property_tree. Thanks. >> >> child1.get().put(sub_field, strValue); >> >> ========================================================= >> #include <fstream> >> #include <boost/filesystem.hpp> >> #include <boost/property_tree/ptree.hpp> >> #include <boost/property_tree/ini_parser.hpp> >> #include <boost/any.hpp> >> #include <boost/optional.hpp> >> >> void writeConfig(const std::string &field, const std::string &sub_field, const std::string & strValue) >> { >> if (!boost::filesystem::exists(prog_cfg_file)) >> { >> std::ofstream ofIniConfig(prog_cfg_file, std::ofstream::out|std::ofstream::app); >> ofIniConfig.close(); >> } >> >> >> boost::property_tree::ptree pt; >> boost::property_tree::ini_parser::read_ini(prog_cfg_file, pt); >> boost::optional<boost::property_tree::ptree&> child1 = pt.get_child_optional(field); >> >> if (child1) >> { >> boost::optional<boost::property_tree::ptree&> child2 = child1.get().get_child_optional(sub_field); >> >> if (child2) >> { >> child2.get().put_value(strValue); >> }else >> { >> child2.get().put_value(strValue); >> } >> }else >> { >> child1.get().put(sub_field, strValue); >> } >> >> boost::property_tree::ini_parser::write_ini(prog_cfg_file, pt); >> } >> >> int main() >> { >> writeConfig("test", "a", "OK"); >> return 0; >> } >> >> >> >> >> -- >> 兰生幽谷, 不以无人而不芳... >> >> >> >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users > > >-- >Olivier TRISTAN >uvi.net > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 2

[graph] boykov_kolmogorov_max_flow and reverse edges capacity
by Olivier Tournaire 21 Dec '13

21 Dec '13

Hi, I am trying to use boykov_kolmogorov_max_flow algorithm to find a minimum cut of some graph. To build the graph, I first create source and sink vertices. I then add some vertices, and connect them. Each time I create and edge, I also create the reverse edge: edge_descriptor_bool e01 = add_edge(v0, v1, _graph); edge_descriptor_bool e10 = add_edge(v1, v0, _graph); reverse[e01.first] = e10.first; reverse[e10.first] = e01.first; where reverse is: boost::property_map<Graph, boost::edge_reverse_t>::type reverse = get(boost::edge_reverse , _graph); I then fill edge capacity: capacity[e10.first] = this->getEnergy(fh, fh_v0); // Use policy to compute energy capacity[e01.first] = this->getEnergy(fh, fh_v0); // Use policy to compute energy My question is how capacity of reverse edge has to be computed. The doc states that reverse edge can carry capacities different than 0, but should they be the same as their parallel edge? Note that I use the algorithm with this method: _minEnergy = boykov_kolmogorov_max_flow(_graph, _source, _sink); Any help would be appreciated. Regards, Olivier

2 1

BGL: using short integer as vertex_descriptor
by Adam Celick 21 Dec '13

21 Dec '13

Hi, I am using the graph library in a memory constrained environment. By default vertex_descriptor for an adjacency_list (of vectors, i.e. vecS, vecS) seems to be std::size_t. I was wondering if there's a way to use say uint16_t for the vertex_descriptor? Thanks, -Adam

2 1

[boost.test] Unable to perform init at startup
by Adam Nielsen 21 Dec '13

21 Dec '13

Hi all, I'm having a bit of a problem trying to figure out how to perform some class init while manually registering my tests.

1 0

[boost.asio] Concurrently Ping 1000+ Hosts
by Kyle Ketterer 21 Dec '13

21 Dec '13

Hello, So the subject line pretty much says it all. Basically, I am trying to expand off of the icmp ping example given by the boost library documentation. I would like to ping 1000+ hosts in say, a matter of minutes rather than a matter of hours. I have already expanded the class shown here: http://www.boost.org/doc/libs/1_40_0/doc/html/boost_asio/example/icmp/ping.… Before I start posting code, I would like to discuss the strategy of trying to do this. In my Main thread, I was thinking about creating a vector of PingX objects. In the PingX class, I would have a separate io_service as well as wrap the async() functions in strands. I set the deadline timer at 800ms that way the io_service should return in less than a second. I would then call io_service run() in separate threads to *concurrently* ping these hosts. The problem appears to be that even through the async handers are wrapped in strands, there is data corruption. Is it true that when async handlers are wrapped in strands, they still cannot be executed *concurrently* ? My understanding of strand was that it serializes the handler functions to allow for thread safe access. However, I think that because I am accessing the same resources in multiple threads (such as the socket() object ), it is corrupting my expected output as well as occasionally throwing some exceptions. Are there any suggestions for the logic surrounding this or if this can be done in a multithreaded environment? Thanks! -- Kyle Ketterer

7 16

Boost.Coroutine and Object Inheritance
by Carlos Ferreira 20 Dec '13

20 Dec '13

Hello to all. I need some help using the Boost.Coroutine lib. I wanted to use the coroutines as objects and for that, I tried to build a simple object and inherit the boost::coroutines::coroutine template. ex: class SimpleObj : public boost::coroutines::coroutine<SimpleObj>{ private: std::unique_ptr<boost::asio::ip::tcp::socket> tcpSkt_uPtr; std::unique_ptr<boost::asio::ip::tcp::acceptor> acc_uPtr; public: SimpleObj(std::shared_ptr<boost::asio::io_service> ioService_ptr, boost::asio::ip::tcp::endpoint &endPoint); ~SimpleObj(); void run(); }; Is this right? Can I actually inherit from the boost::coroutines::coroutine template ? If yes, how can I proceed from here, to use the run() object method as the coroutine itself, with an io_service provided through the constructor ? Thanks for any assistance! -- Carlos Miguel Ferreira Researcher at Telecommunications Institute Aveiro - Portugal Work E-mail - cmf(a)av.it.pt Skype & GTalk -> carlosmf.pt(a)gmail.com LinkedIn -> http://www.linkedin.com/in/carlosmferreira

3 5

[git][testing] regression testing?
by Joaquín Mª López Muñoz 19 Dec '13

19 Dec '13

There's been some unanswered questions around this. I understand that regression tests, which are critical to ensure clean develop->master merges, will be eventually updated to work against git rather than the abandoned SVN, but I can't find any info on the progress of this. FWIW, I see some authors are going ahead and merging their libs anyway, which will bring breakages etc if changes are not properly validated through regression testing. Any indication on how this is progressing much appreciated. Best, Joaquín M López Muñoz Telefónica Digital ________________________________ Este mensaje se dirige exclusivamente a su destinatario. Puede consultar nuestra política de envío y recepción de correo electrónico en el enlace situado más abajo. This message is intended exclusively for its addressee. We only send and receive email on the basis of the terms set out at: http://www.tid.es/ES/PAGINAS/disclaimer.aspx

1 0

How to use the optional with property_tree‏
by 王郁槐 19 Dec '13

19 Dec '13

Could anyone help? Why the below code will crash on the below line? I'm using the boost property_tree. Thanks. child1.get().put(sub_field, strValue); ========================================================= #include <fstream> #include <boost/filesystem.hpp> #include <boost/property_tree/ptree.hpp> #include <boost/property_tree/ini_parser.hpp> #include <boost/any.hpp> #include <boost/optional.hpp> void writeConfig(const std::string &field, const std::string &sub_field, const std::string & strValue) { if (!boost::filesystem::exists(prog_cfg_file)) { std::ofstream ofIniConfig(prog_cfg_file, std::ofstream::out|std::ofstream::app); ofIniConfig.close(); } boost::property_tree::ptree pt; boost::property_tree::ini_parser::read_ini(prog_cfg_file, pt); boost::optional<boost::property_tree::ptree&> child1 = pt.get_child_optional(field); if (child1) { boost::optional<boost::property_tree::ptree&> child2 = child1.get().get_child_optional(sub_field); if (child2) { child2.get().put_value(strValue); }else { child2.get().put_value(strValue); } }else { child1.get().put(sub_field, strValue); } boost::property_tree::ini_parser::write_ini(prog_cfg_file, pt); } int main() { writeConfig("test", "a", "OK"); return 0; } -- 兰生幽谷, 不以无人而不芳...

2 1