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

RE: (unknown)
by Mark Storer 24 Sep '02

24 Sep '02

Nope. Container-agnostic code is a red herring. Don't bother, you'll only be waisting your time. "Effective STL" covers this in detail in Chapter 1, item 2, far better than anything I could come up with. You might be able to come up with 'map' and 'everything else' versions of your code, but even that will have some unexpected side effects. Now, having said all that, here's an idea (I seem to be developing a habit of contradicting myself): Accept as part of the enumerator template an 'accessor', one that would default to returning the contents of the iterator, but could be replaced with something that extracted "->second". Your code would end up looking something like this: // WARNING: This code hasn't been anywhere near a compiler. template <typename T> struct accessor { typedef T::value_type accessee; accessee &operator()( T &t ) { return *T; } }; template <typename T> struct map_accessor { typedef T::value_type::second accessee; accessee &Map_Accessor( T &t ) { return t->second; } }; template <typename T, typename acc = Accessor<T>> EnumCols( T &begin, T &end, acc accessor ) { T cur; if(begin == end) return; // get matrix width size_t rows = acc( begin ).size(); for(int i = 0; i < rows; ++i) { cur = begin; while(cur != end) { // a useful EnumCols would have to take some // sort of function as a paramenter and use // it to replace DO_STUFF below DO_STUFF( acc(cur)[i] ); ++cur; } } } EnumCols( matrix.begin(), matrix.end(), Map_Accessor<matrix's type> ); // for maps or EnumCols( matrix.begin(), matrix.end()); // for everything else These function templates could either exist stand-alone, or as some sort of 'container-traits'. The traits tact would force you to wrap all the containers you actually wanted to use with templates that defined the appropriate traits, but would allow the actual enumeration code to be considerably cleaner (through default template params). But all this involves rolling your own code, which would place this conversation firmly in the "other" boost list. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Antonio Piccolboni [mailto:antonio_piccolboni@affymetrix.com] Sent: Tuesday, September 24, 2002 12:01 PM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] (unknown) Dear Boosters Suppose you have a matrix represented raw-wise with a vector< vector <float > > and you want to iterate over the coloumns. Easy with the projection adaptor. But life is never so easy. My matrix is represented raw wise by a map <vector <float> > and I need the same kind of iterator. There is no way I can get my code to compile. I think the problem is that vector iterators return values, map iterators retun pairs <key,value> (that is, references to the above). And this seems not only to doom my attempt at defining this n-th dim projection iterator, but even more so and fundamentally, it seem to preclude my ultimate goal of defining a projection for any container1 <containr2 < element_type > > where container2 two is random access. Any help would be appreciated and if I make it to the larger goal, I will return it to the community. Thanks Antonio Header #ifndef GRAPH_H #define GRAPH_H #include <boost/config.hpp> #include <vector> #include <iostream> #include <iterator> #include <algorithm> #include <boost/iterator_adaptors.hpp> //typedef pair<long, vector<float> > graph_element; typedef vector<float> graph_element; template <int index> struct select_component { typedef pair < long, graph_element > argument_type; typedef float result_type; const float & operator()(const graph_element & r) const { return r.second[index]; } float & operator()(graph_element & r) const { return r.second[index]; } }; #endif Would be test code #include "graph.h" #include <map> #include<vector> int main(int, char*[]) { typedef map < long, graph_element > graph; graph aGraph; aGraph[0].push_back(0.00); aGraph[0].push_back(0.01); aGraph[0].push_back(0.02); aGraph[1].push_back(0.10); aGraph[1].push_back(0.11); aGraph[1].push_back(0.12); aGraph[2].push_back(0.20); aGraph[2].push_back(0.21); aGraph[2].push_back(0.22); aGraph[3].push_back(0.30); aGraph[3].push_back(0.31); aGraph[3].push_back(0.32); boost::projection_iterator_generator < select_component < 0 >, graph::iterator >::type graph_first(aGraph.begin()), graph_last(aGraph.end()); copy(graph_first, graph_last, ostream_iterator<float>(cout, "\n")); cout << endl; } Post-modern error message cd /home/apicco/src/analysis/transcriptome/transmap/ g++ -g -I/home/apicco/install/boost_1_28_0 -o graph-test graph-test.C /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp: In method `typename IteratorAdaptor::reference boost::projection_iterator_policies<AdaptableUnaryFunction>::dereferen ce (const IteratorAdaptor &) const [with IteratorAdaptor = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, AdaptableUnaryFunction = select_component<0>]': /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:867: instantiated from `boost::iterator_adaptor<Base, Policies, Value, Reference, Pointer, Category, Distance>::operator* () const [with Base = _Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, Policies = boost::projection_iterator_policies<select_component<0> >, Value = float, Reference = float &, Pointer = float *, Category = boost::detail::default_argument, Distance = boost::detail::default_argument]' /usr/include/g++-3/stl_algobase.h:129: instantiated from `__copy (_InputIter, _InputIter, _OutputIter, input_iterator_tag, _Distance *) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>, _Distance = ptrdiff_t]' /usr/include/g++-3/stl_algobase.h:161: instantiated from `__copy_dispatch<_InputIter, _OutputIter, _BoolType>::copy (_InputIter, _InputIter, _OutputIter) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>, _BoolType = __true_type]' /usr/include/g++-3/stl_algobase.h:188: instantiated from `copy (_InputIter, _InputIter, _OutputIter) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>]' graph-test.C:30: instantiated from here /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:1247: no match for call to `(const select_component<0>) (pair<const long int, graph_element> &)' graph.h:19: candidates are: const float &select_component<index>::operator() (const graph_element &) const [with int index = 0] graph.h:22: float &select_component<index>::operator () (graph_element &) const [with int index = 0] Compilation exited abnormally with code 1 at Tue Sep 24 11:14:11 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

projection iterator onto the k-th dimension
by Antonio Piccolboni 24 Sep '02

24 Sep '02

Reporting some progress wrt my previous post and adding a meaningful title. The code doesn't break on the iterator def but at the first usage. Error is (translated) can't convert return value of unary func obj to float &. Note that () returns float & Current code #ifndef GRAPH_H #define GRAPH_H #include <boost/config.hpp> #include <vector> #include <iostream> #include <iterator> #include <algorithm> #include <boost/iterator_adaptors.hpp> typedef vector<float> graph_element; template <int index> struct select_component { typedef pair < long, graph_element > argument_type; typedef float result_type; const float & operator()(const argument_type & r) const { return r.second[index]; } float & operator()(argument_type & r) const { return r.second[index]; } }; #endif Use case #include "graph.h" #include <map> #include<vector> int main(int, char*[]) { typedef map < long, graph_element > graph; graph aGraph; aGraph[0].push_back(0.00); aGraph[0].push_back(0.01); aGraph[0].push_back(0.02); aGraph[1].push_back(0.10); aGraph[1].push_back(0.11); aGraph[1].push_back(0.12); aGraph[2].push_back(0.20); aGraph[2].push_back(0.21); aGraph[2].push_back(0.22); aGraph[3].push_back(0.30); aGraph[3].push_back(0.31); aGraph[3].push_back(0.32); boost::projection_iterator_generator < select_component < 0 >, graph::iterator >::type graph_first(aGraph.begin()), graph_last(aGraph.end()); // copy(graph_first, graph_last, // ostream_iterator<float>(cout, "\n")); cout << *graph_first; cout << endl; } Postmodern error message: cd /home/apicco/src/analysis/transcriptome/transmap/ g++ -g -I/home/apicco/install/boost_1_28_0 -o graph-test graph-test.C /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp: In method `typename IteratorAdaptor::reference boost::projection_iterator_policies<AdaptableUnaryFunction>::dereferen ce (const IteratorAdaptor &) const [with IteratorAdaptor = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, AdaptableUnaryFunction = select_component<0>]': /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:867: instantiated from `boost::iterator_adaptor<Base, Policies, Value, Reference, Pointer, Category, Distance>::operator* () const [with Base = _Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, Policies = boost::projection_iterator_policies<select_component<0> >, Value = float, Reference = float &, Pointer = float *, Category = boost::detail::default_argument, Distance = boost::detail::default_argument]' graph-test.C:31: instantiated from here /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:1247: could not convert `(this + 1)->select_component<index>::operator()((&pair<long int,vector<float, allocator<float> > >((+(+(+iter)->boost::iterator_adaptor<Base, Policies, Value, Reference, Pointer, Category, Distance>::base())->_Rb_tree_iterator<_Value, _Ref, _Ptr>::operator* ()))))' to `float &' Compilation exited abnormally with code 1 at Tue Sep 24 14:52:21

1 0

grid graph for BGL
by toddgleason 24 Sep '02

24 Sep '02

Hi, I'm new to using the BGL, and have been working on a problem that uses a directed acyclic grid graph and subgraphs, and computes shortest paths. In my problem, the subgraphs are determined by paths from one end to the other. It is possible to determine in constant time whether a grid point or edge is within the graph, by looking at the paths bounding the subgraph. I started out using adjacency_list and filtered_graph to limit the graph, but this is not optimal because adjacency_list iterates over all vertices in the original graph to filter them. Ideally I'd like to use the indices from the master graph but be able to dynamically iterate over them according to the computations the code performs to limit the scope of the graphs. However, I'm not sure if anyone has done anything like this, and I'm a little frightened of trying to write my own graph class into the BGL structure. (I've never dealt with such heavily templated code before, and am even more confused than when looking at the STL!) Are there any pointers anyone can give me that would make it easier to construct such a class? Another option I'll throw out: Might it be simpler to hack one of the shortest paths algorithms to do a better job of restricting itself based on the dynamic subgraph filtering? I considered this (the code looks shorter and simpler), but it'd be cleaner to have a new graph class. Thanks to any who can help me. Also, I'm using VC++ 6 so all the problems with partial template specialization (which I don't even understand) apply to me. --Todd C. Gleason

3 3

None
by Antonio Piccolboni 24 Sep '02

24 Sep '02

Dear Boosters Suppose you have a matrix represented raw-wise with a vector< vector <float > > and you want to iterate over the coloumns. Easy with the projection adaptor. But life is never so easy. My matrix is represented raw wise by a map <vector <float> > and I need the same kind of iterator. There is no way I can get my code to compile. I think the problem is that vector iterators return values, map iterators retun pairs <key,value> (that is, references to the above). And this seems not only to doom my attempt at defining this n-th dim projection iterator, but even more so and fundamentally, it seem to preclude my ultimate goal of defining a projection for any container1 <containr2 < element_type > > where container2 two is random access. Any help would be appreciated and if I make it to the larger goal, I will return it to the community. Thanks Antonio Header #ifndef GRAPH_H #define GRAPH_H #include <boost/config.hpp> #include <vector> #include <iostream> #include <iterator> #include <algorithm> #include <boost/iterator_adaptors.hpp> //typedef pair<long, vector<float> > graph_element; typedef vector<float> graph_element; template <int index> struct select_component { typedef pair < long, graph_element > argument_type; typedef float result_type; const float & operator()(const graph_element & r) const { return r.second[index]; } float & operator()(graph_element & r) const { return r.second[index]; } }; #endif Would be test code #include "graph.h" #include <map> #include<vector> int main(int, char*[]) { typedef map < long, graph_element > graph; graph aGraph; aGraph[0].push_back(0.00); aGraph[0].push_back(0.01); aGraph[0].push_back(0.02); aGraph[1].push_back(0.10); aGraph[1].push_back(0.11); aGraph[1].push_back(0.12); aGraph[2].push_back(0.20); aGraph[2].push_back(0.21); aGraph[2].push_back(0.22); aGraph[3].push_back(0.30); aGraph[3].push_back(0.31); aGraph[3].push_back(0.32); boost::projection_iterator_generator < select_component < 0 >, graph::iterator >::type graph_first(aGraph.begin()), graph_last(aGraph.end()); copy(graph_first, graph_last, ostream_iterator<float>(cout, "\n")); cout << endl; } Post-modern error message cd /home/apicco/src/analysis/transcriptome/transmap/ g++ -g -I/home/apicco/install/boost_1_28_0 -o graph-test graph-test.C /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp: In method `typename IteratorAdaptor::reference boost::projection_iterator_policies<AdaptableUnaryFunction>::dereferen ce (const IteratorAdaptor &) const [with IteratorAdaptor = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, AdaptableUnaryFunction = select_component<0>]': /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:867: instantiated from `boost::iterator_adaptor<Base, Policies, Value, Reference, Pointer, Category, Distance>::operator* () const [with Base = _Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, Policies = boost::projection_iterator_policies<select_component<0> >, Value = float, Reference = float &, Pointer = float *, Category = boost::detail::default_argument, Distance = boost::detail::default_argument]' /usr/include/g++-3/stl_algobase.h:129: instantiated from `__copy (_InputIter, _InputIter, _OutputIter, input_iterator_tag, _Distance *) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>, _Distance = ptrdiff_t]' /usr/include/g++-3/stl_algobase.h:161: instantiated from `__copy_dispatch<_InputIter, _OutputIter, _BoolType>::copy (_InputIter, _InputIter, _OutputIter) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>, _BoolType = __true_type]' /usr/include/g++-3/stl_algobase.h:188: instantiated from `copy (_InputIter, _InputIter, _OutputIter) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>]' graph-test.C:30: instantiated from here /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:1247: no match for call to `(const select_component<0>) (pair<const long int, graph_element> &)' graph.h:19: candidates are: const float &select_component<index>::operator() (const graph_element &) const [with int index = 0] graph.h:22: float &select_component<index>::operator () (graph_element &) const [with int index = 0] Compilation exited abnormally with code 1 at Tue Sep 24 11:14:11

1 0

Borland C++ Builder 5.5 & scoped_ptr
by Brian Neal 24 Sep '02

24 Sep '02

I'm new here; I searched the Yahoo archive and didn't see anything about this so I apologize if this has been discussed before. Today I learned (the hard and painful way) that there is a bug in Borland C++ Builder 5.5 such that when compiling with debug support, the compiler thinks it needs to generate destructors in the wrong translation units. We noticed this because we were using the "handle-body" idiom with auto_ptr's (taking all the precautions from Herb Sutter's Exceptional C++ books) and our destructors were not getting called. We switched over to boost::shared_ptr's and the handy-dandy compile time check in the destructor for incomplete types was firing...but in the code that uses and declares objects of the classes that have the handle-body idiom...a pretty serious bug in my view. We then tried to compile the example code from boost for scoped_ptr and it would not compile for the same reason. A quick search of the newsgroups reveals that others have found this bug, and C++ Builder is the only major compiler that has this flaw. I've heard that it has been fixed in version 6. Can others verify this? So I am posting this for 2 reasons: 1) to let others know about it (in case you don't know already), and 2) I noticed that in the Boost compiler status web-page it says that smart_ptr passed all its tests with C++ Builder 5.5.1. I didn't look at the tests, but was this handle-body type usage tested to make sure the destructor was called? Or perhaps it was but without debug support turned on? Thanks, Brian Neal

6 12

Using regex++ with non-standard character types
by miles_gould 24 Sep '02

24 Sep '02

Our application stores all characters internally as XMLCh, which is a typedef to either wchar_t or unsigned short, depending on platform and various other things. My questions are 1) Is it even possible to use regex++ with types which are not char or wchar_t? The documentation gives no examples of any other types, and at one point says "the character type, ie char or wchar_t". When I try to construct a reg_expression<XMLCh>, I get the following error message: ../../src/boost/boost/regex.hpp: In instantiation of `boost::regex_traits<unsigned int>': ../../src/boost/boost/regex.hpp:461: instantiated from `boost::reg_expression<unsigned int, boost::regex_traits<unsigned int>, allocator<size_t> >' regex.cpp:33: instantiated from here ../../src/boost/boost/regex.hpp:461: base class `boost::c_regex_traits<unsigned int>' has incomplete type ../../src/boost/boost/regex.hpp: In instantiation of `boost::reg_expression<unsigned int, boost::regex_traits<unsigned int>, allocator<size_t> >': regex.cpp:33: instantiated from here ../../src/boost/boost/regex.hpp:461: no type named `size_type' in `class boost::regex_traits<unsigned int>' ../../src/boost/boost/regex.hpp:462: no type named `uchar_type' in `class boost::regex_traits<unsigned int>' ../../src/boost/boost/regex.hpp:463: no type named `string_type' in `class boost::regex_traits<unsigned int>' ../../src/boost/boost/regex.hpp:471: no type named `locale_type' in `class boost::regex_traits<unsigned int>' [compilation is on GCC 2.96 under Red Hat Linux 7.2] 2) Does this mean I need to define a custom traits class? (or rather a custom traits class for every possible definition of XMLCh?) Is there anything else I need to do?

