- Boost-users - lists.preview.boost.org

connected component on a directed graph
by gast128 13 Sep '07

13 Sep '07

Dear all, I see that it is already posted a lot of times, but i couldn't find an answer. Baiscally we want the connected component given a vertex given a directed graph. So a -> b -> c -> d e -> f would give {a, b, c, d} given b - for directed graphs there is only the strong component algorithm - for undirected graph there is an algorithm - there seems no adapter to fool the Bgl for interpreting a directed graph as undirected. Can anyone help? I am not a graph (or Bgl) expert, so maybe I am overlooking something. Wkr, me

3 3

Serialization compile issue
by Cory Omand 13 Sep '07

13 Sep '07

Hello, I am trying to serialize std containers via boost::serialization, but I am unable to get even simple code samples to compile. I used the serialization test_map.cpp as a guide to arrive at the very simple code that follows: --- snip --- #include <boost/serialization/map.hpp> #include <boost/serialization/string.hpp> #include <boost/serialization/nvp.hpp> #include <boost/archive/xml_oarchive.hpp> #include <iostream> #include <string> #include <map> int main() { std::map<std::string, std::string> data; data.insert(std::make_pair("a", "b")); data.insert(std::make_pair("b", "c")); data.insert(std::make_pair("c", "d")); boost::archive::xml_oarchive oa(std::cout); oa << boost::serialization::make_nvp("data", data); return 0; } --- snip --- Can anyone spot misuse above, or give me some clue as to why this won't compile? I am using boost 1.33.1, with GCC 4.1.1. If I change 'data' to be a simple string, serialization works, but if I use any std::container type (I've tried vector<string>, list<string>, and map<string,string> so far), I get an error of the following form: /usr/include/boost-1_33_1/boost/archive/detail/oserializer.hpp:131: error: invalid use of undefined type 'T3', where T1 = string T2 = list<T1> T3 = struct boost::serialization::extended_type_info_null<T2> /usr/include/boost-1_33_1/boost/serialization/type_info_implementation.hpp:26: error: declaration of 'T3', where T1 = string T2 = list<T1> T3 = struct boost::serialization::extended_type_info_null<T2> /usr/include/boost-1_33_1/boost/archive/detail/oserializer.hpp:132: error: invalid use of undefined type 'T3', where T1 = string T2 = list<T1> T3 = struct boost::serialization::extended_type_info_null<T2> /usr/include/boost-1_33_1/boost/serialization/type_info_implementation.hpp:26: error: declaration of 'T3', where T1 = string T2 = list<T1> T3 = struct boost::serialization::extended_type_info_null<T2> Any assistance would be greatly appreciated. - C.

2 3

[variant] Accessor class for recursive variant type
by hirsch＠bigfoot.de 13 Sep '07

13 Sep '07

Hi, I have a recursive variant type like that: -------------------------- typedef boost::make_recursive_variant<bool, int, double, std::string, std::vector< boost::recursive_variant_ >, std::map<std::string, boost::recursive_variant_> >::type TVType; typedef std::vector<TVType> TVector; typedef std::map<std::string, TVType> TMap; -------------------------- And I implemented an accessor class to extract elements from the variant in a path-linke manner: -------------------------- TMap map; map["longValue"] = 23; map["stringValue"] = "abcde"; TVector subvec; subvec.push_back(42); map["subVector"] = subvec; TVType tv = map; Access acc(tv); std::string sValue = acc.get<std::string>("stringValue"); // "abcde" long nSubValue = acc.get<long>("subVector/0"); // 42 ---------------------------- It is implemented by using a boost::static_visitor. It works fine for now, but I also want to change values which are inside my variant hierarchy. So I have to return a reference-type from my Access helper rather than a value type, but I can't figure out how to do this. Here's the implementation of the accessor as it is now: ---------------------------- class Access: public boost::static_visitor<TVType> { typedef std::list< std::string > TStrList; public: template<typename T> T get(const std::string& sPath, const TVType& tvt) { m_aSplits.clear(); // split the path-parts, neighboring splitters will be // automatically compressed to one. boost::split( m_aSplits, sPath, std::bind2nd( std::equal_to<char>(), '/'), boost::token_compress_on); // remove empty entries for(TStrList::iterator it = m_aSplits.begin(); it!= m_aSplits.end(); ++it) { if(it->empty()) it = m_aSplits.erase(it); } // in case of an exception, transform the boost::bad_get exception to our CIS::Exception try { return boost::get<T>(boost::apply_visitor(*this, tvt)); } catch(boost::bad_get& ex) { throw CIS::Exception(ex.what(), EX_POS); } } TVType operator()(const TVector& v) { // if the splits-list is empty we have found our element, so the TVector itself was requested if(m_aSplits.empty()) return v; const uint32_t nIdx = boost::lexical_cast<uint32_t>(m_aSplits.front()); if(nIdx >= v.size()) throw Exception(boost::format("Invalid index: '%1%' from '%2%' in access path") % nIdx % v.size(), EX_POS); m_aSplits.pop_front(); return boost::apply_visitor(*this, v[nIdx]); } TVType operator()(const TMap& m); { // if the splits-list is empty we have found our element, so the TMap itself was requested if(m_aSplits.empty()) return m; TMap::const_iterator it = m.find(m_aSplits.front()); if(it == m.end()) throw Exception(boost::format("Invalid key: '%1%' in access path") % m_aSplits.front(), EX_POS); m_aSplits.pop_front(); return boost::apply_visitor(*this, it->second); } template<typename T> TVType operator()(const T& t) { return t; } private: TStrList m_aSplits; ///< splitted parts of the path. }; ------------------------ I tried to remove the consts and return a reference, but the compiler claims it can't convert a TVector& to a TVType&. I also tried with pointers but got the same error. Does anybody have an ide how I can implement this functionality? Thanks, Falco

