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

[BGL] Shared nodes on path
by Sensei 03 Mar '14

03 Mar '14

Dear all, I have a simple question about the most efficient way of finding shared nodes between a path and a graph. Let me be more explicit. I have an oriented graph G, and a very simple graph P, which is actually a simple oriented path (n0 -> n1 -> ... -> nK). I need to find *all* the possible shared paths between P and G with the same length as P. For instance, being P = n1 -> n2 -> n3 -> n4 -> n5 -> n6 we may find that the G and P share only two sub-paths n1 -> n2 -> n3 n5 -> n6 I'd like to find all sub-graphs that connect the two paths, for instance having n1 -> n2 -> n3 -> n10 -> n5 -> n6 n1 -> n2 -> n3 -> n42 -> n5 -> n6 with the constraint that the solution must be a path with the same length as P, therefore a solution as these n1 -> n2 -> n3 -> n9 -> n8 -> n5 -> n6 n1 -> n2 -> n3 -> n5 -> n6 would not be acceptable. I know I can do it manually, but I think a BGL-aware solution is quite better that a manual search :) Thanks & Cheers!

2 4

Error compiling Boost::graph crs_graph
by Andrea Cassioli 28 Feb '14

28 Feb '14

Dear all, I have been using the compressed_sparse_row_graph quite extensively in past. Now, I am working under Linux with Boost 1.55 and I am lost trying to compile the following toy piece of code: #include <vector> #include <boost/graph/compressed_sparse_row_graph.hpp> int main() { typedef boost::compressed_sparse_row_graph<boost::directedS, boost::no_property, int> gtype; std::vector<boost::graph_traits<gtype>::edge_descriptor> edges; std::vector< int > distances; gtype graph(boost::edges_are_unsorted_t(), edges.begin(), edges.end(), distances.begin(), edges.size()); return 0; } Just compile with g++ 4.8.2 and you get In file included from /usr/include/boost/graph/detail/compressed_sparse_row_struct.hpp:33:0, from /usr/include/boost/graph/compressed_sparse_row_graph.hpp:29, from prova_icl.cpp:2: /usr/include/boost/graph/detail/histogram_sort.hpp: In instantiation of ��void boost::graph::detail::split_into_separate_coords(InputIterator, InputIterator, std::vector<Property>&, std::vector<Property>&) [with InputIterator = __gnu_cxx::__normal_iterator<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>*, std::vector<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> > >; VerticesSize = long unsigned int]��: /usr/include/boost/graph/compressed_sparse_row_graph.hpp:466:46: required from ��boost::compressed_sparse_row_graph<boost::directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::compressed_sparse_row_graph(boost::edges_are_unsorted_t, InputIterator, InputIterator, EdgePropertyIterator, boost::compressed_sparse_row_graph<boost::directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::vertices_size_type, const GraphProperty&) [with InputIterator = __gnu_cxx::__normal_iterator<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>*, std::vector<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> > >; EdgePropertyIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >; VertexProperty = boost::no_property; EdgeProperty = int; GraphProperty = boost::no_property; Vertex = long unsigned int; EdgeIndex = long unsigned int; boost::compressed_sparse_row_graph<boost::directedS, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex>::vertices_size_type = long unsigned int]�� prova_icl.cpp:14:34: required from here /usr/include/boost/graph/detail/histogram_sort.hpp:226:51: error: conversion from ��boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>�� to non-scalar type ��std::pair<long unsigned int, long unsigned int>�� requested std::pair<VerticesSize, VerticesSize> edge = *begin; What the xxx is happening? In my understanding sounds like there conversion from an edge_descriptor to a pair....Any ideas?? Best, Andrea Cassioli

1 0

boost::optional with BOOST_FUSION_ADAPT_ADT broken?
by Andrew 28 Feb '14

28 Feb '14

There's an issue using get expressions returning optionals with BOOST_FUSION_ADAPT_ADT, demonstrated in the simplest case below. Optional<T> is trying initialize its internal T object using the attribute proxy object returned by fusion, but this can only degrade to optional<T> and not T, so the assignment fails. C++ wizard, K-Ballo, took a quick look at this in #boost and seemed to suggest it's the way op= is SFINAEd up for optional. Does anyone have a work around for this? #include <boost/optional.hpp> #include <boost/fusion/adapted/struct/adapt_struct.hpp> #include <boost/fusion/adapted/adt/adapt_adt.hpp> #include <boost/fusion/algorithm/auxiliary/copy.hpp> struct A { boost::optional<int> x; }; struct B { boost::optional<int> y; }; BOOST_FUSION_ADAPT_STRUCT(B, (boost::optional<int>, y)) BOOST_FUSION_ADAPT_ADT(A, (boost::optional<int>, boost::optional<int>, obj.x, obj.x = val)) int main() { A a; B b; // doesn't work: boost::fusion::copy (a, b); // this works: // boost::fusion::copy (b, a); }

3 4

boost graph, Using Bundled Properties and Internal Properties at the same time
by Paolo Bolzoni 27 Feb '14

27 Feb '14

Dear list, Related to the other email of me I woud like to use the subgraphs class, but the base graph needs two internal properties: vertex_index and edge_index. However in my program I use bundled properties as suggested in this list some time ago. Now I have this problem, is possible to use internal and bundled properties in the same graph? Or can I use subgraph in another way? Your faithfully, Paolo

1 0

Strange problem with boost/graph/subgraph.hpp
by Paolo Bolzoni 27 Feb '14

27 Feb '14

Dear list, I cannot compile a simple example using the subgraph implementation. I enclosed the code in the bottom of this email. It is quite short, but it is the whole code. It does not compile with errors from inside boost/graph/detail/adjacency_list.hpp about the impossiblity of making a reference to void. I read the subgraph documentation but I cannot understand why it does not work. Can anyone enlighten me? Your faithfully, Paolo The code: ------------------ >8 #include <boost/graph/adjacency_list.hpp> #include <boost/graph/subgraph.hpp> typedef boost::adjacency_list < boost::listS, boost::listS, boost::undirectedS > main_graph; typedef boost::subgraph <main_graph> sub_graph; typedef boost::graph_traits<sub_graph>::vertex_descriptor Bvertex; 8< ------------------

1 1

[ASIO] Streambuf not containing full line
by Gonzalo Garramuno 27 Feb '14

27 Feb '14

