- Boost-users - lists.boost.org

[iostreams] Is it possible for a sink to get notified when the stream is closed?
by Bob van Manen 27 Mar '09

27 Mar '09

Hi All, I am trying out the Boost iostreams library to build a sink, text sent to this sink is split up in to lines of text and each line is then being send over to our logging server (the function I'm calling to do this is static). So far I've built the write method as mentioned in the documentation for my sink, and push all the characters I receive in a buffer inside my sink class. Then I look for the end of line characters and figure out the lines of text. The problem I'm having is when there is no end of line character and the stream gets closed. Is there a way to get notified when the stream gets closed? Is there a better way to do this? Here is the code I have: class logging_sink { public: typedef char char_type; typedef boost::iostreams::sink_tag category; std::streamsize write(const char* s, std::streamsize n) { buffer_.append(s, n); // loop over buffer and find end of lines, send them to logging service } void close() { // close is never called if (!buffer_.empty()) log_message(buffer_); } private: std::string buffer_; }; class logging_stream : public boost::iostreams::stream<logging_sink> { public: logging_stream() : boost::iostreams::stream<logging_sink>(logging_sink()) {} }; logging_stream s; s << "Hello World"; s.close(); Thank you for your help, bob

2 2

Please help! How to make g++ link to libboost_thread-mt.so instead of libboost_thread-mt.so.1.33.1
by Louis Chen 27 Mar '09

27 Mar '09

Hi, local machine(A): boost-1.33.1, suse 10.3, gcc-4.2.1 A:/home/aa # ldconfig -p | grep boost_thread libboost_thread-mt.so.1.33.1 (libc6) => /usr/lib/libboost_thread-mt.so.1.33.1 libboost_thread-mt.so (libc6) => /usr/lib/libboost_thread-mt.so remote machine(B): boost-1.34.1, fedora 10, gcc-4.3.2. And i can NOT configure B. B:/home/bb # ldconfig -p | grep boost_thread libboost_thread-mt.so.3 (libc6) => /usr/lib/libboost_thread-mt.so.3 libboost_thread-mt.so (libc6) => /usr/lib/libboost_thread-mt.so The problem is that i compile main in A with LDFLAGS=-lboost_thread-mt. And main is linked to libboost_thread-mt.so.1.33.1. A:~/aa> ldd main | grep boost_thread libboost_thread-mt.so.1.33.1 => /usr/lib/libboost_thread-mt.so.1.33.1 (0xb7ca6000) When i try to run main in B, it fails, of course, with message: "main: error while loading shared library: libboost_thread-mt.so.1.33.1: can not open shared object file: No such file or directory." How can i force g++ link main to libboost_thread-mt.so in A? Thanks in advance!:) -- Louis Chen Southeast University, Nanjing Email:cszzys@gmail.com <Email%3Acszzys(a)gmail.com>

2 1

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

27 Mar '09

Quoting "Green, Jason M NSWCDL, W33" <jason.m.green3(a)navy.mil>: > I go to boost\boost_1_38 and type: bcp boost\regex.hpp \temp (temp is the > output dir for me), and I get the usage error? What am I doing wrong? > > Jason I'd wager that you need to escape your '\' - bcp boost\\regex.hpp \\temp or bcp boost/regex.hpp /temp

1 0

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

27 Mar '09

Weird. It has something to do with compiler optimizations. If -O2 is enabled, these errors disappear... I try to figure out why. > -----Message d'origine----- > De : PONROY Florian - CLB > Envoyé : vendredi 27 mars 2009 12:17 > À : boost-users(a)lists.boost.org > Objet : [Graph] Compilation error with MinGW and Boost 1.33.1 > > 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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_13edge_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14buffer_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_18distance_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_18distance_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14distance_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_15distance_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_15graph_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_topolog > y_manager.a(topology.o):topology.cpp:(.data$_ZZN5boost6detail18property_va > lue_endINS_11no_propertyEE15const_get_valueINS0_24error_property_not_found > ENS_14vertex_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

[Tuple] Problem with operator== and tuples
by Dominique Devienne 27 Mar '09

27 Mar '09

I'm trying to compare two tuple instances of the same type (indirectly by doing an == on std::set's of them), but this doesn't compile for me. The Tuple doc seems to indicate comparisons are supported. What am I missing? Thanks, --DD struct RowidTupleComparator { bool operator()( const boost::tuple<sqlite3_int64>& lhs, const boost::tuple<sqlite3_int64>& rhs ) const { return boost::get<0>(lhs) < boost::get<0>(rhs); } }; void TypeIdTests::test_rtti_vtable_text_vs_int() { typedef boost::tuple<sqlite3_int64> ROW; std::set<ROW, RowidTupleComparator> by_type_id; get_rows( "select rowid from rtti where type_id = :1", make_tuple(MyFoo::id().value()), by_type_id ); std::set<ROW, RowidTupleComparator> by_type; get_rows( "select rowid from rtti where type = :1", make_tuple(MyFoo::id().name().string()), by_type ); CPPUNIT_ASSERT_EQUAL(by_type_id.size(), by_type.size()); CPPUNIT_ASSERT(by_type_id == by_type); // <<< doesn't compile } c:\program files\microsoft visual studio 8\vc\include\utility(60) : see declaration of 'std::operator ==' c:\program files\microsoft visual studio 8\vc\include\xutility(2621) : error C2676: binary '==' : 'const boost::tuples::tuple<sqlite3_int64>' does not define this operator or a conversion to a type acceptable to the predefined operator // edited

2 2

multi-index:Q - Space and time efficiency
by dhruva 27 Mar '09

27 Mar '09

Hi, I have a struct with 2 members as follows: typedef struct time_series { time_t _time; double _value; } time_series_t; The data I get is sorted by time as it is a time series. I would like to maintain another index sorted by value. Since I need to keep removing the oldest records, I need the time based order and since I need to compute percentile, I need to sort it based on value. Would using multi-index save space (and time in insertion and removal) compared to having 2 vectors with different sort order? This is related to my implementation of percentile using boost::accumulators. I could not use the 'tail' or other equivalents as they expect window size (number of data) in advance and I will not know that. Hence, I need a container that can grow. -dhruva Unlimited freedom, unlimited storage. Get it now, on http://help.yahoo.com/l/in/yahoo/mail/yahoomail/tools/tools-08.html/

2 2

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