- Boost-users - lists.boost.org

Asio streambuf
by James Barlow-Bignell 05 Feb '12

05 Feb '12

Hiya, Does anyone know a way of reading from an asio::streambuf without removing the bytes? I'm using async_read() to get (possibly several) TCP messages, where each message is prefixed with a size field. If I can read the size without removing it from the buffer, I can check whether all the data was received and leave the size intact for the next handler if not. Any advice appreciated. Cheers, James

2 2

[program_options] Limited multitoken
by Bradley Jensen 04 Feb '12

04 Feb '12

Hello, I'm working on a personal project. Everything works using my own options processing function, but I am having a hard time implementing one specific aspect of my option processing code using the Boost program_options library. My program has a flag (-j) which takes in two doubles as arguments. Currently, I can invoke my program like so: ./foo -j 1.0 2.0 3 where 3 is treated like a positional. Because the -j option must consume several tokens, it seemed natural that I should use multitoken, like so: vector<double> v; po::options_description desc("Allowed options"); desc.add_options() ("jingle,j", po::value<vector<double> >(&v)->multitoken(), "Test thing"); But this causes positional arguments to get eaten up and added to v when -j is the last flag option. So, in my example, v would contain 1.0, 2.0, and 3.0. I suppose I am looking for some way to indicate that the -j flag consumes exactly two tokens. I've looked over the documentation on the Boost website, but I couldn't find anything about this. Any help would be greatly appreciated. Thanks, -Brad

3 2

Re: [Boost-users] Filtered graph losing original property
by giridhar 04 Feb '12

04 Feb '12

> Hello All, > > ????? I have a Graph with 3 children (sub graphs). After I filter > certain edges of the main graph, I can't access the children. Is there > any turn around to work this. >>What do you mean "children"? How are they represented by properties. typedef subgraph< adjacency_list<vecS, vecS, undirectedS, Vertexp, property< edge_index_t, unsigned int, Edgep > > > Graph; This is the property of every graph even the main graph and children. I am creating children like this: Graph g; // main graph //graph children Graph& g1=g.create_subgraph(); Graph& g2=g.create_subgraph(); Graph& g3=g.create_subgraph(); > I want some edges to be filtered from the total graph, but still the > filtered graph should retain its original children (with filtered edges > ofcourse). Any information on this would be great help to me. That is the way that properties are supposed to work in filtered_graphs. When I filter these graphs using the predicate, I can access the edges and vertices (as if it is a whole single graph) from filtered graph. But somehow filtered graph is forgetting that it is made of 3 subgraphs, i.e, I cannot access children of filtered graph . For example consider G is the filtered graph, I cannot access children through iterators. tie(c1,c2)= G.children(); -- Jeremiah Willcock ------------------------------ -- Regards, Giridhar

2 1

Filtered graph losing original property
by giridhar 04 Feb '12

04 Feb '12

Hello All, I have a Graph with 3 children (sub graphs). After I filter certain edges of the main graph, I can't access the children. Is there any turn around to work this. I want some edges to be filtered from the total graph, but still the filtered graph should retain its original children (with filtered edges ofcourse). Any information on this would be great help to me. -- Regards, Giridhar

2 1

FTP class
by Christer Borgqvist 04 Feb '12

04 Feb '12

