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

[graph] filtered graph and num_vertices
by Miklós Tóth 03 Sep '14

03 Sep '14

Hi All, I have a graph, and I use a filter like this. struct FilteredGraph : public boost::filtered_graph<SomeGraph, SomeFilter > { FilteredGraph(SomeGraph g) : boost::filtered_graph<SomeGraph, SomeFilter>(g, SomeFilter(g)) {} }; I want to use in this function. template <class Graph>void some_graph_function(const Graph& g) { const size_t vertex_num = boost::num_vertices(g); //... } Like this: FilteredGraph fg(g) some_graph_function(fg); And I get: > error: no matching function for call to 'num_vertices(const FilteredGraph&)' > const size_t vertex_num = boost::num_vertices(g); > ^ >From the boost 1.55 documentation: > The num_vertices <http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/filtered_graph.html#num…> and num_edges <http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/filtered_graph.html#num…> functions do not filter > before returning results, so they return the number of vertices or > edges in the underlying graph, unfiltered [2] <http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/filtered_graph.html#2>. So it should work. What am I missing? Regards, Miklós

1 0

Re: [Boost-users] [graph] Unique vertices using setS
by Nicholas Dahm 03 Sep '14

03 Sep '14

> On Tue, Sep 2, 2014 11:29 AM MDT Jeremiah Willcock wrote: > >> >> >>On Sun, Aug 31, 2014 10:53 PM MDT Nicholas Dahm wrote: >> >>>On Wed, Aug 27, 2014 7:24 PM EDT Nicholas Dahm wrote: >>> >>>Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) >>> >>>Not that I know of. >>> >>>My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. >>> >>>Do you need to store the explored part of the search tree explicitly? You could instead use a custom graph type with your choice of vertex descriptor, then use associative_property_map to check for multiple visits to the same state. >>> >>>No need to store the explored part. I have exactly zero clue on how to create a custom graph type with a special vertex descriptor. At current I've gotten around it by having a "set" of vertex descriptors which use a custom "less" function which actually checks the vertex bundled properties instead of the descriptor. It's not the perfect solution but it wasn't very ugly either so it'll do. If you have a link to info on how to create custom graph types with special vertex descriptors please do let me know >> >>Please look at https://github.com/wpm/Boost-Implicit-Graph-Example for a simple example. You only need to do the incident edge iterator and property parts from that example, and can skip the other iterator types. There is also an A*-specific example at https://github.com/wpm/Astar-Maze-Solver, but it stores more of the data explicitly and uses existing BGL graph types. >> >>-- Jeremiah Willcock >> > >There is also http://www.boost.org/doc/libs/1_56_0/libs/graph/example/knights-tour.cpp as an example, but you'll probably need the BGL book for its documentation. > >-- Jeremiah Willcock Ok I'm getting the hang of it now. Thanks for all your help Jeremiah :)

1 0

problem with asio signal_set and consecutive signals
by Lutz Schneider 02 Sep '14

02 Sep '14

Hi, I have a program and would like to stop it by sending SIGINT for writing some data to a file instead of exiting immediately. However, if the user of the program sends SIGINT again then the program should quit immediately and forget about writing data to a file. For portability reason I would like to use boost::asio for this purpose. My initial (simplified) approach (see below) did not work. Is this not possible or am I missing something? handler seems to be called only once (printing out the message) and the program always stops when the loop has reached the max iteration number. void handler( const boost::system::error_code& error, int signal_number) { if (!error) { static bool first = true; if(first){ std::cout << " A signal(SIGINT) occurred." << std::endl; // do something like writing data to a file first = false; }else{ std::cout << " A signal(SIGINT) occurred, exiting...." << std::endl; exit(0); } } } int main(){ // Construct a signal set registered for process termination. boost::asio::io_service io; boost::asio::signal_set signals(io, SIGINT); // Start an asynchronous wait for one of the signals to occur. signals.async_wait(handler); io.run(); size_t i; for(i=0;i<std::numeric_limits<size_t>::max();++i){ // time stepping loop, do some computations } std::cout << i << std::endl; return 0; } Cheers, LS

2 3

Re: [Boost-users] [graph] Unique vertices using setS
by Jeremiah Willcock 02 Sep '14

02 Sep '14

On Tue, Sep 2, 2014 11:29 AM MDT Jeremiah Willcock wrote: > > >On Sun, Aug 31, 2014 10:53 PM MDT Nicholas Dahm wrote: > >>On Wed, Aug 27, 2014 7:24 PM EDT Nicholas Dahm wrote: >> >>Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) >> >>Not that I know of. >> >>My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. >> >>Do you need to store the explored part of the search tree explicitly? You could instead use a custom graph type with your choice of vertex descriptor, then use associative_property_map to check for multiple visits to the same state. >> >>No need to store the explored part. I have exactly zero clue on how to create a custom graph type with a special vertex descriptor. At current I've gotten around it by having a "set" of vertex descriptors which use a custom "less" function which actually checks the vertex bundled properties instead of the descriptor. It's not the perfect solution but it wasn't very ugly either so it'll do. If you have a link to info on how to create custom graph types with special vertex descriptors please do let me know > >Please look at https://github.com/wpm/Boost-Implicit-Graph-Example for a simple example. You only need to do the incident edge iterator and property parts from that example, and can skip the other iterator types. There is also an A*-specific example at https://github.com/wpm/Astar-Maze-Solver, but it stores more of the data explicitly and uses existing BGL graph types. > >-- Jeremiah Willcock > There is also http://www.boost.org/doc/libs/1_56_0/libs/graph/example/knights-tour.cpp as an example, but you'll probably need the BGL book for its documentation. -- Jeremiah Willcock

1 0

Re: [Boost-users] [graph] Unique vertices using setS
by Jeremiah Willcock 02 Sep '14

02 Sep '14

On Sun, Aug 31, 2014 10:53 PM MDT Nicholas Dahm wrote: >>On Wed, Aug 27, 2014 7:24 PM EDT Nicholas Dahm wrote: >> >>Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) >> >>Not that I know of. >> >>My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. >> >>Do you need to store the explored part of the search tree explicitly? You could instead use a custom graph type with your choice of vertex descriptor, then use associative_property_map to check for multiple visits to the same state. > >No need to store the explored part. I have exactly zero clue on how to create a custom graph type with a special vertex descriptor. At current I've gotten around it by having a "set" of vertex descriptors which use a custom "less" function which actually checks the vertex bundled properties instead of the descriptor. It's not the perfect solution but it wasn't very ugly either so it'll do. If you have a link to info on how to create custom graph types with special vertex descriptors please do let me know Please look at https://github.com/wpm/Boost-Implicit-Graph-Example for a simple example. You only need to do the incident edge iterator and property parts from that example, and can skip the other iterator types. There is also an A*-specific example at https://github.com/wpm/Astar-Maze-Solver, but it stores more of the data explicitly and uses existing BGL graph types. -- Jeremiah Willcock

1 0

Very interesting problem with TCP sockets
by Igor Mironchik 02 Sep '14

02 Sep '14

Hi guys, I was trying to connect Qt TCP Socket with Boost Asio TCP socket. And what I found. Qt writes simple 12 bytes message to the Boost and in most situations Boost reads garbage. Even more Boost can crash. And my question is: who is so bad guy, Boost or Qt? You can find simple implementation of the problem in the attachment. Thanks. P.S. Problem is on Windows 7, on Linux or Mac OS I have no possibility to test...

2 2

Boost MPI Collective
by Nolen, Steven Douglas 02 Sep '14

02 Sep '14

In boost/mpi/collectives/reduce.hpp The template function specialization for reduce-ing a std::vector, should probably be modified. Ffrom template<typename T, typename Op> void reduce(const communicator & comm, std::vector<T> const & in_values, std::vector<T> & out_values, Op op, int root) { out_values.resize(in_values.size()); reduce(comm, &in_values.front(), in_values.size(), &out_values.front(), op, root); } To template<typename T, typename Op> void reduce(const communicator & comm, std::vector<T> const & in_values, std::vector<T> & out_values, Op op, int root) { if( comm.rank() == root ) out_values.resize(in_values.size()); reduce(comm, &in_values.front(), in_values.size(), &out_values.front(), op, root); } This will save an extraneous allocation on the non-root nodes. -steve

2 1

[MSM] eUML compilation fails with gcc and -std=c++11
by caligano 01 Sep '14

01 Sep '14

Hi, I tried to compile some of the eUML MSM samples (e.g. http://www.boost.org/doc/libs/1_56_0/libs/msm/doc/HTML/examples/SimpleTimer…) using gcc 4.8 and with C+11 support enabled. However, I always get errors like the following one: error: ‘BOOST_PP_REPEAT_FROM_TO_M_1’ has not been declared I did not find anything about C++11 being not supported by Boost MSM, so I would like to know if I am doing anything wrong? Bye Manuel

3 2

[spirit,units] Linker problem on msvs platform
by Johannes Brunen 01 Sep '14

01 Sep '14

Hello, I have created two little helper functions for parsing strings with respect to unit length values: OptLengthQuantityT parse_length_quantity(...) PairOptLengthQuantityT parse_dbl_length_quantity(...) My problem is that my implementation based on the spirit and units libraries does compile fine, but fails on linking on 32Bit Debug with the following error message: Quantity.obj : fatal error LNK1179: invalid or corrupt file: duplicate COMDAT '?value@?$result_@U?$member_variable@$$A6E?AUlength_quantity_t@Quantitie s@@XZP8?$length_quantity_grammer@V?$_String_const_iterator@DU?$char_trai ts@D@std@@V?$allocator@D@2@@std@@U?$expr@Uterminal@tag@tagns_@proto@boos t@@U?$term@U?$char_code@Uspace@tag@spirit@boost@@Uiso8859_1@char_encodin g@34@@tag@spirit@boost@@@argsns_@45@$0A@@exprns_@proto@boost@@@2@AE?AU12 @XZ@detail@phoenix@boost@@@?$is_mem_fun_pointer_select@$0A@@detail@boost @@2_NB' I'm working with the msvc 2010Sp1 compiler from microsoft on windows 7. I have tried to shorten the symbol names but I could not get it to work. Does anyone has experience with this kind of errors? Is there something wrong with the implementation of the two functions? You can find the implementation in the attached files. Best, Johannes

1 0

[Boost.Log] translate 3rd party log entries
by Olaf Peter 01 Sep '14

01 Sep '14

Hello, from 3rd party lib I have to integrate the logging message - incorporating into boost.log. But I run into the problem with scopes: main.cpp: In function 'int main(int, char**)': main.cpp:55:5: error: no matching function for call to 'boost::log::v2s_mt_posix::attributes::named_scope_entry::named_scope_entry(const char [6], const char*&, int&)' main.cpp:55:5: note: candidates are: /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:88:5: note: boost::log::v2s_mt_posix::attributes::named_scope_entry::named_scope_entry(const string_literal&, const string_literal&, unsigned int) /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:88:5: note: no known conversion for argument 2 from 'const char*' to 'const string_literal& {aka const boost::log::v2s_mt_posix::basic_string_literal<char>&}' /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:63:8: note: boost::log::v2s_mt_posix::attributes::named_scope_entry::named_scope_entry(const boost::log::v2s_mt_posix::attributes::named_scope_entry&) /opt/boost/boost_1_55_0/boost/log/attributes/named_scope.hpp:63:8: note: candidate expects 1 argument, 3 provided The problem rises on string_literal of __FILE__ entry. How can I get this working?? Thanks, Olaf

1 2

Trouble with compiling/linking the unit test library
by Christoff Kok 01 Sep '14

01 Sep '14

Hi, I am struggling to compile a simple test with the Unit test library. It seems to be a linker error when trying to link the unit_test_framework library. I have tried diffrerent options but to no avail. I have tried to link it with a visual studio library as well, but I am still receiving the same error. clang++.exe -o bin\Debug\QuickTest.exe obj\Debug\functions.o obj\Debug\functionsTest.o obj\Debug\maintest.o *C:\boost_1_55_0\stage\lib\libboost_unit_test_framework-mgw48-mt-1_55.a* obj\Debug\functionsTest.o: In function `_cxx_global_var_init2': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:4: undefined reference to `_imp___ZN5boost9unit_test9ut_detail24auto_test_unit_registrarC1EPNS0_9test_caseEm' obj\Debug\functionsTest.o: In function `ZN8Multiply11test_methodEv': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: *undefined reference to * `_imp___ZN5boost9unit_test15unit_test_log_t14set_checkpointENS0_13basic_cstringIKcEEjS4_' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultC1Eb' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: *undefined reference to * `_imp___ZN5boost10test_tools9tt_detail10check_implERKNS0_16predicate_resultERKNS_9unit_test12lazy_ostreamENS5_13basic_cstringIKcEEjNS1_10tool_levelENS1_10check_typeEjz' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:6: *undefined reference to* `_imp___ZN5boost10test_tools16predicate_resultD1Ev' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultD1Ev' obj\Debug\functionsTest.o: In function `_dtor__ZZN5boost9unit_test9singletonINS0_15unit_test_log_tEE8instanceEvE8the_inst': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/functionsTest.cpp:38: *undefined reference to* `_imp___ZN5boost9unit_test15unit_test_log_tD1Ev' obj\Debug\functionsTest.o: In function `ZN5boost9unit_test9singletonINS0_15unit_test_log_tEE8instanceEv': C:\boost_1_55_0\boost/test/utils/trivial_singleton.hpp:38: undefined reference to `_imp___ZN5boost9unit_test15unit_test_log_tC1Ev' obj\Debug\functionsTest.o: In function `ZN5boost9unit_test14make_test_caseERKNS0_9callback0INS0_9ut_detail6unusedEEENS0_13basic_cstringIKcEE': C:\boost_1_55_0\boost/test/unit_test_suite_impl.hpp:255: undefined reference to `_imp___ZN5boost9unit_test9ut_detail24normalize_test_case_nameENS0_13basic_cstringIKcEE' C:\boost_1_55_0\boost/test/unit_test_suite_impl.hpp:255: undefined reference to `_imp___ZN5boost9unit_test9test_caseC1ENS0_13basic_cstringIKcEERKNS0_9callback0INS0_9ut_detail6unusedEEE' obj\Debug\maintest.o: In function `main': C:\boost_1_55_0\boost/test/unit_test.hpp:59: undefined reference to `_imp___ZN5boost9unit_test14unit_test_mainEPFbvEiPPc' obj\Debug\maintest.o: In function `_cxx_global_var_init2': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:5: undefined reference to `_imp___ZN5boost9unit_test9ut_detail24auto_test_unit_registrarC1EPNS0_9test_caseEm' obj\Debug\maintest.o: In function `ZN29SimpleTestInMainTestingModule11test_methodEv': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost9unit_test15unit_test_log_t14set_checkpointENS0_13basic_cstringIKcEEjS4_' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultC1Eb' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools9tt_detail10check_implERKNS0_16predicate_resultERKNS_9unit_test12lazy_ostreamENS5_13basic_cstringIKcEEjNS1_10tool_levelENS1_10check_typeEjz' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:7: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultD1Ev' D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:8: undefined reference to `_imp___ZN5boost10test_tools16predicate_resultD1Ev' obj\Debug\maintest.o: In function `_dtor__ZZN5boost9unit_test9singletonINS0_15unit_test_log_tEE8instanceEvE8the_inst': D:\Ex Mente\Software\_CHK.Sandbox\quickCplusplusTest\QuickTest/maintest.cpp:38: undefined reference to `_imp___ZN5boost9unit_test15unit_test_log_tD1Ev' collect2.exe: error: ld returned 1 exit status clang++.exe: error: linker (via gcc) command failed with exit code 1 (use -v to see invocation) Kind Regards, Christoff

1 0

A* search on Implicit graph (search tree)
by Nicholas Dahm 01 Sep '14

01 Sep '14

Hi All, I'm trying to run an A* search using boost's astar_search, but I'm running into issues with 'const'. I'm trying to add the examine_vertex(my_vdesc_type &v, my_graph_type &g) function, but of course boost says that I need to make it const like examine_vertex(my_vdesc_type &v, const my_graph_type &g) However since I'm searching an implicit graph, I need to call add_vertex(g) within this function. But then I of course get an error because i'm trying to do add_vertex(const my_graph_type &g) which is invalid. I've read the example astar_maze.cpp which CLAIMS to be implicit but certainly doesn't appear to be. I've also seen the pdf at http://cs.krisbeevers.com/research/astar_bgl04.pdf which says you need to basically create non-const versions of a bunch of functions. Considering that http://www.boost.org/doc/libs/1_56_0/libs/graph/doc/astar_search.html says that "A* is particularly useful for searching implicit graphs", I'm assuming that boost ALREADY HAS some way of actually searching implicit graphs. Any ideas? cheers Nick

1 0

Re: [Boost-users] [graph] Unique vertices using setS
by Nicholas Dahm 01 Sep '14

01 Sep '14

>On Wed, Aug 27, 2014 7:24 PM EDT Nicholas Dahm wrote: > >>Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) > >Not that I know of. > >>My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. > >Do you need to store the explored part of the search tree explicitly? You could instead use a custom graph type with your choice of vertex descriptor, then use associative_property_map to check for multiple visits to the same state. No need to store the explored part. I have exactly zero clue on how to create a custom graph type with a special vertex descriptor. At current I've gotten around it by having a "set" of vertex descriptors which use a custom "less" function which actually checks the vertex bundled properties instead of the descriptor. It's not the perfect solution but it wasn't very ugly either so it'll do. If you have a link to info on how to create custom graph types with special vertex descriptors please do let me know cheers Nick

1 0

Review Wizard Status Report for August 2014
by Ron Garcia 30 Aug '14

30 Aug '14

============================================== Review Wizard Status Report for August 2014 ============================================== News ==== 1. Fiber Accepted Provisionally. January 2014. 2. Align Accepted. April 2014. 3. TypeIndex Accepted. May 2014. 4. Convert Accepted. June 2014. 5. Boost 1.56 Released -- New Libraries: Align, TypeIndex Open Issues =========== The following libraries have review managers, but have not yet been scheduled for review: * Range Extensions - added May 2012; review manager: Neil Groves. The following libraries have been accepted to Boost, but have not yet been integrated into Boost Git: * Contract - accepted September 2012; author: Lorenzo Caminiti. The following libraries have been accepted and submitted to Boost Git, but have not yet appeared in a release: * Convert - accepted June 2014; author: Vladimir Batov. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Fiber - accepted provisionally January 2014; author Oliver Kowalke. General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot ubc dot ca" and "johnphillipsithica at gmail dot com" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Boost.Range Extensions * Nowide (M) * Array (M) * STL Extensions (M) * Countertree (M) * Process (M) * Asynchronous File I/O (M) * Application (M) * Edit Distance (M) * Mixin (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. Array ----- :Author: Brian Smith :Review Manager: Needed :Download: https://github.com/BrianJSmith/Array :Description: The array class is a C++11 compatible implementation of static multidimensional arrays. STL Extensions -------------- :Author: Vadim Stadnik :Review Manager: Needed :Download: https://github.com/vstadnik/stl_ext_adv_review :Description: The proposed library [stl_ext_adv] offers augmented array based B+ trees and STL containers that support the interfaces of the C++03 sequences and associative containers. The library offers a number of extensions and performance improvements that are not available in C++03 and C++11 standard containers. Countertree ----------- :Author: Francisco Jose Tapia :Review Manager: Needed :Download: https://dl.dropbox.com/u/8437476/works/countertree_code_doc.zip :Description: This library is an implementation of a binary red-black counter tree. This tree have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. COUNTERTREE This kind of trees have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. With unordered information we have a vector with the same speed inserting and deleting in any position (O(log N)). With ordered information, we have the classes set, multiset, map and multimap, with identical interface than the STL classes, with the plus of access to the elements by position, like in a vector. The iterators are random access , and you can subtract them. SUBALLOCATOR The suballocator is a layer between the allocator and the data structures, compatible with any allocator with the STL definition. The suballocator replace to the allocator in the allocation of equal size elements. It provides speed, return the unused memory and decrease the memory used by the program and improve the cache performance due to the data locality improvement ( 30% of improvement of speed respect the std::allocator with GCC 4.7) Process ------- :Author: Boris Schaeling :Review Manager: Needed :Download: http://www.highscore.de/boost/process0.5/process.zip :Description: Boost.Process is a library to manage system processes. It can be used to: * create child processes * setup streams for child processes * communicate with child processes through streams (synchronously or asynchronously) * wait for processes to exit (synchronously or asynchronously) * terminate processes Asynchronous File I/O --------------------- :Author: Niall Douglas and Paul Kirth :Review Manager: Needed :Download: https://github.com/BoostGSoC/boost.afio/archive/boost-peer-review.tar.gz :Description: Boost.AFIO is a linear scalable, batch, chainable, asynchronous closure execution engine with an almost wait free implementation extending Boost.ASIO and Boost.Thread specialised as a portable asynchronous file i/o implementation library. Implementation of this first version has been kept as simple as possible (~ 1000 active LOC) at the cost of some performance, though with a good compiler you can expect 25-50% of the performance of using raw Boost.ASIO. Application ----------- :Author: Renato Tegon Forti :Review Manager: Needed :Download: https://github.com/retf/Boost.Application :Documentation: http://www.dokfile.com/appbeta4/docs/libs/application/doc/html/index.html :Description: Application provides an application environment, or start point to any people that want a basic infrastructure to build an system application on Windows or Unix Variants (e.g. Linux, MacOS). Application uses behaviours modeled using 'aspects' concept proposed by 'Vicente J. Botet Escriba', that allow easy extension and customization of library components. The application modes uses these components internally to achieve the user desirable behaviours. Application provide many useful ready-to-use features, e.g: * Run application as Windows Service; * Run application as UNIX/POSIX Daemon; * Plugin extension system; * Process(executable) Single instance Instantiation support; * Application SIGNAL/Callbacks customization; * Windows Service Setup feature; * And many others. Edit Distance ------------- :Author: Erik Erlandson :Review Manager: Needed :Download: https://github.com/erikerlandson/algorithm/tree/edit_distance/sequence :Description: The edit distance is the length of the shortest (or least-cost) edit script from one sequence to another, where an edit script is defined as a sequence of insertion, deletion and (optionally) substitution operations. The function implementing the edit distance is named edit_distance. This function will return the edit distance between two sequences, where sequences may be any valid range object supporting forward iteration. The edit_distance function will also, if requested, return the edit script. Mixin ----- :Author: Borislav Stanimirov :Download: https://github.com/iboB/boost.mixin :Documentation: http://ibob.github.io/boost.mixin/ :Review Manager: Needed :Description: Boost.Mixin is a library that allows the composition and modifications of polymorphic types at run time. Types and objects are constructed out of building blocks called mixins. The library uses the type boost::mixin::object as a placeholder, whose instances can be extended with existing classes (mixins), thus providing a particular instance with the functionality of all those types. Accessing the newly formed type's interface is made through messages: stand-alone functions generated by the library, which can be thought of as methods. This is given while also having full abstraction between the interface and the definition of types. An existing feature in another language similar to Boost.Mixin and also an inspiration for the library are the mixins in Ruby. The library also has similarities with the pattern entity-component-system. Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

2 1

[msm] forward declaration of state machine with non-default constructor
by caligano 29 Aug '14

29 Aug '14

Hi, I want to forward declare a state machine which has a non-default constructor. I found this example here: http://stackoverflow.com/a/10922799/678093 But I can't call the non-default constructor of the state machine. I either get - "error: call of overloaded ‘fsm(int)’ is ambiguous" (if inheriting constructors using C++11) or - "error: no matching function for call to ‘wrapper::fsm::fsm(int)" What can I do about it? Thanks, Manuel Example: ------------------------ // wrapper.h #include <boost/msm/front/state_machine_def.hpp> #include <boost/msm/back/state_machine.hpp> #include <boost/shared_ptr.hpp> class wrapper { wrapper(); struct fsm; boost::shared_ptr<fsm> player_fsm; }; ------------------------ // wrapper.cpp #include "wrapper.h" struct player_ : public boost::msm::front::state_machine_def<player_> { player_(int some_value) {} }; struct wrapper::fsm : public boost::msm::back::state_machine<player_> { using boost::msm::back::state_machine<player_>::state_machine; }; wrapper::wrapper() : player_fsm(new fsm(100)) { } ------------------------

3 2

Re: [Boost-users] [graph] Unique vertices using setS
by Jeremiah Willcock 29 Aug '14

29 Aug '14

On Wed, Aug 27, 2014 7:24 PM EDT Nicholas Dahm wrote: >Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) Not that I know of. >My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. Do you need to store the explored part of the search tree explicitly? You could instead use a custom graph type with your choice of vertex descriptor, then use associative_property_map to check for multiple visits to the same state. -- Jeremiah Willcock