I am using asio asynchronically. I have: void tcp_session::start_read() { // Set a deadline for the read operation. // input_deadline_.expires_from_now(boost::posix_time::seconds(30)); // input_deadline_.expires_at(boost::posix_time::pos_infin); // Start an asynchronous operation to read a newline-delimited message. boost::asio::async_read_until(socket(), input_buffer_, '\n', boost::bind(&tcp_session::handle_read, shared_from_this(), boost::asio::placeholders::error)); } void tcp_session::handle_read(const boost::system::error_code& ec) { if (stopped()) return; if (!ec) { // Extract the newline-delimited message from the buffer. std::string msg; std::istream is(&input_buffer_); is.exceptions( std::ifstream::failbit | std::ifstream::badbit | std::ifstream::eofbit ); try { while ( std::getline(is, msg) ) { // parse msg here (gets truncated to last 256 chars or so) std::cerr << msg << std::endl; } } catch ( const std::ios_base::failure& e ) { std::cerr << "getline failure " << e.what() << std::endl; } } My problem is that I am seeing messages that are not a full line, but a truncation of the line, as if a buffer gets full with 256 characters. I am unsure what I am doing wrong. I get a getline failure saying basic_ios::clear.

2 1

[fusion] nth runtime element of a sequence
by MM 26 Feb '14

26 Feb '14

Hello, I just wanted to confirm there's no provided method to get the n'th element of say a fusion vector where n is known at runtime, except of handling it explicitkly with a switch case? Thanks MM

4 9

Project link error with Wave on OSX
by Olivier Prat 26 Feb '14

26 Feb '14

I've just updated a project that was working under XCode 4 with boost 1.48 to XCode 5 and boost 1.55 (installed with MacPorts). Now I have a link error with Wave which wasn't the case before. This somehow baffles me as I thought everything was template based. I am also linking with libboost-wave.mt.a but that doesn't solve the problem. The linker errors are, among 6 others: Undefined symbols for architecture x86_64: "boost::wave::cpplexer::new_lexer_gen<__gnu_cxx::__normal_iterator<char*, std::string>, boost::wave::util::file_position<boost::wave::util::flex_string<char, std::char_traits<char>, std::allocator<char>, boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char, std::allocator<char> >, char*> > >, boost::wave::cpplexer::lex_token<boost::wave::util::file_position< boost::wave::util::flex_string<char, std::char_traits<char>, std::allocator<char>, boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char, std::allocator<char> >, char*> > > > >::new_lexer(__gnu_cxx::__normal_iterator<char*, std::string> const&, __gnu_cxx::__normal_iterator<char*, std::string> const&, boost::wave::util::file_position<boost::wave::util::flex_string<char, std::char_traits<char>, std::allocator<char>, boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char, std::allocator<char> >, char*> > > const&, boost::wave::language_support)", referenced from: I've tried forcing std::string as the BOOST_WAVE_STRINGTYPE, but that just changes the signatures of the undefined symbols. I fail to see what has changed and I am completely stuck. I would have understood if I had a compiler error but this is a link error. Is this something to do with the standard C++ library? For my project, C++ dialect is C++98 and the standard library is libstdc++. Thanks in advance, Olivier

2 4

Question on writing HTTP parser
by gomti 25 Feb '14

25 Feb '14

Hello. I'm newbie for boost library. I'm trying to write a HTTP Parser, which handles the HTTP message coming from the proxy server. I don't know much about the boost, so I'm really confused on what to use to write my functionality. When I search on the internet, some say that I need to used Boost.Asio and Some say Boost.Spirit. When I looked over the document for each, I found that Boost.Asio is like network library for C++ and Boost.Spirit is for writing compilers. As I mention above, I want to write a http parser. I think the relevant one is the following: https://github.com/joyent/http-parser Please give me some advice. Since this is my first posting, I don't know the culture in this mailing list so if I'm doing some mistake in here, please let me know. Thanks.

3 3

Parallel Dijkstra with Predecessors
by Florian Meier 25 Feb '14

25 Feb '14

Hi, I am trying to use the parallel Dijkstra implementation with predecessors, but I am not able to compile it. Please have a look at the following diff against boost_1_53_0/libs/graph_parallel/example/dijkstra_shortest_paths.cpp (You can find the modified version attached.) ------------------------------------------- @@ -45,8 +45,10 @@ /* An undirected, weighted graph with distance values stored on the vertices. */ +typedef adjacency_list_traits<vecS, distributedS<mpi_process_group, vecS>, undirectedS>::vertex_descriptor vertex_descriptor; + typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, undirectedS, - /*Vertex properties=*/property<vertex_distance_t, float>, + /*Vertex properties=*/property<vertex_distance_t, float, property<vertex_predecessor_t, vertex_descriptor> >, /*Edge properties=*/property<edge_weight_t, float> > Graph; @@ -71,7 +73,7 @@ // Compute shortest paths from vertex 0 dijkstra_shortest_paths(g, start, - distance_map(get(vertex_distance, g))); + distance_map(get(vertex_distance, g)).predecessor_map(get(vertex_predecessor, g))); // Output a Graphviz DOT file std::string outfile = filename; ------------------------------------------- This (actually get(vertex_predecessor, g)) gives me ------------------------------------------- In file included from /usr/include/boost/property_map/parallel/distributed_property_map.hpp:706:0, from /usr/include/boost/property_map/property_map.hpp:645, from /usr/include/boost/graph/properties.hpp:19, from /usr/include/boost/mpi/graph_communicator.hpp:30, from /usr/include/boost/mpi.hpp:27, from /usr/include/boost/graph/distributed/mpi_process_group.hpp:30, from dijkstra_shortest_paths.cpp:16: /usr/include/boost/property_map/parallel/impl/distributed_property_map.ipp: In instantiation of ‘void boost::parallel::distributed_property_map<ProcessGroup, GlobalMap, StorageMap>::handle_message<Reduce>::handle_multiput(int, int, const std::vector<boost::unsafe_pair<typename boost::property_traits<StorageMap>::key_type, typename boost::property_traits<StorageMap>::value_type> >&, boost::graph::parallel::trigger_receive_context) [with Reduce = boost::property_reduce<boost::vertex_predecessor_t>::apply<boost::detail::parallel::global_descriptor<long unsigned int> >; ProcessGroup = boost::graph::distributed::mpi_process_group; GlobalMap = boost::detail::parallel::global_descriptor_property_map<long unsigned int>; StorageMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>*, boost::detail::parallel::global_descriptor<long unsigned int>, boost::detail::parallel::global_descriptor<long unsigned int>&, boost::vertex_predecessor_t>; typename boost::property_traits<StorageMap>::value_type = boost::detail::parallel::global_descriptor<long unsigned int>; typename boost::property_traits<StorageMap>::key_type = long unsigned int]’: /usr/include/boost/property_map/parallel/impl/distributed_property_map.ipp:255:18: required from ‘void boost::parallel::distributed_property_map<ProcessGroup, GlobalMap, StorageMap>::handle_message<Reduce>::setup_triggers(boost::parallel::distributed_property_map<ProcessGroup, GlobalMap, StorageMap>::process_group_type&) [with Reduce = boost::property_reduce<boost::vertex_predecessor_t>::apply<boost::detail::parallel::global_descriptor<long unsigned int> >; ProcessGroup = boost::graph::distributed::mpi_process_group; GlobalMap = boost::detail::parallel::global_descriptor_property_map<long unsigned int>; StorageMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, shor t int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>*, boost::detail::parallel::global_descriptor<long unsigned int>, boost::detail::parallel::global_descriptor<long unsigned int>&, boost::vertex_predecessor_t>; boost::parallel::distributed_property_map<ProcessGroup, GlobalMap, StorageMap>::process_group_type = boost::graph::distributed::mpi_process_group]’ /usr/include/boost/property_map/parallel/impl/distributed_property_map.ipp:35:3: required from ‘boost::parallel::distributed_property_map<ProcessGroup, GlobalMap, StorageMap>::distributed_property_map(const ProcessGroup&, const GlobalMap&, const StorageMap&, const Reduce&) [with Reduce = boost::property_reduce<boost::vertex_predecessor_t>::apply<boost::detail::parallel::global_descriptor<long unsigned int> >; ProcessGroup = boost::graph::distributed::mpi_process_group; GlobalMap = boost::detail::parallel::global_descriptor_property_map<long unsigned int>; StorageMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, floa t> > >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>*, boost::detail::parallel::global_descriptor<long unsigned int>, boost::detail::parallel::global_descriptor<long unsigned int>&, boost::vertex_predecessor_t>]’ /usr/include/boost/graph/distributed/adjacency_list.hpp:3468:50: required from ‘typename boost::property_map<boost::adjacency_list<OutEdgeListS, boost::distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>, Property>::type boost::get(Property, boost::adjacency_list<OutEdgeListS, boost::distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>&) [with Property = boost::vertex_predecessor_t; OutEdgeListS = boost::vecS; ProcessGroup = boost::graph::distributed::mpi_process_group; InVertexListS = boost::vecS; InDistribution = boost::defaultS; DirectedS = boost::undirectedS; VertexProperty = boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >; EdgeProperty = boost::property<boost::edge_weight_t, float>; GraphProperty = boost::no_property; EdgeL istS = boost::listS; typename boost::property_map<boost::adjacency_list<OutEdgeListS, boost::distributedS<ProcessGroup, InVertexListS, InDistribution>, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>, Property>::type = boost::parallel::distributed_property_map<boost::graph::distributed::mpi_process_group, boost::detail::parallel::global_descriptor_property_map<long unsigned int>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<b oost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>*, boost::detail::parallel::global_descriptor<long unsigned int>, boost::detail::parallel::global_descriptor<long unsigned int>&, boost::vertex_predecessor_t> >]’ dijkstra_shortest_paths.cpp:77:106: required from here /usr/include/boost/property_map/parallel/impl/distributed_property_map.ipp:236:47: error: no match for call to ‘(boost::property_reduce<boost::vertex_predecessor_t>::apply<boost::detail::parallel::global_descriptor<long unsigned int> >) (const long unsigned int&, boost::parallel::distributed_property_map<boost::graph::distributed::mpi_process_group, boost::detail::parallel::global_descriptor_property_map<long unsigned int>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t , float, boost::property<boost::vertex_predecessor_t, boost::detail::parallel::global_descriptor<long unsigned int> > >, boost::property<boost::edge_locally_owned_t, bool, boost::property<boost::edge_target_processor_id_t, short int, boost::property<boost::edge_weight_t, float> > >, boost::no_property, boost::listS>*, boost::detail::parallel::global_descriptor<long unsigned int>, boost::detail::parallel::global_descriptor<long unsigned int>&, boost::vertex_predecessor_t> >::value_type&, const boost::detail::parallel::global_descriptor<long unsigned int>&)’ values[i].second)); ^ In file included from /usr/include/boost/graph/distributed/breadth_first_search.hpp:23:0, from /usr/include/boost/graph/breadth_first_search.hpp:404, from /usr/include/boost/graph/dijkstra_shortest_paths.hpp:21, from dijkstra_shortest_paths.cpp:19: /usr/include/boost/graph/parallel/properties.hpp:90:11: note: candidates are: class apply ^ /usr/include/boost/graph/parallel/properties.hpp:95:9: note: T boost::property_reduce<boost::vertex_predecessor_t>::apply<T>::operator()(T) const [with T = boost::detail::parallel::global_descriptor<long unsigned int>] T operator()(T key) const { return key; } ^ /usr/include/boost/graph/parallel/properties.hpp:95:9: note: candidate expects 1 argument, 3 provided /usr/include/boost/graph/parallel/properties.hpp:96:9: note: T boost::property_reduce<boost::vertex_predecessor_t>::apply<T>::operator()(T, T, T) const [with T = boost::detail::parallel::global_descriptor<long unsigned int>] T operator()(T key, T, T y) const { return y; } ^ /usr/include/boost/graph/parallel/properties.hpp:96:9: note: no known conversion for argument 1 from ‘const long unsigned int’ to ‘boost::detail::parallel::global_descriptor<long unsigned int>’ ------------------------------------------- What is wrong here? Greetings, Florian

2 1

boost/graph/metric_tsp_approx.hpp patch, is there interest?
by Paolo Bolzoni 25 Feb '14

25 Feb '14

Dear list, In the boost/graph/metric_tsp_approx.hpp:224 is a note // TODO: This is will be O(n^2) if vertex storage of g != vecS. Since I am exactly in this situation I made a patch for my use, I added a bundled property to MSTImpl's vertices to contain a descriptor to keep track of the original graph vertices. It is a small modification, but since there is a TODO perhaps there is interest? If so how should I share it? Of course any comment is welcome. Your sincerely, Paolo

1 0

[icl] Icl broken for c++11's hint semantics. Fix provided.
by Joachim Faulhaber 25 Feb '14

25 Feb '14

Dear Icl users, due to a subtle effect of the changed hint semantics for associative containers, the icl library is broken in versions <= 1.55.0 when used with new STL-libraries that implement the new c++11 standard. This bug is fixed in the upcoming Boost 1.56.0. (see regression tests at http://www.boost.org/development/tests/master/developer/icl.html) Since the release of boost 1.56.0 seems to take longer than planned due to restructuring efforts for modular-boost, users of Boost.Icl affected by the problem may choose to pull the fixed Boost.Icl directly from the git repository and replace your_boost_1_55_0/boost/icl with the new code. The libs/icl part does not need an update. Another possibility is to apply the patch-file diff_icl_1_55_0_and_master.patch that is attached to this post to your local boost library 1.55.0: 1. cd to your_boost_1_55_0 root directory. your_boost_1_55_0> 2. From the command line type your_boost_1_55_0> patch -p2 < diff_icl_1_55_0_and_master.patch You may check the patched library by moving to your_boost_1_55_0/libs/icl/test and run your_boost_1_55_0/libs/icl/test> bjam Sorry for the inconvenience. Best regards, Joachim P.S.: For those interested in details of the issue here is a report: The semantics of insertion with hint in associative containers changed in c++11 form insert-after-hint (c++98/03) to insert-before-hint (c++11) see e.g. proposal N1780: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1780.html so for an associative container c of type C, a value x and an iterator hint c.insert(hint, x); //tries to insert x right after hint in c++98 c.insert(hint, x); //tries to insert x before hint in c++11 In accordance with this behavior, if using the insert function std::pair<bool, iterator> C::insert(value_type const& x); (success, hint) = c.insert(x); the iterator hint of unsuccessful insertion is the matching hint, pointing to [c++98] the last element y in c that is not greater x, so x can be inserted *after* that hint. [c++11] the first element z in c that is greater than x, so x can be inserted *before* that hint. In Boost.Icl I used the returned hint-iterator of the insert function, that always returned the last overlapping interval y for an inserted interval x given the interval's exclusive-less ordering under c++98. With the changed hint semantics, this returned hint-iterator did not point to the last interval y overlapping x anymore but to the first interval z not overlapping x. Therefore the code was broken and returned false results. -- Interval Container Library [Boost.Icl] http://www.joachim-faulhaber.de

1 0

Intrusive unordered set and thread safety
by Dave Davoren 25 Feb '14

25 Feb '14

Hi, I have been playing around with the boost intrusive unordered set. If my application is multi-threaded I do not see any way to make the set thread safe at a bucket level. I have seen a previous post from November 2012 "[Intrusive] unordered_set and thread safety" which asked the same question. At that point it was not implemented but I have not seen any updates in that area since. My question is, has it been implemented or is there a plan to implement such a feature in the near future? Thank you, Dave.

2 2

Re: [Boost-users] [interprocess] Shared memory object
by Ahmed Charles 24 Feb '14

24 Feb '14

Windows doesn't have to write to disk if there is no memory pressure in the case of a page file but if you have an explicit file being mapped, then you'll get writes to disk. This hypothesis should be easy to observe by monitoring the disk activity during your perf tests. ________________________________ From: Davies, John Sent: 2/21/2014 1:28 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [interprocess] Shared memory object >From my reading, the Windows version is faster but it doesn't have the persistence as the Linux version. The description mentions this: A class that wraps the native Windows shared memory that is implemented as a file mapping of the paging file. Unlike shared_memory_object<http://www.boost.org/doc/libs/1_55_0/doc/html/boost/interprocess/shared_mem…>, windows_shared_memory<http://www.boost.org/doc/libs/1_55_0/doc/html/boost/interprocess/windows_sh…> has no kernel persistence and the shared memory is destroyed when all processes destroy all their windows_shared_memory<http://www.boost.org/doc/libs/1_55_0/doc/html/boost/interprocess/windows_sh…> objects and mapped regions for the same shared memory or the processes end/crash. Boost lets you choose what means more to you. ___________________________________ John Davies Contractor Home Respiratory Care Philips Home Healthcare Solutions 1740 Golden Mile Highway Monroeville, PA 15146 Email: john.davies(a)philips.com Fax: 724-387-4109 From: Boost-users [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Patrick Steele Sent: Thursday, February 20, 2014 11:40 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [interprocess] Shared memory object Tests at the time were showing the Windows version to operate about twice as fast. If nothing has changed I guess I will remain with it then. I had just been hoping for the code to be more platform dependent. On 20 February 2014 14:44, Ion Gaztañaga <igaztanaga(a)gmail.com<mailto:igaztanaga@gmail.com>> wrote: El 20/02/2014 11:42, Patrick Steele escribió: Hi, can anyone tell me if there is a performance or other difference between boost::interprocess::shared_memory_object and boost::interprocess::windows_shared_memory? With the version of boost we were using back in 2011 ( boost 1.48 ), we found that windows_shared_memory operated faster than shared_memory_object when transporting around 10MB of data. Is this still the case? Thanks, Nothing has changed AFAIK. shared_memory_object is a memory mapped file whereas windows_shared_memory is backed by the pagefile. I don't know why Windows should make one faster than the other, though. Best, Ion _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org<mailto:Boost-users@lists.boost.org> http://lists.boost.org/mailman/listinfo.cgi/boost-users ________________________________ 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. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[iostreams] gzip problem
by Olaf Krzikalla 24 Feb '14

24 Feb '14

Hi @boost, I have a file format containing chunks of gzipped data (using gzip_decompressor/gzip_compressor). Inbetween these chunks there is other (plain) data. So can keep the archive seekable. However apparently this doesn't work out as it should. Whenever gzip_decompressor reaches the end of a chunk it throws an exception. The trouble-making line is in basic_gzip_decompressor::read: if (footer_.done()) { if (footer_.crc() != this->crc()) boost::throw_exception(gzip_error(gzip::bad_crc)); int c = boost::iostreams::get(peek); if (traits_type::is_eof(c)) { ----------------------------- state_ = s_done; } else { peek.putback(c); base_type::close(peek, BOOST_IOS::in); state_ = s_start; header_.reset(); footer_.reset(); } } Thus after the footer is read and checked, the decompressor checks whether or not eof is reached. Obvisiously this isn't the case here - the decompressed chunk is just embedded in the file. Thus the decompressor restarts, but cannot find another header thus throwing an exception. Would it be reasonable to just insert a break? header_.reset(); footer_.reset(); + break; } } This would solve _my_ problem. Or is there another way to work around this issue? Best Olaf

