- Boost-users - lists.preview.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

[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

[MPL] MPL use cases overview
by Olivier Tournaire 26 Mar '09

26 Mar '09

Hi all, I am currently reading "C++ template metaprogramming" and I am very interested in the MPL provided by boost. However, I am curious on how users integrate this library in their developments. Please feel free to post not only code snippets, but also description of your usages of the MPL ! Thanks, Olivier

4 4

[gil] Unexplainable compiler error
by Robert Dailey 26 Mar '09

26 Mar '09

Below is the compiler error that I'm getting in Visual Studio 2008: C:\IT\work\redsword\third_party\boost\1_38_0\boost/gil/image.hpp(119) : error C2039: '_view' : is not a member of 'boost::gil::image_view<Loc>' with [ Loc=boost::gil::rgba8c_loc_t ] ..\..\..\..\components\libs\renderer\source\Image.cpp(44) : see reference to function template instantiation 'boost::gil::image<Pixel,IsPlanar,Alloc> &boost::gil::image<Pixel,IsPlanar,Alloc>::operator =<boost::gil::image_view<Loc>>(const Img &)' being compiled with [ Pixel=boost::gil::rgba8_pixel_t, IsPlanar=false, Alloc=std::allocator<unsigned char>, Loc=boost::gil::rgba8c_loc_t, Img=boost::gil::image_view<boost::gil::rgba8c_loc_t> ] And the code that it is compiling: #include <boost/gil/image_view.hpp> #include <boost/gil/image.hpp> #include <boost/gil/typedefs.hpp> Image::Image( unsigned char const* buffer, unsigned int width, unsigned int height, unsigned int bitsPerPixel, int pitch ) { // Provide a pitch the exact width of the image if no // explicit pitch was provided. if( !pitch ) { pitch = width * bitsPerPixel; } using namespace boost::gil; m_imageData = interleaved_view( width, height, reinterpret_cast<rgba8_pixel_t const*>( buffer ), pitch ); } I'm still new to boost::gil and it's very hard to learn. Can anyone guide me in the right direction as to how to resolve this compiler error?

2 1

Re: [Boost-users] boost::array and lower_bound
by Hicham Mouline 26 Mar '09

26 Mar '09

I just didn't the see the std::lower_bound version with the comparator. That does what I want, Regards. > -----Original Message----- > From: Hicham Mouline [mailto:hicham@mouline.org] > Sent: 26 March 2009 9:30 > To: 'boost-users(a)lists.boost.org' > Subject: boost::array and lower_bound > > Hello, > I maintain a boost::array< pair< time, value > > B, > sorted by time, where I defined operator< for pair<time, value> > > I wish to get a given entry from the array for a given time y. > > If y matches any entry, value is returned, if y is between 2 entries, an > interpolated value is returned. > > std::lower_bound( &B[0], &B[supSize], ... ) //this doesn't work > > I suppose for this I need to define some other related iterator to pass to > lower_bound, > not boost::array< pair< time, value > >::const_iterator. > > I suppose this is what "Iterator adaptors" are about ? > I have seen the term "views" as well, is this related? > > Regards,

1 0

boost::array and lower_bound
by Hicham Mouline 26 Mar '09

26 Mar '09

Hello, I maintain a boost::array< pair< time, value > > B, sorted by time, where I defined operator< for pair<time, value> I wish to get a given entry from the array for a given time y. If y matches any entry, value is returned, if y is between 2 entries, an interpolated value is returned. std::lower_bound( &B[0], &B[supSize], ... ) //this doesn't work I suppose for this I need to define some other related iterator to pass to lower_bound, not boost::array< pair< time, value > >::const_iterator. I suppose this is what "Iterator adaptors" are about ? I have seen the term "views" as well, is this related? Regards,

1 0

Re: [Boost-users] [Graph] Adjacency list scalability with a Dijks tra algorithm
by Florian.PONROY＠fr.thalesgroup.com 26 Mar '09

26 Mar '09

Hi Juan, Thanks for your answer. I definitly agree with the map overhead, I will try to better understand how the property map works in order to implement your solution. Florian -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]De la part de Juan Antonio Farré Basurte Envoyé : mercredi 25 mars 2009 19:27 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Graph] Adjacency list scalability with a Dijks tra algorithm Hi, It's as easy as instantiating the adjacency_list template with mapS for the vertex list selector. This is the second template argument. For example, typedef boost::adjacency_list<boost::vecS,boost::mapS> myGraph; Anyway, remember that a map is more expensive than a vector in terms of both space and time (access time to an element is logarithmic). Another option is that you stay with the default vector for the vertex list, and you use a property to store the vertex id. This way, your vertex 4242 would have descriptor 6 and you'd store 4242 as its id-property value. Cheers, Juan > Hi Andrew, > > Would you please tell me which part of the documentation I should rely on to use a std::map as you'd suggested? I should actually admit I'm not yet > familiar with the BGL :-) > > > -----Message d'origine----- > De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]De la part de Andrew Sutton > Envoyé : mercredi 25 mars 2009 17:25 > À : boost-users(a)lists.boost.org > Objet : Re: [Boost-users] [Graph] Adjacency list scalability with a Dijkstra algorithm > > > > > 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... > > > > You're confusing the notions of "index" and "descriptor". With the vertex set using vecS, the descriptor of a vertex is the same as its index -- > hence the confusion. Therefore, when you call add_edge(4242, 1, ...), the graph thinks you mean the vertex whose descriptor is 4242 and resizes > itself accordingly. > > You have to remember - whatever the examples may indicate - that you should never actually use a literal value and descriptors interchangeably. This > isn't documented very well, either. > > You could use a std::map to associate your own identifiers with vertex descriptors. > > > Andrew Sutton > andrew.n.sutton(a)gmail.com <mailto:andrew.n.sutton@gmail.com> > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