1 0

Cannot use Boost.Croutines with range based for
by Mueller-Roemer, Johannes Sebastian 29 Aug '14

29 Aug '14

Hi, I am (again) having issues with the Boost.Coroutines library. Aside from yet another new API, the coroutines no longer work with range based for. Even though the examples include range based for! With the following code (taken directly from the documentation and added the includes and main): #include <boost/coroutine/asymmetric_coroutine.hpp> #include <iostream> int main() { boost::coroutines::asymmetric_coroutine<int>::pull_type source( [&](boost::coroutines::asymmetric_coroutine<int>::push_type& sink){ int first=1, second=1; sink(first); sink(second); for(int i=0;i<8;++i){ int third=first+second; first=second; second=third; sink(third); } } ); for(auto i : source) std::cout << i << " "; } I get this error: D:\projects\combinators\coro_test.cpp: In function 'int main()': D:\projects\combinators\coro_test.cpp:20:15: error: 'begin' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2255:1: note: 'std::begin' begin( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:18:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' D:\projects\combinators\coro_test.cpp:20:15: error: 'end' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2260:1: note: 'std::end' end( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:19:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type end( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' mingw32-make[2]: *** [CMakeFiles/coro-test.dir/coro_test.cpp.obj] Error 1 mingw32-make[1]: *** [CMakeFiles/coro-test.dir/all] Error 2 mingw32-make: *** [all] Error 2 For completeness sake: I am using MinGW-w64 with GCC 4.9.1 and the -std=c++11 flag Regards, Johannes S. Mueller-Roemer -- Johannes S. Mueller-Roemer, MSc Wiss. Mitarbeiter - Interactive Engineering Technologies (IET) Fraunhofer-Institut für Graphische Datenverarbeitung IGD Fraunhoferstr. 5 | 64283 Darmstadt | Germany Tel +49 6151 155-606 | Fax +49 6151 155-139 johannes.mueller-roemer(a)igd.fraunhofer.de | www.igd.fraunhofer.de

5 20

[filesystem] : How to get a parametrized basic_string from filesystem::path
by Vincent R. 28 Aug '14

28 Aug '14