2 2

boost serialize, exception "eaten" up...
by Robert Bielik 23 Feb '14

23 Feb '14

Hi all, I'm trying to make a deserialization user cancellable, and I thought, hey, if I throw an exception in a progress handler (used when reading chars from input stream), that would propagate through the load hieararchy and I can catch it at top level... Nope... it gets caught in iostream (VS2012, row 776) :( , so the _CATCH_IO_END is probably a catch(...). Not very nice, and quite counter-productive if you ask me. Any ideas how to get that exception out ? Regards /Robert

1 0

Build errors trying to build Boost with mingw-w64
by Da-Huntha 22 Feb '14

22 Feb '14

Hey all, I've been trying to build all Boost libraries with mingw-w64 on Windows 8 but some fail. I'm trying to build a 32bit windows release build. The following errors are an excerpt of all the build errors: >d:\win-builds-32\i686-w64-mingw32\include\dvec.h: In function 'F64vec2 IntToF64vec2(const >F64vec2&, int)': >d:\win-builds-32\i686-w64-mingw32\include\dvec.h:840:80: error: '_mm_cvtsi32_sd' was not declared in this scope > inline F64vec2 IntToF64vec2(const F64vec2 &a,int b) { return _mm_cvtsi32_sd(a,b >); } > >^ >In file included from ./boost/system/system_error.hpp:14:0, > from ./boost/thread/exceptions.hpp:22, The build is invoked with: >set PATH=%MINGW_HOME%\bin;%WINDDK_HOME%\7600.16385.1\bin\x86 >bjam toolset=gcc variant=release threading=multi link=static address-model=32 Does anyone understand why these errors are given? Am I missing some configuration?

1 0

[mpl][type_traits] Transforming to common type
by Bjorn Reese 22 Feb '14

22 Feb '14

Given a type T, I am trying to transform a type list into another containing the common type between T and the individual types in the type list. When I compile the example below, I get the following error: /usr/local/include/boost/type_traits/common_type.hpp:111:42: error: incompatible operand types ('mpl_::arg<1>' and 'int') typedef decltype(declval<bool>() ? declval<T>() : declval<U>()) type; ^ ~~~~~~~~~~~~ ~~~~~~~~~~~~ It appears that the placeholder is not expanded to its actual type. If I use, say, decay<> instead of common_type<>, the example works just fine. Does anybody know how I can make it work? Example code: #include <boost/mpl/vector.hpp> #include <boost/mpl/transform.hpp> #include <boost/type_traits/common_type.hpp> int main() { typedef boost::mpl::vector<int, double> sequence_types; typedef boost::mpl::transform< sequence_types, // This is causing the problem boost::common_type<boost::mpl::_1, int>::type >::type transformed_types; return 0; }

2 2

[geometry] boost 1.55, VC++2013 update 1 Build fail
by 乔志强 22 Feb '14

22 Feb '14