3 2

VxWorks was Re: shared_ptr documentation suggestion
by Brian Neal 23 Sep '02

23 Sep '02

> From: "Peter Dimov" <pdimov(a)mmltd.net> > From: "Brian" <bneal(a)zeus.ia.net> > >... > > BTW, can I submit a VxWorks version of shared_count? Does boost have > > an interest in expanding beyond Win32/Posix/Linux? > > Yes. Platform-specific implementations of detail::atomic_count (used by > 1.27) and detail::lightweight_mutex (used by the later versions) are > welcome. Please take the time to read the comments in (the latest versions > of) atomic_count.hpp and lightweight_mutex.hpp, though, as > writing optimized > threading primitives by hand is very difficult and error prone, > as I learned > the hard way. Of course a realtime OS should already have such primitives; > I'm not familiar with VxWorks. I am interested in doing this. I will take a look at those files. VxWorks has primitives for these operations already. I would also like to take on getting boost threads running under VxWorks, but I am not sure if I have the time right now. I'll look into it. We already have thread classes that wrap both VxWorks and Win32 so our software runs on both. Last time I looked, boost threads were pretty simplistic (understandably at this point in time). Why is the boost 1.28.0 zip distro 5.6 Megs COMPRESSED! Is it really that big or is it all those pictures and documentation files? Thanks, Brian

