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

boost::shared_ptr and stl algorithms
by Bill Eidson 15 Apr '05

15 Apr '05

std::vector< boost::shared_ptr<T> > TVec; I want to write a function object to run std::for_each. to do somework against members of T and accumulate results in functor. My attempts have failed in VC7 with memory errors in my operator() method. struct fo { bool operator()( boost::shared_ptr<T>& t ) { return true; } }; Thanks in advance bille

5 9

BGL and reversing / moving edges
by joshrose 17 Dec '03

17 Dec '03

G'day, I was hoping someone might be able to tell me if they've run into any situations using BGL where they needed to move (or reverse (i.e. flip the source and target)) an edge within a graph implemented as an adjacency_list. I'm working on an implementation of an algorithm for max. weight bipartite matching ("the assignment problem"), and one of the assumptions in the algorithm is that non-matched edges are directed from one subgraph, A, to the other subgraph, B, and matched edges are directed the other way. Over the course of growing the matching, a simple way to add and remove edges from the candidate set is just to reverse the edge, thus the need for some way to reverse the edge within BGL. I don't think I can just remove and then re-add the edge in the other direction, primarily because doing so will (I believe) invalidate any edge_descriptors referring to that edge. In particular, there are property maps keeping track of the weight of edges, the predecessors of certain nodes, etc. that use edge descriptors as keys. I've spent a fair bit of time reading the documentation and looking through the implementation of adjacency_lists (incl. edge_list_impl), and I'm not really sure of a way to either move an edge directly within a graph, or even to create a new edge from another s.t. they have the same edge_descriptor (in general a bad thing, probably). Anyone have any thoughts on this? Thanks, -Josh

4 10

bug report: boost::tokenizer with VC6
by Navi Singh 09 Feb '03

09 Feb '03

The boost release 1.28.0 of the tokenizer library has the following problem: There are 5 examples, namely, simple_example_1.cpp thru simple_example_5.cpp If I change the main() in each of the 5 to to main1() thru main5() and return 0; the vc60 compiler generates an internal compiler error when parsing the file boost\iterator_adapters.hpp on line 869, where it is parsing the following lines: reference operator*() const { return policies().dereference(*this); }

3 2

Q: Graphs. Sorting edges. Possible? How to?
by stas_fomin 07 Nov '02

07 Nov '02