I create a Visual Studio 2013 update 1 VC++ Win32 Console Application project, and copy the example from boost_1_55_0\libs\geometry\doc\html\geometry\spatial_indexes\rtree_examples\quick_start.html to a file(delete all codes first), set Precompiled Headers to Not Using Precompiled Headers, then build. But build failed. I change the platform toolset from Visual Studio 2013 (v120) to Visual Studio 2010 (v100), then build successfully. Is it a bug ? Visual Studio 2013 (v120) error message: 1>------ Rebuild All started: Project: ConsoleApplication1, Configuration: Debug Win32 ------ 1> ConsoleApplication1.cpp 1>c:\users\qiaozhiqiang\documents\visual studio 2013\projects\consoleapplication1\consoleapplication1\consoleapplication1.cpp(30): warning C4244: 'argument' : conversion from 'unsigned int' to 'const float', possible loss of data 1>d:\qzq\boost_1_55_0\boost\intrusive\detail\has_member_function_callable_with.hpp(200): error C2228: left of '.select_on_container_copy_construction' must have class/struct/union 1> type is 'boost::move_detail::add_rvalue_reference<U>::type' 1> d:\qzq\boost_1_55_0\boost\intrusive\detail\has_member_function_callable_with.hpp(276) : see reference to class template instantiation 'boost::container::container_detail::has_member_function_callable_with_select_on_container_copy_construction_impl<Fun,true,>' being compiled 1> with 1> [ 1> Fun=std::allocator<boost::geometry::index::detail::rtree::dynamic_leaf<std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>> 1> ] 1> d:\qzq\boost_1_55_0\boost\container\allocator_traits.hpp(262) : see reference to class template instantiation 'boost::container::container_detail::has_member_function_callable_with_select_on_container_copy_construction<const Alloc,>' being compiled 1> with 1> [ 1> Alloc=std::allocator<boost::geometry::index::detail::rtree::dynamic_leaf<std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>> 1> ] 1> d:\qzq\boost_1_55_0\boost\geometry\index\detail\rtree\node\node_d_mem_dynamic.hpp(257) : see reference to class template instantiation 'boost::container::allocator_traits<AllocNode>' being compiled 1> with 1> [ 1> AllocNode=std::allocator<boost::geometry::index::detail::rtree::dynamic_leaf<std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>> 1> ] 1> d:\qzq\boost_1_55_0\boost\geometry\index\detail\rtree\node\node_d_mem_dynamic.hpp(320) : see reference to function template instantiation 'BaseNodePtr boost::geometry::index::detail::rtree::create_dynamic_node<BaseNodePtr,boost::geometry::index::detail::rtree::dynamic_leaf<Value,Parameters,Box,Allocators,boost::geometry::index::detail::rtree::node_d_mem_static_tag>>::apply<std::allocator<_Other>>(AllocNode &)' being compiled 1> with 1> [ 1> BaseNodePtr=boost::geometry::index::detail::rtree::dynamic_node<std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>,boost::geometry::index::detail::rtree::node_d_mem_static_tag> * 1> , Value=std::pair<box,unsigned int> 1> , Parameters=boost::geometry::index::quadratic<16,4> 1> , Box=boost::geometry::model::box<point> 1> , Allocators=boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag> 1> , _Other=boost::geometry::index::detail::rtree::dynamic_leaf<std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>,boost::geometry::index::detail::rtree::node_d_mem_static_tag> 1> , AllocNode=std::allocator<boost::geometry::index::detail::rtree::dynamic_leaf<std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>> 1> ] 1> d:\qzq\boost_1_55_0\boost\geometry\index\detail\rtree\node\node_d_mem_dynamic.hpp(320) : see reference to function template instantiation 'BaseNodePtr boost::geometry::index::detail::rtree::create_dynamic_node<BaseNodePtr,boost::geometry::index::detail::rtree::dynamic_leaf<Value,Parameters,Box,Allocators,boost::geometry::index::detail::rtree::node_d_mem_static_tag>>::apply<std::allocator<_Other>>(AllocNode &)' being compiled 1> with 1> [ 1> BaseNodePtr=boost::geometry::index::detail::rtree::dynamic_node<std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>,boost::geometry::index::detail::rtree::node_d_mem_static_tag> * 1> , Value=std::pair<box,unsigned int> 1> , Parameters=boost::geometry::index::quadratic<16,4> 1> , Box=boost::geometry::model::box<point> 1> , Allocators=boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag> 1> , _Other=boost::geometry::index::detail::rtree::dynamic_leaf<std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>,boost::geometry::index::detail::rtree::node_d_mem_static_tag> 1> , AllocNode=std::allocator<boost::geometry::index::detail::rtree::dynamic_leaf<std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>> 1> ] 1> d:\qzq\boost_1_55_0\boost\geometry\index\detail\rtree\node\node_d_mem_dynamic.hpp(316) : while compiling class template member function 'boost::geometry::index::detail::rtree::dynamic_node<Value,Parameters,Box,Allocators,boost::geometry::index::detail::rtree::node_d_mem_static_tag> *boost::geometry::index::detail::rtree::create_node<Allocators,boost::geometry::index::detail::rtree::dynamic_leaf<Value,Parameters,Box,Allocators,boost::geometry::index::detail::rtree::node_d_mem_static_tag>>::apply(Allocators &)' 1> with 1> [ 1> Value=std::pair<box,unsigned int> 1> , Parameters=boost::geometry::index::quadratic<16,4> 1> , Box=boost::geometry::model::box<point> 1> , Allocators=boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag> 1> ] 1> d:\qzq\boost_1_55_0\boost\geometry\index\rtree.hpp(1267) : see reference to function template instantiation 'boost::geometry::index::detail::rtree::dynamic_node<Value,Parameters,Box,Allocators,boost::geometry::index::detail::rtree::node_d_mem_static_tag> *boost::geometry::index::detail::rtree::create_node<Allocators,boost::geometry::index::detail::rtree::dynamic_leaf<Value,Parameters,Box,Allocators,boost::geometry::index::detail::rtree::node_d_mem_static_tag>>::apply(Allocators &)' being compiled 1> with 1> [ 1> Value=std::pair<box,unsigned int> 1> , Parameters=boost::geometry::index::quadratic<16,4> 1> , Box=boost::geometry::model::box<point> 1> , Allocators=boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag> 1> ] 1> d:\qzq\boost_1_55_0\boost\geometry\index\rtree.hpp(1267) : see reference to class template instantiation 'boost::geometry::index::detail::rtree::create_node<boost::geometry::index::detail::rtree::allocators<std::allocator<Value>,Value,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag>,boost::geometry::index::detail::rtree::dynamic_leaf<Value,Parameters,Box,Allocators,boost::geometry::index::detail::rtree::node_d_mem_static_tag>>' being compiled 1> with 1> [ 1> Value=value 1> , Parameters=boost::geometry::index::quadratic<16,4> 1> , Box=boost::geometry::model::box<point> 1> , Allocators=boost::geometry::index::detail::rtree::allocators<std::allocator<value>,std::pair<box,unsigned int>,boost::geometry::index::quadratic<16,4>,boost::geometry::model::box<point>,boost::geometry::index::detail::rtree::node_d_mem_static_tag> 1> ] 1> d:\qzq\boost_1_55_0\boost\geometry\index\rtree.hpp(1264) : while compiling class template member function 'void boost::geometry::index::rtree<value,boost::geometry::index::quadratic<16,4>,boost::geometry::index::indexable<Value>,boost::geometry::index::equal_to<Value>,std::allocator<Value>>::raw_create(void)' 1> with 1> [ 1> Value=value 1> ] 1> d:\qzq\boost_1_55_0\boost\geometry\index\rtree.hpp(544) : see reference to function template instantiation 'void boost::geometry::index::rtree<value,boost::geometry::index::quadratic<16,4>,boost::geometry::index::indexable<Value>,boost::geometry::index::equal_to<Value>,std::allocator<Value>>::raw_create(void)' being compiled 1> with 1> [ 1> Value=value 1> ] 1> c:\users\qiaozhiqiang\documents\visual studio 2013\projects\consoleapplication1\consoleapplication1\consoleapplication1.cpp(24) : see reference to class template instantiation 'boost::geometry::index::rtree<value,boost::geometry::index::quadratic<16,4>,boost::geometry::index::indexable<Value>,boost::geometry::index::equal_to<Value>,std::allocator<Value>>' being compiled 1> with 1> [ 1> Value=value 1> ] ========== Rebuild All: 0 succeeded, 1 failed, 0 skipped ========== consoleapplication1.cpp, line 24 is: bgi::rtree< value, bgi::quadratic<16> > rtree;

2 2

[interprocess] Shared memory object
by Patrick Steele 21 Feb '14

21 Feb '14

Hi, can anyone tell me if there is a performance or other difference between boost::interprocess::shared_memory_object and boost::interprocess::windows_shared_memory? With the version of boost we were using back in 2011 ( boost 1.48 ), we found that windows_shared_memory operated faster than shared_memory_object when transporting around 10MB of data. Is this still the case? Thanks, Patrick

4 5

Gsoc
by Anulesh Tiwari 21 Feb '14

21 Feb '14

I've been looking at the various projects and the previous years project . I came across the boost.ublas project that was offered last year . This project seems very cool . Is the project going to be offered again ? The idea of adding additional protocols or modifying existing protocols sounds fun . There will be very likely a project proposal for the boost.ublas project, content will be very similar :) I would love to get a better feel about the entire boost project . Any pointers on how to do the same would be very helpful.

1 1

Build problems with 64-bit VC12 (MSVS2013)
by Craig Henderson 21 Feb '14

21 Feb '14

Hi all, I am having trouble building Boost 1.55 for x64 using VC12. 32-bit builds without error, but 64-bit fails. All of the errors are boost/archive/iterators/transform_width.hpp(151) : error C2039: 'min' : is not a member of 'std' and repeats a lot I added #include <algorithm> to the beginning of the transform_width.hpp header file, and the build now completes without error. However, my app has two linker errors linking with libboost_system-vc120-mt-1_55.lib features.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::system::error_code::error_code(void)" (??0error_code@system@boost@ @QEAA@XZ) features.obj : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::generic_category(void)" (?generic_category@system@boost@ @YAAEBVerror_category@12@XZ) referenced in function "void __cdecl boost::system::`dynamic initializer for 'errno_ecat''(void)" (??__Eerrno_ecat@system@boost@@YAXXZ) Again, the 32 bit builds and links Ok. I'm thinking that as the problematic file in Boost in is an 'archive' directory, perhaps the wrong include file is being picked up? But I can't find the difference in 32/64 configurations to find the cause. Is this a known problem? Any suggestions how to diagnose or (preferably!) fix this? Many thanks Craig

1 0

Where is BOOST_TEST - the universal testing tool
by Adi Shavit 21 Feb '14

21 Feb '14

Hi, I read here<http://boost.2283326.n4.nabble.com/test-BOOST-TEST-universal-testing-tool-t…>and here <http://lists.boost.org/Archives/boost/2013/09/206202.php>about BOOST_TEST - the universal testing tool. Where can I find it? Is it still not part of the library? Thanks, Adi

7 15

template trick
by gast128 20 Feb '14

20 Feb '14

I recently watched Stephen Lavavej's excellent channel9 video 'Core C++, 2 of n' in which he described a nice trick to stop template argument deduction: template <typename T> void (T t1, typename std::identity<T>::type t2) { } Browsing the internet for a similar problem, I recently discovered that Peter Dimov already described this trick in 2002 in 'Template function type inference with references' comp.lang.c++.moderated. Boost is more for the libraries, but could it also reserve some space for documenting these template tricks?

4 3

Should boost libs be rebuilt after applying patch?
by qplace 19 Feb '14

19 Feb '14

boost 1.55 I had to apply the patch defined in Ticket #9369 to the boost source file. I did it after libraries were built. Should I now rebuild the libraries again?

3 5

path of test-binary
by dib 19 Feb '14

19 Feb '14

Hi, how can I get the path where b2 placed the binaries of boost tests? Problem is the following: some of the tests need the path to a shared library, which is built together with the tests. in the lib/mylib/tests/Jamfile.v2 I have the following: [...] # our test lib for shared library tests lib test_library : test_library.cpp ; test-suite mylib : # # shared library # [ run shared_library_load_test.cpp ] [ run shared_library_get_symbol_test.cpp ] # # [...] Inside shared_library_*_test.cpp I need something like this: boost::filesystem::path tstlib("bin.v2/libs/mylib/test/mycompiler/test_library.so"); As boost.build decides by itself where to put the binary, i cannot hardcode the path in the source-files.. Is there a way to get the path from boost.build? If not, how could I solve this problem? -- regards dib

3 2

Unit Tests and function calling
by Charles Yates 19 Feb '14

19 Feb '14

Hi, Just wanted a second opinion on how best to handle calling functions which invoke BOOST_REQUIRE and BOOST_CHECK type logic. For example, if I have a test like: void stuff( ... ) { BOOST_REQUIRE( ... ); BOOST_CHECK( ... ); } BOOST_AUTO_TEST( check_stuff ) { stuff( case1 ); stuff( case2 ); stuff( case3 ); } in the CLF log case at least, I only see which lines in stuff failed, but not which which case. I can change things so that we have: bool stuff( ... ) { bool result = true; if ( ( result = require-predicate ) == true ) result = check-predicate; return result; } BOOST_AUTO_TEST( check_stuff ) { BOOST_CHECK( stuff( case1 ) ); BOOST_CHECK( stuff( case2 ) ); BOOST_CHECK( stuff( case3 ) ); } but then I lose the info in the logs over which predicates are failing and it's generally a bit nasty :). As a result, I've been playing with this which seems to encapsulate things pretty well for me (though may introduce more parenthesis than is strictly necessary and may introduce shadowed variables and other issues?): #define BOOL_CHECK( result, pred ) { bool pred_result; BOOST_CHECK( pred_result = ( pred ) ); result = pred_result && result; } #define BOOL_REQUIRE( pred ) { bool pred_result; BOOST_CHECK( pred_result = ( pred ) ); if ( !pred_result ) return pred_result; } #define BOOL_REQUIRE_EQUAL( name, value ) { bool pred_result; BOOST_CHECK( pred_result = ( ( name ) == ( value ) ) ); if ( !pred_result ) return pred_result; } void stuff( ... ) { bool result = true; BOOL_REQUIRE( ... ); BOOL_CHECK( result, ... ); return result; } BOOST_AUTO_TEST( check_stuff ) { BOOST_CHECK( stuff( case1 ) ); BOOST_CHECK( stuff( case2 ) ); BOOST_CHECK( stuff( case3 ) ); } when one of the predicates fails, I get 2 errors in the log - the first being the specific line in 'stuff' and the second being failing case. I've only tested it with g++ and don't know if it's a sensible approach - wondered if any of you guys had any suggestions? Cheers, Charlie