1 0

Compiling boost under gcc 2.95.3/solaris
by Wen Yu 23 Sep '02

23 Sep '02

Hi! I'm running into the brickwall now while trying to port "boost" containing codes from VC7 to gcc. Anyone has a pointer to a makefile for this combination. The codes works flawlessly inside Microsoft .NET IDE. I've tried ./configure script, manually edit the "user.hpp" and many fruitless hours to no aval. The "bjam" build of the library seems to be at least partially sucesful. Please help before I had to abandon the ship. Thanks! Wen

2 2

pointer traints ?
by Bohdan 23 Sep '02

23 Sep '02

I have following code: template < typename PointerT > void f( PointerT ptr ) { ReferenceT ref = *ptr; // ... do something with ref ... } The problem is that ReferenceT is unknown inside f( ... ). If i had similar code for InteratorT instead of PointerT i was using iterator_traits. AFAIK there is no pointer traits for a raw and smart pointers and i can not use type_traits for smart pointers. So, the question is: "Is there some simple solution for this problem or this is just lack of pointer_traits in boost (std?) ?" regards, bohdan

1 0

what's the purpose of the typedef in check_delete.hpp?
by zhangwusheng 23 Sep '02

23 Sep '02

Why?And for what purpose? I cannot understand the following words: // verify that types are complete for increased safety thanks

4 4

Bind problems
by judoka1981 23 Sep '02

23 Sep '02

Hi, I'm trying to find the first non-space character of a string using boost::bind, but I simply can't get this to compile: --- static void Trim(std::string& stringToTrim) { std::string::iterator firstNonSpace = std::find_if(stringToTrim.begin(), stringToTrim.end(), boost::bind(std::not_equal_to<int>(), boost::bind(&isspace, _1), 0)); .... --- Am I doing something seriously wrong, or is this a compiler limitation (VC.NET)? (If anyone has a method to do this without using isspace, I'd be happy to see it). Thanks // Johan

3 4

Include directories
by sashang＠ihug.co.nz 23 Sep '02

23 Sep '02

This is a silly question. I feel silly asking it. How do I tell the compiler via the jamfile about extra directories to look in for include files? I've tried adding "-sHDRS=e:/mystuff/include" to the command line when invoking bjam. I've tried placing : <include>e:/mystuff/include at various places withing the jam file. Thanks Sashan

1 0

shared_ptr documentation suggestion
by Brian 22 Sep '02

22 Sep '02

Thank you boost developers for your great work. I've already started using some smart_ptr's, regex, and the any type. I started to look at shared_ptr for my needs (working in a realtime embedded systems environment). I started wondering how it protects its reference count but was surprised to not see anything about this in the documentation. Examining the code I see it uses a platform specific mutex type mechanism if it is available. Otherwise the reference count is not thread safe. I was also alarmed to see that the #error "your reference count is not thread safe" was commented out! Just a suggestion: mention in the documentation whats going on here. The operating system I am using (VxWorks) is not supported by shared_count right now, and had I not been curious I would have not noticed this. Also, even if it was, it can be very expensive for a realtime embedded system (e.g. running on a very slow processor) to take a mutex, especially if done at a very high rate, which is a concern of mine in a few places in my code. BTW, can I submit a VxWorks version of shared_count? Does boost have an interest in expanding beyond Win32/Posix/Linux? Again, thanks for the great software, Brian Neal

3 3

newbie question on tokenizer and unicode text
by elqed1 21 Sep '02

21 Sep '02

Hi all, I'm a newcomer to boost and am rewriting one of my text characterization programs to use some boost libraries. I'm running into a problem with non ascii text. I'm using MSVC 7.0 to compile my program and the project is setup to link to the unicode CRT. The problem is when boost::char_delimiters_separator<>::is_nonret is calling MSVC's CRT std::isspace() which takes an int; and isspace() is (of course) choking on a '©' (for example) in my training data. Is there something obvious I'm missing? Thanks in advance. -Eric Lucas

1 0

RE: [Boost-Users] newsgroup
by Jim.Hyslop 20 Sep '02

20 Sep '02

Ihsan Ali Al Darhi [mailto:iad929@joinnet.com.jo] wrote: > how can i access the boost newsgroups? Boost and Boost Users are both mirrored through gmane.org. You should be able to point your newsreader at news.gmane.org. You can get more details at http://www.boost.org/more/mailing_lists.htm, or by going directly to gmane http://www.gmane.org -- Jim

1 0

RE: [Boost-Users] Slightly Off-Topic, Books
by Jim.Hyslop 20 Sep '02

20 Sep '02

Your post is not "slightly" off topic, it is entirely off topic. -- Jim Hyslop moderator, boost-users(a)yahoogroups.com

1 0

RE: [Boost-Users] Re: [BGL] Best way to abort an algorithm from w ithi n a visitor?
by Mark Storer 20 Sep '02

20 Sep '02

Using exceptions in this way just bugs me. Religious reasons I guess. As the Esteemed Mr. Hylsop ;) mentioned earlier, exceptions are for "oops". This seems alot like the whole "do{}while(0)" with various 'break' statements sprinkled in to avoid multiple returns/nested ifs. Useful, but Just Not Right. Your code has cooties! Nobody's going to want to sit next to it during recess... >So there's no way to affect feedback to the algorithm's dispatcher >without actually making modifications to the algorithm code. So modify away. Seems like a "breath_first_until" sort of thing would be quite useful. Pass in some sort of predicate, and away you go. I'm sure the community at large would be grateful. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Chris Russell [mailto:cdr@encapsule.com] Sent: Wednesday, September 18, 2002 1:27 PM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] Re: [BGL] Best way to abort an algorithm from withi n a visitor? > Now if you've got more than a hundred or so entries left to go, exceptions > really are the greener grass. > The size of the graph is not known a-priori (not at coding time anyway) but is likely to be quite large. > What's wrong with 'return', perhaps along-side some sort of 'done' status > variable? I'm only vaguely familiar with the visitor pattern, but these > would seem to be the obvious choice. > See my earlier reply. In this case I'm deriving my visitor from a base and overriding "event" handlers that receive their marching orders via const references and return void. So there's no way to affect feedback to the algorithm's dispatcher without actually making modifications to the algorithm code. "Mark Storer" <mstorer(a)cardiff.com> wrote in message news:E840F0B7E6189547BDB91DA8BF2228AB016255F8@csmail.cardiff.com... > If efficiency is your goal, exceptions are not the answer. Just enabling > exceptions at compile time makes a noticable performance hit. Actually > throwing an exception can gobble up a 1000 cycles, give or take. That's per > throw. If you catch and throw again, you'll pay again. > > Now if you've got more than a hundred or so entries left to go, exceptions > really are the greener grass. > > What's wrong with 'return', perhaps along-side some sort of 'done' status > variable? I'm only vaguely familiar with the vistor pattern, but these > would seem to be the obvious choice. > > --Mark Storer > Software Engineer > Cardiff Software > > #include <disclaimer> > typedef std::disclaimer<Cardiff> Discard; > 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/

7 11

Slightly Off-Topic, Books
by James Zappia 20 Sep '02

20 Sep '02

Hello, I'm a long time C/Perl programming and would like to transition into C++. What are some books I should pick up? I have the C++ Complete Reference for all the syntax sugar. I'm more interested in books that teach how to program in the mindset of objects. Also, books that don't read like RFCs ;) I learn better with examples and such -- not just brain dumps. Thank you in advance. Regards, James

1 0

boost::shared_ptr confusion...
by someuserat 20 Sep '02

20 Sep '02

First, many thanks to Peter Dimov for answering my earlier questions. I've gotten hung up on something that may not be directly related to shared_ptr, but it's in the mix here. I suspect the real problem is my lack of experience using the STL algorithms, but I'm making an effort not to go back to writing my own loops with this project. Using my Widget theme, here's what I've got. A WidgetManager class contains a stl::list of shared_ptr<Widget> objects. It also contains a stl::vector of shared_ptr<WidgetMap> objects. WidgetMap objects contain a B+tree. (I know, I should probably change this to stl::map or multimap, I'll do that later) The index maps a data member of a Widget to a shared_ptr to the Widget for fast lookups. It is possible that new data members can be added or removed from the Widgets, and we have functions for handling that. Additional WidgetMap objects are added to the WidgetManager for Widget data members as needed. When adding a new WidgetMap, I need to loop through the existing set of Widgets and add them to the new WidgetMap. This is the simplest example I can think of as to what I'm trying to do, however obviously this does not work... void WidgetManager::addMap(const WidgetMapPtr i){ maps_.push_back(i); // have to write a function adapter here? for_each(widgetset_.begin(),widgetset_.end(),i->insert); } Along a similar line, when a Widget's data member collection is changed, I need to remove any WidgetMap objects fromm the WidgetManager that referenced the member being deleted. void WidgetManager::dropWidgetMember(const DataMemberPtr d){ // delete any maps using the target member // how to fix this bloody line? getIndexedMember returns a DataMemberPtr to the member it is keyed on. maps_.erase(remove_if(maps_.begin(),maps_.end(),(boost::mem_fn(&WidgetMap::getIndexedMember)).equals(d))); // get rid of the member itself members_.erase(remove_if(members_.begin(),members_.end(),boost::bind(&DataMember::equals,_1,d))); // rewrite the data file, we're all dirty anyway. this->compact(); } I feel like I understand what I want to do, but I cannot find a reference that explains how to do it the 'correct' way. At least not that I can grasp. Can someone point me in the right direction? Thanks, Mark

3 4

Regex and Unicode
by Fr�d�ric Mayot 20 Sep '02

20 Sep '02

Hi, I'm trying to use Unicode with Regex in an MFC app. The preprocessor variable UNICODE is defined. But I obtain an error on the line : regex_search(sText, oResults, pRegExp); error C2665: none of the 4 overloads can convert parameter 1 from type 'class CString' sText is a CString which has a "const wchar_t*" operator. The problem is why doesn't the regex_search prototype require a "const wchar_t*" when UNICODE is defined ? Thanks. Fred (I read the documentation, but maybe I missed something...)

2 3

BJam output directories on NT
by yg-boost-users＠m.gmane.org 20 Sep '02

20 Sep '02

Building my application using msvc-stlport. I've set ALL_LOCATE_TARGET=d:/src/pegdevbin/build. During processing, the paths get too deep for NT and eventually the mkdir fails and then of course the build stops. Anyway to shorten the deep paths that are automatically created or should I start chopping up allyourbase.jam? I won't be doing any build variants on a per platform basis so I don't need the deep paths that specify the various options in effect. Thanks for the help (and all the great work too...) Rob

1 0

RE: [Boost-Users] Re: Borland C++ Builder 5.5 & scoped_ptr
by Mark Storer 19 Sep '02

19 Sep '02

>>Are you saying that if I switch from >> scoped_ptr to shared_ptr the destructor will get called? Is he saying that the destructor is NOT getting called with scoped_ptr? (!) --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Peter Dimov [mailto:pdimov@mmltd.net] Sent: Thursday, September 19, 2002 11:07 AM To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] Re: Borland C++ Builder 5.5 & scoped_ptr From: "Brian" <bneal(a)zeus.ia.net> > --- In Boost-Users@y..., "Gennadiy E. Rozental" <rogeeff@m...> wrote: > > This was discussed during Boost.Test review. > > Peter some time ago made a changes in boost::shared_ptr that allows > > it to be used with Borland 5.5 namely in the situation you > described. > > > > Gennadiy. > > Hi...could you clarify this? All I noticed was that shared_ptr had > that compile time check for an incomplete type removed, whereas > scoped_ptr still has it. Are you saying that if I switch from > scoped_ptr to shared_ptr the destructor will get called? Yes, shared_ptr will call the destructor. It only requires a complete type at construction time. 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/

