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

[1.60] Beta date?
by Joaquin M López Muñoz 26 Nov '15

26 Nov '15

Hi, Is there a planned date for Boost 1.60 beta (we have beta RC3 so far) or do we intend to jump directly to 1.60 RC? I'm asking because I've got a couple of fairly minimal commits that run succesfully in develop and I'd like to merge to release before it's too late: https://github.com/boostorg/multi_index/commit/ 1f4d33012bb0537d6bd5667aed8a02d29eb1ed26 https://github.com/boostorg/flyweight/commit/ adda32bfa9af8a4427affc41c64b792660ffffae Thank you, Joaquín M López Muñoz Telefónica

4 3

[Statechart] question about event processing rules in orthogonal states.
by Ernesto Rodriguez Reina 25 Nov '15

25 Nov '15

Hi everyone, The event processing order of a normal (non-orthogonal) state is first the innermost and if not handled (or forwarded) then it parent, and that behaviour is repeated upward until the event is discarded (or deferred). But when we are in the presence of orthogonal states, then the behaviour I am getting is a bit different, for example given the following statechart: <code> struct EvTest : sc::event< EvTest > {}; struct Test; struct Inner1; struct Inner2; struct Machine : sc::state_machine< Machine, Test > {}; struct Test : sc::simple_state<Test, Machine, mpl::list<Inner1, Inner2> >{ typedef sc::custom_reaction< EvTest > reactions; sc::result react( const EvTest){ std::cout << "Test" << std::endl; // return discard_event(); return forward_event(); } }; struct Inner1 : sc::simple_state<Inner1, Test::orthogonal< 0 > >{}; struct Inner2 : sc::simple_state<Inner2, Test::orthogonal< 1 > >{ typedef sc::custom_reaction< EvTest > reactions; sc::result react( const EvTest){ std::cout << "Inner2" << std::endl; return forward_event(); } }; </code> When received the event "EvTest" the output I am getting is: <output> Test Inner2 Test </output> That means that the handler in the state "Test" is called twice. If in the handler at test we discard instead of forwarding then we get that only the handler of "Test" is called. I thought that without taking into account if the children are orthogonal or not, the event will be processed first by the children (all of them in the case of orthogonal state until one discard or defer the event), and event is not discarded (or deferred) then the parent process the event. It is that OK? If so why I am getting that weird behaviour in my example? Any thoughts and comments are more than welcome. Best, Ernesto Rodriguez Reina

1 0

boostboost::filesystem::detail::copy_file undefined when using c++14
by ken 25 Nov '15

25 Nov '15

Hello I am building an application that uses boost libraries that I also complied. This is on a mac os x 10.9 system using gnu gcc 5.2 installed with mac ports. I built the boost 1.59.0 libraries as instructed and built the application without any problems (after a few tries). Then I changed the c++ language standard for the build of the application to -std=gnu++14 (the default is gnu++11). However, I now get the following error during the linking phase: g++ -std=gnu++14 -U_WIN32 -Dunix -DNDEBUG -O3 -DTIXML_USE_STL -DBOOST_FILESYSTEM_VERSION=3 -fmessage-length=0 -I[...] -lboost_date_time-mt -lboost_filesystem-mt -lboost_regex-mt -lboost_system-mt -lboost_locale-mt -lboost_thread-mt -lboost_chrono-mt [...] Undefined symbols for architecture x86_64: "boost::filesystem::detail::copy_file(boost::filesystem::path const&, boost::filesystem::path const&, boost::filesystem::copy_option, boost::system::error_code*)", referenced from: [...] ... ld: symbol(s) not found for architecture x86_64 collect2: error: ld returned 1 exit status [...] I rebuilt the boost libraries with the -std=gnu++14 option and verified that they are using the same std library, but I still got the same error when linking those libraries to my application. I removed the c++14 option from the application build and the error went away. So next I took a look at the functions in libboost_filesystem-mt.a and for lib/libboost_filesystem-mt.a(operations.o) I found this function: 0000000000007720 T __ZN5boost10filesystem6detail9copy_fileERKNS0_4pathES4_NS1_11copy_optionEPNS_6system10error_codeE or boost::filesystem::detail::copy_file(boost::filesystem::path const&, boost::filesystem::path const&, boost::filesystem::detail::copy_option, boost::system::error_code*) I see that this differs from what the linker is looking for in that copy_option (third parameter) is in the detail name space. Any ideas on where to go from here? Thanks

1 0

Iterating "root" vertices with boost::graph
by Isaac Lascasas 25 Nov '15

25 Nov '15

Hello I want to enumerate all vertices with zero input edge count in a graph, I am using DFS right now: struct vertex_visitor : public boost::default_dfs_visitor { std::vector<vertex_t> Output; void discover_vertex(vertex_t v, graph_t const& g) { graph_t::in_edge_iterator edgeIt, edgeEnd; tie(edgeIt, edgeEnd) = boost::in_edges(v, g); if (edgeIt==edgeEnd) Output.push_back(v); } }; vertex_visitor vis; boost::depth_first_search(g, boost::visitor(v)); However I don't know how to cleanly stop execution after depth 0 inside my visitor and I can't figure out a better way to archieve this. Since I am fairly new to boost graph I supose that I'm missing something. Thanks.

2 1

Extend boost binary serialization with varints encoding
by Ernest Zaslavsky 24 Nov '15

24 Nov '15

Is it feasible to provide boost binary serialization with varint encoding capabilities? How does one achieve that? Can one just create template overload of "save" and "load" for unsigned integrals? anything else should be changed? [Read More]<http://feeds.feedburner.com/~r/sizmek-blog/~6/1> [http://www.sizmek.com/Sizmek.png]<http://www.sizmek.com/>

3 8

[type_erasure] BOOST_TYPE_ERASURE_MEMBER within namespace?
by Nat Goodspeed 23 Nov '15

23 Nov '15

I find that using BOOST_TYPE_ERASURE_MEMBER within my own namespace fails with compilation errors: myprog.cpp:23:1: error: no template named 'concept_interface'; did you mean '::boost::type_erasure::concept_interface'? This is with Boost 1.57, compiled with Apple clang from Xcode 7.1.1. Moving BOOST_TYPE_ERASURE_MEMBER to the global namespace allows successful compilation. I would rather avoid putting my has_member names into the global namespace. How to achieve that?

2 1

Consistency when removing items from boost multi-index using an inner iterator
by Hovnatan Karapetyan 23 Nov '15

23 Nov '15

Hi, I already posted this same question on StackOverflow, since I have not gotten an answer yet reposting it here too. Suppose I am iterating over a boost::multi_index using one of the two indices. Then if I start iterating using the other index and erasing an element according some criteria, does that invalidate the upper iterator? E.g., struct person { string name; string last_name; string age;} typedef multi_index< person, index_by< ordered_non_unique<person, string, &person::name>, ordered_non_unique<person, string, &person::age> >> PersonCollection; PersonCollection pc; //insert some elements into pc auto index0 = pc.get<0>();auto range0 = index0.equal_range("John");while (range0.first != range0.second) { auto index1 = pc.get<1>(); auto range1 = index1.equal_range(34); while (range1.first != range1.second) { if (range1.first->last_name == "Smith") range1.first = index1.erase(range1.first); else ++range1.first; } ++range0.first;} So in this case, is the range0 iterator always valid? Thanks! Hovnatan

2 2

[BGL]Using a function for weightmap to dijkstra_shortest_path
by Amit Prakash Ambasta 23 Nov '15

23 Nov '15

Hi, I am trying to write use BGL.dijkstra to calculate a shortest path in a time dependent network where edge.cost C(u, v) is a function of distance(a)edge.source and a variable wait time dependent on Edge.departure i.e. Cost(Edge(u,v), D(u)) = Wait(Edge(u, v).departure, D(u)) + Edge(u, v).delay The cost function ( and edge property is defined as): struct Eonnection { Eonnection(const Vertex source, const Vertex destination, const double departure, const double duration, const double cost) { this->source = source; this->destination = destination; this->departure = departure; this->duration = duration; this->cost = cost; }; Vertex source; Vertex destination; double departure; // Time of departure double duration; // Duration of traversing edge double cost; // Actual cost of traversing Edge std::pair<double, double> dyn_cost(std::vector<std::pair<double, double> > distances, double t_max) { std::pair<double, double> d_parent = distances[this->source]; double t_parent = d_parent.first; double c_parent = d_parent.second; double t_time_of_day = fmod(t_parent, 24 * 3600); double t_delay = t_time_of_day <= this->departure ? this->departure - t_time_of_day: this->departure + (24 * 3600 - t_time_of_day); double t_total = t_parent + t_delay + this->duration; if(t_total < t_max) { std::cout << "Edge usable with cost " << c_parent + this->cost << ", " << t_total << std::endl; return std::pair<double, double>(c_parent + this->cost, t_total); } else { std::cout << "Edge unusable" << std::endl; return std::pair<double, double>(std::numeric_limits<double>::infinity(), std::numeric_limits<double>::infinity()); } }; }; I'm trying to call dijkstra as dijkstra_shortest_paths_no_color_map( g, source, boost::make_iterator_property_map(pred.begin(), get(boost::vertex_index, g)), boost::make_iterator_property_map(distances.begin(), get(boost::vertex_index, g)), boost::make_transform_value_property_map( boost::bind<std::pair<double, double> >(&Eonnection::dyn_cost, _1, _2, distances, 24 * 3600 * 3), get(boost::edge_bundle, g) ), get(vertex_index, g), smaller, combiner, std::pair<double, double>(std::numeric_limits<double>::infinity(), std::numeric_limits<double>::infinity()), std::pair<double, double>(0, 0), vis ); However, this does not seem to work. How can I pass the weights as a dynamic function to dijkstra_shortest_paths?

1 0

Levelization of DAG in Boost graph -- trying again
by bhattach 20 Nov '15

20 Nov '15

Not sure why my previous attempt to post a new topic didn't succeed -- page kept showing a note that the post was not accepted by the mailing list. Trying one more time. ------------------------ Although I've been using graphs for 30+ years, I'm new to Boost Graph Library. I'd like to do "classical levelization" of a DAG -- as is commonly used in applications like digital logic simulation, etc -- whereby level(v) = max_level(set of predecessors of v) + 1 I used record_distances() with breadth_first_search() and suitably defined property map, but I suspect that's returning level(v) = min_level(set of predecessors of v) + 1 Is there a simple way to use breadth_first_search() to get the level numbers I want, or do I need to write my own levelization routine? Thanks in advance for comments/suggestions/pointers. Debashis Bhattacharya -- View this message in context: http://boost.2283326.n4.nabble.com/Levelization-of-DAG-in-Boost-graph-tryin… Sent from the Boost - Users mailing list archive at Nabble.com.

2 4

Asymmetry between function_input_iterator and function_output_iterator
by Daniel Hofmann 20 Nov '15

20 Nov '15

I experienced some issues and asymmetric behavior in the function input and output iterator interfaces [1] [2]. See the following small self-contained example: const auto two = make_function_input_iterator([]{ return 2; }, infinite{}); copy_n(two, 3, ostream_iterator<int>(cout, "\n")); This does not compile --- but it should, in my opinion. The problem is that make_function_input_iterator has two overloads, one that takes a Function& and one that takes a Function*. Shouldn't this rather take a Function by-values as the stdlib does, and let the user pass a std::ref if needs be? Then we could also pass lambdas, making this a viable feature in C++11 and later. Without being able to pass lambdas, I see almost no value in the input iterator. On a related note, the documentation does not say that the make_function_iterator always needs an Input state. In addition, the link to the function input iterator PDF on the overview page [3] 404s. Now to the function output iterator: const auto dummy_out = make_function_output_iterator([](int) {}); copy_n(nums, 3, dummy_out); Surprisingly this compiles since make_function_output_iterator takes its functor by const-ref (with a defaulted functor argument, which does not really make sense in my opinion, since the reason for the make_* function is type inference through the passed parameter). Note, though, how the function output iterator lives in the same iterators namespace as the functio input iterator, but is not inside the iterator directory. The respective headers are located at: boost/function_output_iterator.hpp boost/iterator/function_input_iterator.hpp I would love to understand the design decisions behind these, and if it would be possible to "modernize" them without breaking much of the interfaces. Cheers, Daniel J H [1] http://www.boost.org/doc/libs/1_59_0/libs/iterator/doc/function_input_itera… [2] http://www.boost.org/doc/libs/1_59_0/libs/iterator/doc/function_output_iter… [3] http://www.boost.org/doc/libs/1_59_0/libs/iterator/doc/index.html

1 0

boost interprocess named_mutex: race condition at creation?
by Liwei Peng 20 Nov '15

20 Nov '15

Hi, I am using named_mutex for synchronization among multiple processes. If all of the processes try to open_or_create the same-name named_mutex: named_mutex mutex(open_or_create, "somename"); 1) Is there any race condition for mutex creation? Or the API will guarantee one will create and all others will open? 2) If there is race condition, what are the work-arounds for this on Linux? Thanks, Liwei

2 1

A few ICL questions.
by Stephen Hewitt 19 Nov '15

19 Nov '15

I'm new to ICL and have a few questions and a problem. Here is my test code which demonstrated (Windows, MSVC 2012): > // "icl_question.cpp" > > >> #include "precomp.hpp" > > #include <iostream> > > #include <utility> > > #include <functional> > > #include <boost/cstdint.hpp> > > #include <boost/icl/closed_interval.hpp> > > #include <boost/icl/interval_map.hpp> > > >> typedef boost::icl::closed_interval<boost::uint16_t> interval_t; > > >> // Based on the in "boost/icl/functors.hpp". > > template <typename Type> struct inplace_assign > > : public boost::icl::identity_based_inplace_combine<Type> > > { > > typedef inplace_assign<Type> type; > > >> void operator()(Type& object, const Type& operand) const > > { > > object = operand; > > } > > }; > > >> // Why is the 7 template parameter not a template template parameter? > > // The code in "boost/icl/detail/design_config.hpp" does not define the > > // ICL_USE_INTERVAL_TEMPLATE_TYPE macro (I assume intentionally) which, if > > // defined, would make it so. > > typedef boost::icl::interval_map > > < > > boost::uint16_t, > > const char*, > > boost::icl::partial_absorber, > > std::less, > > inplace_assign, > > boost::icl::inter_section, > > interval_t > > > map_t; > > >> int main(int argc, char *argv[]) > > { > > using namespace std; > > >> map_t mem; > > // The commented line two down is what I intend, but it asserts at >> runtime. > > // This one works. > > mem += make_pair(interval_t(0, 0xfffe), "RAM"); > > //mem += make_pair(interval_t(0, 0xffff), "RAM"); > > mem += make_pair(interval_t(0xa000, 0xbfff), "Basic ROM"); > > >> cout << hex << mem << endl; > > >> return 0; > > } > > The first question is about the aggregate on collision functionality. I would just like to replace. I have implemented *inplace_assign *which does this but it seems strange that this isn't included. Am I missing something here (I fear I may well be)? The second question is why* interval_map*'s 7th template parameter ( *Interval*) is not a template template parameter. The code in "boost/icl/detail/design_config.hpp" does not define the *ICL_USE_INTERVAL_TEMPLATE_TYPE *macro (I assume intentionally) which, if defined, would make it so. The third question is about a runtime error I'm getting in the above code. The comment in *main *shows the scenario. Basically if I use *0xffff *as the end of the first range I get an ASSERT at runtime whereas 0xfffe works fine. Finally, the documentation seems a little sparse on the function of the *Section* template parameter. Any clarification on that would be appreciated.

2 2

[ICL] seems not to handle sets that contain the maximum element of the domain type.
by Stephen Hewitt 18 Nov '15

18 Nov '15

ICL seems not to handle sets that contain the maximum element of the domain type. I sent a similar mail a day ago, but I've simplified my example. Here's the code: Windows 7 Boost 1.59.0 ----BEGIN CODE--- using namespace std; typedef boost::icl::closed_interval<boost::uint16_t, std::less> interval_t; typedef boost::icl::split_interval_set<boost::uint16_t, std::less, interval_t> set_t; set_t s; s += interval_t(0x0000, 0xffff); s += interval_t(0xa000, 0xbfff); cout << "BAD: " << hex << s << endl; s.clear(); s += interval_t(0x0000, 0xfffe); s += interval_t(0xa000, 0xbfff); cout << "GOOD: " << hex << s << endl; ----END CODE--- ---BEGIN OUTPUT--- BAD: {[0,9fff][a000,ffff]} GOOD: {[0,9fff][a000,bfff][c000,fffe]} ---END OUTPUT--- The bad example seems to fail because the set contains 0xffff. In the good example I use 0xfffe.

2 1

libboost_system-vc110-XXXX_54.lib: Why can't I use the static boost library?
by Andreas Kopeinig 17 Nov '15

17 Nov '15

Hello everybody, I try to use the boost libraries libboost_filesystem.lib and libboost_system.lib, both version 54, in a project about image processing using the Xbox kinect sensor. I want to use the prebuild windows binaries from the following link: http://sourceforge.net/projects/boost/files/boost-binaries/ I referenced the static libs correctly in visual studio in the project properties under "Linker->General->Additional Library Directories" and "Linker->Input->Additional Dependencies" and I also set the path to the headers under "C/C++ -> General-> Additional Include Directories". But when I want to build my code, I get the following linker error: " LNK1181: cannot open file 'libboost_system.obj' ". Why is this happening? Is this object file missing in the archive? If yes, why? In particular I want to use libboost_filesystem-vc110-mt-1_54.lib, libboost_filesystem-vc110-mt-gd-1_54.lib, libboost_system-vc110-mt-1_54.lib and libboost_system-vc110-mt-gd-1.lib Thank you very much, Andy

4 4

help using async_wait
by Lane 17 Nov '15

17 Nov '15

I'm trying to have a file automatically close when a deadline_timer is expired. Seeing that a file is no longer open, another file will get created and a timer started. But I'm having some issues understanding deadline_timer. I believe the io.run() in start_timer blocks (thinking that async_wait shouldn't block), so I tried to put it on it's own thread so that my main would continue to loop and write to the file while a timer is running in the background which would eventually close the file. Anyone see where I'm going wrong? --- void MyFileTimer::start_timer() { ba::deadline_timer timer(io, boost::posix_time::seconds(10)); timer.async_wait(boost::bind(&MyFileTimer::timer_expired, this, _1)); t_thread = unique_ptr<boost::thread>( new boost::thread(boost::bind(&ba::io_service::run, &io))); io.run(); } void MyFileTimer::timer_expired(const boost::system::error_code& e) { // Closing file my_file.flush(); my_file.close(); io.reset(); t_thread->join(); } bool MyFileTimer::create_file() { // ... string filename = my_unique_file_name; my_file.open(filename, ios::out); start_timer(); return true; } --- snip of main --- while (true) { if (!my_file.is_open()) { create_file(); } my_file->write(str); }

2 1

[Algorithm] Boyer-Moore Search - Does it use The Galil Rule?
by Vidya Wasi 14 Nov '15

14 Nov '15

Hi, I've been fiddling with search algorithms and am now relearning Boyer-Moore. From the documentation I cannot tell if the algorithm is using The Galil Rule. Since I'm still inexperienced in understanding the algorithm I'm wondering if the boost implementation do use The Galil Rule? Regards, Boost casual user

1 0

Boost 1.60.0 beta 1 Release Candidate 3 available for testing
by Marshall Clow 14 Nov '15

14 Nov '15

Release candidate files for 1.60.0 beta 3 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. Changes since rc1: * Boost.Sprit has been updated and Boost.Log now builds. * Boost.Math has been updated and now builds. [ Note: The RC2 files that I posted yesterday were incorrectly produced. RC3 is identical to what RC2 should have been -- end note ] Known issues: * Errors when building libraries for visual studio: test and type_erasure. * Boost.Test fails when building on Darwin with gcc 4.9.2 The files (and associated md5s) are: MD5 (boost_1_60_0_b1_rc3.7z) = cfac18348700d0e6c1a0e4418a57e9aa MD5 (boost_1_60_0_b1_rc3.tar.bz2) = d3cb5a59e5b38555096814a6bfbcb441 MD5 (boost_1_60_0_b1_rc3.tar.gz) = db9b011547b8933454d0dfe31f7b8551 MD5 (boost_1_60_0_b1_rc3.zip) = 216c7cd0c15c096ece24d2649a272b51 Thanks! -- The release managers

2 3

linker errors in vs2012 and boost 1.59...
by TUELLER, SHAYNE R CIV USAF AFMC 519 SMXS/MXDEC 12 Nov '15

12 Nov '15

All, I'm trying to compile my application which uses boost 1.59 prebuilt binaries for vs2012. Things compile and link just fine in debug mode but I'm having the following linker errors when I try to build in release mode... GRTXserver.obj : error LNK2001: unresolved external symbol "public: void __cdecl boost::container::container_detail::has_member_function_named_construct<clas s boost::container::new_allocator<char> >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator @D@container@boost@@@container_detail@container@boost@@QEAAXXZ) 1>GRTXserver.obj : error LNK2001: unresolved external symbol "public: void __cdecl boost::container::container_detail::has_member_function_named_construct<clas s boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<class boost::container::basic_string<char,struct std::char_traits<char>,class boost::container::new_allocator<char> > const ,struct boost::interprocess::ipcdetail::ref_count_ptr>,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator @U?$tree_node@U?$pair@$$CBV?$basic_string@DU?$char_traits@D@std@@V?$new_allo cator@D@container@boost@@@container@boost@@Uref_count_ptr@ipcdetail@interpro cess@3@@std@@PEAX$0A@$00@container_detail@container@boost@@@container@boost@ @@container_detail@container@boost@@QEAAXXZ) 1>C:\GRTXserver\x64\Release\GRTXserver.exe : fatal error LNK1120: 2 unresolved externals I've tried everything but I just can't get it to work. Any ideas or is anyone else having this problem? Thanks, -Shayne

1 0

Boost 1.60.0 beta 1 Release Candidates available for testing
by Marshall Clow 11 Nov '15

11 Nov '15

Release candidate files for 1.60.0 beta 1 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. IMPORTANT NOTE: The files (and associated md5s) are: MD5 (boost_1_60_0_b1_rc1.7z) = ac6b2128d951ad688421fde2d878c2a7 MD5 (boost_1_60_0_b1_rc1.tar.bz2) = 2fc232f255f1ce8868315da207c05b6b MD5 (boost_1_60_0_b1_rc1.tar.gz) = d594e10f2761abaf957a67c6a223d2a4 MD5 (boost_1_60_0_b1_rc1.zip) = 16a2d512fca7995d5fa421d13f841b0f Thanks! -- The release managers

6 15

[coroutines2] Building coroutines2 examples
by Adi Shavit 10 Nov '15

10 Nov '15

Hi, I'm trying to build the Boost 1.59 coroutine and coroutine2 examples. I built boost with b2 (complete build) and am using CMake to generate a VC2015 project to build the samples. All the coroutine samples build and run just fine, but I get *linking* errors with the coroutine2 samples. My CMakeLists.txt file is straightforward, just find boost, include the headers and link to the boost libs: project (coroutines-samples) cmake_minimum_required(VERSION 2.8) find_package(Boost REQUIRED) include_directories(${Boost_INCLUDE_DIR}) link_directories(${Boost_LIBRARY_DIRS}) add_executable(chaining.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/chaining.cpp) add_executable(echo.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/echo.cpp) add_executable(exception.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/exception.cpp) add_executable(fibonacci.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/fibonacci.cpp) add_executable(layout.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/layout.cpp) add_executable(parallel.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/parallel.cpp) add_executable(power.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/power.cpp) add_executable(same_fringe.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/same_fringe.cpp) add_executable(segmented_stack.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/segmented_stack.cpp) add_executable(simple.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/simple.cpp) add_executable(unwind.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/asymmetric/unwind.cpp) add_executable(dice_game.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/symmetric/dice_game.cpp) add_executable(merge_arrays.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/symmetric/merge_arrays.cpp) add_executable(segmented_stack1.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/symmetric/segmented_stack.cpp) add_executable(simple1.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/symmetric/simple.cpp) add_executable(unwind1.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp03/symmetric/unwind.cpp) add_executable(await_emu.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/asymmetric/await_emu.cpp) add_executable(fibonacci11.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/asymmetric/fibonacci.cpp) add_executable(iterator_range.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/asymmetric/iterator_range.cpp) add_executable(layout11.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/asymmetric/layout.cpp) add_executable(same_fringe11.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/asymmetric/same_fringe.cpp) add_executable(merge_arrays1.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/symmetric/merge_arrays.cpp) add_executable(simple2.cpp /some/path/boost_1_59_0/libs/coroutine/example/cpp11/symmetric/simple.cpp) # coroutines2 add_executable(coro2_fibonacci /some/path/boost_1_59_0/libs/coroutine2/example/fibonacci.cpp) add_executable(coro2_layout /some/path/boost_1_59_0/libs/coroutine2/example/layout.cpp) add_executable(coro2_parser /some/path/boost_1_59_0/libs/coroutine2/example/parser.cpp) add_executable(coro2_same_fringe /some/path/boost_1_59_0/libs/coroutine2/example/same_fringe.cpp) add_executable(coro2_segmented /some/path/boost_1_59_0/libs/coroutine2/example/segmented.cpp) add_executable(coro2_simple /some/path/boost_1_59_0/libs/coroutine2/example/simple.cpp) target_link_libraries(chaining.cpp ${Boost_LIBRARIES}) target_link_libraries(echo.cpp ${Boost_LIBRARIES}) target_link_libraries(exception.cpp ${Boost_LIBRARIES}) target_link_libraries(fibonacci.cpp ${Boost_LIBRARIES}) target_link_libraries(layout.cpp ${Boost_LIBRARIES}) target_link_libraries(parallel.cpp ${Boost_LIBRARIES}) target_link_libraries(power.cpp ${Boost_LIBRARIES}) target_link_libraries(same_fringe.cpp ${Boost_LIBRARIES}) target_link_libraries(segmented_stack.cpp ${Boost_LIBRARIES}) target_link_libraries(simple.cpp ${Boost_LIBRARIES}) target_link_libraries(unwind.cpp ${Boost_LIBRARIES}) target_link_libraries(dice_game.cpp ${Boost_LIBRARIES}) target_link_libraries(merge_arrays.cpp ${Boost_LIBRARIES}) target_link_libraries(segmented_stack1.cpp ${Boost_LIBRARIES}) target_link_libraries(simple1.cpp ${Boost_LIBRARIES}) target_link_libraries(unwind1.cpp ${Boost_LIBRARIES}) target_link_libraries(await_emu.cpp ${Boost_LIBRARIES}) target_link_libraries(fibonacci11.cpp ${Boost_LIBRARIES}) target_link_libraries(iterator_range.cpp ${Boost_LIBRARIES}) target_link_libraries(layout11.cpp ${Boost_LIBRARIES}) target_link_libraries(same_fringe11.cpp ${Boost_LIBRARIES}) target_link_libraries(merge_arrays1.cpp ${Boost_LIBRARIES}) target_link_libraries(simple2.cpp ${Boost_LIBRARIES}) target_link_libraries(coro2_fibonacci ${Boost_LIBRARIES}) target_link_libraries(coro2_layout ${Boost_LIBRARIES}) target_link_libraries(coro2_parser ${Boost_LIBRARIES}) target_link_libraries(coro2_same_fringe ${Boost_LIBRARIES}) target_link_libraries(coro2_segmented ${Boost_LIBRARIES}) target_link_libraries(coro2_simple ${Boost_LIBRARIES}) The linked does not seem to be able to find boost::system::system_category. This is my error log: 11>------ Build started: Project: coro2_fibonacci, Configuration: Debug x64 ------ 2>------ Build started: Project: coro2_layout, Configuration: Debug x64 ------ 3>------ Build started: Project: coro2_parser, Configuration: Debug x64 ------ 4>------ Build started: Project: coro2_same_fringe, Configuration: Debug x64 ------ 5>------ Build started: Project: coro2_segmented, Configuration: Debug x64 ------ 6>------ Build started: Project: coro2_simple, Configuration: Debug x64 ------ 1>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 1>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_fibonacci.exe : fatal error LNK1120: 1 unresolved externals 4>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 4>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_same_fringe.exe : fatal error LNK1120: 1 unresolved externals 6>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 2>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 3>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 5>libboost_context-vc140-mt-gd-1_59.lib(stack_traits.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system @boost@@YAAEBVerror_category@12@XZ) referenced in function "public: __cdecl boost::thread_exception::thread_exception(int,char const *)" (??0thread_exception@boost@@QEAA@HPEBD@Z) 6>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_simple.exe : fatal error LNK1120: 1 unresolved externals 2>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_layout.exe : fatal error LNK1120: 1 unresolved externals 3>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_parser.exe : fatal error LNK1120: 1 unresolved externals 5>\some\path\Coroutines\build\vs2015.x64\Debug\coro2_segmented.exe : fatal error LNK1120: 1 unresolved externals 7>------ Skipped Build: Project: ALL_BUILD, Configuration: Debug x64 ------ 7>Project not selected to build for this solution configuration ========== Build: 0 succeeded, 6 failed, 25 up-to-date, 1 skipped ========== What am I doing wrong? Thanks, Adi

1 0

Using boost on AIX with GCC
by Chris Franz 10 Nov '15

10 Nov '15

I'm trying to get started using boost on AIX with GCC. What I seem to be running into is that GCC has a "feature" on AIX such that system headers are wrappered with an implicit 'extern "C"'. I'm not finding a good way to include the boost headers because of this feature. As an example, using about the simplest boost header I could find: $ echo "#include <boost/function_equal.hpp>" > fe.cpp $ g++ fe.cpp -c -isystem/usr/local/include/boost-1_59 In file included from fe.cpp:1:0: /usr/local/include/boost-1_59/boost/function_equal.hpp:15:1: error: template with C linkage template<typename F, typename G> ^ /usr/local/include/boost-1_59/boost/function_equal.hpp:22:1: error: template with C linkage template<typename F, typename G> ^ $ One obvious possibility is to use -I instead of -isystem, but not treating boost headers as system headers results in a multitude of warnings using the verbosity we like to use (I've even run into some boost headers that emit errors if -pedantic-errors is specified). Do I need a different version of gcc and/or boost? How do other people configure this?

2 1

Newbie not able to compile mini_c example
by Dezai G 09 Nov '15

09 Nov '15

Hi boost usersIm newbye in using boost spirit.I have recenly downloaded boost 1.59 library. Im tryng than to compile the mini_c example both on windows with visual studio 2008 and on linux with gcc 4.4.6Im walking throught plenty of errors and didnt found in the documentation what is going wrong.I ve tryed several things throuh search in google but nothing seems to walk An example of error is for linux/gcc : boost_1_59_0/boost/utility/result_of.hpp:190: error: wrong number of template arguments (1, should be 3) Are my compilers incompatible with boost 1.59. In this case what should i use And what are the correct version of library should i use to be fully compliant with visual studio 2à08 or gcc 4.4.6 Best regardsDZ

1 0

[BGL] Connected components of a distributed graph with few edges
by Quaglino Alessio 06 Nov '15

06 Nov '15

Hello, I am trying to compute the number of connected components of a graph with only few edges (i.e. many vertices do not have edges). This works OK for a non-distributed graph. The simplest example of the issue I could come up with is the following: typedef adjacency_list <vecS, vecS, undirectedS> SerialGraph; typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, undirectedS> Graph; typedef iterator_property_map<std::vector<int>::iterator, property_map<Graph, vertex_index_t>::type> LocalMap; #ifdef PARALLEL_GRAPH Graph G(nV+1); synchronize(G); std::vector<int> localComponent(nV+1); LocalMap components(localComponent.begin(),get(vertex_index, G)); num = connected_components_ps(G, components); #else SerialGraph G(nV+1); std::vector<int> globalComponent(nV+1); num = connected_components(G, &globalComponent[0]); #endif The distributed version causes a seg fault when calling connected_components_ps, while the non-distributed works fine and correctly finds nV+1 components. If I populate the graph connecting all vertices with edges, both do work fine. What am I doing wrong? Thank you in advance. Regards, Alessio

2 8

BGL, Johnson all pair shortest path and C
by Paolo Bolzoni 05 Nov '15

05 Nov '15

Dear list, I have to use johnson all pair shortest path[1] to have the all pair distance matrix and pass it to a C function. Here is the problem, the C function expect a row-order array, while the Johnson expect a BasicMatrix[2] that understands the m[row][col] syntax. I solved it as shown in the bottom of the email, but it seems so convoluted, is there a simpler way I missed? Yours faithfully, Paolo [1] http://www.boost.org/doc/libs/release/libs/graph/doc/johnson_all_pairs_shor… [2] http://www.boost.org/doc/libs/release/libs/graph/doc/BasicMatrix.html /* -------------- */ //p is the graph //distance_matrix is a std vector auto size = boost::num_vertices(p); Matrix distance_matrix1(distance_matrix, size, size); MatrixR distance_matrix_wrapper(distance_matrix1); //pass distance_matrix_wrapper to johnson algorithm. /* -------------- */ struct Matrix { Matrix(std::vector<int64_t>& storage, size_t rows, size_t columns) : m_{storage}, columns_{columns} { m_.clear(); m_.resize(rows * columns_, int64_t{0}); } int64_t& get(size_t row, size_t column) { return m_[row * columns_ + column]; } std::vector<int64_t>& m_; size_t columns_; }; struct MatrixR; struct MatrixRR { MatrixRR(MatrixR const& m, size_t column) : m_{m}, column_{column} {} int64_t& operator[] (size_t row) const; MatrixR const& m_; size_t column_; }; struct MatrixR { MatrixR(Matrix& m) : m_{m} {} MatrixRR operator[] (size_t column) const { return MatrixRR(*this, column); } Matrix& m_; }; int64_t & MatrixRR :: operator[] (size_t row) const { return m_.m_.get(row, column_); }

1 0

Cannot get boost::asio::read_until to properly read a line. [new to boost/asio]
by Nick Chambers 04 Nov '15

04 Nov '15

Hello everyone! I'm writing an IRC framework (still in very rough, early stages), and am having trouble reading a single line from the server (in this case irc.freenode.net:6667). Ideally, I would get output that looks like the following: > :wolfe.freenode.net NOTICE * :*** Looking up your hostname... > :wolfe.freenode.net NOTICE * :*** Checking Ident > :wolfe.freenode.net NOTICE * :*** Your forward and reverse DNS do not > match, ignoring hostname > :wolfe.freenode.net NOTICE * :*** No Ident response > :wolfe.freenode.net 001 foobarbazball :Welcome to the freenode Internet > Relay Chat Network foobarbazball > :wolfe.freenode.net 002 foobarbazball :Your host is wolfe.freenode.net[ > 91.217.189.44/6667], running version ircd-seven-1.1.3 > :wolfe.freenode.net 003 foobarbazball :This server was created Sun Aug 2 > 2015 at 18:58:22 UTC > :wolfe.freenode.net 004 foobarbazball wolfe.freenode.net ircd-seven-1.1.3 > DOQRSZaghilopswz CFILMPQSbcefgijklmnopqrstvz bkloveqjfI > :wolfe.freenode.net 005 foobarbazball CHANTYPES=# EXCEPTS INVEX > CHANMODES=eIbq,k,flj,CFLMPQScgimnprstz CHANLIMIT=#:120 PREFIX=(ov)@+ > MAXLIST=bqeI:100 MODES=4 NETWORK=freenode KNOCK STATUSMSG=@+ CALLERID=g > :are supported by this server > :wolfe.freenode.net 005 foobarbazball CASEMAPPING=rfc1459 CHARSET=ascii > NICKLEN=16 CHANNELLEN=50 TOPICLEN=390 ETRACE CPRIVMSG CNOTICE DEAF=D > MONITOR=100 FNC > TARGMAX=NAMES:1,LIST:1,KICK:1,WHOIS:1,PRIVMSG:4,NOTICE:4,ACCEPT:,MONITOR: > :are supported by this server > :wolfe.freenode.net 005 foobarbazball EXTBAN=$,ajrxz WHOX CLIENTVER=3.0 > SAFELIST ELIST=CTU :are supported by this server > :wolfe.freenode.net 251 foobarbazball :There are 153 users and 93407 > invisible on 27 servers > :wolfe.freenode.net 252 foobarbazball 24 :IRC Operators online > :wolfe.freenode.net 253 foobarbazball 8 :unknown connection(s) > :wolfe.freenode.net 254 foobarbazball 54832 :channels formed > :wolfe.freenode.net 255 foobarbazball :I have 6701 clients and 1 servers > :wolfe.freenode.net 265 foobarbazball 6701 7241 :Current local users > 6701, max 7241 > :wolfe.freenode.net 266 foobarbazball 93560 97293 :Current global users > 93560, max 97293 > :wolfe.freenode.net 250 foobarbazball :Highest connection count: 7242 > (7241 clients) (668628 connections received) > :wolfe.freenode.net 375 foobarbazball :- wolfe.freenode.net Message of > the Day - > :wolfe.freenode.net 372 foobarbazball :- Welcome to wolfe.freenode.net in > Stockholm, SE. > :wolfe.freenode.net 372 foobarbazball :- Thanks to > http://www.portlane.com/ for sponsoring > :wolfe.freenode.net 372 foobarbazball :- this server! > :wolfe.freenode.net 372 foobarbazball :- > :wolfe.freenode.net 372 foobarbazball :- WOLFE, GENE [1931-]. Prolific > writer of short stories and > :wolfe.freenode.net 372 foobarbazball :- novels. His best-known work is > the multi-volume novel The > :wolfe.freenode.net 372 foobarbazball :- Book of the New Sun. He has won > multiple awards including > :wolfe.freenode.net 372 foobarbazball :- the Nebula Award, the World > Fantasy Award, The Campell > :wolfe.freenode.net 372 foobarbazball :- Memorial Award and the Locus > Award. He was awarded the World > :wolfe.freenode.net 372 foobarbazball :- Fantasy Award for lifetime > achievement in 1996. > :wolfe.freenode.net 372 foobarbazball :- > :wolfe.freenode.net 372 foobarbazball :- Welcome to freenode - supporting > the free and open source > :wolfe.freenode.net 372 foobarbazball :- software communities since 1998. > :wolfe.freenode.net 372 foobarbazball :- > :wolfe.freenode.net 372 foobarbazball :- By connecting to freenode you > indicate that you have read and > :wolfe.freenode.net 372 foobarbazball :- accept our policies as set out > on http://www.freenode.net > :wolfe.freenode.net 372 foobarbazball :- freenode runs an open proxy > scanner. Please join #freenode for > :wolfe.freenode.net 372 foobarbazball :- any network-related questions or > queries, where a number of > :wolfe.freenode.net 372 foobarbazball :- volunteer staff and helpful > users will be happy to assist you. > :wolfe.freenode.net 372 foobarbazball :- > :wolfe.freenode.net 372 foobarbazball :- You can meet us at FOSSCON ( > http://www.fosscon.org) where we get > :wolfe.freenode.net 372 foobarbazball :- together with like-minded FOSS > enthusiasts for talks and > :wolfe.freenode.net 372 foobarbazball :- real-life collaboration. > :wolfe.freenode.net 372 foobarbazball :- > :wolfe.freenode.net 372 foobarbazball :- We would like to thank Private > Internet Access > :wolfe.freenode.net 372 foobarbazball :- ( > https://www.privateinternetaccess.com/) and the other > :wolfe.freenode.net 372 foobarbazball :- organisations that help keep > freenode and our other projects > :wolfe.freenode.net 372 foobarbazball :- running for their sustained > support. > :wolfe.freenode.net 372 foobarbazball :- > :wolfe.freenode.net 372 foobarbazball :- In particular we would like to > thank the sponsor > :wolfe.freenode.net 372 foobarbazball :- of this server, details of which > can be found above. > :wolfe.freenode.net 372 foobarbazball :- > :wolfe.freenode.net 376 foobarbazball :End of /MOTD command. > :foobarbazball MODE foobarbazball :+i > My output on the other hand looks more like: > :sendak.freenode.net NOTICE * :*** Looking up your hostname... > :sendak.freenode.net NOTICE * :*** Checking Ident > :sendak.freenode.net NOTICE * :*** No Ident response > :sendak.freenode.net 001 squawker :Welcome to the freenode Internet Relay > Chat Network squawker > Ibq,k,flj,CFLMPQScgimnprstz CHANLIMIT=#:120 PREFIX=(ov)@+ MAXLIST=bqeI:100 > MODES=4 NETWORK=freenode KNOCK STATUSMSG=@+ CALLERID=g :are supported by > this server > upported by this server > 93546, max 95827 > freenode.net 372 squawker :- SENDAK, MAURICE [1928-2012]. The author of > Seven Little > 372 squawker :- Welcome to freenode - supporting the free and open source > wker :- any network-related questions or queries, where a number of > sendak.freenode.net 372 squawker :- We would like to thank Private > Internet Access > :- of this server, details of which can be found above. > main.cpp: > #include <IRCClient/client.hpp> > /* > #include <IRCClient/logger.hpp> > #include <IRCClient/plugin.hpp> > */ > > int main(int argc, char *argv[]) { > /* > if(argc > 2) { > logger::log(logger::output_type::STDERR, "usage: {1} > [config_file]", argv[0]); > return 1; > } > */ > client::irc bot( > "irc.freenode.net", // server to connect to > "6667", // port to connect on > "", // password > false, // don't connect with ssl > "squawker", // nick > "squawker", // realname > "A c++11 Utility bot written by nchambers", // ident > "#cplusplus.com", // channels to join > "." // command prefix > ); > > bot.on_connect([&bot]() -> void { > bot.nickserv(client::ns::identify, <REDACTED>); > }); > /* > bot.add_handler(client::input_type::privmsg, [](std::string channel, > std::string user, std::string msg) -> void { > logger::log(logger::output_type::STDOUT, "[{1}/{2}] {3}", user, > channel, msg); > }); > > bot.add_handler(client::input_type::command, "load", > [&bot](std::string channel, std::string user, std::string msg) -> void { > bot.load_plugin(plugin::plugin(msg)); > > if(bot.plugin_operation_successful()) { > logger::log(logger::output_type::STDOUT, "successfully loaded > plugin {1}", msg); > bot.msg(channel, "{1}: successfully loaded plugin {2}", user, > msg); > } > > else { > logger::log(logger::output_type::STDERR, "failure to load > plugin {1}", msg); > bot.msg(channel, "{1}: failure to load plugin {2}", user, msg); > } > }); > > bot.add_handler(client::input_type::command, "unload", > [&bot](std::string channel, std::string user, std::string msg) -> void { > bot.unload_plugin(plugin::plugin(msg)); > > if(bot.plugin_operation_successful()) { > logger::log(logger::output_type::STDOUT, "successfully > unloaded plugin {1}", msg); > bot.msg(channel, "{1}: successfully unloaded plugin {2}", > user, msg); > } > > else { > logger::log(logger::output_type::STDERR, "failure to unload > plugin {1}", msg); > bot.msg(channel, "{1}: failure to unload plugin {2}", user, > msg); > } > }); > > bot.add_handler(client::input_type::command, "reload", > [&bot](std::string channel, std::string user, std::string msg) -> void { > bot.reload_plugin(plugin::plugin(msg)); > > if(bot.plugin_operation_successful()) { > logger::log(logger::output_type::STDOUT, "successfully > reloaded plugin {1}", msg); > bot.msg(channel, "{1}: successfully reloaded plugin {2}", > user, msg); > } > > else { > logger::log(logger::output_type::STDERR, "failure to reload > plugin {1}", msg); > bot.msg(channel, "{1}: failure to reload plugin {2}", user, > msg); > } > });*/ > > bot.run(); > return 0; > } > client.hpp: > #ifndef _ROOT_SQUAWKER_IRCCLIENT_CLIENT_HPP__ > #define _ROOT_SQUAWKER_IRCCLIENT_CLIENT_HPP__ > > #include <string> > #include <functional> > > #include <boost/asio.hpp> > > namespace client { > enum class ns: int { > identify=0, > }; > > enum class input_type: int { > privmsg=0, > }; > > class irc { > public: > irc(std::string, std::string, std::string, bool, std::string, > std::string, std::string, std::string, std::string); > > void on_connect(std::function<void()>); > void nickserv(client::ns, std::string); > void run(); > > void send(std::string); > > private: > void connect(); > std::string readline(); > > std::string server; > std::string port; > std::string pass; > bool use_ssl; > std::string nick; > std::string realname; > std::string ident; > std::string channels; > std::string prefix; > std::function<void()> on_connect_callback; > boost::asio::io_service io_service; > boost::asio::ip::tcp::socket socket; > }; > } > > #endif > client.cpp: > #include <IRCClient/client.hpp> > #include <iostream> > #include <sstream> > #include <array> > > client::irc::irc( > std::string server, std::string port, std::string pass, > bool use_ssl, std::string nick, std::string realname, > std::string ident, std::string channels, std::string prefix > ) : > server(server), port(port), pass(pass), > use_ssl(use_ssl), nick(nick), realname(realname), > ident(ident), channels(channels), prefix(prefix), > on_connect_callback([]()->void{}), socket(this->io_service) { > } > > void client::irc::on_connect(std::function<void()> on_connect_callback) { > this->on_connect_callback = on_connect_callback; > } > > void client::irc::nickserv(client::ns command, std::string arguments) { > switch(command) { > case client::ns::identify: > this->send("nickserv identify " + arguments); > break; > } > } > > void client::irc::run() { > this->connect(); > > while(true) { > std::array<char, 128> buf; > boost::system::error_code error; > size_t len = this->socket.read_some(boost::asio::buffer(buf), > error); > > if(error == boost::asio::error::eof) { > break; > } > > else if (error) { > throw boost::system::system_error(error); > } > > std::cout.write(buf.data(), len); > } > } > > void client::irc::send(std::string msg) { > this->socket.write_some(boost::asio::buffer(msg + > std::string("\r\n"))); > } > > void client::irc::connect() { > boost::asio::ip::tcp::resolver resolver(this->io_service); > boost::asio::ip::tcp::resolver::query query(this->server, this->port); > boost::asio::ip::tcp::resolver::iterator endpoint_iterator = > resolver.resolve(query); > > boost::asio::connect(this->socket, endpoint_iterator); > this->send("NICK " + this->nick); > this->send("USER " + this->realname + " * * :" + this->ident); > > while(true) { > std::string line = this->readline(); > std::cout << line << std::endl; > > if(line == ":squawker MODE squawker :+i") { > break; > } > } > > this->on_connect_callback(); > } > > std::string client::irc::readline() { > boost::asio::streambuf buffer; > size_t received = boost::asio::read_until(this->socket, buffer, > "\r\n"); > std::istream is(&buffer); > std::string line; > std::getline(is, line); > return std::string(std::begin(line), std::end(line)-1); > } > any help would be very much appreciated! thank you in advance!

2 2

[BGL] Correct idiom for working with vertices.
by Matthew Markland 04 Nov '15

04 Nov '15

All: I'm building a graph on which I will be running betweenness centrality. This graph consists of a number of edges represented as pairs. For example 1 20 15 10 would represent an edge from 1<->20 and one from 15<->10. These are bidirectional. My initial code created a property_map for the centrality results and then walked through that map using num_vertices(g) as the limit for the for-loop. What I've realized now, though, is that when BGL generates the values for num_vertices (and the iterators for vertices also), it "fills in" the gaps. So, in the graph above there would be 20 vertices that would be interated through even though most of those have no relation to edges in the graph. So, I'm wondering what the usual idiom is in this situation. Should I instead iterator over edges and pull information from the source and target vertices of the edges? Thanks in advance for the information! Matt ---- Matthew Markland mwmarkland(a)outlook.com

2 1

Re: [Boost-users] Crashing Issue
by swati upadhyaya 04 Nov '15

04 Nov '15

hi I am using like this where RunningThreads_ is vector containing boost thread object pointer(handler).I am using interrupt() for the interruption of thread interruption_point() catching that interruption then joining.everytime its crashing in join() for me but for others who have the same configuration its working fine all of us has windos 8. For me also it was working last week but this week the same piece of code is crashing. :( RunningThreads_[i].handle->interrupt(); RunningThreads_[i].handle->join(); delete RunningThreads_[i].handle; On Thu, Feb 5, 2015 at 9:31 AM, swati upadhyaya <swatiupadhyaya(a)gmail.com> wrote: > RunningThreads_[i].handle->interrupt(); > LOG4CPLUS_INFO(root, "Thread Interrupted for " << > RunningThreads_[i].app_name << " successful"); > RunningThreads_[i].handle->join(); > LOG4CPLUS_INFO(root, "Waiting for thread to exit " << > RunningThreads_[i].app_name << " successful"); > delete RunningThreads_[i].handle; > LOG4CPLUS_INFO(root, "Thread handle for " << > RunningThreads_[i].app_name << " successfully deleted"); > //RunningThreads_.erase(i); > > On Wed, Feb 4, 2015 at 12:10 AM, Vicente J. Botet Escriba < > vicente.botet(a)wanadoo.fr> wrote: > >> Le 03/02/15 09:10, swati upadhyaya a écrit : >> >> In my code join() timed_joined() is crashing, I am using these API >> after interrupt(),Same piece of code is working for others but in my system >> its crashing, >> Is there some dependency problem I am using >> Boost version: 1.55.0 >> OS: Windows 8 >> IDE: Visual Studio 2010 >> >> Hi, >> >> it could help if you post the example and the backtrace. >> >> Which version/OS/compiler use others for which this works? >> >> Vicente >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >> > >

3 2

[boost-test] print list of names of failing tests on failure
by Steve Lorimer 03 Nov '15

03 Nov '15

I don't believe there is currently a way to print only the list of tests which failed. --report_level=short only prints the numbers of passed and failing tests --report_level=detailed prints a very verbose list of all tests Is there a middle ground which will give me the names of tests which have failed, but not those which have passed? Something along the lines of: Test module "Master Test Suite" has failed with: 1 test case out of 9 failed 1 test case out of 9 aborted 1 assertion out of 30 failed Test case "foo_test" was aborted with: 1 assertion out of 1 failed TIA Steve

1 0

[boost::asio] [stream::ssl] stackful coroutine yield from SSL handshake in servername callback
by SamJam Liddicott 03 Nov '15

03 Nov '15

I'm testing a spoofing MITM SSL proxy based on boost::asio and boost::asio::stream::ssl, using boost 1.55 I register the tlsext_servername_callback, so that I can observe the called name during SSL handshake with the client. In the callback, I have the information needed to either get/create an appropriate SSL_CTX with certificates to use with the client, or start an SSL handshake with the server, to obtain the server certificate for re-signing and then put that back into the SSL_CTX to be passed to the client, before returning the tlsext_servername callback. It is clear that I must block the tlsext_servername callback from returning until I have the new SSL_CTX ready, which could take some time if I need to wait on a handshake with the real server. I can block return by performing a blocking handshake with the server, but then I consume one of the io_service threads merely blocking, and I don't want to waste them like that. I can successfully run it all as a new thread using blocking IO, in this form: ssl_connect(...) { boost::thread([...]() ({ sni_callback = [...](std::string server_name) { server.handshake(...); SSL_set_SSL_CTX(client.native_handle(), server.ctx)); }; client_socket.handshake(...); handler(); // really done by io_service.post }).detach(); } But I want to use stackful coroutines in the belief that thay are less costly and that I will be able to have more connections in progress (though I may have to link with BoringSSL). Using a coroutine spawn, I can convert the handshake with the server, like this: ssl_connect(...) { boost::asio::spawn(my_strand, [...](boost::asio::yield_context yield) { sni_callback = [...](std::string server_name) { server.async_handshake(..., yield[ec]); // <---- works nicely SSL_set_SSL_CTX(client.native_handle(), server.ctx)); }; client_socket.handshake(...); handler(); // really done by io_service.post }); } but the handshake with the client must remain blocking, otherwise, with: client_socket.async_handshake(..., yield[ec]); I get segfaults in the coroutine with unhelpful stack traces, mentioning only some SSL cleanup functions. However if the client connection hangs, then the client handshake can still hang and block a worker thread. My guess is that if the handshake with the client is not blocking, the SNI callback does not occur on the coroutine, and so I cannot properly block the return and possibly the use of yield in the SNI callback is invalid. If there is a solution that doesn't involve patching either libssl or stream::ssl, it will involve some asio_invoke_handler hooks. However, for that to work, the coroutine would have to be activated, but not to complete the async_handshake call. Instead it would be activated to handle the handshake read completion, leading to the parsing, SNI callback & return, further handshake write, and yield back to the io_service. I don't know if the coroutine/strand implementation can even do that -- be activated for work and not for return. So my first question is: is it likely possible to make coroutine do this? Looking in boost source detail/io.hpp for case engine::want_input_and_retry I notice: next_layer_.async_read_some( boost::asio::buffer(core_.input_buffer_), BOOST_ASIO_MOVE_CAST(io_op)(*this)); which seems to make no attempt to use asio_hanlder_invoke to allow it to be hooked, so that might need fixing. What sort of asio_handler_invoke hook would cause the handler to be invoked on the coroutine? Could strand.dispatch() do it? If it would, I'm not sure how to write such a hook either to work with argument dependent lookup, or to invoke in the coroutine. Otherwise I may as well stick to starting a scope-limited thread, and using blocking handshake operations. But I like to know the limits... Samjam

1 0

boost::math::cyl_bessel_j_zero: few NaN
by campagne 02 Nov '15

02 Nov '15

double order = (double)lcur + 0.5; unsigned int n_zeros; vector<double> zeros; boost::math::cyl_bessel_j_zero(order,1,n_zeros, back_inserter(zeros)); I'am running Boost 1.59 on Mac OS X Maverick for lcur = 0, I expect zeros filed with Pi, 2 Pi, 3Pi.... but the first two zeros I get NaN I get also other nan as for the 2nd zeros for lcur=1 Have you experienced such problem or I have a memory leak somewhere ? Thanks JE

2 1

Confused about the Boost.Build documentation
by Oodini 01 Nov '15

01 Nov '15

Hello, I wanted to read the doc of Boost.Build, but I find two documentations : 1. One from the link I can find on this page : http://www.boost.org/doc/ (at the booton, or at the bottom right corner, in th menu) 2. One I found throught from Google : http://www.boost.org/doc/libs/1_59_0/doc/html/bbv2.html I am not able to find it by navigating on the Boost site. Which page is the godd one ? Thanks.

2 4

[asio] Using io_service::poll() without pthread locking and unlocking
by ☂Josh Chia (谢任中) 31 Oct '15

31 Oct '15

I'm using boost::asio to do some TCP socket communication from a single-threaded program. The program performs asynchronous reads and writes and keeps calling io_service::poll() from a busy loop. I noticed from callgrind profiling that a significant portion of time is spent on pthread locking and unlocking from io_service::poll(). If I can get rid of the lock operations, the performance will improve significantly. Is there a way to get io_service to not use locks other than hacking the source code? It's a single-threaded application so the locking is unnecessary. The main reason I'm using asio is for the abstraction that allows me to write clean, simple, code, and hope I don't have to give up performance for simplicity. Josh

2 2

[icl] 'map::_add' ignores default-constructed value
by Filip Konvička 29 Oct '15

29 Oct '15

Hi, First of all thanks very much for the ICL! I'm using a boost::icl::interval_map with my own value type (struct V) and I have a custom value combining logic by passing boost::icl::inplace_et to the map and defining my own "operator&=" that provides the logic implementation. Now what happens is that my map ignores "m += make_pair(..., V())" because the default-constructed value is considered neutral due to: boost/icl/interval_base_map.hpp: ... interval_base_map<...>::_add(const segment_type& addend) { typedef typename on_absorbtion<type,Combiner, absorbs_identities<type>::value>::type on_absorbtion_; ... const codomain_type& co_val = addend.second; if(on_absorbtion_::is_absorbable(co_val)) return this->_map.end(); This 'if' returns without actually modifying the map. Is there some public API that I can use to tell my map that it should not consider any value 'absorbable'? And is it a good idea to change this? Thank you, Filip

1 0

[MSM] Solution for: fatal error C1202: recursive type or function dependency context too complex RE-POST
by Mark Bartosik 29 Oct '15

29 Oct '15

Sorry this is a re-post because my email client had formatting enabled. I have had a major headache while using MSM eUML state transition tables, thankfully I've found a simple solution. First MSM and especially eUML are great, and that's why I persevered to find a solution. Here's the problem: Declaring a complex eUML state transition table may result in the compiler generating an error. BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE(( // row_1, // row_2, // ... // row_a, // row_b, // row_c, // // Eventually the Microsoft compiler VS2008,2010,2012,2015 will all explode with fatal C1202: recursive type or function dependency context too complex ), transition_table ); I haven't tried with gcc. The solution is to break the state table in two smaller parts rather than one big table: BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE(( // row_1, // row_2, // ... ), transition_table_part_1 ); BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE(( // row_a, // row_b, // row_c ), transition_table_part_2 ); typedef boost::mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table; // No error, even though it contains just as many rows [Waffle warning] I think that what's happening is that once the compiler has fully described the transition_table_part1 it unwinds what it is doing, it is able to unwind and 'bank' transition_table_part1 as just being a type in it's memory, and when it comes to generate transition_table via boost::mpl::join_view it just constructing the resulting type list from two sets of previously 'banked' types. This is I think why I can still nest a sub-state machine which is on the limit of the complexity of state transition table it can contain; even though nesting state machines recursively references state transition tables. Things that did not work: [ more waffle ] There are some other solutions that I tried before I had the Eureka moment. One was to try to hide a sub-state machine within a concrete class but that didn't work because the outer fsm needs to see the inner stt. Another way was to implement a sub-state machine as a concrete state (not fsm), and then add a process_event method on the class which delegated to a member fsm which was hidden from the outer fsm, I got this to work, but it did not solve the problem, and I had to abandon use of exit_pt_, although it may have brought down compile times. Another helpful advantage of this solution is that the memory required by the compiler is significantly reduced. Christophe: Would you consider adding the example above to the MSM documentation, I would suggest under: Chapter 4, Compilers / Performance, Compilers Corner Also under: Chapter 5, Questions Answers and Tips: Question: Why do I get "fatal C1202: recursive type or function dependency context too complex" Answer: Likely because a state transition table has become two complex. Split the state transition table into two parts, and then use typedef mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table to join the two parts. Question: Why does my compiler generate a fatal out of memory fatal error. Answer: Likely because a state transition table has become two complex. Try and split the most complex state transition table into two parts, and then use typedef mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table to join the two parts. - Mark Bartosik

2 1

[Boost.Proto] implementing function call operators in expression trees
by Brook Milligan 29 Oct '15

29 Oct '15

I am trying to implement function call operators with Boost.Proto but cannot seem to figure out either how to set the expression trees up or how to evaluate them properly. The code below is simplified from the “checked calculator” example in the Proto documentation to focus on implementing a single identity function resulting from the Proto expression ‘identity(_1)’. The program prints the following function( terminal(9identity_) , terminal(0) ) result=0 [ expect 3 ] so I think the expression tree is correct. (I am, however, uncertain why the placeholder is reported as ‘terminal(0)’.) When the expression tree is evaluated with IdentityGrammar transform, the result is 0 not 3 as I would have expected if the placeholder value was used. The Proto documentation seems very thorough (at least after study), but is thin on the use of functions like this and is not helping me figure out the solution. I welcome any help that will point out the flaw(s) in this code for either setting up the expression tree or getting it evaluated correctly by calling the identity function with the correct argument. Thanks for your help. Cheers, Brook #include <boost/proto/proto.hpp> #include <boost/mpl/int.hpp> #include <boost/fusion/container/vector.hpp> #include <boost/fusion/container/generation/make_vector.hpp> namespace mpl = boost::mpl; namespace proto = boost::proto; namespace fusion = boost::fusion; template<typename I> struct placeholder : I {}; struct identity : proto::callable { typedef int result_type; int operator()(int a) const { return a; } }; struct identity_ {}; struct IdentityGrammar : proto::or_< proto::when< proto::terminal<placeholder<proto::_>> , proto::functional::at(proto::_state, proto::_value) > , proto::when<proto::terminal<identity_>, proto::_void> , proto::when< proto::function<IdentityGrammar, proto::terminal<proto::_>> , proto::and_< IdentityGrammar(proto::_child1) , identity(proto::_value(proto::_child1)) > > > {}; template<typename Expr> struct identity_expr; struct identity_domain : proto::domain<proto::pod_generator<identity_expr>, IdentityGrammar> {}; template<typename Expr> struct identity_expr { BOOST_PROTO_EXTENDS(Expr, identity_expr<Expr>, identity_domain) }; identity_expr<proto::terminal<identity_>::type> const identity = {{}}; identity_expr<proto::terminal<placeholder<mpl::int_<0> > >::type> _1; int main() { auto expr = identity(_1); proto::display_expr(expr); int result = IdentityGrammar()(expr,fusion::make_vector(3)); std::cout << "result=" << result << " [ expect 3 ]" << std::endl; return 0; }

1 0

Program Options: Omit positional arguments from help
by Florian Lindner 28 Oct '15

28 Oct '15

Hello, I have this piece of code: void getOptions(int argc, char *argv[]) { namespace po = boost::program_options; po::options_description desc("Artificial testing tool."); desc.add_options() ("help", "produce help") ("participant", po::value<std::string>(), "Participant Name"); po::positional_options_description pd; pd.add("participant", 1); po::variables_map vm; //po::store(po::parse_command_line(argc, argv, desc), vm); po::store(po::command_line_parser(argc, argv).options(desc).positional(pd).run(), vm); po::notify(vm); if (vm.count("help")) { std::cout << desc << std::endl; return; } } First question: Is the usage of po::store correct that way? I've found it somehwere on the internet but the documentation mentions no alternative parser call when using positional arguments. Main question: When using help it still displays --participant, albeit it's only a placeholder for the positional argument. Is there a way to hide a options or what is the correct way? Thanks, Florian

1 0

Missing something about Boost.Graph
by Dominique Devienne 28 Oct '15

28 Oct '15

We have a graph of relational tables, with the foreign keys being the edges of the graph. We're using boost::topological_sort() to sort the graph, and have struggled in the past with Boost.Graph. Recently we had cycles appearing in our graph, so I'm revisiting this code, and I think I must be missing something fundamental about Boost.Graph, because I get what I consider incoherent results. Here are the relevant code snippets. typedef std::pair<std::size_t, std::size_t> IndexPair; std::vector<IndexPair> edges; // fill edges with pairs of integers, in range [0, 111] (at the moment) using namespace boost; typedef property<vertex_color_t, default_color_type> GraphProperty; typedef adjacency_list<vecS, vecS, directedS, GraphProperty> Graph; typedef boost::graph_traits<Graph>::vertex_descriptor Vertex; Graph G(edges.begin(), edges.end(), edges.size()); size_t max_vrtx_index = 0; for (const auto& e : boost::make_iterator_range(boost::edges(G))) { size_t s = boost::source(e, G); size_t t = boost::target(e, G); max_vrtx_index = std::max(max_vrtx_index, s); max_vrtx_index = std::max(max_vrtx_index, t); } const auto G_vrtx_count = num_vertices(G); const auto G_edge_count = num_edges(G); if (G_vrtx_count != (max_vrtx_index + 1)) { std::cout << "Graph has " << G_vrtx_count << " vertices " "and " << G_edge_count << " edges, yet in reality " "our edges refer to at most " << max_vrtx_index << " vertices!" << std::endl; } This outputs: Graph has 1137 vertices and 1137 edges, yet in reality our edges refer to at most 111 vertices! How can num_vertices() and num_edges() return the same number? Why isn't num_vertices() returning 112 as I'd expect? I'm using 1.58. Thanks, --DD

2 2

[DLL] unclear how to specify calling convention for dll::import
by Konstantin Ivlev 27 Oct '15

27 Oct '15

Hello, I've just started using Boost.DLL in order to simplify loading of various WinApi functions exclusive to specific Windows versions, however, I've faced the issue (or may be it's just misunderstanding from my side). it's pretty well-known there are multiple calling conventions around - cdecl, stdcall, fastcall, etc. most of WinApi functions are in stdcall calling convention, while default one for MSVC 2015 is cdecl (unless compiler options are changed). I've read documentation on http://apolukhin.github.io/Boost.DLL/, as well as I've scanned source code a bit, but didn't find any avidence on how to specify calling convention of function I am importing. example from tutorial9 works just fine, as it uses timeGetTime function which has no arguments. however, if I modify example (see my code below copy-pasted from tutorial9) to import function with at least one argument or more (e.g. GetStdHandle) I receive the following debugger error: Run-Time Check Failure #0 - The value of ESP was not properly saved across a function call. This is usually a result of calling a function declared with one calling convention with a function pointer declared with a different calling convention. this indicates that Boost.DLL incorrectly interpreted stdcall function as cdeacl function that caused stack corruption. I've googled a bit about calling convention and boost, and found the following two definitions: #define BOOST_BIND_ENABLE_STDCALL #define BOOST_MEM_FN_ENABLE_STDCALL unfortunately adding them has no effect. if I add explicit __stdcall into the function typedef, then program no longer compiles #include <boost/dll/import.hpp> // for import #include <iostream> #include <windows.h> namespace dll = boost::dll; int main() { typedef HANDLE(GetStdHandle_fn)(DWORD nStdHandle); // function signature boost::function<GetStdHandle_fn> plugin = dll::import<GetStdHandle_fn>( // we import using C name, not alias! Using `import<>` "Kernel32.dll", // Windows dll "GetStdHandle" // function name ); std::cout << "timeGetTime() returned " << plugin(STD_OUTPUT_HANDLE) << std::endl; return 0; }

1 0

[signals2] connected signal not being called
by Glenn Ramsey 27 Oct '15

27 Oct '15

Hi, In a program I have a function connected to to a signal that is being called periodically. At a certain point the function inexplicably stops being called. Other functions that are connected to the same signal and same group are still being called at this time. As far as I am aware disconnect() has not been called and connection.connected() returns true and connection.blocked() returns false for this function. This seems very strange to me and I'm wondering if there is something that I have overlooked. It's not the sort of thing that could be reproduced with a simple example. What would be a good way to debug this? Glenn

2 2

Interest in a Boost.Chrono/Date library
by Vicente J. Botet Escriba 26 Oct '15

26 Oct '15

Hi, maybe some of you have already see the Howard Hinnant presentation at CppCOn2015 [1] about his new data-v2 library [2]. My prototype of Boost.Chrono/Date library ([3] ] was based on the Howard original library, but when we want to reach the maximum of performances we need to use a specific date class for each usage. This is what Howard explains in his marvelous presentation ans his tiny date library My post here wants to know if there is interest in a library providing what H.H. date library provides in Boost. Note that his data-v2 library yet doesn't provides as much as Boost.Date provides but IMHO it is much elegant and efficient. If there is enough interest, I will request you to do a first review of the H.H. Date-V2 library. Then once we have a consensus I will make my POC Chrono/Date library ready for review. H.H. Date-V2 is under MIT license, which IIRC is compatible with the Boost license. I don't know yet if would need to add this license, as my POC [3] is already a good starting point, nevertheless, I would like to know if there could be any issues about having the source under both licenses. Best, Vicente [1] https://www.youtube.com/watch?v=tzyGjOm8AKo [2] https://github.com/HowardHinnant/date [3] https://github.com/viboes/chrono_date/commits/master First commit Nov/2011 Last-Mars2014

2 2

[Log] linker errors after update from 1.57 to 1.59
by Glenn Ramsey 25 Oct '15

25 Oct '15

Hi, After updating a project to use Boost 1.59 from 1.57 I am getting link errors like this: Undefined symbols for architecture i386: "boost::log::v2_mt_posix::basic_formatter<char> boost::log::v2_mt_posix::parse_formatter<char>(char const*, char const*)", referenced from: boost::log::v2_mt_posix::basic_formatter<char> boost::log::v2_mt_posix::parse_formatter<char>(char const*) BOOST_LOG_DYN_LINK has been defined and the build works with 1.57. This is on OSX 10.10.5 with Xcode 6.4 and with command line builds using clang (Apple LLVM version 6.1.0 (clang-602.0.53) (based on LLVM 3.6.0svn)). Boost was built using this command line: ./b2 --prefix=$HOME/rp/boost-1_59_0 cxxflags="-stdlib=libc++ -arch i386 -mmacosx-version-min=10.7" linkflags="-stdlib=libc++ -arch i386 -mmacosx-version-min=10.7" --with-python --with-signals --with-thread --with-date_time --with-filesystem --with-regex --with-chrono --with-log link=shared architecture=x86 install What do I need to do fix this? Glenn

1 0

[BGL] adding an edge without modifying a graph?!
by Ireneusz Szcześniak 24 Oct '15

24 Oct '15

Hi, The subject sounds crazy, I know. But I need to add reverse edges so I can run a max-flow algorithm on my graph, and I would not like to modify the input graph. I can make a copy of the graph, modify it all right, run a max-flow algorithm, and discard the modified graph, but that would be inefficient. So I wonder whether someone could share some trick on how to do that, if this is possible. I was hoping to use boost::subgraph: create a root graph, create its subgraph, and then add reverse edges only to the root graph. Unfortunately, these edges also popped up in the subgraph. Thanks & best, Irek

2 3

[BGL] augmenting for a max-flow algorithm
by Ireneusz Szcześniak 24 Oct '15

24 Oct '15

Hi, I would appreciate it if someone could define the term "augmenting" used in the documentation of the max-flow algorithms: "First, the directed graph G=(V,E) that represents the network must be augmented to include the reverse edge for every edge in E." Does it simply mean that I need to add to the graph a reverse edge? In the documentation of the boykov_kolmogorov_max_flow algorithm it's stated point-blank: "The directed graph G=(V,E) that represents the network must include a reverse edge for every edge in E". Cool, so I know that I need to add the edge with the add_edge function. To use a max-flow algorithm I need to modify my input graph. So I guess "augmenting" means just "including/adding", right? Thanks & best, Irek

1 0

BGL, swapping two graphs can invalidate vertex descriptors?
by Paolo Bolzoni 24 Oct '15

24 Oct '15

Dear list, I had to fix a bug in a program of mine using the boost graph library. In the program I need to add and remove vertices quickly, so I used listS both for edges and vertices. Besides, I need to refer to vertices with special ids (that are integers), so I added to each vertex a integer and to the graph itself a map between the ids and the vertices. The interface ensures that when vertices are added and this data structures are updated properly. For reference I put the whole (minified) graph definition after the email. Now, I had a crash when using boost::out_edges in some part of the programs and not in others. After some debugging it really seems that it happens that the vertex descriptors, that are addresses to the vertices, change after a swap. Unfortunately I could not manage to make this behaviour in a small example so I am still unsure and I decided to ask here. It is possible that swapping two graphs (with listS as OutEdgeList and VertexList) invalidates the vertex descriptors? Yours faithfully, Paolo #include <boost/graph/adjacency_list.hpp> namespace graph_prop { struct vertex { int id{}; }; struct edge { int lenght{}; }; struct graph; } typedef boost::adjacency_list< boost::listS, boost::listS, boost::undirectedS, graph_prop::vertex, graph_prop::edge, graph_prop::graph > Graph; namespace graph_prop { struct graph { std::unordered_map<int, Graph::vertex_descriptor> ids{}; }; }

1 0

problems with linking...
by Witold E Wolski 24 Oct '15

24 Oct '15

In a project which vcproj files generated with cmake I am getting the following link error fatal error LNK1104: cannot open file 'libboost_date_time-vc120-mt-gd-1_59.lib' The generate link command (VS- project -> properties -> Linker -> command line) contains however: "C:\boost\boost_1_59_0\lib\boost_date_time-vc120-mt-gd-1_59.lib" both files are present in my boost binary build. Any idea why this mixup is taking place libboost_date_time vs. boost_date_time and how I can fix the problem? Best regards Witold -- Witold Eryk Wolski

2 2

[MSM] Solution for: fatal error C1202: recursive type or function dependency context too complex
by Mark Bartosik 21 Oct '15

21 Oct '15

I have had a major headache while using MSM eUML state transition tables, thankfully I've found a simple solution.First MSM and especially eUML are great, and that's why I persevered to find a solution. Here's the problem: Declaring a complex eUML state transition table may result in the compiler generating an error. BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE((// row_1,// row_2,// ...// row_a,// row_b,// row_c,// // Eventually the Microsoft compiler VS2008,2010,2012,2015 will all explode with fatal C1202: recursive type or function dependency context too complex), transition_table ); I haven't tried with gcc. The solution is to break the state table in two smaller parts rather than one big table: BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE((// row_1,// row_2,// ...), transition_table_part_1 ); BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE((// row_a,// row_b,// row_c ), transition_table_part_2 ); typedef boost::mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table; // No error, even though it contains just as many rows [Waffle warning] I think that what's happening is that once the compiler has fully described the transition_table_part1 it unwinds what it is doing, it is able to unwind and 'bank' transition_table_part1 as just being a type in it's memory, and when it comes to generate transition_table via boost::mpl::join_view it just constructing the resulting type list from two sets of previously 'banked' types. This is I think why I can still nest a sub-state machine which is on the limit of the complexity of state transition table it can contain; even though nesting state machines recursively references state transition tables. Things that did not work: [ more waffle ] There are some other solutions that I tried before I had the Eureka moment. One was to try to hide a sub-state machine within a concrete class but that didn't work because the outer fsm needs to see the inner stt. Another way was to implement a sub-state machine as a concrete state (not fsm), and then add a process_event method on the class which delegated to a member fsm which was hidden from the outer fsm, I got this to work, but it did not solve the problem, and I had to abandon use of exit_pt_, although it may have brought down compile times. Another helpful advantage of this solution is that the memory required by the compiler is significantly reduced. Christophe:Would you consider adding the example above to the MSM documentation, I would suggest under: Chapter 4, Compilers / Performance, Compilers Corner Also under: Chapter 5, Questions Answers and Tips: Question: Why do I get "fatal C1202: recursive type or function dependency context too complex" Answer: Likely because a state transition table has become two complex. Split the state transition table into two parts, and then use typedef mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table to join the two parts. Question: Why does my compiler generate a fatal out of memory fatal error. Answer: Likely because a state transition table has become two complex. Try and split the most complex state transition table into two parts, and then use typedef mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table to join the two parts. - Mark Bartosik

1 0

Newbie
by Gagan Kumar 21 Oct '15

21 Oct '15

I am interested in Open Source and want to contribute in BOOST, can you guide me from where should I start.

2 1

what is the problem with my async_read_some function?
by 李楠 20 Oct '15

20 Oct '15

hi all! i have a problem with the async_read_some function. i code a client to connect a server, after login the server will send a lot of FAST(FIX Adapted for Streaming) Data constantly. i just use ip::tcp::socket.async_read_some function to read the data from server, but the interface of the server software sometime show that there are some data package wait for send(maybe my client not receive then immidiately).but, when i use a commercial client to connect and receive data from the server, there is no data package wait for send on the server. my code: BODY_LEN = 1024 * 1024 * 4//4M boost::array<char, BODY_LEN> body_; void client::login_handler(const boost::system::error_code& ec, std::size_t bytes_transferred) { if (ec) { error_.code = ec.value(); strncpy(error_.msg, ec.message().c_str(), ERROR_MSG_LEN - 1); error_.msg[ERROR_MSG_LEN - 1] = '/0'; glog.error("login_handler get an error: %s", error_.msg); return; } socket_.async_read_some(boost::asio::buffer(body_), boost::bind(&client::login_handler, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); static bool first = true; if (first) { heartbeat_inteval_ = 10; first = false; send_heartbeat(); } } there is a deadline_timer to send heartbeat to server every 10 seconds , user the same socket_ . i user asio handler tracking to debug, and found that sometimes between the async_read_some function call and their callback function call are more than 100ms, i don't kown why becasue the server send data always, and other commercial client is ok? @asio|1445319300.343750|25*26|socket@00840104.async_receive @asio|1445319300.343750|<25| @asio|1445319300.390625|>26|ec=system:0,bytes_transferred=24605 @asio|1445319300.390625|26*27|socket@00840104.async_receive @asio|1445319300.390625|<26| @asio|1445319300.578125|>27|ec=system:0,bytes_transferred=15805 @asio|1445319300.593750|27*28|socket@00840104.async_receive @asio|1445319300.593750|<27| @asio|1445319300.781250|>28|ec=system:0,bytes_transferred=3939 @asio|1445319300.781250|28*29|socket@00840104.async_receive @asio|1445319300.781250|<28| @asio|1445319300.781250|>29|ec=system:0,bytes_transferred=8858 @asio|1445319300.796875|29*30|socket@00840104.async_receive @asio|1445319300.796875|<29| @asio|1445319300.796875|>30|ec=system:0,bytes_transferred=23906 @asio|1445319300.796875|30*31|socket@00840104.async_receive @asio|1445319300.796875|<30| @asio|1445319300.796875|>31|ec=system:0,bytes_transferred=25124 @asio|1445319300.796875|31*32|socket@00840104.async_receive @asio|1445319300.796875|<31| @asio|1445319300.921875|>32|ec=system:0,bytes_transferred=18061 @asio|1445319300.937500|32*33|socket@00840104.async_receive @asio|1445319300.937500|<32| @asio|1445319301.125000|>33|ec=system:0,bytes_transferred=19960 @asio|1445319301.125000|33*34|socket@00840104.async_receive @asio|1445319301.140625|<33| @asio|1445319301.140625|>34|ec=system:0,bytes_transferred=11680 could someone give some suggest? thanks a lot!

2 1

Boost compilation error under OS X 10.8.5
by Sebastian Sulger 20 Oct '15

20 Oct '15

Dear Boost Users list, I have an issue trying to compile a project under Mac OS X 10.8.5 using Boost libraries, version 1.34.1. I am using Xcode 4.6.3 and accompanying Command Line Tools. This must be an OS X specific issue, since the project compiles under CentOS Linux. I am asking this on the list in hopes that someone has used Boost in OS X development and has maybe come across a similar issue. I attach an excerpt of the compiler messages below. I have tried googling for the error, but can't seem to find satisfying answers. Please let me know if you can think of something from the top of your head or, which is more likely, if you need more info (e.g., source code excerpts) to be able to help me. Thank you very much, Best, Sebastian ######## g++ -DPARC -DCPPPA_EXPORT= -fPIC -fno-common -D__STDC_LIMIT_MACROS -g -fno-inline -Wpointer-arith -Wwrite-strings -Wno-deprecated -Wreturn-type -W -I/usr/local/include -O2 -I../../src/include -I../../LexBase/src -I/include -I/usr/local/include/boost-1_34_1 -I/Users/sebastiansulger/projects/xle/dev/xfr/src/../../bgdb -Idb_client -I./ -I../include -Ifacts -Irules -Ichoices -Iterms -Imatches -Idriver -Iparser -Itriples -Iprolog -Idebug -Inew_parser -o terms/TermStorage.o -c terms/TermStorage.cpp In file included from terms/TermStorage.cpp:9: In file included from terms/TermStorage.h:28: In file included from ./Types.h:26: In file included from /usr/local/include/boost-1_34_1/boost/functional/hash.hpp:10: /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:487:20: error: call to 'hash_value' is ambiguous return hash_value(val); ^~~~~~~~~~ /usr/include/c++/4.2.1/ext/hashtable.h:595:16: note: in instantiation of member function 'boost::hash<long long>::operator()' requested here { return _M_hash(__key) % __n; } ^ /usr/include/c++/4.2.1/ext/hashtable.h:587:16: note: in instantiation of member function '__gnu_cxx::hashtable<std::pair<const long long, unsigned int>, long long, boost::hash<long long>, std::_Select1st<std::pair<const long long, unsigned int> >, std::equal_to<long long>, std::allocator<unsigned int> >::_M_bkt_num_key' requested here { return _M_bkt_num_key(__key, _M_buckets.size()); } ^ /usr/include/c++/4.2.1/ext/hashtable.h:522:18: note: in instantiation of member function '__gnu_cxx::hashtable<std::pair<const long long, unsigned int>, long long, boost::hash<long long>, std::_Select1st<std::pair<const long long, unsigned int> >, std::equal_to<long long>, std::allocator<unsigned int> >::_M_bkt_num_key' requested here size_type __n = _M_bkt_num_key(__key); ^ /usr/include/c++/4.2.1/ext/hash_map:219:22: note: in instantiation of member function '__gnu_cxx::hashtable<std::pair<const long long, unsigned int>, long long, boost::hash<long long>, std::_Select1st<std::pair<const long long, unsigned int> >, std::equal_to<long long>, std::allocator<unsigned int> >::find' requested here { return _M_ht.find(__key); } ^ terms/TermStorage.h:97:46: note: in instantiation of member function '__gnu_cxx::hash_map<long long, unsigned int, boost::hash<long long>, std::equal_to<long long>, std::allocator<unsigned int> >::find' requested here TsHashMapIter iter = mParent->mHashMap.find(t); ^ terms/TermStorage.cpp:85:47: note: in instantiation of member function 'powerset::xfr::TermHashStorage<long long>::hashInsert' requested here uint32_t index = (uint32_t) mIntTermStorage.hashInsert(intVal); ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:105:24: note: candidate function inline std::size_t hash_value(int v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:110:24: note: candidate function inline std::size_t hash_value(unsigned int v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:115:24: note: candidate function inline std::size_t hash_value(long v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:120:24: note: candidate function inline std::size_t hash_value(unsigned long v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:229:24: note: candidate function inline std::size_t hash_value(float v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:234:24: note: candidate function inline std::size_t hash_value(double v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:239:24: note: candidate function inline std::size_t hash_value(long double v) ^ 1 error generated. make[1]: *** [terms/TermStorage.o] Error 1 make: *** [build] Error 2 Sebastian-Sulgers-MacBook-Pro:dev sebastiansulger$ -- Sebastian Sulger FB Sprachwissenschaft Universität Konstanz http://ling.uni-konstanz.de/pages/home/sulger

1 0

[BGL] Assertion failed / memory leak in r_c_shortest_paths.hpp
by Alberto Santini 20 Oct '15

20 Oct '15

In the following 2-years old thread, a memory leak was experienced when using r_c_shortest_paths of the boost graph library. Jeremiah Willcock added a bunch of assertions to the code, to help identify the problem. https://groups.google.com/forum/#!topic/boost-list/W1muJiw85pA I think I now have a reproducible version of this, which I believe might be a bug. I would like some input before opening a bug report. Here is the gist: https://gist.github.com/alberto-santini/32c19530dcefb784d0f2 It contains: 1) graph.txt which contains a dump of the graph that exposes the problem 2) boost_bug.cpp which is the code used to build the graph from file and do the labelling 3) terminal_output.txt which contains the command used to compile and what happens when running the code It has been tested on Mac OS X 10.11 with GCC 5.2 and Boost 1.58. The programme doesn't necessary trigger the assertion at each run. There are runs in which it completes successfully, runs in which it segfaults without triggering any assertion and times in which it's aborted by the failed assertion. The failed assertion is: Assertion failed: (p_cur_label->b_is_valid), function r_c_shortest_paths_dispatch, file /usr/local/include/boost/graph/r_c_shortest_paths.hpp, line 472. I would like to know if you experience the same behaviour and can confirm (or at least make an educated guess) wether or not this is a bug in r_c_shortest_paths.hpp. Thanks, AS

1 1

Re: [Boost-users] [interprocess] Interprocess mutex not working / throwing exception when trying to write lock
by nav999 19 Oct '15

19 Oct '15

Dear Admin, It's ok if this does not reach the mailing list. I'm putting it up here as the answer, so that anyone browsing this Nabble forum will find it. The answer is here: http://stackoverflow.com/questions/33197889/boost-interprocess-mutex-crashe… -- View this message in context: http://boost.2283326.n4.nabble.com/interprocess-Interprocess-mutex-not-work… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[intrusive] accessing the hook type?
by Oliver Kowalke 18 Oct '15

18 Oct '15

I'd like to determine the hook type of an intrusive container (intrusive::list): template< typename List > void do_link( List & lst) { static_assert(std::is_same< typename List::???, my_hook_type >::value); lst.push_back( * this); }

2 2

boost spirit qi/karma char parsing/generating
by Ernest Zaslavsky 18 Oct '15

18 Oct '15

The question why does it treated as string character when my intention is to work with 8bit integral type? int8_t/uint8_t does not help either on most platforms it is just a define for signed/unsigned char. So, the broader question, how do you work with “byte” type when it is always treated as character? And the main question how do I force qi/karma to treat “char” as a number? P.S. cast to short is an obvious solution but it is not elegant [Read More]<http://feeds.feedburner.com/~r/sizmek-blog/~6/1> [http://www.sizmek.com/Sizmek.png]<http://www.sizmek.com/>

1 0

Boost.Python extension
by Jeff Archer 16 Oct '15

16 Oct '15

I am trying to use Boost.python to create a python extension. I have created the hello_ext example but find that I cannot import it. I am always getting the error "ImportError: No module named 'hello_ext'". Boost 1.59.0 Python 3.5 Visual Studio 2015

2 1

Re: [Boost-users] [interprocess] Interprocess mutex not working / throwing exception when trying to write lock
by Malko 16 Oct '15

16 Oct '15

Copying over here my initial reply: Hi, 1. Your lockWithWriteLock and lockWithReadLock create a lock, which locks on construction and unlocks on destruction, hence when the function returns no lock is held on the mutex. 2. The fact that you put a scope here makes me think that your intention is for the lock to be unlocked at the end of this scope (which it won't, as it is unlocked way before, as per #1). { std::cout<<"Program 1: Before first locking -------------------------- 1 v\n"; temp.sharedMutex->lockWithWriteLock(); const unsigned int SLEEP_TIME_IN_SECOND = 60; std::cout<<"Program 1: sleep for "<< SLEEP_TIME_IN_SECOND << "\n"; sleep(SLEEP_TIME_IN_SECOND); std::cout<<"Program 1: Finished sleeping\n"; } In this case though, you would perform the wait in bold while still holding the lock, and hence preventing the 2nd program from locking it. Once out of the scope you destroy the object right away. NOTE: both the issue in #1 and #2 lead to your first program possibly deleting the mutex before the 2nd program is done with it. Which leads to the issue you are experiencing. 3. If you need to have the 1st program wait for the 2nd program to be done, then do not use sleeps, use a condition_variable. -- View this message in context: http://boost.2283326.n4.nabble.com/interprocess-Interprocess-mutex-not-work… Sent from the Boost - Users mailing list archive at Nabble.com.

1 1

[Thread] Problems compiling an example from the docs
by Malko 16 Oct '15

16 Oct '15

Hi, I am trying to compile the following example: http://www.boost.org/doc/libs/1_59_0/doc/html/thread/synchronization.html#t… #include <boost/thread.hpp> #include <boost/thread/future.hpp> int parallel_sum(int* data, int size) { int sum = 0; if ( size < 1000 ) for ( int i = 0; i < size; ++i ) sum += data[i]; else { boost::future<int> handle = boost::async(parallel_sum, data+size/2, size-size/2); sum += parallel_sum(data, size/2); sum += handle.get(); } return sum; } int main() { int data[] = {1,2,3,4,5,6,7,8,9,10}; int a(parallel_sum, data, 10); return 0; } It does not compile because future is not a type in boost and async has the wrong signature. The future error goes away by defining BOOST_THREAD_PROVIDES_FUTURE, but I can not find this mentioned anywhere in the docs, I found out only looking on stack overflow. The async signature seems to require a function of arity 0. This is clang 3.4 output using Boost.1.59 and C++03: XXX/src/futtest.cpp:12:33: error: no matching function for call to 'async' boost::future<int> handle = boost::async(parallel_sum, data+size/2, size-size/2); ^~~~~~~~~~~~ /home/dev/build/third_party/64-rhel5/boost_1_59_0/include/boost/thread/future.hpp:3545:3: note: candidate function template not viable: requires 2 arguments, but 3 were provided async(launch policy, R(*f)()) { ^ /home/dev/build/third_party/64-rhel5/boost_1_59_0/include/boost/thread/future.hpp:3609:3: note: candidate function template not viable: requires 2 arguments, but 3 were provided async(launch policy, BOOST_THREAD_FWD_REF(F) f) { ^ /home/dev/build/third_party/64-rhel5/boost_1_59_0/include/boost/thread/future.hpp:3961:3: note: candidate function template not viable: requires single argument 'f', but 3 arguments were provided async(R(*f)()) { ^ /home/dev/build/third_party/64-rhel5/boost_1_59_0/include/boost/thread/future.hpp:3978:3: note: candidate function template not viable: requires single argument 'f', but 3 arguments were provided async(BOOST_THREAD_FWD_REF(F) f) { ^ XXX/src/futtest.cpp:22:7: error: excess elements in scalar initializer Is there more macro to be used to enable this to compile? Thanks P.S. It would be nice to have all the info about macro configuration for future (and async, if it has any) in the docs. -- View this message in context: http://boost.2283326.n4.nabble.com/Thread-Problems-compiling-an-example-fro… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

Xpressive regex superscript 2 and 3 parsed as plain digits
by Mia 15 Oct '15

15 Oct '15

Help pleaseI am using xpressive for text processing with regexes.Microsoft Visual C++ 13.0 on a windows 10 laptop, boost version 1_59_0 (and lib64-msvc-12.0 downloaded from sourceforge) , locale is en_US.UTF-8 .my regular expressions for catching any and all digits :wsregex any_number_regex = wsregex::compile(L"^(.*\\D)?(\\d+)(\\D.*)?$");Looks like it recognizes the superscript 2 and superscript 3 as plain “digits”all other superscript digits are not caught by this regex.examples:πr² 234³is this intentional?is this a bug?(I know I can change the regex to catch [0-9]+, this regex just one of many I use in my software!)thank youMia -- View this message in context: http://boost.2283326.n4.nabble.com/Xpressive-regex-superscript-2-and-3-pars… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Use of uninitialized value in any_range
by Auer, Jens 15 Oct '15

15 Oct '15

Hi, Valgrind reports multiple problems in our project which seem to come from boost::range::any_range. I was able to produce a small example which reproduces the problem: #include <iostream> #include <boost/range.hpp> #include <boost/range/any_range.hpp> #include <boost/range/adaptors.hpp> struct Int { Int(int i): x(i) {} int x; }; int main( int argc, char* argv[] ) { typedef boost::any_range<Int*, boost::forward_traversal_tag, Int*, std::ptrdiff_t> R; std::vector<std::unique_ptr<Int>> v; v.push_back( std::make_unique<Int>(42) ); auto f = [](std::unique_ptr<Int> const& p) {return p.get();}; R r = v | boost::adaptors::transformed(f); auto x = (*boost::begin(r))->x; std::cout << x << std::endl; return 0; } Running this, valgrind reports a "Use of uninitialized value of size 8": # g++ --version g++ (GCC) 5.2.0 # g++ -std=c++1y -o test test.cpp # valgrind --version valgrind-3.11.0 # valgrind --track-origins=yes ./test ==8119== Memcheck, a memory error detector ==8119== Copyright (C) 2002-2015, and GNU GPL'd, by Julian Seward et al. ==8119== Using Valgrind-3.11.0 and LibVEX; rerun with -h for copyright info ==8119== Command: ./test ==8119== ==8119== Use of uninitialised value of size 8 ==8119== at 0x4010B8: main (in /tmp/test) ==8119== Uninitialised value was created by a stack allocation ==8119== at 0x40315D: boost::range_detail::any_iterator<Int*, boost::iterators::forward_traversal_tag, Int*, long, boost::any_iterator_buffer<64ul> >::dereference() const (in /tmp/test) ==8119== 42 ==8119== ==8119== HEAP SUMMARY: ==8119== in use at exit: 72,704 bytes in 1 blocks ==8119== total heap usage: 3 allocs, 2 frees, 72,716 bytes allocated ==8119== ==8119== LEAK SUMMARY: ==8119== definitely lost: 0 bytes in 0 blocks ==8119== indirectly lost: 0 bytes in 0 blocks ==8119== possibly lost: 0 bytes in 0 blocks ==8119== still reachable: 72,704 bytes in 1 blocks ==8119== suppressed: 0 bytes in 0 blocks ==8119== Rerun with --leak-check=full to see details of leaked memory ==8119== ==8119== For counts of detected and suppressed errors, rerun with: -v ==8119== ERROR SUMMARY: 1 errors from 1 contexts (suppressed: 1 from 1) Best wishes, Jens -- Jens Auer | CGI | Software-Engineer CGI (Germany) GmbH & Co. KG Rheinstraße 95 | 64295 Darmstadt | Germany T: +49 6151 36860 154 jens.auer(a)cgi.com<mailto:jens.auer@cgi.com> Unsere Pflichtangaben gemäß § 35a GmbHG / §§ 161, 125a HGB finden Sie unter de.cgi.com/pflichtangaben<http://de.cgi.com/pflichtangaben>. CONFIDENTIALITY NOTICE: Proprietary/Confidential information belonging to CGI Group Inc. and its affiliates may be contained in this message. If you are not a recipient indicated or intended in this message (or responsible for delivery of this message to such person), or you think for any reason that this message may have been addressed to you in error, you may not use or copy or deliver this message to anyone else. In such case, you should destroy this message and are asked to notify the sender by reply e-mail. -- Jens Auer | CGI | Software-Engineer CGI (Germany) GmbH & Co. KG Rheinstraße 95 | 64295 Darmstadt | Germany T: +49 6151 36860 154 jens.auer(a)cgi.com<mailto:jens.auer@cgi.com> Unsere Pflichtangaben gemäß § 35a GmbHG / §§ 161, 125a HGB finden Sie unter de.cgi.com/pflichtangaben<http://de.cgi.com/pflichtangaben>. CONFIDENTIALITY NOTICE: Proprietary/Confidential information belonging to CGI Group Inc. and its affiliates may be contained in this message. If you are not a recipient indicated or intended in this message (or responsible for delivery of this message to such person), or you think for any reason that this message may have been addressed to you in error, you may not use or copy or deliver this message to anyone else. In such case, you should destroy this message and are asked to notify the sender by reply e-mail.

1 0

Boost Python having trouble with C++ int return results
by Bradley Neuberg 15 Oct '15

15 Oct '15

I'm fairly new to using Boost Python and running into some funkiness. When I try to pass back a simple int from C++ to Python, I get a Segmentation Fault. Here's the C++: #include <iostream> #include <boost/python.hpp> int helloworld() { return 10; } BOOST_PYTHON_MODULE(test_boost) { boost::python::def("helloworld", helloworld); } and here's the Python: import test_boost print(test_boost.helloworld()) The strange thing is it works fine with char const* types. Does anyone know what could cause this? Compiled on Mac OS X 10.10.5 with Anaconda Python with the following: g++ -g -shared -fPIC -I/Users/bradneuberg/anaconda/include/python2.7 test_boost.cpp -lpython2.7 -lboost_python -o test_boost.so Best, Brad Neuberg

1 0

Boost Intrusive compiler error
by Davies, John 14 Oct '15

14 Oct '15

I've been using Boost 1.55.0 that I built myself for about a year. Our team decide that we would prefer to use the pre-built files located on SourceForge as a standard (http://sourceforge.net/projects/boost/files/boost-binaries/1.55.0-build2/ ) I downloaded and installed and changed my Visual Studio 2013 project to point to the new root folder. I'm getting this error: Error 2 error C2228: left of '.select_on_container_copy_construction' must have class/struct/union c:\boostlib\boost\intrusive\detail\has_member_function_callable_with.hpp 200 1 BoostCommunication Googling hasn't helped. This code compiled on the libraries I built. I'd appreciate any help in tracking this down. ________________________________ The information contained in this message may be confidential and legally protected under applicable law. The message is intended solely for the addressee(s). If you are not the intended recipient, you are hereby notified that any use, forwarding, dissemination, or reproduction of this message is strictly prohibited and may be unlawful. If you are not the intended recipient, please contact the sender by return e-mail and destroy all copies of the original message.

2 1

Escaping boost.regex literal string fragments
by Dominique Devienne 13 Oct '15

13 Oct '15

Is there no equivalent to http://doc.qt.io/qt-4.8/qregexp.html#escape in Boost.Regex, i.e. a way to escape all special characters so they match "literally"? There are manual solutions, like http://stackoverflow.com/questions/1252992/how-to-escape-a-string-for-use-i…, but shouldn't that be part of the API? Does C++11's std::regex, based on boost::regex, include this API? Thanks, --DD

2 3

how to install boost-devel 1.59 in CentOS7
by 俊赵 13 Oct '15

13 Oct '15

Hello everyone. I want to install boost-devel 1.59 in centos7, but the default repo has only 1.53, so I have to compile it from the source code. I have download 1.59 from web page, and use ./bootstrap.sh and ./b2 install to install the boost 1.59. But when I want install other packages such as CGAL-devel, it tells me that I donnot install boost-devel 1.59, so I wonder how to install boost-devel? Thanks. Zhao Jun

3 2

boost interval container in shared memory
by Asna Ishrat 13 Oct '15

13 Oct '15

I have been trying to store boost interval map in shared memory, but my code below does not compile when I pass allocator while constructing map. After seeing template definition of boost interval_map I assume that boost icl only supports std::allocator. Is there any way to store this container in shared memory. int main () { static bip::managed_shared_memory global_mm(boost::interprocess::open_or_create, "MySharedMemory",65536 //segment name ); static bip::allocator<void, bip::managed_shared_memory::segment_manager> global_alloc(global_mm.get_segment_manager()); boost::icl::interval_map<int, int> *party = global_mm.find_or_construct<boost::icl::interval_map<int, int>>("Store")(global_alloc); party->add(make_pair(boost::icl::interval<int>::right_open(4,5),1)); std::cout << "adding result: " << *party << "\n"; }

1 0

owns_lock on lock not on mutex
by gast128 13 Oct '15

13 Oct '15

Hello all, there is an owns_lock on the lock type but not on the mutex. This is quite unhandy. Any reason why? Use case is in base-derived idiom: class Foo { public: void Process() { boost::unique_lock<boost::mutex> lck(m_mtx); Update(); } protected: void Update() { ++m_n; } boost::mutex m_mtx; int m_n; }; class Bla : public Foo { public: void Process() { boost::unique_lock<boost::mutex> lck(m_mtx); Update(); } private: void Update() { assert(m_mtx.owns_lock()); ++m_n2; Foo::Update(); } int m_n2; };

4 9

Log: [Bug] Setting attribute makes log entry disappear
by Florian Lindner 12 Oct '15

12 Oct '15

Hello, I have a tracer, that should log going in and out of a function: class Tracer { public: Tracer(Logger logger, std::string function, std::string file) : _logger(logger), _function(function), _file(file) {} ~Tracer() { using namespace boost::log; // attribute_cast<attributes::mutable_constant<int>>(core::get()->get_global_attributes()["Line"]).set(1); attribute_cast<attributes::mutable_constant<std::string>>(core::get()->get_global_attributes()["File"]).set(_file); attribute_cast<attributes::mutable_constant<std::string>>(core::get()->get_global_attributes()["Function"]).set(_function); BOOST_LOG_SEV(_logger, trivial::severity_level::trace) << "Leaving " << _function; } private: Logger _logger; std::string _function; std::string _file; }; This works fine, but as soon as I uncomment the line that sets the Line attribut I don't get any Leaving messages anymore. The attributes are added beforehand like that: using namespace boost::log; add_common_attributes(); core::get()->add_global_attribute("Scope", attributes::named_scope()); core::get()->add_global_attribute("Rank", attributes::constant<int>(5)); core::get()->add_global_attribute("Line", attributes::mutable_constant<int>(5)); core::get()->add_global_attribute("File", attributes::mutable_constant<std::string>("")); core::get()->add_global_attribute("Function", attributes::mutable_constant<std::string>("")); Setting all other attributes, similiar to Line works fine. I'm puzzled because Line does not seem to be a reserved name, it works somewhere else and the boost::log sources reveal no relevant usages of that name. What could be the problem here? I'm happy to send anyone the complate code (approx. 150 lines in total) Thanks! Florian

1 1

Boost.Fiber mini-review report
by Nat Goodspeed 10 Oct '15

10 Oct '15

The mini-review of Boost.Fiber by Oliver Kowalke ran from Friday September 4th through Sunday September 13th. There was lively discussion, but only two actual reviews: Agustín K-ballo Bergé: not yet (list of issues below) Niall Douglas: yes, plus suggestions (below)[0] In addition I received two "review withheld" notes: Vicente J. Botet Escriba wanted me to address the previous review point by point. That seems like a reasonable request, and I apologize, but I too have time pressures. Giovanni Piero Deretta made suggestions (synopsized below) with the statement that he will make a recommendation when he sees the library author's progress along those lines. While in theory these results might seem like a hung jury, the very paucity of formal reviews supports a cautious approach. The verdict is: not yet, with specific points as noted below. No reviewer explicitly designated specific points as being essential. (Niall Douglas explicitly designated his suggestions as post-adoption enhancements.) I have made an attempt to rank the recommendations received in descending order of importance to the community. My criteria are: Robustness: does lack of this request pose significant risk to a consuming program? API stability: could this request be considered an implementation detail, or would the change break early adopters? Demand: how many people requested the same thing? If you feel that I have misrepresented the importance of one of your points (or omitted something entirely), please respond. Ultimately, of course, the importance of any given point to the community at large will be reflected in the next mini-review. ----------------------------------------------------------------- Requests: Cross-thread fiber migration: Evidently the community strongly desires the ability to transfer a suspended fiber from one thread to another.[1] Of course there must be controls. Migration might be explicit; but if implicit, there must be a way to designate which fibers may and may not be migrated. An RAII class that temporarily disables migration would also be desirable -- for instance, to guarantee TLS consistency for some specific period. Cross-thread migration support implies a requirement to document the thread safety requirements of the customization API. Standard required timing specifications: meet (30.2.4 Timing specifications [thread.req.timing]). Adapt one or more existing test suites for thread facilities to validate the correctness of the Fiber library's synchronization constructs: e.g. from libc++, libstdc++, Boost.Thread, HPX. std::chrono support: ensure that wait_until() can accept any supported time_point specialization. (The library author asserts that this has already been fixed on the 'develop' branch.) C++11 compatibility: Agustín K-ballo Bergé volunteered to help with this point post-adoption. Paul Fultz offered fit::capture to emulate C++14 move capture. Document that this_fiber::yield() (et al.) are valid from main(), or in general from a thread function, as well as from explicitly-launched fibers. Make shared_state lock requirements explicit: for example, make mark_ready_and_notify_() accept a std::unique_lock<>& (or &&) to force its caller to provide one. Avoid holding mutex during condition_variable::notify_*() calls. (The library author asserts that this has already been fixed on the 'develop' branch.) packaged_task must not decay-copy its task arguments. Align fibers::async() signature, result description and invoke_helper implementation with std::async(). Avoid returning std::move(...). Wait list implementation: try an intrusive linked list of fiber_context objects. Avoid sleeping thread when no fibers are ready -- block on external event. Better handling of waiting tasks (decentralized wait queues?). Optimization to resume awakened fiber on the thread that awakens it. Template redundancy: eliminate duplication between specializations for T, T& and void. The future, shared_future, shared_state, promise and task_object templates were specifically cited. Leverage predicate-based condition::wait() overload internally. Nested schedulers: make schedulers be schedulable entities themselves. Improve robustness of `promise' handling in Asynchronous Callbacks documentation. Avoid overconfident remarks about it. Fix Note overstating the requirements on condition_variable::wait(). The discussion also surfaced the desirability of Grand Unified Future Theory, but it was generally agreed that this is out of scope. Put differently, it would be unreasonable to put the onus on Fiber to solve that very broad cross-library problem. Many thanks to all participants, and thanks especially to Oliver Kowalke for all his work on this library! Nat Goodspeed Boost.Fiber Review Manager ________________________________ [0] Niall Douglas snuck his review recommendation into the following mail message: http://lists.boost.org/Archives/boost/2015/09/225228.php (second to final paragraph). His suggestions were in private mail. [1] Giovanni Deretta suggests that it might be possible to allocate -- without actually running -- an actual kernel thread per fiber, simply to give each fiber its own TLS area.

2 1

boost::serialization bindings for PHP5 somewhere?
by Mauro Condarelli 10 Oct '15

10 Oct '15

Hi, I need to send some structures (and receive answers, of course) from a PHP5 front-end to a C++ back-end that already communicates with another C++ front-end via boost::serialization over a socket. Easiest would be to teach PHP5 to talk the same language. I know I can write a specific PHP5 extension in C++ and use boost::serialization there. Question is if such a beast (or something equivalent) already exists. Thanks in Advance Mauro

2 1

serialization code compilation problem - shared_ptr_helper.cpp in Boost 1.59
by Robert Fairlie 06 Oct '15

06 Oct '15

I tried building the serialization library only using the standard b2 approach and looking at the output. It looks like shared_ptr_helper.cpp isn’t included in the build (at least for serialization). So I just left it out of my own build and my code compiled and linked OK, and my serialization seems to be working. Does this approach sound safe or am I overlooking something?

2 1

serialization code compilation problem - shared_ptr_helper.cpp in Boost 1.59
by Robert Fairlie 06 Oct '15

06 Oct '15

Hi, I’m building the Boost serialization library in Visual Studio 2015 (for x86 and ARM) by copying the 40 or so files in libs\serialization\src and compiling them in my Visual Studio project. (I’m doing it this way because Visual Studio won’t seem to let me build everything with b2 in the ARM case). The last build of the 40 files I did used Boost 1.55 and that worked fine, but now with Boost 1.59, all files compile except shared_ptr_helper.cpp. I notice that shared_ptr_helper.cpp refers to a class called shared_ptr_helper_base, but I’ve done a full *.* search and it doesn’t seem to be declared anywhere. Also, I notice that usage of macros such as BOOST_ARCHIVE_DECL has been updated in other files, but not in shared_ptr_helper. Any advice on this would be much appreciated. Robert Fairlie

4 4

[geometry] is there an rtree version that works with boost.1.49 and MSVC2010?
by Jeff Flinn 05 Oct '15

05 Oct '15

I pulled the version down from the old svn sandbox, but msvc2010 doesn't support the variadic template args in indexable.hpp. Any help appreciated. Thanks, Jeff

2 1

Container features in regards to IPC
by David Schneider 04 Oct '15

04 Oct '15

Hello, I was wondering if I could suggest adding the ability to have separate allocators inside containers so that the structure (such as map) can be in a different shared memory region, or whatever, than the data. It would have variety of useful cases such as offline storage swapping out, inter-process communications, etc. This can be realized by a bit of a hack with a bunch of boiler-plate code, but I think that this could be a very useful extension over what is available in the standard library. Dave

1 0

how to get auto_link to use shared libraries
by Jeff Archer 04 Oct '15

04 Oct '15

I am trying to use Boost 1.59.0 with Visual Studio 2015 I believe I have built correctly the shared libraries as I have the following files in stage/lib 10/03/2015 04:48 PM 968,192 boost_regex-vc140-mt-1_59.dll 10/03/2015 04:48 PM 1,100,728 boost_regex-vc140-mt-1_59.lib 10/03/2015 03:59 PM 2,561,024 boost_regex-vc140-mt-gd-1_59.dll 10/03/2015 03:59 PM 1,103,914 boost_regex-vc140-mt-gd-1_59.lib I am trying to build the credit_card_example from http://www.boost.org/doc/libs/1_59_0/libs/regex/example/snippets/credit_car… I do have several static libraries in my stage/lib. Uncertain how they got there as I thought that I had only built the debug and release shared libraries. 10/03/2015 04:52 PM 395,432 libboost_chrono-vc140-mt-1_59.lib 10/03/2015 04:02 PM 2,223,204 libboost_chrono-vc140-mt-gd-1_59.lib 10/03/2015 04:48 PM 1,416 libboost_exception-vc140-mt-1_59.lib 10/03/2015 03:59 PM 29,648 libboost_exception-vc140-mt-gd-1_59.lib 10/03/2015 04:52 PM 88,934 libboost_system-vc140-mt-1_59.lib 10/03/2015 04:02 PM 660,700 libboost_system-vc140-mt-gd-1_59.lib 10/03/2015 04:52 PM 13,542,628 libboost_test_exec_monitor-vc140-mt-1_59.lib 10/03/2015 04:02 PM 42,599,796 libboost_test_exec_monitor-vc140-mt-gd-1_59.lib 10/03/2015 04:52 PM 177,682 libboost_timer-vc140-mt-1_59.lib 10/03/2015 04:02 PM 1,319,014 libboost_timer-vc140-mt-gd-1_59.lib Compiling with BOOST_LIB_DIAGNOSTIC defined gives this output 1>------ Build started: Project: BoostRegexCreditCardExample, Configuration: Debug x64 ------ 1> BoostRegexCreditCardExample.cpp 1> Linking to lib file: libboost_regex-vc140-mt-gd-1_59.lib ========== Build: 1 succeeded, 0 failed, 0 up-to-date, 0 skipped ========== Building the project gives this error 1>------ Build started: Project: BoostRegexCreditCardExample, Configuration: Debug x64 ------ 1>LINK : fatal error LNK1104: cannot open file 'libboost_regex-vc140-mt-gd-1_59.lib' ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== Precompiled headers is turned off. I believe the shared libraries are built correctly because if I rename the import library to libboost_regex-vc140-mt-gd-1_59.lib the build succeeds and the boost_regex-vc140-mt-gd-1_59.dll module is shown as loaded by the debugger and the program produces the following output. C:\Dev.ja\BoostRegexCreditCardExample\x64\Debug>BoostRegexCreditCardExample.exe validate_card_format("0000111122223333") returned 0 validate_card_format("0000 1111 2222 3333") returned 1 validate_card_format("0000-1111-2222-3333") returned 1 validate_card_format("000-1111-2222-3333") returned 0 machine_readable_card_number("0000111122223333") returned 0000111122223333 machine_readable_card_number("0000 1111 2222 3333") returned 0000111122223333 machine_readable_card_number("0000-1111-2222-3333") returned 0000111122223333 machine_readable_card_number("000-1111-2222-3333") returned 000111122223333 human_readable_card_number("0000111122223333") returned 0000-1111-2222-3333 human_readable_card_number("0000 1111 2222 3333") returned 0000-1111-2222-3333 human_readable_card_number("0000-1111-2222-3333") returned 0000-1111-2222-3333 human_readable_card_number("000-1111-2222-3333") returned 000-1111-2222-3333 Therefore, I believe I have overlooked some detail in the setup of my project. Please, can someone point out what I have failed to do correctly? Also, can/should I just delete the several libboost_...lib files from my stage/lib directory? I would prefer to always used the shared libraries. Thanks, Jeff

2 1

problem in configuring the environment
by arto rasimus 03 Oct '15

03 Oct '15

I have Raspberry Pi, realtime kernel in it and machinekit 2.7-0 package. Boost version is 1.55-0.What to check, since the machinekit does not find the boost? (and therefore configuration script fails) Linux raspberrypi 3.18.11+ #781 PREEMPT Tue Apr 21 18:02:18 BST 2015 armv6l GNU/Linux configure: error: boost::python is required to build LinuxCNC pi@raspberrypi /machinekit/src $ dpkg -l | grep boost ii libboost-atomic1.55-dev:armhf 1.55.0+dfsg-3 armhf atomic data types, operations, and memory ordering constraints ii libboost-atomic1.55.0:armhf 1.55.0+dfsg-3 armhf atomic data types, operations, and memory ordering constraints ii libboost-chrono1.55-dev:armhf 1.55.0+dfsg-3 armhf C++ representation of time duration, time point, and clocks ii libboost-chrono1.55.0:armhf 1.55.0+dfsg-3 armhf C++ representation of time duration, time point, and clocks ii libboost-date-time1.55-dev:armhf 1.55.0+dfsg-3 armhf set of date-time libraries based on generic programming concepts ii libboost-date-time1.55.0:armhf 1.55.0+dfsg-3 armhf set of date-time libraries based on generic programming concepts ii libboost-dev:armhf 1.55.0.2 armhf Boost C++ Libraries development files (default version) ii libboost-filesystem-dev:armhf 1.55.0.2 armhf filesystem operations (portable paths, iteration over directories, etc) in C++ (default version) ii libboost-filesystem1.55-dev:armhf 1.55.0+dfsg-3 armhf filesystem operations (portable paths, iteration over directories, etc) in C++ ii libboost-filesystem1.55.0:armhf 1.55.0+dfsg-3 armhf filesystem operations (portable paths, iteration over directories, etc) in C++ ii libboost-program-options-dev:armhf 1.55.0.2 armhf program options library for C++ (default version) ii libboost-program-options1.55-dev:armhf 1.55.0+dfsg-3 armhf program options library for C++ ii libboost-program-options1.55.0:armhf 1.55.0+dfsg-3 armhf program options library for C++ ii libboost-python-dev 1.55.0.2 armhf Boost.Python Library development files (default version) ii libboost-python1.55-dev 1.55.0+dfsg-3 armhf Boost.Python Library development files ii libboost-python1.55.0 1.55.0+dfsg-3 armhf Boost.Python Library ii libboost-serialization-dev:armhf 1.55.0.2 armhf serialization library for C++ (default version) ii libboost-serialization1.55-dev:armhf 1.55.0+dfsg-3 armhf serialization library for C++ ii libboost-serialization1.55.0:armhf 1.55.0+dfsg-3 armhf serialization library for C++ ii libboost-system-dev:armhf 1.55.0.2 armhf Operating system (e.g. diagnostics support) library (default version) ii libboost-system1.55-dev:armhf 1.55.0+dfsg-3 armhf Operating system (e.g. diagnostics support) library ii libboost-system1.55.0:armhf 1.55.0+dfsg-3 armhf Operating system (e.g. diagnostics support) library ii libboost-test-dev:armhf 1.55.0.2 armhf components for writing and executing test suites (default version) ii libboost-test1.55-dev:armhf 1.55.0+dfsg-3 armhf components for writing and executing test suites ii libboost-test1.55.0:armhf 1.55.0+dfsg-3 armhf components for writing and executing test suites ii libboost-thread-dev:armhf 1.55.0.2 armhf portable C++ multi-threading (default version) ii libboost-thread1.55-dev:armhf 1.55.0+dfsg-3 armhf portable C++ multi-threading ii libboost-thread1.55.0:armhf 1.55.0+dfsg-3 armhf portable C++ multi-threading ii libboost1.55-dev:armhf 1.55.0+dfsg-3

1 1

range: partition a transformed range adaptor
by Auer, Jens 02 Oct '15

02 Oct '15

Hi, So today I wanted to partition a transformed range. I came up with something like std::vector<int> v; auto t2 = r | transformed( [](int) {return 0;} ); auto p2 = boost::range::partition(t2, [](int) {return true;} ); , but that didn't work. On Stackoverflow, it was explained that this doesn't work because partition needs to modify the range, and a transformed range is not modifiable. So far so good, I can follow this and see why and modify the program to use transform on the vector directly. What bothers me is that I was not able to figure that out from the documentation, and that the error message was not very intuitive to say the least. According to the documentation, the requirements on the range for partition are that it has to be a model of ForwardRange, which means that the iterators have to be forward traversable iterators. I think the important fact, namely that it has to be writeable iterator, is missing from the documentation completely. As far as I can see, readable/writable categories are not used in the range documentation at all. Best wishes, Jens -- Dr. Jens Auer | CGI | Software Engineer CGI Deutschland Ltd. & Co. KG Rheinstraße 95 | 64295 Darmstadt | Germany T: +49 6151 36860 154 jens.auer(a)cgi.com Unsere Pflichtangaben gemäß § 35a GmbHG / §§ 161, 125a HGB finden Sie unter de.cgi.com/pflichtangaben. CONFIDENTIALITY NOTICE: Proprietary/Confidential information belonging to CGI Group Inc. and its affiliates may be contained in this message. If you are not a recipient indicated or intended in this message (or responsible for delivery of this message to such person), or you think for any reason that this message may have been addressed to you in error, you may not use or copy or deliver this message to anyone else. In such case, you should destroy this message and are asked to notify the sender by reply e-mail.

1 0

parallelised ODE solvers
by Vihan Pandey 01 Oct '15

01 Oct '15

Dear all, I am trying to integrate a simple 2 variable ODE system. I wanted to know which of the solvers listed here : http://www.boost.org/doc/libs/1_56_0/libs/numeric/odeint/doc/html/boost_num… are parallelised for multicore CPU’s and GPU’s? Perhaps using Thrust for the Nvidia/CUDA GPU end of things? I am principally interested if someone has managed to make/port a library for parallelised RK45 methods. Please note in later work I plan on having more ODE's - probably systems of 12-15 parameters though they will be all be first order equations. Thanks and Cheers! - vihan -- Listening to Ozzy again!

3 4

boost::sort::spreadsort::integer_sort
by v9v＠laposte.net 01 Oct '15

01 Oct '15

Hi!I'm a C++ beginner and any help would be very much appreciated.I would like to convert this "std::sort" into "boost::sort::spreadsort::integer_sort".I know that I have to write "#include <boost/sort/spreadsort/integer_sort.hpp>" inmy header instead of "#include <algorithm>" but after that, this is too difficult...Thanks!-------------------------------------------------------------------#include <iostream>#include <algorithm>using namespace std;int main() { int nb1[4] = {15, 5, 0, 20}; int nb2[4] = {99,102, 8, 2}; int indices[4]; for (short i=0; i<4; i++) indices[i]=i; sort(begin(indices), end(indices), [&](int i1, int i2) { return nb1[i1] < nb1[i2]; } ); for (short i=0; i<4; i++) cout << nb1[indices[i]] << ' '; cout <<endl; // 0 5 15 20 for (short i=0; i<4; i++) cout << nb2[indices[i]] << ' '; cout <<endl; // 8 102 99 2 return 0;}---------------------------------------------------------------------

2 1

program_option parsing error
by Marek Skalický 30 Sep '15

30 Sep '15

Hello everyone, I have a question about program_option library. If I have argv=["binaryname", "--port", "5"] and port have set default_value=6 and implicit_value=7 what should be the value of port after parsing argv? I am asking because this test https://github.com/mongodb/mongo/blob/0481c958daeb2969800511e7475dc66986fa9… is failing with boost 1.59 (with boost 1.58 it is passing). Does someone please know what changed in this new version? Thank you, Marek

2 4

Is there any support for measuring or checking resource utilization in the boost utf?
by Victor Yankee 29 Sep '15

29 Sep '15

Is there any support for measuring or checking resource utilization, especially CPU usage and memory (either absolute amounts or percentages would be ok) in the boost utf?

2 1

bug in boost or in gcc-5.2.0 ?
by renaud lepere 29 Sep '15

29 Sep '15

I have a strange problem with mingw-w64, gcc-5.2.0 in 32bits on windows in release. The following code leads to a crash (it is working in 64 bits and in debug). The adress of return in the stack seems to be broken. I was not able to reduce it more than this, and in particular I am not able to remove BOOST_CHECK_CLOSE (using BOOST_CHECK_EQUAL works). This can be either a bug in gcc (false code generation) or something else. How can I investigate ? #define BOOST_TEST_MODULE MyTest #include <boost/test/unit_test.hpp> #include <iostream> struct P { P(double x_, double y_): x(x_), y(y_) {} double x; double y; }; struct Seg { Seg(const P & o_, const P & e_): o(o_), e(e_) {} P o; P e; }; void f() { auto Check = [](const Seg & s1, const Seg & s2, bool expected_common_cut, double expected_length) { std::cerr << expected_length << std::endl; BOOST_CHECK_CLOSE(1e-3, 1e-4, .1); }; Check(Seg(P(0, 0), P(100, 0)), Seg(P(0, 0), P(100, 0)), false, 0.0); Check(Seg(P(0, 0), P(100, 0)), Seg(P(100, 0), P(0, 0)), true, 100.0); std::cerr << "STILL LEAVING !" << std::endl; } void g() { std::cerr << "BEFORE CRASH" << std::endl; f(); std::cerr << "NEVER PRINTED" << std::endl; } BOOST_AUTO_TEST_CASE( my_test ) { g(); }

2 3

Heap: what is expected from T?
by Akim Demaille 28 Sep '15

28 Sep '15

Hi, I'm using a heap whose elements are value_type from a map; hence the key type is const. Some heaps seem to accept this gracefully, other just fail to compile. Is this expected? I saw no requirement about T in the documentation. This is Boost 1.59 from Mac Ports, on OS X. $ cat foo.cc #include <tuple> #include <string> #include <boost/heap/priority_queue.hpp> #include <boost/heap/fibonacci_heap.hpp> int main() { using datum_t = std::tuple<const std::string>; { using queue_t = boost::heap::fibonacci_heap<datum_t>; auto q = queue_t{}; q.emplace("foo"); } { using queue_t = boost::heap::priority_queue<datum_t>; auto q = queue_t{}; q.emplace("foo"); } } $ clang++-mp-3.7 -std=c++11 /tmp/foo.cc -isystem /opt/local/include In file included from /tmp/foo.cc:1: /opt/local/libexec/llvm-3.7/bin/../include/c++/v1/tuple:283:19: error: no viable overloaded '=' value = _VSTD::forward<_Tp>(__t); ~~~~~ ^ ~~~~~~~~~~~~~~~~~~~~~~~~ /opt/local/libexec/llvm-3.7/bin/../include/c++/v1/tuple:485:45: note: in instantiation of function template specialization 'std::__1::__tuple_leaf<0, const std::__1::basic_string<char>, false>::operator=<const std::__1::basic_string<char> >' requested here __swallow(__tuple_leaf<_Indx, _Tp>::operator=(_VSTD::forward<_Tp>(static_cast<__tuple_leaf<_Indx, _Tp>&>(__t).get()))...); ^ /opt/local/libexec/llvm-3.7/bin/../include/c++/v1/tuple:498:29: note: in instantiation of member function 'std::__1::__tuple_impl<std::__1::__tuple_indices<0>, const std::__1::basic_string<char> >::operator=' requested here class _LIBCPP_TYPE_VIS_ONLY tuple ^ /opt/local/libexec/llvm-3.7/bin/../include/c++/v1/algorithm:4848:5: note: in instantiation of function template specialization 'std::__1::__sift_up<boost::heap::detail::heap_base<std::__1::tuple<const std::__1::basic_string<char> >, std::__1::less<std::__1::tuple<const std::__1::basic_string<char> > >, false, unsigned long, false> &, std::__1::__wrap_iter<std::__1::tuple<const std::__1::basic_string<char> > *> >' requested here __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); ^ /opt/local/include/boost/heap/priority_queue.hpp:261:14: note: in instantiation of function template specialization 'std::__1::push_heap<std::__1::__wrap_iter<std::__1::tuple<const std::__1::basic_string<char> > *>, boost::heap::detail::heap_base<std::__1::tuple<const std::__1::basic_string<char> >, std::__1::less<std::__1::tuple<const std::__1::basic_string<char> > >, false, unsigned long, false> >' requested here std::push_heap(q_.begin(), q_.end(), static_cast<super_t const &>(*this)); ^ /tmp/foo.cc:17:7: note: in instantiation of function template specialization 'boost::heap::priority_queue<std::__1::tuple<const std::__1::basic_string<char> >, boost::parameter::void_, boost::parameter::void_, boost::parameter::void_, boost::parameter::void_>::emplace<char const (&)[4]>' requested here q.emplace("foo"); ^ /opt/local/libexec/llvm-3.7/bin/../include/c++/v1/string:1376:19: note: candidate function not viable: 'this' argument has type 'const std::__1::basic_string<char>', but method is not marked const basic_string& operator=(const basic_string& __str); ^ /opt/local/libexec/llvm-3.7/bin/../include/c++/v1/string:1379:19: note: candidate function not viable: 'this' argument has type 'const std::__1::basic_string<char>', but method is not marked const basic_string& operator=(basic_string&& __str) ^ /opt/local/libexec/llvm-3.7/bin/../include/c++/v1/string:1383:45: note: candidate function not viable: 'this' argument has type 'const std::__1::basic_string<char>', but method is not marked const _LIBCPP_INLINE_VISIBILITY basic_string& operator=(const value_type* __s) {return assign(__s);} ^ /opt/local/libexec/llvm-3.7/bin/../include/c++/v1/string:1384:19: note: candidate function not viable: 'this' argument has type 'const std::__1::basic_string<char>', but method is not marked const basic_string& operator=(value_type __c); ^ /opt/local/libexec/llvm-3.7/bin/../include/c++/v1/string:1387:19: note: candidate function not viable: 'this' argument has type 'const std::__1::basic_string<char>', but method is not marked const basic_string& operator=(initializer_list<value_type> __il) {return assign(__il.begin(), __il.size());} ^ 1 error generated. Thanks in advance.

1 0

[multi_index_container] Using equal_range with hashed indices
by Muruganand Karthikeyan 28 Sep '15

28 Sep '15

Hello! std::equal_range requires that the container be pre-sorted ( http://www.cplusplus.com/reference/algorithm/equal_range/) How does multi-index container handle this scenario with respect to hashed non-unique indices. The reason I ask is since I'm facing a situation with equal_range. Please see below code - typedef bmi< UserIdEntry, indexed_by< hashed_non_unique<tag<id1_id2>, composite_key<UserIdEntry, BMI_MEMBER(UserIdEntry, std::string, id1), BMI_MEMBER(UserIdEntry, std::string, id2) > > > > UserIdContainer; typedef UserIdContainer::index<id1_id2>::type IndexById1Id2; typedef IndexById1Id2::const_iterator IndexById1Id2_it; std::pair<IndexById1Id2_it, IndexById1Id2_it> entries = indexById1Id2.equal_range(make_tuple(id1_val, id2_val)); I'm seeing that *sometimes* entries.first equals indexById1Id2.end() and entries.second does not equal indexById1Id2.end(). The lookup is valid - meaning I've verified that there is at-least one entry which should be caught by the equal_range. I'm guessing the iterators' values are swapped. (second should be pointing to first and first should be pointing to second) What could be the reason for this? Thanks, MK.

2 1

[multi_index_container] Using modify_key vs modify
by Muruganand Karthikeyan 28 Sep '15

28 Sep '15

Hello! Under what circumstances should we use modify_key? I believe we can achieve the same result using modify, so what is the advantage in using modify_key? Thanks, MK. -- Anand's signature

2 1

Crash in managed_shared_memory
by Abhishek Kumar Pandey 28 Sep '15

28 Sep '15

Hi, I am using managed_shared_memory in my program. The program runs fine if only one instance is used. However if more than one instance is used then one instance dies randomly. The instance dies at the following code : char_string key_object(keyHashStr.c_str(), alloc_inst3); The sample program is : ----------------------- #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <boost/interprocess/containers/string.hpp> #include <string> #include <iostream> #define RESERVED_BUFFER_SIZE_WRITE (8 * 0x0100000) namespace bip = boost::interprocess; //Typedefs of allocators and containers typedef bip::allocator<char, bip::managed_shared_memory::segment_manager> char_allocator; typedef bip::basic_string<char, std::char_traits<char>, char_allocator> char_string; int main() { bip::managed_shared_memory m_sharedMemUsage(bip::open_or_create, "MyBookkeeper", 2 * RESERVED_BUFFER_SIZE_WRITE); char_allocator alloc_inst3(m_sharedMemUsage.get_segment_manager()); for (int count = 0; count < 100000; ++count) { char_string key_obect("AAAAAAAAAAAAAAAAAAAAAAA", alloc_inst3); } } ----------------------- Please let me know if I am missing something in this program. Regards, Abhishek

1 0

annoying warnings with mingw-w64 gcc-5.2.0
by renaud lepere 27 Sep '15

27 Sep '15

When I compile my code with gcc version 5.2.0 (x86_64-posix-seh-rev0, Built by MinGW-W64 project), I have annoying warnings with boost/utf and boost/asio (1.59). For example if I compile this simple file : #define BOOST_TEST_MODULE ExactSuite #include "boost/test/unit_test.hpp" I get : c:\Users\Renaud\nest\external\boost_1_59_0/boost/test/unit_test_log.hpp:130:28: warning: 'boost::unit_test::{anonymous}::unit_test_log' defined but not used [-Wunused-variable] BOOST_TEST_SINGLETON_INST( unit_test_log ) I can add #pragma GCC diagnostic ignored "-Wunused-variable" just before the include but it seems strange (and I have to do it in few other files). Does someone have similar problem ? or a better fix ?

2 1

Become a Library Maintainer
by Alex Olivas 27 Sep '15

27 Sep '15

Hey All, This was just announced this week at CppCon (originally proposed at C++Now, by Robert Ramey). There's a new program and process to allow teams, who may be maintaining boost libraries internally, to become official maintainers. These are libraries that are currently being maintained by the Boost Community Maintenance Team (https://svn.boost.org/trac/boost/wiki/CommunityMaintenance) : * Boost.ConceptCheck * Boost.DateTime * Boost.DisjointSet * Boost.DynamicBitset * Boost.Format * Boost.Function * Boost.Logic * Boost.MPL * Boost.PropertyMap * Boost.Signals (which is deprecated) * Boost.Tokenizer More information about the program can be found here: http://beta.boost.org/community/official_library_maintainer_program.html If you're interested in becoming a Boost Library Official Maintiner, please send me an email. Thanks, Alex.

4 5

[Boost-announce] Compile and run Boost examples online
by Antony Polukhin 25 Sep '15

25 Sep '15

Hi all, I've just launched the beta version of online examples for the "Boost Application Development Cookbook": http://apolukhin.github.io/Boost-Cookbook-4880OS/ There you can do online compilation of Boost related code, run examples, freely experiment with code from the book, read intros for the code and play around with the Boost libraries. I hope the site would be useful! P.S.: If you wish to report an error or wish to have some functionality added to the site, use the "Issues" link at https://github.com/apolukhin/Boost-Cookbook-4880OS or even make a pull request. P.P.S.: Intros for Chapters 7-12 are missing at this moment. I'll add them in a few months, sorry for the delay. -- Best regards, Antony Polukhin

1 0

switch_
by MM 25 Sep '15

25 Sep '15

I see Boost.Switch_ was provisionally accepted back inJan 2008. I see some doc here: http://dancinghacker.com/switch But I can't see it released in recent boost versions I need to select a type to dynamic_cast to based on a runtime index, so I would have the type in a mpl::vector, and use the switch_ to pick up the right type? I have under 20 types. in pseudo c++11: void f(std::size_t i, const T* obj) { typedef mpl::vector<T0, .... Tn> alltypes_t; const auto* drvobj = dynamic_cast<...>(obj); /// what do I set as arg of dynamic_cast } If switch_ can help, where do I get the code for it? Rds,

2 1

spirit help: segfault
by Littlefield, Tyler 25 Sep '15

25 Sep '15

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hello all: I'm getting a segfault when I run this. It looks like the debug prints, but when I debug it I just get an endless loop of backtrace. If anyone can help point me in the right direction, I'd appreciate it. I'd also appreciate, if possible any tips/tricks for cleaning up this grammar. Thanks! //code here: /*** *I-EBNF parser * *This defines a grammar for BNF. */ //Speeds up compilation times. //This is a relatively small grammar, this is useful. #define BOOST_SPIRIT_NO_PREDEFINED_TERMINALS #define BOOST_SPIRIT_QI_DEBUG #include <boost/config/warning_disable.hpp> #include <boost/spirit/include/qi.hpp> #include <boost/spirit/include/phoenix_operator.hpp> #include <boost/fusion/adapted.hpp> #include <boost/fusion/support.hpp> #include <vector> #include <string> #include <iostream> namespace Parser { namespace qi = boost::spirit::qi; namespace ascii = boost::spirit::ascii; enum class RHSType { Terminal, Identifier }; struct RHS { RHSType type; std::string value; }; struct Rule { std::string identifier; //lhs std::vector<RHS> rhs; }; } //expose our structs to fusion: BOOST_FUSION_ADAPT_STRUCT( Parser::RHS, (Parser::RHSType, type) (std::string, value) ) BOOST_FUSION_ADAPT_STRUCT( Parser::Rule, (std::string, identifier) (std::vector<Parser::RHS>, rhs) ) namespace Parser { typedef std::vector<Rule> RuleList; //our grammar definition template <typename Iterator> struct Grammar: qi::grammar<Iterator, std::list<Rule>, ascii::space_type> { Grammar(): Grammar::base_type(rules) { qi::char_type char_; letter = char_("a-zA-Z"); digit = char_('0', '9'); symbol = char_('[') | ']' | '[' | ']' | '(' | ')' | '<' | '>' | '\'' | '\"' | '=' | '|' | '.' | ',' | ';'; character = letter | digit | symbol | '_'; identifier = letter >> *(letter | digit | '_'); terminal = (char_('\'') >> character >> *character >> char_('\'')) | (char_('\"') >> character >> *character >> char_('\"')); lhs = identifier; rhs = terminal | identifier | char_('[') >> rhs >> char_(']') | char_('{') >> rhs >> char_('}') | char_('(') >> rhs >> char_(')') | rhs >> char_('|') >> rhs | rhs >> char_(',') >> rhs; rule = identifier >> char_('=') >> rhs; rules = rule >> *rule; } private: qi::rule<Iterator, char(), ascii::space_type> letter, digit, symbol, character; qi::rule<Iterator, std::string(), ascii::space_type> identifier, lhs, terminal; qi::rule<Iterator, RHS, ascii::space_type> rhs; qi::rule<Iterator, Rule, ascii::space_type> rule; qi::rule<Iterator, std::list<Rule>, ascii::space_type> rules; }; } int main() { Parser::Grammar<std::string::const_iterator> parser; boost::spirit::ascii::space_type space; std::string input; std::vector<std::string> output; bool result; while (std::getline(std::cin, input)) { if (input.empty()) { break; } std::string::const_iterator it, itEnd; it = input.begin(); itEnd = input.end(); result = phrase_parse(it, itEnd, parser, space, output); if (result && it == itEnd) { std::cout << "success" << std::endl; } } return 0; } - -- Take care, Ty twitter: @sorressean web:http://tysdomain.com pubkey: http://tysdomain.com/files/pubkey.asc -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQEcBAEBAgAGBQJWBJSYAAoJEAdP60+BYxejpMwH/0EeVKIALYQOdl9esFIe9fIX JSor6vD/xn3e+L93TcsfpCSgtJiITfGgCPIURVX4FAE1Tf7PZSsd5lvQS6MgjyhQ q1EjDaAZNVt+cQhAftCoGcOPElx2aJXhNy/aTzcQqW1ui72t780GrF+MCo3tdq8p 5wIePhVbk0Gq8f3WBVGRXsKLi0hzwAPNXdHndNdYklNndKvClfHN8cwAZa5rFbMN b9eULQNtw42oT9tABAtpTfCl+tvExL3DMftXoALP5wONSv3ewjX8vNVWb5iv0XeZ yaYxLlnAGF314NgXOZKrtnXumDofnIzMDCZKxYFH+UfZfA7eFobGKOF3t/pN1JQ= =gD3u -----END PGP SIGNATURE-----

2 1

slow gunzip
by Andy C 24 Sep '15

24 Sep '15

Hi, I am trying to write a simple program which processes large gziped files as streams. However, it turns out, that for some reason reading is very slow and it takes almost 10 times more to even count single lines as compared to a Java equivalent or "gunzip -c largefile.gz | wc -l". I would like to ask experts to point out what assumption I make. The source is attached below. Thanks in advance, Andy #include <iostream> #include <fstream> #include <boost/iostreams/filtering_stream.hpp> #include <boost/iostreams/filter/gzip.hpp> int main(int argc, char** argv) { char buf[10*4096]; std::cout << argv[1] << '\n'; long c=0; std::ifstream file(argv[1], std::ios_base::in | std::ios_base::binary); file.rdbuf()->pubsetbuf(buf, 10*4096); try { boost::iostreams::filtering_istream in; in.push(boost::iostreams::gzip_decompressor()); in.push(file); for(std::string str; std::getline(in, str); ) c++; } catch(const boost::iostreams::gzip_error& e) { std::cout << e.what() << '\n'; } std::cout << c << '\n'; return 0; }

1 0

any_cast and added low-level const -> throws
by nice sw123 23 Sep '15

23 Sep '15

Hi, can anyone explain why an any_cast that adds a low-level const throws?? Example: char str[] = "a2"; boost::any ay(str); boost::any_cast<const char*>(ay); // throws, since a const is added!!! The only way to do this (without throwing), seems to be: boost::any_cast<char*>(ay); But why this mild "design deficiency"?? I call it "design deficiency", since the following is legal and works: char str2[] = "str2"; static_cast<const char *>(str2); So we should be able to add a low-level const, to make something read-only, right. Thanks for comments and explanations. n. Here's some test-code: /////// #include <iostream> #include <algorithm> #include <boost/any.hpp> int main() { char str[] = "a1"; boost::any ay(str); std::cout << "1 -- " << boost::any_cast<char *>(ay) << std::endl; strcpy(str, "a2"); /* throws!! */ //std::cout << "2 -- " << boost::any_cast<const char*>(ay) << std::endl; strcpy(str, "a3"); std::cout << "3 -- " << *boost::any_cast<char *>(&ay) << std::endl; strcpy(str, "a4"); /* segfault!! */ //std::cout << "4 -- " << *boost::any_cast<const char *>(&ay) << std::endl; char str2[] = "str2"; std::cout << "str2 -- " << static_cast<const char *>(str2) << std::endl; return 0; } ///////

1 2

Boost.Locale on Windows not building with runtime-link=static
by Thomas Ziegenhagen 23 Sep '15

23 Sep '15

Hello there, once every year or so I have to rebuilt boost for the current compiler/settings combination I work with. This time it's the following: Visual Studio 2015 32 and 64bit static linking statically linked runtime I built boost from within the VS2015 developer console using this command line: c:\projects\boost_1_59_0>.\b2 variant=debug,release link=static runtime-link=static address-model=32 --stagedir=stage32 -sICU_PATH=C:\projects\icu Works great. Except that Boost.Locale does not respect the "runtime-link=static" and builds for dynamically linked runtime instead. The build log looks like this: ...patience... ...found 19297 targets... ...updating 76 targets... common.mkdir stage32 common.mkdir stage32\lib common.copy stage32\lib\libboost_atomic-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_system-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_chrono-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_container-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_thread-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_context-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_coroutine-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_date_time-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_exception-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_filesystem-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_regex-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_graph-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_iostreams-vc140-mt-sgd-1_59.lib common.copy stage32\lib\libboost_system-vc140-mt-gd-1_59.lib common.copy stage32\lib\libboost_chrono-vc140-mt-gd-1_59.lib common.copy stage32\lib\libboost_thread-vc140-mt-gd-1_59.lib common.copy stage32\lib\libboost_locale-vc140-mt-gd-1_59.lib common.copy stage32\lib\libboost_log-vc140-mt-sgd-1_59.lib Shortened. Please note the build process working correctly up until iostreams - all libraries have a 's' in the filename, denoting the statically linked runtime. Then comes Boost.Locale. And Boost.Locale does not respect the static runtime linking and instead builds for DLL runtime. The build process therefore builds all dependencies (system, chrono, thread) again with dynamic runtime linking and then builds Boost.Locale. When I'm trying to use this setup in my game, the boost auto-linking mechanism correctly determines that Boost.Locale is required, but requires the static runtime linked version, which obviously doesn't exist. So this is a bug in the build files? Is there a simple quickfix I can apply to my local installation to be able to carry on? Should I open an issue in Trac? Thanks for your time. Bye, Thomas

3 3

Regarding property maps
by Rohith Reddy 23 Sep '15

23 Sep '15

Hi all, I have been working on a graph using boost graph library with edge properties as bundled properties.I have the following struct as my edge property, typedef struct Edge{ int id; int source; int target; float cost; float reverse_cost; } Edge; Provided that I am inserting the data correctly,how do I get a property map for each of the elements of the struct,that is a property map for id,a property map for the source and so on.And moreover I also want to know how to extract the type of property map,as it is required to pass its type to other function as a template parameter. Thanks in advance.

2 3

fatal error LNK1104 cannot open file 'boost_unit_test_framework.lib'
by Anshuman Sinha 23 Sep '15

23 Sep '15

Hi, I'm building Quantlib 16.2 and have built Boost 1.59.0 using the NuGet package in VS2013. Of the 19 projects in Quantlib, 18 are built successfully while 1 project, testsuite, fails. I am getting the error that 'boost_unit_test_framework.lib' cannot be opened. The file physically does not exist on my computer, possibly because I am using NuGet in VS2013 to install boost and it's doing the header only thing. Can you please recommend how I can solve this issue? Thanks, Amatya -- *Pretty simple neat puzzle*: Assume the earth is a perfect sphere. Show that at any given time, there exist two antipodal points with the same temperature.

2 1

problem with boost units
by Robert Ramey 23 Sep '15

23 Sep '15

the following small example fails to compile and points to error in assignment. For the life of me I can't figure why this should fail. Any help appreciated. Robert Ramey // include headers to implement output operations for quantities with units #include <iostream> #include <boost/units/io.hpp> #include <boost/units/systems/si/volume.hpp> int main(){ boost::units::si::volume fuel_capacity; fuel_capacity = 9.0f * boost::units::si::cubic_meters; ------------------^ std::cout << " " << fuel_capacity << "\n"; return 0; }

3 2

[ublas.matrix] Bug in reversed column
by Yuan Yao 20 Sep '15

20 Sep '15

Dear all, The following is a short example: ==================================================== #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/matrix_proxy.hpp> #include <boost/range/adaptors.hpp> #include <iostream> int main() { boost::numeric::ublas::matrix<int> m(1, 2); std::cout << boost::size(column(m, 0)) << "\n"; std::cout << boost::size(column(m, 0) | boost::adaptors::reversed) << "\n"; return 0; } ==================================================== BOOST 1.59 VS 2015 outputs: 1 2147483649 CLANG on coliru outputs: 1 9223372036854775809 g++ on coliru outputs: 1 9223372036854775809

1 0

boost::interprocess mapped_file binary compatibility
by Vladimir Kotlyar 17 Sep '15

17 Sep '15

What, if anything, can be assumed about cross-platform and backwards binary compatibility of files generated using boost::ipc classes? I could not find any explicit statement in the IPC library docs. Thanks. -- View this message in context: http://boost.2283326.n4.nabble.com/boost-interprocess-mapped-file-binary-co… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Problems with boost::coroutines with lambda captures
by Mikhail Strelnikov 17 Sep '15

17 Sep '15

> Sumamry: somehow the captured smart pointer gets destroyed+corrupted > when I yield from the coroutine, but the local copy survives. When I use GeneratorBlockEnumerator gets parameter (std::function) by value (temporary function gets created before constructor and destroyed right after). Then this temporary function passed by reference to push_type.

2 1

[MPI] Fail in compiling MPI and related libraries
by Yuan Yao 16 Sep '15

16 Sep '15

3 3

Problems with boost::coroutines with lambda captures
by Tamas.Ruszkai＠leica-geosystems.com 16 Sep '15

16 Sep '15

2 1

[Interprocess] Compiling unordered_map in shared memory on GCC 4.1.2
by Karyakin, Maxim 16 Sep '15

16 Sep '15

Hi all, I'm having issues compiling boost::unordered_map with boost::interprocess. I'm using boost 1.57 and compiler is GCC 4.1.2 . I've tried to ask it on SO few months ago, but got no solution for it and decided to use just map. Now I'm seeking for some performance improvement again, so I will try my luck here. I took code from the answer on SO (http://stackoverflow.com/questions/29557680/boost-interprocess-unordered-ma…) with minimal changes to make it work under non C++11 compiler. It looks better than my and there are same errors generated. Code: #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/containers/string.hpp> #include <boost/interprocess/containers/map.hpp> #include <boost/unordered_map.hpp> namespace bip = boost::interprocess; // ShmString is boost::interprocess::basic_string typedef bip::allocator<char, bip::managed_shared_memory::segment_manager> CharAllocator; typedef bip::basic_string<char, std::char_traits<char>, CharAllocator> ShmString; typedef ShmString HashKeyType; // ComplexType is a wrapper for internal interprocess::map struct ComplexType { typedef bip::allocator<std::pair<int const, int>, bip::managed_shared_memory::segment_manager> Alloc; typedef bip::map<int, int, std::less<int>, Alloc> Map; template <typename Alloc2> ComplexType(std::string, Alloc2 const& alloc) : map(alloc) {} Map map; }; typedef ComplexType HashMappedType; typedef std::pair<const ShmString, ComplexType> HashValueType; typedef bip::allocator<HashValueType, bip::managed_shared_memory::segment_manager> HashMemAllocator; typedef boost::unordered_map<HashKeyType, HashMappedType, boost::hash<HashKeyType>, std::equal_to<HashKeyType>, HashMemAllocator> TestHashMap; int main() { // Allocation: { bip::managed_shared_memory segment(bip::open_or_create, "MySharedMemory", 65536); TestHashMap * thm_ = segment.construct<TestHashMap>("TestHashMap")(3, boost::hash<ShmString>(), std::equal_to<ShmString>(), segment.get_allocator<HashValueType>()); } // Usage: bip::managed_shared_memory segment(bip::open_only, "MySharedMemory"); TestHashMap * thm_ = segment.construct<TestHashMap>("TestHashMap")(3, boost::hash<ShmString>(), std::equal_to<ShmString>(), segment.get_allocator<HashValueType>()); ShmString str("123.345", segment.get_allocator<ShmString>()); ComplexType th("MySharedMemory", segment.get_segment_manager()); HashValueType value(str, th); thm_->insert(value); } And here is some error output: ../boost_1_57/include/boost/unordered/detail/allocate.hpp: In instantiation of 'boost::unordered::detail::allocator_traits<boost::interprocess::allocator<boost::unordered::detail::ptr_node<std::pair<const boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType> >, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >::pointer_to_other<const boost::unordered::detail::ptr_node<std::pair<const boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType> > >': ../boost_1_57/include/boost/unordered/detail/allocate.hpp:535: instantiated from 'boost::unordered::detail::allocator_traits<boost::interprocess::allocator<boost::unordered::detail::ptr_node<std::pair<const boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType> >, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >' ../boost_1_57/include/boost/unordered/detail/unique.hpp:122: instantiated from 'boost::unordered::detail::pick_node<boost::interprocess::allocator<std::pair<const boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType>, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> >, std::pair<const boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType> >' ../boost_1_57/include/boost/unordered/detail/unique.hpp:166: instantiated from 'boost::unordered::detail::map<boost::interprocess::allocator<std::pair<const boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType>, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> >, boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType, boost::hash<boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > > >, std::equal_to<boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > > > >' ../boost_1_57/include/boost/unordered/unordered_map.hpp:60: instantiated from 'boost::unordered::unordered_map<boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType, boost::hash<boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > > >, std::equal_to<boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > > >, boost::interprocess::allocator<std::pair<const boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType>, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >' src/Main.cpp:453: instantiated from here ../boost_1_57/include/boost/unordered/detail/allocate.hpp:531: error: ambiguous class template instantiation for 'struct boost::pointer_to_other<boost::interprocess::offset_ptr<boost::unordered::detail::ptr_node<std::pair<const boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType> >, long int, long unsigned int, 0u>, const boost::unordered::detail::ptr_node<std::pair<const boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType> > >' ../boost_1_57/include/boost/interprocess/offset_ptr.hpp:742: error: candidates are: struct boost::pointer_to_other<boost::interprocess::offset_ptr<T1, P1, O1, A1>, U> ../boost_1_57/include/boost/pointer_to_other.hpp:29: error: struct boost::pointer_to_other<Sp<T>, U> ../boost_1_57/include/boost/pointer_to_other.hpp:36: error: struct boost::pointer_to_other<Sp<T, T2>, U> ../boost_1_57/include/boost/pointer_to_other.hpp:43: error: struct boost::pointer_to_other<Sp<T, T2, T3>, U> ../boost_1_57/include/boost/unordered/detail/allocate.hpp:531: error: invalid use of undefined type 'struct boost::pointer_to_other<boost::interprocess::offset_ptr<boost::unordered::detail::ptr_node<std::pair<const boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType> >, long int, long unsigned int, 0u>, const boost::unordered::detail::ptr_node<std::pair<const boost::container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long int, long unsigned int, 0u>, 0ul>, boost::interprocess::iset_index> > >, ComplexType> > >' Is it possible to fix this problem without switching updating the compiler? Thanks and regards. =============================================================================== Please access the attached hyperlink for an important electronic communications disclaimer: http://www.credit-suisse.com/legal/en/disclaimer_email_ib.html ===============================================================================

1 0