3 3

[BGL] isomorphism: how to define vertex invariant
by Pablo Madoery 19 Feb '14

19 Feb '14

Hi, I have two graphs and I want to know if they are isomorphic. I adjunct the graphs in .png. I read the documentation but i can't figure out how i must define the vertex invariant correctly. what I want is to consider that two graph are not isomorphic taking count of the vertices ids (the unsigned int value that they have). In the example i give I want the function isomorphism to return false. actually it return true. Thank you ! //////////////////////////////////////////////////////////////////////////////////////////// Graph graph1; Graph::vertex_descriptor aA = add_vertex(graph1); Graph::vertex_descriptor bA = add_vertex(graph1); Graph::vertex_descriptor cA = add_vertex(graph1); Graph::edge_descriptor edA1 = (add_edge(aA, bA, graph1)).first; Graph::edge_descriptor edA2 = (add_edge(bA, cA, graph1)).first; graph1[edA1].weight = 1; graph1[edA2].weight = 2; //////////////////////////////////////////////////////////////////////////////////////////// Graph graph2; Graph::vertex_descriptor aB = add_vertex(graph2); Graph::vertex_descriptor bB = add_vertex(graph2); Graph::vertex_descriptor cB = add_vertex(graph2); Graph::edge_descriptor edB1 = (add_edge(bB, aB, graph2)).first; Graph::edge_descriptor edB2 = (add_edge(aB, cB, graph2)).first; graph2[edB1].weight = 1; graph2[edB2].weight = 2; /////////////////////////////////////////////////////////////////////////////////////////// bool isIso = boost::isomorphism(graph1, graph2);

1 0

Meeting C++ 2014 - Call for Papers
by Jens Weller 19 Feb '14

19 Feb '14

Hello boost community, Meeting C++ 2014 has been announced today, it will be in Berlin on the 5th and 6th December! More details on the conference in the official announcement: http://meetingcpp.com/index.php/newsreader/items/announcing-meeting-c-2014-… With the announcement, also the call for paper is now again open till April 20th. This years theme track of the conference is "Scientific Programming with C++". I'm looking for a diverse set of talks about C++, talks about boost, Qt, STL, any libraries, testing, the C++ language (C++11/14/1y) or any other C++ related topic. More details on the call for papers: http://meetingcpp.com/index.php/newsreader/items/call-for-papers-meeting-c-… Kind regards, Jens Weller

1 0

Fatal runtime error when using Boost in a native static library referenced by a mixed dll
by Dario Ramos 19 Feb '14

19 Feb '14

I refactored a native C++ static library to use boost::thread and boost::asio instead of the Windows API. This static library is referenced by a C++/CLI dll built with the /clr switch; it acts as a wrapper for the managed upper layers to use. I use Boost inside native C++ dlls referenced by C++/CLI dlls and that works fine, but this particular scenario is a first. I suspect that Boost and C++/CLI don't play nice together, since I had to be careful to use the PIMPL idiom to avoid boost headers from being indirectly included in C++/CLI code. But now that I have to forcibly link a Boost lib with my C++/CLI dll, things have gone awry. Is this a supported usage for Boost? My environment: Boost 1.53.0, Visual Studio Professional 2012 Version 11.0.61030.00 Update 4, Windows 7 x64. The error is an EEFileLoadException in KernelBase.dll. It happens right after my C++/CLI dll is loaded into memory. Here's the callstack: > KernelBase.dll!_RaiseException@16() + 0x58 bytes msvcr110_clr0400.dll!__CxxThrowException@8() + 0x3e bytes clrjit.dll!Compiler::impResolveToken() + 0x3a bytes clrjit.dll!Compiler::impImportBlockCode() + 0x10d5 bytes clrjit.dll!Compiler::impImportBlock() + 0x55 bytes clrjit.dll!Compiler::impImport() + 0x167 bytes clrjit.dll!Compiler::compCompile() + 0x47 bytes clrjit.dll!Compiler::compCompileHelper() + 0x1f0 bytes clrjit.dll!Compiler::compCompile() + 0x104 bytes clrjit.dll!jitNativeCode() - 0x11eb bytes clrjit.dll!CILJit::compileMethod() + 0x25 bytes [External Code] mscoreei.dll!__CorExeMain@0() + 0x71 bytes mscoree.dll!_ShellShim__CorExeMain@0() + 0x227 bytes mscoree.dll!__CorExeMain_Exported@0() + 0x8 bytes ntdll.dll!___RtlUserThreadStart@8() + 0x27 bytes ntdll.dll!__RtlUserThreadStart@8() + 0x1b bytes -- *Darío Eduardo Ramos* Meditech S.A. www.meditech.com.ar (+54) 01147603300, Interno 31 Av. Julio A. Roca 3456 Florida Oeste, Bs.As. Argentina

1 0

[config] Macro to detect no implicitly movable?
by TONGARI J 19 Feb '14

19 Feb '14

Hi, Some compilers support r-value reference while not providing implicitly-defined move ctor/assign (e.g. VC10), is there a way to detect this defect? Macro like BOOST_NO_IMPLICITLY_MOVABLE would be helpful. Is "defined(BOOST_NO_CXX11_RVALUE_REFERENCES) || defined(BOOST_NO_CXX11_DELETED_FUNCTIONS)" good enough? Thanks,

1 0

finite state filters controlled ...
by raespi 19 Feb '14

19 Feb '14

Boost hi .. I'm using the finite state filter component in the iostreams library to create a state machine that can easily help me process incoming data streams from various medical sensors. I'm currently working around the following scenarios and wanted to run them by the list to see if the method I chose was the preferred one. 1- Constant datastream with no variation in datagrams. Solution: use finite state filters as they come, works ok ! 2- Variable datastreams with constant size in datagrams. Solution: use finite state filters with a transition table that can interpret anything and choosing in the processing function the right way to go, not very clean, but works !! 3- Variable datastreams with variable sizes. Solution: trying to change the finite state filter on the go, currently doesn't work. I noticed that when bytes are inserted into the state machine these don't get processed until a certain buffer size is met internally, resulting in a behaviour where data gets analyzed long after it has been inserted. I saw that the flush() function for the iostream that contains de state machine suffices when called before inserting a new character with a line such as: io::flush<io::filtering_ostream> ( this->data ); but the problem is that the only mechanism that can determine when a whole package has been received and one can change state machines to analyze a new state lies within the state machine itself (in the processing functions), I can't issue a flush() from within a state machine since it won't execute until a specific buffer size is met. Any ideas on how to go around this matter ?? I'm currently using boost 1.53 on Linux Thanks ...

2 2

[lexical_cast] Why isn't boost::lexical_cast bijective?
by Egor Tensin 19 Feb '14

19 Feb '14

Why this works: boost::lexical_cast<std::string>((void *) 42UL) and this throws: boost::lexical_cast<void*>(boost::lexical_cast<std::string>((void*) 42UL)) while converting void* to std::string and vice versa works perfectly using std:: streams?

4 4

Fedora upgrade - missing Boost multi-threaded libraries
by David Aldrich 18 Feb '14

18 Feb '14

Hi We have just upgraded a Fedora machine from Fedora 19 (boost 1.53) to Fedora 20 (boost 1.54). We notice that the Boost -mt libraries have disappeared. Please can anyone explain this and tell me how to install the -mt libraries? Best regards David

2 2

[log] Qt integration
by Olivier Tournaire 18 Feb '14

18 Feb '14

Hi all, I would like to use boost::log within a Qt based application. For now, I simply want to redirect the output of BOOST_LOG_TRIVIAL(xxx) macro to a QTextEdit. What is the easiest way to do that? Is there a way to get the logger output string? Best regards

2 5

[Units] Un-scaling dimensionless value
by Lindley French 18 Feb '14

18 Feb '14

I am using Boost.Units to try and compute the number of samples in a time interval, given the sample rate. Given this code: typedef make_scaled_unit<si::frequency, scale<10, static_rational<3> > >::type kilohertz_unit; typedef make_scaled_unit<si::time, scale<10, static_rational<-6> > >::type microseconds_unit; <code> template <typename T=unsigned> using Kilohertz = quantity<kilohertz_unit,T>; template <typename T=unsigned> using Microseconds = quantity<microseconds_unit,T>; // Using boost::rational as the value type neatly avoids overflows Kilohertz<rational<unsigned>> sample_rate(125*si::kilo*si::hertz); Microseconds<rational<unsigned>> duration(10*si::seconds); auto total = sample_rate*duration; </code> Now, when I cout these values, I see that everything is technically the correct. The problem is that total is a dimensionless quantity which is scaled----it's 1,250,000,000, when I expect 1,250,000, and it displays as "1250000000 m", where m is "milli", not "meters". What is the correct way to un-scale dimensionless quantities? I tried this: quantity<si::dimensionless,rational<unsigned>> unscaled(total); However, unscaled still has the same value. I also tried typedef make_scaled_unit<si::dimensionless, scale<10, static_rational<0> > >::type dimensionless_unit; quantity<dimensionless_unit,rational<unsigned>> unscaled(total); but this time, unscaled came out zero. Any suggestions?

3 13

[units] slowness dimension
by Michael Powell 18 Feb '14

18 Feb '14

Hello, I've learned about a "new" (or potentially new-to-boost-units, at any rate) dimension this week. TBD whether we'll be using boost or even units, but in the event we would, I'd like to add a slowness dimension. Basically it is the inverse of velocity: where velocity is time per length, slowness is length per time. Taking a gander at the velocity.hpp physical dimension, doesn't seem like a terribly hard thing to do, and with the new Git-module decomp, even less so today? Thank ye... Best regards, Michael Powell