unicode, C++0x, UTF-16
by Brent Arias 26 Mar '09

26 Mar '09

I see that wstring_convert and codecvt_utf8_utf16 are in the current C++0x spec. Are there plans to backfill boost with implementations for these? I'm also curious why the critique of wstring_convert (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1750.html) was not incorporated for C++0x. Thoughts? I've also spotted a comment in boost codecvt_utf8_facet saying: // note the following code will generate on some platforms where // wchar_t is defined as UCS2. The warnings are superfluous as // the specialization is never instantitiated with such compilers. Does that mean that boost.codecvt_utf8_facet is capable of acting as a UTF-8 / UCS2 converter on a Windows box, where wchar_t is 2 bytes in size? Brent Arias Software Architect Lumension Security(tm) Tel ~ (602) 692-8088 Fax ~ (480) 970-6323 brent.arias(a)lumension.com<mailto:brent.arias@lumension.com>

2 1

[fusion] complexity of filter_view
by er 26 Mar '09

26 Mar '09

Hi All, If say vector_type has N elements and predicate is true only for one of them. O(N)? typedef filter_view<vector_type const, predicate > view_t O(1)? view_t view(v);

2 1

Steven Watanabe template profiler
by Joel Falcou 26 Mar '09

26 Mar '09

A while back, I claimed having problems using Steven template profiler. I'm ashamed to say that the problem was that gcc is actually localized. So the warning I got in the filtered output was : "./test.hpp:17: attention : ‘int template_profiler::f(int)’ is deprecated (declared at ./template_profiler.hpp:50) " So I guess I have to edit the regex in postprocess ? I am not a regex guru so If Steven walk by, could you give me some directions to fix this on my end. -- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35

2 1

compile-time check that a member function exists
by John Pretz 25 Mar '09

25 Mar '09

Hi, I'm pretty new to boost. I want to write some code with a compile-time check whether a member function exists or not. The code below shows kinda what I need except I'd obviously like to avoid a specialized template for each class that I use. Can anybody point me in the right direction? Thanks, John **************************************** #include <iostream> using namespace std; struct WithMemberGo { void Go() const {cout<<__PRETTY_FUNCTION__<<" going...."<<endl;} }; struct WithoutGo { }; template <class T> void CallGoIfItExists(const T& t){ t.Go(); } // I want to avoid having to specialize this function for every class without the // right member function. template <> void CallGoIfItExists<WithoutGo>(const WithoutGo&){ cout<<"not going anywhere...."<<endl; } int main(){ WithMemberGo with; CallGoIfItExists(with); WithoutGo without; CallGoIfItExists(without); } -- John Pretz -- P-23, MS H803 Los Alamos National Lab Los Alamos, NM 87545 Phone: (505)665-5847 Fax: (505)665-4121

5 10