1 0

Choosing the right GRAPH
by Jacques Papper 13 Sep '07

13 Sep '07

Hi, I've been looking around the BGL for some time now, but I still can't decide which graph I should use. Here are my limitations : - Very large graph ( > 40 million vertices) - About 4 to 8 edge per vertex (Sparse) I want to associate to each edge a property P such that : edge (A,B) returns P edge (B,A) returns -P (Directed) BUT I do not want to duplicate the storage of P. If edge (A,B) exists then (B,A) also exists. (Bidirectional) I also want to be able to access all edges connected to vertex A as quickly as possible (so I guess using in_edges and out_edges in a directed adjacency list will be too slow). I think the compressed_sparse_row_graph might be the way to go by storing all duplicate edges (the only implementation for the moment is directedS), but I need a way to not duplicate the properties associated with each edge. All advice will be greatly appreciated !! Thanks Jacques --------------------------- This email contains information that is private and confidential and is intended only for the addressee. If you are not the intended recipient please delete it and notify us immediately by e-mailing the sender. Note: All email sent to or from this address may be accessed by someone other than the recipient, for system management and security reasons. Aircraft Research Association Ltd. Registered in England, Registration No 503668 Registered Office: Manton Lane, Bedford MK41 7PF England VAT No GB 196351245

5 4

Boost library names
by Mark B. 13 Sep '07

13 Sep '07

Hi, I am trying to use string_algo (specifically split) in my program but I have no idea about which Boost library I have to link to. Library naming in Boost is not very regular. For example, to link to the filesystem classes I have to use -lboost_filesystem, but for linking to uBlas, I have to use -lblas. Thus, the substring "boost" is not necessarily in the library's filename Can somebody help me? Thanks! -- View this message in context: http://www.nabble.com/Boost-library-names-tf4431325.html#a12641735 Sent from the Boost - Users mailing list archive at Nabble.com.

5 7

[bind] for_each, Member function question.
by Hughes, James 13 Sep '07

13 Sep '07

