June 2014 - Boost-users - lists.boost.org

[interprocess] Determine size of managed_shared_memory
by Kai Benndorf 12 Oct '19

12 Oct '19

Hi all, I want to create a managed_shared_memory in exactly the size I needed. Therefore I do something like this: size = sizeof( common_managed_shared_memory ); size += sizeof( MyClassInSharedMem ); managed_shared_memory segment(create_only, "name", size ); MyClassInSharedMem allocates itself some memory by segment->allocate(). I added this also to the size, but get a boost::interprocess::bad_alloc exception on allocating this additional memory. Are there some magic bytes I forgot to add? Many thanks in advance Kai

3 2

[Range, Phoenix] What am I missing...
by Robert Jones 25 Apr '17

25 Apr '17

Hi Folks Can anyone explain the output of this program... #include <iostream> #include <boost/range/algorithm/copy.hpp> #include <boost/range/counting_range.hpp> #include <boost/range/adaptor/reversed.hpp> #include <boost/range/adaptor/transformed.hpp> #include <boost/phoenix/bind/bind_function.hpp> #include <boost/phoenix/core/argument.hpp> int f( int i ) { return i * 2; } int main( ) { using boost::adaptors::reversed; using boost::adaptors::transformed; using boost::counting_range; using boost::copy; using boost::phoenix::arg_names::_1; copy( counting_range( 1, 5 ) | reversed | transformed( f ), std::ostream_iterator<int>( std::cout, " " ) ); std::cout << std::endl; copy( counting_range( 1, 5 ) | reversed | transformed( bind( f, _1 ) ), std::ostream_iterator<int>( std::cout, " " ) ); std::cout << std::endl; } Which is... 8 6 4 2 1768406272 1768406272 1768406272 1768406272 I'm using Gcc 4.6.2 & Boost 1.53 Thx All.

3 4

[statechart] Passing parameters from event to State Local Storage
by Christophe Bourez 16 Nov '16

16 Nov '16