2 1

RE: [Boost-Users] Re: [BGL] Best way to abort an algorithm from w ithi n a visitor?
by Mark Storer 19 Sep '02

19 Sep '02

>Using the Boost library as it currently stands, >it appears the best way to abort the algorithm >is to throw an exception. Granted. I'd even go so far as to say "the only way" (based on my vast experience... I've actaully vistor's code once). >Whether or not throwing an exception is >acceptable from a general programming standpoint >is a topic more suited to a general C++ >discussion list Any recommendations? Preffereably something with an archive/FAQ so we don't drag up Holy War #42... --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

1 0

RE: [Boost-Users] Re: [BGL] Best way to abort an algorithm from w ithi n a visitor?
by Jim.Hyslop 19 Sep '02

19 Sep '02

Mark Storer [mailto:mstorer@cardiff.com] wrote: > If Boost's source were a closed book, and the only option was > to throw an > exception, then so be it. But that is not the case. On that note, I'm going to bring this thread back to discussion of how to use the current Boost library. Using the Boost library as it currently stands, it appears the best way to abort the algorithm is to throw an exception. Whether or not throwing an exception is acceptable from a general programming standpoint is a topic more suited to a general C++ discussion list (if anyone decides to take it there, let me know - I'd like to follow it). Whether or not to add a return value to the BGL is a topic more suited to the main Boost mailing list. -- Jim

1 0

RE: [Boost-Users] Re: [BGL] Best way to abort an algorithm from w ithi n a visitor?
by Mark Storer 19 Sep '02

19 Sep '02

In general, I agree that taking personal issue with the use of some language feature is a little silly. In specific, I'm going to disagree with you both for exceptions and the whole do{}while(0) thang. I'm sitting next to my copy of Stroustrup's "The C++ Programming language" (2nd edition). Chapter 9 covers exceptions. This chapter makes it clear that the purpose of exceptions is to handle errors: " The fundamental idea is that a function that finds a problem that it cannot cope with /throws/ an exception, hoping that its (direct or indirect) caller can handle the problem. " Same thing with the do{}while(0) construct. Using a loop as an error handler is quite similar. One could argue that a break is far more efficient than a throw. A counter-argument is that the throw carries a great deal more information about what went wrong. Once the excreta impacts the air-pusher-thingy, speed becomes a secondary concern (far more often than not). If you want to abort a function due to an error then throw an exception. If you want to return a value then do so. And while using a language feature for something other than its original intent is not criminal, there are usually 'proper' ways to do things already built into the language, ways that often work better than subjecting some poor unsuspecting feature to your vile, unnatural manipulations. <Dudly Do-Right>You fiend!</Dudly Do-Right> In the case that brought all this up (returning a value from a graph's visitor to avoid iterating through the whole graph) the proper way to handle it is to alter the algorithm to allow for early termination. If Boost's source were a closed book, and the only option was to throw an exception, then so be it. But that is not the case. So do it right... as Chris Russell (the original poster) has decided to do. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Peter Dimov [mailto:pdimov@mmltd.net] Sent: Thursday, September 19, 2002 9:20 AM To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] Re: [BGL] Best way to abort an algorithm from withi n a visitor? From: "Mark Storer" <mstorer(a)cardiff.com> > Using exceptions in this way just bugs me. Religious reasons I guess. As > the Esteemed Mr. Hylsop ;) mentioned earlier, exceptions are for "oops". > This seems alot like the whole "do{}while(0)" with various 'break' > statements sprinkled in to avoid multiple returns/nested ifs. Useful, but > Just Not Right. A common misconception. Many people try to project their own ideas/expectations on language features, rather than simply using them as tools where appropriate. There is nothing "oops"-y about exceptions. They are a control flow mechanism; one that has interesting properties, but a control flow mechanism nonetheless. If it works and leads to a better code, it's foolish to avoid it without a technical reason. A similar example is when people don't use "struct" for C++ classes because it "doesn't feel right", or when trying to choose between "typename" and "class" for template parameters. The language features simply do not carry this kind of religious/emotional payload. It's all in your mind. 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/