I have a question for boost:binders out there... In the following scenario..(pseudocode) Class Fred { typedef std::map<wstring, shared_ptr<SomeType> > MyMap; MyMap Bert; Save(MyMap::iterator pos) { ... } SaveAll() { for_each(Bert.begin(), Bert.end(), bind(&Fred::Save, this, _1); } }; The code wants to save all the data in the map. The bind, I was hoping, would simply call Save for all items in the map, passing in the iterator as the parameter, but I get a template compile fault on the bind. I've tried all sorts of combinations, checked boost docs, read the chapter in Beyond the C++ standard library, Googled etc, but just cannot figure out what I need to do here. Any help gratefully received. James This message (including any attachments) contains confidential and/or proprietary information intended only for the addressee. Any unauthorized disclosure, copying, distribution or reliance on the contents of this information is strictly prohibited and may constitute a violation of law. If you are not the intended recipient, please notify the sender immediately by responding to this e-mail, and delete the message from your system. If you have any questions about this e-mail please notify the sender immediately.

4 5

Problem while using Dijkstra algorithm
by abhishek.v＠tcs.com 12 Sep '07

12 Sep '07

Hi Considering the example that comes with BGL i.e examples/dijkstra-example.cpp. I have already a graph which is undirected now i want to apply dijkstra algorithm on it. My vertex discriptor is "Vertex_name" and edge discriptor is "edge_value". The following is the code provided in the example. :- std::vector<vertex_descriptor> p(num_vertices(g)); std::vector<int> d(num_vertices(g)); vertex_descriptor s = vertex(A, g); #if defined(BOOST_MSVC) && BOOST_MSVC <= 1300 // VC++ has trouble with the named parameters mechanism property_map<graph_t, vertex_index_t>::type indexmap = get(vertex_index, g); dijkstra_shortest_paths(g, s, &p[0], &d[0], weightmap, indexmap, std::less<int>(), closed_plus<int>(), (std::numeric_limits<int>::max)(), 0, default_dijkstra_visitor()); #else dijkstra_shortest_paths(g, s, predecessor_map(&p[0]).distance_map(&d[0])); #endif My code for the corresponding code is as follows :- std::vector<vertex_descriptor> p(num_vertices(g)); std::vector<int> d(num_vertices(g)); vertex_descriptor s = vertex(L1, g); //Giving error Undeclared identifier L1. Here L1 is the name of my vertex. Also i tried Vertex_name(u) to this parameter but it is giving compilation error. What parameter need to be passed for this. Secondly i m not defining BOOST_MSVC so i'm elimination the IF BLock and directly writing the code as dijkstra_shortest_paths(g, s, predecessor_map(&p[0]).distance_map(&d[0])); Here kindly explain what the distance_map signifies and where it is being defined. Thanks Abhishek Vyas Tata Consultancy Services Mailto: abhishek.v(a)tcs.com Website: http://www.tcs.com ____________________________________________ Experience certainty. IT Services Business Solutions Outsourcing ____________________________________________ =====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you

2 1

Failing to build dynamic regexp libraries on Mac OS X
by Tommy Nordgren 12 Sep '07

12 Sep '07

Building dynamic regular experssion libraries fails on Mac OS X Tiger , when attempting to link against ICU. I would appreciate any hint on how to fix this. All the ICU libraries are present in /usr/local/lib, so I wonder if I need to add -licudata to the build somehow. (As can be seen from the build log, only -licui18n and -licuuc are added to the command line. (I've tried to edit the boost distribution files that refer to theese flags, to also include -icudata , but the command line passed to the tools don't change, so how do I do it) ./tools/jam/src/bin.macosxppc/bjam -sICU_PATH=/usr/local --user- config=user-config.jam Building Boost.Regex with Unicode/ICU support enabled Using ICU in /usr/local/include ...patience... ...patience... ...found 4691 targets... ...updating 4 targets... darwin.link.dll bin.v2/libs/regex/build/darwin/release/threading- multi/libboost_regex-mt-1_34_1.dylib ld: warning can't open dynamic library: libicudata.36.dylib referenced from: /usr/local/lib/libicui18n.dylib (checking for undefined symbols may be affected) (No such file or directory, errno = 2) ld: Undefined symbols: _icudt36_dat referenced from libicuuc.36 expected to be defined in libicudata.36.dylib /usr/libexec/gcc/powerpc-apple-darwin8/4.0.1/libtool: internal link edit command failed g++ -dynamiclib -o "bin.v2/libs/regex/build/darwin/release/ threading-multi/libboost_regex-mt-1_34_1.dylib" "bin.v2/libs/regex/ build/darwin/release/threading-multi/c_regex_traits.o" "bin.v2/libs/ regex/build/darwin/release/threading-multi/cpp_regex_traits.o" "bin.v2/libs/regex/build/darwin/release/threading-multi/cregex.o" "bin.v2/libs/regex/build/darwin/release/threading-multi/fileiter.o" "bin.v2/libs/regex/build/darwin/release/threading-multi/icu.o" "bin.v2/libs/regex/build/darwin/release/threading-multi/instances.o" "bin.v2/libs/regex/build/darwin/release/threading-multi/posix_api.o" "bin.v2/libs/regex/build/darwin/release/threading-multi/regex.o" "bin.v2/libs/regex/build/darwin/release/threading-multi/ regex_debug.o" "bin.v2/libs/regex/build/darwin/release/threading- multi/regex_raw_buffer.o" "bin.v2/libs/regex/build/darwin/release/ threading-multi/regex_traits_defaults.o" "bin.v2/libs/regex/build/ darwin/release/threading-multi/static_mutex.o" "bin.v2/libs/regex/ build/darwin/release/threading-multi/w32_regex_traits.o" "bin.v2/libs/ regex/build/darwin/release/threading-multi/wc_regex_traits.o" "bin.v2/ libs/regex/build/darwin/release/threading-multi/wide_posix_api.o" "bin.v2/libs/regex/build/darwin/release/threading-multi/winstances.o" "bin.v2/libs/regex/build/darwin/release/threading-multi/ usinstances.o" -licui18n -licuuc ...failed darwin.link.dll bin.v2/libs/regex/build/darwin/release/ threading-multi/libboost_regex-mt-1_34_1.dylib... darwin.link.dll bin.v2/libs/regex/build/darwin/debug/libboost_regex- d-1_34_1.dylib ld: warning can't open dynamic library: libicudata.36.dylib referenced from: /usr/local/lib/libicui18n.dylib (checking for undefined symbols may be affected) (No such file or directory, errno = 2) ld: Undefined symbols: _icudt36_dat referenced from libicuuc.36 expected to be defined in libicudata.36.dylib /usr/libexec/gcc/powerpc-apple-darwin8/4.0.1/libtool: internal link edit command failed g++ -dynamiclib -o "bin.v2/libs/regex/build/darwin/debug/ libboost_regex-d-1_34_1.dylib" "bin.v2/libs/regex/build/darwin/debug/ c_regex_traits.o" "bin.v2/libs/regex/build/darwin/debug/ cpp_regex_traits.o" "bin.v2/libs/regex/build/darwin/debug/cregex.o" "bin.v2/libs/regex/build/darwin/debug/fileiter.o" "bin.v2/libs/regex/ build/darwin/debug/icu.o" "bin.v2/libs/regex/build/darwin/debug/ instances.o" "bin.v2/libs/regex/build/darwin/debug/posix_api.o" "bin.v2/libs/regex/build/darwin/debug/regex.o" "bin.v2/libs/regex/ build/darwin/debug/regex_debug.o" "bin.v2/libs/regex/build/darwin/ debug/regex_raw_buffer.o" "bin.v2/libs/regex/build/darwin/debug/ regex_traits_defaults.o" "bin.v2/libs/regex/build/darwin/debug/ static_mutex.o" "bin.v2/libs/regex/build/darwin/debug/ w32_regex_traits.o" "bin.v2/libs/regex/build/darwin/debug/ wc_regex_traits.o" "bin.v2/libs/regex/build/darwin/debug/ wide_posix_api.o" "bin.v2/libs/regex/build/darwin/debug/winstances.o" "bin.v2/libs/regex/build/darwin/debug/usinstances.o" -licui18n - licuuc -g ...failed darwin.link.dll bin.v2/libs/regex/build/darwin/debug/ libboost_regex-d-1_34_1.dylib... darwin.link.dll bin.v2/libs/regex/build/darwin/release/ libboost_regex-1_34_1.dylib ld: warning can't open dynamic library: libicudata.36.dylib referenced from: /usr/local/lib/libicui18n.dylib (checking for undefined symbols may be affected) (No such file or directory, errno = 2) ld: Undefined symbols: _icudt36_dat referenced from libicuuc.36 expected to be defined in libicudata.36.dylib /usr/libexec/gcc/powerpc-apple-darwin8/4.0.1/libtool: internal link edit command failed g++ -dynamiclib -o "bin.v2/libs/regex/build/darwin/release/ libboost_regex-1_34_1.dylib" "bin.v2/libs/regex/build/darwin/release/ c_regex_traits.o" "bin.v2/libs/regex/build/darwin/release/ cpp_regex_traits.o" "bin.v2/libs/regex/build/darwin/release/cregex.o" "bin.v2/libs/regex/build/darwin/release/fileiter.o" "bin.v2/libs/ regex/build/darwin/release/icu.o" "bin.v2/libs/regex/build/darwin/ release/instances.o" "bin.v2/libs/regex/build/darwin/release/ posix_api.o" "bin.v2/libs/regex/build/darwin/release/regex.o" "bin.v2/ libs/regex/build/darwin/release/regex_debug.o" "bin.v2/libs/regex/ build/darwin/release/regex_raw_buffer.o" "bin.v2/libs/regex/build/ darwin/release/regex_traits_defaults.o" "bin.v2/libs/regex/build/ darwin/release/static_mutex.o" "bin.v2/libs/regex/build/darwin/ release/w32_regex_traits.o" "bin.v2/libs/regex/build/darwin/release/ wc_regex_traits.o" "bin.v2/libs/regex/build/darwin/release/ wide_posix_api.o" "bin.v2/libs/regex/build/darwin/release/ winstances.o" "bin.v2/libs/regex/build/darwin/release/usinstances.o" -licui18n -licuuc ...failed darwin.link.dll bin.v2/libs/regex/build/darwin/release/ libboost_regex-1_34_1.dylib... darwin.link.dll bin.v2/libs/regex/build/darwin/debug/threading-multi/ libboost_regex-mt-d-1_34_1.dylib ld: warning can't open dynamic library: libicudata.36.dylib referenced from: /usr/local/lib/libicui18n.dylib (checking for undefined symbols may be affected) (No such file or directory, errno = 2) ld: Undefined symbols: _icudt36_dat referenced from libicuuc.36 expected to be defined in libicudata.36.dylib /usr/libexec/gcc/powerpc-apple-darwin8/4.0.1/libtool: internal link edit command failed g++ -dynamiclib -o "bin.v2/libs/regex/build/darwin/debug/ threading-multi/libboost_regex-mt-d-1_34_1.dylib" "bin.v2/libs/regex/ build/darwin/debug/threading-multi/c_regex_traits.o" "bin.v2/libs/ regex/build/darwin/debug/threading-multi/cpp_regex_traits.o" "bin.v2/ libs/regex/build/darwin/debug/threading-multi/cregex.o" "bin.v2/libs/ regex/build/darwin/debug/threading-multi/fileiter.o" "bin.v2/libs/ regex/build/darwin/debug/threading-multi/icu.o" "bin.v2/libs/regex/ build/darwin/debug/threading-multi/instances.o" "bin.v2/libs/regex/ build/darwin/debug/threading-multi/posix_api.o" "bin.v2/libs/regex/ build/darwin/debug/threading-multi/regex.o" "bin.v2/libs/regex/build/ darwin/debug/threading-multi/regex_debug.o" "bin.v2/libs/regex/build/ darwin/debug/threading-multi/regex_raw_buffer.o" "bin.v2/libs/regex/ build/darwin/debug/threading-multi/regex_traits_defaults.o" "bin.v2/ libs/regex/build/darwin/debug/threading-multi/static_mutex.o" "bin.v2/ libs/regex/build/darwin/debug/threading-multi/w32_regex_traits.o" "bin.v2/libs/regex/build/darwin/debug/threading-multi/ wc_regex_traits.o" "bin.v2/libs/regex/build/darwin/debug/threading- multi/wide_posix_api.o" "bin.v2/libs/regex/build/darwin/debug/ threading-multi/winstances.o" "bin.v2/libs/regex/build/darwin/debug/ threading-multi/usinstances.o" -licui18n -licuuc -g ...failed darwin.link.dll bin.v2/libs/regex/build/darwin/debug/ threading-multi/libboost_regex-mt-d-1_34_1.dylib... ...failed updating 4 targets... Not all Boost libraries built properly. ------------------------------------- This sig is dedicated to the advancement of Nuclear Power Tommy Nordgren tommy.nordgren(a)comhem.se

2 2

Re: [Boost-users] Using Boost.Fusion transform on vector<int&>
by dan marsden 12 Sep '07

12 Sep '07

Martin Ecker wrote: >I need something like the following (somewhat contrived) example to >work with boost::fusion::transform on a boost::fusion::vector<int&> or >other vector types that have reference types. >Note that the following doesn't compile. <snip original example> The following code allows references to pass through, as I believe you want. It just uses a slight modification to your function object to allow it to cope with references correctly. namespace { struct pass_through { template<typename Sig> struct result; template<typename T> struct result<pass_through(T&)> { typedef T& type; }; template<typename T> T& operator()(T& t) const { return t; } }; } int main() { typedef fusion::vector<int&> vec; int i = 202; vec v1(i); vec v2(fusion::transform(v1, pass_through())); std::cout << fusion::at_c<0>(v2) << std::endl; // Output 202 } Is this ok for your needs? Cheers Dan ___________________________________________________________ Yahoo! Answers - Got a question? Someone out there knows the answer. Try it now. http://uk.answers.yahoo.com/

2 1

deciding directed and undirected parameter of adjancency list at runtime .
by abhishek.v＠tcs.com 12 Sep '07

12 Sep '07

Hi I have a function which take an input from the user whether the graph is directed or undirected. I'm declaring graph as follows :- typedef adjacency_list < vecS, vecS, undirectedS, property < vertex_name_t,std::string >, property < edge_name_t, std::string > > Graph; Graph g; Now here the parameter in Bold need to be varied as the user input changes. One method could be i could have two different function say,CreateDirected() and CreateUndirected(). But this is not working in my case as i want the declaration should be global so that i can use it throughout my application. Please help. Thanks Abhishek Vyas Tata Consultancy Services Mailto: abhishek.v(a)tcs.com Website: http://www.tcs.com ____________________________________________ Experience certainty. IT Services Business Solutions Outsourcing ____________________________________________ =====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you

2 2

Using Boost.Fusion transform on vector<int&>
by Martin Ecker 12 Sep '07

12 Sep '07

Hi, I need something like the following (somewhat contrived) example to work with boost::fusion::transform on a boost::fusion::vector<int&> or other vector types that have reference types. Note that the following doesn't compile. --------------------------- #include <boost/fusion/sequence/container/vector.hpp> #include <boost/fusion/algorithm/transformation/transform.hpp> struct pass_through { template <typename SignatureT> struct result; template <typename T> struct result<pass_through (T)> { typedef T type; }; template <typename T> T operator () (T value) const { return value; } }; int main() { using namespace boost::fusion; int i = 5; vector<int&> v(i); vector<int&> v2(transform(v, pass_through())); return 0; } --------------------------- This code doesn't compile because in deref_impl for the transform_view when this code static type call(Iterator const& i) { return i.f(*i.first); } calls the pass_through function object's operator (), the compiler deduces T to be int instead of int&. Is there any way to make this work with Boost.Fusion, e.g. by somehow additionally passing the actual type stored in the vector to the function object in some way instead of relying on the compiler to deduce it? I was thinking of maybe using the binary version of transform and passing in a range_c containing integral constants from 0 to <size of vector - 1> and then using this in operator () to retrieve the actual type from the vector by using mpl::at. Is there a better/simpler way? Thanks, Martin

1 0

[spirit]how to ignore the sequence of the rules?
by james.jones＠firstinvestors.com 11 Sep '07

11 Sep '07

> From: moosefly <moosefly(a)gmail.com> > For example, I want to parse the following text: > > <input type=hidden value=1> > > I have defined 2 rules match the "type" field and the "value" field, > but the sequence of 2 rules is uncertain, that means "<input value=1 > type=hidden>" is also legal,so I can't define the rules just like: > > rule_type >> !space_p >> rule_value > > The following works at this simple condition: > > ( (rule_type >> !space_p >> rule_value) | (rule_value >> !space_p > >>rule_type ) ) > > But if there are many out-of-order fields need to parser, how can I > ignore the sequence of the rules? What you seem to want to do (correct me if I'm wrong) is to have some set of N attributes, each of which may or may not be present, but can appear only once, in arbitrary order, and you want to check this in the parser. This is not a great idea, because it leads to a combinatorial explosion of states. There's really no way out of this (strictly within the parser). What you CAN do to avoid the explosion is to delegate the uniqueness checking to helper functions outside the parser. So instead of allowing only rule_type then rule_value or the reverse, allow this: rule_any = rule_type | rule_value; rule_input_attributes = *rule_any; // ignoring whitespace issues here This will match: <input type=hidden value=1> or <input value=1 type=hidden> as you want. But it'll also match: <input value=1 type=hidden type=visible> and <input> which you might not want. So you have to add an action to rule_any, which will pass the name-value pair data to a function which will check the uniqueness of the names in the NVP. I'm not an expert on Spirit, so you might want to consult the Spirit mailing list if you get stuck creating actions. HTH, - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

2 1

Re: [Boost-users] [multi_index] erasing elements
by Jeff Holle 11 Sep '07

11 Sep '07

Joaquín Mª López Muñoz wrote: > The two snippets of code you show are entirely equivalent, in the > sense that > Present inherits the functionality of its first index, YIndex. In > particular > YIndex::iterator is the *same type* as Present::iterator, so I'm > puzzled by the > fact that you're observing different behaviors --from the code you're > showing, > using one or the other variation cannot possibly make any difference > whatsoever. > Could you please check your code for some other differences you might > have not noticed when doing the switch from one version to the other? Thanks for this information. The two code snippets were not equivalent because I was only using the iterator returned from the multi_index container's erase method in the one using YIndex::iterators. I have found that this iterator doesn't point to an element in the container. Instead its pointing to some memory that is zeroed. Prior to erasing the element I inserted some test code that looks though the entire container and doesn't find such an element. Given my constructor, this only makes sense. Do you have an explanation?

2 1

[Serialization] linking problems leading to unregistered class exception
by David Raulo 11 Sep '07

11 Sep '07

Hi, It seems I have linker-related problems leading to "unregistered class" exceptions being raised. Now, I know this sounds like a compilation chain-specific problem, but the thing is I get the exact same problem on Linux (Ubuntu 7.04, gcc4.1), Macosx 10.4 (gcc 4.0) and Windows (Microsoft Visual Studio 2005 Express). My initial problem was that I'm using Boost.Serialization on a rather big class hierarchy (around 200 classes), so instantiating all the serialization code in a single .cpp is not pratical (too much memory consumed by the compiler). So I split my BOOST_CLASS_EXPORT_GUID() declarations into several compilation units, and this worked fine. *Except* if I generate a static library, in which case I get unregistered class exceptions. If I take the same object files and link them into a dynamic library, or directly into my executable, then everything works as intended. So it looks like generating a static library (with gcc or msvc) leads to parts of the serialization code to disappear (a quick look at the file-size of the generated executables seems to confirm that). I attached the smallest test-case I could think of that reproduces this problem. The included Makefile will generate 3 executables: test_s11n, test_s11n_dyn, test_s11n_static. All of them build fine, but the last one fails at run-time. Anyone has some insight into this? Thanks, david.

2 2

Unit Test Framework add
by Chris Miceli 11 Sep '07

11 Sep '07

I have had nothing but troubles with boost test 1.34.1 after switched from 1.33. First I had trouble with the main from shared object issue, and now my code that worked before is not executing a test added to the framework. #include <iostream> #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MAIN #define BOOST_TEST_MODULE File Test #include <boost/bind.hpp> #include <boost/test/unit_test.hpp> template <typename Functor> struct my_test { void execute(int value) { //Never prints this message //Doesn't have to be a print, nothing gets here std::cerr << "Hi all" << std::endl << std::flush; } }; BOOST_AUTO_TEST_CASE( test123 ) { boost::shared_ptr<my_test<int> > tester(new my_test<int>); boost::unit_test::framework::master_test_suite().add(BOOST_TEST_CASE(boost::bind(&my_test<int>::execute, tester, 5))); } this worked when it was not using boost::bind but just the address of a normal function. This is just an simple version that illustrated the problem. I am compiling as such g++ test.cpp -o test -L/usr/local/lib -lboost_unit_test_framework-gcc41-mt This is the output: Running 1 test case... *** No errors detected

2 2

XML Serialization
by tcmichals 11 Sep '07

11 Sep '07

Creating an application to send XML formatted data to this class that uses boost serialization, the issue is the name spaces in the boost_serialization tag; for example shown below... <?xml version="1.0" encoding="utf-8"?> <!DOCTYPE boost_serialization > <boost_serialization xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xsd="http://www.w3.org/2001/XMLSchema" signature="serialization::archive" version="4">... looking at the rule for parsing, SerializationWrapper = !S >> str_p(L"<boost_serialization") >> S >> SignatureAttribute >> S >> VersionAttribute >> !S >> L'>' Is there a way to change the rules to allow skipping the namespaces? all of the elements are there but there are a few extra? The issue is trying to change the XML parser not to generate may not be possible .NET.

1 1

Deciding parameter for adjancency list at runtime.
by abhishek.v＠tcs.com 11 Sep '07

11 Sep '07

Hi I have a function which take an input from the user whether the graph is directed or undirected. I'm declaring graph as follows :- typedef adjacency_list < vecS, vecS, undirectedS, property < vertex_name_t,std::string >, property < edge_name_t, std::string > > Graph; Graph g; Now here the parameter in Bold need to be varied as the user input changes. One method could be i could have two different function say,CreateDirected() and CreateUndirected(). But this is not working in my case as i want the declaration should be global so that i can use it throughout my application. Please help. Abhishek Vyas Tata Consultancy Services Mailto: abhishek.v(a)tcs.com Website: http://www.tcs.com ____________________________________________ Experience certainty. IT Services Business Solutions Outsourcing ____________________________________________ =====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you

3 2

Kamada kawai spring layout algorithm
by Meththa 11 Sep '07

11 Sep '07

Hi, I am a newbie to Boost and would like some help with implementing a program. I want to use the Kamada Kawai spring layout algorithm and I do not know what to pass for the final parameter when calling the function. the template of the function is given below. template<typename Graph, typename PositionMap, typename WeightMap, typename T, bool EdgeOrSideLength> bool kamada_kawai_spring_layout(const Graph & g, PositionMap position, WeightMap weight, unspecified edge_or_side_length); I do not understand what value needs to be given and what type for unspecified edge_or_side_length. Can someone please point me in the right direction with regards to this. Thanks ____________________________________________________________________________________Ready for the edge of your seat? Check out tonight's top picks on Yahoo! TV. http://tv.yahoo.com/

2 1

BGL adaption question
by Andreas Fabri 11 Sep '07

11 Sep '07

Hello, I adapt my own graph like data structures. They form a derivation hierarchy, and they are all in the same graph category. In order to avoid that I have to repeat the specializations of the graph traits, I put all the types needed in the base class, so the default graph traits, which just takes the types out of the class it is applied to, will get them from the base class or via inherited types from the base class. What can I do in order to repeat the definition of the functions source(..), target(..) etc. I could tell my users to downcast but that's not nice. I also could have #defines for all my classes so that I write the code only once, but all these solutions are not appealing. any suggestion? andreas

2 1

a question about message_queue
by nuaafantasy nuaafantasy 11 Sep '07

11 Sep '07

Dear All: My project use messge_queue to communicate between two processes. When I used the processes as normal process,it runs well. but It seems that the client process can't access the message queue if I set the server process as a windows services. can you help me about this? is this a problem about privilege? but message_queue do not have a option to set privileges. looking forward to your help!

2 2

Smart pointers operator=
by Alessandro Re 11 Sep '07

11 Sep '07

Hi, can please someone explain me why in boost's smart pointers (and also in auto_ptr, if there is a reason), there is no operator=(T *)? Shouldn't it work like reset()? Thanks -- ~Ale

3 5

If you are using the BGL and want to be listed here
by Andreas Fabri 11 Sep '07

11 Sep '07

Hello, On the page http://www.boost.org/libs/graph/doc/users.html it says: "If you are using the BGL and want to be listed here, please send mail to the Boost Users mailing list!" We would be glad if you added something like CGAL, the Computational Algorithms Library, offers external adaption for triangulations, polyhedral surfaces, and arrangements. These data structures become hence models of the BGL graph concept and allow to run BGL algorithms on them. http://www.cgal.org/Pkg/BGL Best regards, Andreas Fabri

1 0

[multi_index] erasing elements
by Jeff Holle 11 Sep '07

11 Sep '07

I'm using boost::multi_index obtained via CVS on Fri Jun 29 12:30:03 EDT 2007. In my application, I'm using a multi_index container that has one ordered index. Call the container Present and the index YIndex. I'm at the point in which I need to erase an element which returns a YIndex::iterator. Its important that I know the neighbors of the element erased with respect to the YIndex. I know that the element which I look for in the container must exist, so I have an assert that will fail if the searched for element isn't found. If I code it like this: YIndex& index=m_present.get<0>(); YIndex::iterator iter = index.begin(); for (;iter!=index.end();++iter) if (m_future.top().getEdges().first == iter->getEdge()) break; assert(iter!=index.end()); iter = index.erase(iter); The assert goes off the 4th time this code runs. If I change the code to this: Present::iterator iter = m_present.begin(); for (;iter!=m_present.end();++iter) if (m_future.top().getEdges().first == iter->getEdge()) break; assert(iter!=m_present.end()); iter = m_present.erase(iter); The application runs to completion, but since I need YIndex::iterators I can't code what is needed by my application. I'm assuming that calling erase corrupts the ordered index. What do I have to do to correct this?

2 1

[spirit]how to ignore the sequence of the rules?
by moosefly 11 Sep '07

11 Sep '07

For example, I want to parse the following text: <input type=hidden value=1> I have defined 2 rules match the "type" field and the "value" field, but the sequence of 2 rules is uncertain, that means "<input value=1 type=hidden>" is also legal,so I can't define the rules just like: rule_type >> !space_p >> rule_value The following works at this simple condition: ( (rule_type >> !space_p >> rule_value) | (rule_value >> !space_p >>rule_type ) ) But if there are many out-of-order fields need to parser, how can I ignore the sequence of the rules? Thanks, moosefly

1 0

Creating directory structure recursively using create_directories()
by Rajesh Jadhav 10 Sep '07

10 Sep '07

Hello All, I am trying to create a directory structure having 4 to 5 levels. When I try to call the boost::filesystem::create_directories(src); It throws an exception saying that path does not exist .So isn't create_directories() mean't for creating directory structure recursively or is there a other api which does it. I could not find Api's which can split the path ,and give the directory names in the path starting after the root directory up to leaf directory . I am attaching the sample code . #include <iostream> #include "boost/filesystem/operations.hpp" #include "boost/filesystem/path.hpp" #include "boost/filesystem/convenience.hpp" int main() { const char* srcPath = "C:\\tmp\\dir1\\dir2\\dir3\\"; (this structure does not exist) boost::filesystem::path src = boost::filesystem::path(srcPath, boost::filesystem::no_check); try { boost::filesystem::create_directories(relativepath); // throws exception if(src.has_branch_path()) { boost::filesystem::path branchpath = src.branch_path(); std::cout << branchpath.string(); // prints C: boost::filesystem::path rootpath = src.root_path(); std::cout << rootpath.string(); //prints C: boost::filesystem::path relativepath = src.relative_path(); std::cout << relativepath.string(); //prints tmp\\dir1\\dir2\\dir3\\ } } catch(std::exception& ex) { std::cout << ex.what() << std::endl; } return 0; } Thanks in advance for the replies. Rajesh

1 0