Hi, I am trying to modify an existing code to keep the possibility to use string or wstring, so I have changed the definition to parametrize it as shown below (Path inherits from path): template <class TChar> bool GetFileList(const std::basic_string<TChar>& i_strBaseDir, std::vector<std::basic_string<TChar> >& o_FileList) { boost::system::error_code ec; Path thePath(i_strBaseDir); boost::filesystem::directory_iterator iter(thePath, ec); if (! ec) { boost::filesystem::directory_iterator iter_end; for (; iter != iter_end; ++ iter) { boost::system::error_code ec; // This is to avoid an exception in case of any error if(!boost::filesystem::is_directory(iter->path(), ec)) //find file and not directory { std::basic_string<TChar> strFile = iter->path().????); // HOW TO DO IT o_FileList.push_back(strFile); } } } return (o_FileList.size() != 0); } My problem is with the following line : std::basic_string<TChar> strFile = iter->path().??????; I have solved like that (without testing it) : template <typename CharT, typename T> std::basic_string<CharT> string_cast(const T& r) { std::basic_ostringstream<CharT> stream; stream.imbue(std::locale::classic()); stream << r; return stream.str(); } std::basic_string<TChar> strFile = string_cast<TChar>(iter->path()); but since it uses some stream we might loose some performance. I have found another string_cast here : http://codereview.stackexchange.com/questions/1205/c-string-cast-template-f… that might be better in terms of performance. Do you have some other suggestion ? Wouldn't be interesting to add a boost::string_cast that would allow to convert from templated methods from/to string/wstring ? Thanks

1 0

[graph] Unique vertices using setS
by Nicholas Dahm 27 Aug '14

27 Aug '14

Hi All, I'm trying to create a graph with unique vertices using setS for vertices, but it doesn't seem to be working. To test it I've made a simple example simply using int's for the vertex properties: typedef boost::adjacency_list<boost::setS, boost::setS, boost::undirectedS, int, int> gtype; typedef boost::graph_traits<gtype>::vertex_descriptor gvd; gtype gr; int v1 = 4; gvd vd1 = add_vertex(v1, gr); gvd vd2 = add_vertex(v1, gr); printf("vd1: %ld, gr[vd1]: %d\n", vd1, gr[vd1]); printf("vd2: %ld, gr[vd2]: %d\n", vd2, gr[vd2]); printf("num_vertices: %d\n", num_vertices(gr)); Output: vd1: 17473168, gr[vd1]: 4 vd2: 17473248, gr[vd2]: 4 num_vertices: 2 So my graph has two vertices represented by the int 4, suggesting it's not a set! Any idea what I'm missing? Is the set for vertex descriptors, but the vertices themselves stored elsewhere? cheers Nick

1 1

Re: [Boost-users] [graph] Unique vertices using setS
by Jeremiah Willcock 27 Aug '14

27 Aug '14

On Wed, Aug 27, 2014 2:47 AM EDT Nicholas Dahm wrote: >Hi All, > >I'm trying to create a graph with unique vertices using setS for vertices, but it doesn't seem to be working. > >To test it I've made a simple example simply using int's for the vertex properties: > > typedef boost::adjacency_list<boost::setS, boost::setS, boost::undirectedS, int, int> gtype; > typedef boost::graph_traits<gtype>::vertex_descriptor gvd; > > gtype gr; > int v1 = 4; > gvd vd1 = add_vertex(v1, gr); > gvd vd2 = add_vertex(v1, gr); > printf("vd1: %ld, gr[vd1]: %d\n", vd1, gr[vd1]); > printf("vd2: %ld, gr[vd2]: %d\n", vd2, gr[vd2]); > printf("num_vertices: %d\n", num_vertices(gr)); > >Output: > > vd1: 17473168, gr[vd1]: 4 > vd2: 17473248, gr[vd2]: 4 > num_vertices: 2 > >So my graph has two vertices represented by the int 4, suggesting it's not a set! Any idea what I'm missing? Is the set for vertex descriptors, but the vertices themselves stored elsewhere? There is a difference between vertex descriptors and properties. There are no requirements that property values are unique for any graph type; those are up to you to set however you want. If gr[vd1] and gr[vd2] had the same address, that would be a problem. However, you initialized both of those property slots with the same value 4, and the graph type has no issue with you doing that. One reason for this is that the same graph can have multiple vertex and edge properties, and so you might want some of them to be unique and some not, so the graph type would not know where to enforce uniqueness. -- Jeremiah Willcock > >cheers > >Nick >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[geometry] Buffer (with strategy) to offset polygons
by Olivier Tournaire 27 Aug '14

27 Aug '14

Dear all, I have used successfully the buffering algorithm to offset a shapefile of 2D polygons. However, there are 4 polygons (amongst nearly 4000) in my SHP does are not successfully processed. They do not have topology or orientation errors. I use GDAL 1.9 to read the SHP, boost 1.56 precompiled binaries from sourceforge on a 64bit windows 7. If someone is willing to have a look at the problem, I can share the files and the code I use. Here is a quick overview: typedef double coordinate_type; typedef boost::geometry::model::d2::point_xy<coordinate_type> point_xy_type; typedef boost::geometry::model::polygon<point_xy_type> polygon_type; boost::geometry::strategy::buffer::end_flat end_strategy; boost::geometry::strategy::buffer::point_square point_strategy; boost::geometry::strategy::buffer::side_straight side_strategy; boost::geometry::strategy::buffer::distance_symmetric<coordinate_type> distance_strategy(buffer_distance); boost::geometry::strategy::buffer::join_miter join_strategy(buffer_distance); polygon_type p; boost::geometry::model::multi_polygon<polygon_type> result; // Build a polygon_type from OGRPolygon OGRLinearRing* exteriorRing = polygon->getExteriorRing(); for(int i=0;i<exteriorRing->getNumPoints();++i) { OGRPoint pt; exteriorRing->getPoint(i,&pt); p.outer().push_back( point_xy_type(pt.getX(), pt.getY()) ); } for(int i=0;i<polygon->getNumInteriorRings();++i) { OGRLinearRing* interiorRing = polygon->getInteriorRing(i); polygon_type::ring_type ring; for(int j=0;j<interiorRing->getNumPoints();++j) { OGRPoint pt; interiorRing->getPoint(j,&pt); ring.push_back( point_xy_type(pt.getX(), pt.getY()) ); } p.inners().push_back(ring); } boost::geometry::buffer(p, result, distance_strategy, side_strategy, join_strategy, end_strategy, point_strategy); if(result.size() == 0) { int indexID = feature->GetFieldIndex("ID"); cout << "No result build for polygon with ID " << feature->GetFieldAsString(indexID) << endl; } else { typedef boost::geometry::strategy::distance::pythagoras<coordinate_type> pythagoras_distance_strategy; typedef boost::geometry::strategy::distance::projected_point<coordinate_type, pythagoras_distance_strategy> projected_point_strategy; boost::geometry::strategy::simplify::douglas_peucker<point_xy_type, projected_point_strategy> dp; OGRPolygon poly; for(size_t i=0;i<result.size();++i) { polygon_type result_i = result[i]; polygon_type result_i_simplified; boost::geometry::simplify(result_i, result_i_simplified, 0.1, dp); { OGRLinearRing ring; for(size_t j=0;j<result_i_simplified.outer().size();++j) ring.addPoint( result_i_simplified.outer()[j].x(), result_i_simplified.outer()[j].y() ); poly.addRing(&ring); } { OGRLinearRing ring; for(size_t j=0;j<result_i_simplified.inners().size();++j) { for(size_t k=0;k<result_i_simplified.inners()[j].size();++k) { ring.addPoint( result_i_simplified.inners()[j][k].x(), result_i_simplified.inners()[j][k].y() ); } poly.addRing(&ring); } } } Note that I use a simplification algorithm after buffering to remove colinear points. Hope you could help. Best regards, Olivier

3 9

Re: [Boost-users] Cannot use Boost.Croutines with range based for
by Mueller-Roemer, Johannes Sebastian 27 Aug '14

27 Aug '14

Adding the following namespace boost { namespace coroutines { using boost::begin; using boost::end; } } solves the problem, however this would seem to indicate that the provided begin and end are in the wrong namespace and therefore do not take part in ADL. Should I report this as a bug? Doesn't seem to be intended. -- Johannes S. Mueller-Roemer, MSc Wiss. Mitarbeiter - Interactive Engineering Technologies (IET) Fraunhofer-Institut für Graphische Datenverarbeitung IGD Fraunhoferstr. 5 | 64283 Darmstadt | Germany Tel +49 6151 155-606 | Fax +49 6151 155-139 johannes.mueller-roemer(a)igd.fraunhofer.de | www.igd.fraunhofer.de From: Mueller-Roemer, Johannes Sebastian Sent: Wednesday, August 27, 2014 12:57 To: 'boost-users(a)lists.boost.org' Subject: Cannot use Boost.Croutines with range based for Hi, I am (again) having issues with the Boost.Coroutines library. Aside from yet another new API, the coroutines no longer work with range based for. Even though the examples include range based for! With the following code (taken directly from the documentation and added the includes and main): #include <boost/coroutine/asymmetric_coroutine.hpp> #include <iostream> int main() { boost::coroutines::asymmetric_coroutine<int>::pull_type source( [&](boost::coroutines::asymmetric_coroutine<int>::push_type& sink){ int first=1, second=1; sink(first); sink(second); for(int i=0;i<8;++i){ int third=first+second; first=second; second=third; sink(third); } } ); for(auto i : source) std::cout << i << " "; } I get this error: D:\projects\combinators\coro_test.cpp: In function 'int main()': D:\projects\combinators\coro_test.cpp:20:15: error: 'begin' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2255:1: note: 'std::begin' begin( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:18:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/begin.hpp:106:61: note: 'boost::range_adl_barrier::begin' D:\projects\combinators\coro_test.cpp:20:15: error: 'end' was not declared in this scope for(auto i : source) ^ D:\projects\combinators\coro_test.cpp:20:15: note: suggested alternatives: In file included from D:\projects\combinators\coro_test.cpp:1:0: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:2260:1: note: 'std::end' end( boost::coroutines::push_coroutine< R > & c) ^ In file included from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/functions.hpp:19:0, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range.hpp:18, from D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/coroutine/asymmetric_coroutine.hpp:17, from D:\projects\combinators\coro_test.cpp:1: D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type end( const T& r ) ^ D:/libs/mingw-amd64/boost_1_56_0/include/boost-1_56/boost/range/end.hpp:100:61: note: 'boost::range_adl_barrier::end' mingw32-make[2]: *** [CMakeFiles/coro-test.dir/coro_test.cpp.obj] Error 1 mingw32-make[1]: *** [CMakeFiles/coro-test.dir/all] Error 2 mingw32-make: *** [all] Error 2 For completeness sake: I am using MinGW-w64 with GCC 4.9.1 and the -std=c++11 flag Regards, Johannes S. Mueller-Roemer -- Johannes S. Mueller-Roemer, MSc Wiss. Mitarbeiter - Interactive Engineering Technologies (IET) Fraunhofer-Institut für Graphische Datenverarbeitung IGD Fraunhoferstr. 5 | 64283 Darmstadt | Germany Tel +49 6151 155-606 | Fax +49 6151 155-139 johannes.mueller-roemer(a)igd.fraunhofer.de<mailto:johannes.mueller-roemer@igd.fraunhofer.de> | www.igd.fraunhofer.de<http://www.igd.fraunhofer.de>

1 0

[Smart Pointer] Reference counting when you don't want to manage memory [Honeywell Internal]
by Hickman, Steve (AdvTech) 26 Aug '14

26 Aug '14

Classification: Honeywell Internal Smart pointers (as in http://www.boost.org/doc/libs/1_56_0/libs/smart_ptr/smart_ptr.htm ) assume that the action you want to perform when the count goes to zero is to free the memory pointed to. That isn't the only use for reference counting. Why doesn't the Smart Pointer library decouple the reference counting from the action to be taken and provide a generic reference counting mechanism that will call an arbitrary function when the count goes to zero? The default can be "delete" to provide the expected memory management capability but it would provide a robust mechanism for those who need other capabilities. Reviewing the <boost/shared_ptr.hpp> code, it appears this decoupling already exists - through the use of boost::checked_delete and boost::checked_deleter (<boost/checked_delete.hpp>). It just doesn't appear to be documented. Why not document this so others know how to use it? Steve Hickman System Architect, Flight Deck of the Future 480-236-8367 ============================================================================================================================================================================================================ This message classified as Honeywell Internal by Hickman, Steve (AdvTech) on Tuesday, August 26, 2014 at 12:35:32 PM. The above classification labels are in accordance with the Honeywell Corporate Classification Policy. The information contained in this electronic message is confidential and intended only for the use of the individual/entity named above, and the information may be privileged. If you, the reader of this message, are not the intended recipient or an employee or agent responsible to deliver this message to the intended recipient, you are hereby notified that any dissemination, distribution or copying of this communication is strictly prohibited. If you have received this communication in error, please immediately notify the sender and delete the original message. ============================================================================================================================================================================================================

3 3

Multi-Index: custom iterator
by Sensei 26 Aug '14

26 Aug '14

Dear all, I'm not yet satisfied with my MultiIndex games, so now I am trying to do something that is purely cosmetic. However, I have *no idea* how I can do this. How can I build a custom iterator on a MultiIndex? The objective is simple. As you may recall, I am building a MultiIndex with 128 bits, indexing them by MSB, LSB, and HSB (in the middle). It works like a charm. Now I'd like to write something like this (or similar): auto it = storage.myfind<byMSB>(MSB(value128bits)); for (; i != it.end(); i++) In essence, I'd like to hide the get<> and everything I am using right now (as shown below). So I need an iterator for this data structure: typedef __uint128_t Storage; // Indexing placeholders struct byMSB { }; struct byHSB { }; struct byLSB { }; // Storage type with indexing typedef boost::multi_index::multi_index_container< Storage, boost::multi_index::indexed_by< // Hashed by subject/predicate/object boost::multi_index::hashed_non_unique<boost::multi_index::tag<byMSB>, boost::multi_index::global_fun<Storage, soSub, &Data::msb>>, // 0 boost::multi_index::hashed_non_unique<boost::multi_index::tag<byHSB>, boost::multi_index::global_fun<Storage, soPre, &Data::hsb>>, // 1 boost::multi_index::hashed_non_unique<boost::multi_index::tag<byLSB>, boost::multi_index::global_fun<Storage, soObj, &Data::lsb>> // 2 > > DataStorage; DataStorage storage_; With your suggestions I've achieved to find all items by MSB, but sincerely, now I don't know how to write a custom iterator for this type. The code for finding elements is this: //typedef typename DataStorage::template nth_index<0>::type byHashedIndex; //typedef typename DataStorage::template index<byMSB>::type byHashedIndex; //byHashedIndex &p = storage_.template get<byMSB>(); auto &p = storage_.template get<byMSB>(); auto q = p.equal_range(subject(v)); while (q.first != q.second) { std::cout << " EQID " << *(q.first) << " | " << msb(*(q.first)) << " | " << hsb(*(q.first)) << " | " << lsb(*(q.first)) << std::endl; l.push_back(*(q.first)); q.first++; } Note: I *have* written iterators, but they were much easier (for instance char*). This is far too complex for making my way on my own! From the code above, I guess I have begin() and end() point to an equal_range output .first and .second. But what will the "pointer" I need in the iterator will be? Of course, my first attempt is a complete failure: // Iterator template <class T> class iterator : public std::iterator<std::input_iterator_tag, Storage> { typedef typename DataStorage::template index<T>::type byHashedIndex; byHashedIndex &p; // Default constructor iterator() : p(storage_.get<T>()) { }; // Copy constructor iterator(const iterator& i) : p(i.p) { }; // Pre-increment ++it iterator& operator++() { ++p; return *this; }; // Post-increment it++ iterator operator++(int) {iterator tmp(*this); operator++(); return tmp; }; // Equality bool operator==(const iterator& rhs) { return p == rhs.p; }; // Non-equality bool operator!=(const iterator& rhs) { return p != rhs.p; }; // Access Storage& operator*() { return *p; }; // Difference iterator operator-(int i) { return iterator(p - i); }; // Addition iterator operator+(int i) { return iterator(p + i); }; }; Can you point me in the right direction? Thanks!

2 3

"newbie" Build Boost Matrix
by Ismael Fadiga 25 Aug '14

25 Aug '14

hi all After executing the below sql query in c++, the printed results are: WITH rnum AS (SELECT s.ISN, s.Date, ClosedPrice, row_number() OVER (partition BY s.ISN ORDER BY s.ISN, s.Date DESC) AS rownumber FROM SecurityData s INNER JOIN PortfolioHoldings p ON s.ISN = p.ISN WHERE p.Pfid = 1876) SELECT DISTINCT ISN, Date, ClosedPrice FROM rnum WHERE rownumber <= 250)) //ID Date Price US345 2014-08-17 342 US345 2014-08-16 310 ... FR123 2014-08-17 18.20 FR123 2014-08-16 15 Does anyone know how to build a price matrix for the IDs like:? |342 18.20| MAT=|310 15 | |... ... | Your feedback would be very appreciated Cheers

2 5

[ConceptCheck] Same type concept
by Robert Jones 25 Aug '14

25 Aug '14

I'd like a concept check to check for two types being the same type. I can see how to write such a concept, but this is such an obvious requirement that either there should be one already, or there's some blindingly obvious reason why you never need one, a reason that escapes me. A little guidance would be appreciated. Thanks, Rob.

3 3

Re: [Boost-users] [Chrono] The default BOOST_CHRONO_VERSION is still 1
by DonM 24 Aug '14

24 Aug '14

-------- Original Message -------- Subject: Re: [Boost-users] [Chrono] The default BOOST_CHRONO_VERSION is still 1 From: "Vicente J. Botet Escriba" <vicente.botet(a)wanadoo.fr> Date: 8/23/2014 6:28 AM To: boost-users(a)lists.boost.org > > Le 23/08/14 01:41, DonM a écrit : >> The docs (boost_1_56_0/doc/html/chrono/reference.html) say: >> >> "The default value for BOOST_CHRONO_VERSION will be changed to 2 since Boost 1.55. " >> >> However, it still has the value 1 in both 1.55 and 1.56. >> >> Not a big deal, I just noticed and figured I'd mention it. >> > Hi, > > I must remove this comment as as there is a incompatibility this will break user code. I planned to do a smooth trarnsition, but there were some complains. > > Thanks for pointing this issue, > Vicente Are you saying that you never intend to change the default value? That would be a mistake, in my opinion. Version 2 is much better -- the I/O stuff works. If users need backwards compatibility, they can define version 1, but encourage people to use version 2. Just my $0.02. Don

2 1

[move] Movable but not copyable bug?
by Mostafa 24 Aug '14

24 Aug '14

Given the following code, if (1) is uncommented then it fails to compile under C++03 mode yet works in C++11 mode. If commented out, then it compiles successfully under both modes. (g++ 4.8.2 is being used) Is this behavior expected or a bug? #include <boost/move/core.hpp> #include <boost/move/utility.hpp> struct Foo { Foo(int x, int y) {} Foo(BOOST_RV_REF(Foo) rhs) {} private: //Purposefully declared and not defined. Foo & operator=(Foo); private: BOOST_MOVABLE_BUT_NOT_COPYABLE(Foo) }; template <typename T> struct Bar { Bar() : f(0, 1) {} // (1) // Bar(Bar const & rhs) // : f(rhs.f) // {} Bar(BOOST_RV_REF(Bar) rhs) : f(::boost::move(rhs.f)) {} private: //Purposefully declared and not defined. Bar & operator=(Bar); private: BOOST_COPYABLE_AND_MOVABLE(Bar) private: T f; }; Foo f1() { // (2) // Foo f(0, 1); // return f; // (3) return Foo(0, 1); } Bar<Foo> f2() { return Bar<Foo>(); } int main() { // Foo f( f1() ); Bar<Foo> b(Bar<Foo>()); return 0; }

2 2

BGL: boost::astar_search_no_init
by Georg Gast 24 Aug '14

24 Aug '14

Hi there! Currently i try to implement an astar search with BGL and boost. My graph is infinite, so i searched for an example of astar_search_no_init and found this: http://lists.boost.org/boost-users/2012/03/73707.php I am on gcc-4.9.0 and boost 1.52.0 on linux. I try to compile the above example and get the following error which i cant decipher ... make gcc -std=c++11 example.cpp -o example example.cpp: In function 'int main(int, char**)': example.cpp:274:140: error: no matching function for call to 'boost::associative_property_map<default_map<std::pair<XY, XY>, unsigned int> >::associative_property_map(default_map<std::pair<XY, XY>, unsigned int>)' . weight_map(boost::associative_property_map<default_map<std::pair<XY,XY>,unsigned> >(default_map<std::pair<XY,XY>,unsigned>(1))) I added the code as an attachement. For me it seems that this line is not ok .... but i currently have no clue how to fix it ... try { astar_search_no_init(g, start, distance_heuristic<XYGraph>(goal) , visitor(astar_goal_visitor(goal)) . distance_map(d) . predecessor_map(boost::ref(p)) . weight_map(boost::associative_property_map<default_map<std::pair<XY,XY>,unsigned> >(default_map<std::pair<XY,XY>,unsigned>(1)) // < --- line 274 . vertex_index_map(boost::associative_property_map<std::map<XY,unsigned> >(std::map<XY,unsigned>())) . rank_map(boost::associative_property_map<std::map<XY,unsigned> >(std::map<XY,unsigned>())) . color_map(boost::associative_property_map<std::map<XY,boost::default_color_type> >(std::map<XY,boost::default_color_type>())) . distance_compare(std::less<unsigned>()) . distance_combine(std::plus<unsigned>()) ); with clang 3.4 i get this error line. clang --std=c++11 example.cpp -o ex example.cpp:274:26: error: no matching conversion for functional-style cast from 'default_map<std::pair<XY, XY>, unsigned int>' to 'boost::associative_property_map<default_map<std::pair<XY, XY>, unsigned int> >' . weight_map(boost::associative_property_map<default_map<std::pair<XY,XY>,unsigned> >(default_map<std::pair<XY,XY>,unsigned>(1)) So what ant the author of this code do? Allocate a property map of size 1? Currently i dont see the forrest, there are so many trees in my view .... Any help would be appreciated! Thank you! Georg

1 0

[Chrono] The default BOOST_CHRONO_VERSION is still 1
by DonM 23 Aug '14

23 Aug '14

The docs (boost_1_56_0/doc/html/chrono/reference.html) say: "The default value for BOOST_CHRONO_VERSION will be changed to 2 since Boost 1.55. " However, it still has the value 1 in both 1.55 and 1.56. Not a big deal, I just noticed and figured I'd mention it. Don

2 1

Boost.ASIO calling handler guarantees
by Фёдор Трушкин 23 Aug '14

23 Aug '14

Hello, Dear All, I'm playing with Boost.ASIO framework and failed to find a complete answer on the following question. Under which circumstances is it guaranteed that asynchronous operation completion handler is called? Plainly speaking, is this example code correct? void my_handler(const error_code &ec) { if(!ec) { /* process successful operation */ } else { /* process failed operation */ } try { async_write(port, my_handler2) } catch(...) { // processing failure to execute asynchronous operation } } Obviously here I rely heavily upon the above mentioned guarantee. Looking at least at async_write() implementation, it cannot be relied upon: - async_write executes a chain of boost::asio::detail::write_op() operations: - if asio_handler_allocate() may throw then - write_op::stream_.async_write_some() may throw then - write_op.handler_() might never be called So, either we should never rely on this assumption, or there's a bug in async_write(). Not relying on this assumption what is the reliable way of building applications with Boost.Asio? Sincerely yours, Fedor Trushkin

3 3

Installing 1.56 on Fedora 20
by Robert Jones 22 Aug '14

22 Aug '14

It's been a while since I've installed Boost. Running this command on a completely vanilla Fedora 20 b2 --prefix=~/local/boost-1.56.0 --layout=tagged link=shared threading=multi,single install Finally says... ...failed updating 58 targets... ...skipped 12 targets... ...updated 12214 targets... Is this normal? Thx, Rob.

3 5

exercism.io -- crowd-sourced mentorship C++ track online
by legalize+jeeves＠mail.xmission.com 22 Aug '14

22 Aug '14

[Please do not mail me a copy of your followup] Hi Boost-ers, Katrina Owens has created <http://exercism.io>, a web site designed to help programmers get better at their craft through crowd-sourced mentorship. The whole thing is free and open source and all you need to participate is a github account. I have contributed a basic set of completed exercises to enable the C++ language track. I would love for people from the boost community to participate in the C++ track. I had fun doing the initial set of exercises. Most of them could be completed in under 20 minutes, although the intention is that they increase in difficulty as you progress through them. For each exercise you are presented with the problem statement and a set of Boost.Test unit tests. The goal is to get a program that achieves the function and is expressive and readable. First you get all the tests passing in order to achieve the desired function, but then revise the code to get it to be more expressive and idiomatic in the language. It's that last part where the crowd-sourced mentorship comes into play -- once you've submitted your solution for a problem to the website, you'll be able to view the solutions other people have submitted for the same exercise in the same language. You can mentor them in how to write more expressive, idiomatic C++11 code. Who knows, maybe you'll also improve your C++11 skills by reading feedback from others on your submissions. Feel free to comment here or file an issue on the exercism.io github repository <http://github.com/exercism/exercism.io> if you think the C++ track needs more or better instructions or helpful links. -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

4 5

Serializing std::vector<double>**
by salman arshad 22 Aug '14

22 Aug '14

Hello, I want to serialize std::vector<double>**. I tried but may be I did not look into right places but I can serialize a std::vector<double>* without any problem but not a pointer to a pointer to vector. I think I am doing something really stupid here or missing something. Any help is highly appreciated. Regards, Salman Arshad

2 1

[review] Formal review period for VMD library begins today, Aug 21, and ends Sat, Aug 30
by Steven Watanabe 21 Aug '14

21 Aug '14

AMDG The formal review of the VMD library by Edward Diener starts today, Aug 21st and is scheduled to continue until Aug 30th. About VMD =============== The Variadic Macro Data library is a library of variadic macros which enhance the functionality in the Boost preprocessor library ( Boost PP ). The main focus of the library is the parsing/identifying of a subset of C++ preprocessor data types and of all Boost PP data types. This allows enhanced preprocessor metaprogramming based on the type of macro input. The library may also be seen as a repository for future enhancements to the Boost PP library functionality using variadic macros. Where to get it =============== The library is available on github at https://github.com/eldiener/variadic_macro_data Review guidelines ================= Reviews should be submitted to the developer list (boost(a)lists.boost.org) with '[vmd]' in the subject. Or if you don't wish to for some reason, you can send them privately to me. If so, please let me know whether or not you'd like your review to be forwarded to the list. For your review you may wish to consider the following questions: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? And finally, every review should answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. In Christ, Steven Watanabe

1 0

A library for "string chains"?
by legalize+jeeves＠mail.xmission.com 21 Aug '14

21 Aug '14

[Please do not mail me a copy of your followup] For a motivating example, see this gist: <https://gist.github.com/LegalizeAdulthood/7b67968bd93fbd4f9dbb> It uses boost::mapped_file to map a mail message into memory and then proceeeds to parse it. This is simply an example, but I think this hacked up parser comes fairly close to handling the full RFC2822 message, ignoring MIME extensions. <https://tools.ietf.org/html/rfc2822> I hacked it up from memory of mail message format rules and a single example message, so don't consider it production quality :-). The intention here is to parse a file without copying it's input text into any buffers. Notice that this parser builds structure from a buffer by identifying interesting substrings as (b,e) pointer pairs. A more traditional approach would have involved at least 2 more copies: one that gets the data from the file system into the stream buffer and another one that copies the data from the stream buffer into a std::string. The extra copying can take significant amounts of time when processing thousands of mail messages. Mail messages tend to be short, so mapping them into memory is not such a big deal. Obviously there is a lifetime relationship between the mapped file (the source character buffer) and the associated strings. For my use case, I'm not interested in being able to write to the strings, just read from them. (If you look closely you'll see that I "cheat" and add a few segments into my string that are associated with const char* C-style strings, but they too are read-only.) I'm interested to know if anyone is aware of a "string chain" library that provides a (read-only) API similar to std::string, but is fundamentally just managing (b,e) pointer pairs into some larger buffer. Boost.Test has a funky string class hiding in it called basic_cstring, but it wasn't created for this purpose. -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

6 12

[Serialization] 1.56.0 - unregistered_class exception while using EXPORTs
by Todd Seiler 20 Aug '14

20 Aug '14

I've been pulling my hair out for a couple of days trying to get this to work. When I serialize something from a base pointer, it throws an "unregistered_class" exception. I know the type of object that's being serialized and that class has "BOOST_CLASS_EXPORT_KEY" in the header and "BOOST_CLASS_EXPORT_IMPLEMENT" in the cpp file with the same name. In the save and load functions I also have: boost::serialization::void_cast_register( static_cast<Derived*>(NULL), static_cast<Base*>(NULL)); The base class is an abstract base class with one pure virtual function method. But here are the differences: 1) I tried using the "ASSUME_ABSTRACT....." macro. That didn't do anything for me. 2) The abstract base class also has a cpp file with some code in it. I'm not sure if that matters or not... Here's the thing. I can get the derived class's "save" method to be called with this code: std::ofstream o(case_path_ + "/" + file_name); if (o.good()) { // MUST HAVE THIS boost::serialization::void_cast_register<Derived, Base>( static_cast<Derived*>(NULL), static_cast<Base*>(NULL)); boost::archive::polymorphic_text_oarchive oa(o); boost::archive::polymorphic_oarchive & oa_interface = oa; oa_interface << base_ptr; } Having the void_cast_register() there sort of defeats the purpose though. I shouldn't need to pre-register them. In all the examples, I see the void_cast_register() inside of the "save" and "load" methods, which is what I have already. All my serialization code resides in cpp files. Also, the serialization code resides in a static lib. But the archive creation and the action to serialize is performed in a dynamic lib. I am also using polymorphic archives everywhere. I've also forced template instantiation of all serialization code and polymorphic archive interface stuff. Any clue?

3 4

[Serialization] 1.56.0 - How to serialize polymorphic base class data without derived data
by Todd Seiler 20 Aug '14

20 Aug '14

Basically, I'm looking to serialize a base class that's polymorphic, from a base class pointer, without it calling the derived class's serialize functions... Here is my setup: class RenderableMesh : public BasicMesh, public DynamicRenderable; Basically, I don't want it to serialize RenderableMesh or DynamicRenderable given a "basicMesh" pointer. The reason is because "DynamicRenderable" derives from a class inside the "Ogre3D" engine which does a bunch of memory management automatically. Basically, when I compile, it tells me it's missing operator delete, because Ogre overloads operator new or something I don't completely understand... I'm okay with serializing the BasicMesh, and then just recreating the RenderableMesh when it's deserialized. Which is what I'm going to have to do anyways because I don't want to change the Ogre3D SDK header files. It's probably super simple... If I don't implement it, it complains telling me the derived class is not registered... Which is correct. If I try to implement, it says operator delete is missing. Any ideas?

1 0

[build] Cannot build from develop anymore
by Marcel Raad 19 Aug '14

19 Aug '14

Hi, last time I tried to build Boost from develop (a few weeks ago) with MSVC, it worked perfectly. Now I get the following errors on two different Windows 7 machines with both MSVC14 CTP3 and MSVC12.3: boost/tools/build/src/build\virtual-target.jam:1099: in virtual- target.register-actual-name from module virtual-target error: Duplicate name of actual target: <pstage\lib>libboost_system-vc140- mt-1_57.lib error: previous virtual target { common%common.copy-libboost_system-vc140- mt-1_57.lib.STATIC_LIB { msvc%msvc.archive-libboost_system-vc140- mt-1_57.lib.STATIC_LIB { msvc%msvc.compile.c++-error_code.obj.OBJ { error_code.cpp.CPP } } } } error: created from ./stage-proper error: another virtual target { common%common.copy-libboost_system-vc140- mt-1_57.lib.STATIC_LIB { msvc%msvc.archive-libboost_system-vc140- mt-1_57.lib.STATIC_LIB { msvc%msvc.compile.c++-error_code.obj.OBJ { error_code.cpp.CPP } } } } error: created from ./stage-proper error: added properties: <asynch-exceptions>on error: removed properties: <asynch-exceptions>off boost/tools/build/src/build\virtual-target.jam:484: in actualize-no-scanner from module object(file-target)@14375 boost/tools/build/src/build\virtual-target.jam:134: in class@virtual- target.actualize from module object(file-target)@14375 boost/tools/build/src\build-system.jam:720: in load from module build-system boost\tools\build\src/kernel\modules.jam:289: in import from module modules boost\tools\build\src/kernel/bootstrap.jam:139: in boost-build from module boost\boost-build.jam:17: in module scope from module Does anyone have any idea what Boost.Build is trying to tell me?

1 0

Re: [Boost-users] boost serialisation, just including shared_ptr.hpp causes compile error on Linux/gcc 4.5
by avib369 . 19 Aug '14

19 Aug '14

Adding the two missing includes has indeed fixed the problem, as suggested in https://svn.boost.org/trac/boost/ticket/10348 #include <boost/serialization/singleton.hpp> #include <boost/serialization/extended_type_info.hpp> Thanks, Avi

1 0

support for OpenMPI 64bit in modular-boost?
by Alle Meije Wink 19 Aug '14

19 Aug '14

Using the git repository (currently 1.57) of modular boost in Windows 7, compiling with MinGW64 and masm/ml64 (from the WDK v7) is successful but with the following warnings at the start: (1) warning: Graph library does not contain MPI-based parallel components. note: to enable them, add "using mpi ;" to your user-config.jam (2) warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. warning: No python installation configured and autoconfiguration note: failed. See http://www.boost.org/libs/python/doc/building.html note: for configuration instructions or pass --without-python to note: suppress this message and silently skip all Boost.Python targets After installing Open MPI 64-bit ( Windows installer of version 1.6.2 http://www.open-mpi.org/software/ompi/v1.6/downloads/OpenMPI_v1.6.2-2_win64… ), including adding it to the system-wide path, I have tried to re-build boost with MPI by, after running bootstrap gcc adding the line using mpi ; to the file project-config.jam in the boost directory (there is no file user-config.jam or a directory tools/build/v2 in the latest version or so it seems). Now the b2 command produces this output: The system cannot find the path specified. The system cannot find the path specified. The system cannot find the path specified. The system cannot find the path specified. The system cannot find the path specified. MPI auto-detection failed: unknown wrapper compiler mpic++ Please report this error to the Boost mailing list: http://www.boost.org You will need to manually configure MPI support. It continues to build the boost libraries, but still without MPI support. I am advised to manually configure MPI, but I'm pretty sure that is what I have just done. (the binaries are in the directory C:\Users\amwink\usr\local\OpenMPI_v1.6.2-x64\bin -- no spaces) Does anyone know what the problem is here? Is something wrong with this particular mpic++ binary that boost cannot handle? Happy to provide outputs/logs if that helps.

2 1

boost serialisation, just including shared_ptr.hpp causes compile error on Linux/gcc 4.5
by avib369 . 18 Aug '14

18 Aug '14

I did not see boost serialisation in the list of lib that had changed. So its surprising that it now broken ? It appears simply including it cause problems #include <boost/serialization/shared_ptr.hpp> cause gcc.compile.c++ bin/gcc-4.5/debug/test/TestStr.o In file included from /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr.hpp:28:0, from test/TestStr.cpp:27: /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp: In static member function ‘static const boost::serialization::extended_type_info* boost::serialization::shared_ptr_helper<SPT>::non_polymorphic::get_object_type(U&)’: /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:107:22: error: ‘singleton’ is not a member of ‘boost::serialization’ /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:110:13: error: expected ‘(’ before ‘>’ token /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:110:14: error: ‘::get_const_instance’ has not been declared /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp: In static member function ‘static const boost::serialization::extended_type_info* boost::serialization::shared_ptr_helper<SPT>::polymorphic::get_object_type(U&)’: /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:117:20: error: ‘singleton’ is not a member of ‘boost::serialization’ /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:120:13: error: expected ‘(’ before ‘>’ token /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:120:14: error: ‘::get_const_instance’ has not been declared /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp: In member function ‘void boost::serialization::shared_ptr_helper<SPT>::reset(SPT<T>&, T*)’: /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:152:30: error: invalid use of incomplete type ‘const struct boost::serialization::extended_type_info’ /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:42:7: error: forward declaration of ‘const struct boost::serialization::extended_type_info’ /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:167:30: error: invalid use of incomplete type ‘const struct boost::serialization::extended_type_info’ /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:42:7: error: forward declaration of ‘const struct boost::serialization::extended_type_info’ /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:168:30: error: invalid use of incomplete type ‘const struct boost::serialization::extended_type_info’ /var/tmp/ma0/boost/boost_1_56_0/boost/serialization/shared_ptr_helper.hpp:42:7: error: forward declaration of ‘const struct boost::serialization::extended_type_info’ "g++" -ftemplate-depth-128 -fPIC -O0 -fno-inline -Wall -g -fPIC -DDEBUG -I"../ACore/src" -I"/var/tmp/ma0/boost/boost_1_56_0" -c -o "bin/gcc-4.5/debug/test/TestStr.o" "test/TestStr.cpp" Are there any workarounds ? Ta, Avi

4 3

[BGL] Algorithm Objects
by Pierre Talbot 18 Aug '14

18 Aug '14

Hello, In the BGL documentation (challenge section, see http://www.boost.org/doc/libs/1_56_0/libs/graph/doc/challenge.html) a bullet point is: "Explore the use of Algorithm Objects as an alternative to the current approach with visitors." Do you have any links or explanations about the "Algorithm Objects" concept? Thanks, Pierre Talbot

2 1

Boost.Xpressive
by Goran 17 Aug '14

17 Aug '14

Hi all, I'll have to check large CSV text files (up to several GB) and check them with Xpressive. As far as I can see, the only way to do is to load the whole file into a std::string and hand over to Xpressive. I don't want to do that because my files are too big. So, how can I open a CSV file in text mode, get bidirectional iterators and hand them over to Xpressive? Regards Goran

6 5

[Serialization] 1.56.0 - polymorphic archive saving std::shared_ptr<>, no member named "get_helper"
by Todd Seiler 17 Aug '14

17 Aug '14

I'm trying to serialize a std::shared_ptr using a polymorphic archive interface, but it complains about no "get_helper". Specifically clang states: "<removed_for_posting>/boost_1_56_0/boost/serialization/shared_ptr.hpp:253:21: No member named 'get_helper' in 'boost::archive::polymorphic_iarchive'" I tried including "boost/serialization/shared_ptr_helper.hpp", but this didn't seem to have what I needed. I did see the new stuff in "boost/serialization/shared_ptr.hpp" regarding std::shared_ptr<>, so I'm hopeful. Most of what I'm doing requires the serialization code to be inside of dll's or dylibs, so I believe I'm going down the correct path in using polymorphic archives... void save(std::shared_ptr<developer> p) { std::ofstream of("archiv.txt"); boost::archive::polymorphic_text_oarchive oa(of); boost::archive::polymorphic_oarchive & oa_interface = oa; oa_interface << p; } void load() { std::ifstream i("archiv.txt"); boost::archive::polymorphic_text_iarchive ia(i); boost::archive::polymorphic_iarchive & ia_interface = ia; std::shared_ptr<developer> p; ia_interface >> p; std::cout << p->getName() << std::endl; std::cout << p->age() << std::endl; std::cout << p->language() << std::endl; std::cout << p->getLangVer() << std::endl; } The compiler error specifically points to this function in shared_ptr.hpp template<class Archive, class T> inline void load( Archive & ar, std::shared_ptr< T > &t, const unsigned int /*file_version*/ ){ // The most common cause of trapping here would be serializing // something like shared_ptr<int>. This occurs because int // is never tracked by default. Wrap int in a trackable type BOOST_STATIC_ASSERT((tracking_level< T >::value != track_never)); T* r; ar >> boost::serialization::make_nvp("px", r); boost::serialization::shared_ptr_helper<std::shared_ptr> & h = ar.template get_helper< shared_ptr_helper<std::shared_ptr> >(); h.reset(t,r); } Any suggestions?

2 1

Do not understand about creating a vector of vector using Boost::interprocess libraries
by 张国熙 16 Aug '14

16 Aug '14

Dear everyone, I've just begun learning to use IPC in boost. Here I want to create a vector of vector<std::complex<double>>, that is to say, a matrix of complex. I read the section "containers of containers" in manual, and try to write something as the following: #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <boost/interprocess/managed_shared_memory.hpp> #include <complex> typedef boost::interprocess::allocator<std::complex<double>, boost::interprocess::managed_shared_memory::segment_manager> ComplexAllocator; typedef boost::interprocess::vector<std::complex<double>,ComplexAllocator> ComplexVector; typedef boost::interprocess::allocator<ComplexVector, boost::interprocess::managed_shared_memory::segment_manager> ComplexVectorAllocator; typedef boost::interprocess::vector<ComplexVector,ComplexVectorAllocator> ComplexMatrix; int main () { struct shm_remove { shm_remove() { boost::interprocess::shared_memory_object::remove("MySharedMemory"); } ~shm_remove(){ boost::interprocess::shared_memory_object::remove("MySharedMemory"); } } remover; boost::interprocess::create_only_t tag; boost::interprocess::managed_shared_memory segment(tag, "MySharedMemory", 65536); const ComplexVectorAllocator alloc_inst (segment.get_segment_manager()); ComplexMatrix *m = segment.construct<ComplexMatrix> ("M")(alloc_inst); m->resize(4); segment.destroy<ComplexMatrix>("M"); return 0; } However, it could not compile. And the error message is too long for me to understand. Is there anyone knowing how to fix this? Best wishes, Guoxi

2 1

from: giridhar
by giridhar 16 Aug '14

16 Aug '14

Hi boost http://taigamewap.net/draw.php?byytqavgmq2568uya giridhar

1 0

Error Messages when compiling Boost with VS2008 Professional on Windows 7
by Danny K 15 Aug '14

15 Aug '14

I regularly compile boost with bzip2 and zlib for use under Visual Studio. Usually it is not an issue but with the last couple of versions I get a strange error message. I was hoping someone might tell me what I am doing wrong or if it is nothing to worry about. I get the error message: "The system cannot find the path specified." I've search the boost forums and the web and can't find any traffic about this problem. the output of one of the compiler statements: compile-c-c++ bin.v2\libs\atomic\build\msvc-9.0\debug\address-model-64\architecture-x86\link-static\threading-multi\lockpool.obj The system cannot find the path specified. lockpool.cpp msvc.archive bin.v2\libs\atomic\build\msvc-9.0\debug\address-model-64\architecture-x86\link-static\threading-multi\libboost_atomic-vc90-mt-gd-1_56.lib The system cannot find the path specified. common.copy D:\id\vs2008\x64\lib\boost-1_56\libboost_atomic-vc90-mt-gd-1_56.lib The error message is printed throughout the output of the build. My build command within the "Visual Studio 2008 x64 Command Prompt. "d:/bld/build/boost_1_56_0/tools/build/src/engine/bin.ntx86_64/b2.exe " -sZLIB_SOURCE="D:/bld/build/zlib-1.2.8" -sBZIP2_SOURCE="D:/bld/build/bzip2-1.0.6" --prefix="D:/bld/install/vs2008" --libdir="D:/bld/install/vs2008/vs2008/x64/lib/boost-1_56" --includedir="D:/bld/install/vs2008/include" toolset=msvc-9.0 --build-type=minimal --layout=versioned architecture=x86 address-model=64 -a install Any suggestions/thoughts? As always any help is greatly appreciated. wr, Danny K I've attached the entire log that resulted from compiling boost.

1 0

Globbing library?
by Andrew Marlow 15 Aug '14

15 Aug '14

Hello everybody, Is there a globbing facility in boost? If not, are there any plans to add one? Please note that globbing is related to matching strings that correspond to file system objects functionality is neither regular expressions, nor is it file system related. Therefore it does not belong in regexp, expressive or bfs. IMO. Globbing is pattern matching using conventions that grew up with unix but have been widely copied to other operating systems and environments. The rules for the patterns are very different to regular expressions and somewhat simpler. I have written a directory iterator for my own use and I currently employ boost regexp for file name matching on unix. But i would very much prefer that it use globbing. The code is portable, via ifdefs, and in the windows branch I am able to use true globbing due to a facility in the win32 API.

5 10

[1.56] PDF documentation available
by John Maddock 14 Aug '14

14 Aug '14

The PDF build of Boost's documentation for 1.56 is now available from the usual address: https://sourceforge.net/projects/boost/files/boost-docs/1.56.0/ Note that it includes only the subset of Boost libraries whose documentation is quickbook/docbook based. John Maddock.

3 2

catch real time signals
by Halim DJERROUD 14 Aug '14

14 Aug '14

hi, I try to intercept real-time signals (SIGMIN + 1, SIGMIN +2 ...) it works when I send a signal (kill -35 PID) it works well only if i send one signal, when i send another signal or same signal second time (kill -35 PID) the pogram does not intercept the signal I feel that run () stops the service after having received the first signal Thank you for your help, Here are the code: #define SIG1 (SIGRTMIN + 1) #define SIG1 (SIGRTMIN + 2) ... class Agent { ... signal_handler(const boost::system::error_code& error, int signal_number) {...} ... } ... boost::asio::signal_set signals(io_serv); signals.add(SIG1) signals.add(SIG2) ... signals.async_wait( boost::bind(&Agent::signal_handler, this, boost::asio::placeholders::error, boost::asio::placeholders::signal_number)); io_serv.run(); for (;;) { std::this_thread::yield(); } (I use Linux and g++) -- Merci d'avance Halim DJERROUD

2 2

[boost::interprocess] named_recursive_mutex lock owner identification
by Frank Bergemann 14 Aug '14

14 Aug '14

2 1

Boost Library Writers Workshop at CPP Con 2014
by Robert Ramey 14 Aug '14

14 Aug '14

Have you been lurking out there in cyberspace all these years? Slaving away on your fantastic new library for boost? Stuck, discouraged, concerned about getting ripped apart on the mailing list? Well, this is for you !!!! The Boost Library Writers Workshop http://rrsd.com/blincubator.com/open-content/ . Share your library and get it critiqued by you peer group - other unsung authors battling the same daemons. Best of all you can attend this workshop without being registered at the conference - to attend this workshop all you have to do is ... attend!. That's right, it's absolutely free. That's right free. And not free like in free software. Really free like "free beer". (note: there is no free beer). So if you're in the area and you want to get your library off your chest because it's weighing you down, keeping you awake, ruining your love life attend this workshop. Spaces are limited so signup now at the above web page. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Library-Writers-Workshop-at-CPP-Co… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

boost::serialization: 'serialize' is not a member of 'Eigen::internal::workaround_msvc_stl_support<T>'
by LynnC 13 Aug '14

13 Aug '14

Boost 1.50 MSVS 2010 My problem occurs when I attempt to serialize pcl::PointCloud<pcl::PointXYZ> g...specifically g.points which is std::vector<Point, Eigen::aligned_allocator<Point> > pcl::PointCloud<Point>::points. I have the following code: #ifndef SERIALIZATIONSUPPORT_H #define SERIALIZATIONSUPPORT_H #include <pcl/point_cloud.h> #include <pcl/io/pcd_io.h> #include <pcl/point_types.h> // needed for pcl::PointXYZ Point #include <boost/serialization/base_object.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/list.hpp> #include <boost/serialization/assume_abstract.hpp> #include <boost/serialization/vector.hpp> typedef pcl::PointXYZ Point; namespace boost { namespace serialization { template<class Archive> void serialize(Archive & ar, pcl::PointCloud<Point>& g, const unsigned int version) { ar & g.points; } template<class Archive> void serialize(Archive & ar, Point& g, const unsigned int version) { ar & g.getVector3fMap().data()[0]; ar & g.getVector3fMap().data()[1]; ar & g.getVector3fMap().data()[2]; } } // namespace serialization } // namespace boost #endif /* SERIALIZATIONSUPPORT_H */ Error received: error C2039: 'serialize' : is not a member of 'Eigen::internal::workaround_msvc_stl_support<T>' Special notes...no problems with my code when compiling on Ubuntu 12.04 LTS using Boost 1.48. Only a problem when compiling on Windows. Any idea as to why I would be receiving this? I already have a method for serializing Point. Shouldn't that be enough? -- View this message in context: http://boost.2283326.n4.nabble.com/boost-serialization-serialize-is-not-a-m… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

composite_key with array member
by Uthpal Urubail 13 Aug '14

13 Aug '14

I am looking for a container where I have to use 5-10 keys to get the value. I am trying to write something like below.. Can some one help to solve this? struct entry { int a[10]; int id; }; using boost::multi_index_container; using namespace boost::multi_index; typedef multi_index_container< entry, indexed_by< ordered_non_unique< composite_key< entry, member<entry,unsigned int,&entry::a> ???? > >, ordered_unique< member<entry,unsigned int,&entry::id> > > > book; Regards, UJ

2 1

[BGL] Question about using remove_edge() in boost graph library
by Yi-Ping Huang 12 Aug '14

12 Aug '14

Dear boost-users: I just start learning boost graph library and have a basic problem on using the remove_edge function in boost graph library. I would like to remove an edge in a multigraph. For a graph with two edges connect vertice 0 and 1, I would like to remove one of them, but kept the other. According to the user guide, remove_edge(u ,v , g) removes all occurrences of (u ,v). So I should use remove_edge(e ,g) instead. Here, e is a valid edge descriptor. For a single graph, g, I am able to perform both remove_edge(u ,v , g) and remove_edge(e ,g) operation. However, when I want to generalize the implementation to fit my need by putting graphs in a vector container, I got segmentation fault for remove_edge(e ,graph_list[0]). (The compiler show no warning message.) On the other hand, remove_edge(u,v,g) works perfectly. I am not sure what's the difference between those two syntax causes this problem. I really want to make remove_edge(e,g) and vector container work at the same time. So any suggestion that can help my bypass this difficulty is appreciated. Thanks a lot!! Yi-Ping

1 0

Allocation/deallocations during boost serialization (tracking help?)
by miles_c＠verizon.net 12 Aug '14

12 Aug '14

1 0

asio::ip::tcp iostream wrong byte count read for last packet
by Steve Coleman 12 Aug '14

12 Aug '14

I just started out with Boost and was writing a little binary file transfer app and ran into a little problem, so I would appreciate if someone could kindly point out what I am doing wrong here. My problem is in getting the correct byte count read in the final packet received. My last frame always returns the size of the buffer, not the number of bytes read into the buffer. Isn't iostream::gcount(() meant for this? If not, what is the correct 'Boost' way of doing this? int spool_binary_data() { boost::asio::ip::tcp::endpoint dataServerEndpoint(boost::asio::ip::tcp::v4(), PMMS_TRANSFER_PORT_NUMBER); boost::asio::ip::tcp::acceptor acceptor(dataServer, dataServerEndpoint); boost::asio::ip::tcp::iostream dataServerStream; acceptor.accept(*dataServerStream.rdbuf()); char buffer[2048]; std::streamsize nbytes = sizeof(buffer); FILE * pFile = fopen ("binary.out","w"); // count = getavailable(this->native_socket) ?? // stream->rdbuf()->available() ?? while ( dataServerStream.read((char*)&buffer, nbytes) ) { int bytes_read = dataServerStream.gcount(); // always 2048 std::cout << "bytes read " << bytes_read << std::endl; fwrite(buffer,1,bytes_read,pFile); } dataServerStream.close(); fclose(pFile); }

2 3

Basic question about using remove_edge() in boost graph library
by Yi-Ping Huang 11 Aug '14

11 Aug '14

Dear boost-users: I just start learning boost graph library and have a basic problem on using the remove_edge function in boost graph library. I would like to remove an edge in a multigraph. For a graph with two edges connect vertice 0 and 1, I would like to remove one of them, but kept the other. According to the user guide, remove_edge(u ,v , g) removes all occurrences of (u ,v). So I should use remove_edge(e ,g) instead. Here, e is a valid edge descriptor. For a single graph, g, I am able to perform both remove_edge(u ,v , g) and remove_edge(e ,g) operation. However, when I want to generalize the implementation to fit my need by putting graphs in a vector container, I got segmentation fault for remove_edge(e ,graph_list[0]). I really want to make remove_edge(e,g) and vector container work at the same time. So any suggestion that can help my bypass this difficulty is appreciated. Thanks a lot!! Yi-Ping *************************Here is the complete code************************* #include <iostream> #include <utility> #include <algorithm> #include <vector> #include "boost/graph/graph_traits.hpp" #include "boost/graph/adjacency_list.hpp" using namespace boost; typedef adjacency_list<vecS, vecS, undirectedS> UndirectedGraph; typedef boost::graph_traits<UndirectedGraph>::edge_iterator edge_iterator; int graph_show(UndirectedGraph &g); int main(int argc, char *argv[]) { UndirectedGraph g; typedef boost::graph_traits<UndirectedGraph>::edge_descriptor edge_descriptor; edge_descriptor ed; std::vector<edge_descriptor> edge_list; std::vector<std::vector<edge_descriptor> > graph_edge_list; std::vector<UndirectedGraph> graph_list; int nb=0; int Nl=4; bool inserted; while(nb<Nl) { tie(ed,inserted)=add_edge(nb,nb+1,g); edge_list.push_back(ed); tie(ed,inserted)=add_edge(nb,nb+1,g); edge_list.push_back(ed); graph_edge_list.push_back(edge_list); nb=nb+1; graph_list.push_back(g); } std::cout<<"size of the graph vector is: "<<graph_list.size()<<std::endl; remove_edge(graph_edge_list[0][0],graph_list[0]);//This is where the problem shows. //I got Segmentation fault (core dumped) //remove_edge(0,1,graph_list[0]); /*Remove edges by assigning vertices works fine, but that is not what I need.*/ for (int ig = 0; ig < Nl; ++ig) { std::cout<<"graph#"<<ig<<std::endl; std::cout<<"Size of edge_list is: "<<graph_edge_list[ig].size()<<std::endl; graph_show(graph_list[ig]); } std::cout<<"Success"<<std::endl; return 0; } int graph_show(UndirectedGraph &g) { std::cout<<"Number of edges is : "<<boost::num_edges(g)<<std::endl; std::cout<<"Number of vertices is : "<<boost::num_vertices(g)<<std::endl; std::pair<edge_iterator,edge_iterator> ei=edges(g); for (edge_iterator edge_iter = ei.first; edge_iter!=ei.second; ++edge_iter) { std::cout<<"("<< boost::source(*edge_iter,g)<<","<<boost::target(*edge_iter,g)<<")"<<std::endl; } typedef boost::graph_traits<UndirectedGraph>::vertex_iterator iter_v; std::cout<<"vertices(g)={ "; for (std::pair<iter_v,iter_v> p = vertices(g); p.first != p.second; ++p.first) { std::cout<< *p.first; std::cout<<" "; } std::cout<<"}"<<std::endl; return 0; }

1 0

[String algorithms] User defined finders and predicates
by Aaron Levy 11 Aug '14

11 Aug '14

Are there good examples of writing user defined finders and predicates for functions such as find_token? Aaron

1 0

Boost 1.56.0 has been released
by Marshall Clow 11 Aug '14

11 Aug '14

Release 1.56.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains one new library and numerous enhancements and bug fixes for existing libraries. === Modularization === Boost version control has migrated to a system using git submodules. This shouldn't make too much of a difference to users, although the directory structure is now a bit different. Parts of some libraries have been moved into different modules, and several new modules have been extracted from existing code. All header paths should remain the same. The new modules are: • Assert: Customizable assert macros. Maintained by Peter Dimov. • Core: Core utilities used by other libraries, with minimal dependencies. Maintained by Peter Dimov, Glen Fernandes and Andrey Semashev. • Lexical_Cast: General literal text conversions, such as an int represented a string, or vice-versa, from Kevlin Henney. • Throw_Exception: A common infrastructure for throwing exceptions from Boost libraries, from Emil Dotchevski. • Winapi: Windows API declarations without <windows.h>, for internal Boost use. === New Libraries === • Align: Memory alignment functions, allocators, and adaptors, from Glen Fernandes. • Type_Index: Runtime/Compile time copyable type info, from Antony Polukhin. For details, including download links, see http://www.boost.org/users/news/version_1.56.0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.56.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Vladimir Prus Rene Rivera Marshall Clow Eric Niebler Daniel James Beman Dawes

8 10

[asio] multiple simultaneous async_read calls
by bbxiong 11 Aug '14

11 Aug '14

Hello, all, If i write some code like this: boost::asio::async_read(socket_, bosot::asio::buffer(buffer1_.data(), len1, handler1); boost::asio::async_read(socket_, boost::asio::buffer(buffer2_.data(), len2, handler2); Will asio guarantee len1 bytes received by the first async_read, then schedule async_read2? or the result is undefined(like several bytes filled into buffer1, then next several bytes into buffer, then next several bytes into buffer1)? if the result is undefined, why asio don't add a check here? Thanks all in advance!

5 8

[Boost.Thread] Compile error: boost::promise<T>::set_value(const T&) doesn't exist
by Rob Desbois 10 Aug '14

10 Aug '14

Hi all, I'm having problems compiling with Boost.Thread's futures I can't seem to pass anything but a primitive type into make_ready_future. I've had problems with other parts of Thread (packaged_task, promise, unique/shared_future) that have produced horrendously unhelpful compile errors. Here is a minimal testcase: #include <boost/thread/future.hpp> struct foo { foo(int i_): i(i_) {} int i; }; int main() { // A const future ref isn't much use, but I needed to prove // the problem wasn't me trying to copy a unique_future const boost::unique_future<foo>& fut = boost::make_ready_future( foo(42) ); } With `BOOST_THREAD_USES_MOVE` defined before including the Boost.Future header I get the following error with gcc 4.8.2 and Boost 1.55 (full output at http://pastebin.com/0sePWBWr) ../../deps/boost/include/boost/thread/future.hpp:3634:5: error: no matching function for call to ‘boost::promise<foo>::set_value(const foo&)’ p.set_value(boost::forward<future_value_type>(value)); ^ There seems to be no overload of promise::set_value() that takes a const lvalue reference. Looking at `promise` and `future_traits` in `future.hpp` it seems that the const lvalue ref overload will only exist when `BOOST_NO_CXX11_RVALUE_REFERENCES` is undefined. That makes no sense to me however...surely the const lvalue ref overload is needed precisely when there are no rvalue references? (Note this happens even if I pass a mutable lvalue ref to `make_ready_future()`). If I don't define `BOOST_THREAD_USES_MOVE` it fails compilation with the following error (full output at http://pastebin.com/jBwiJLeC) ../../deps/boost/include/boost/thread/detail/move.hpp:183:54: error: no matching function for call to boost::unique_future<foo>::unique_future(boost::unique_future<foo>)’ #define BOOST_THREAD_MAKE_RV_REF(RVALUE) RVALUE.move() ^ Have I missed something? I'm unable to switch to C++11 mode unfortunately, but this seems such a big problem I can only assume I've done something wrong. I still get similar compile errors trying with Clang 3.4, and also with Boost 1.54 (g++ or Clang). -- Rob Desbois http://theotherbranch.wordpress.com/

2 1

[Boost.Range] Filtering elements at even position
by Arindam Mukherjee 10 Aug '14

10 Aug '14

I am trying to create a range consisting of elements in a container at only even indexes. Is there a way to write something like: vec | boost::adaptors::indexed(0) | some_adaptor_to_choose_even_indexes I tried with boost::adaptors::filtered, but the index information is only present in iterators of the generated range, not in its value_type so it is not available in chained adaptors. - Arindam

2 1

Boost 1.56.0 compilation error in iterator_range
by gast128 10 Aug '14

10 Aug '14

I get a compilation error with vc10, iterator_range and a (const) unordered_map (the beta candidate 2 was still ok I think): #include "stdafx.h" #include <boost/range/iterator_range.hpp> #include <boost/unordered_map.hpp> int _tmain(int /*argc*/, _TCHAR* /*argv*/[]) { typedef boost::unordered_map<int, int> Container; typedef Container::const_iterator ContainerIterator; typedef boost::iterator_range<ContainerIterator> ContainerIteratorRange; const Container cnt; ContainerIteratorRange rng(cnt.cbegin(), cnt.cend()); return 0; } This gives C2248: 'boost::unordered::iterator_detail::c_iterator<Node,ConstNodePointer>::iterator' cannot access private typedef declared in class etc. (note had to cut due to 'you have lines longer than 80 characters. Fix that.' in Gmane)

2 3

[boost] [1.55] numerous warnings with gcc 4.8.3 on Linux
by Marius Lazer 08 Aug '14

08 Aug '14

All the warnings are similar to this (warning: typedef âboost_concept_check185â locally defined but not used [-Wunused-local-typedefs]): ./boost/range/algorithm/equal.hpp: In function âbool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&, BinaryPredicate)â: ./boost/concept/detail/general.hpp:71:20: warning: typedef âboost_concept_check185â locally defined but not used [-Wunused-local-typedefs] BOOST_PP_CAT(boost_concept_check,__LINE__) ^ ./boost/preprocessor/cat.hpp:29:34: note: in definition of macro âBOOST_PP_CAT_Iâ # define BOOST_PP_CAT_I(a, b) a ## b ^ ./boost/concept/detail/general.hpp:71:7: note: in expansion of macro âBOOST_PP_CATâ BOOST_PP_CAT(boost_concept_check,__LINE__) ^ ./boost/concept/assert.hpp:44:5: note: in expansion of macro âBOOST_CONCEPT_ASSERT_FNâ BOOST_CONCEPT_ASSERT_FN(void(*)ModelInParens) ^ ./boost/range/concepts.hpp:92:45: note: in expansion of macro âBOOST_CONCEPT_ASSERTâ #define BOOST_RANGE_CONCEPT_ASSERT( x ) BOOST_CONCEPT_ASSERT( x ) ^ ./boost/range/algorithm/equal.hpp:185:13: note: in expansion of macro âBOOST_RANGE_CONCEPT_ASSERTâ BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> )); ^ ./boost/concept/detail/general.hpp:71:20: warning: typedef âboost_concept_check186â locally defined but not used [-Wunused-local-typedefs] BOOST_PP_CAT(boost_concept_check,__LINE__) ^ ./boost/preprocessor/cat.hpp:29:34: note: in definition of macro âBOOST_PP_CAT_Iâ # define BOOST_PP_CAT_I(a, b) a ## b ./boost/concept/detail/general.hpp:71:7: note: in expansion of macro âBOOST_PP_CATâ BOOST_PP_CAT(boost_concept_check,__LINE__) ^ ./boost/concept/assert.hpp:44:5: note: in expansion of macro âBOOST_CONCEPT_ASSERT_FNâ BOOST_CONCEPT_ASSERT_FN(void(*)ModelInParens) ^ ./boost/range/concepts.hpp:92:45: note: in expansion of macro âBOOST_CONCEPT_ASSERTâ #define BOOST_RANGE_CONCEPT_ASSERT( x ) BOOST_CONCEPT_ASSERT( x ) ^ ./boost/range/algorithm/equal.hpp:186:13: note: in expansion of macro âBOOST_RANGE_CONCEPT_ASSERTâ BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> )); Thanks, Marius Marius S. Lazer ICAP North America Inc. Harborside Financial Center 1100 Plaza 5 Jersey City, NJ 07311-4996 Office: 212-815-7470 Email: Marius.Lazer(a)us.icap.com ********************************************************************** This communication and all or some of the information contained therein may be confidential and is subject to our Terms and Conditions. If you have received this communication in error, please destroy all electronic and paper copies and notify the sender immediately. Unless specifically indicated, this communication is not a confirmation, an offer to sell or solicitation of any offer to buy any financial product, or an official statement of ICAP or its affiliates. Non-Transactable Pricing Terms and Conditions apply to any non-transactable pricing provided. All terms and conditions referenced herein available at www.icapterms.com. Please notify us by reply message if this link does not work. ********************************************************************** ICAP's 21st global annual Charity Day – took place Tuesday 3 December 2013. Together we raised £9.5 million (US$15.5 million), totalling £110 million since 1993. www.icapcharityday.com --------------------------------------------------------------------------------------- This email has been scanned for email related threats and delivered safely by Mimecast. For more information please visit http://www.mimecast.com ---------------------------------------------------------------------------------------

1 0

BOOST_STRONG_TYPEDEF
by Jono Poff 08 Aug '14

08 Aug '14

Hi, compiling this program with g++ 4.7.1 ... #include <boost/serialization/strong_typedef.hpp> BOOST_STRONG_TYPEDEF(uint32_t, LINKID_T) int main() { LINKID_T lid = 0xffddee33; return 0; } I get error: conversion from 'unsigned int' to non-scalar type 'LINKID_T' requested Looking at the header, the strong typedef struct defines assignment from uint32_t to LINKID_T ... D & operator=(const T & rhs) { t = rhs; return *this;} ... so what gives? Cheers, Jono -- ------------------------------ This email, including any attachments, is only for the intended recipient. It is subject to copyright, is confidential and may be the subject of legal or other privilege, none of which is waived or lost by reason of this transmission. If you are not an intended recipient, you may not use, disseminate, distribute or reproduce such email, any attachments, or any part thereof. If you have received a message in error, please notify the sender immediately and erase all copies of the message and any attachments. Unfortunately, we cannot warrant that the email has not been altered or corrupted during transmission nor can we guarantee that any email or any attachments are free from computer viruses or other conditions which may damage or interfere with recipient data, hardware or software. The recipient relies upon its own procedures and assumes all risk of use and of opening any attachments. ------------------------------

2 1

BOOST_STRONG_TYPEDEF ...ps
by Jono Poff 08 Aug '14

08 Aug '14

Sorry, forgot to say Boost 1.55.0 Jono -- ------------------------------ This email, including any attachments, is only for the intended recipient. It is subject to copyright, is confidential and may be the subject of legal or other privilege, none of which is waived or lost by reason of this transmission. If you are not an intended recipient, you may not use, disseminate, distribute or reproduce such email, any attachments, or any part thereof. If you have received a message in error, please notify the sender immediately and erase all copies of the message and any attachments. Unfortunately, we cannot warrant that the email has not been altered or corrupted during transmission nor can we guarantee that any email or any attachments are free from computer viruses or other conditions which may damage or interfere with recipient data, hardware or software. The recipient relies upon its own procedures and assumes all risk of use and of opening any attachments. ------------------------------

1 0

Geometry layout (packing) algorithm?
by Belcourt, Kenneth 07 Aug '14

07 Aug '14

Hi, I’m looking for an algorithm that will take a largish number (i.e. 10^5) 2d or 3d polygons (mostly parallel-pipeds, e.g. squares and boxes) and partition them into non-overlapping groups where each group contains some number of polygons that might abut along an edge or face, but not overlap. Each box can be represented by a collection of line segments so I thought geometry might have what I’m looking for but I didn’t see anything in a quick scan of the documentation. Does this so called packing (layout) algorithm sound like something already in Boost, Geometry or other library? I have an implementation but what looking to see what other options exist. Thanks. — Noel Belcourt

2 2

[boost] [1.56.0] Release Candidate 3 available
by Marshall Clow 07 Aug '14

07 Aug '14

We've created a third release candidate to fix a one more issue with Boost.Range. The files for 1.56.0 RC3 are available at: http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. The files (and associated md5s) are: MD5 (./boost_1_56_0_rc3.7z) = b7a72a6a6f487fa445333b4e115c6171 MD5 (./boost_1_56_0_rc3.tar.bz2) = a744cf167b05d72335f27c88115f211d MD5 (./boost_1_56_0_rc3.tar.gz) = 8c54705c424513fa2be0042696a3a162 MD5 (./boost_1_56_0_rc3.zip) = fc16da21d641e03715a4144cb093964e Thanks! -- The release managers

5 5

[date-time] boost::time_duration wrapping
by Justin Muncaster 07 Aug '14

07 Aug '14

Hello, I’m having issues with wrapping of boost::time_duration derived types. I can’t find anywhere in the documentation for when the time_duration types are supposed to wrap around. I have attached some sample source code below. The output is: SecCount = 80000000 is OK. Strange Stranger Problematic SecCount = 80000001 is STRANGE. I expect the output to be SecCount = 80000000 is OK. SecCount = 80000001 is OK. The problem we ran into had to do with seconds and milliseconds having different maximum permissible values. Any idea why boost::posix_time::seconds goes negative at 0x80000001 while milliseconds is not until much later? Thanks, Justin // // test.cpp // #include <boost/date_time.hpp> #include <iostream> using namespace std; using namespace boost::posix_time; //------------------------------------------------------- //------------------------------------------------------- void Strange(long SecCount) { long MilliCount = 1000 * SecCount; bool IsStrange = false; if (SecCount >= 0 && seconds(SecCount).is_negative()) { cout << "Strange" << endl; IsStrange = true; if (!milliseconds(MilliCount).is_negative()) { // If seconds wraps, why doesn't milliseconds? cout << "Stranger" << endl; IsStrange = true; } } if (seconds(SecCount) != milliseconds(MilliCount)) { cout << "Problematic" << endl; IsStrange = true; } if (!IsStrange) { cout << "SecCount = " << SecCount << " is OK." << endl; } else { cout << "SecCount = " << SecCount << " is STRANGE." << endl; } } //------------------------------------------------------- //------------------------------------------------------- int main() { cout << hex; Strange(0x80000000); Strange(0x80000001); return 0; }

2 1

Re: [Boost-users] [ASIO] directory monitor ASIO extension
by Brian Wood 06 Aug '14

06 Aug '14

Niall Douglas writes > * Works reliably on Microsoft Windows (hard), Linux (slightly > easier), BSD and OS X (easiest by far of the lot). > I believe you. Having considered some of your previous comments in a different thread, on kqueue, I ported my code generator from Linux to BSD. I only found relief from a problem I was having by doing so. > Paul Kirth presented on this at C++ Now 2014. It is a surprisingly > tough engineering problem, and requires a design approaching ideal > for it to work at all. Are videos from that conference available yet? -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

3 2

[ASIO] directory monitor ASIO extension
by Szymon Gatner 06 Aug '14

06 Aug '14

Hi, I am going through code of directory monitor ASIO extension by Boris Schäling (http://www.highscore.de/boost/dir_monitor.zip) and I am wondering: what is the benefit of making this piece of code / library an ASIO extension. It just feels like it could be easier to use and implement if it wasn't? I hope I am missing something tho and looking here for enlightenment ;) Regards, Szymon Gatner

5 13

why lockfree/queue.hpp requires has_trivial_assign and has_trivial_destructor to template type T
by 何子杰Hzj_jie 06 Aug '14

06 Aug '14

hi, all,as new to boost, i am looking for a solution to combine boost::lockfree::queue with std::function, i.e. boot::lockfree::queue<std::function>, but unfortunately, the implementation of the lockfree queue required the T to be trivial assignable and trivial destructible.with some basic investigation to the implementation of boost::lockfree::queue, the assignment operator is using when pop or unsynchronized_pop, it calls detail::copy_payload, which is using operator= or constructor and operator=. though overloaded assignment operator may use more time and cause the pop function to wait for longer time, i do not see it would block the logic.for the destruction, queue implementation always calls pool.template destruct instead deallocate, which means even for a default destructor, it will also be called. so is this a defect or by-design behavior of the lockfree queue? thank you in advanced. .Hzj_jie

3 5

[msm] State Machine and Dependency Injection
by Kris 05 Aug '14

05 Aug '14

Hi, Recently I have implemented Dependency Injection library, which I proposed to boost last week (http://boost.2283326.n4.nabble.com/is-there-any-interest-in-a-dependency-in…) Right now I wanted to shared how dependency injection might be integrated with Boost.MSM (eUML) and would really glad for any feedback. Boost.MSM is a great library, unfortunately actions/guards have to have empty constructor and whole logic has to be handled via Finite State Machine. Such approach is hard to maintain and test, so would be great to have possibility to implement action/guards without FSM dependency and with proper dependency injection instead. More information: http://krzysztof-jusiak.github.io/di/boost/libs/di/doc/html/di/examples/int… Hello World: class guard : public euml_action<guard> { public: guard(shared_ptr<data> data = nullptr, shared_ptr<other_data> = nullptr); // default constructor is required by eUML template<typename TEvent> bool operator()(const TEvent&) const; // no FSM dependency }; class action : public euml_action<action> { public: action(shared_ptr<data> data = nullptr, shared_ptr<other_data> = nullptr); // default constructor is required by eUML template<typename TEvent> void operator()(const TEvent&); // no FSM dependency }; class state_machine_ : public state_machine_def<state_machine_> { public: using initial_state = state1; BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE(( state1() + event() [guard()] / action() == state2() ), transition_table) }; using state_machine = back::state_machine< state_machine_ , back::use_dependency_injection // Boost.DI dependency injection policy >; auto sm = di::make_injector().create<state_machine>(); // create state machine / actions, guards and their dependencies will be injected via DI framework sm.process_event(event()); Hot it works? * we do implement actions/guards with any dependencies we need * we add use_dependency_injection policy in state machine definition * we create state machine using dependency injection framework library What MSM with DI actually give us? * actions/guards are really easy to test / code doesn't require FSM dependency - loosely coupled * signature change of actions/guards may not require binding configuration changes (if it's not an interface or it's an interface already bound) * FSM is just a declarative abstraction - we don't need to test it * we can use all DI goods for controlling how dependencies will be injected - see https://github.com/krzysztof-jusiak/di Project (with workings tests): https://github.com/krzysztof-jusiak/msm Comparison between usage of Boost.MSM with DI and without it: http://krzysztof-jusiak.github.io/di/boost/libs/di/doc/html/di/examples/int… Looking forward to hear from you. Any feedback is more than welcome. Cheers, Kris -- View this message in context: http://boost.2283326.n4.nabble.com/msm-State-Machine-and-Dependency-Injecti… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[1.56.0] Release candidates available
by Marshall Clow 04 Aug '14

04 Aug '14

Release candidate files for 1.65.0 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: MD5 (boost_1_56_0_rc1.7z) = 0ac22b92b24209286d48e4c41925cd9f MD5 (boost_1_56_0_rc1.tar.bz2) = 5b5bfa99244b1ac5737323decceb19c2 MD5 (boost_1_56_0_rc1.tar.gz) = 2047cdd4e09cda34e7f10fec0f821175 MD5 (boost_1_56_0_rc1.zip) = 0c544f6acc85550b15cdc9221f2ac0c9 Thanks! -- The release managers

7 11

[serialization] Please help me solve this compile error.
by Paul Blampspied 04 Aug '14

04 Aug '14

I am tearing my hair out over this, partly because I believe the code used to compile. I just can't see what the problem is. I enclose all the pertinent code as I cannot say which bits are irrelevant. There are two classes: ManagedArray which is an array of data without size or capacity data (this is stored elsewhere). PersistentManagedArray which I wrote to enable ManagedArrays to be serialized. The error message is produced in 'main': error: no match for 'operator<<' in 'oa << PersistentManagedArray<int>((* & size), (* & capacity), (* & ints))' It seems to me that I have defined the necessary serialize member function with the right signature. Commented out is code I wrote some time ago which used separate load and save functions. This, I believe, used to work. #include <fstream> #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> #include <string> using namespace std; //**************************************************************************************************************************** template<class T> class ManagedArray { public: T *values; ManagedArray() { values = NULL; } ~ManagedArray() { if (values) { delete [] values; } } //Changes array size. If array grows, the new values are unintialized. void resize(unsigned oldSize, unsigned newSize) { if (oldSize==newSize) return; T *newValues = (newSize==0) ? NULL : new T[newSize]; if (oldSize!=0) { T *oldValue, *newValue; T *end = values + (oldSize<newSize ? oldSize : newSize); for(oldValue=values, newValue=newValues; oldValue<end; oldValue++, newValue++) { *newValue = *oldValue; } } if (values) { delete [] values; } values = newValues; } //Changes array size. If array grows, the new values are initialised to copies of a prototype, initValue. void resize(unsigned oldSize, unsigned newSize, T &initValue) { if (oldSize==newSize) return; T *newValues = (newSize==0) ? NULL : new T[newSize]; T *oldValue = values; T *newValue = newValues; if (oldSize!=0) { T *oldEnd = values + (oldSize<newSize ? oldSize : newSize); for(; oldValue<oldEnd; oldValue++, newValue++) { *newValue = *oldValue; } } T *newEnd = newValues + newSize; for(; newValue<newEnd; newValue++) { *newValue = initValue; } delete [] values; values = newValues; } inline T &operator[](unsigned index) { return values[index]; } inline const T &operator[](unsigned index) const { return values[index]; } }; //**************************************************************************************************************************** //This class helps to save a ManagedArray in a Boost archive // Usage: // ar & PersistentManagedArray(size, capacity, array); template<class T> class PersistentManagedArray { public: PersistentManagedArray(unsigned &size, unsigned &capacity, ManagedArray<T> &managedArray) : _size(size), _capacity(capacity), _managedArray(managedArray) {valueArrayExists = (_managedArray.values!=NULL);} private: unsigned &_size; unsigned &_capacity; ManagedArray<T> &_managedArray; bool valueArrayExists; friend class boost::serialization::access; // template<class Archive> // void save(Archive & ar, const unsigned int version) const { // ar & valueArrayExists; // if (valueArrayExists) { // for(unsigned i=0; i<_size; i++) { // ar & _managedArray.values[i]; // } // } // } // template<class Archive> // void load(Archive & ar, const unsigned int version) { // _managedArray.values = NULL; // ar & valueArrayExists; // if (valueArrayExists) { // _managedArray.resize(0, _capacity); // for(unsigned i=0; i<_size; i++) { // ar & _managedArray.values[i]; // } // } // } // BOOST_SERIALIZATION_SPLIT_MEMBER() template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & valueArrayExists; ar & _size; ar & _capacity; if (Archive::is_loading::value) { delete _managedArray.values; _managedArray.values = new T[_capacity]; } for(unsigned i=0; i<_size; i++) { ar & _managedArray.values[i]; } } }; int main(int argc, char *argv[]) { ManagedArray<int> ints; unsigned size; unsigned capacity; string fileName = "data.xxx"; ofstream file(fileName.c_str(), ios::out|ios::binary); if (file.good()) { boost::archive::binary_oarchive oa(file); oa << PersistentManagedArray<int>(size, capacity, ints); //This line does not compile ! } }

4 4

[1.56.0] Release Candidate 2 available
by Eric Niebler 04 Aug '14

04 Aug '14

We've created a second release candidate to fix a few issues. The three fixes since RC1 are listed at the end of this mail. The files for 1.56.0 RC2 are available at: http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. The files (and associated md5s) are: MD5 (boost_1_56_0_rc2.7z) = 2e1688886aede1c3348e131a0e73a031 MD5 (boost_1_56_0_rc2.tar.bz2) = 2079fabbfb9fb046e6e12e381eff20fa MD5 (boost_1_56_0_rc2.tar.gz) = 96fe9c5f70759399217dc7ee113ecdd3 MD5 (boost_1_56_0_rc2.zip) = df42b60e120841fc3893de7c2529fc4a Thanks! -- The release managers === Changes Since RC1 === Boost.Thread bug is causing coroutine build to fail on gcc 4.6 in C++11 mode. https://github.com/boostorg/thread/pull/21 Boost.Graph broken on MSVC-12 and gcc-4.4. https://github.com/boostorg/graph/pull/14 Boost.System broken on cygwin, local_free_on_destruction not defined. https://github.com/boostorg/system/pull/4

3 2

[MultiIndex] Indexing integers
by Sensei 31 Jul '14

31 Jul '14

Dear all, I am experimenting with MultiIndex, and I am happy with my custom classes. Now I am wondering, can I index integers without a custom class? For instance, say we have a 32 bit unsigned integer, how can I index these with respect to the MSB or LSB? My first guess is using a union, something like union uint32_u { uint32_t data; uint16_t bits[2]; }; // define a multiply indexed set with indices by id and name typedef boost::multi_index::multi_index_container< uint32_u, boost::multi_index::indexed_by< // sort by MSB boost::multi_index::ordered_non_unique<boost::multi_index::member<employee, uint16_t, uint32_u.bits[0]>>, // sort by LSB boost::multi_index::ordered_non_unique<boost::multi_index::member<employee, uint16_t, uint32_u.bits[1]>>, > > integer_set; But I cannot obviously compile it. Is there a way I can do this? Thanks!

2 12

[boost][sync?] "Distributed" value (or something...)
by Klaim - Joël Lamotte 31 Jul '14

31 Jul '14

I would like to ask Boost developers and users: 1. Am I the only one seeing the following pattern in my concurrent systems code? 2. Is there already some tools available in Boost that does what I describe here and that I am not aware of? 3. If not, would there be any interest in the tool I'm describing here or not? Is it a dumb idea? (I keep getting back to this idea but I'm surprised not finding anything similar online) The pattern that I am seeing occurs when: 1. I have a value or a set of values in an object or several objects which value(s) describe some kind of configuration that several other systems will read and use. 2. The object(s) will be updated only by one thread (at a time). 3. When the object's value is modified, all the systems that rely on the object's value have to be notified so that they update themselves using that value. 4. The systems I am refering to can use different threads for updating and we can assume that they are running concurrently. 5. It is not important that the source object's value is synched with the reader's values at all time, however it is important that the sequence of changes to the source object's value is signaled to the readers exactly in the same order and "as fast as possible", but delay is ok. The simplest solution to solve this is to have a mutex locking the value and the systems checking the value regularly. (that is, using syncrhonized_value for example) However the locking and looping reads might not be necessary if it is done in another way (if I am correct, I still lack experience in the domain). The solution that I am thinking about would look like this. ///////// // The object containing the value used by the other systems. class System_A { distributed_source<int> m_foo_count; // changes to this object will be sent to "readers"... public: System_A() : m_foo_count(42) ... {} //... // thread-safe read-only access distributed_value<int> make_foo_count_reader() const { return distributed_value<int>{ m_foo_count }; } }; ///////// // The different systems acquire a read access to the value. class System_B { distributed_value<int> foo_count; // read-only value reflecting System_A::m_foo_count's value since last update. public: SystemB( const System_A& system_a, ... ) : m_foo_count( system_a.make_foo_count_reader() ) { // setup the initial config... on_foo_count_changed( *m_foo_count ); // trigger some processing when SystemA::foo_count's value have been changed: m_foo_count.on_changed( [this]( int new_value ){ // called after the value have been changed m_work_queue.push( [=]{ // will be executed on the next update cycle for this system... on_foo_count_changed( new_value ); / }); }); } //... private: void update_cycle( const UpdateInfo& info ) { // ... // the following is just to clarify: const int foo_before = *m_foo_count; // the value is not updated yet, but we can still use it m_work_queue.execute(); const int foo_after = *m_foo_count; // the value might have been udpated if( foo_before != foo_after ) { // the value have been updated (though you don't need to do this if you used the callback instead). } //... }; }; //////// // At some point the value is changed by the system owning the source object... System_A::change_foo( int new_value ) { m_work_queue.push( [=]{ // will be executed on the next update cycle of this system... // ... *m_foo_count = new_value; // assign the new value then send the new value to the readers... }); } System_A::something_complex( std::function<void(int&)> some_work ) { m_work_queue.push( [=]{ // ... m_foo_count.update( some_work ); // execute on the current value then send the resulting value to the readers }); } Some notes: a. The names are just invented while I write this email. b. I suppose that the distributed_source might have an interface similar to synchronized_value, anyway I didn't get farther than this idea. c. I see several different ways to implement this idea, some might be more efficient than others but I didn't do any tests yet (by lack of time). Thoughts?

2 4

Re: [Boost-users] [MSM] how to use a compilation firewall around inner state machines
by Mark.Bartosik＠thomsonreuters.com 31 Jul '14

31 Jul '14

Repost from different email client (prior ate linefeeds, sorry again). I have a state machine implemented with MSM (eUML) that currently has 80 transitions, there are two inner state machines. Compilation time is not great, but I have been dealing with it by BOOST_MSM_FAVOR_COMPILE_TIME and using parallel compilation where possible. Slow compilation time is an irritation and productivity killer, but my larger worry is that eventually the compiler will run out of memory. Especially as I will likely have to add another inner state machine with about 40 more transitions. Current we are using VS2008 but planning on moving everyone in the team to the VS2012 toolset but running under the VS2013 environment. I don't know if this will help, I doubt it. Currently compilation memory usage is up to 2.5GB per translation unit. So I would like to use a compilation firewall around the inner state machines. My plan is to implement concrete types for the inner state machines, with a process_event function: boost::msm::back::HandledEnum process_event( const boost::any & event ); Then within this function test for each event type to be handled by the inner state machine, and forward to a regular MSM state machine contained within the inner concrete type. I am hoping that this, plus on_entry and on_exit functions is about all I need to do. I expect that I will be able to get this to work, although an example on how to put a concrete wrapper around an inner state machine would be great, and importantly a list of limitations and work arounds for this technique would be helpful. My problem is that the outer state machine transition table has rows like this: exit_pt_( inner_state, inner_state_some_pseudo_exit_state ) / do_some_stuff() == outer_s2, exit_pt_( inner_state, inner_state_other_pseudo_exit_state ) / do_other_stuff() == outer_s3, If inner_state becomes a concrete type, then I don't know if this can be handled, and if so how? My best idea so far is for the inner_state to call process_event on the outer state machine and rewrite the outer machine's state transition table thus: inner_state + some_synthetic_event / do_some_stuff() == outer_s2, inner_state + other_synthetic_event / do_other_stuff() == outer_s3 The xxxx_synthetic_event's would be generated from within the inner state machine when it reaches one of the pseudo exit states. So in summary I would like to know: 1) Is there a documented example of putting a concrete wrapper around a inner state machine. 2) What is the list of limitations of doing this. e.g. exit_pt_ not working. 3) How should I deal with transitions in the outer state machine that were making use of exit_pt_ P.S. I've got to say that I think MSM is great! thanks - - Mark

2 1

Re: [Boost-users] [serialization] Please help me solve this compile error.
by Brian Wood 30 Jul '14

30 Jul '14

Bjorn Reese writes: On 07/30/2014 04:01 AM, Paul Blampspied wrote: >> boost::archive::binary_ oarchive oa(file); >> oa << PersistentManagedArray<int>(size, capacity, ints); //This line does not compile ! > > The stream operator in Boost.Serialization does not take temporary > objects, so create the PersistentManagedArray<T> object on a separate > line, and then pass it to the stream. The C++ Middleware Writer <http://webEbenezer.net> supports temporary objects. Here's an example: front_messages_middle::Marshal(sendbuf, cmw::marshalling_integer(::strtol(argv[1],0,10))); It doesn't support PersistentManagedArray, but I'm willing to consider adding support for that. More info here - http://webEbenezer.net/about.html -- Brian Ebenezer Enterprises http://webEbenezer.net

1 0

[MSM] how to use a compilation firewall around inner state machines
by Mark Bartosik 30 Jul '14

30 Jul '14

I have a state machine implemented with MSM (eUML) that currently has 80 transitions, there are two inner state machines. Compilation time is not great, but I have been dealing with it by BOOST_MSM_FAVOR_COMPILE_TIME and using parallel compilation where possible. Slow compilation time is an irritation and productivity killer, but my larger worry is that eventually the compiler will run out of memory. Especially as I will likely have to add another inner state machine with about 40 more transitions. Current we are using VS2008 but planning on moving everyone in the team to the VS2012 toolset but running under the VS2013 environment. I don't know if this will help, I doubt it. Currently compilation memory usage is up to 2.5GB per translation unit. So I would like to use a compilation firewall around the inner state machines. My plan is to implement concrete types for the inner state machines, with a process_event function: boost::msm::back::HandledEnum process_event( const boost::any & event ); Then within this function test for each event type to be handled by the inner state machine, and forward to a regular MSM state machine contained within the inner concrete type. I am hoping that this, plus on_entry and on_exit functions is about all I need to do. I expect that I will be able to get this to work, although an example on how to put a concrete wrapper around an inner state machine would be great, and importantly a list of limitations and work arounds for this technique would be helpful. My problem is that the outer state machine transition table has rows like this: exit_pt_( inner_state, inner_state_some_pseudo_exit_state ) / do_some_stuff() == outer_s2, exit_pt_( inner_state, inner_state_other_pseudo_exit_state ) / do_other_stuff() == outer_s3, If inner_state becomes a concrete type, then I don't know if this can be handled, and if so how? My best idea so far is for the inner_state to call process_event on the outer state machine and rewrite the outer machine's state transition table thus: inner_state + some_synthetic_event / do_some_stuff() == outer_s2, inner_state + other_synthetic_event / do_other_stuff() == outer_s3 The xxxx_synthetic_event's would be generated from within the inner state machine when it reaches one of the pseudo exit states. So in summary I would like to know: 1) Is there a documented example of putting a concrete wrapper around a inner state machine. 2) What is the list of limitations of doing this. e.g. exit_pt_ not working. 3) How should I deal with transitions in the outer state machine that were making use of exit_pt_ P.S. I've got to say that I think MSM is great! thanks - - Mark

1 1

equivalent of java.util.properties
by David Frank 30 Jul '14

30 Jul '14

I'm wondering if there is a boost equivalent of the java.util.properties package which can read java properties file. Thanks, Dave.

1 0

revisiting casting a boost::shared_ptr to void*
by Chris Cleeland 30 Jul '14

30 Jul '14

I'm resurrecting this topic: https://groups.google.com/forum/#!searchin/boost-list/shared_ptr$20void*/bo… because there is an unaddressed issue in it that I'm about to run into: "... beware the pointee may be deleted if the last copy of the shared pointer goes out of scope, as the raw pointer won't have incremented the reference count." I cannot be the first person to run into this--a common issue when crossing an API boundary. Has anyone come up with a good, safe solution wherein the reference count gets properly incremented? -- Chris Cleeland

7 16

[Graph] Large Graphs: performace boost
by Sensei 30 Jul '14

30 Jul '14

Dear all, Facing an increasing size in my experiments, I am wondering now if my data structure is still valid. I need to traverse a graph (with my custom A*) that now can easily contain 10M-100M nodes and 100M-400M edges. The graph is (now) without weights, but this may change in the future. The only thing that is guaranteed not to change is that the graph is immutable. The graphs might even be larger, and at some point I will move to parallel BGL, but not now. To spare some memory, I am using a CSR graph: typedef boost::compressed_sparse_row_graph<boost::bidirectionalS> boost_graph; graph_ = new boost_graph(boost::edges_are_unsorted_multi_pass, results.begin(), results.end(), nodelist().size()); I am dubious if this the best solution. I have two objectives right now, optimize with respect to 1) memory consumption, and 2) graph traversal time. The main operation I need to do on graph is just "given a node, find the adjacent ones" (with my A*). Do you suggest to switch to another graph data structure? How do you think I will sacrifice time for memory, and vice versa, if I move for instance to an adjacency list? Thanks for any suggestion!

