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

boost::uuid
by John Emmas 11 Jul '13

11 Jul '13

Hello there, I'm developing an app (originally written for Linux) which uses some UUID functionality that originally came from a set of e2fs utilities for Linux. I'm porting the app to Windows so naturally, the e2fs stuff doesn't build. I need to find a UUID implemntation that's more cross-platform - and of course, the obvious one to try is boost::uuid. I first installed boost when it was at version 1.40 (1-2 years ago?) Anyway, my installed version doesn't include UUID so I decided to update to a more recent version. The most recent Windows installer I could find was for version 1.51, from BoostPro:- http://www.boostpro.com/download/ Unfortunately, it probably isn't the absolute latest because BoostPro is apparently now discontinued - but it should be recent enough to include the UUID modules. From what I can gather, boost::uuid has been around since at least version 1.42. However, I hit a couple of problems:- 1) Firstly, I seem to get errors, no matter which mirror I use. I'll try again later, in case the errors go away. 2) Despite the errors, something does seem to get downloaded. However, rather than installing all the source files / DLLs etc, I just get a subdirectory called "lib" which contains a bunch of zip files (over 100). My original (1.40) installation seemed to unpack everything for me. 3) AFAICT even ver 1.51 doesn't include any UUID functionality. There was nothing for UUID that was selectable in the installer - and none of the modules look like UUID. I seem to have boost::regex, boost::filesystem, boost:date_time and a whole load of other stuff - but no boost::uuid :-( I then came across this web page which seems to suggest that all I need to do is add one header file to my existing installation (boost/uuid.hpp). Am I over-thinking this?? Is that all there is to it?? Thanks. John

3 3

[graph] in-depth parsing and modifications of the graph
by Orianne Siret 11 Jul '13

11 Jul '13

Hello, I would like to know if it is possible to parse a boost graph in depth while being able to modify the properties of the verices you parse ? I saw there is a in-depth parser but it seems to not allow the modifications of properties ? Thanks in advance for your help ! Orianne Siret

2 1

[asio] Incorrect reporting of bytes transferred in write handler in 1.54
by Darren 11 Jul '13

11 Jul '13

Is anybody else seeing problems with the bytes_transferred reported to the write_handler after a successful async_write? I am seeing a value of zero despite the fact that the peer receives the bytes and no error is reported to the write_handler. My example code when built against 1.54 exhibits the problem whereas building against 1.53 works correctly. I am running on Windows 7 with MSVC 2010. A couple of notes: * I only see the problem when the number of threads is > 1, even though the handlers are invoked on a strand. * Defining BOOST_ASIO_DISABLE_IOCP makes everything work properly. When running my code a failure shows itself like this: Client: Writing value 85 Server: Received 4 bytes, value 85 Client: bytesWritten = 0 In other words, the client used async_write to send 4 bytes with long value 85 the server. The server received these bytes. The client write_handler was called with no error but a bytes_transferred value of 0. Is there something I don't understand or is this a problem introduced in 1.54? #include <boost/asio.hpp> #include <boost/thread.hpp> #include <boost/thread/mutex.hpp> #include <iostream> using namespace boost::asio; const std::size_t NumThreads = 2; const unsigned short Port = 12345; // Prevent interleaved output boost::mutex logMutex; struct Server { Server(io_service& svc) : m_socket(svc), m_acceptor(svc, ip::tcp::endpoint(ip::tcp::v4(), Port)), m_buffer(0) { } void Run() { m_acceptor.accept(m_socket); // Simple blocking reads while(std::size_t bytesRead = read(m_socket, buffer(&m_buffer, sizeof(m_buffer)))) { boost::mutex::scoped_lock lock(logMutex); std::cout << "Server: Received " << bytesRead << " bytes, value " << m_buffer << std::endl; } } ip::tcp::socket m_socket; ip::tcp::acceptor m_acceptor; unsigned long m_buffer; }; struct Client { Client(io_service& svc) : m_strand(svc), m_socket(svc), m_buffer(0) { m_socket.connect( ip::tcp::endpoint(ip::address_v4::from_string("127.0.0.1"), Port)); ScheduleWrite(); } void WriteHandler(const boost::system::error_code& err, std::size_t bytesWritten) { assert(!err); if(bytesWritten != sizeof(m_buffer)) { boost::mutex::scoped_lock lock(logMutex); std::cout << "Client: bytesWritten = " << bytesWritten << std::endl; return; } ScheduleWrite(); } void ScheduleWrite() { { boost::mutex::scoped_lock lock(logMutex); std::cout << "Client: Writing value " << ++m_buffer << std::endl; } async_write(m_socket, buffer(&m_buffer, sizeof(m_buffer)), m_strand.wrap( std::bind(&Client::WriteHandler, this, std::placeholders::_1, std::placeholders::_2))); } io_service::strand m_strand; ip::tcp::socket m_socket; unsigned long m_buffer; }; int main(int argc, char* argv[]) { boost::asio::io_service svc; Server server(svc); Client client(svc); boost::thread_group threads; for(int n = 0; n < NumThreads; ++n) threads.create_thread(std::bind(&io_service::run, &svc)); server.Run(); return 0; }

2 1

Using boost with cray c++
by avib369 . 11 Jul '13

11 Jul '13

Does any one have any experience of using boost with cray C++ compiler ? Are any known problematic areas/issues ? Ok I know its not in the official list of supported compilers, but neither is the HPUX acc, which seems to work fine for most libs. Any help appreciated . Ta, Avi

2 1

[Boost.Log] Some few newbee questions
by Ovanes Markarian 10 Jul '13

10 Jul '13

Hi *, Thanks for the really great logging library. Just used it a bit and was amazed how useful and easy to use it was. As I start using it more and more I have some questions... 1. In my application I would like to start with the trivial logger and extend this logger with more options, i.e. attributes etc. Currently I see the following input when doing a trace: [2013-07-03 22:17:32.462265] [0x76f73180] [trace] thread_pool: creating 1 threads[2013-07-03 22:17:32.462303] [0x76f73180] [trace] thread_pool: created thread number: 1[2013-07-03 22:17:32.462312] [0x76f73180] [trace] thread_pool: all threads started[2013-07-03 22:17:32.462320] [0x76f73180] [trace] thread_pool: constructor finished My question is what is the second attribute? Thread id? As my code runs on a 64bit machine, that does not seem to be an address... 2. Is it possible to use a scoped logging with the trivial logger? I tried to do it as described in the example but see not output. How can I produce the output from the scoped logger? 3. In my example I wrote thread_pool prefix before each log entry. Can I do it automatically? How would I go on if I only have trivial logging? May be I misunderstand some concepts, like how to use multiple loggers and connect them with each other? Any help is very appreciated. Thanks, Ovanes

2 2

Re: [Boost-users] Mutex synchronised wrapper class for boost::interprocess vector of strings
by Riskybiz 09 Jul '13

09 Jul '13

"It's not an easy task. You should catch the exception and then notify all connected processes that should disconnected from the segment (as only offline growing is supported). After that a process can call "grow" to try extend the segment. Then, all processes can attach to the newly grown segment. Think of that as a complex binary file that must be extended and internal structures changed. All users should close the file, the file should be changed by a process and then all users can start using the file again." OK Ion, thank you for that, I see.... 1. Can I ask what mechanism you would suggest for notifying the other processes to disconnect before the grow() operation? 2. Considering how to deal with the issue of dynamically growing a shared memory vector where there is one producer process and several consumers; I hit upon the notion of having the producer process use a std::vector to conventionally store data and then using a boost shared memory segment to store a pointer to the std::vector. Consumer processes would access the boost shared memory to retrieve the pointer value thus enabling access to the std::vector data store in the producer process. This, I hoped, might remove the complexities associated with dynamically growing a shared memory segment? The big question is: would it work? Would this be a valid means of interprocess communication? Or fraught with complexities? Thanks, Riskybiz.

2 1

[msm] interrupt_state with more then one event that ends interrupt?
by Alexander Mingalev 09 Jul '13

09 Jul '13

Hi, Subj, Is that possible? for example, one event continues processing, the another one finishes the whole state-machine (some clean-up actions etc). I tried struct Interrupt : public msmf::interrupt_state< boost::mpl::vector<Foo, Bar> > {}; and struct Interrupt : public msmf::interrupt_state< msmf::ActionSequence_< boost::mpl::vector<Foo, Bar> > > {}; - has no effect. Is there another way to achieve this?

3 5

[msm] interrupt_state with more then one event that ends interrupt?
by Sam Fisher 09 Jul '13

09 Jul '13

Hi, Subj, Is that possible? for example, one event continues processing, the another one finishes the whole state-machine (some clean-up actions etc). I tried struct Interrupt : public msmf::interrupt_state< boost::mpl::vector<Foo, Bar> > {}; and struct Interrupt : public msmf::interrupt_state< msmf::ActionSequence_< boost::mpl::vector<Foo, Bar> > > {}; - has no effect. Is there another way to achieve this?

1 1

Boost.MultiIndex template substitution failure?
by fredbaba 08 Jul '13

08 Jul '13

I'm attempting to use boost::multi_index_container and it seems to be choking on the template metaprogramming magic somewhere. I'm getting a massive error dump ending in: /opt/local/include/boost/multi_index/hashed_index.hpp:743:9: error: ‘class boost::multi_index::detail::hashed_index, boost::hash, std::equal_to, boost::multi_index::detail::nth_layer<1, boost::intrusive_ptr, boost::multi_index::indexed_by >, boost::multi_index::ordered_non_unique, &md::Order::px> > >, std::allocator > >, boost::mpl::vector0, boost::multi_index::detail::hashed_unique_tag>’ has no member named ‘final_delete_node_’ this->final_delete_node_( I'm using Boost 1.53 (MacPorts) on Mac OS X.8 Mountain Lion. How do I get the following code to compile? Thanks. p.s. I originally posted this question on StackOverflow <http://stackoverflow.com/questions/17536227/boost-multiindex-template-subst…> but thought this might be a better forum. Sorry for the cross-post... #include <boost/multi_index_container.hpp> #include <boost/multi_index/hashed_index.hpp> #include <boost/multi_index/mem_fun.hpp> #include "Product.hpp" #include <iostream> int main(int argc, char* argv[]) { boost::multi_index_container< boost::intrusive_ptr<Product>, boost::multi_index::indexed_by< boost::multi_index::hashed_unique< boost::multi_index::const_mem_fun< Product, id_t, static_cast<id_t (Product::*)() const>(&Product::id) > >, boost::multi_index::ordered_non_unique< boost::multi_index::const_mem_fun< Product, price_t, static_cast<price_t (Product::*)() const>(&Product::price) > > > > cont; auto o = boost::intrusive_ptr<Product>(new Product()); o->id(1).price(price_t(14.75)); cont.insert(o); auto it = cont.get<1>().find(price_t(14.75)); if (it!=cont.get<1>().end()) std::cout << *(it); return 0; } -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-MultiIndex-template-substitution-f… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Incorrect result from mcgregor_common_subgraphs. Where can I find more example of this MCS solver?
by dante0125 08 Jul '13

08 Jul '13

Hi, I am a beginner with BGL. Currently I am using mcgregor_common_subgraphs solver to find all the common subgraphs between two graphs. The following link is the only one example showing how to use the library that I can find from the Internet. http://svn.kulitorum.com/RepSnapper/Libraries/Boost1.40/libs/graph/example/… My first question is where can I find more example of this MCS solver? My second question is why some times it can not find maximum common subgraph. By maximum I mean a common subgraph with largest number of vertices which is implemented in the code. Here I provide an example. This code is modified from mcgregor_subgraphs_example, I change the graph to undirected graph and add some vetices and edges. It is obvious that the correct answer should be of size 9. The answer return by the code missing edge 8-5 and 8-3. //======================================================================= // Copyright 2009 Trustees of Indiana University. // Authors: Michael Hansen // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= #include <fstream> #include <iostream> #include <string> #include <boost/lexical_cast.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/filtered_graph.hpp> #include <boost/graph/graph_utility.hpp> #include <boost/graph/iteration_macros.hpp> #include <boost/graph/mcgregor_common_subgraphs.hpp> #include <boost/property_map/shared_array_property_map.hpp> using namespace boost; // Callback that looks for the first common subgraph whose size // matches the user's preference. template <typename Graph> struct example_callback { typedef typename graph_traits<Graph>::vertices_size_type VertexSizeFirst; example_callback(const Graph& graph1) : m_graph1(graph1) { } template <typename CorrespondenceMapFirstToSecond, typename CorrespondenceMapSecondToFirst> bool operator()(CorrespondenceMapFirstToSecond correspondence_map_1_to_2, CorrespondenceMapSecondToFirst correspondence_map_2_to_1, VertexSizeFirst subgraph_size) { // Fill membership map for first graph typedef typename property_map<Graph, vertex_index_t>::type VertexIndexMap; typedef shared_array_property_map<bool, VertexIndexMap> MembershipMap; MembershipMap membership_map1(num_vertices(m_graph1), get(vertex_index, m_graph1)); fill_membership_map<Graph>(m_graph1, correspondence_map_1_to_2, membership_map1); // Generate filtered graphs using membership map typedef typename membership_filtered_graph_traits<Graph, MembershipMap>::graph_type MembershipFilteredGraph; MembershipFilteredGraph subgraph1 = make_membership_filtered_graph(m_graph1, membership_map1); // Print the graph out to the console std::cout << "Found common subgraph (size " << subgraph_size << ")" << std::endl; print_graph(subgraph1); std::cout << std::endl; // Explore the entire space return (true); } private: const Graph& m_graph1; VertexSizeFirst m_max_subgraph_size; }; int main (int argc, char *argv[]) { // Using a vecS graph here so that we don't have to mess around with // a vertex index map; it will be implicit. typedef adjacency_list<listS, vecS, undirectedS, property<vertex_name_t, unsigned int, property<vertex_index_t, unsigned int> >, property<edge_name_t, unsigned int> > Graph; typedef graph_traits<Graph>::vertex_descriptor Vertex; typedef graph_traits<Graph>::edge_descriptor Edge; typedef property_map<Graph, vertex_name_t>::type VertexNameMap; typedef property_map<Graph, edge_name_t>::type EdgeNameMap; // Test maximum and unique variants on known graphs Graph graph_simple1, graph_simple2; example_callback<Graph> user_callback(graph_simple1); VertexNameMap vname_map_simple1 = get(vertex_name, graph_simple1); VertexNameMap vname_map_simple2 = get(vertex_name, graph_simple2); // Graph that looks like a triangle put(vname_map_simple1, add_vertex(graph_simple1), 1); put(vname_map_simple1, add_vertex(graph_simple1), 2); put(vname_map_simple1, add_vertex(graph_simple1), 3); put(vname_map_simple1, add_vertex(graph_simple1), 4); put(vname_map_simple1, add_vertex(graph_simple1), 5); put(vname_map_simple1, add_vertex(graph_simple1), 6); put(vname_map_simple1, add_vertex(graph_simple1), 7); put(vname_map_simple1, add_vertex(graph_simple1), 8); put(vname_map_simple1, add_vertex(graph_simple1), 9); add_edge(0, 1, graph_simple1); add_edge(0, 2, graph_simple1); add_edge(0, 4, graph_simple1); add_edge(1, 2, graph_simple1); add_edge(1, 3, graph_simple1); add_edge(1, 6, graph_simple1); add_edge(2, 3, graph_simple1); add_edge(2, 4, graph_simple1); add_edge(3, 5, graph_simple1); add_edge(4, 5, graph_simple1); add_edge(5, 6, graph_simple1); add_edge(7, 8, graph_simple1); add_edge(6, 7, graph_simple1); add_edge(8, 5, graph_simple1); add_edge(8, 3, graph_simple1); std::cout << "First graph:" << std::endl; print_graph(graph_simple1); std::cout << std::endl; // Triangle with an extra vertex put(vname_map_simple2, add_vertex(graph_simple2), 1); put(vname_map_simple2, add_vertex(graph_simple2), 2); put(vname_map_simple2, add_vertex(graph_simple2), 3); put(vname_map_simple2, add_vertex(graph_simple2), 4); put(vname_map_simple2, add_vertex(graph_simple2), 5); put(vname_map_simple2, add_vertex(graph_simple2), 6); put(vname_map_simple2, add_vertex(graph_simple2), 7); put(vname_map_simple2, add_vertex(graph_simple2), 8); put(vname_map_simple2, add_vertex(graph_simple2), 9); add_edge(0, 1, graph_simple2); add_edge(0, 2, graph_simple2); add_edge(0, 4, graph_simple2); add_edge(1, 2, graph_simple2); add_edge(1, 5, graph_simple2); add_edge(2, 4, graph_simple2); add_edge(3, 5, graph_simple2); add_edge(3, 6, graph_simple2); add_edge(7, 8, graph_simple2); add_edge(1, 6, graph_simple2); add_edge(6, 7, graph_simple2); add_edge(8, 5, graph_simple2); add_edge(8, 3, graph_simple2); std::cout << "Second graph:" << std::endl; print_graph(graph_simple2); std::cout << std::endl; // Maximum subgraphs // Maximum, unique subgraphs std::cout << "mcgregor_common_subgraphs_unique:" << std::endl; mcgregor_common_subgraphs_unique (graph_simple1, graph_simple2, true, user_callback, vertices_equivalent(make_property_map_equivalent(vname_map_simple1, vname_map_simple2))); std::cin.get(); return 0; } -- View this message in context: http://boost.2283326.n4.nabble.com/Incorrect-result-from-mcgregor-common-su… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2