April 2013 - Boost-users - lists.boost.org

Error messages during configuration checks
by Braden McDaniel 11 Apr '13

11 Apr '13

I'm seeing these error messages interspersed with the normal output of the Boost build's configuration checks: > Performing configuration checks > - x86 : yes > has_icu_test.cpp > libs\regex\build\has_icu_test.cpp(12) : fatal error C1083: Cannot open include file: 'unicode/uversion.h': No such file or directory > - has_icu builds : no > warning: Graph library does not contain MPI-based parallel components. > note: to enable them, add "using mpi ;" to your user-config.jam > has_iconv.cpp > libs\locale\src\..\build\has_iconv.cpp(8) : fatal error C1083: Cannot open include file: 'iconv.h': No such file or directory > - iconv (libc) : no > has_iconv.cpp > libs\locale\src\..\build\has_iconv.cpp(8) : fatal error C1083: Cannot open include file: 'iconv.h': No such file or directory > - iconv (separate) : no > has_icu_test.cpp > libs\locale\src\..\build\has_icu_test.cpp(12) : fatal error C1083: Cannot open include file: 'unicode/uversion.h': No such file or directory > - icu : no > has_icu_test.cpp > libs\locale\src\..\build\has_icu_test.cpp(12) : fatal error C1083: Cannot open include file: 'unicode/uversion.h': No such file or directory > - icu (lib64) : no > has_gcc_visibility.cpp > libs\math\config\has_gcc_visibility.cpp(7) : fatal error C1189: #error : "This is a GCC specific test case". > - gcc visibility : no > - long double support : yes I don't recall seeing these when building Boost previously (using the same compiler, Visual C++ 2008); though it's possible I'm misremembering and they're just sticking out more now. What I have started doing differently is that I'm now calling b2 from a CMake script (via execute_process); but if that's what's triggering this, I don't understand how. Has anyone here seen this before? How might these error messages be suppressed? -- Braden McDaniel braden(a)endoframe.com

2 2

ASIO file monitoring help
by SRD 11 Apr '13

11 Apr '13