1 0

Boost Based Proxy
by asim 29 Jul '14

29 Jul '14

In SSl case proxy will become a tunnel so whatever encrypted data i will get from client i have to forward it to server.But i am unable to read content as connection is keep alive (means no end of file exception) and due to encryption no header based reading i can do then how to read it. -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Based-Proxy-tp4665704.html Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[Serialization] XML: Necessity of attribute class_id although class_name is given
by Frank Stähr 29 Jul '14

29 Jul '14

Hello everybody, I would like to know what the purpose of the xml attribute class_id is, how it works and in which cases it can be omitted. An example: “Base” is the (abstract) base class of _GMTF_ and _TTF_, and _Hist_ also has got a similar base class. If a pointer of Hist is a member of GMTF and you want to serialize a pointer of Base, you get something like: <filter class_id="0" class_name="GMTF"> <m_bufHalfMaxSize>4</m_bufHalfMaxSize> <m_cutDetector class_id="1" class_name="Hist"></m_cutDetector> </filter> Here, the macros • BOOST_CLASS_EXPORT_GUID(...), • BOOST_CLASS_IMPLEMENTATION(..., boost::serialization::object_serializable) and • BOOST_CLASS_TRACKING(..., boost::serialization::track_never) are used. The problem now is: Although the exact classes are given by human-readable class names (and used!), you cannot omit or change the class_id. If you edit the XML file by hand, it can become invalid (-> exception on reading). It seems that the class ids are just ascending non-negative numbers. What are the rules for choosing the class ids? Why are they necessary? Is there a trick to remove this attribute or at least to ignore it? Thanks, Frank -- Frank Stähr Technische Universität Berlin Communication Systems Group Sekr. EN1 Einsteinufer 17 10587 Berlin, Germany