2 3

[fusion][?] a dictionary with compile time (or types as) keys
by Nick Stokes 17 Feb '14

17 Feb '14

The problem is the following: class TypeDictionary { public: // implementation be here -- and the question is about this }; struct Foo; struct Bar; void userOfTypeDictionary() { TypeDictionary td; td.insert( Foo() ); td.insert( Bar() ); td,insert( double(3.14) ); // and other unknown (to TypeDictionary) // list of types attached // later on, in a different scope perhaps Foo& f = td.get<Foo>() ; Bar& f = td.get<Bar>(); double pi = tg.get<double>(); // ... } Now the question so far seems like right up in the alley of Boost.Fusion, perhaps with a boost::fusion::set, but I am unsure how to manipulate a set of types unknown ahead of time as in code above, and with a -- rather obvious -- extension whereby different instances of TypeDictionary would be used to contain a different set of types, potentially in different compilation units. As for a realistic motivating use case, think of a plugin manager. At any given time of its life an arbitrary heterogeneous set of objects are attached to it, and the it is the manager's job to manage the life time of the attached objects and return (a reference) to them when queried in a type-safe manner. Any ideas on whether such a thing is possible, and how, would be deeply appreciated. Thanks many, Nick

4 5

Boost or Standard when there is the choice?
by Paolo Bolzoni 17 Feb '14

17 Feb '14

Dear list, I was wondering, what is the best pratice when you can select between a standard solution or a boost one? For example, std::tie or boost::tie? std::unordered_map or boost::unordered_map? Personally I tend to use std solutions, but does it make sense? Yours sincerely, Paolo Bolzoni

9 19

[move] differences between results in C++03 and C++11 modes
by Adam Romanek 15 Feb '14

15 Feb '14

Hi! Some time ago I encountered a problem with assigning the return value of boost::move() to a non-const reference in C++11 mode, but not in C++03 mode. See [1] for a StackOverflow question that I created for this issue. It contains all the details so for brevity I won't repeat them here. Could anyone explain this issue? Is this a limitation of C++03 emulation or a defect in the implementation? Best regards, Adam Romanek [1] http://stackoverflow.com/questions/21138869/why-does-assigning-the-return-v…

5 5

[boost.format] another compilation error with VC 2013
by Olaf Krzikalla 14 Feb '14

14 Feb '14

Hi boost, I've encountered another VC 2013 problem. alt_sstream doesn't compile, since its base class std::basic_streambuf has an explicitely nonthrowing dtor. I actually had to fix it at two places: - virtual ~basic_altstringbuf() + virtual ~basic_altstringbuf() BOOST_NOEXCEPT_OR_NOTHROW and + virtual ~basic_oaltstringstream() BOOST_NOEXCEPT_OR_NOTHROW + { } Please, can anyone explain the second place: why doesn't the compiler-generated dtor inherit the nothrow clause? Is it due to the other base class (base_from_member< shared_ptr<...> >)? The weird thing is that MS even advocates the usage of boost.format with MSVC 2013: http://msdn.microsoft.com/en-us/library/hh438469.aspx So I am not 100% sure, whether the problem is boost/MSVC-related or my configuration is wrong. Google is surprisingly quiet regarding the issue. Best Olaf

1 0

Fwd: boost::unique_lock throw a exception
by shada 13 Feb '14

13 Feb '14

I use boost1.52 on windows2003sp2, boost::unique_lock throw a exception, please help me. stack is: *RaiseException_CxxThrowExceptionboost::throw_exception<boost::lock_error>[e:\library\boost_1_52\boost\throw_exception.hpp：67] boost::shared_mutex::timed_lock[e:\library\boost_1_52\boost\thread\win32\shared_mutex.hpp：430]boost::shared_mutex::lock[e:\library\boost_1_52\boost\thread\win32\shared_mutex.hpp：382]boost::unique_lock<boost::shared_mutex>::lock[e:\library\boost_1_52\boost\thread\locks.hpp：510]* ------------------------------------------------------------------------ *bool timed_lock(boost::system_time const& wait_until){ for(;;) { state_data old_state=state; for(;;) { state_data new_state=old_state; if(new_state.shared_count || new_state.exclusive) { ++new_state.exclusive_waiting; if(!new_state.exclusive_waiting) { boost::throw_exception(boost::lock_error()); } new_state.exclusive_waiting_blocked=true; } else { new_state.exclusive=true; }*

3 3

Minimum perfect matching
by Paolo Bolzoni 13 Feb '14

13 Feb '14

Dear list, I am using boost graph and I need to solve a variant of the classic TSP. Boost providess a function (metric_tsp_approx) to get a Halmintonian cycle over a full connected metric weighted graph. However I need something slightly different. I need a path that visits all vertices starting and ending to two well known vertices (let be s and d). Seeking around, I found the suggestion of adding a node connected to s d and with the weight of the edge (s,d). The TSP solution of the new graph is the solution, just removing the new node. The problem is that now the graph is not complete anymore so the metric_tsp_approx's approach does not work anymore. Another possiblity is using a variant of Christofides algorithm, but one of the passages of that is the minimum weight perfect matching. I am a little confused by the documentation of the functions about Maximum Cardinality Matching(1), it is possible to use them to find the a maximum cardinality matching so that the total weight of all selected edges is minimal? Otherwise, is there an alternate approach to my problem? Yours faithfully, Paolo (1) http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/maximum_matching.html

2 3

Re: [Boost-users] intrusive data structures with custom pointer class
by Matei David 12 Feb '14

12 Feb '14

On Fri, 07 Feb 2014 16:00:31 -0500 boost-users-request(a)lists.boost.org wrote: > Message: 6 > Date: Fri, 07 Feb 2014 22:00:23 +0100 > From: Ion Gazta?aga <igaztanaga(a)gmail.com> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] intrusive data structures with custom > pointer class > Message-ID: <52F54967.9020704(a)gmail.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > El 06/02/2014 23:52, Matei David escribi?: > > Hi, > > > > > > I would like to use some boost::intrusive data structures (lists and > > trees) in a project I'm working on, but I ran into trouble trying to > > customize the existing classes to my needs. I decided to post my > > problem here, in case somebody knowledgeable of boost::intrusive > > *implementation details* can assist me. Thank you in advance. > > Hi Meti, > > You have a lot of questions, I hope I can answer most of them. > > > Background: > > > > In the project I'm working on, I need to manage a large number of > > objects in memory. The data is dynamic, so I need to be able to > > alloc&dealloc objects, in addition to keeping the objects in various > > lists&trees (for which I'm trying to use boost::intrusive). The RAM > > usage is large (think, >100GB), but the number of objects is smaller > > than 2^32. So one thing I'd like to do is to replace 8-byte raw > > pointers with 4-byte offsets into a deque. Doing this would solve > > the alloc/dealloc part. However, I now need to customize > > boost::intrusive containers to work with these 4-byte offsets > > instead of raw pointers. > > I guess the deque is a global object, right. What do you mean with > "offset" into a deque? It's the offset passed to "deque::operator[]"? Hi and thanks for the reply. Contrary to some of the things you said, I found a way to (partly?) implement my specific use case with boost::intrusive. However, I have some concerns: - I only tested a small part of the boost::intrusive functionality with my customizations, so my success might be superficial. Could you have a look and make an informed guess as to how stable this is? - I am concerned that further boost updates might inadvertently break my customizations, and I would hate to list =1.55 as a specific dependency (as opposed to >=1.55). I understand this can never be fully avoided, but I'm hoping you could decide to support my use case, either officially by including it in the code base and the docs, or at least non-officially by being aware of it. I found and fixed this along the way: https://svn.boost.org/trac/boost/ticket/9650 Let me restate my specific use-case: I have several types A, B,..., and I want each object a1 of type A to be kept in a tree (say) along with other A objects (not all A objects go in the same tree). Since there are so many A objects, I care about their memory usage. Specifically, I want to replace 8-byte pointers (A*) by 4-byte handles (which I call Ptr<A>). An A-handle is really an uint32_t offset into the array of type A objects. A B-handle is also an offset, but into another array, holding B objects. Thus: - The transformation handle-to-object_address is O(1). - The transformation object_address-to-handle is prohibitive. - I can only use A-handles for A objects stored in a unique A-object array. If I construct an A object elsewhere, I can refer to it with a raw pointer, but not with an A-handle. - Objects of type B are stored in a different array than objects of type A. This means, in particular, that handles are not freely re-interpretable as real/smart pointers are with casts. So, dereferencing the A handle 42 gives me the A object number 42 from the A object array; but dereferencing the same handle reinterpreted as a B handle gives me the object number 42 from the B object array. NOTE: These pointer casts are my primary source of concern. I will come back to this below. My goal is to make boost::implicit structures work with these handles instead of raw/smart pointers. Intuition tells me there isn't a serious reason why they shouldn't, and that this type of scenario is general enough to be of interest to others, and therefore to boost maintainers. My (partial) success is here: https://github.com/mateidavid/sga/raw/matei-dev/src/Dev/factory.hpp https://github.com/mateidavid/sga/raw/matei-dev/src/Dev/test-i_list-orig.cpp https://github.com/mateidavid/sga/raw/matei-dev/src/Dev/test-i_tree-orig.cpp The code is a work in progress. You'll need a few more included files. I'm compiling with, e.g.: $ [g++|clang++] [-DNONSTATIC_VALUE_TRAITS] -I <path_to_1_55> -g -O0 -std=c++0x -pedantic -Wall -Wextra -o test-i_list-orig test-i_list-orig.cpp common.cpp globals.cpp For lists with nonstatic traits, you need the bug fix mentioned earlier. > > - Given a type T, I rolled out pointer-replacement class Ptr<T> > > which holds a 4-byte int, and upon operator*, it produces a Ref<T> > > object. > > - A reference-replacement Ref<T> class similarly holds a 4-byte int, > > it implements operator& which produces the associated Ptr<T> > > object, and it also provides an operator T& () conversion which > > dereferences the object from the deque. > > - With these, I tried a custom traits struct looking like this: > > value_type = node := T > > node_ptr = pointer := Ptr<T> > > reference := Ref<T> > > Boost.Intrusive models (or tries to model) a pointer type that can be > modeled with std::pointer_traits (more precisely > boost::intrusive::pointer_traits). In that model the reference type > must be a type that implements the dot operator. Sadly in C++ there > is no way to implement a class that overloads this operator. That's > why your pseudo-reference type will not work. I thought about this. There are 2 different perspectives. From the point of view of the boost::intrusive data structures (e.g., list), I think these structures should never ever dereference any object they store. So, e.g. inside list.hpp, if we have somewhere an object val of type "reference" (such as in insert()), the code should never use "o.<field> = 42". Instead, whatever fields the data structure needs to access (like r/w access to parent pointers), they should access them through the traits class methods (e.g. traits::set_field(o,42)). However, this already seems to be the case today. From the POV of the traits classes, indeed, these need to dereference values. First of all, there is a problem with the function signatures. In http://www.boost.org/doc/libs/1_55_0/doc/html/intrusive/value_traits.html the signature of to_node_ptr should be changed from: static node_ptr to_node_ptr (value_type &value) to: static node_ptr to_node_ptr (pointer_traits<pointer>::reference value) This just involves changing the docs; you can change the signature (as I did in my customization) and it compiles just fine. Also, even with the right signature, the function should never do: { return value.get_node_ptr(); } but instead: { return (&value)->get_node_ptr(); } because both reference::operator& and pointer::operator-> are overloadable. However, the concern about traits classes is not as serious as the one about the data structures because users are given the option to write their own traits classes anyhow. So overall, I think the problem with the dot operator isn't serious enough to make this use case unattainable. > > A. The traits classes seem to be there to support 2 existing > > customization types, namely the situation where "node" is a base > > class of "value" (implementing "base hooks") and the situation > > where "node" is a member of "value" (implementing "member hooks"). > > My situation represents a 3rd customization type. > > You can use function_hook, the hook does not need to be a member or > base class. The hack I used seems to work for now. In the future, I think it would be nice to have the option to explicitly specify the header node (so the container would just use a pointer) in the interest of clearly separating any type of node/value allocation from the containers. But I wouldn't say that's a priority. > > B. Even though the traits classes allow one to specify pointer > > types, it's possible (?) that under the hood the classes were > > designed to support only raw pointers and smart pointers, not the > > indirect offset-like pointers I need. > > See previous answer about supported reference types. > > > Given A&B, it seems to me that in my customization I would need 2 > > different hacks. In the interest of code stability, I started > > wondering whether it is feasible to adapt existing boost::intrusive > > data to my needs (my first instinct) as opposed to simply rolling > > out my own rbtree. > > I don't know the impact of supporting smart reference types. It might > be impossible, I haven't tried it. > > > 0. Obviously: Have you seen a similar situation being dealt with > > before? Maybe there's an existing solution out there. My reluctance > > to rolling out my own intrusive rbtrees is due to the fact I'd have > > to test them, as opposed to using a known implementation. > > > > 1. Are boost::intrusive data structures supposed to support custom > > pointer classes (neither real pointers nor smart pointers)? For > > instance, in 1.46 I found this code in > > boost/intrusive/detail/tree_algorithms.hpp > > Yes, boost::interprocess::offset_ptr (but a raw reference can be > converted to a smart pointer easily). > > > static node_ptr uncast(const_node_ptr ptr) > > { > > return node_ptr(const_cast<node*>( > > ::boost::intrusive::detail::boost_intrusive_get_pointer(ptr))); > > } > > However, intrusive lists worked just fine in 1.46, which suggests > > this was simply a bug. > > This was fixed in recent Boost releases using pointer_traits to > implement this function. You can customize pointer_traits to > implement your own version. > > > 2. Can you point me to an example of defining and using custom > > pointer class with boost::intrusive? To enable compilation (of > > lists only) in 1.46, I had to customize std::iterator_traits (that > > part I understood), but then also boost::pointer_to_other and > > boost::intrusive::detail::smart_ptr_type. Even though the code > > compiled, I don't know what those are doing exactly, so I'm weary of > > them. > > See the example in libs/intrusive/example/doc_offset_ptr.cpp and > boost/interprocess/offset_ptr.hpp. See the most recent boost version > for fixed bugs. A dumb smart pointer is used in boost intrusive > tests, and it's found in libs/intrusive/test/smart_ptr.hpp, but it's > a bit oudated. Anyway I think pointer requirements for > Boost.Intrusive might no be correctly specified and it might require > some fixes. Recent versions uses pointer_traits, and I recommend you > this approach. > > > 3. In 1.55, I have a few more pages of errors, I think mainly due to > > these pointer customization issues I don't fully understand. > > Something seems to have changed from 1.46 to 1.55. Is there a > > reference about what changed? Or is there a portable way of rolling > > out such a custom pointer class? > > pointer_traits was specified and all code was ported to use this > customization point. The reference type is assumed to be a raw > reference (as there is no way to overload operator dot to implement a > working smart reference). > > The only why to use Boost.Intrusive would be to implement a smart > pointer (of any pointee type) that can be fastly obtained from raw > reference. If this is your case, Boost.Intrusive might already have > all that you need. If you need a "smart reference", then > Boost.Intrusive is not prepared for this and I don't know how many > effort would require adding support for this (even if this approach > is feasible). > > The problem with "node" objects embedded in the container could be > solved with an option that allows external allocation of these nodes. > > Best, > > Ion Empirically, since I got the containers (at least partially) working with non-standard references, they must be already prepared to handle those. Theoretically, as I described above, the containers themselves should never have to dereference specific fields anyhow, and therefore should be immune to reference type changes. The more serious concern, ***and the reason I wrote all this***, is with pointer casts. Unlike raw or smart pointers, these handles are type-specific. So casting them to something else and then dereferencing that object should be done with care. Take bstree, for instance. Its base class (bstbase3) inherits from node & Value_Traits. The way you obtain access to the Value_Traits struct (used with stateful traits) is through a pointer which you later want to dereference: typedef typename pointer_traits<node_ptr>::template rebind_pointer<const real_value_traits>::type const_real_value_traits_ptr; const_real_value_traits_ptr real_value_traits_ptr() const { return pointer_traits<const_real_value_traits_ptr>::pointer_to( this->get_real_value_traits()); } With handles, the only way I see for this to work is to eventually transform handles into real pointers. So, Ptr<T>::rebind<U>::type should be U* except for U in {T, const T} and possibly {void, const void}. I initially tried to wrap voids as well, but I get errors. (Try adding -DWRAP_VOID when compiling test-i_list-orig.cpp) The problem are these casts: - In iiterator_members: const_void_pointer := pointer_traits<NodePtr>::rebind_pointer<const void> - In iiterator: void_pointer := pointer_traits<node_ptr>::rebind_pointer<void> - In list_iterator: const_real_value_traits_ptr := pointer_traits<void_pointer>::rebind_pointer<const real_value_traits> - iiterator_members ctor takes as 2nd argument a const_void_pointer - list_iterator ctor calls iiterator_members ctor, passing as 2nd arg a const_real_value_traits_ptr When I wrap voids: const_void_pointer := Ptr<const void> void_pointer := Ptr<const void> const_real_value_traits_ptr := value_traits* which means the container code is trying to cast: Ptr<T> -> value_traits* -> Ptr<const void> -> value_traits* -> deref, and the 2nd cast fails. However, things seemed to work ok if I don't wrap voids. So the main concern with my use case is that: ***intrusive containers should not cast node_ptr objects into other types of pointers (not even void*), and then attempt to cast them back***. They can cast other pointers (such as value_traits*) to void* and back, but not node_ptr-s. Please have this use case in mind when further developing boost::intrusive. The files I linked above can serve as a basic test case. I can help writing up this use case in slightly more detail if you think that would be useful for others. Thanks, Matei

2 1

[boost.tr1] compilation errors with VC 2013
by Olaf Krzikalla 12 Feb '14

12 Feb '14

Hi, I have encountered plenty of compilation errors with VC 2013 caused by including <boost/tr1/memory.hpp> or <boost/tr1/functional.hpp>. The errors happen with all versions tried (1.40, 1.53 and 1.55). Is boost.tr1 deprecated for newer compilers? Best Olaf

3 3

Compilation problem with has_binary_operator.hpp on Mac OSX
by Tim Burgess 12 Feb '14

12 Feb '14

Hi, I'm building a framework project using Xcode 4.6 configured to use the Apple GCC 4.2 compiler (my project also uses wxWidgets, so this compiler is required). Using Boost 1.55.0 I get: cd /Users/tim/Developer/RBSpeech setenv LANG en_US.US-ASCII /Applications/Xcode.app/Contents/Developer/usr/bin/llvm-gcc-4.2 -x objective-c++ -arch x86_64 -fmessage-length=0 -pipe -Wno-trigraphs -fpascal-strings -O0 -Wreturn-type -Wunused-variable -Wuninitialized -Wshorten-64-to-32 -DDEBUG=1 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Develop er/SDKs/MacOSX10.8.sdk -fasm-blocks -mmacosx-version-min=10.6 -gdwarf-2 -fvisibility-inlines-hidden -iquote /Users/tim/Library/Developer/Xcode/DerivedData/RBSpeech-gglcnsigefizlfbidkwh bsxvlwng/Build/Intermediates/RBSpeech.build/Debug/RBSpeech.build/RBSpeech-ge nerated-files.hmap -I/Users/tim/Library/Developer/Xcode/DerivedData/RBSpeech-gglcnsigefizlfbidk whbsxvlwng/Build/Intermediates/RBSpeech.build/Debug/RBSpeech.build/RBSpeech- own-target-headers.hmap -I/Users/tim/Library/Developer/Xcode/DerivedData/RBSpeech-gglcnsigefizlfbidk whbsxvlwng/Build/Intermediates/RBSpeech.build/Debug/RBSpeech.build/RBSpeech- all-target-headers.hmap -iquote /Users/tim/Library/Developer/Xcode/DerivedData/RBSpeech-gglcnsigefizlfbidkwh bsxvlwng/Build/Intermediates/RBSpeech.build/Debug/RBSpeech.build/RBSpeech-pr oject-headers.hmap -I/Users/tim/Library/Developer/Xcode/DerivedData/RBSpeech-gglcnsigefizlfbidk whbsxvlwng/Build/Products/Debug/include -I/users/tim/developer/libraries/wxwidgets/include -I/users/tim/developer/libraries/cryptopp -I/users/tim/developer/libraries/boost_1_55_0 -I/users/tim/developer/sources/surfacereader -I/Users/tim/Library/Developer/Xcode/DerivedData/RBSpeech-gglcnsigefizlfbidk whbsxvlwng/Build/Intermediates/RBSpeech.build/Debug/RBSpeech.build/DerivedSo urces/x86_64 -I/Users/tim/Library/Developer/Xcode/DerivedData/RBSpeech-gglcnsigefizlfbidk whbsxvlwng/Build/Intermediates/RBSpeech.build/Debug/RBSpeech.build/DerivedSo urces -F/Users/tim/Library/Developer/Xcode/DerivedData/RBSpeech-gglcnsigefizlfbidk whbsxvlwng/Build/Products/Debug -I/Users/tim/developer/libraries/wxwidgets/build-debug/lib/wx/include/osx_co coa-unicode-static-2.9 -I/Users/tim/developer/libraries/wxwidgets/include -D_FILE_OFFSET_BITS=64 -D__WXMAC__ -D__WXOSX__ -D__WXOSX_COCOA__ -include /Users/tim/Library/Developer/Xcode/DerivedData/RBSpeech-gglcnsigefizlfbidkwh bsxvlwng/Build/Intermediates/PrecompiledHeaders/RBSpeech-Prefix-filshqejewqv wmcnuphmjzrmapcf/RBSpeech-Prefix.pch -c /Users/tim/Developer/RBSpeech/../Sources/SurfaceReader/RBSpeech.mm -o /Users/tim/Library/Developer/Xcode/DerivedData/RBSpeech-gglcnsigefizlfbidkwh bsxvlwng/Build/Intermediates/RBSpeech.build/Debug/RBSpeech.build/Objects-nor mal/x86_64/RBSpeech.o cc1objplus: warning: -Wuninitialized is not supported without -O In file included from /users/tim/developer/libraries/boost_1_55_0/boost/type_traits/has_left_shift .hpp:43, from /users/tim/developer/libraries/boost_1_55_0/boost/lexical_cast.hpp:165, from /Users/tim/Developer/RBSpeech/../Sources/SurfaceReader/RBStringFuncs.hpp:11, from /Users/tim/Developer/RBSpeech/../Sources/SurfaceReader/RBSpeech.h:27, from /Users/tim/Developer/RBSpeech/../Sources/SurfaceReader/RBSpeech.mm:4: /users/tim/developer/libraries/boost_1_55_0/boost/type_traits/detail/has_bin ary_operator.hpp:155: error: expected unqualified-id before 'do' The project uses OSX10.8 as its base SDK, but has OSX10.6 as its deployment target to provide backward compatibility and I made sure that my Boost libraries specified the 10.6 SDK as a minimum. Can anybody advise, please? Best wishes. Tim Burgess

7 11

[property_tree] Compilation Problem when #including <boost/property_tree/json_parser.hpp>
by Adi Shavit 12 Feb '14

12 Feb '14

Hi, On VS2010, the following code does not compile if I restore the commented out #include: *// #include <boost/property_tree/json_parser.hpp>* struct X { enum Labels { ERROR, ONE, TWO, THREE }; // problem => ^^^^^ }; void f() { X::Labels r = X::ERROR; // problem => ^^^^^ } The VS2010 errors are: t.cpp(5): error C2059: syntax error : 'constant' t.cpp(5): error C2143: syntax error : missing ';' before '}' t.cpp(5): error C2238: unexpected token(s) preceding ';' t.cpp(7): error C2059: syntax error : '}' t.cpp(7): error C2143: syntax error : missing ';' before '}' t.cpp(7): error C2059: syntax error : '}' t.cpp(11): error C2589: 'constant' : illegal token on right side of '::' t.cpp(11): error C2059: syntax error : '::' It seems that somewhere inside the #include hierarchy the symbol ERROR is #defined to cause this code to fail. Renaming ERROR to something else avoids this problem. I think I tracked it into ' boost/spirit/home/classic/iterator/impl/file_iterator.ipp' but I'm not sure where exactly it is coming from. Adi

3 4

compilation error while using intel c++ XE 14.0
by Bo Chen 12 Feb '14

12 Feb '14

Hi, While I compile the code(see attached) based on the boost 1.54/1.55 using intel compiler c++ XE 14.0, I got following error. Could you help please? Thanks. Chen Bo 1>------ Build started: Project: intelTest, Configuration: Debug Win32 ------ 1>Build started 07/02/2014 18:09:33. 1>ClCompile: 1> ***** ClCompile (Win32 - Intel C++) 1> intelTest.cpp 1> Warning #672: the command line options do not match those used when precompiled header file "Debug\intelTest.pchi" was created 1> 1>c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\include\xutility(2215): error : no instance of overloaded function "std::_Copy_impl" matches the argument list 1> argument types are: (boost::detail::multi_array::array_iterator<int, const int *, boost::mpl::size_t<3U>, boost::detail::multi_array::const_sub_array<int, 2U, const int *>, boost::random_access_traversal_tag>, boost::detail::multi_array::array_iterator<int, const int *, boost::mpl::size_t<3U>, boost::detail::multi_array::const_sub_array<int, 2U, const int *>, boost::random_access_traversal_tag>, boost::detail::multi_array::array_iterator<int, int *, boost::mpl::size_t<3U>, 1> boost::detail::multi_array::sub_array<int, 2U>, boost::random_access_traversal_tag>, boost::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::random_access_traversal_tag>, boost::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::random_access_traversal_tag>) 1> return (_Copy_impl(_First, _Last, 1> ^ 1> detected during: 1> instantiation of "_OutIt std::_Copy_impl(_InIt, _InIt, _OutIt, std::tr1::false_type) [with _InIt=boost::detail::multi_array::array_iterator<int, const int *, boost::mpl::size_t<3U>, boost::detail::multi_array::const_sub_array<int, 2U, const int *>, boost::random_access_traversal_tag>, _OutIt=boost::detail::multi_array::array_iterator<int, int *, boost::mpl::size_t<3U>, boost::detail::multi_array::sub_array<int, 2U>, boost::random_access_traversal_tag>]" at line 2227 1> instantiation of "_OutIt std::copy(_InIt, _InIt, _OutIt) [with _InIt=boost::detail::multi_array::array_iterator<int, const int *, boost::mpl::size_t<3U>, boost::detail::multi_array::const_sub_array<int, 2U, const int *>, boost::random_access_traversal_tag>, _OutIt=boost::detail::multi_array::array_iterator<int, int *, boost::mpl::size_t<3U>, boost::detail::multi_array::sub_array<int, 2U>, boost::random_access_traversal_tag>]" at line 322 of 1> "C:\Users\chbeb9\Downloads\boost_1_55_0\boost/multi_array/view.hpp" 1> instantiation of "boost::detail::multi_array::multi_array_view<T, NumDims> &boost::detail::multi_array::multi_array_view<T, NumDims>::operator=(const boost::detail::multi_array::multi_array_view<T, NumDims> &) [with T=int, NumDims=3U]" at line 447 of "C:\Users\chbeb9\Downloads\boost_1_55_0\boost/multi_array.hpp" 1> instantiation of "boost::multi_array<T, NumDims, Allocator> &boost::multi_array<T, NumDims, Allocator>::resize(const boost::detail::multi_array::extent_gen<NumDims> &) [with T=int, NumDims=3U, Allocator=std::allocator<int>]" at line 32 of "intelTest.cpp" 1> 1> compilation aborted for intelTest.cpp (code 2)

1 0

Boost::preprocess __VAR_ARGS__ compile fail
by garthh 12 Feb '14

12 Feb '14

This simple piece of code doesn't compile for me in boost 1.54 on MacOSX: #include <boost/preprocessor.hpp> #define debugprintf(...) \ printf(BOOST_PP_SEQ_ELEM(0, BOOST_PP_VARIADIC_TO_SEQ(__VA_ARGS__))) main () { debugprintf("test"); } I've spent ages on it without success. Any suggestions would be greatly appreciated! Compile output: error: too few arguments provided to function-like macro invocation debugprintf("boost test"); ^ main.cpp:15:17: note: expanded from macro 'debugprintf' fprintf(stderr, BOOST_PP_SEQ_ELEM(0, BOOST_PP_VARIADIC_TO_SEQ(__VA_ARGS__))); \ ^ /usr/local/Boost/1.54/include/boost/preprocessor/seq/elem.hpp:22:39: note: expanded from macro 'BOOST_PP_SEQ_ELEM' # define BOOST_PP_SEQ_ELEM(i, seq) BOOST_PP_SEQ_ELEM_I(i, seq) ^ /usr/local/Boost/1.54/include/boost/preprocessor/seq/elem.hpp:41:45: note: expanded from macro 'BOOST_PP_SEQ_ELEM_I' # define BOOST_PP_SEQ_ELEM_I(i, seq) BOOST_PP_SEQ_ELEM_II(BOOST_PP_SEQ_ELEM_ ## i seq) ^ /usr/local/Boost/1.54/include/boost/preprocessor/seq/elem.hpp:43:62: note: expanded from macro 'BOOST_PP_SEQ_ELEM_II' # define BOOST_PP_SEQ_ELEM_II(im) BOOST_PP_SEQ_ELEM_III(im) ^ main.cpp:21:2: error: use of undeclared identifier 'BOOST_PP_SEQ_ELEM_III' debugprintf("boost test"); -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-preprocess-VAR-ARGS-compile-fail-t… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

unable to use find() function in boost::associative property maps.
by Aniket Pugaonkar 12 Feb '14

12 Feb '14

Hi, The current boost::associative_property_map interface in boost::property_map does not provide a *find()* function interface from where we can find a key type from associative map. Although the associative property map concept was mainly developed for using boost::get and boost::put function efficiently on unique associative containers (such as std::map), it still does not have any interface for using find() function for searching whether an element exists in a map, My problem is explained below: I have a map, and I define a associative property map on it. as follows: std::map< int, int > *mymap*; boost::associative_property_map< std::map< int, int > > *my_asso_map* ( mymap ); I have a template function, named " exists_in " which checks whether a particular key_value, is present in the map or not. The function is as follows: *template* <typename map_t, typename key_t> bool *exists_in*(map_t map, key_t key) { return map.*find*(key) != map.end(); } ======================================== If I call this template function on mymap, it gives me no error: if( !exists_in ( mymap, key ) ----> no error Now, if I call template function on my_asso_map, it throws an error : if( !exists_in( my_asso_map, key ) ---->> error error: âclass boost::associative_property_map<std::map<int, int > >â has no member named âendâ error: âclass boost::associative_property_map<std::map<int, int > >â has no member named âfindâ I understand, my_asso_map just stores the address of mymap and provides get and put efficiently. But there are instances, where I have to *search* a key in my map. ( for example, if else loop as provided above ). I want to hide *mymap *and just expose *my_asso_map* to the user and everywhere I want to pass my_asso_map.. I am able to do this except for the *find*() function, because of which I had to keep passing my original *mymap *to the function/ functor and then use exists_in template function. Is there any way to implement a find() utility for associative property maps ? If find() interface can be added in library, that would be simply great ! Thanks, -- Thanks and regards, Aniket Pugaonkar

1 0