Hello all, I try again in this thread i do like this case CMD_PASV: { std::string out = "227 Entering Passive Mode (" + sip + ")\r\n"; m_data_con = data_connection_ptr(new axftp::server::data_connection(port)); m_thread = boost::thread(boost::bind(&axftp::server::data_connection::start, m_data_con)); boost::asio::write(*_sock, boost::asio::buffer(out, out.size()), e); } break; class data_connection is like this data_connection::data_connection(size_t port) : _port(port) { } void data_connection::start() { boost::asio::io_service io_service; boost::asio::ip::tcp::endpoint endpoint(boost::asio::ip::tcp::v4(), _port); boost::asio::ip::tcp::acceptor acceptor(io_service, endpoint); boost::asio::ip::tcp::socket socket(io_service); acceptor.accept(socket); // std::string message("Hello from server\n"); boost::asio::write(socket, boost::asio::buffer(message)); socket.close(); . } Never got a connection to the data_connection nothing happends in th acceptor.accept (socket) what do i do wrong appreciate any help Thanks Christer

1 0

boost::transitive_closure() and “error: no matching function for call to ‘vertices(const std::vector<std::vector<long unsigned int>…”
by Jacob Lidman 04 Feb '12

04 Feb '12

Hi, I posted a question regarding an error I've received with boost::transitive_closure() to stackoverflow (http://stackoverflow.com/questions/8976812/boosttransitive-closure-and-erro…) Since I didn't receive any comments I'm now trying this mailing list. In short I'm getting an error about a missing function when I'm trying to compute the transitive closure. The code in question is ... ------------- 1: #include <boost/graph/vector_as_graph.hpp> 2: #include <boost/graph/adjacency_list.hpp> 3: #include <boost/graph/transitive_closure.hpp> 10: boost::adjacency_list<boost::setS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_name_t, ContainerStruct *> > gTC, g = create_CSgraph(); 11: boost::transitive_closure(g, gTC); ------------- ... where "ContainerStruct" is a structure for holding various data and create_CSgraph() is a function for initializing a graph object. The error I'm getting is... ------------- /home/lidman/boost_1_48_0/BUILD/include/boost/graph/depth_first_search.hpp: In function ‘void boost::depth_first_search(const VertexListGraph&, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = std::vector<std::vector<long unsigned int, std::allocator<long unsigned int> >, std::allocator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >, P = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >, T = boost::graph_visitor_t, R = boost::bgl_named_params<boost::typed_identity_property_map<long unsigned int>, boost::vertex_index_t, boost::no_property>]’: /home/lidman/boost_1_48_0/BUILD/include/boost/graph/topological_sort.hpp:65: instantiated from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = std::vector<std::vector<long unsigned int, std::allocator<long unsigned int> >, std::allocator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >, OutputIterator = std::back_insert_iterator<std::vector<long unsigned int, std::allocator<long unsigned int> > >, P = boost::typed_identity_property_map<long unsigned int>, T = boost::vertex_index_t, R = boost::no_property]’ /home/lidman/boost_1_48_0/BUILD/include/boost/graph/transitive_closure.hpp:120: instantiated from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, GraphTC = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, G_to_TC_VertexMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, long unsigned int>]’ /home/lidman/boost_1_48_0/BUILD/include/boost/graph/transitive_closure.hpp:263: instantiated from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = CFG, GraphTC = CFG]’ test.C:11: instantiated from here /home/lidman/boost_1_48_0/BUILD/include/boost/graph/depth_first_search.hpp:291: error: no matching function for call to ‘vertices(const std::vector<std::vector<long unsigned int, std::allocator<long unsigned int> >, std::allocator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >&)’ /home/lidman/boost_1_48_0/BUILD/include/boost/graph/topological_sort.hpp:65: instantiated from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = std::vector<std::vector<long unsigned int, std::allocator<long unsigned int> >, std::allocator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >, OutputIterator = std::back_insert_iterator<std::vector<long unsigned int, std::allocator<long unsigned int> > >, P = boost::typed_identity_property_map<long unsigned int>, T = boost::vertex_index_t, R = boost::no_property]’ /home/lidman/boost_1_48_0/BUILD/include/boost/graph/transitive_closure.hpp:120: instantiated from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, GraphTC = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, G_to_TC_VertexMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, long unsigned int>]’ /home/lidman/boost_1_48_0/BUILD/include/boost/graph/transitive_closure.hpp:263: instantiated from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = CFG, GraphTC = CFG]’ test.C:11: instantiated from here /home/lidman/boost_1_48_0/BUILD/include/boost/graph/depth_first_search.hpp:297: error: no matching function for call to ‘vertices(const std::vector<std::vector<long unsigned int, std::allocator<long unsigned int> >, std::allocator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >&)’ /home/lidman/boost_1_48_0/BUILD/include/boost/graph/named_function_params.hpp: In static member function ‘static boost::shared_array_property_map<Value, typename boost::remove_const<typename boost::detail::override_const_property_t<typename boost::parameter::value_type<ArgPack, boost::graph::keywords::tag::vertex_index_map, int>::type, boost::vertex_index_t, Graph, boost::detail::parameter_exists<ArgPack,boost::graph::keywords::tag::vertex_index_map>::value>::result_type>::type> boost::detail::map_maker_helper<false, Graph, ArgPack, Value, PM>::make_map(const Graph&, Value, const PM&, const ArgPack&) [with Graph = std::vector<std::vector<long unsigned int, std::allocator<long unsigned int> >, std::allocator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >, ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list> >, Value = boost::default_color_type, PM = int]’: /home/lidman/boost_1_48_0/BUILD/include/boost/graph/named_function_params.hpp:520: instantiated from ‘static typename boost::detail::map_maker_helper<boost::detail::map_maker<Graph, ArgPack, MapTag, ValueType>::has_map, Graph, ArgPack, ValueType, typename boost::remove_const<typename boost::parameter::value_type<ArgPack, MapTag, int>::type>::type>::map_type boost::detail::map_maker<Graph, ArgPack, MapTag, ValueType>::make_map(const Graph&, const ArgPack&, ValueType) [with Graph = std::vector<std::vector<long unsigned int, std::allocator<long unsigned int> >, std::allocator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >, ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list> >, MapTag = boost::graph::keywords::tag::color_map, ValueType = boost::default_color_type]’ /home/lidman/boost_1_48_0/BUILD/include/boost/graph/named_function_params.hpp:535: instantiated from ‘typename boost::detail::map_maker<Graph, ArgPack, MapTag, ValueType>::map_type boost::detail::make_property_map_from_arg_pack_gen<MapTag, ValueType>::operator()(const Graph&, const ArgPack&) const [with Graph = std::vector<std::vector<long unsigned int, std::allocator<long unsigned int> >, std::allocator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >, ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list> >, MapTag = boost::graph::keywords::tag::color_map, ValueType = boost::default_color_type]’ /home/lidman/boost_1_48_0/BUILD/include/boost/graph/depth_first_search.hpp:297: instantiated from ‘void boost::depth_first_search(const VertexListGraph&, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = std::vector<std::vector<long unsigned int, std::allocator<long unsigned int> >, std::allocator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >, P = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >, T = boost::graph_visitor_t, R = boost::bgl_named_params<boost::typed_identity_property_map<long unsigned int>, boost::vertex_index_t, boost::no_property>]’ /home/lidman/boost_1_48_0/BUILD/include/boost/graph/topological_sort.hpp:65: instantiated from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params<P, T, R>&) [with VertexListGraph = std::vector<std::vector<long unsigned int, std::allocator<long unsigned int> >, std::allocator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >, OutputIterator = std::back_insert_iterator<std::vector<long unsigned int, std::allocator<long unsigned int> > >, P = boost::typed_identity_property_map<long unsigned int>, T = boost::vertex_index_t, R = boost::no_property]’ /home/lidman/boost_1_48_0/BUILD/include/boost/graph/transitive_closure.hpp:120: instantiated from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, GraphTC = boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, G_to_TC_VertexMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, ContainerStruct*, boost::no_property>, long unsigned int>]’ /home/lidman/boost_1_48_0/BUILD/include/boost/graph/transitive_closure.hpp:263: instantiated from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = CFG, GraphTC = CFG]’ test.C:11: instantiated from here /home/lidman/boost_1_48_0/BUILD/include/boost/graph/named_function_params.hpp:499: error: no matching function for call to ‘num_vertices(const std::vector<std::vector<long unsigned int, std::allocator<long unsigned int> >, std::allocator<std::vector<long unsigned int, std::allocator<long unsigned int> > > >&)’ ------------- From this page (http://boost.2283326.n4.nabble.com/Problem-in-using-Transitive-closure-on-L…) I learned that including "boost/graph/vector_as_graph.hpp" before "boost/graph/transitive_closure.hpp" might do the trick. Unfortunately that doesn't seem to help me. For completeness I'm using GCC 4.1.2 20080704 (Red Hat 4.1.2-51) and Boost 1.48.0 on a x86_64 linux machine. GCC 4.5.0 seems to give me the same error message. Is there a newer workaround for this problem? Best regards, Jacob Lidman

2 1

msvc linker wants to prepend "lib" to library names
by Andy Falanga (afalanga) 03 Feb '12

03 Feb '12

Hi everyone, I'm working through an issue which no longer seems to be unique to me. I've found several instances of people having this same issue. As the subject suggests, I'm in a situation where the msvc linker is prepending "lib" to the referenced boost library (in this case, regex) for the project. However, the interesting thing is, it's not happening for me, only for others on my team. On my dev box, the project builds just fine. To the best of my knowledge, I have pushed up all required changes (I added the need for regex with some changes I put in place) to the Team Foundation Server. However, when my colleagues checkout the latest revision of this new solution, they are unable to build because of this. The simple question is, why is this happening? I'd like to understand what's going on rather than simply being told how to fix it. From the many hits I've looked through, I've tried a couple of things but they do not seem to fix the problem. I found a link that said the problem is because I needed to additionally link with comsupp.lib (I found an article on MS that instructs to link with comsuppw.lib or comsuppdw.lib instead) to which I tried, but that hasn't fixed the issue. I found another that suggested I define the macro BOOST_ALL_DYN_LINK in the source code, but this hasn't helped either. Our environment is that we've installed boost 1.47 via the installer from boost-pro. The solution has all appropriate directories mapped (include and library directories). Are there property settings in my project that I should look for? I've been able to glean that this problem has something to do with static vs. dynamic linking. Should I check in my linker options for something? I have done that extensively already, but I'm not a strong MS developer and could have easily missed something. Thanks, Andy

3 4

[Dynamic Bitset][Boost 1.44.0] Compilation error.
by mik 03 Feb '12

03 Feb '12

I'm using the dynamic biset in a project, but when I compile my code in debug with Visual Studio 2008, I get this error: C:\REPOSI~1\Boost\BOOST_~2\boost/dynamic_bitset/dynamic_bitset.hpp(1727) : error C2668: '_wassert' : ambiguous call to overloaded function C:\Program Files\Microsoft Visual Studio 9.0\VC\INCLUDE\assert.h(28): could be 'void _wassert(const wchar_t *,const wchar_t *,unsigned int)' C:\Program Files\Microsoft Visual Studio 9.0\VC\INCLUDE\assert.h(28): or 'void `anonymous-namespace'::_wassert(const wchar_t *,const wchar_t *,unsigned int)' while trying to match the argument list '(const wchar_t [44], const wchar_t [67], int)' The only solution that I found is to comment the line. Do you have a better one? Thank you in advance. Mirko **

1 0

boost thread: ‘internal_mutex’ was not declared in this scope
by Thijs (M.A.) van den Berg 03 Feb '12

03 Feb '12

I' stuck with this strange issue with boost thread 1.48 when compiling this minimal example: #include <boost/thread/thread.hpp> int main() { retun 0; } with gcc -v Using built-in specs. Target: x86_64-linux-gnu Configured with: ../src/configure -v --with-pkgversion='Debian 4.4.5-8' --with-bugurl=file:///usr/share/doc/gcc-4.4/README.Bugs --enable-languages=c,c++,fortran,objc,obj-c++ --prefix=/usr --program-suffix=-4.4 --enable-shared --enable-multiarch --enable-linker-build-id --with-system-zlib --libexecdir=/usr/lib --without-included-gettext --enable-threads=posix --with-gxx-include-dir=/usr/include/c++/4.4 --libdir=/usr/lib --enable-nls --enable-clocale=gnu --enable-libstdcxx-debug --enable-objc-gc --with-arch-32=i586 --with-tune=generic --enable-checking=release --build=x86_64-linux-gnu --host=x86_64-linux-gnu --target=x86_64-linux-gnu Thread model: posix I get this error, .. I can't find anything via google… /usr/local/include/boost/thread/pthread/condition_variable.hpp: In member function ‘void boost::condition_variable::wait(boost::unique_lock<boost::mutex>&)’: /usr/local/include/boost/thread/pthread/condition_variable.hpp:53: error: ‘internal_mutex’ was not declared in this scope

1 0

Boost with C code.. please help...
by Kamalkishor 02 Feb '12

02 Feb '12

Hello, I am very new to Boost. I have to write unit test cases in order to increase the code coverage of a C source code. I am not getting the approach to start writing the test cases. As it is a code C code, there are huge number of functions, one calling the other, and a lot of global variables. Can anyone please help me out to get the approach to start writing Unit test cases. And, I have used a "c++" compiler for compiling small Boost programs. I am getting error while using "GCC" compiler. Can we use GCC compiler for compiling Boost program? How can we do this? Please help me out. Thanks in advance. Thanks, Kamalkishor.

3 2