Hello. I a newbie in BGL and I rewrite my LEDA code now... I have to sort (order) edges according to some functor. For example (simplified): typedef adjacency_list<vecS, vecS, bidirectionalS> MyGraph; typedef graph_traits < MyGraph >::edge_descriptor MyGraphEdge; typedef graph_traits < MyGraph >::edge_iterator MyEdgeIter; class MyCompareEdges{ public: bool operator()(MyGraphEdge e1, MyGraphEdge e2) const { return true; } }; .... { MyGraph Gr(10); MyEdgeIter ei_beg, ei_end; MyCompareEdges comp; tie(ei_beg, ei_end) = edges(Gr); std::sort(ei_beg, ei_end, comp); //Error C2676 } And I have error C2676 (below the message...). Questions: 1. Is it possible to sort edges in the graph? 2. How to... Thanks all in advance... Stas Fomin. P.S. vecS, setS, listS for edge container... - C2676. ------------------------------ d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp(264) : error C2676: binary '+=' : 'class std::list<struct boost::list_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost:: no_property> > >::iterator' does not define this operator or a conversion to a type acceptable to the predefined operator d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp (911) : see reference to function template instantiation 'void __thiscall boost::default_iterator_policies::advance(struct boost::iterator_adaptor<class std::list<struct boost::lis t_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost::no_property> > >::iterator,struct boost::detail::undirected_edge_iter_policies,class boost::detail::edge_desc_impl<struct boost::b idirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int> *,struct boost::multi_pass_input_iterator_tag,int> &,i nt)' being compiled Error executing cl.exe.

4 7

[BGL] How to change the type of vertex_descriptor??
by Erik Arner 14 Sep '02

14 Sep '02

Hi, I have a BGL graph in the following manner: typedef adjacency_list < vecS, vecS, directedS, no_property, property <edge_weight_t, int, property <edge_weight2_t, double> > > Graph; I also have: typedef graph_traits<Graph>::vertex_descriptor Vertex; Now, the default vertex_descriptor seems to be unsigned int. How do I change this to int? Also, where (in which file) is the default set? On another note: the online reference manual is pretty good in my opinion, but it's hard to get a real overview of the contents. It also lacks an index, making it hard to look up questions like the one above. Is the book any better in this respect? Any other references worth looking up - books or webpages? Thanks, Erik

3 4

[BGL] Problem with kevin-bacon sample
by Nicolas Guilhot 14 Sep '02

14 Sep '02

Hi all, I compiled the kevin-bacon sample on a linux box without any problem, but when I try to run the program, I obtain an error output instead of what is expected. Any help would be appreciated. Here is the output off the program : kevin-bacon: /boost_1_27_0/boost/token_iterator.hpp:75: void boost::detail::tokenizer_policy<Type, TokenizerFunc>::increment (Iterator &) [with Iterator = boost::iterator_adaptor<boost::detail::token_iterator_base<const char *>, boost::detail::tokenizer_policy<basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >, boost::char_delimiters_separator<char, string_char_traits<char> > >, basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >, const basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > &, const basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > *, forward_iterator_tag, ptrdiff_t>, Type = basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >, TokenizerFunc = boost::char_delimiters_separator<char, string_char_traits<char> >]: Assertion `b.base().valid_' failed. Abandon Thanks for any answer. Nicolas

2 1

regex performance
by Paul Dubuc 17 Aug '02

17 Aug '02

I'm doing some performance comparisons between Rogue Wave's Regexp class (http://www.roguewave.com/support/docs/tlsref/rwcregexp.cfm) and boost::regex using simple expressions like "^metal.*" and "[0-9]+" with regex_search(). regex is slower by a factor of 6, measuring cpu time (on a SunBlade 100 runing Solaris 8). Is there anything I can do to speed it up? I tried using different values of boost::regbase::flag_type_ to adjust how the regular expressions are interpreted, but with little effect. Any other ideas? (I'm using boost_1_27_0.) Thanks, -- Paul M. Dubuc

7 12

uBLAS Observation: terrible execution speed for prod(matrix,prod(matrix,prod(matrix,matrix)))
by Walter Bowen 05 Aug '02

05 Aug '02

Hi, I am new to uBLAS. I am looking to see if it will be useful for my application (I develop 6-Degrees-of-freedom flight simulations used to analyze avionics systems.) I have benchmarked a few lines of code with RogueWave's Math.h++ (testing for execution speed) and made the following observation. Observation 1) For matrix products of two small (~3-by-3) matrices ( i.e., prod(smallMat1, smallMat2) ) uBLAS executes MUCH FASTER than Math.h++. Observation 2) For matrix produces of two large matrices (100 by 100) uBLAS and Math.h++ give similar execuation speed. Obervation 3) (This is the kicker...) for strung-together matrix products like "Mat1 * Mat2 * Mat3 * Mat4 * Mat5", which I am implementing as "prod(Mat1, prod(Mat2, prod( Mat3, prod(Mat4,Mat5) ) ) ) Math.h++ is MUCH MUCH FASTER than uBLAS. -- by ~2 orders OF MAGNITUDE! I believe that this is a characteristic of the scalability of template expressions. My question is this: Is there a way I an instruct uBLAS not to use template expressions when for strung-together matrix products? Regards, Walt

5 4

collection container
by Bohdan 01 Aug '02

01 Aug '02

Has boost any plans on creating container, that holds data by pointer, not by value? Rationale: It is impossible to use normally vector<...> for types that do not have copy constructor. Interface of vector< shared_ptr<...> > doesn't seems to be very convenient( for example with std::algorithms ). And most of all it is not good idea to show vector< shared_ptr<...> > interface to user of my lib, that wants to have container::iterator with normal behavior. AFAIK majority of existing libraries have/need such container ? As to me it is strange that neither stl nor boost have such class. I'm missing 'something' and there are important reasons for not doing this ?

2 5

Creating groups of regular expressions
by cyndi_r2002 01 Aug '02

01 Aug '02

Hi, I have started using Regex++ and like it a lot but is there a way to use grouping constructs using Regex++ / any alternative that would provide the same functionality? Thanks, Cyndi

2 1

boost working with CGAL ??
by Matthias Kronenberger 31 Jul '02

31 Jul '02

I want to use CGAL from http://www.cgal.org together with the boost library. I'm using MSVC 6.5 There seem to be some problems related to namespace issues. I'm getting the following kind of errors: d:\matthias\programmieren\cgal\include\cgal\number_utils.h(236): error C2955: 'is_integral': Fuer die Verwendung einer Vorlagenklasse ist eine Vorlagen-Argumentliste erforderlich d:\matthias\programmieren\boost\boost\type_traits\arithmetic_traits.hpp(38): Siehe Deklaration von 'is_integral'

1 0

Cannot put .o File with Graph Code into .a File
by Adalbert Perbandt 30 Jul '02

30 Jul '02

Hi there, while trying to setup the BGL for use in my environment I'm facing a strange behavior when I try to put a C++ object file which contains instanciations of BGL templates into an object library. My environment: - Sun SPARC machine with Solaris 2.7 (SunOS 5.7) - gcc 2.95.2 The problem shows up when I try to put an .o file into a library file. I can reproduce the error with the file adjacency_list.cpp from the BGL's examples directory: $ pwd /home/perbandt/boost_1_28_0/libs/graph/example $ g++ --version 2.95.2 $ g++ -g -I../../../../boost_1_28_0 -c adjacency_list.cpp $ ls -l adjacency_list.o -rw-r--r-- 1 perbandt relman 3367052 Jul 19 18:40 adjacency_list.o $ which ar /usr/ccs/bin/ar $ ar rv libtest.a adjacency_list.o a - adjacency_list.o Bus error When I try a .a file with already one or more .o files in it I get a segmentation fault. With another file that contains instantiations of BGL templates the problem does appear only when it was compiled with the -g option given. Is this a known problem? Seems to me as if ar would have trouble handling the very long symbol names in the .o file. Or is something wrong with my environment? Thanks, Adalbert Perbandt.

3 4

RE: [Boost-Users] absolute beginner, trying to compile
by James Zappia 30 Jul '02

30 Jul '02

It should be /usr/include/boost Then you can do: #include <boost/whatever.h> /usr/include is the base directory. So how you have it now it would be: #include <boost_1_28_0/boost/whatever.h> And you definitely don't want to do that. Regards, James -----Original Message----- From: thomas strack [mailto:yg-boost-users@gmane.org] Sent: Tuesday, July 30, 2002 10:17 AM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] absolute beginner, trying to compile hi there, unfortunately im not very experienced in c/c++. but i want to try out some functions from the boost libs. so i downloaded and extracted the files (1_28_0) to /usr/include/boost_1_28_0. i think i should be able to use most of the functions now(i hope i didnt misunderstand the doc). i want to use dir_it lib, but i cant compile the testfile coming along with boost. it includes <boost/directory.h> and g++ cant find this file. i dont know exactly how to use the -I and -l options. it would be great if someone could help me out. thx,tommi Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

absolute beginner, trying to compile
by thomas strack 30 Jul '02

30 Jul '02

hi there, unfortunately im not very experienced in c/c++. but i want to try out some functions from the boost libs. so i downloaded and extracted the files (1_28_0) to /usr/include/boost_1_28_0. i think i should be able to use most of the functions now(i hope i didnt misunderstand the doc). i want to use dir_it lib, but i cant compile the testfile coming along with boost. it includes <boost/directory.h> and g++ cant find this file. i dont know exactly how to use the -I and -l options. it would be great if someone could help me out. thx,tommi

1 0

Boost.Lambda - Invoking functors stored in a vector
by Thomas Wenisch 30 Jul '02

30 Jul '02

Hi all, I am storing a set of functors to be invoked in a vector, like this: std::vector< boost::function<void> > functors; At a later time, I would like to invoke each of the functors in the vector. I am trying to do this using Boost.Lambda, to start learning about the Lambda library, but I can't figure out what to write. if I write: std::for_each(functors.begin(), functors.end(), _1); None of the functions are invoked. if I try: for_each(funtors.begin(), functors.end(), _1()); I get compile errors. I suspect this is because the lamda expression is being executed immediately instead of getting passed in to for_each. Everything works fine when I use a separate Invoker function in the usual fashion, like this: void Invoker( boost::function<void> functor) { functor(); } std::for_each(funtors.begin(), functors.end(), Invoker); How can I get the lambda library to invoke each function in the vector? More generally, if the functions were function<void, T>, how could I bind the T parameter in the lambda expression? Thanks for any help, Tom Wenisch Computer Architecture Lab Carnegie Mellon University

2 1

Johnsons BGL implementation for undirected graphs correct?
by Jan de Ruiter 29 Jul '02

29 Jul '02

When I use the BGL johnsons_all_pairs_shortest_paths example (source below)on an undirected graph, some results are quite wrong. For example, the output shows that the distance between node 1 and 6 equals 36. The SP however (1-4-5-8-9-6) = 4+4+4+12+2 = 26. Is there something wrong with me or is the BGL implementation incorrect? Any ideas? Jan de Ruiter //Output 0 1 2 3 4 5 6 7 8 9 0 0 99 111 123 103 107 135 105 111 123 1 -99 0 12 24 4 8 36 6 12 24 2 -111 -12 0 12 -8 -4 24 -6 0 12 3 -123 -24 -12 0 -20 -16 12 -18 -12 0 4 -103 -4 8 20 0 4 32 2 8 20 5 -107 -8 4 16 -4 0 28 -2 4 16 6 -135 -36 -24 -12 -32 -28 0 -30 -24 -12 7 -105 -6 6 18 -2 2 30 0 6 18 8 -111 -12 0 12 -8 -4 24 -6 0 12 9 -123 -24 -12 0 -20 -16 12 -18 -12 0 ------------------------------------------------------------------------- //Source #include <boost/config.hpp> #include <fstream> #include <iostream> #include <vector> #include <iomanip> #include <boost/property_map.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graphviz.hpp> #include <boost/graph/johnson_all_pairs_shortest.hpp> int main() { using namespace boost; typedef adjacency_list<vecS, vecS, undirectedS, no_property, property< edge_weight_t, int, property< edge_weight2_t, int > > > Graph; const int V = 10; typedef std::pair < int, int >Edge; Edge edge_array[] = { Edge(0,1), Edge(1,2), Edge(2,3), Edge(1,4), Edge(2,5), Edge(3,6), Edge(4,5), Edge(5,6), Edge(4,7), Edge(5,8), Edge(6,9), Edge(7,8), Edge(8,9) }; const std::size_t E = sizeof(edge_array) / sizeof(Edge); Graph g(edge_array, edge_array + E, V); property_map < Graph, edge_weight_t >::type w = get(edge_weight, g); int weights[] = { 99, 12, 12, 4, 99, 12, 4, 99, 2, 4, 2, 99, 12 }; int *wp = weights; graph_traits < Graph >::edge_iterator e, e_end; for (boost::tie(e, e_end) = edges(g); e != e_end; ++e) w[*e] = *wp++; std::vector < int >d(V, std::numeric_limits < int >::max()); int D[V][V]; johnson_all_pairs_shortest_paths(g, D, distance_map(&d[0])); std::cout << std::setw(5) <<" "; for (int k = 0; k < 10; ++k) std::cout << std::setw(5) << k ; std::cout << std::endl; for (int i = 0; i < 10; ++i) { std::cout <<std::setw(5) << i ; for (int j = 0; j < 10; ++j) { std::cout << std::setw(5) << D[i][j] ; } std::cout << std::endl; } return 0; }

4 4

[BGL] Detection of cycles in graphs
by Erik Arner 29 Jul '02

29 Jul '02

This is a repost - I sent it last friday but it hasn't shown up, so I'll try again: Is there an algorithm implemented in BGL that detects whether a directed graph contains cycles or not? If not, what would be the best way to implement such an algorithm? Thanks, Erik

2 1

Pass through buffer
by Tom Howard 29 Jul '02

29 Jul '02

Hi, I'm wondering if someone can help me with the pass through buffer (basic_passthrubuf) that is part of more_io. >From what I can understand the pass though buffer passes 1 character at a time to (and from) the underlying stream buffer and I'm wondering what happens with flushes. In the code I'm working on (gzostreambuf which writes to an ostream) I need to know is overflow() is being called because there is no more room in the buffer I'm using or because of an explicit flush. In the later case I need to also flush the compression (Z_SYNC_FLUSH), but doing so all the time will degrade the compression performance plus increase the number of flushes to the underlying stream. This is particularly bad as the underlying stream in my case is a socket stream an the increased flushes breaks up the data into many small packets. Because of the software at the other end of the socket, data must be sent as one message unless it's over 8096 bytes. So basically I only want to flush the underlying stream if the gzostreambuf has been flushed (either by endl or flush). is this possible? My current workaround is to make sure the buffersize of my gzostreambuf is greater than or equal to the buffersize of the underlying stream, but I was hoping there was a neater solution and thats why I was looking at the pass through buffer. >From what I unbderstand, If I use the pass through buffer as part of my gzostreambuf, then flushing will not be passed to the underling streambuf at all. This means that data sent to the stream may be compressed, but result in no output for quite some time later and this sort of latency would be unacceptable in the software I'm working on (client-server multi-agent simulation). Cheers, Tom Howard

1 0

regex_search matches correctly but memory holder contains wrong value
by Anibal Jodorcovsky 29 Jul '02

29 Jul '02

Hi all, I have a small problem when trying out a regex that works ok with both jakarta (java code) and Perl. However, in boost::regex I get an extra space that's very weird. This is the code: #include <iostream> #include <string> #include <boost/regex.hpp> main() { static const boost::regex infileRedirection( "\\[(.+?)\\s*=\\s*(.+?)\\]" ); const string input = "[IN_FILE_REDIRECTION = STARTS_3]"; boost::cmatch what; if ( boost::regex_search( input, what, infileRedirection, boost::regbase::perl ) ) { cerr << "Matched! == input is (" << input << ")" << endl; string mySection; mySection.assign( what[1].first, what[1].second ); string newSectionName; newSectionName.assign( what[2].first, what[2].second ); cerr << "mySection is: --" << mySection << "--" << endl; cerr << "newSection is: --" << newSectionName << "--" << endl; } else { cerr << "Didn't match" << endl; } return 0; } And this is the output: [anibal@anibal ControlFile]$ ./a.out Matched! == input is ([IN_FILE_REDIRECTION = STARTS_3]) mySection is: --IN_FILE_REDIRECTION-- newSection is: -- STARTS_3-- Please note the extra space in the newSection. That should be STARTS_3 and not " STARTS_3". Why is it taking that space if the space itself is not in the () expression? Any help greatly appreciated, -Anibal

2 1

Compilation problem
by Sergey Belovolov 29 Jul '02

29 Jul '02

gcc version 2.95.3 20010315 (release). It came with OS (SunOS 5.8 x86). After when I compiled & installed bjam I came into boost root dir and give (as it suggessted in docs): bjam "-sTOOLS=gcc". It builds 3 library: libboost_regex.a, libboost_regex.so, libboost_thread.a (while bjam builds library libboost_thread.a it throws messages: " g++: unrecognized option '-pthreads' "). Then I copy them into some dir that included in LD_LIBRARY_PATH environment varyable and copy dir boost to /usr/include. Then I create file with contents: #include <boost/thread/mutex.hpp> main() { return 0; } and compile it with: g++ test.cpp. Results: In file included from /opt/sfw/lib/gcc-lib/i386-pc-solaris2.8/2.95.3/../../../../include/g++-3/uti lity:31, from /usr/include/boost/config/select_stdlib_config.hpp:18, from /usr/include/boost/config.hpp:40, from /usr/include/boost/thread/mutex.hpp:15, from test.cpp:1: /opt/sfw/lib/gcc-lib/i386-pc-solaris2.8/2.95.3/../../../../include/g++-3/stl _relops.h: In function `bool rel_ops::operator !=(const _Tp &, const _Tp &)': /opt/sfw/lib/gcc-lib/i386-pc-solaris2.8/2.95.3/../../../../include/g++-3/stl _relops.h:37: template with C linkage /opt/sfw/lib/gcc-lib/i386-pc-solaris2.8/2.95.3/../../../../include/g++-3/stl _relops.h: In function `bool rel_ops::operator >(const _Tp &, const _Tp &)': /opt/sfw/lib/gcc-lib/i386-pc-solaris2.8/2.95.3/../../../../include/g++-3/stl _relops.h:42: template with C linkage /opt/sfw/lib/gcc-lib/i386-pc-solaris2.8/2.95.3/../../../../include/g++-3/stl _relops.h: In function `bool rel_ops::operator <=(const _Tp &, const _Tp &)': /opt/sfw/lib/gcc-lib/i386-pc-solaris2.8/2.95.3/../../../../include/g++-3/stl _relops.h:47: template with C linkage /opt/sfw/lib/gcc-lib/i386-pc-solaris2.8/2.95.3/../../../../include/g++-3/stl _relops.h: In function `bool rel_ops::operator >=(const _Tp &, const _Tp &)': /opt/sfw/lib/gcc-lib/i386-pc-solaris2.8/2.95.3/../../../../include/g++-3/stl _relops.h:52: template with C linkage and so on and so on... What's wrong? Why it says that STL templates use C linkage? Thanks for help in advance. Sergey Belovolov. b_sv(a)mail.ru SBelovolov(a)algorithm.aelita.com

1 0

Installation problems
by fauzia_sharmeen 28 Jul '02

28 Jul '02

Hi, After downloading and unzipping the Regex library with the -d option, I ran nmake -fvc6.mak on the command prompt.However, I am getting an error message saying "Variable MSVCDIR not set". I checked the VcVars32.bat file to verify that the variable MSVCDIR has been set properly. Any ideas/suggestions about what I am doing wrong would be most appreciated. Thanks, Fauzia

4 3

Iterator problem with adjacent_vertices
by EJ van Eijk 28 Jul '02

28 Jul '02

Hello, I'm currently implementing some algorithms for drawing graphs, using boost::graph. PropertyMaps e.a. are working like a charm, but for my algorithm I need to find the adjacent vertices. Now I've become stuck on the following: typedef boost::adjacency_list < boost::mapS, boost::vecS, boost::undirectedS, VertexProperty, EdgeProperty> Graph; typedef boost::graph_traits<Graph>::vertex_descriptor Vertex; class functor { ... void operator()(Vertex& v) { ... }; }; for_each(adjacent_vertices(u,g).first, adjacent_vertices(u,g).second, functor<Graph>(g)); complains about foo.cc:30: initialization of non-const reference type `Vertex &' foo.cc:30: from rvalue of type `unsigned int' But, when using vertices(g) instead of adjacent_vertices(v,g), the code compiles, and applies functor to each vertex. What am I missing? The documentation is quite thorough, but I'm lost at the moment... EJ

1 0

Re: [Boost-Users] XML
by dick.bridges＠tais.com 26 Jul '02

26 Jul '02

What you say is true. In fact, it's *STILL* true. In the meantime, Xerces has released version 1.7.0 and, most recently, version 2.0. I've been following the Xalan mail lists and comments from some of the developers suggest that co-ordination between the two groups could be better. This "thread" probably belongs on xalan-c-users(a)xml.apache.org. Mail me direct to continue. Albrecht Fritzsche <albrecht.fritzsche@tisc To: Boost-Users(a)yahoogroups.com ali-dsl.de> cc: Subject: Re: [Boost-Users] XML 07/26/2002 11:33 AM Please respond to Boost-Users dick.bridges(a)tais.com wrote: > Unfortunately, the Xerces and Xalan projects don't appear to > be all that well co-ordinated. Makes it difficult to stay both > current and compatible. Huh - why do you think that? Simply reading the FAQ gives me "The Xalan-C++ release notes includes information about the Xerces-C++ release with which the Xalan-C++ release has been coordinated and tested." and even the Readme says "Xalan-C++ version 1.3 has been tested with Xerces-C++ version 1.6.0. Each Xalan-C++ version 1.3 download includes the Xerces-C++ distribution for the specified platform." Curious Ali Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

RE: [Boost-Users] XML
by dick.bridges＠tais.com 26 Jul '02

26 Jul '02

Xerces is ok for xml+namespaces but if you want to use additional facilities (e.g., XPath, XSLT, etc.) you'll have to go to other packages like Xalan. Unfortunately, the Xerces and Xalan projects don't appear to be all that well co-ordinated. Makes it difficult to stay both current and compatible. It sure would be nice to have a "boost-level" C++ library for xml but I'm not sure we could sell the idea that it should be "part of" C++. Hope I'm wrong. schalk_cronje@na i.com To: Boost-Users(a)yahoogroups.com cc: 07/26/2002 10:14 Subject: RE: [Boost-Users] XML AM Please respond to Boost-Users > I'm writing an XML based project right now. I haven't been > able to find > any good, open source XML parser to incorporate into my > application, so I What's wrong with Xerces? Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

3 2

RE: [Boost-Users] Re: [boost] Iterator Adaptor Poll
by Mark Storer 26 Jul '02

26 Jul '02

May i recommend providing both the "hello world" grade example, and something more real-world... like that path token iterator you mentioned? --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

1 0