March 2009 - Boost-users - lists.boost.org

Re: [Boost-users] How do i only get Regex??
by John Maddock 27 Mar '09

27 Mar '09

> I'm using VC++ 8 and I am trying to use the boost regex in order to use > regular expressions. I can get it to work, but it requires 60mb of files! > What is the simplest, smallest subset of files that I need to get this to > work. If there is a way to only have to import a dll or lib, that would > be > ideal. I would like it to be separate and standalone from the massive > file > collection that comes with boost as a whole. You can use bcp to extract a subset of Boost: http://www.boost.org/doc/libs/1_38_0/tools/bcp/bcp.html Of course your final executable will be the same size regardless of whether you extract out Boost.Regex or not :-) HTH John.

2 2

[Graph] Compilation error with MinGW and Boost 1.33.1
by Florian.PONROY＠fr.thalesgroup.com 27 Mar '09

27 Mar '09

Hi, I have the following compilation error with MinGW 3.4.5, under Linux : /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_index_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_13 edge_weight_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 buffer_param_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_18 distance_compare_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_18 distance_combine_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 distance_inf_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_15 distance_zero_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_15 graph_visitor_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): multiple definition of `_s_prop_not_found' /obj/g++mingwwin32i386_gcc3.4.5-Linux2.6.22.5-jml-051-i686/liblocd_topology_ manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_value_ endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_foundENS_14 vertex_color_tEEERKS5_RKS2_PT_T0_E16s_prop_not_found+0x0): first defined here The code compiles fine under Linux with g++ though. I use both the BGL and Dijkstra algorithm. The adjacency lists are defined this way: typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS > tGraphReachable; typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, tLinkWeight> > tGraphShortestpath; typedef tGraphReachable::vertex_descriptor tReachableVertex; typedef tGraphShortestpath::vertex_descriptor tDijkstraVertex; typedef std::vector<tDijkstraVertex> tPredecessorMap; typedef std::vector<tLinkWeight> tDistanceMap; Call to BFS is done this way: tGraphReachable graph(m_nodeList.size()); // Graph construction this->PrepareDataForComputeReachableNodes(graph); std::vector<tReachableVertex> reachableNodes; reachableNodes.reserve(m_nodeList.size()); tReachableVertex sourceVertex(boost::vertex(m_localNodeId, graph)); boost::breadth_first_search(graph, sourceVertex, boost::visitor( boost::make_bfs_visitor( boost::write_property( boost::identity_property_map(), std::back_inserter(reachableNodes), boost::on_discover_vertex())))); Call to Dijsktra: tGraphShortestpath graph; for (tLinkList::const_iterator itLink(links.begin()); links.end() != itLink; ++itLink) { boost::add_edge((*itLink)->m_sourceId, (*itLink)->m_destinationId, (*itLink)->m_weight, graph); } tDijkstraVertex sourceVertex(boost::vertex(sourceNode, graph)); tPredecessorMap predecessors(boost::num_vertices(graph)); tDistanceMap distances(boost::num_vertices(graph)); boost::dijkstra_shortest_paths(graph, sourceVertex, boost::predecessor_map(&predecessors[0]) .distance_map(&distances[0])); What did I do wrong? Thanks very much for your help. -- Florian PONROY Thales Land & Joint France Tel. : +33(0)1 41 304 363 Fax : +33(0)1 41 303 560 Email : florian.ponroy(a)fr.thalesgroup.com

1 0

[Q] string alg to remove spaces
by V S P 27 Mar '09

27 Mar '09

Looking at string algorithms and cannot figure what combination of them I need to remove all, but one spaces between words in a string so that "1 2 3" becomes "1 2 3" if there is a 'collection' of snippets for string alg, please let me know (I actually like that PHP has zillion of functions on strings, instead of having users to figure out the clever uses of 2 or 3 function for everything like in PERL) thanks in advance, Vlad -- V S P toreason(a)fastmail.fm -- http://www.fastmail.fm - IMAP accessible web-mail

2 1

Re: [Boost-users] How do i only get Regex??
by Ovanes Markarian 27 Mar '09

27 Mar '09

On Thu, Mar 26, 2009 at 7:55 PM, Green, Jason M NSWCDL, W33 < jason.m.green3(a)navy.mil> wrote: > I’m using VC++ 8 and I am trying to use the boost regex in order to use > regular expressions. I can get it to work, but it requires 60mb of files! > What is the simplest, smallest subset of files that I need to get this to > work. If there is a way to only have to import a dll or lib, that would be > ideal. I would like it to be separate and standalone from the massive file > collection that comes with boost as a whole. > > > > Please help! > > > > Thanks, Jason > Did you try analysing with Depends (tool which comes with MSVC) which DLLs your app references? I don't think RegEx adds 60mb to your app. Regards, Ovanes

1 0

[Graph] Adjacency list scalability with a Dijkstra algorithm
by Florian.PONROY＠fr.thalesgroup.com 27 Mar '09

27 Mar '09

Hi, Assuming that I want a graph made of 6 nodes, numbered 1, 2, 3, 4, 5 and 4242. I build the graph this way: typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, int> > tGraphShortestpath; tGraphShortestpath graph; boost::add_edge(1, 2, 1234); // 1234 is the weight boost::add_edge(1, 3, 412); ... boost::add_edge(5, 2, 29); boost::add_edge(5, 4242, 84); boost::add_edge(4242, 2, 456); boost::add_edge(4242, 5, 680); Now, I want to apply the Dijkstra algorithm on this graph. I create a distance and a predecessor vector, as I have seen on the documentation online : typedef tGraphShortestpath::vertex_descriptor tVertex; std::vector<tVertex> predecessors(boost::num_vertices(graph)); std::vector<int> distances(boost::num_vertices(graph)); Here is the problem: I would have imagined that, in my case, boost::num_vertices(graph) would have returned 6, but it actually returns the higher vertex number + 1, that is... 4243 ! So each of my vector has a size of 4243 * sizeof(tVertex) bytes... Is there a way to handle that? I probably misuse the API, but it would be better if the container would be dimensioned to the actual number of vertices, since I am in a CPU and memory constraint environment... Thank you very much for your help! -- Florian PONROY Thales Land & Joint France Tel. : +33(0)1 41 304 363 Fax : +33(0)1 41 303 560 Email : florian.ponroy(a)fr.thalesgroup.com

4 5

dijkstra and associative property map
by Sandeep Gupta 26 Mar '09

26 Mar '09

Hi, Attached below is the code to call Dijkstra over property_map data structures. The current definition of associative property map is incompatible for dijkstra. Somehow there is mismatch with respect to operator[]. Attach below is the code and the error. std::map<vertex_t, vertex_t> pred; boost::associative_property_map< std::map<vertex_t, vertex_t> > preds(pred); std::map<vertex_t, double> dist; boost::associative_property_map< std::map<vertex_t, double> > dists(dist); std::map<vertex_t, double> weight; boost::associative_property_map< std::map<vertex_t, double> > weights(weight); vertex_t v; //vertex_t v1 = preds[v]; dijkstra_shortest_paths(tg, v, predecessor_map(preds). weight_map(weights). distance_map(dists) ); Error: /home/sandeep/Computing/boost_1_38_0/boost/property_map.hpp:314: error: no match for ‘operator[]’ in ‘(const boost::associative_property_map<std::map<unsigned int, double, std::less<unsigned int>, std::allocator<std::pair<const unsigned int, double> > > >&)((const boost::associative_property_map<std::map<unsigned int, double, std::less<unsigned int>, std::allocator<std::pair<const unsigned int, double> > > >*)(& pa))[k]’ /home/sandeep/Computing/boost_1_38_0/boost/property_map.hpp:458: note: candidates are: typename UniquePairAssociativeContainer::value_type::second_type& boost::associative_property_map<UniquePairAssociativeContainer>::operator[](const typename UniquePairAssociativeContainer::key_type&) const [with UniquePairAssociativeContainer = std::map<unsigned int, double, std::less<unsigned int>, std::allocator<std::pair<const unsigned int, double> > >] Thanks sandeep

1 1

How do i only get Regex??
by Green, Jason M NSWCDL, W33 26 Mar '09

26 Mar '09

I'm using VC++ 8 and I am trying to use the boost regex in order to use regular expressions. I can get it to work, but it requires 60mb of files! What is the simplest, smallest subset of files that I need to get this to work. If there is a way to only have to import a dll or lib, that would be ideal. I would like it to be separate and standalone from the massive file collection that comes with boost as a whole. Please help! Thanks, Jason

1 0

[Date_Time] compile errors with gcc 4.3
by Pearl Rothman 26 Mar '09

26 Mar '09

I am using Fedora 9, gcc 4.3.0, and boost 1.38.0. When I include <boost/date_time/posix_time/posix_time_types.hpp> I get the following errors /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:67: error: ‘::clock_t’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:68: error: ‘::time_t’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:71: error: ‘::clock’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:72: error: ‘::difftime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:73: error: ‘::mktime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:74: error: ‘::time’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:75: error: ‘::asctime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:76: error: ‘::ctime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:77: error: ‘::gmtime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:78: error: ‘::localtime’ has not been declared /usr/lib/gcc/x86_64-redhat-linux/4.3.0/../../../../include/c++/4.3.0/ctime:79: error: ‘::strftime’ has not been declared How can I resolve them? Thanks

2 1

boost::asio memory buffers and persistent connections.
by Alejandro Martinez 26 Mar '09

26 Mar '09

I have a server running with asio. At any time i have 5000+ persistent connections from clients, but not all of them are sending/receiving data at all times. In fact, they only do requests once in a while. The problem is (with my current approach) that i need to have 5000+ memory buffers ready to receive that requests of very varying length. How could i make it so i can set the buffer to use at the exact moment in which data for a new request in an already open connection begins to arrive? And maybe have those buffers in some memory pool. I've been studying http://www.boost.org/doc/libs/1_38_0/doc/html/boost_asio/example/allocation… without understanding it completely, but it doesn't look like what im looking for. Any ideas? Thanks a lot in advance. Alejandro

4 7

multithreaded timer?
by Francisco Ares 26 Mar '09

26 Mar '09

Hi I'm implementing an application, serial RS232 communications centered, using boost in Windows. Many of the user actions are translated to ASCII commands to be sent to some serial devices connected to the serial ports, but as they are quite slow, I had to implement a command queue, so that as soon as a command gets its answer, it is cleared and the next one is sent, up to the end of the queue (of course). Using boost serial communication features, I realized that I needed an extra time-out, because the devices are real slow. So that this low speed doesn't lock up anything, the command queue runs in a separate thread and I would like another thread to run a timer, that could be activated when the command is send by the queue thread, and deactivated by the same thread if it detects an answer coming from the device in response to its command. If the timer is due, it should send a signal or call a callback function in the queue thread so it knows that the last command timed-out and it should re-send it again. All the queue things are OK (so it seems for now), I just need the timer. The ASIO timer is quite strange to me, I didn't manage to make it work. I have already seen the "timers" tutorials at boost web pages, and none have worked for me as expected. Any ideas / suggestions / snippets? Thanks a lot Francisco -- "If you have an apple and I have an apple and we exchange apples then you and I will still each have one apple. But if you have an idea and I have one idea and we exchange these ideas, then each of us will have two ideas." - George Bernard Shaw

4 4