- Boost-users - lists.boost.org

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