2 1

RE: [Boost-Users] Re: [BGL] Best way to abort an algorithm from w ithi n a visitor?
by Garriss, Michael 19 Sep '02

19 Sep '02

I agree. I hate to see the return -1 (for example) on some "exceptional" case in a function when an exception makes more sense. It's not necessarily an "oops" case, it's an "exception." Either way the caller has to check the special case. There is a good reason that exceptions are named exceptions and not errors. Mike Garriss -----Original Message----- From: Peter Dimov [mailto:pdimov@mmltd.net] Sent: Thursday, September 19, 2002 10:20 AM To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] Re: [BGL] Best way to abort an algorithm from withi n a visitor? From: "Mark Storer" <mstorer(a)cardiff.com> > Using exceptions in this way just bugs me. Religious reasons I guess. As > the Esteemed Mr. Hylsop ;) mentioned earlier, exceptions are for "oops". > This seems alot like the whole "do{}while(0)" with various 'break' > statements sprinkled in to avoid multiple returns/nested ifs. Useful, but > Just Not Right. A common misconception. Many people try to project their own ideas/expectations on language features, rather than simply using them as tools where appropriate. There is nothing "oops"-y about exceptions. They are a control flow mechanism; one that has interesting properties, but a control flow mechanism nonetheless. If it works and leads to a better code, it's foolish to avoid it without a technical reason. A similar example is when people don't use "struct" for C++ classes because it "doesn't feel right", or when trying to choose between "typename" and "class" for template parameters. The language features simply do not carry this kind of religious/emotional payload. It's all in your mind. Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=234081.2377872.3808768.2225242/D=egroupweb/S=17050067 88:HM/A=1225247/R=0/*http://ad.doubleclick.net/clk;4547223;7007303;y?http:// www.ameriquestmortgage.com/welcome.html?ad=Yahoo01> <http://us.adserver.yahoo.com/l?M=234081.2377872.3808768.2225242/D=egroupmai l/S=:HM/A=1225247/rand=147617524> Info: < http://www.boost.org <http://www.boost.org> > Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl <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 the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed]

1 0

lambda lib & mingw gcc 2.95.2?
by Mynhard Rudolph 19 Sep '02

19 Sep '02