I'm using an ASIO extention that was suggested for file monitoring. I've added this to my project and though I see a change when I add a file to the directory being monitored, I see no futher changes thereafter. Can anyone offer some insight as to how this should work? Any help much appreciated. void create_file_handler(const boost::system:error_code &ec, const boost::asio::dir_monitor_event &ev) { cout << "file name: " << ev.filename << endl; cout << " type : " << ev.type << endl; // now edit file ... } // from within main() boost::thread t; { boost::asio::io_service io_service; boost::asio::dir_monitor dm(io_service); dm.add_directory("C:\\Users\\SRD\\DirA"); boost::asio::dir_monitor_event ev = dm.monitor(); dm.async_monitor(create_file_handler); t = boost::thread(boost::bind(&boost::asio::io_service::run, boost::refio_service))); boost::system_time time = boost::get_system_time(); time += boost::posix_time::time_duration(0, 0, 1); boost::thread::sleep(time); } t.join(); io_service.reset(); // now do app stuff ..

3 2

How is the proactor pattern of boost.asio implemented in linux?
by Journeyer J. Joh 11 Apr '13

11 Apr '13

Hi list, I am wondering about boost.asio. Boost.asio must have a proactor implementation on Linux, I guess. How does the proactor of boost.asio work? Does it use epoll? Is it edge-triggered? What about real-time signal? Doesn't boost.asio use real-time signal on Linux? What is the recommended implementation of boost.asio for asynchronous and non-blocking overlapped IO on Linux? Thank you in advance! ---------------------------------------- Journeyer J. Joh o o s a p r o g r a m m e r a t g m a i l d o t c o m ----------------------------------------

1 0

[BGL] Error using breadth_first_search with labeled_graph
by Julio Cezar Novais Raffaine 10 Apr '13

10 Apr '13

Hi, I'm having the above (end of email) error message when compiling my source using breadth_first_search in a labeled_graph, here are some of my definitions: I'm using boost 1.51.0. struct VertexProperty { string x; }; typedef boost::property<boost::edge_weight_t, double> IndexProperty; typedef boost::labeled_graph< boost::adjacency_list<boost::vecS, boost::setS, boost::bidirectionalS, VertexProperty, IndexProperty>, std::string> GraphT; I also created the following visitor: class recurrence_bfs_visitor : public boost::default_bfs_visitor { public: GraphT::vertex_descriptor check_node; recurrence_bfs_visitor(GraphT::vertex_descriptor node) : boost::default_bfs_visitor(), check_node(node) {} template < typename Vertex, typename Graph > void discover_vertex(Vertex u, const Graph & g) const { if( u == check_node ) throw std::runtime_error(""); } }; Then I call my functions in this way: auto v1 = g.vertex(e1); auto v2 = g.vertex(e2); recurrence_bfs_visitor vis(v2); boost::breadth_first_search(g.graph(), v1, boost::visitor(vis)); Where g is my GraphT and e1,e2 are strings that I receive as parameters. Here are the error message: 1>d:\projects\cprojects\boost_1_51_0\boost\graph\detail\adjacency_list.hpp(2499): error C2039: 'type' : is not a member of 'boost::property_value<PropertyList,Tag>' 1> with 1> [ 1> PropertyList=VertexProperty, 1> Tag=boost::vertex_index_t 1> ] 1> d:\projects\cprojects\boost_1_51_0\boost\graph\detail\adjacency_list.hpp(2576) : see reference to class template instantiation 'boost::adj_list_any_vertex_pa::bind_<Tag,Graph,Property>' being compiled 1> with 1> [ 1> Tag=boost::vertex_index_t, 1> Graph=boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>, 1> Property=VertexProperty 1> ] 1> d:\projects\cprojects\boost_1_51_0\boost\graph\detail\adjacency_list.hpp(2709) : see reference to class template instantiation 'boost::detail::adj_list_choose_vertex_pa<Tag,Graph,Property>' being compiled 1> with 1> [ 1> Tag=boost::vertex_index_t, 1> Graph=boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>, 1> Property=VertexProperty 1> ] 1> d:\projects\cprojects\boost_1_51_0\boost\graph\properties.hpp(224) : see reference to class template instantiation 'boost::adj_list_vertex_property_selector::bind_<Graph,Property,Tag>' being compiled 1> with 1> [ 1> Graph=boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>, 1> Property=VertexProperty, 1> Tag=boost::vertex_index_t 1> ] 1> d:\projects\cprojects\boost_1_51_0\boost\graph\properties.hpp(233) : see reference to class template instantiation 'boost::detail::vertex_property_map<Graph,PropertyTag>' being compiled 1> with 1> [ 1> Graph=boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>, 1> PropertyTag=boost::vertex_index_t 1> ] 1> d:\projects\cprojects\boost_1_51_0\boost\graph\named_function_params.hpp(259) : see reference to class template instantiation 'boost::property_map<Graph,Property>' being compiled 1> with 1> [ 1> Graph=boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>, 1> Property=boost::vertex_index_t 1> ] 1> d:\projects\cprojects\boost_1_51_0\boost\mpl\eval_if.hpp(41) : see reference to class template instantiation 'boost::detail::const_type_as_type<T>' being compiled 1> with 1> [ 1> T=boost::property_map<boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>,boost::vertex_index_t> 1> ] 1> d:\projects\cprojects\boost_1_51_0\boost\mpl\eval_if.hpp(41) : see reference to class template instantiation 'boost::mpl::eval_if<C,F1,F2>' being compiled 1> with 1> [ 1> C=boost::mpl::true_, 1> F1=boost::detail::const_type_as_type<boost::property_map<boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>,boost::vertex_index_t>>, 1> F2=boost::property_map<boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>,boost::vertex_index_t> 1> ] 1> d:\projects\cprojects\boost_1_51_0\boost\graph\named_function_params.hpp(274) : see reference to class template instantiation 'boost::mpl::eval_if<C,F1,F2>' being compiled 1> with 1> [ 1> C=boost::is_same<boost::param_not_found,boost::param_not_found>, 1> F1=boost::mpl::eval_if<boost::mpl::true_,boost::detail::const_type_as_type<boost::property_map<boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>,boost::vertex_index_t>>,boost::property_map<boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>,boost::vertex_index_t>>, 1> F2=boost::mpl::identity<boost::param_not_found> 1> ] 1> d:\projects\cprojects\boost_1_51_0\boost\graph\breadth_first_search.hpp(316) : see reference to class template instantiation 'boost::detail::choose_impl_result<GraphIsConst,Graph,Param,Tag>' being compiled 1> with 1> [ 1> GraphIsConst=boost::mpl::true_, 1> Graph=boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>, 1> Param=boost::param_not_found, 1> Tag=boost::vertex_index_t 1> ] 1> d:\projects\cprojects\boost_1_51_0\boost\graph\breadth_first_search.hpp(340) : see reference to function template instantiation 'void boost::detail::bfs_dispatch<boost::param_not_found>::apply<VertexListGraph,recurrence_bfs_visitor,boost::graph_visitor_t,boost::no_property>(VertexListGraph &,void *,const boost::bgl_named_params<T,Tag,Base> &,boost::param_not_found)' being compiled 1> with 1> [ 1> VertexListGraph=boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>, 1> T=recurrence_bfs_visitor, 1> Tag=boost::graph_visitor_t, 1> Base=boost::no_property 1> ] 1> d:\novosprojetos\experiments\orcgraph\graphlib\graph.cpp(124) : see reference to function template instantiation 'void boost::breadth_first_search<boost::adjacency_list<OutEdgeListS,VertexListS,DirectedS,VertexProperty,EdgeProperty>,recurrence_bfs_visitor,boost::graph_visitor_t,boost::no_property>(const VertexListGraph &,void *,const boost::bgl_named_params<T,Tag,Base> &)' being compiled 1> with 1> [ 1> OutEdgeListS=boost::vecS, 1> VertexListS=boost::setS, 1> DirectedS=boost::bidirectionalS, 1> VertexProperty=VertexProperty, 1> EdgeProperty=IndexProperty, 1> VertexListGraph=boost::adjacency_list<boost::vecS,boost::setS,boost::bidirectionalS,VertexProperty,IndexProperty>, 1> T=recurrence_bfs_visitor, 1> Tag=boost::graph_visitor_t, 1> Base=boost::no_property 1> ] 1>d:\projects\cprojects\boost_1_51_0\boost\graph\detail\adjacency_list.hpp(2504): error C3203: 'type' : unspecialized class template can't be used as a template argument for template parameter 'ValueType', expected a real type 1>d:\projects\cprojects\boost_1_51_0\boost\graph\detail\adjacency_list.hpp(2504): error C2955: 'boost::type' : use of class template requires template argument list 1> d:\projects\cprojects\boost_1_51_0\boost\type.hpp(14) : see declaration of 'boost::type' 1> d:\projects\cprojects\boost_1_51_0\boost\type.hpp(14) : see declaration of 'boost::type' 1>d:\projects\cprojects\boost_1_51_0\boost\graph\detail\adjacency_list.hpp(2506): error C3203: 'type' : unspecialized class template can't be used as a template argument for template parameter 'ValueType', expected a real type 1>d:\projects\cprojects\boost_1_51_0\boost\graph\detail\adjacency_list.hpp(2506): error C2955: 'boost::type' : use of class template requires template argument list 1> d:\projects\cprojects\boost_1_51_0\boost\type.hpp(14) : see declaration of 'boost::type' 1> d:\projects\cprojects\boost_1_51_0\boost\type.hpp(14) : see declaration of 'boost::type' 1>d:\projects\cprojects\boost_1_51_0\boost\graph\breadth_first_search.hpp(316): error C2893: Failed to specialize function template 'boost::two_bit_color_map<IndexMap> boost::make_two_bit_color_map(size_t,const IndexMap &)' 1> With the following template arguments: 1> 'boost::adj_list_vertex_property_map' -- Julio Cezar Novais Raffaine Sistemas de Engenharia, Odebrecht SA São Paulo, SP http://elloxas.blogspot.com/

2 2

[multiprecision] radix-2
by Lucas Sousa de Oliveira 10 Apr '13

10 Apr '13

Hey guys, I'm considering participating in this year's GSoC 2013 with Boost. I think the multiprecision problem is very interesting and I'll give my best to implement it But first, what would you think is the challenge here? What would make this problem very complex? I'm studying the general radix algorithm and it doesn't seem to be that bad. Am I being misled? All the best, -- Lucas Oliveira

2 1

Re: [Boost-users] ASIO with std::thread
by Marat Abrarov 10 Apr '13

10 Apr '13

> Are there any implications of using std::thread and std::future, etc. with > boost.asio (instead of boost.thread, etc.)? I'd be thankful if you could > provide me the answer in detail and give me helpful pointers to online > links and provide examples. Specifically, I'm very interested in using > std::future and promise with std::thread but I want future with ASIO based > sockets. > > In addition, it'd be just great if you could also provide me an example of > using boost's chrono based stead clock for setting up interval timers to, > for example, get an event after every 10 seconds. As short example: #if defined(WIN32) #include <tchar.h> #include <windows.h> #endif #include <cstdlib> #include <cstddef> #include <utility> #include <iostream> #include <exception> #include <thread> #include <future> #include <vector> #include <memory> #include <algorithm> #include <functional> #include <boost/asio.hpp> #include <boost/optional.hpp> #include <boost/utility/in_place_factory.hpp> namespace ma { namespace test { namespace asio_future { class connect_task { public: typedef boost::system::error_code result; typedef std::future<result> future; private: typedef connect_task this_type; typedef std::promise<result> promise; this_type& operator=(const this_type&); public: connect_task() : promise_(std::make_shared<promise>()) { } connect_task(const this_type& other) : promise_(other.promise_) { } connect_task(this_type&& other) : promise_(std::move(other.promise_)) { } void operator()(const boost::system::error_code& error) { promise_->set_value(error); } future get_future() { return promise_->get_future(); }; private: std::shared_ptr<promise> promise_; }; // connect_task class io_task { public: typedef std::pair<boost::system::error_code, std::size_t> result; typedef std::future<result> future; private: typedef io_task this_type; typedef std::promise<result> promise; this_type& operator=(const this_type&); public: io_task() : promise_(std::make_shared<promise>()) { } io_task(const this_type& other) : promise_(other.promise_) { } io_task(this_type&& other) : promise_(std::move(other.promise_)) { } void operator()(const boost::system::error_code& error, std::size_t bytes_transferred) { promise_->set_value(std::make_pair(error, bytes_transferred)); } future get_future() { return promise_->get_future(); }; private: std::shared_ptr<promise> promise_; }; // io_task class io_service_pool { private: typedef io_service_pool this_type; io_service_pool(const this_type&); this_type& operator=(const this_type&); public: io_service_pool(boost::asio::io_service& io_service, std::size_t size) : work_guard_(boost::in_place(std::ref(io_service))) { for (; size; --size) { threads_.emplace_back([&io_service]() { io_service.run(); }); } } ~io_service_pool() { work_guard_ = boost::none; std::for_each(threads_.begin(), threads_.end(), [](std::thread& thread) { thread.join(); }); } private: boost::optional<boost::asio::io_service::work> work_guard_; std::vector<std::thread> threads_; }; // io_service_pool void run_test() { const boost::asio::ip::tcp::endpoint endpoint( boost::asio::ip::address_v4::loopback(), 7); const std::size_t cpu_count = std::thread::hardware_concurrency(); const std::size_t io_threadpool_size = cpu_count < 2 ? 2 : cpu_count; boost::asio::io_service io_service(io_threadpool_size); io_service_pool io_threadpool(io_service, io_threadpool_size); boost::asio::ip::tcp::socket socket(io_service); { // Connect to localhost:7 connect_task handler; connect_task::future future = handler.get_future(); socket.async_connect(endpoint, std::move(handler)); if (connect_task::result result = future.get()) { std::cout << "Failed to connect: " << result << std::endl; return; } std::cout << "Connected" << std::endl; } { // Send some data const std::string data = "Hello from Boost.Asio!"; io_task handler; io_task::future future = handler.get_future(); boost::asio::async_write( socket, boost::asio::buffer(data), std::move(handler)); io_task::result result = future.get(); if (result.first) { std::cout << "Failed to send: " << result.first << std::endl; return; } std::cout << "Sent: " << data << std::endl; } } // run_test } // namespace asio_future } // namespace test } // namespace ma #if defined(WIN32) int _tmain(int /*argc*/, _TCHAR* /*argv*/[]) #else int main(int /*argc*/, char* /*argv*/[]) #endif { try { ma::test::asio_future::run_test(); return EXIT_SUCCESS; } catch (const std::exception& e) { std::cerr << "Unexpected exception: " << e.what() << std::endl; } catch (...) { std::cerr << "Unknown exception" << std::endl; } return EXIT_FAILURE; } Regards, Marat Abrarov.

1 0

How is the proactor pattern of boost.asio implemented in linux?
by Journeyer J. Joh 10 Apr '13

10 Apr '13

Hello list, In ACE and on Linux the Proactor pattern is not recommended. Instead of this, ACE_Dev_Poll_Reactor seems to be recommended. It is one of Reactor implementation. ACE_Dev_Poll_Reactor uses epoll in a level-trigger method. But, I am not sure of this information.... I just found some blog essays on internet. Now I wonder about boost.asio. boost.asio must have a proactor implementation on Linux, I guess. How does the proactor of boost.asio work? Does it use epoll? Is it edge-triggered? What about real-time signal? Doesn't boost.asio use real-time signal on Linux? What is the recommended implementation of boost.asio for asynchronous and non-blocking overlapped IO on Linux? Thank you in advance! ---------------------------------------- Journeyer J. Joh o o s a p r o g r a m m e r a t g m a i l d o t c o m ----------------------------------------

1 0

ASIO with std::thread
by asif saeed 10 Apr '13

10 Apr '13

Hi, I am a newbie to both boost.asio and std::thread and std::future and so on and am just learning and trying to develop a messaging library. Are there any implications of using std::thread and std::future, etc. with boost.asio (instead of boost.thread, etc.)? I'd be thankful if you could provide me the answer in detail and give me helpful pointers to online links and provide examples. Specifically, I'm very interested in using std::future and promise with std::thread but I want future with ASIO based sockets. In addition, it'd be just great if you could also provide me an example of using boost's chrono based stead clock for setting up interval timers to, for example, get an event after every 10 seconds. Best regards, -Asif

1 0

Efficient "[][]" operator overloading (encapsulating a MultiArray)
by Jiří Vyskočil 09 Apr '13

09 Apr '13

Hello, I need to encapsulate a 3D MultiArray inside another class "GridArray". The reason is that GridArray will have another implementation not using MultiArray and it seems much easier to provide an abstration over MultiArray, than to reimplement its interface for the other implementation. I need to keep the [][][] operator access to the structure. I created a class like this, but it is slow: template<class T> class GridArray<T,3> { public: GridArray(int x, int y, int z): _array(boost::extents[x][y][z]) { } boost::multi_array<T, 3> _array; struct SliceRef { struct ColRef { SliceRef &_parent; int _x, _y; ColRef(SliceRef &p, const int x, const int y): _parent(p), _x(x), _y(y) {} T& operator[](const int z) { return _parent._parent._array[_x][_y][z]; } }; GridArray<T,3> &_parent; int _x; SliceRef(GridArray<T,3> &p, const int x): _parent(p), _x(x) {} ColRef operator[](const int y) { return ColRef(*this,_x,y); } }; SliceRef operator[](const int x){ return SliceRef(*this,x); } }; I am unable to write a minimal test case - if I compare using multi_array directly vs. using this GridArray class in a simple test program (compiled with -O2), the performance is the same. But the real code shows about 20% slowdown - it's a numerical simulaiton, I create several arrays at the beginning and then do computations with them. The rest of the code hasn't been touched - I only chanded the constructors for the arrays and replaced a header which contained some typedefs with a header containing this class. Do you have any idea what might be going on? Is there a better way to write an interface for successive [] operators? Thanks, Jiri

4 3

message_queue memory leak in Boost::test
by John Davies 09 Apr '13

09 Apr '13

I have this simple test case: BOOST_AUTO_TEST_CASE(TestLogin) { message_queue inQueue(open_or_create, "InQueue", 100, 100); remove("InQueue"); } And Boost::test reports a memory leak: Running 1 test case... *** No errors detected Detected memory leaks! Dumping objects -> {668} normal block at 0x0039DE78, 57 bytes long. Data: <struct boost::in> 73 74 72 75 63 74 20 62 6F 6F 73 74 3A 3A 69 6E {667} normal block at 0x0039DE40, 8 bytes long. Data: <x 9 > 78 DE 39 00 00 00 00 00 Object dump complete. Press any key to continue . . . If I comment out the two lines of code there is no memory leak. Is this something I have to live with? In my real code the message_queue is alive the whole time the program is running.

3 4