I need to maintain a parameter into the state local storage. This parameter is initially contained in the event that causes the transition to the target state. I give hereafter a small illustrative example. typename sc = boost::statechart; class EvTest : public sc::event<EvTest> { public: EvTest(std::size_t val) : value(val) {} std::size_t getValue() const { return this->value; } private: std::size_t value; }; class MyStateMachine; class StSource; class StTarget; class StSource : public sc::simple_state<StSource, MyStateMachine> { public: typedef sc::custom_reaction<EvTest> reactions; sc::result react(const EvTest &event) { // How to pass event.getValue() to the target state ? transit<StTarget>(); } }; class StTarget : public sc::simple_state<StTarget, MyStateMachine> { public: StTarget(std::size_t val) : val(value) {} private: std::size_t value; }; Thanks, Christophe

5 6

Re: [Boost-users] lexical_cast between double and string slow in Visual Studio 2013
by David Roberts 07 May '15

07 May '15

> That issue is unknown. I'd really appreciate the investigation. I have done some more investigation, and there are two factors that only cause the slowness when they both occur together. > Try excluding the lexical_cast from test, I have a feeling that this is only MSVC related issue: > > #include <sstream> > #include <string> > > int main (int, char **) > { > for (double count = 0.0; count < 1000000.0; count += 1.41) > { > std::stringstream ss; > ss << count; > std::string result = std::move(ss.str()); > ss.str(std::string()); > > ss << result; > ss >> count; > } > > return 0; > } > Running your test program does not exhibit the problem. It runs in around 3 seconds on my machine when built with either Visual Studio 2010 or Visual Studio 2013. However, changing it very slightly to match more closely what lexical_cast does internally does recreate the problem: #include <sstream> #include <string> int main (int, char **) { for (double count = 0.0; count < 1000000.0; count += 1.41) { std::stringstream ss; ss.unsetf(std::ios::skipws); ss.precision(17); ss << count; std::string result = std::move(ss.str()); ss.str(std::string()); ss << result; ss >> count; } return 0; } The effect of setting the precision to 17 is that lots of 9s appear in the string representations. (The number 17 is what boost::detail::lcast_get_precision(double*) chooses.) Without the precision call the contents of the string called result start off like this: 0 1.41 2.82 4.23 5.64 7.05 8.46 9.87 11.28 12.69 With precision set to 17 they start off like this: 0 1.4099999999999999 2.8199999999999998 4.2299999999999995 5.6399999999999997 7.0499999999999998 8.4599999999999991 9.8699999999999992 11.279999999999999 12.69 This happens for both Visual Studio 2010 and Visual Studio 2013. Then the next difference is that Visual Studio 2013 spends a lot longer handling all the extra 9s. Changing the program so that the double is converted to a string using std::stringstream without a precision call and then back to double using lexical_cast takes about 3 seconds for both Visual Studio 2010 and Visual Studio 2013. It is the combination of having all the extra 9s to parse and using Visual Studio 2013 that makes the test using lexical_cast to go both ways slow. Both Visual Studio 2010 and Visual Studio 2013 do the conversion by calling std::num_get<char,std::istreambuf_iterator<char,std::char_traits<char> > >::do_get() which then calls a function called _Stodx() which is implemented in xstod.c. This function is very different for the two versions. In Visual Studio 2010 it's a relatively thin wrapper around the C function strtod(). In Visual Studio 2013 _Stodx() has got a completely new implementation that's generated by #including xxstod.h with some macros defined. The original C function strtod() is much faster than the new _Stodx() when there are lots of 9s at the end of the strings being parsed. This modification to the program: #include <sstream> #include <string> #include <stdlib.h> int main (int, char **) { for (double count = 0.0; count < 1000000.0; count += 1.41) { std::stringstream ss; ss.unsetf(std::ios::skipws); ss.precision(17); ss << count; std::string result = std::move(ss.str()); ss.str(std::string()); ss << result; char *endptr; count = strtod(ss.str().c_str(), &endptr); } return 0; } has a runtime of about 3 seconds even though it's got to cope with all the 9s. I guess only someone from Microsoft or Dinkumware could comment on why _Stodx() was reimplemented. But the other thing is that by setting precision to 17 lexical_cast is bloating the string representations of the doubles with lots of 9s in both Visual Studio 2010 and Visual Studio 2013. Setting precision to 15 instead prevents this, and makes the original test run faster even with Visual Studio 2013 (about 4 seconds rather than 10). Regards, David

5 4

Statechart serialization
by mbrodeur65 04 Mar '15

04 Mar '15

Hi, I'm looking for a solution to serialize boost::statechart objects. I'm aware that this feature is on the statechart library todo list but was wondering if there are any workaround to achieve this with the latest boost release (1.34) ? thanks for your help ! mbrodeur65 -- View this message in context: http://www.nabble.com/Statechart-serialization-tf4131326.html#a11749139 Sent from the Boost - Users mailing list archive at Nabble.com.

4 4

NT² 3.0 and Boost.SIMD - Stable release
by Joel Falcou 21 Nov '14

21 Nov '14

The first stable release of the 3.x series of MetaScale’s open-source software is available: NT² 3.0. It also includes its spin-off project, Boost.SIMD (not yet a Boost library). Many Issues have been closed since last beta. The main focus of this release cycle was to fix performances issues and to stabilize some parts of the API. Next step will be to separate NT2 and Boost.SIMD into separate repositories, thus making one more step toward Boost.SIMD submission into review. [ http://www.metascale.org/nt%C2%B2-3-0-and-boost-simd ] *Changes & Bug Fixes:* - Major performance improvements in both libraries - Added experimental support for the HPX runtime for parallelization on shared memory systems - Optimizations of many elemental functions, in particuler log/ex, frexp/ldexp and cbrt - More advanced shuffle pattern recognition for SIMD - Fixed issues with Visual Studio 2013 - More functions are force-inlined to ensure good performance - New functions for conversion between types and mixing of vectors of different sizes - Demo applications usable as benchmarks - Better handling of errors when an unsupported function is called - New API for custom memory allocators Full changelog is available at https://github.com/MetaScale/nt2/releases/tag/3.0.0. *How to get it ?* - Source and binary packages can be downloaded here: http://nt2.metascale.org/downloads - The release is also available on Github : https://github.com/MetaScale/nt2/releases - The main master branch is still under development : https://github.com/MetaScale/nt2

4 4

[Thread] Read-write locks
by lfrfly＠icqmail.com 17 Sep '14

17 Sep '14

I'm trying to create a standard read/write lock using Boost Threads, and I'm having a bit of difficulty mapping the Boost concepts onto the usual ones. A read/write lock should have several states: Locked for reading (multiple threads may lock at once), locked for writing (only one thread may lock, and no threads may be locked for reading at the same time), and unlocked. Ideally it would be nice if an RWL which is locked for reading may temporarily upgrade to locked for writing, then return to the locked for reading state. Boost supports several relevant notions of locking: shared locking, upgrade locking, and exclusive locking. This to me is a confusing distinction. In particular, a shared_mutex seems appropriate as the basis for a RWL, but is lock_upgrade() the equivalent of a write lock and lock_shared the equivalent of a read lock? This is unclear. If "upgrade locking" is not the same as "exclusive locking", then is an upgrade lock actually exclusive? Could someone please clarify this.

4 3

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

22 Jul '14

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

3 3

[Log] Extract severity value
by Olivier Tournaire 17 Jul '14

17 Jul '14

Hi all, I am trying to extract severity level from a log record, but i seems that I am doing it the wrong way. Here is the code I use: void LogDockWidget::receiveLog(boost::log::record_view const& rec, const std::string& log) { logging::value_ref< logging::trivial::severity_level > level = logging::extract< logging::trivial::severity_level >("Severity", rec); // ... } Here level.get() always returns "info". All my logs are done with the BOOST_LOG_TRIVIAL(...) macro. The formatter whereas displays correctly the severity level. Here is how it is defined: void LogDockWidget::init_logging() { boost::shared_ptr< logging::core > core = logging::core::get(); typedef sinks::synchronous_sink< QTextEditFormattedSinkBackend > sink_t; boost::shared_ptr< sink_t > sink(new sink_t); // ... logging::add_file_log( keywords::file_name = logFilename, keywords::auto_flush = true, keywords::format = ( BUILD_LOG_FORMATTER() ) ); sink->set_formatter( BUILD_LOG_FORMATTER() ); core->add_sink(sink); // Add attributes that we will use logging::add_common_attributes(); core->add_global_attribute( "ThreadID", attrs::current_thread_id()); } #define BUILD_LOG_FORMATTER() \ expr::stream \ << "[" << expr::format_date_time< boost::posix_time::ptime >("TimeStamp", "%Y-%m-%d %H:%M:%S") << "] " \ << expr::attr<unsigned int>("LineID") << " " \ << ": <" << logging::trivial::severity << "> " \ << " [" << expr::attr<attrs::current_thread_id::value_type>("ThreadID") << "] " \ << expr::if_(expr::has_attr(scope_attribute)) \ [ \ expr::stream << "[" << scope_attribute << "] " \ ] \ << expr::message Could you please let me know what I am doing wrong? Regards, Olivier

2 2

[spirit] qi xml parser
by Michael Powell 07 Jul '14

07 Jul '14

Hello, I am building out a general use xml parser including attributes, arbitrary number of elements, and so on. So far so good, makes sense parsing names and so forth. However, how do you handle element content? Which could either be a string, or zero or more other elements (basically of the same rule as the enclosing element rule). It would seem you need a terminus, the empty element tag. In such a way that populates the parent (initial) element, and its children (of the same element kind). I'll be adapting structs to capture the results. I am also using a couple of helpful references, for instance: http://www.w3.org/TR/xml11/ http://stackoverflow.com/questions/9473843/boost-spirit-how-to-extend-xml-p… Also not sure quite how to capture the adapted parts at strategic rule opportunities. My domain model will look something like this, keeping it simple as possible: struct xattribute { std::string name; std::string value; }; typedef std::vector<xattribute> xattribute_vector; struct xelement; typedef std::vector<xelement> xelement_vector; struct xelement { std::string name; std::string content; xattribute_vector attributes; xelement_vector children; }; Thanks... Best regards, Michael Powell

2 6

[Graph] Newbie on A*
by Sensei 04 Jul '14

04 Jul '14

Dear all, I am fiddling with the A* example on cities in order to learn how to use the A* search. Obviously, I cannot make it work :) The main goal is this, but I'm way too far from this: make A* fail when the path is longer, **not costlier**, than a constant. But right now I'd just like to have A* working on a graph. :) In order to see the different results, I've paired it with a Dijkstra search, and my A* heuristics is quite simple: constant. Dijkstra works fine, but A* stops at the first node, and the target isn't reached (but a path is available). What am I doing wrong? Forgive me if I'm making a stupid mistake bu I'm completely a newbie! If you need the graph, here's the link: https://dl.dropboxusercontent.com/u/15635416/g.txt Thanks! #include <cstdio> #include <cstdlib> #include <iostream> #include <utility> #include <algorithm> #include <numeric> #include <deque> #include <unordered_set> #include <vector> #include <fstream> #include <list> #include <boost/graph/graph_traits.hpp> #include <boost/graph/compressed_sparse_row_graph.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/breadth_first_search.hpp> #include <boost/graph/depth_first_search.hpp> #include <boost/pending/indirect_cmp.hpp> #include <boost/range/irange.hpp> #include <boost/property_map/property_map.hpp> #include <boost/graph/astar_search.hpp> // Properties: weights are int typedef boost::property<boost::edge_weight_t, int> edge_weight; // The graph itself as a compressed sparse row matrix typedef boost::compressed_sparse_row_graph<boost::bidirectionalS, boost::no_property, edge_weight> boost_graph; // Vertex iterator typedef boost::graph_traits<boost_graph>::vertex_iterator vertex_iterator; // Edge iterator typedef boost::graph_traits<boost_graph>::edge_iterator edge_iterator; // Adjacent nodes iterator typedef boost::graph_traits<boost_graph>::adjacency_iterator adjacency_iterator; typedef boost::graph_traits<boost_graph>::out_edge_iterator outward_iterator; typedef boost::graph_traits<boost_graph>::in_edge_iterator inward_iterator; // Property maps typedef boost::property_map<boost_graph, boost::vertex_index_t>::type index_map; //typedef boost::property_map<boost_graph, boost::vertex_name_t> name_map; // Property iterators typedef boost::iterator_property_map<std::size_t*, index_map, std::size_t, std::size_t&> predecessor_map; typedef boost::iterator_property_map<std::size_t*, index_map, std::size_t, std::size_t&> distance_map; bool isValid(std::size_t index) { return (index >= 0) && (index <= 12); } // **************************************************************************** // A* heuristics template <class graph_type> class astar_heuristic : public boost::astar_heuristic<graph_type, std::size_t> { public: typedef typename boost::graph_traits<graph_type>::vertex_descriptor vertex_type; astar_heuristic(vertex_type goal) : goal_(goal) { }; std::size_t operator()(vertex_type u) { return 3; } private: vertex_type goal_; }; // Class to be used to terminate the A* algorithm class exit_astar { public: exit_astar(bool found) { }; }; // A* visitor that terminates when we find the goal template <class vertex_type> class astar_visitor : public boost::default_astar_visitor { public: astar_visitor(vertex_type goal) : goal_(goal) { }; template <class Graph> void examine_vertex(vertex_type u, Graph& g) { //std::cout << "EXAM: " << u << std::endl; if (u == goal_) throw exit_astar(true); } private: vertex_type goal_; }; // **************************************************************************** int main(int argc, const char * argv[]) { std::vector<std::pair<std::size_t, std::size_t>> graph_edges; std::vector<int> edge_weight; int n_nodes; int read_a, read_b, read_w; n_nodes = -1; std::ifstream igraph("/Users/senseiwa/Documents/Projects/scratch/tbb/g.txt"); while(igraph >> read_a >> read_b >> read_w) { if (read_a > n_nodes) n_nodes = read_a; if (read_b > n_nodes) n_nodes = read_b; read_a--; read_b--; graph_edges.push_back(std::make_pair(read_a, read_b)); edge_weight.push_back(read_w); } std::cout << "+++ READ # NODES: " << n_nodes << std::endl; // Create the graph boost_graph graph(boost::edges_are_unsorted_multi_pass, graph_edges.begin(), graph_edges.end(), edge_weight.data(), n_nodes); std::cout << "Graph statistics: " << std::endl; std::cout << "Nodes: " << boost::num_vertices(graph) << std::endl; std::cout << "Edges: " << graph_edges.size() << std::endl; edge_iterator ei, ee; std::size_t source_node = std::stoul(argv[1]); std::size_t destination_node = std::stoul(argv[2]); std::cout << ">> SOURCE NODE " << source_node << std::endl; std::cout << "Degrees in/out: " << source_node << std::endl; std::cout << boost::in_degree(boost::vertex(source_node, graph), graph) << std::endl; std::cout << boost::out_degree(boost::vertex(source_node, graph), graph) << std::endl; std::cout << "Degrees in/out: " << destination_node << std::endl; std::cout << boost::in_degree(boost::vertex(destination_node, graph), graph) << std::endl; std::cout << boost::out_degree(boost::vertex(destination_node, graph), graph) << std::endl; std::vector<std::size_t> preds(boost::num_vertices(graph)); std::vector<std::size_t> dists(boost::num_vertices(graph)); index_map idx_map = boost::get(boost::vertex_index, graph); predecessor_map pred_map(preds.data(), idx_map); distance_map dist_map(dists.data(), idx_map); boost::dijkstra_shortest_paths(graph, source_node, boost::distance_map(dist_map).predecessor_map(pred_map)); typedef std::vector<boost_graph::edge_descriptor> path_type; path_type spath; std::cout << ">> SOURCE NODE " << source_node << std::endl; std::cout << ">> DESTINATION NODE " << destination_node << std::endl; // ******* DIJKSTRA ******************************************************** std::size_t v = destination_node; // We want to start at the destination and work our way back to the source for(std::size_t u = pred_map[v]; // Start by setting 'u' to the destintaion node's predecessor u != v; // Keep tracking the path until we get to the source v = u, u = pred_map[v]) // Set the current vertex to the current predecessor, and the predecessor to one level up { std::pair<boost_graph::edge_descriptor, bool> edgePair = boost::edge(u, v, graph); boost_graph::edge_descriptor edge = edgePair.first; spath.push_back(edge); } // Write shortest path int totalDistance = 0; for(path_type::reverse_iterator pathIterator = spath.rbegin(); pathIterator != spath.rend(); ++pathIterator) { std::cout << boost::source(*pathIterator, graph) << " - " << boost::target(*pathIterator, graph) << " = " << boost::get(boost::edge_weight, graph, *pathIterator) << std::endl; totalDistance += boost::get(boost::edge_weight, graph, *pathIterator); } std::cout << "Shortest Dijkstra path from " << source_node << " to " << destination_node << " cost " << totalDistance << std::endl; // ******* A* ************************************************************** // A* search predecessor and cost std::vector<std::size_t> p(boost::num_vertices(graph)); std::vector<std::size_t> d(boost::num_vertices(graph)); try { // A* parameter interface astar_search(graph, source_node, astar_heuristic<boost_graph>(destination_node), boost::predecessor_map(&p[0]).distance_map(&d[0]).visitor(astar_visitor<std::size_t>(destination_node))); } catch(exit_astar fg) { std::list<std::size_t> shortest_path; for(std::size_t v = source_node; ; v = p[v]) { shortest_path.push_front(v); if(p[v] == v) break; } auto spi = shortest_path.begin(); std::cout << "node " << source_node << std::endl; for(++spi; spi != shortest_path.end(); ++spi) std::cout << "node " << *spi << std::endl; std::cout << "Shortest A* path from " << source_node << " to " << destination_node << " cost " << d[destination_node] << std::endl; std::cout << shortest_path.size() << std::endl; return 0; } std::cout << "Didn't find a path from " << source_node << "to" << destination_node << "!" << std::endl; return 0; } +++ READ # NODES: 200 Graph statistics: Nodes: 200 Edges: 4000 >> SOURCE NODE 1 Degrees in/out: 1 0 35 Degrees in/out: 192 39 1 >> SOURCE NODE 1 >> DESTINATION NODE 192 1 - 47 = 2 47 - 91 = 3 91 - 120 = 1 120 - 175 = 1 175 - 192 = 10 Shortest Dijkstra path from 1 to 192 cost 17 node 1 Shortest A* path from 1 to 192 cost 17 1

2 2

Why does async_connect() call listen()?
by Soren Dreijer 01 Jul '14

01 Jul '14

Hi there, By coincidence, I ended up looking at a stack trace where my application calls async_connect() on a asio::ip::tcp::socket. Two things took me by surprise: 1. Asio calls listen() under the hood. Why does it do that when I'm just trying to make an outbound TCP connection? 2. If the listen() call above is indeed required, why does it happen on the same thread where I call async_connect()? I thought the point of the method was to defer the work to the reactor? (For what it's worth, I've had a case on a customer's machine where the call to listen() would hang for 30 seconds before returning -- probably because of a bad firewall -- causing my entire app to hang since the code assumes async_connect() is indeed async.) I've included the full stack trace below. Thanks, Soren 0:000> k ChildEBP RetAddr 0117db50 0f681c65 WS2_32!listen 0117db70 0f691013 EvoClr!boost::asio::detail::socket_ops::listen+0x35 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\socket_ops.ipp @ 658] 0117dbd8 0f690e9f EvoClr!boost::asio::detail::socket_select_interrupter::open_descriptors+0x163 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\socket_select_interrupter.ipp @ 78] 0117dbe4 0f690cc0 EvoClr!boost::asio::detail::socket_select_interrupter::socket_select_interrupter+0xf [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\socket_select_interrupter.ipp @ 42] 0117dc1c 0f690c1e EvoClr!boost::asio::detail::select_reactor::select_reactor+0x70 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\select_reactor.ipp @ 48] 0117dc44 0f17837e EvoClr!boost::asio::detail::service_registry::create<boost::asio::detail::select_reactor>+0x4e [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\service_registry.hpp @ 81] 0117dc80 0f6909e9 EvoClr!boost::asio::detail::service_registry::do_use_service+0x9e [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\service_registry.ipp @ 123] 0117dca0 0f6908ee EvoClr!boost::asio::detail::service_registry::use_service<boost::asio::detail::select_reactor>+0x39 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\service_registry.hpp @ 49] 0117dca8 0f68fab0 EvoClr!boost::asio::use_service<boost::asio::detail::select_reactor>+0xe [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\impl\io_service.hpp @ 34] 0117dcbc 0f68f731 EvoClr!boost::asio::detail::win_iocp_socket_service_base::get_reactor+0x30 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\win_iocp_socket_service_base.ipp @ 620] 0117dce4 0f68f6f1 EvoClr!boost::asio::detail::win_iocp_socket_service_base::start_connect_op+0x11 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\impl\win_iocp_socket_service_base.ipp @ 550] 0117dd28 0f68ed22 EvoClr!boost::asio::detail::win_iocp_socket_service<boost::asio::ip::tcp>::async_connect<boost::_bi::bind_t<void,boost::_mfi::mf1<void,Swift::BoostConnection,boost::system::error_code const &>,boost::_bi::list2<boost::_bi::value<boost::shared_ptr<Swift::BoostConnection> >,boost::arg<1> > > >+0xc1 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\detail\win_iocp_socket_service.hpp @ 515] 0117dd68 0f68c41a EvoClr!boost::asio::stream_socket_service<boost::asio::ip::tcp>::async_connect<boost::_bi::bind_t<void,boost::_mfi::mf1<void,Swift::BoostConnection,boost::system::error_code const &>,boost::_bi::list2<boost::_bi::value<boost::shared_ptr<Swift::BoostConnection> >,boost::arg<1> > > >+0x52 [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\stream_socket_service.hpp @ 234] 0117ddec 0f68a32e EvoClr!boost::asio::basic_socket<boost::asio::ip::tcp,boost::asio::stream_socket_service<boost::asio::ip::tcp> >::async_connect<boost::_bi::bind_t<void,boost::_mfi::mf1<void,Swift::BoostConnection,boost::system::error_code const &>,boost::_bi::list2<boost::_bi::value<boost::shared_ptr<Swift::BoostConnection> >,boost::arg<1> > > >+0x11a [c:\private\src\vendor\boost_1_55_0_sdk\include\boost\asio\basic_socket.hpp @ 779] 0117de9c 0f210146 EvoClr!Swift::BoostConnection::connect+0x11e [c:\private\src\vendor\swift\swiften\network\boostconnection.cpp @ 70]

4 4

[atomic] ThreadSanitizer reports a data race when using the code from "reference counting" example
by Adam Romanek 01 Jul '14

01 Jul '14

Hi Boosters! I'd like to draw your attention to an issue with Boost.Atomic that I encountered when using ThreadSanitizer. The problem is that when using the code shown in "reference counting" example [1] from the docs, the ThreadSanitizer reports a data race. Everything is described in detail in a StackOverflow thread [2] so I don't want to repeat all that here. Please help me determine whether it's a false positive, an issue in Boost.Atomic or a wrong usage of the code. Additionally, I don't understand this: Write of size 1 at 0x7d040000f7f0 by thread T2: #0 operator delete(void*) <null>:0 (a.out+0x00000004738b) What kind of write does ThreadSanitizer might refer to? WBR, Adam Romanek [1] http://www.boost.org/doc/libs/1_55_0/doc/html/atomic/usage_examples.html#bo… [2] http://stackoverflow.com/questions/24446561/threadsanitizer-reports-data-ra…

2 3

Oneshot fixture per test suit
by Florian Lindner 30 Jun '14

30 Jun '14

Hello, is it possible to have a test fixture that is created once per test suite and is destroyed after the last test of the test suite has been ran? A test suite level fixture is created before each and every test, a global fixture just once for the entire test programm. Thanks, Florian

1 0

Re: [Boost-users] [fusion] maps and arrays
by Seeger, Steven D. (GSFC-444.0)[Embedded Flight Systems, Inc] 29 Jun '14

29 Jun '14

From: Agust?n K-ballo Berg? Subject: Re: [Boost-users] [fusion] maps and arrays >Not an official answer in any way, but considering it's not explicitly >documented as supported and your test case also fails when replacing >`fusion::map` with `std::tuple` I would consider it just a fluke in the >past. On the other hand, the following code compiles correctly (albeit >with possibly a warning): Hi Agustin thanks for your reply. You are correct that what I'm doing is not documented. In fact, it doesn't really make sense now that I look at it. The for_each should be called on each type. If the type is an array it doesn't make sense for a for_each to break down the array. That said, there should be some way to specialize operator() in the functor passed to it in order to correctly handle array types. > typedef std::tuple<short, > int, > std::array<int, 2>, // note std::array > std::string > test_t; You inspired me with your use of std::array to try it out in my example. I changed "print_me" to use t.second instead of just t (which is correct) and then made a template function to support std::array with std::cout. That did the trick. Of course, the real goal here would be to handle it on the for_each side not the cout side, as outputting the types is not always the goal. > test_t test{1, 2, {}, {"hello"}}; You know one other weird thing, is that with boost 1.53 I could initialize this with std::array<int, 2> as: test_1 test{1,2, {{3,4}}, {"hello"}}; Now with 1.55 it's only working with: test_1 test{1,2,std::int<array, 2>{3, 4}, "hello"}; //missing braces on string correct I'm using both gcc 4.8.3 and clang 3.4.1. Steven

2 1

[thread] mutex is locked
by gast128 29 Jun '14

29 Jun '14

Dear all, does anybody know if there is a possibility to check if a mutex is locked? There is an 'owns_lock' on the lock type but not on the mutex. The main use case for me is debugging (and documentation) purposes: void MyClass::Process() { boost::unique_lock<boost::mutex> lck(m_mtx); ProcessImpl(); } void MyClass::ProcessImpl() { _ASSERT(m_mtx.is_locked()); //does not exist :( }

4 4

Selecting one element per fusion sequence using mpl::int_s
by gsermaid 28 Jun '14

28 Jun '14

Dear all, I am trying to create a fusion sequence whose elements are non-const references to the elements of given set of sequences. In particular, for a given sequence of integral constants, say vector< int_<2>, int_<1> >, and two fusion sequences, say X = vector< X0, X1, X2, X3 > and Y = vector< Y0, Y1, Y2 >, I would like to create the following sequence R = vector< X2&, Y1& >, such that at<0>(R) == at<2>(X) and at<1>(R) == at<1>(Y). I am using fusion::transform to achieve the above but the transform function takes the sequences as const references so I end up with R = vector<const X2&, const Y1&>, which is not what I want. Below is my code; any ideas on how to get a sequence of non-const references would be greatly appreciated. Thanks for reading! #include <boost/fusion/include/vector.hpp> #include <boost/fusion/include/transform.hpp> #include <boost/fusion/sequence/io/out.hpp> #include <boost/fusion/include/at.hpp> #include <boost/mpl/assert.hpp> #include <boost/type_traits.hpp> #include <iostream> using namespace boost::fusion; using boost::mpl::int_; using my_ints = vector< int_<2>, int_<1> >; using my_x = vector<int, double, unsigned, float>; using my_y = vector<unsigned, float, long>; using joined = vector<my_x, my_y>; struct my_functor { template <class I, class Seq> typename result_of::at<Seq, I>::type operator()(I& i, Seq& seq) const { return boost::fusion::at<I>(seq); } }; int main() { my_ints ints; my_x x(-2, 3.5, 15, -1.3); my_y y(4, 10.1, 100); joined jv(x, y); auto tv = transform(ints, jv, my_functor()); std::cout << tv << std::endl; // prints (15 10.1) // these two fail to compile because the first argument is const-qualified BOOST_MPL_ASSERT(( boost::is_same< decltype(at_c<0>(tv)), unsigned& > )); BOOST_MPL_ASSERT(( boost::is_same< decltype(at_c<1>(tv)), float& > )); }

2 1

[fusion] maps and arrays
by Seeger, Steven D. (GSFC-444.0)[Embedded Flight Systems, Inc] 28 Jun '14

28 Jun '14

I've had some code written with boost 1.53 a while ago that uses fusion maps to define at compile-time packet structures. There is then compile time generated code that handles marshaling, unmarshaling, and packet size calculation on these structures. One of the big reasons for going this route was the ability to have arrays contained in the packets. When upgrading from boost 1.53 to 1.55 on my Gentoo box, this all broke. I posted a bug report at https://svn.boost.org/trac/boost/ticket/10133 but it seems fusion bug reports don't get much activity here. I'm contacting the list to ask if the use of arrays in containers was just a fluke or if it should be working and something happened in 1.55 (or possibly 1.54 which I never tried.) If this is not something that should be supported then I will abandon this code and go with something else. It's been really nice to work on some client/server stuff with it because the work that went in to handle the code generation saves a lot of time going forward. Thanks, Steven

2 1

Boost.Coroutine with segmentation fault
by Van Pers 27 Jun '14

27 Jun '14

Hi all, I am writting a code with Coroutines lib, this code uses coroutines in a recursive way but when I create a large number of coroutines the program crashes (segmentation fault). I write a simplified version that reproduces this error: #include<iostream> #include<cstdlib> #include<boost/coroutine/all.hpp> #include <boost/bind.hpp> #include <boost/shared_ptr.hpp> class FClass{ private: int n; public: boost::coroutines::coroutine<void>::pull_type* startResume; FClass(int n) : n(n){ startResume = NULL; } void resume(){ if(startResume && *(startResume)) (*(startResume))(); } void doSomething ( boost::coroutines::coroutine< void >::push_type & fPause){ if (n > 2){ FClass* tc1 = new FClass(--n); tc1->startResume = new boost::coroutines::coroutine<void>::pull_type( boost::bind( &FClass::doSomething, tc1, _1) ); FClass* tc2 = new FClass(--n); tc2->startResume = new boost::coroutines::coroutine<void>::pull_type( boost::bind( &FClass::doSomething, tc2, _1) ); fPause(); tc1->resume(); tc2->resume(); } return; } }; int main(int argc, char** argv){ int max = 10; if (argc > 1){ max = atoi(argv[1]); } FClass* firstObject = new FClass (max) ; firstObject->startResume = new boost::coroutines::coroutine<void>::pull_type( boost::bind(&FClass::doSomething, firstObject, _1) ); firstObject->resume(); } gdb output reports:"memset () at ../sysdeps/x86_64/memset.S:78 ../sysdeps/x86_64/memset.S:No such file or directory." Anybody can help me? Regards, Van

1 0

core when using managed shared memory -- file based
by Sean K 27 Jun '14

27 Jun '14

I have a client and server set up where the client would write to the shared memory via a managed memory vector. And then the server would read that shared memory via the managed mapped file. It works for most situations. However, I just ran into a situation where the client -- writing to the vector, crashes. and I am trying to figure out what caused the crash. Below are the client (writer) and the server (reader) source code.... as close as to the current. Any insights as to why the vector.push_back() crashed? (this is happening on RH 5.9 64 bit OS.. but the code is compiled for 32 bit.) client: #include <iostream> #include <iostream> #include <string> #include <cstdlib> using namespace std; #include "fileheader.h" int main() { std::string data = "Hello"; char myinput[1024]; printf("enter number of count \n"); scanf("%s", &myinput); printf("You entered %s \n", myinput); data = myinput; int count = std::atoi(myinput); for (int counter = 0; counter < count; counter ++) { try { std::string tmpPath = "/var/tmp/log/testfile/ManagedMappedFile";; printf("temp directory: %s \n", tmpPath.c_str()); managed_mapped_file segment(open_or_create, tmpPath.c_str(), SHARED_MEMORY_SIZE); printf("initialized managed shared memory \n"); BString bstrData(segment.get_segment_manager()); bstrData = "hello world"; StrAllocator alloc_init(segment.get_segment_manager()); printf("ALLOCATED memory successfully\n"); BStrVector *myvec = segment.find_or_construct<BStrVector> (SHARED_VECTOR_NAME)(alloc_init); myvec->push_back(bstrData); segment.flush(); printf("inserted mystring into shmvector %d\n", counter); } catch (boost::interprocess::bad_alloc e) { printf("we caught bad alloc\n"); printf("explanation: %s\n", e.what()); printf("error code: %d\n", e.get_error_code()); printf("native: %d\n", e.get_native_error()); break; } catch (...) { printf("caught unknown exception\n"); } } printf("wrote number"); return 0; } contents of fileheader.h #ifndef FILEHEADER_H_ #define FILEHEADER_H_ #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/managed_mapped_file.hpp> #include <boost/thread/thread.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/containers/string.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <boost/interprocess/detail/tmp_dir_helpers.hpp> using namespace boost::interprocess; typedef boost::interprocess::managed_mapped_file::segment_manager segment_manager_t; typedef boost::interprocess::allocator<char, segment_manager_t> ShmemAllocator; typedef boost::interprocess::basic_string<char, std::char_traits<char>, ShmemAllocator> BString; typedef boost::interprocess::allocator<BString, segment_manager_t> StrAllocator; typedef boost::interprocess::vector<BString, StrAllocator> BStrVector; typedef std::pair<BString *, std::size_t> BStringPair; typedef std::pair<BStrVector *, std::size_t> BStrVectorPair; const char * SHARED_VECTOR_NAME = "MyVector"; const int SHARED_MEMORY_SIZE = 65536; #endif /* FILEHEADER_H_ */ g++ -m32 -fPIC -Xlinker -zmuldefs filewriter.cpp -o writer -I/cots/boost_1_42_0/include -L/cots/boost_1_42_0/lib -lboost_thread -lboost_system -pthread Server: #include <iostream> #include <string> #include <cstdlib> using namespace std; #include "../../filewriter/src/fileheader.h" int main() { int count = 0; std::string tmpPath = "/var/tmp/log/testfile"; //boost::interprocess::detail::get_tmp_base_dir(tmpPath); printf("temp directory: %s \n", tmpPath.c_str()); //boost::interprocess::detail::create_tmp_dir_and_get_filename("ManagedMappedFile", tmpPath); printf("temp file: %s \n", tmpPath.c_str()); // file_mapping::remove(tmpPath.c_str()); while (true) { try { managed_mapped_file segment(open_only, tmpPath.c_str()); if (segment.get_num_named_objects() > 0){ BStrVectorPair message = segment.find<BStrVector> (SHARED_VECTOR_NAME); printf("stuff in memory\n"); int size = message.first->size(); int retcode = 0; bool success=true; printf("PROCESS: Number of messages: %d\n", size); for (int imessage=0; imessage < size ; imessage++){ const char * const buffer = message.first->at(imessage).c_str(); int len = message.first->at(imessage).length(); printf("PROCESS: going to process this message: %s\n" , buffer); } printf("p.second: %d \n", message.second); segment.destroy<BStrVectorPair>(SHARED_VECTOR_NAME); } } catch (exception& e){ printf("exception %s", e.what()); } catch (...){ printf("unexpected exception"); } int msecs = 2000; boost::this_thread::sleep(boost::posix_time::milliseconds(msecs)); printf("sleeping...\n"); } return 0; } g++ -m32 -fPIC -Xlinker -zmuldefs filereader.cpp -o reader -I/cots/boost_1_42_0/include -L/cots/boost_1_42_0/lib -lboost_thread -lboost_system -pthread

1 0

Unexpected behavior when using as::ftime() of Boost Locale library
by Mouse Beer 27 Jun '14

27 Jun '14

Hi all, I see a mismatch when using %Y format specifier with as::ftime. It looks like it outputs the year according to the week of the year. I hope I didn't miss or misunderstand anything... please find my small test program attached for reference. It was compiled as follows: g++ -g -Wall -I /opt/boost/1.55/include -L /opt/boost/1.55/lib -lboost_locale -lboost_thread -lboost_system -licuuc -licui18n -licudata -lpthread -lrt boost_dates_test.cpp I am running on Debian Testing: $ ldd a.out linux-vdso.so.1 (0x00007fffa39fe000) libboost_locale.so.1.55.0 => /opt/boost/1.55/lib/libboost_locale.so.1.55.0 (0x00007fba3335b000) libboost_thread.so.1.55.0 => /opt/boost/1.55/lib/libboost_thread.so.1.55.0 (0x00007fba33142000) libboost_system.so.1.55.0 => /opt/boost/1.55/lib/libboost_system.so.1.55.0 (0x00007fba32f3e000) libicuuc.so.52 => /usr/lib/x86_64-linux-gnu/libicuuc.so.52 (0x00007fba32ba2000) libicui18n.so.52 => /usr/lib/x86_64-linux-gnu/libicui18n.so.52 (0x00007fba3279a000) libicudata.so.52 => /usr/lib/x86_64-linux-gnu/libicudata.so.52 (0x00007fba30f2c000) libpthread.so.0 => /lib/x86_64-linux-gnu/libpthread.so.0 (0x00007fba30d0f000) librt.so.1 => /lib/x86_64-linux-gnu/librt.so.1 (0x00007fba30b07000) libstdc++.so.6 => /usr/lib/x86_64-linux-gnu/libstdc++.so.6 (0x00007fba307fb000) libm.so.6 => /lib/x86_64-linux-gnu/libm.so.6 (0x00007fba304fa000) libgcc_s.so.1 => /lib/x86_64-linux-gnu/libgcc_s.so.1 (0x00007fba302e4000) libc.so.6 => /lib/x86_64-linux-gnu/libc.so.6 (0x00007fba2ff3a000) libboost_chrono.so.1.55.0 => /opt/boost/1.55/lib/libboost_chrono.so.1.55.0 (0x00007fba2fd34000) libdl.so.2 => /lib/x86_64-linux-gnu/libdl.so.2 (0x00007fba2fb2f000) /lib64/ld-linux-x86-64.so.2 (0x00007fba33642000) The program shows the output of cout<<date_time and cout<<as:ftime("%Y-%m...")<<date_time If a mismatch in the year is detected, a "!" is added at the end of the line. When running with en_US locale, the output is as follows: [ 10:49:40 ] [0] $ export LC_ALL=en_US.utf8 [ 10:50:39 ] [0] $ locale LANG= LANGUAGE= LC_CTYPE="en_US.utf8" LC_NUMERIC="en_US.utf8" LC_TIME="en_US.utf8" LC_COLLATE="en_US.utf8" LC_MONETARY="en_US.utf8" LC_MESSAGES="en_US.utf8" LC_PAPER="en_US.utf8" LC_NAME="en_US.utf8" LC_ADDRESS="en_US.utf8" LC_TELEPHONE="en_US.utf8" LC_MEASUREMENT="en_US.utf8" LC_IDENTIFICATION="en_US.utf8" LC_ALL=en_US.utf8 [ 10:50:41 ] [0] $ ./a.out Dec 27, 2000, 12:00:00 AM ++ 2000-12-27 00:00:00 Dec 28, 2000, 12:00:00 AM ++ 2000-12-28 00:00:00 Dec 29, 2000, 12:00:00 AM ++ 2000-12-29 00:00:00 Dec 30, 2000, 12:00:00 AM ++ 2000-12-30 00:00:00 Dec 31, 2000, 12:00:00 AM ++ 2001-12-31 00:00:00 ! Jan 1, 2001, 12:00:00 AM ++ 2001-01-01 00:00:00 Jan 2, 2001, 12:00:00 AM ++ 2001-01-02 00:00:00 Jan 3, 2001, 12:00:00 AM ++ 2001-01-03 00:00:00 Jan 4, 2001, 12:00:00 AM ++ 2001-01-04 00:00:00 Jan 5, 2001, 12:00:00 AM ++ 2001-01-05 00:00:00 Dec 27, 2001, 12:00:00 AM ++ 2001-12-27 00:00:00 Dec 28, 2001, 12:00:00 AM ++ 2001-12-28 00:00:00 Dec 29, 2001, 12:00:00 AM ++ 2001-12-29 00:00:00 Dec 30, 2001, 12:00:00 AM ++ 2002-12-30 00:00:00 ! Dec 31, 2001, 12:00:00 AM ++ 2002-12-31 00:00:00 ! Jan 1, 2002, 12:00:00 AM ++ 2002-01-01 00:00:00 Jan 2, 2002, 12:00:00 AM ++ 2002-01-02 00:00:00 Jan 3, 2002, 12:00:00 AM ++ 2002-01-03 00:00:00 Jan 4, 2002, 12:00:00 AM ++ 2002-01-04 00:00:00 Jan 5, 2002, 12:00:00 AM ++ 2002-01-05 00:00:00 Dec 27, 2002, 12:00:00 AM ++ 2002-12-27 00:00:00 Dec 28, 2002, 12:00:00 AM ++ 2002-12-28 00:00:00 Dec 29, 2002, 12:00:00 AM ++ 2003-12-29 00:00:00 ! Dec 30, 2002, 12:00:00 AM ++ 2003-12-30 00:00:00 ! Dec 31, 2002, 12:00:00 AM ++ 2003-12-31 00:00:00 ! Jan 1, 2003, 12:00:00 AM ++ 2003-01-01 00:00:00 Jan 2, 2003, 12:00:00 AM ++ 2003-01-02 00:00:00 Jan 3, 2003, 12:00:00 AM ++ 2003-01-03 00:00:00 Jan 4, 2003, 12:00:00 AM ++ 2003-01-04 00:00:00 Jan 5, 2003, 12:00:00 AM ++ 2003-01-05 00:00:00 Dec 27, 2003, 12:00:00 AM ++ 2003-12-27 00:00:00 Dec 28, 2003, 12:00:00 AM ++ 2004-12-28 00:00:00 ! Dec 29, 2003, 12:00:00 AM ++ 2004-12-29 00:00:00 ! Dec 30, 2003, 12:00:00 AM ++ 2004-12-30 00:00:00 ! Dec 31, 2003, 12:00:00 AM ++ 2004-12-31 00:00:00 ! Jan 1, 2004, 12:00:00 AM ++ 2004-01-01 00:00:00 Jan 2, 2004, 12:00:00 AM ++ 2004-01-02 00:00:00 Jan 3, 2004, 12:00:00 AM ++ 2004-01-03 00:00:00 Jan 4, 2004, 12:00:00 AM ++ 2004-01-04 00:00:00 Jan 5, 2004, 12:00:00 AM ++ 2004-01-05 00:00:00 Dec 27, 2004, 12:00:00 AM ++ 2005-12-27 00:00:00 ! Dec 28, 2004, 12:00:00 AM ++ 2005-12-28 00:00:00 ! Dec 29, 2004, 12:00:00 AM ++ 2005-12-29 00:00:00 ! Dec 30, 2004, 12:00:00 AM ++ 2005-12-30 00:00:00 ! Dec 31, 2004, 12:00:00 AM ++ 2005-12-31 00:00:00 ! Jan 1, 2005, 12:00:00 AM ++ 2005-01-01 00:00:00 Jan 2, 2005, 12:00:00 AM ++ 2005-01-02 00:00:00 Jan 3, 2005, 12:00:00 AM ++ 2005-01-03 00:00:00 Jan 4, 2005, 12:00:00 AM ++ 2005-01-04 00:00:00 Jan 5, 2005, 12:00:00 AM ++ 2005-01-05 00:00:00 Dec 27, 2005, 12:00:00 AM ++ 2005-12-27 00:00:00 Dec 28, 2005, 12:00:00 AM ++ 2005-12-28 00:00:00 Dec 29, 2005, 12:00:00 AM ++ 2005-12-29 00:00:00 Dec 30, 2005, 12:00:00 AM ++ 2005-12-30 00:00:00 Dec 31, 2005, 12:00:00 AM ++ 2005-12-31 00:00:00 Jan 1, 2006, 12:00:00 AM ++ 2006-01-01 00:00:00 Jan 2, 2006, 12:00:00 AM ++ 2006-01-02 00:00:00 Jan 3, 2006, 12:00:00 AM ++ 2006-01-03 00:00:00 Jan 4, 2006, 12:00:00 AM ++ 2006-01-04 00:00:00 Jan 5, 2006, 12:00:00 AM ++ 2006-01-05 00:00:00 Dec 27, 2006, 12:00:00 AM ++ 2006-12-27 00:00:00 Dec 28, 2006, 12:00:00 AM ++ 2006-12-28 00:00:00 Dec 29, 2006, 12:00:00 AM ++ 2006-12-29 00:00:00 Dec 30, 2006, 12:00:00 AM ++ 2006-12-30 00:00:00 Dec 31, 2006, 12:00:00 AM ++ 2007-12-31 00:00:00 ! Jan 1, 2007, 12:00:00 AM ++ 2007-01-01 00:00:00 Jan 2, 2007, 12:00:00 AM ++ 2007-01-02 00:00:00 Jan 3, 2007, 12:00:00 AM ++ 2007-01-03 00:00:00 Jan 4, 2007, 12:00:00 AM ++ 2007-01-04 00:00:00 Jan 5, 2007, 12:00:00 AM ++ 2007-01-05 00:00:00 Dec 27, 2007, 12:00:00 AM ++ 2007-12-27 00:00:00 Dec 28, 2007, 12:00:00 AM ++ 2007-12-28 00:00:00 Dec 29, 2007, 12:00:00 AM ++ 2007-12-29 00:00:00 Dec 30, 2007, 12:00:00 AM ++ 2008-12-30 00:00:00 ! Dec 31, 2007, 12:00:00 AM ++ 2008-12-31 00:00:00 ! Jan 1, 2008, 12:00:00 AM ++ 2008-01-01 00:00:00 Jan 2, 2008, 12:00:00 AM ++ 2008-01-02 00:00:00 Jan 3, 2008, 12:00:00 AM ++ 2008-01-03 00:00:00 Jan 4, 2008, 12:00:00 AM ++ 2008-01-04 00:00:00 Jan 5, 2008, 12:00:00 AM ++ 2008-01-05 00:00:00 Dec 27, 2008, 12:00:00 AM ++ 2008-12-27 00:00:00 Dec 28, 2008, 12:00:00 AM ++ 2009-12-28 00:00:00 ! Dec 29, 2008, 12:00:00 AM ++ 2009-12-29 00:00:00 ! Dec 30, 2008, 12:00:00 AM ++ 2009-12-30 00:00:00 ! Dec 31, 2008, 12:00:00 AM ++ 2009-12-31 00:00:00 ! Jan 1, 2009, 12:00:00 AM ++ 2009-01-01 00:00:00 Jan 2, 2009, 12:00:00 AM ++ 2009-01-02 00:00:00 Jan 3, 2009, 12:00:00 AM ++ 2009-01-03 00:00:00 Jan 4, 2009, 12:00:00 AM ++ 2009-01-04 00:00:00 Jan 5, 2009, 12:00:00 AM ++ 2009-01-05 00:00:00 Dec 27, 2009, 12:00:00 AM ++ 2010-12-27 00:00:00 ! Dec 28, 2009, 12:00:00 AM ++ 2010-12-28 00:00:00 ! Dec 29, 2009, 12:00:00 AM ++ 2010-12-29 00:00:00 ! Dec 30, 2009, 12:00:00 AM ++ 2010-12-30 00:00:00 ! Dec 31, 2009, 12:00:00 AM ++ 2010-12-31 00:00:00 ! Jan 1, 2010, 12:00:00 AM ++ 2010-01-01 00:00:00 Jan 2, 2010, 12:00:00 AM ++ 2010-01-02 00:00:00 Jan 3, 2010, 12:00:00 AM ++ 2010-01-03 00:00:00 Jan 4, 2010, 12:00:00 AM ++ 2010-01-04 00:00:00 Jan 5, 2010, 12:00:00 AM ++ 2010-01-05 00:00:00 Dec 27, 2010, 12:00:00 AM ++ 2011-12-27 00:00:00 ! Dec 28, 2010, 12:00:00 AM ++ 2011-12-28 00:00:00 ! Dec 29, 2010, 12:00:00 AM ++ 2011-12-29 00:00:00 ! Dec 30, 2010, 12:00:00 AM ++ 2011-12-30 00:00:00 ! Dec 31, 2010, 12:00:00 AM ++ 2011-12-31 00:00:00 ! Jan 1, 2011, 12:00:00 AM ++ 2011-01-01 00:00:00 Jan 2, 2011, 12:00:00 AM ++ 2011-01-02 00:00:00 Jan 3, 2011, 12:00:00 AM ++ 2011-01-03 00:00:00 Jan 4, 2011, 12:00:00 AM ++ 2011-01-04 00:00:00 Jan 5, 2011, 12:00:00 AM ++ 2011-01-05 00:00:00 Dec 27, 2011, 12:00:00 AM ++ 2011-12-27 00:00:00 Dec 28, 2011, 12:00:00 AM ++ 2011-12-28 00:00:00 Dec 29, 2011, 12:00:00 AM ++ 2011-12-29 00:00:00 Dec 30, 2011, 12:00:00 AM ++ 2011-12-30 00:00:00 Dec 31, 2011, 12:00:00 AM ++ 2011-12-31 00:00:00 Jan 1, 2012, 12:00:00 AM ++ 2012-01-01 00:00:00 Jan 2, 2012, 12:00:00 AM ++ 2012-01-02 00:00:00 Jan 3, 2012, 12:00:00 AM ++ 2012-01-03 00:00:00 Jan 4, 2012, 12:00:00 AM ++ 2012-01-04 00:00:00 Jan 5, 2012, 12:00:00 AM ++ 2012-01-05 00:00:00 Dec 27, 2012, 12:00:00 AM ++ 2012-12-27 00:00:00 Dec 28, 2012, 12:00:00 AM ++ 2012-12-28 00:00:00 Dec 29, 2012, 12:00:00 AM ++ 2012-12-29 00:00:00 Dec 30, 2012, 12:00:00 AM ++ 2013-12-30 00:00:00 ! Dec 31, 2012, 12:00:00 AM ++ 2013-12-31 00:00:00 ! Jan 1, 2013, 12:00:00 AM ++ 2013-01-01 00:00:00 Jan 2, 2013, 12:00:00 AM ++ 2013-01-02 00:00:00 Jan 3, 2013, 12:00:00 AM ++ 2013-01-03 00:00:00 Jan 4, 2013, 12:00:00 AM ++ 2013-01-04 00:00:00 Jan 5, 2013, 12:00:00 AM ++ 2013-01-05 00:00:00 Dec 27, 2013, 12:00:00 AM ++ 2013-12-27 00:00:00 Dec 28, 2013, 12:00:00 AM ++ 2013-12-28 00:00:00 Dec 29, 2013, 12:00:00 AM ++ 2014-12-29 00:00:00 ! Dec 30, 2013, 12:00:00 AM ++ 2014-12-30 00:00:00 ! Dec 31, 2013, 12:00:00 AM ++ 2014-12-31 00:00:00 ! Jan 1, 2014, 12:00:00 AM ++ 2014-01-01 00:00:00 Jan 2, 2014, 12:00:00 AM ++ 2014-01-02 00:00:00 Jan 3, 2014, 12:00:00 AM ++ 2014-01-03 00:00:00 Jan 4, 2014, 12:00:00 AM ++ 2014-01-04 00:00:00 Jan 5, 2014, 12:00:00 AM ++ 2014-01-05 00:00:00 When running with de_DE locale, the output is as follows: [ 10:51:42 ] [0] $ export LC_ALL=de_DE.utf8 [ 10:55:04 ] [0] $ locale LANG= LANGUAGE= LC_CTYPE="de_DE.utf8" LC_NUMERIC="de_DE.utf8" LC_TIME="de_DE.utf8" LC_COLLATE="de_DE.utf8" LC_MONETARY="de_DE.utf8" LC_MESSAGES="de_DE.utf8" LC_PAPER="de_DE.utf8" LC_NAME="de_DE.utf8" LC_ADDRESS="de_DE.utf8" LC_TELEPHONE="de_DE.utf8" LC_MEASUREMENT="de_DE.utf8" LC_IDENTIFICATION="de_DE.utf8" LC_ALL=de_DE.utf8 [ 10:55:05 ] [0] $ ./a.out 27.12.2000 00:00:00 ++ 2000-12-27 00:00:00 28.12.2000 00:00:00 ++ 2000-12-28 00:00:00 29.12.2000 00:00:00 ++ 2000-12-29 00:00:00 30.12.2000 00:00:00 ++ 2000-12-30 00:00:00 31.12.2000 00:00:00 ++ 2000-12-31 00:00:00 01.01.2001 00:00:00 ++ 2001-01-01 00:00:00 02.01.2001 00:00:00 ++ 2001-01-02 00:00:00 03.01.2001 00:00:00 ++ 2001-01-03 00:00:00 04.01.2001 00:00:00 ++ 2001-01-04 00:00:00 05.01.2001 00:00:00 ++ 2001-01-05 00:00:00 27.12.2001 00:00:00 ++ 2001-12-27 00:00:00 28.12.2001 00:00:00 ++ 2001-12-28 00:00:00 29.12.2001 00:00:00 ++ 2001-12-29 00:00:00 30.12.2001 00:00:00 ++ 2001-12-30 00:00:00 31.12.2001 00:00:00 ++ 2002-12-31 00:00:00 ! 01.01.2002 00:00:00 ++ 2002-01-01 00:00:00 02.01.2002 00:00:00 ++ 2002-01-02 00:00:00 03.01.2002 00:00:00 ++ 2002-01-03 00:00:00 04.01.2002 00:00:00 ++ 2002-01-04 00:00:00 05.01.2002 00:00:00 ++ 2002-01-05 00:00:00 27.12.2002 00:00:00 ++ 2002-12-27 00:00:00 28.12.2002 00:00:00 ++ 2002-12-28 00:00:00 29.12.2002 00:00:00 ++ 2002-12-29 00:00:00 30.12.2002 00:00:00 ++ 2003-12-30 00:00:00 ! 31.12.2002 00:00:00 ++ 2003-12-31 00:00:00 ! 01.01.2003 00:00:00 ++ 2003-01-01 00:00:00 02.01.2003 00:00:00 ++ 2003-01-02 00:00:00 03.01.2003 00:00:00 ++ 2003-01-03 00:00:00 04.01.2003 00:00:00 ++ 2003-01-04 00:00:00 05.01.2003 00:00:00 ++ 2003-01-05 00:00:00 27.12.2003 00:00:00 ++ 2003-12-27 00:00:00 28.12.2003 00:00:00 ++ 2003-12-28 00:00:00 29.12.2003 00:00:00 ++ 2004-12-29 00:00:00 ! 30.12.2003 00:00:00 ++ 2004-12-30 00:00:00 ! 31.12.2003 00:00:00 ++ 2004-12-31 00:00:00 ! 01.01.2004 00:00:00 ++ 2004-01-01 00:00:00 02.01.2004 00:00:00 ++ 2004-01-02 00:00:00 03.01.2004 00:00:00 ++ 2004-01-03 00:00:00 04.01.2004 00:00:00 ++ 2004-01-04 00:00:00 05.01.2004 00:00:00 ++ 2004-01-05 00:00:00 27.12.2004 00:00:00 ++ 2004-12-27 00:00:00 28.12.2004 00:00:00 ++ 2004-12-28 00:00:00 29.12.2004 00:00:00 ++ 2004-12-29 00:00:00 30.12.2004 00:00:00 ++ 2004-12-30 00:00:00 31.12.2004 00:00:00 ++ 2004-12-31 00:00:00 01.01.2005 00:00:00 ++ 2004-01-01 00:00:00 ! 02.01.2005 00:00:00 ++ 2004-01-02 00:00:00 ! 03.01.2005 00:00:00 ++ 2005-01-03 00:00:00 04.01.2005 00:00:00 ++ 2005-01-04 00:00:00 05.01.2005 00:00:00 ++ 2005-01-05 00:00:00 27.12.2005 00:00:00 ++ 2005-12-27 00:00:00 28.12.2005 00:00:00 ++ 2005-12-28 00:00:00 29.12.2005 00:00:00 ++ 2005-12-29 00:00:00 30.12.2005 00:00:00 ++ 2005-12-30 00:00:00 31.12.2005 00:00:00 ++ 2005-12-31 00:00:00 01.01.2006 00:00:00 ++ 2005-01-01 00:00:00 ! 02.01.2006 00:00:00 ++ 2006-01-02 00:00:00 03.01.2006 00:00:00 ++ 2006-01-03 00:00:00 04.01.2006 00:00:00 ++ 2006-01-04 00:00:00 05.01.2006 00:00:00 ++ 2006-01-05 00:00:00 27.12.2006 00:00:00 ++ 2006-12-27 00:00:00 28.12.2006 00:00:00 ++ 2006-12-28 00:00:00 29.12.2006 00:00:00 ++ 2006-12-29 00:00:00 30.12.2006 00:00:00 ++ 2006-12-30 00:00:00 31.12.2006 00:00:00 ++ 2006-12-31 00:00:00 01.01.2007 00:00:00 ++ 2007-01-01 00:00:00 02.01.2007 00:00:00 ++ 2007-01-02 00:00:00 03.01.2007 00:00:00 ++ 2007-01-03 00:00:00 04.01.2007 00:00:00 ++ 2007-01-04 00:00:00 05.01.2007 00:00:00 ++ 2007-01-05 00:00:00 27.12.2007 00:00:00 ++ 2007-12-27 00:00:00 28.12.2007 00:00:00 ++ 2007-12-28 00:00:00 29.12.2007 00:00:00 ++ 2007-12-29 00:00:00 30.12.2007 00:00:00 ++ 2007-12-30 00:00:00 31.12.2007 00:00:00 ++ 2008-12-31 00:00:00 ! 01.01.2008 00:00:00 ++ 2008-01-01 00:00:00 02.01.2008 00:00:00 ++ 2008-01-02 00:00:00 03.01.2008 00:00:00 ++ 2008-01-03 00:00:00 04.01.2008 00:00:00 ++ 2008-01-04 00:00:00 05.01.2008 00:00:00 ++ 2008-01-05 00:00:00 27.12.2008 00:00:00 ++ 2008-12-27 00:00:00 28.12.2008 00:00:00 ++ 2008-12-28 00:00:00 29.12.2008 00:00:00 ++ 2009-12-29 00:00:00 ! 30.12.2008 00:00:00 ++ 2009-12-30 00:00:00 ! 31.12.2008 00:00:00 ++ 2009-12-31 00:00:00 ! 01.01.2009 00:00:00 ++ 2009-01-01 00:00:00 02.01.2009 00:00:00 ++ 2009-01-02 00:00:00 03.01.2009 00:00:00 ++ 2009-01-03 00:00:00 04.01.2009 00:00:00 ++ 2009-01-04 00:00:00 05.01.2009 00:00:00 ++ 2009-01-05 00:00:00 27.12.2009 00:00:00 ++ 2009-12-27 00:00:00 28.12.2009 00:00:00 ++ 2009-12-28 00:00:00 29.12.2009 00:00:00 ++ 2009-12-29 00:00:00 30.12.2009 00:00:00 ++ 2009-12-30 00:00:00 31.12.2009 00:00:00 ++ 2009-12-31 00:00:00 01.01.2010 00:00:00 ++ 2009-01-01 00:00:00 ! 02.01.2010 00:00:00 ++ 2009-01-02 00:00:00 ! 03.01.2010 00:00:00 ++ 2009-01-03 00:00:00 ! 04.01.2010 00:00:00 ++ 2010-01-04 00:00:00 05.01.2010 00:00:00 ++ 2010-01-05 00:00:00 27.12.2010 00:00:00 ++ 2010-12-27 00:00:00 28.12.2010 00:00:00 ++ 2010-12-28 00:00:00 29.12.2010 00:00:00 ++ 2010-12-29 00:00:00 30.12.2010 00:00:00 ++ 2010-12-30 00:00:00 31.12.2010 00:00:00 ++ 2010-12-31 00:00:00 01.01.2011 00:00:00 ++ 2010-01-01 00:00:00 ! 02.01.2011 00:00:00 ++ 2010-01-02 00:00:00 ! 03.01.2011 00:00:00 ++ 2011-01-03 00:00:00 04.01.2011 00:00:00 ++ 2011-01-04 00:00:00 05.01.2011 00:00:00 ++ 2011-01-05 00:00:00 27.12.2011 00:00:00 ++ 2011-12-27 00:00:00 28.12.2011 00:00:00 ++ 2011-12-28 00:00:00 29.12.2011 00:00:00 ++ 2011-12-29 00:00:00 30.12.2011 00:00:00 ++ 2011-12-30 00:00:00 31.12.2011 00:00:00 ++ 2011-12-31 00:00:00 01.01.2012 00:00:00 ++ 2011-01-01 00:00:00 ! 02.01.2012 00:00:00 ++ 2012-01-02 00:00:00 03.01.2012 00:00:00 ++ 2012-01-03 00:00:00 04.01.2012 00:00:00 ++ 2012-01-04 00:00:00 05.01.2012 00:00:00 ++ 2012-01-05 00:00:00 27.12.2012 00:00:00 ++ 2012-12-27 00:00:00 28.12.2012 00:00:00 ++ 2012-12-28 00:00:00 29.12.2012 00:00:00 ++ 2012-12-29 00:00:00 30.12.2012 00:00:00 ++ 2012-12-30 00:00:00 31.12.2012 00:00:00 ++ 2013-12-31 00:00:00 ! 01.01.2013 00:00:00 ++ 2013-01-01 00:00:00 02.01.2013 00:00:00 ++ 2013-01-02 00:00:00 03.01.2013 00:00:00 ++ 2013-01-03 00:00:00 04.01.2013 00:00:00 ++ 2013-01-04 00:00:00 05.01.2013 00:00:00 ++ 2013-01-05 00:00:00 27.12.2013 00:00:00 ++ 2013-12-27 00:00:00 28.12.2013 00:00:00 ++ 2013-12-28 00:00:00 29.12.2013 00:00:00 ++ 2013-12-29 00:00:00 30.12.2013 00:00:00 ++ 2014-12-30 00:00:00 ! 31.12.2013 00:00:00 ++ 2014-12-31 00:00:00 ! 01.01.2014 00:00:00 ++ 2014-01-01 00:00:00 02.01.2014 00:00:00 ++ 2014-01-02 00:00:00 03.01.2014 00:00:00 ++ 2014-01-03 00:00:00 04.01.2014 00:00:00 ++ 2014-01-04 00:00:00 05.01.2014 00:00:00 ++ 2014-01-05 00:00:00 Sorry for the long post! Did I make any mistake in my program or is this a bug of as::ftime("%Y") formatting? Thank you yery much for your help! Regards, Holger

1 0

[Boost : icpc assignment operator compiler error with boost filter_iterator and filtered_graph
by Aniket Pugaonkar 25 Jun '14

25 Jun '14

Hello, I have the following filter iterator working perfectly with gcc 4.7 and 4.9 as well (C++11 support) But when I compile my code with intel compiler 13.0.1 version I get the following error error: *implicitly generated assignment operator cannot copy: reference member* "my_func::G" ... Details: I am using a filtered_graph over Boost::adjacency_list as my graph type (Graph_t). The vertex_iterator (from graph_traits<Graph_t> .. provides iterator range to iterate over graph vertices. I have to assign each graph vertex an id (using property_maps) and group them together by applying filter_iterator over vertex iterator. example: suppose I want to create 4 subgroups of vertices. So I create a filter predicate which is passed to filter iterator which gives me iterators <fbegin, fend> satisfying the predicate. For FOUR such groups, I get 4 pairs of filter iterators. A vector stores such filter_iterator pairs. std::vector < pair <filter_iterator_t, filter_iterator_t> > my_vector //stores iterator pair. Here is the code: vertex_iterator vbegin, vend; boost::tie(vbegin, vend) = boost::vertices(G); for (int i=0; i<4; ++i) { //for each i, create a filter_pred object my_filter_pred <Graph> filter_pred(G, i) //now create begin and end filter iterators as follows auto fbegin = boost::make_filter_iterator< my_filter_pred<Graph>, vertex_iterator> (filter_pred, vbegin, vend) auto fend = boost::make_filter_iterator< my_filter_pred<Graph>, vertex_iterator> (filter_pred, vend, vend) //fbegin, fend are of type filter iterator //insert the iterator pair into vector my_vector.push_back( std::make_pair (fbegin, fend) ); } The predicate is below : template<typename Graph> struct my_filter_pred { public: my_filter_pred() { } my_filter_pred(Graph& _G, int _value) : G(_G), value(_value) { } template<typename vertex_t> bool operator() (vertex_t vertex) { //get property "p" of vertex in graph G auto p = get (mypropertytype, vertex, G); return (p.val == value); } private: Graph& G; } ERROR : error: implicitly generated assignment operator cannot copy: reference member "my_filter_pred <Graph>::G [with ... ]" I tried to provide my own assignment operator as below: my_filter_pred& operator=(const my_filter_pred& other) { if (this != &other) G = other.G; return *this; } But it gave the same icpc error for actual typedef graph which is below : error: implicitly generated assignment operator cannot copy: " implicit generation of boost::filtered_graph_base<Graph_t> " .... Please help what should I do in this case to work. main motive : is to have a container which stores <iterator, iterator> pair which satisfies a predicate. Filter iterator was the best choice i could have to apply different filter predicate to same vertex_iterator range vbegin, vend; Thanks Aniket Pugaonkar Aniket Pugaonkar

1 0

[Bimap] Iterator invalidation
by Adam Badura 25 Jun '14

25 Jun '14

What are rules for iterator invalidation in Boost.Bimap? I have looked in documentation (version 1.55) but didn't found anything. I'm particularly interested in the bimap<...>::iterator (or ::const_iterator) invalidation. But the question remains valid for any kind of iterators. Adam Badura

2 2

Autobahn for C++: RPC and PubSub
by Tobias Oberstein 24 Jun '14

24 Jun '14

Hi, I'm happy to anounce Autobahn|Cpp - another subproject of Autobahn (http://autobahn.ws) this time for C++ 11 / Boost. Autobahn|Cpp allows remote procedure calls and publish & subscribe messaging for C++ application components and uses boost::future, continuations and Boost/ASIO as underlying network library. Here is how app code looks like: https://github.com/tavendo/AutobahnCpp/blob/master/README.md#show-me-some-c… Using Autobahn|Cpp, you can e.g. call your C++ code from JavaScript running in a browser. And much more. This is an early alpha version, things aren't fully hashed out, but there are a couple of examples included here: https://github.com/tavendo/AutobahnCpp/blob/master/README.md#examples Cheers, /Tobias

2 3

Boost Social Event at CppCon
by Jon Kalb 24 Jun '14

24 Jun '14

Boosters, Because a lot of Boosters are going to be attending CppCon, we¹d like to arrange a social event for Boosters/C++Now regulars. http://cppcon.org/ If you are planning to attend CppCon or even If you are just going to be in or around Bellevue, Washington between September 7th and 12 and you¹d like to join us for dinner, please let us know so we can get a count. Please send mail to: social(a)boost.org Once we settle on a date, etc, we¹ll let everyone who responded know when and where, so please let us know, even if you are a ³maybe.² This year¹s CppCon program includes sessions from a number of Boosters and C++Now regulars with sessions specifically about Boost Libraries. If you are considering attending, please be aware that the Early Bird registration deadline is just days away. http://cppcon.org/registration/ If you are attending, please make your hotel reservations soon. We are likely to sell out of our room block. http://cppcon.org/lodging/ I hope to see you at CppCon. Jon

1 0