2 2

Pipe and Filters pattern with boost?
by Journeyer J. Joh 29 Jul '14

29 Jul '14

Hello list! I'd like to find a good approach to implement the Pipe and Filters pattern with boost. Could someone recommend me some useful boost library for this purpose? I only know asio. Is there any known example source code for this - Pipe and Filters pattern with boost. Thank you very much in advance! ---------------------------------------- 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 ----------------------------------------

4 4

[Boost 1.56 Beta] [Serialization] Compilation problem with classes having special new operators
by Hijok Payne 28 Jul '14

28 Jul '14

I was trying out the new Boost 1.56 beta and some of my serialization code fails to compile (they work fine with previous versions of Boost e.g. Boost 1.55). I am trying to do serialization of Eigen (http://eigen.tuxfamily.org/) matrices with following code: #include <Eigen/Core> #include <fstream> #include <boost/serialization/vector.hpp> #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> //Boost Serialization of Eigen Matrix namespace boost { template<class Archive, typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols> inline void serialize(Archive & ar, Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& t, const unsigned int file_version) { size_t rows = t.rows(), cols = t.cols(); ar & rows; ar & cols; if (rows * cols != t.size()) t.resize(rows, cols); ar & boost::serialization::make_array(t.data(), t.size()); } } //Simple helper for serialization to a file template <typename T> bool serialize(const T& data, const std::string& filename) { std::ofstream ofs(filename.c_str(), std::ios::out | std::ios::binary); if (!ofs.is_open()) return false; { // use scope to ensure archive goes out of scope before stream boost::archive::binary_oarchive oa(ofs); oa << data; } ofs.close(); return true; } //Simple helper for de-serialization from a file template <typename T> bool deSerialize(T& data, const std::string& filename) { std::ifstream ifs(filename.c_str(), std::ios::in | std::ios::binary); if (!ifs.is_open()) return false; { // use scope to ensure archive goes out of scope before stream boost::archive::binary_iarchive ia(ifs); ia >> data; } ifs.close(); return true; } int main(int argc, char *argv[]) { typedef Eigen::Vector3d VectorType; VectorType* vec = new VectorType(1, 2, 3); serialize(vec, "v4d.dat"); std::cout << "v4d =\n" << *vec << std::endl; VectorType* vec_in; deSerialize(vec_in, "v4d.dat"); std::cout << "v4d_in =\n" << *vec_in << std::endl; return 0; } The error in Visual studio 2013 says: boost/archive/detail/iserializer.hpp(237): error C2665: 'Eigen::PlainObjectBase<Eigen::Matrix<double,3,1,0,3,1>>::operator delete' : none of the 3 overloads could convert all the argument types 2> c:\users\abhijit\codes\installs\eigen\eigen-install\include\eigen3\eigen\src/Core/PlainObjectBase.h(132): could be 'void Eigen::PlainObjectBase<Eigen::Matrix<double,3,1,0,3,1>>::operator delete(void *,const std::nothrow_t &) throw()' 2> c:\users\abhijit\codes\installs\eigen\eigen-install\include\eigen3\eigen\src/Core/PlainObjectBase.h(132): or 'void Eigen::PlainObjectBase<Eigen::Matrix<double,3,1,0,3,1>>::operator delete(void *,void *) throw()' 2> while trying to match the argument list '(VectorType *, size_t)' 2> C:\Boost\boost-1_56_0_b1\boost/archive/detail/iserializer.hpp(224) : while compiling class template member function 'void boost::archive::detail::heap_allocation<T>::has_new_operator::invoke_delete(T *)' There is also the following note, but I cannot seem to understand this. // if compilation fails here, the likely cause that the class // T has a class specific new operator but no class specific // delete operator which matches the following signature. Fix // your program to have this. Note that adding operator delete // with only one parameter doesn't seem correct to me since // the standard(3.7.4.2) says " // "If a class T has a member deallocation function named // 'operator delete' with exactly one parameter, then that function // is a usual (non-placement) deallocation function" which I take // to mean that it will call the destructor of type T which we don't // want to do here. I want to understand this issue because this breaks a lot of existing code.

1 1

Geometry: modifiable?
by Jeremy Murphy 28 Jul '14

28 Jul '14

Is there a generic way to modify geometry structurally? Say if I have a ring and I want to insert a new point? Or would I need to reach into the underlying container to make that kind of change? Thanks, cheers. Jeremy

2 3

[SmartPtr] enable_shared_from_raw
by Gavin Lambert 27 Jul '14

27 Jul '14

Hi all, Firstly, any chance this could get some documentation? Is the author still around? I'm thinking about using this at the moment for two separate reasons (and ways in which enable_shared_from_this seems to fall short): 1. shared_from_this can't be used from the constructor (requiring factory-method-init shenanigans); reportedly (https://groups.google.com/forum/#!topic/boost-list/8JWFZ56ry6k) shared_from_raw can, although I can't find specific details on the caveats mentioned. 2. What I *really* want to be able to do is to create a child object (most commonly a callback functor) that contains a weak_ptr, and it seems silly (and badly performant) to use the usual factory-init pattern to call shared_from_this just to degrade it back to a weak_ptr. And it should be possible to obtain that weak_ptr before any shared_ptr exists, and "fix" it later to point at the real shared_ptr, especially if it is known that the weak_ptr will never actually be used until that real shared_ptr exists. enable_shared_from_raw almost seems to fit the bill (according to http://stackoverflow.com/questions/22184772/why-is-boostenable-shared-from-…) but I encountered the same problem as in this post (http://lists.boost.org/boost-users/2013/05/78833.php) it works with shared_from_raw but not weak_from_raw. However this change: https://github.com/boostorg/smart_ptr/pull/8 fixes that. It looks like the two calls went down different code paths for some reason I can't fathom. Making this change (or the similar-but-better-style one mentioned in the PR discussion) makes the above scenario work as expected. I'm not sure if there was some specific reason to not do this before or if it was just an oversight. Any chance this can make it into 1.56? Or is it too late for that? Regards, Gavin Lambert

3 4

[mpi] potentially blocking send - require blocking
by Dave Clarke 25 Jul '14

25 Jul '14

The boost::mpi documentation for send() is: "This routine executes a potentially blocking send" This differs from MPI_Send() "This routine will block until the message is sent to the destination." I am developing an application which requires the code not to progress until the communication is complete. In which situations does "potentially blocking" apply? And, is there a way of guaranteeing it is complete, the equivalent of MPI_Wait() for MPI_Isend()? Regards, Dave

3 2

Compiling boost on Windows
by Freddy Martinez Garcia 24 Jul '14

24 Jul '14

Hi guys… I need compile the boost for windows but I’m not a windows user… I had made some compilation but the files generated by gcc (from MinGW) has .a extension and not .lib or .dll extension… how can I change that ?? best regard Freddy Martinez Garcia Lic. Ciencia de la Computacion C++ and Qt Senior Developer freddy311082(a)gmail.com

2 1

unsubscribe
by Richard Greene 23 Jul '14

23 Jul '14

1 0

[mpl] BOOST_MPL_ASSERT_MSG for static_assert
by Michael Powell 23 Jul '14

23 Jul '14

Hello, I would like to add some diagnostic messages during compile time, potentially enumerating one or more types as well. static_assert is great for simple messages but falls a bit short due to inability to list types and such. I wonder if BOOST_MPL_ASSERT_MSG is the right answer, however, I am getting the following errors: BOOST_MPL_ASSERT_MSG( std::is_base_of<xnode, Node>::value , "requested type is not a node" , (types<node_type>) ); 1>i:\source\kingdom software\cppxml\xml\domain\parts\xnode.h(111): warning C4002: too many actual parameters for macro 'BOOST_MPL_ASSERT_MSG' It's an error message, but not the one(s) I am expecting. Do I need to enable something, preprocessor definition, something like that? Best regards, Michael Powell

3 3

libboost_thread.a Cross-compile Linaro (ARM-Linux)
by Joseph Longhi 23 Jul '14

23 Jul '14

Hi, I have been trying to get a static library for boost_thread to be built but have so far been unable to. When running: ./b2 toolset=gcc-arm target-os=linux --with-threads The results show 2 skipped which are libboost_thread.a and libboost_system.a. I have all the shared objects built but can't seem to get around this problem. Any help would be greatly appreciated.

1 0

Re: [Boost-users] [odeint] optional data
by Erik Schultheis 22 Jul '14

22 Jul '14

Thanks for the fast response. > > Hi > > On 07/22/2014 01:24 AM, Erik Schultheis wrote: > > Dear all, > > > > i am simulating particle trajectories, and depending on the data i want > > to generate i may or may not have to track additional data [boost.ublas > > c_matrix] along those trajectories. Right now i enable/disable that via > > a template parameter (so, using std::tuple(vec, vec) or tuple(vec, vec, > > c_matrix) and fusion_algebra), which has a few drawbacks. > > The algorithm is already templated to support varying dimensions via a > > template parameter, so the additional data practically doubles the > > number of template instantiations for system and all possible observers. > > This actually got so bad that gcc (mingw gcc 4.8) refuses to compile > > with debugging enabled. Therefore, i would like to make the switch > > between tracking the matrix and ignoring it a runtime choice instead of > > a template parameter. > > I don't understand fully what you exactly want to do. Can you show us > some more code? Can you put the tracking into an observer? I mean, do > you need to solve an ODE to track the additional data? > Unfortunatly, the tracking is an ode itself, so the change depends on the position and the current matrix value, so it cannot be done inside of an observer. As for the current implementation: I have a class BasicTracer<S, I>, where S is the template parameter that decides the state type (currently one of std::array<vec<2>, 2>, std::array<vec<3>, 2>, std::tuple<vec<2>, <vec<2>, matrix<4>> and std::tuple<vec<3>, vec<3>, matrix<6>>) and I the integration startegy (either Integrator, that only operates on the vectors, or MonodromyIntegrator, that also operates on the matrix). The reason for this is that I have two different use cases for the program: 1) a human-viewable visualisation of the trajectories that does not need matrices, and 2) the actual data i want to generate. Since 1) needs far more trajectories to be calculated, it is really helpful that the computation time in this case is lower. With the mentioned limitation (gcc refuses to compile with -g, "tracer.o: too many sections (50892)" and "ccQF7l7o.s: Fatal error: can't close .obj\Debug\src\tracer.o: File too big") the code works as it is now. For now i have only worked with small problem sizes, where the wait time for a result is in the order of a few minutes, however, this is going to change and therefore i want to parallelize the code. The differentiation between he use cases via templates make the code quite complex at times, and i hope to reduce that complexity before i add the parallelization. Therefore, I want to transform from a templated approach to a runtime approach. I am not sure if it is possible to make the code select the dimension at runtime without significant performance impact, but at least the second parameter should be removable without increasing runtime significantly. I am not really sure which parts of the code to post to significantly inprove my description. The tracer itself is a type like template class BasicTracer<std::tuple<vec<3>, vec<3>, monodromy_matrix<3>>, MonodromyIntegrator<std::tuple<vec<3>, vec<3>, monodromy_matrix<3>>>>; or template class BasicTracer<std::array<vec<2>, 2>, Integrator<std::array<vec<2>, 2>>>; the integration is performed like double starte = mEnergy(p); try { mMasterObserver.startTrajectory(p); perform_integration(mIntegrator, p, 2.0, 1.0 / mPotential.getSize(), mMasterObserver, mAbsErrorBound, mRelErrorBound); } catch(int& i) {}; /// \todo this is the only reason for getLastState's existence mEnergyError += std::pow( starte - mEnergy( mMasterObserver.getLastState() ), 2 ); where perform integration just sets parameters to the odeint function: template<typename System, typename State, typename Observer> std::size_t perform_integration(const System& system, State& start, double t_end, double dt, Observer& obs, double abs_err, double rel_err) { using namespace boost::numeric::odeint; // when range access is possible, try range algebra, otherwise, try fusion using algebra_type = typename std::conditional<boost::has_range_iterator<State>::value, range_algebra, fusion_algebra>::type; typedef runge_kutta_cash_karp54<State, double, State, double, algebra_type> error_stepper_type; typedef controlled_runge_kutta<error_stepper_type> controlled_stepper_type; typedef default_error_checker<typename controlled_stepper_type::value_type, typename controlled_stepper_type::algebra_type> error_checker_type; controlled_stepper_type stepper(error_checker_type(abs_err, rel_err)); return integrate_const(stepper, system, start, 0.0, t_end, dt, std::ref(obs) ); } and the operator() of the integrators look like template<class S> void Integrator<S>::operator()( const S& state, S& deriv, double/*t*/ ) const { using namespace system_state; auto position = get_position(state); auto p = position * mPotential.getSize(); double x = p[0]; double y = p[1]; // prevent out of bounds access if(y < 0 || y > mPotential.getSize()-1 || x < 0 || x > mPotential.getSize()-1) { throw(1); }; // calculate acceleration auto& acceleration = get_velocity(deriv); for(int i = 0; i < DIMENSION; ++i) { /// the compiler should be able to ompimize this std::array<int, DIMENSION> didx; didx.fill(0); didx[i] = 1; acceleration[i] = -linearInterpolate( mPotential.getDerivative(didx), p ); } // change in position = current velocity get_position( deriv ) = get_velocity( state ); } template<class S> void MonodromyIntegrator<S>::operator()( const S& state, S& deriv, double/*t*/ ) const { using namespace system_state; auto position = get_position(state); auto p = position * mPotential.getSize(); double x = p[0]; double y = p[1]; // prevent out of bounds access if(y < 0 || y > mPotential.getSize()-1 || x < 0 || x > mPotential.getSize()-1) { throw(1); }; // calculate acceleration auto& acceleration = get_velocity(deriv); for(int i = 0; i < DIMENSION; ++i) { std::array<int, DIMENSION> didx; didx.fill(0); didx[i] = 1; acceleration[i] = -linearInterpolate( mPotential.getDerivative(didx), p ); } // change in position = current velocity get_position( deriv ) = get_velocity( state ); // change in monodromy boost::numeric::ublas::axpy_prod(getMonodromyCoeff( mPotential, p ), get_data(state), get_data(deriv), true); } If there is some other part of the code that would be helpful, please let me know. > > However, the cost of tracking that matrix is quite high (that is why it > > is optional), but simply disableing the d matrix / dt calculation in the > > system does not speed up the calculation much (86 s -> 58 s vs 27 s > > without matrix). A lot of time is spent in adding and multiplying > > numbers that are not used anywhere, or actually even copying them (e.g > > std::swap(c_matrix, c_matrix) shows up quite high in gprof (even though > > i am not sure how reliable the -pg option is in conjunction with -O3)). > > > > So what i am asking here is for suggestions how to best let odeint treat > > the c_matrix as uninitialized memory and never perform any operations on > > that depending on a runtime parameter. > > Options i thought of were: > > * deriving a class from c_matrix and providing my own versions of > > operator overloads that check a flag: > > as far as i know, boost.ublas matrices use some template magic to > > let operators only return expression templates to optimize evaluation if > > operations are chained, and i would not be sure about how to actually > > retain that behaviour in case the matrix is tracked. > > * creating my own algebra class: > > from what i could tell from a few quick glances into the algebra > > files, this would probably be conceptually easier than the other option, > > but would require a lot of repetetive coding. > > > > Does anyone have suggestion for a more efficient implementation strategy? > > Have you considered to use a fusion view which only points to tuple( vec > , vec ). This could be used as the state type you use. Nevertheless, you > need to instantiate the stepper with a real resizable state_type which > you could be again a tuple( vec , vec ). > No, I didn't know about fusion view up until now :), so i am going to take a look at it. Why would I need a resizable state_type? Whether I track the matrix or not is decided before the call into the integrate function. > > >From the options you showed here, an own algebra looks most promising. > This algebra you also be implemented in terms of the existing > fusion_algebra and redirect all calls to fusion_algebra.

2 1

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

22 Jul '14

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

3 3

[ptr container] up to date?
by Michael Powell 22 Jul '14

22 Jul '14

Hello, I am considering putting Boost Pointer Container to use in an application to help with, among other things, the polymorphic slicing issue. I've got a domain model which potentially has exactly that creeping in, vector of shared_ptr to base class, with heterogeneous vector composition. http://www.boost.org/doc/libs/1_55_0/libs/ptr_container/doc/ptr_container.h… I was reading a lot of references to std::auto_ptr, which is a deprecated feature these days (http://www.cplusplus.com/reference/memory/auto_ptr/) Also the last update was in 2007 or thereabouts. Is this up to date with current language features such as std's?, i.e. std::unique_ptr, std::shared_ptr? Just generally, this is a fitness for use query. Thank you... Best regards, Michael Powell

2 1