Hi all Does the lambda library compile under mingw with gcc 2.95.2? I'm a newbie and I can't figure out what's wrong with the following test example: #include <boost/lambda/bind.hpp> #include <boost/lambda/lambda.hpp> using namespace boost; using namespace boost::lambda; struct A { int d; }; int main (int argc, int argv[]) { A* a = new A(); int b = (a ->* &A::d); int c = (_1 ->* &A::d)(a); return c - b; } g++ test.cpp -Wall -Ix:/boost_1_28_0/ -D__PROCESSOR_X86__ -D__WIN32__ -D__GCC__ -o test.o test.cpp: In function `int main(int, int *)': test.cpp:12: no match for `const boost::lambda::lambda_functor<boost::lambda::pl aceholder<1> > & ->* int A::*' make: *** [test.exe] Error 1 Would appreciate any clues. ;-) Mynhard

2 3

RE: [Boost-Users] [BGL] Best way to abort an algorithm from withi n a visitor?
by Mark Storer 18 Sep '02

18 Sep '02

If efficiency is your goal, exceptions are not the answer. Just enabling exceptions at compile time makes a noticable performance hit. Actually throwing an exception can gobble up a 1000 cycles, give or take. That's per throw. If you catch and throw again, you'll pay again. Now if you've got more than a hundred or so entries left to go, exceptions really are the greener grass. What's wrong with 'return', perhaps along-side some sort of 'done' status variable? I'm only vaguely familiar with the vistor pattern, but these would seem to be the obvious choice. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

2 1

[BGL] Best way to abort an algorithm from within a visitor?
by Chris Russell 18 Sep '02

18 Sep '02

Is there a way to abort an algorithm while it's processing? Can I throw an exception out of a visitor method? I have a case where I need the algorithm to crunch on a large graph until some condition dependent on property data is reached. If and when the condition is met, I would like to skip the processing of the remaining vertices/edges and save the cycles. Does using exceptions sound like a reasonable approach? - Thanks Chris P.S. Thanks for the help with properties and property maps the other day. I cleaned up my code and eventually tracked the source of my considerable confusion to a bug in an operator= defined on the object that I'm using as an internal property. This bug manifested itself by re-initializing previously set data seemingly at random >8|-~ Arg... My bad.

2 2

RE: [Boost-Users] [BGL] Best way to abort an algorithm from withi n a visitor?
by Jim.Hyslop 18 Sep '02

18 Sep '02

Steve M. Robbins [mailto:steven.robbins@videotron.ca] wrote: > I use that technique to abort the Dijkstra shortest path > search when I find my > goal node. It works fine, as far as I can tell, but I'd be > interested to > learn if there is a better way. It seems anti-idiomatic to me. Exceptions are intended to signify exceptional circumstances that you would not normally expect to encounter (at least according to one school of thought). An exception tells me "Oops, something went wrong here" not "we succeeded, here's the answer". Many of the exceptions I catch are called "oops": try { /* ... */ } catch (std::exception &oops) { /* ... */ } One possible snag might be if your code interacts with someone else's code, which will catch the exception and not pass it on to you. In the context we're talking about, though, I don't see that as a significant problem. An exception is certainly an easy way to abort the search, and since I don't have an alternative to offer, I'll shut up now ;=) -- Jim

2 1

Levenshtein Distance algorithm
by Philippe Lalande 18 Sep '02

18 Sep '02

Hi, I was wondering if anyone could tell me if Boost contains a function that could perform a 'Levenshtein distance' calculation on a sequence. The Levenshtein distance is a measure of the similarity between two strings calculated as the number of deletions, insertions, or substitutions required to transforms the source string to the target string. IMO, it is an interesting algorithm that could apply to any kind of sequence. I'd be happy to discuss interface and implementation on the dev list if such algorithm does not exist yet. Thank you Philippe

2 1

RE: [Boost-Users] Re: Newbie needs help w/VC6 & filesystem (take 2)
by Jim.Hyslop 18 Sep '02

18 Sep '02

John B. Williston [mailto:yg-boost-users@gmane.org] wrote: > On Tue, 17 Sep 2002 12:40:53 -0400, Douglas Gregor <gregod(a)cs.rpi.edu> > wrote: > > >Could you copy 'n' paste some of the link errors you are > getting? It seems > >like you did the right thing (at least, I don't know of a > better way), but > >perhaps knowing what symbols are being redefined would help > isolate the > >problem. > > I sure can. The following is the compile output: > > --------------------Configuration: TestFs - Win32 > Debug-------------------- > Compiling... > Main.cpp > Linking... > LINK : warning LNK4075: ignoring /INCREMENTAL due to /FORCE > specification > msvcprtd.lib(MSVCP60D.dll) : warning LNK4006: "public: __thiscall > [...] already > defined in Main.obj; second definition ignored I've typically found these errors when you have mixed the run-time library usage, or MFC usage. One part of your project wants to link in the C run-time library as a DLL, but another part of your project wants to link it in as a static library. Make sure that all the projects, including the ones that build any libraries you're linking with, use the same "Use runtime library" option (Project | Settings, "C/C++" tab, "Code Generation" category), and also that all projects use the same "Microsoft Foundation Class" option (on the General tab). -- Jim

2 1

checked_delete with pointer template parameter
by Craig Henderson 18 Sep '02

18 Sep '02

I need to free memory from a container with elements of pointers, where the container value_type is a pointer type. I cannot use the checked_delete template as it is, as the template parameter is defined without the '*' pointer. For example, the following fails (obviously): typedef std::vector<char *> X; X x; ... std::for_each(x.begin(), x.end(), boost::checked_delete<X::value_type>); I'm using VC7, so have no partial specialization available, so using the type traits library remove_pointer<> does not work: typedef boost::remove_pointer<typename X::value_type>::type type; std::for_each(x.begin(), x.end(), boost::checked_delete<type>); My existing solution uses a unary functor, as below, but this met with critism on the Boost Developers' list. What would be the 'boost' solution to this problem? template<typename T> class free_heap_ptr : public std::unary_function<T, void> { public: free_heap_ptr() { } ~free_heap_ptr() { } void operator() (T p) { delete p; } }; ... std::for_each(changes_.begin(), changes_.end(), free_heap_ptr<typename change_list::value_type>()); TIA -- Craig

2 1

Is there a Type2Type in boost ?
by Baptiste Lepilleur 17 Sep '02

17 Sep '02

Hi everyone, I've looked around and failed to find the Type2Type template, detailed by Andrei Alexandrescu in a CUJ article (http://cuj.com/experts/1810/alexandr.htm?topic=experts) in boost. While the implementation is trivial: template<typename Type> struct Type2Type { typedef Type original_type; }; I'd rather have it in a well known library. Has it been replaced by something else ? Baptiste.

2 1

Newbie needs help with VC6 & filesystem library
by John B. Williston 17 Sep '02

17 Sep '02

Greetings, Though I'm an "old hand" at C++, I'm a complete newbie when it comes to Boost. The piece that really caught my eye, in light of my current project, is the directory iterator. To date, however, I haven't had any success getting it to compile and function under Win32 with MSVC6, so I thought I would post here. I first have a couple of general questions about using Boost, and then one specific question about the problems with my project at hand. (1) Is there a "right" way to include Boost stuff with VC6? Adding the Boost base directory to my list of include directories seems to work for the official stuff, but it clearly doesn't work for the filesystem stuff because Directory.h is not in the base\boost directory. I can put it there myself, of course, but I'm wondering if there is some intended way to use the beta libraries before they become a part of the whole. (2) Is there a "right" way to link Boost stuff with VC6? The filesystem stuff, like the regex stuff and some other pieces, requires actual compilation and cannot simply be included as header files. I have already built all the official libraries using the bjam utility, but I cannot help noticing they're each stored in hideously long paths beneath the boost base directory. Is there a "right" directory under the Boost hierarchy into which the resulting libs should be copied for ease of inclusion in VC6? Or should I copy them into my project directories as needed? Or should I simply come up with my own system? To get to the more specific question, let me explain how I've addressed (1) and (2) for the time being. Regarding (1), I've copied Directory.h and Boost.h into the base\boost directory so that they may be included without changing the existing source code. That was simple enough. Regarding (2), I've decided to add Directory.cpp to my project and compile it as a module, rather than try to get the linking to work externally. Having said that, consider the following code: #include <windows.h> #include "boost/directory.h" int WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nCmdShow) { using namespace boost::filesystem; std::string strFilename; for (dir_it it("./"); it != dir_it(); ++it) if (!get<is_hidden>(it)) strFilename = *it; return 0; } This is an extremely minimal test case of integrating the filesystem stuff into a Win32 application. When compiling the application, I get the following lengthy and inscrutable (to me, at least) error message: WinMain.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::filesystem::get<struct boost::filesystem::is_hidden>::get<struct boost::filesystem::is_hidden>(class boost::filesystem::dir_it const &)" (__imp_ ??0?$get@Uis_hidden@filesystem@boost@@@filesystem@boost@@QAE@ABVdir_it@12@@Z) The error message seems to suggest that the filesystem stuff isn't available in my project. I find that confusing because the Directory.cpp module compiles without any errors, and I am thus inclined to think that, in fact, all of the filesystem stuff is in my project. Thus, I must also ask the third question: (3) Can anyone explain to me what I might be doing wrong and, more importantly, how I might correct it? Thanks much to all the Boost authors for an interesting set of tools. And thanks in advance to any who respond for all the help with my specific issue. John

6 6

Newbie needs help w/VC6 & filesystem (take 2)
by John B. Williston 17 Sep '02

17 Sep '02

Greetings, I'm sorry for my earlier post. I didn't realize that the dir_it beta stuff was not what was being referred to as the "filesystem". I now know better, and I'm trying to make the filesystem stuff work instead. Unfortunately, I'm having no better luck. Consider the following code: #include "boost/filesystem/operations.hpp" // includes boost/filesystem/path.hpp #include "boost/filesystem/fstream.hpp" // ditto #include <iostream> // for cout int main(int iArgc, char** pArgv) { namespace fs = boost::filesystem; int iNumNodes = 0; fs::directory_iterator end_itr; // default construction yields past-the-end for (fs::directory_iterator itr("debug"); itr != end_itr; ++itr) { if (fs::is_directory(*itr)) std::cout << (*itr).file_path() << " (dir)" << std::endl; else std::cout << (*itr).file_path() << std::endl; iNumNodes++; } std::cout << iNumNodes << " total." << std::endl; return 0; } That's a relatively brain-dead use, I should think, to enumerate the contents of the debug folder to the console. Unfortunately, when I try compiling this, the linker complains horribly about all kinds of symbols already being defined in the filesystem object modules. To ditch the linker errors, I've temporarily used the /force switch, but that's hardly illuminating. First, can anyone tell me how to avoid getting a plethora of multiply-defined symbol errors? Or is /force my only real option? Second, if I use the /force switch, I get all kinds of unhandled exception errors when the directory iterator is constructing. Changing the string I pass to it at construction just changes which exception it emits. With the code above as written, the culprit is: template<typename Y> void reset(Y * p) // Y must be complete { BOOST_ASSERT(p == 0 || p != px); // catch self-reset errors this_type(p).swap(*this); } That's lines 181-185 of boost/shared_ptr.hpp, and I haven't a clue why it's freaking out. Tracing through all the code shows that the exception is occurring AFTER the swap seems to succeed. I'm stumped as to what the problem might be. But I sure would appreciate any advice y'all can offer. So far I have to say that I'm impressed with the Boost library features, but it seems a cast-iron bitch to make it actually compile and link in any real-world programs. John

4 9

Advantage to STLport w VC7?
by dick.bridges＠tais.com 17 Sep '02

17 Sep '02

I'm preparing an upgrade from VC6 SP5 to VC7. I'm told the VC7 STL was improved but specifics are hard to come by. Can anyone tell me if there's still an advantage, <emphasis> with respect to the Boost libraries</emphasis>, to using STLport with VC7? TIA for any suggestions.

1 0

regex 1.28.0 build (question - and problem report)
by acarsac 17 Sep '02

17 Sep '02

Hi, 2 things while upgrading from 1.25 to 1.28 : -I was trying to build the regex library (1.28.0) with msvc-stlport configuration. vc6.bat set STLPORT_PATH="c:\Mes Documents\STLport-4.5.3" nmake -fvc6-stlport.mak will fail. i had to erase some lines in vc6-stlport.mak because i guess it does not support space in path. i do the install by hand too. unless that, it work fine for me. -I was just wondering why the boost build system (jam) makes the regex library if i need to rebuild them with nmake whereas i specify the good target os for both ? Alex.

1 0

question about edge_property_type
by wei guo 16 Sep '02

16 Sep '02

Hi, group: I have a problem of using edge_property_type. in the example file: undirected.cpp, I added several lines like: template < typename DirectedGraph > void directed_graph_demo() { const int V = 2; DirectedGraph digraph(V); typename graph_traits < DirectedGraph >::vertex_descriptor u, v; typedef typename DirectedGraph::edge_property_type Weight; typename property_map < DirectedGraph, edge_weight_t >::type weight = get(edge_weight, digraph); typename graph_traits < DirectedGraph >::edge_descriptor e1, e2; bool found; ......... Weight w1 = get(weight, e1); // <<----------- added line Weight w2 = get(weight, e2); // put( weight, e1, w1*w2/(w1+w2) ); // <<----------- added line std::cout << "weight[(u,v)] = " << get(weight, e1) << std::endl; std::cout << "weight[(v,u)] = " << get(weight, e2) << std::endl; } I got following compiling errors with KAI compiler: "undirected.cpp", line 83: error: no operator "*" matches these operands operand types are: Weight * Weight put( weight, e1, w1*w2/(w1+w2) ); ^ detected during instantiation of "void directed_graph_demo<DirectedGraph>() [with DirectedGraph=DirectedGraph]" "undirected.cpp", line 83: error: no operator "+" matches these operands operand types are: Weight + Weight put( weight, e1, w1*w2/(w1+w2) ); ^ detected during instantiation of "void directed_graph_demo<DirectedGraph>() [with DirectedGraph=DirectedGraph]" 2 errors detected in the compilation of "undirected.cpp". however, if I change the put statement in the example code to be: put( weight, e1, get(weight, e1)*get(weight, e2)/(get(weight, e1)+get(weight, e2)) ); it compiled successfully. So, what do I missing here, and what is the return type of get(weight, e2) ? and how it connected with DirectedGraph::edge_property_type ? thanks in advance! weiqing --------------------------------- Do you Yahoo!? Yahoo! News - Today's headlines [Non-text portions of this message have been removed]

1 0

[BGL] setting a breakpoint in an algorithm visitor
by Chris Russell 16 Sep '02

16 Sep '02

p.156 of the BGL book: "... visitors are passed by value..." I was attempting to set a breakpoint in a visitor event handler (that I know is executing) but the breakpoint is seemingly ignored by my debugger. This is because the visitor I construct and subsequently pass to the algorithm is not the object that is actually dispatched by the algorithm. Correct? Using the Intel compiler under MS DevStudio 6 on Windows, I inserted a ::DebugBreak() (asm int 3) into the visitor and *do* hit that but only have assembly language and not source to step through at that point. Why are visitors passed to algorithms by value? Any suggestions for debugging visitor code at the C++ source level and not in assembly? - Regards Chris

2 2

[BGL] Property map question
by Chris Russell 16 Sep '02

16 Sep '02

What determines when boost::get(Graph, vertex_myproperty_t) returns a boost::property_map<graph_t, vertex_myproperty>::type vs. a ::const_type? Suppose: enum vertex_myproperty_t { vertex_myproperty = 12345}; BOOST_INSTALL_PROPERTY(vertex,myproperty); typedef property<vertex_myproperty_t, MyPropertyObject, ....> vertex_properties_t; typedef adjacency_list<vecS,vecS,bidirectionalS, vertex_properties_t> graph_t; typedef property_map<graph_t, vertex_myproperty_t>::type vertex_myproperty_map_t; graph_t Graph;

2 5

Re: Thanks for the help...
by Peter Dimov 16 Sep '02

16 Sep '02

From: "someuserat" <marktutt(a)excite.com> > > If I can impose, I've got another question that I think is in the same > area... > > I couldn't think of a way to call Widget::operator()(const WidgetPtr > w) through the smart pointer, so I wrote an equivalent method called > equals to try to imlement the following function. > > void WidgetMgr::dropWidget(const WidgetPtr w){ > > col.erase(remove_if(col.begin(),col.end(),boost::b > ind2nd(boost::mem_fn(&Widget::equals),c))); > } ... where Widget::equals takes a WidgetPtr? Based on this information, I think that you need boost::bind(&Widget::equals, _1, w) (Please use the boost-users list.) > Is there any reference to the boost libraries that goes into more > detail? I've got several books on STL that never seem to address the > issues I'm running into with smart pointers, I'm afraid what I may run > into once I really get into the meat of this project.

1 0

RE: [Boost-Users] lexical_cast question
by Björn Karlsson 16 Sep '02

16 Sep '02

> From: Mark Snelling [mailto:mark@bakedbeans.com] > > Ok, I guess I'll just make my own temporary one based on the > original in > the meantime :) > > Mark. > Or, you could use the version with proposed changes - it's in the Files section at YahooGroups. Bjorn

1 0

RE: [Boost-Users] lexical_cast question
by Björn Karlsson 16 Sep '02

16 Sep '02

> From: Mark Snelling [mailto:mark@bakedbeans.com] > > Hi, > Does the boost::lexical_cast library support wide character sets for > example: > > #include <boost/lexical_cast.hpp> > > using namespace boost; > using namespace std; > > void main () > { > wstring wtext(L"1234"); > int val = lexical_cast<int>(wtext); > } > Not the current version of lexical_cast - the implementation uses stringstream to perform the conversion. A proposed change to lexical_cast does handle wide characters correctly. I'm not sure about the status of that proposal, though. Bjorn Karlsson

2 1

lexical_cast question
by Mark Snelling 16 Sep '02

16 Sep '02

Hi, Does the boost::lexical_cast library support wide character sets for example: #include <boost/lexical_cast.hpp> using namespace boost; using namespace std; void main () { wstring wtext(L"1234"); int val = lexical_cast<int>(wtext); }

1 0

How to build boost threads library on AIX 4.3.3 with VisualAge 5
by robertpsather 16 Sep '02

16 Sep '02

Building Boost on AIX is difficult. Here's a recipe that worked for me, for building on the following platform: Boost source download version 28 AIX 4.3.3 on RS/6000 VisualAge 5.0 Jam: downloaded binary of Boost.Jam Version 3.1.0. OS=AIX. bash shell Building Boost Setup: Downloaded version 28 tar.gz file to ~/boost. Un-gzipped and untarred. Set export BOOST_ROOT=/home/satherb/boost/boost_1_28_0 Attempt: jam "-sTOOLS=vacpp" Result: Many compilation errors, in building of regexp library. For example: Error: "libs/regex/build/../src/cpp_regex_traits.cpp", line 196.39: 1540-0257 (S) An object or reference of type "std::messages_base::catalog" cannot be initialized with an expression of type "int". Attempt: in cpp_regex_traits.cpp", line 196, changed "-1" to "(size_t) 1" Result: compiler says "cannot be initialised with type unsigned long." for the same line. Attempt: Noted that www.boost.org says that threads lib does not depend on regex or python. Edited Jamfile to comment out unnecessary targets python and regex. Result: Most errors are "Thread support is unavailable". Looking at source indicates this is because BOOST_HAS_THREADS macro is undefined. Attempt: export BOOST_HAS_THREADS=1 Result: same errors. Attempt: run ./configure Result: configure gives error message that says "compiler does not produce output" (or something like that) However, running configure again worked! Here were the recent settings of environmental variables: export BOOST_ROOT=/home/satherb/boost/boost_1_28_0 export _MT=1 export CC=xlC_r export CXX=xlC export _POSIX_THREADS=1 export LIBS=-lpthread (I don't know which of these was the key. If you discover the answer, please let me know.) Attempt: Did as configure suggested: "Adjustments to boost configuration have been written to user.hpp, copy this to boost/config/user.hpp to use "as is" " Result: jam still gives "Thread support is unavailable" errors. Attempt: added a line to boost/config/user.hpp: #define BOOST_HAS_THREADS Result: builds! (Don't know yet if it works properly, of course. The examples don't build.) Bob Sather bob.sather(a)lloydstsb.delete_this_part.co.uk

5 9

graph vertices / IRIX / GCC
by yg-boost-users＠m.gmane.org 16 Sep '02

16 Sep '02

Hello, Q: one can construct a graph using adjacency_list<> and then immediately iterate over the vertices, right? The program below writes out the numbers 0 to 9 when compiled using gcc 3.2 on linux. Ditto on my IRIX system, *unless* I try to optimize. I expect this is a GCC optimizer bug, but I just want to be sure I haven't overlooked something in the boost docs. Thanks, -S #include <iostream> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t,float> > Graph; typedef boost::graph_traits<Graph>::vertex_descriptor vertex_descriptor; typedef boost::graph_traits<Graph>::edge_descriptor edge_descriptor; int main() { Graph g( 10 ); boost::graph_traits<Graph>::vertex_iterator ui, ui_end; for (boost::tie(ui, ui_end) = boost::vertices(g); ui != ui_end; ++ui) { std::cout << "*ui = " << *ui << std::endl; } return 0; }

2 1

graph vertices / IRIX / GCC
by Steve M. Robbins 16 Sep '02

16 Sep '02

Hello, Q: one can construct a graph using adjacency_list<>(N) and then immediately iterate over the vertices, right? The program below writes out the numbers 0 to 9 when compiled using gcc 3.2 on linux. Ditto on my IRIX system, *unless* I try to optimize. I expect this is a GCC optimizer bug, but I just want to be sure I haven't overlooked something in the boost docs. Thanks, -S #include <iostream> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t,float> > Graph; int main() { Graph g( 10 ); boost::graph_traits<Graph>::vertex_iterator ui, ui_end; for (boost::tie(ui, ui_end) = boost::vertices(g); ui != ui_end; ++ui) { std::cout << "*ui = " << *ui << std::endl; } return 0; }

1 0

ASCII Code Problem.. Please Help me.
by Sean Lee 15 Sep '02

15 Sep '02

I am currently trying to use Regex++ and I almost got there. However, I try to use Regex++ with XML parser and I got some problem. Here is the xml expression. <subtree name="itinerary" regex="(<\\s*TR\\s*VALIGN=TOP>\\s*<TD\\s*WIDTH=250>\\s*<\\s*B \\s*>[^>]+AM</B>?)"> Since "<" and ">" are not valid in XML Syntax, I have to use "<" and ">". I have loaded the xml file in my program and did following thing. char* regex=NULL; _bstr_t strRegex; strRegex=pIXMLDOMNode->text; // regex="(<\\s*TR\\s*VALIGN=TOP>\\s*<TD\\s*WIDTH=250>\\s*<\\s*B \\s*> //[^>]+AM</B>?)"> regex = (char*)malloc(_bstr_t(strRegex).length()); lstrcpy(regex,strRegex); AfxMessageBox(regex); // got the same string. But when I compared with following string and I got "FALSE". char* temp="(<\\s*TR\\s*VALIGN=TOP>\\s*<TD\\s*WIDTH=250>\\s*<\\s*B\\s*>[^>]+AM</B> ?)"; if(lstrcmp(temp,regex)==0) Please help me. Thank you very much. Sean Lee slee(a)qixo.com

2 1

tokenizer bug? core dump
by wugui 14 Sep '02

14 Sep '02

\\n ok, \\r\\n core dump what happend? { const string test_string = "\"message ; \\r\\n message\" \"quote \\\"\" 'escape \\\\'"; typedef tokenizer<escaped_list_separator<char> > Tok; escaped_list_separator<char> sep("\\"," ;","\"\'"); Tok tok(test_string, sep); for(Tok::iterator beg=tok.begin(); beg!=tok.end();++beg) cout << "[" << *beg << "]" << endl; } (gdb) bt #0 0x281047b4 in kill () from /usr/lib/libc.so.4 #1 0x28144b26 in abort () from /usr/lib/libc.so.4 #2 0x28097444 in __terminate () from /usr/lib/libstdc++.so.3 #3 0x28097461 in __terminate () from /usr/lib/libstdc++.so.3 #4 0x280977fb in __sjthrow () from /usr/lib/libstdc++.so.3 #5 0x804c5ea in boost::iterator_adaptor<boost::detail::token_iterator_base<char const *>, boost::detail::tokenizer_policy<basic_string<char, string_char_traits<char>, __default_alloc_template<false, 0> >, boost::escaped_list_separator<char, string_char_traits<char> > >, basic_string<char, string_char_traits<char>, __default_alloc_template<false, 0> >, basic_string<char, string_char_traits<char>, __default_alloc_template<false, 0> > const &, basic_string<char, string_char_traits<char>, __default_alloc_template<false, 0> > const *, forward_iterator_tag, int>::iterator_adaptor () #6 0x804bdd9 in boost::tokenizer<boost::escaped_list_separator<char, string_char_traits<char> >, char const *, basic_string<char, string_char_traits<char>, __default_alloc_template<false, 0> > >::begin () #7 0x804a64f in main () #8 0x804a4b5 in _start ()

1 1