- 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 '… [View More]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/ [View Less]

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> … [View More]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 [View Less]

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 … [View More]

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 … [View More]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 [View Less]

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) … [View More]

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.… [View More]

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) … [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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 … [View More]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/ [View Less]

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 … [View More]

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 … [View More]

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:… [View More]

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 … [View More]

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 … [View More]

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 /… [View More]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/ [View Less]

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: [… [View More]

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/ -… [View More]

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 … [View More]

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 … [View More]

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, … [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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 … [View More]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 [View Less]

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 … [View More]

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 … [View More]

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 … [View More]

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 … [View More]

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(… [View More]

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 … [View More]

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 … [View More]

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/… [View More]

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/… [View More]

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. … [View More]

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 … [View More]

1 1

does vc7 support class template partial specialization?
by Jun Zhang 14 Sep '02

14 Sep '02

Jun Zhang from China I cannot compile the example of BGL. I know vc6 does not support class template partial specialization. but how about vc7.has this problem settled?

3 4

[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)… [View More]

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::… [View More]

2 1

BGL and Intel v6 compiler?
by Chris Russell 14 Sep '02

14 Sep '02

Lack of partial template specialization and MSVC 6.0 "Internal Compiler Error" has me looking for alternatives. Specifically, I'm considering moving some BGL-dependent code into a library and compiling it with the Intel v6.0 compiler for Windows which can produce object code and libraries that I can link into a MSVC 6.0 project. Can anyone comment on the Intel compiler's support for partial specialization - I'm not finding much except number crunching benchmark comparisons. Thanks - Chris

2 2

ublas documentation
by Uwe Schmitt 13 Sep '02

13 Sep '02

Hi, is there any introduction to ublas available ? I'd like to access the matrix data directly in order to use LAPACK. How is the data for general matrices stored ? In columwise or rowwise order ?? Is the storage order for banded matrices the same as assumed by LAPACK ? Or has anybody wrapped LAPACK ??? Greetings, Uwe. PS: Can you send me a copy to your answers per email ? My standard newsserver gives me no access to this group.. -- Dr. rer. nat. Uwe Schmitt Computer science is no … [View More]

1 0

lambda library bug --- endl?
by Ken Yarnall 13 Sep '02

13 Sep '02

Hi there. I have a recent CVS version of Boost installed, and am using g++ v3.2. I tried to compile the following program: -----------lambda_test.cpp------------ #include <iostream> #include <string> #include <list> #include <algorithm> #include <boost/lambda/lambda.hpp> using namespace std; using namespace boost::lambda; int main() { list<int> ell; for (int i=0; i<100; ++i) ell.push_back(4*i-1); for_each(ell.begin(), ell.… [View More]

3 3

Regex performace for NLP
by shevaxp 13 Sep '02

13 Sep '02

I´m actually developping a NLP appication (a morphological analyzer) I´ve implemented the tokenizer using boost regex++ engine, but the performance is poor in comparition with Perl´s one for the same task. I´ve read some messages about this questions in the mailing list, and then realized that boost regex++ gives really more than what i needed, and the price I have to pay is a lack of speed. But I wouldn´t like to mistake twice, so I´ve decided to make to all of you the question: Is … [View More]

1 0

Newbie: uBLAS slow?
by Thomas Willhalm 12 Sep '02

12 Sep '02

Hello, I'm new to ublas, so it's easily possible that I overlooked something obvious. The first thing I tried to calculate was the following line: numerics::matrix<double> M(dimension,n); numerics::matrix<double> Covariance = numerics::prod(M,numerics::trans(M))/n; where dimension is 50 and n is 8000. Unfortunately. it turned out that the following "stupid" code actually performs better: numerics::matrix<double> Covariance(dimension,dimension); for (int i=0; i<… [View More]

3 3

Newbie boost::bind problem
by Mark Snelling 12 Sep '02

12 Sep '02

Hello, I need some help using the boost::bind library. I have a map of objects with a string as the key eg map<string, Block*>, what I want to do is call a member function on each Block* in the map using the std::for_each algorithm. The trivial solution would be to craft my own loop and iterate through the list calling the member function on each one. But I'm sure that the boost::bind library can help me out there. class Block { public: void update(int x); }; void main() { … [View More]

2 7

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

12 Sep '02

I've just started working on my first project trying to fully utilize STL and the boost libraries, and have already run into something that I can't seem to figure out... I'm trying to use find_if to check if a member function of an object contained in an array returns true. It will only return true for a single object in the collection, so I just need the first instance. When the vector is declared like this: vector<Widget*> col; This statement compiles... vector<Widget*>::… [View More]

2 1

boost.function with CW 8.2 on W2k
by Bertolt Mildner 12 Sep '02

12 Sep '02

I get the following warnings when I use boost::function with CW 8.2 on W2k: Warning : variable / argument 'deprecated' is not used in function (included from: function10.hpp:28 function.hpp:37 Test.cpp:8) function_template.hpp line 388 BOOST_FUNCTION_DEPRECATED_INNER Warning : variable / argument 'deprecated' is not used in function function.hpp line 874 BOOST_FUNCTION_DEPRECATED_INNER Warning : variable / argument 'deprecated' is not used in function function.hpp line … [View More]

3 18

bjam on hpux
by Glen Knowles 11 Sep '02

11 Sep '02

I'm trying to build boost on hp/ux 11.11 with the aCC 3.35 compiler but can't seem to get a working jam. My tools tell me that the bjam.gz binary for hp/ux is not a valid gzip file and my attempts to compile jam result in a large number of errors which I can get into if needed. Could someone verify that the hp/ux bjam.gz is good? Any help is appreciated, Glen

2 1

Re: bjam on hpux
by Glen Knowles 10 Sep '02

10 Sep '02

"Toon Knapen" <toon.knapen(a)si-lab.org> wrote: > > I'm trying to build boost on hp/ux 11.11 with the aCC 3.35 compiler but > > can't seem to get a working jam. My tools tell me that the bjam.gz binary > > for hp/ux is not a valid gzip file and my attempts to compile jam result in > > a large number of errors which I can get into if needed. Could someone > > verify that the hp/ux bjam.gz is good? > > I've build the prebuilt on HP-UX 10.2 but I guess … [View More]

1 0

BOOST_MSVC6_MEMBER_TEMPLATES
by jacob_bondski 10 Sep '02

10 Sep '02

Hi, The VC++ compiler (6.0 with SP 5) has problems with member function templates. We have encountered a couple of situations where a shared_ptr was created and an attempt was later made to assign a raw pointer to it. However, 1) The compiler fails to recognise that you can't assign a raw pointer to an existing shared pointer object 2) The compiler fails to generate any code whatsoever for the assignment 3) The compiler remains silent about its problems We realise that one way to help … [View More]

2 1

function docs
by Ihsan Ali Al Darhi 10 Sep '02

10 Sep '02

Hi... I downloaded Boost 1.28.0. I looked at the function library folder but I didn't see any documentation on how to use this library. Where's it? If there isn't, who would volunteer and explain how to use this library? I am using gcc 3.2 on Win2000 and sometimes on Win98. Mo

2 2

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

10 Sep '02

I wrote: > Your post is not "slightly" off topic, it is entirely off topic. Sorry, I didn't mean to come across so brusque. I should at least have included some references in that message: More information about what is on-topic can be found at http://groups.yahoo.com/group/Boost-Users/ Some forums you might consider are comp.lang.c++ and alt.learn.c++ (I _think_ that's the name of the group) -- Jim

2 1

Re: msvc-stlport build problems
by David Resnick 09 Sep '02

09 Sep '02

OK, here is the real fix to the problem. Rehash: Compiling for tool "msvc-stlport" fails with these errors repeated for many files: C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1011) : error C2733: second C linkage of overloaded function 'InterlockedIncremen t' not allowed C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1009) : see declaration of 'InterlockedIncrement' C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1018) : error C2733: second C linkage of overloaded function 'InterlockedDecremen t' … [View More]not allowed C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1016) : see declaration of 'InterlockedDecrement' C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1026) : error C2733: second C linkage of overloaded function 'InterlockedExchange ' not allowed C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1023) : see declaration of 'InterlockedExchange' This problem occurs when the Platform SDK is installed. The PSDK include path must be searched before the standard MSVC includes. The bjam tool adds -I"C:\PROGRA~1\MICROS~3\VC98\include" to the cl command line, so that is searched before the PSDK include path which is specified in the environment. An immediate solution is to have the PSDK include path searched first, using this bjam command line: bjam -sTOOLS=msvc-stlport -sBUILD="debug release <stlport-iostream>on <sysinclude>C:\Progra~1\MIFD68~1\Include\." -sSTLPORT_PATH=c:\etc NOTE: "C:\Progra~1\MIFD68~1\Include\." is the short form of "C:\Program Files\Microsoft SDK\Include" on my machine. YMMV. This should probably be fixed in msvc-tools.jam which would somehow check if the PSDK is installed (by checking the environment?) and added to the header search path as needed. BTW: I've added this to http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?CommonBui ldProblems Regards, David Resnick MobileSpear Inc. -----Original Message----- From: David Abrahams [mailto:yg-boost-users@m.gmane.org] Sent: Friday, September 06, 2002 23:56 To: boost-users(a)yahoogroups.com Subject: [Boost-Users] Re: Re: msvc-stlport build problems "David Resnick" <dresnick(a)mobilespear.com> wrote in message news:DDE1CEBCDCEE614EA25D40FCE8EDD6BD0C48F6@msmail.mobilespear.com... > I've fixed the problem, here's my solution in case anyone else needs it: > > > The problem didn't have to do with the Platform SDK in the end. > > The configuration that I'm using is MSVC6 SP3 on Windows 2000. > > The fix was to add : > > flags msvc-stlport DEFINES : _NTOS_=1 ; > > to the "special flags for STLport 4.0" block in > tools\build\msvc-stlport-tools.jam (line 117, for example). Is that #define needed by STLPort, or is specific to the code you're trying to compile? If it's the former, we should patch the toolset. Please respond to jamboost(a)yahoogroups.com > I have a question for jam experts: How can I set this define (_NTOS_=1) > from the command line? bjam -sBUILD="<stlport-iostream>on <define>_NTOS_=1" ... ----------------------------------------------------------- David Abrahams * Boost Consulting dave(a)boost-consulting.com * http://www.boost-consulting.com Yahoo! Groups Sponsor ADVERTISEMENT 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 the Yahoo! Terms of Service. [View Less]

1 0

boost:shared_ptr<> exception in checked_delete(..)
by Julia Donawald 09 Sep '02

09 Sep '02

Hi, I have written the following code to simulate my problem: #include <vector> #include <shared_ptr.hpp> class Foo { public: Foo() { }; virtual ~Foo() { }; }; class Vector_Foo { public: Vector_Foo() { }; virtual ~Vector_Foo() { }; void AddFooObject(Foo* pFoo) { FooDataPtr ptrFoo(pFoo); m_vecChildren.push_back(ptrFoo); }; protected: typedef boost::shared_ptr<Foo> FooDataPtr; … [View More]

2 1

BUG in Regex++ 3.31
by Yaroslav Govorunov 09 Sep '02

09 Sep '02

Hello, All! Call to the regex_match(chkString,Match,Expression,match_not_dot_newline) causes program go into an infinite loop when chkString="http://localhost/ideas/exchange/June98/test/test.cfm" and Expression="^/(.*)*.cfm" Both Regex++ and test program are compiled with VC7.0 on WindowsXP. I have tried to play with optimisation settings, but this bug appears even in debug configuration. I understand that syntax of regular expression is incorrect, but library should rise error in this case. I … [View More]

3 5

Re: boost:shared_ptr<> exception in checked_delete(..)
by Julia Donawald 08 Sep '02

08 Sep '02

Hi, the folllowing works not too: #include <vector> #include <shared_ptr.hpp> class Foo { public: Foo() { }; virtual ~Foo() { }; }; class Double_Foo { public: Double_Foo() { }; Double_Foo(Foo* pFoo1, Foo* pFoo2) : m_Foo1(pFoo1), m_Foo2(pFoo2) { }; virtual ~Double_Foo() { }; protected: typedef boost::shared_ptr<Foo> FooDataPtr; FooDataPtr m_Foo1; FooDataPtr m_Foo2; }; int main() { Foo* pFoo = new Foo()… [View More]

2 1

uBLAS: Bug in zero_vector.
by David Jung 08 Sep '02

08 Sep '02

Hi. The online documentation for zero_vector<> says: zero_vector<T> Constructs a zero vector. v (size) However, line 786 of boost/numeric/ublas/vector.hpp from latest CVS reads: zero_vector (size_type size, size_type index): size_ (size) {} and there is no single size_type size argument constructor. Isn't this a bug? (looks like a cut-paste from unit_vector<>) Cheers, -David Jung.

2 1

Re: Re: [Boost-Users] Compile problem with boost thread and function libraries.
by Matthew Dempsky 08 Sep '02

08 Sep '02

Nevermind, I'm an idiot... I forgot to add -I/usr/include/stlport to gcc's commandline. =/ -jivera

1 0

Re: Re: Compile problem with boost thread and function libraries.
by Matthew Dempsky 08 Sep '02

08 Sep '02

>Probably a silly question: but you did build libboost_thread with STLport >support turned on didn't you? Well, I didn't actually compile libboost_thread at all - it's prepackaged on Debian. -jivera

1 0

Question about functional operators on bit-ops (~, &, |, ^, +)
by Jeffrey C. Jacobs 08 Sep '02

08 Sep '02

This is more of a newbie question I admit but then that's appropriate here as I understand. :) Really, my question comes down to perhaps ignorance of the ISO spec (need to get around to buying a copy! -- and YES, I know EXACTLY what I'd be getting into! ;) and determine whether this is really just lack of conformance on my compiler's part (you know the one, using Dinkumware 1.0 for 5 years) or an issue addressed by boost. Anyway, cut to the chase: I am looking for unary (binary) … [View More]

1 0

Compile problem with boost thread and function libraries.
by Matthew Dempsky 08 Sep '02

08 Sep '02

Trying to compile the example at the bottom of the thread_group page (http://www.boost.org/libs/thread/doc/thread.html#example-thread_group) results in the following error for me: undefined reference to `boost::thread_group::create_thread(boost::function0<void, boost::empty_function_policy, boost::empty_function_mixin, allocator<boost::function_base> > const &)' (I also had to rename the variable count to something else because I was getting a "`int count' redeclared as … [View More]

2 1

RE: [Boost-Users] Re: msvc-stlport build problems
by David Resnick 06 Sep '02

06 Sep '02

I've fixed the problem, here's my solution in case anyone else needs it: The problem didn't have to do with the Platform SDK in the end. The configuration that I'm using is MSVC6 SP3 on Windows 2000. The fix was to add : flags msvc-stlport DEFINES : _NTOS_=1 ; to the "special flags for STLport 4.0" block in tools\build\msvc-stlport-tools.jam (line 117, for example). I have a question for jam experts: How can I set this define (_NTOS_=1) from the command line? Regards, David … [View More]Resnick MobileSpear Inc. -----Original Message----- From: David Abrahams [mailto:yg-boost-users@m.gmane.org] Sent: Friday, August 30, 2002 19:38 To: boost-users(a)yahoogroups.com Subject: [Boost-Users] Re: msvc-stlport build problems "David Resnick" <dresnick(a)mobilespear.com> wrote in message news:DDE1CEBCDCEE614EA25D40FCE8EDD6BD0C48EE@msmail.mobilespear.com... > Hi, > > I'm trying to build boost version 1.28.0, msvc-stlport build, using the > following line: > > bjam -sTOOLS=msvc-stlport -sstlport-iostream=on -sSTLPORT_PATH=c:\etc -sstlport-iostream=on sets a Jam variable called "stlport-iostream" to "on". As a build feature, you need to set this up as a part of the BUILD variable: -sBUILD="<stlport-iostream>on" However, that doesn't appear to be related to the warnings you're reporting. > I have no problems building the msvc build. > > It seems to me that the problem has to do with the MS Platform SDK that > I have installed. Quite possibly. > When compiling STLPort (version 4.5.3) I had similar warnings. 2 work > arounds that I found there were either to remove the platform SDK from > the include enviroment variable, or (when I found it) to define > _STLP_NEW_PLATFORM_SDK in stl_user_config.h. > > I've tried variations of that with compiling Boost, but nothing makes a > difference. I've included the error messages that I get for most files. > > ---------------------------- CUT HERE ---------------------------- > vc-C++ > libs\regex\build\bin\libboost_regex.lib\msvc-stlport\debug\runtime-link- > dynamic\stlport-cstd-namespace-std\stlport-ios > tream-off\stlport-version-4.5.3\c_regex_traits.obj > c_regex_traits.cpp > C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1011) : error C2733: second > C linkage of overloaded function 'InterlockedIncremen > t' not allowed > C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1009) : see > declaration of 'InterlockedIncrement' > C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1018) : error C2733: second > C linkage of overloaded function 'InterlockedDecremen > t' not allowed > C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1016) : see > declaration of 'InterlockedDecrement' > C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1026) : error C2733: second > C linkage of overloaded function 'InterlockedExchange > ' not allowed > C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1023) : see > declaration of 'InterlockedExchange' > > > "cl" /Zm400 -nologo -GX -c -DBOOST_REGEX_NO_LIB=1 > -DBOOST_REGEX_STATIC_LINK=1 -D_STLP_NO_SGI_IOSTREAMS=1 -D_STLP_DO_IMP > ORT_CSTD_FUNCTIONS=1 -D_STLP_DEBUG=1 -D_STLP_DEBUG_UNINITIALIZED=1 > -D_STLP_NEW_PLATFORM_SDK=1 /Z7 /Od /Ob0 /GX /GR /MDd -I > "libs\regex\build" -I"C:\etc\boost_1_28_0" > -I"c:\etc\STLport-4.5.3\stlport" -I"C:\PROGRA~1\MICROS~3\VC98\include" > -Fo"libs > \regex\build\bin\libboost_regex.lib\msvc-stlport\debug\runtime-link-dyna > mic\stlport-cstd-namespace-std\stlport-iostream-off\s > tlport-version-4.5.3\c_regex_traits.obj" > -Tp"libs\regex\build\../src\c_regex_traits.cpp" > > ...failed vc-C++ > libs\regex\build\bin\libboost_regex.lib\msvc-stlport\debug\runtime-link- > dynamic\stlport-cstd-namespace-std\s > tlport-iostream-off\stlport-version-4.5.3\c_regex_traits.obj... > ---------------------------- CUT HERE ---------------------------- > > Thanks in advance, > > David Resnick > MobileSpear Inc. -- ----------------------------------------------------------- David Abrahams * Boost Consulting dave(a)boost-consulting.com * http://www.boost-consulting.com Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=233351.2287382.3722243.2225243/D=egroupweb/S=1705 006788:HM/A=1212975/R=0/*http://www.gotomypc.com/u/tr/yh/grp/300_mapG/g2 2lp?Target=mm/g22lp.tmpl> 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 the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed] [View Less]

4 4

Exposing static members using boost.python
by sashan 06 Sep '02

06 Sep '02

Hi Is the correct way to expose static members by writing a wrapper function for them? For example void wrap_fn() { Class::fn(); } . . . this_module.def(wrap_fn, "fn"); Thanks in advance Sashan

1 0

array.hpp problem with msvc7 and stlport
by li_lirong 06 Sep '02

06 Sep '02

I got many errors with boost\array.hpp after I chaged to use stlport instead of the one from msvc7. one of these errors is: d:\cpplibs\boost\boost\array.hpp(61) : error C2039: '_Ptrit' : is not a member of '_STL' I have tried to config stlport with STLP_NO_OWN_NAMESPACE and _STLP_DONT_RENAME_STD but the errors still exist. Is it a bug in array.hpp or stlport? Regards, Lirong

2 1

ref. to object functions from threads
by Luis De la Parra 06 Sep '02

06 Sep '02

hi all, is there a way to get a reference to the function object used by a boost::thread object?? when you create a new thread and feed it a function object it copies it and then starts a new thread of execution on this object.. well, I would like to send messages to the object in which the thread is running but I don't know how to do it with boos.threads... is there a way to tell boost:thread not to copy the function object but to use it directly?, or to ask the thread object to give a … [View More]

3 2

n-ary ordered tree template in boost ??
by Marc Cromme 06 Sep '02

06 Sep '02

Dear Boost Members I was wondering if there is an n-ary ordered tree template in boost, something like template <size_t N, class Type, class Alloc = allocator<Type > > class NTree which is a standard container, and a reversible container, ordered by level. That is, first element is root, next series of elements are childs of roots, next series are grandchilds of root , and so on. This way one could parse level by level like a reversible container. There should be the … [View More]

4 13

[BGL] 2D/3D layout algorithms
by Andrew Cunningham 06 Sep '02

06 Sep '02

Has anyone adapted any 2D and/or 3D graph layout algorithms to work with Boost ( i.e. minimum crossing etc...). Seems an obvious question, but I did not find anything via searching... Andrew

4 4

RE: [Boost-Users] Re: Is it possible to retrieve blank strings with boost::tokenizer?
by Sean Shubin 05 Sep '02

05 Sep '02

That did it. Thanks. -----Original Message----- From: Markus Schöpflin [mailto:markus.schoepflin@ginit-technology.com] Sent: Thursday, September 05, 2002 1:48 AM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] Re: Is it possible to retrieve blank strings with boost::tokenizer? char_separator<char> sep("\t", "", keep_empty_tokens); should do the trick. HTH, Markus

1 0

Newbie boost::mem_fn problem
by Mark Snelling 05 Sep '02

05 Sep '02

Hello, My problem I think is very simple, I just can't seem to find the solution I have an STL list of object pointers and I want to call a member function on each of the pointers in the list usigng the STL for_each algorithm. This would seem easy if the list contained the actual objects rather than pointers to them, but because they are pointers I can't find a way of doing this. class Block { public: void update(int x); }; void main() { list<Block*> blocks; for_each(blocks.… [View More]

2 3

RE: [Boost-Users] Re: msvc-stlport build problems
by Jim.Hyslop 05 Sep '02

05 Sep '02

David Resnick (dresnick(a)mobilespear.com) wrote: > I've fixed the problem, here's my solution in case anyone > else needs it: Hi, David Would you mind taking a moment to add this to the Boost Users Wiki site? Follow this URL: http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?CommonBuildPr oblems and edit the page to add a brief description of the problem and how you solved it. Thanks! -- Jim

1 0

Is it possible to retrieve blank strings with boost::tokenizer?
by Sean Shubin 05 Sep '02

05 Sep '02

For example, using the code: string line = "\taaa\t\tbbb\t"; typedef tokenizer<char_separator<char> > tok; char_separator<char> sep("\t"); tok tokens(line, sep); for(tok::iterator i = tokens.begin();i!=tokens.end();++i) { cout << "\t\"" << *i << "\"" << endl; } I get this output: "aaa" "bbb" I want to get this output: "" "aaa" "" "bbb" ""

2 1

boost.python overloading to_python
by dkottowk 04 Sep '02

04 Sep '02

hi, please consider the following example class A { public: A() {} A(const A& a) {} }; class A2 : public A { public: A2() : A() {} A2(const A2& a2) : A(a2) {} }; class B { public: const A& getA(); //returns refs to A or A2 }; now, when exposing this in boost, i would always get A's when calling B::getA() from python, which i understand, since AFAIK the copy Ctors are used to instantiate the python object. to overcome this i wrote: PyObject *to_python(const A &a) { … [View More]

1 0

thread link problem with STLport
by Sam Partington 04 Sep '02

04 Sep '02

Hi, I'm trying to link an app using boost threads and stlport on gcc 2.95(linux), and its coming back with an undefined reference: Debug/threadex.o: In function `threadex::go(void)': .../threadex.cpp:37: undefined reference to `boost::thread::thread(boost::function0<void, boost::empty_function_policy, boost::empty_function_mixin, allocator<boost::function_base> > const &)' and the offending code is new boost::thread(threadex_caller(this)); where theadex_caller looks like … [View More]

1 0

boost::function map with different return types
by Julia Donawald 04 Sep '02

04 Sep '02

Hi, I have the following code: --------------- #include <boost/bind.hpp> #include <boost/function.hpp> #include <map> #include <string> class Foo { public: void Function3() const { int i =2; }; const std::string Function4() const { return ""; }; unsigned int Function5() const { return 2; }; }; std::map<std::string, boost::function<void> > functions; Foo foo; functions["Function3"] = boost::bind(&Foo::… [View More]

3 4

Re: threads and signals question
by Ken Thomases 04 Sep '02

04 Sep '02

On 29 Aug 2002, at 20:12, "lparrab" <lparrab(a)gmx.net> wrote: > I'm starting a multi-threaded program using Boost.Thread library: > it is a "server", in which a thread loops around a "select" to > accept new connections and see when a socket has data to be read, in > which case puts the fds in queue from which other threads are taking > them out to read the data. > The problem I have, is that when a "ReceiverThread" finishes reading > the data from the socket, … [View More]it puts the fd back in the "all > connections list", but by this time the other ("main")thread already > copied the fds from the list and got into the next "select" loop, > which means the socket from which the "receiver" just finished > reading, will not be "selected" (monitored) untill the next select > loop, which will not be untill a) a new connection comes or b)one of > the other connected sockets gets some data that takes makes the main > thread return from select. The cleanest way to wake the main thread from select is to make one of the file descriptors in its FDSET become readable. What you need is a special file descriptor that is always in the FDSET that becomes readable when some other thread needs the main thread to come out of the select call. For this you can use a pipe. Here's a way that requires minimal changes to your existing design: When a thread needs the main thread to wake up, it writes a byte into one end of the pipe. It doesn't matter what the byte contains, its presence in the pipe is the "information" payload. When the main thread comes out of the select, if its end of the pipe was among the readable fds, then it should pull one byte out of the pipe (and discard it). If you use extreme care, you can instead flush the pipe of all bytes if you're sure you won't cause a race condition that way. (Example of race condition: Main thread comes out of select, Main thread builds new FDSET for next select call, Receiver thread writes to pipe to inform it of newly available fd, Main thread flushes pipe and blocks in select. To fix this race condition, you would reverse the order in which the Main thread flushes the pipe and builds the FDSET.) Here's the better design: Consider: why do you need the Receiver threads to wake the Main thread? To transfer responsibility for an fd from a Receiver thread to the Main thread. So, this is similar to the way the Main thread transfers fds to Receiver threads through a queue, and should be implemented in a similar fashion. Instead of using the pipe just to signal the Main thread to wake, actually use it to transfer the fds, just as you use the queue in the other direction. So now, when Receiver threads are done with an fd, they write the actual fd into the pipe. The Main thread wakes because the other end of the pipe was in its FDSET. It should read any and all fds out of the pipe and add them to its "connection list" for its next pass through select. (You can read just one fd from the pipe for each time that select indicates the pipe is readable, or you can set the pipe to be non-blocking and read until the pipe is empty.) This approach is a better design because it implements the actual transfer of responsibility and because the connection list should be private to the Main thread. This way doesn't require that the Receiver threads access the connection list, so the connection list doesn't have to be protected by a mutex. > I think having a thread waiting on each open connection is not the > right approach here, so I thought of going a kind of "production line" > approach in which a few threads (5-10) are reading the data from a > bunch of open connections (50-100), the only thing they do is read the > data, parse it and form a "Request" which they put in a queue for > further processing and then go on to service the other connections. > Then another group of threads is taking this requests and doing > something, and putting Response objects in yet another queue, which > another group of threads "Sender" is taking and sending thorugh the > socket. Just be aware that this design may mean that the client sees responses arrive out of order from their requests. If the client only submits a request after any previous requests have been satisfied, you're OK. If the client can have multiple requests outstanding at once, the Request threads or the Sender threads may finish out-of-order. Also, if the Sender threads don't write atomically or with exclusive access, then the data from multiple responses might be interleaved. This illustrates why it is cleaner to have a thread take full ownership of a connection for its lifetime as others have suggested. Of course, you're not being unreasonable in your approach, but you can marry the two somewhat. You might have each worker thread combine the Receiver, Request, and Sender jobs in sequence and then relinquish the connection back to the main thread. It's not clear to me that there is any advantage in terms of number of threads, thread workload, or throughput to splitting those jobs up. Hope that helps, Ken [View Less]

1 0

boost::recursive_mutex for thread-safe logging crashing
by Ani Taggu 03 Sep '02

03 Sep '02

Hello: I have a simple class to do simple thread-safe logging using recursive_mutex as shown below. The problem is, once in a while, it causes any thread to die while it tries to log. I haven't been able to isolate why this happens. Is recursive_mutex being used correctly? The logging is done like so: extern FileLogger &TheLog() { static g_log("my.log"); return g_log; } TheLog() << "Hello World" << endl; I am using boost 1_28 with MSVC 6 SP5. ------------------------… [View More]

2 3

RE: [Boost-Users] tuple and enums
by Tom Matelich 03 Sep '02

03 Sep '02

Hello Jaakko, Thanks for replying. It works if the constructor is written cons() {} Is there any purpose to putting those default calls there? Tom > From: Jaakko Jarvi [mailto:jajarvi@cs.indiana.edu] > Sent: Thursday, August 29, 2002 8:16 AM > > Hi Tom, > > Your code compiles fine with gcc 3.x and icc 6 (linux), so it may just > be gcc 2.96 problem. > > Cheers, Jaakko > > On Wed, 28 Aug 2002, Tom Matelich wrote: > > > It appears that an enum … [View More]cannot be default constructed in > the way that > > tuple > > does, > > cons() : head(), tail() {} > > > > Any idea on how to get around this (besides using an int in > the tuple)? > > > > Thanks, > > Tom > > > > > > <sample_code> > > > > #include <boost/tuple/tuple.hpp> > > #include <string> > > > > enum Foo { Willis, Arnold }; > > > > void test() > > { > > boost::tuple<Foo, std::string> a; > > } > > > > </sample_code> > > > > </error compiler="gcc version 2.96 20000731 (Mandrake Linux 8.2)"> > > > > > /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp: In > > method > > `boost::tuples::cons<HT, > > TT>::cons () [with HT = Foo, TT = boost::tuples::cons<string, > > boost::tuples::null_type>]': > > > /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp:454: > > instantiated from `boost::tuples::tuple<T0, T1, T2, T3, T4, > T5, T6, T7, > > T8, > > T9>::tuple () [with T0 = Foo, T1 = string, T2 = > > boost::tuples::null_type, T3 > > = boost::tuples::null_type, T4 = boost::tuples::null_type, T5 = > > boost::tuples::null_type, T6 = boost::tuples::null_type, T7 = > > boost::tuples::null_type, T8 = boost::tuples::null_type, T9 = > > boost::tuples::null_type]' > > tuple_enum_test.cpp:8: instantiated from here > > > /usr/local/eddynet/opt/include/boost/tuple/detail/tuple_basic.hpp:263: > > cannot convert `int' to `Foo' in > > assignment > > > > </error> > > > > > > > -------------------------------------------------------------- > --------- > > DISCLAIMER: Information contained in this message and/or > > attachment(s) may contain confidential information of Zetec, Inc. > > If you have received this transmission in error, please notify > > the sender by return email. > > > -------------------------------------------------------------- > --------- > > > > Yahoo! Groups Sponsor > > ADVERTISEMENT > > > > 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 the Yahoo! Terms of Service. > -- -- -- Jaakko Järvi email: jajarvi(a)cs.indiana.edu -- Post Doctoral Fellow phone: +1 (812) 855-3608 -- Pervasive Technology Labs fax: +1 (812) 855-4829 -- Indiana University, Bloomington 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/ [View Less]

2 1

RE: [Boost-Users] tokenizer
by Jim.Hyslop 03 Sep '02

03 Sep '02

Vijay (macrodisk(a)yahoo.com) wrote: > Is there anyway I can combine two tokens and check it as single one? > > I want to divide my string when both "-" and ">" occur together: > > Cell 12-1 -> xyz... > > I want to get the first token as Cell 12-1, how can I achive this via > tokenizer? I haven't used the tokenizer, but it seems to me that your TokenizerFunction can peek at the character after the '-' to see if it is a '>', to determine whether it should … [View More]

2 1

Problems with MSVC-STLPORT toolset
by davlet_panech 03 Sep '02

03 Sep '02

Hello, I'm having problems building release 1.28 with MSVC 6/STLPort 4.5.3/bjam on Windows NT 4. It seems that bjam tries to make a very VERY deep directory tree which at some point becomes too large due to path name limitations. By looking at the trace messages it seems something is very wrong there :) -- the directory tree is modelled after the command line options with some of the options repeated with different values at different levels in the tree. For example the following … [View More]

2 1

[bind] does bind do overload resolution?
by Alex Henderson 02 Sep '02

02 Sep '02

Hi, I'd like boost::bind to use overloaded member functions, but get an internal compiler error. Does bind support overload resolution, or is my compiler at fault? (...or more likely the code!) system = C++Builder 5 (patched), Win2k, boost_1_28_0 example (simplified) code below Thanks, Alex //-------------------------------------------------------------------- ------- #include <string> #include <vector> #include <iostream> #include <boost/bind.hpp> //-------------… [View More]

4 3

Question about scoped_ptr.hpp and config.hpp
by eldritchshadows 31 Aug '02

31 Aug '02

Is there a reason that scoped_ptr.hpp doesn't have config.hpp up at the top like shared_ptr.hpp? When I included it, it got rid of a lot of MSVC++ warnings. Nathan

2 1

shared_ptr and make_indirect_iterator
by Richard Wolf 31 Aug '02

31 Aug '02

Hi I'm trying to use make_indirect_iterator on a container of shared_ptrs as follows: #include <boost/iterator_adaptors.hpp> #include <boost/shared_ptr.hpp> #include <list> #include <algorithm> #include <functional> using std::mem_fun_ref; using std::mem_fun; using std::list; using boost::shared_ptr; using std::for_each; using boost::make_indirect_iterator; class A { public: void f(){} }; int main() { list<A *> List1; list<shared_ptr<A&… [View More]gt; > List2; // This works for_each(make_indirect_iterator(List1.begin()), make_indirect_iterator(List1.end()), mem_fun_ref(&A::f)); // This doesn't work for_each(make_indirect_iterator(List2.begin()), make_indirect_iterator(List2.end()), mem_fun_ref(&A::f)); } The second use of for each fails to compile (error messages at the end of the message). Is it possible to do this? Am I doing something wrong? I'm using gcc v 2.95.2. and the QNX OS. Thanks Richard QCC -I/home/rwolf/boat/src/includes -I/home/rwolf/boat/src/boost_1_27_0 -Wal l -L/home/rwolf/boat/src/lib -L. -O -g -I/home/rwolf/boat/src/includes -I/h ome/rwolf/boat/src/boost_1_27_0 -Wall test.cpp -o test /usr/include/xutility: In instantiation of `std::iterator_traits<boost::shared_ptr<A> >': /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1104: instantiated from `boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::all ocator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: instantiated from here /usr/include/xutility:81: no type named `iterator_category' in `class boost::shared_ptr<A>' /usr/include/xutility:82: no type named `value_type' in `class boost::shared_ptr<A>' /usr/include/xutility:83: no type named `difference_type' in `class boost::shared_ptr<A>' /usr/include/xutility:84: no type named `difference_type' in `class boost::shared_ptr<A>' /usr/include/xutility:85: no type named `pointer' in `class boost::shared_ptr<A>' /usr/include/xutility:86: no type named `reference' in `class boost::shared_ptr<A>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp: In instantiation of `boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::all ocator<boost::shared_ptr<A> > >::iterator>': /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: instantiated from here /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1104: no type named `value_type' in `struct std::iterator_traits<boost::shared_ptr<A> >' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1105: no type named `reference' in `struct std::iterator_traits<boost::shared_ptr<A> >' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1106: no type named `pointer' in `struct std::iterator_traits<boost::shared_ptr<A> >' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp: In function `int main()': /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `value_type' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `reference' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `pointer' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 2 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 3 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 5 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp: At top level: /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp: In instantiation of `boost::make_indirect_iterator<std::list<boost::shared_ptr<A>,std::allocator <boost::shared_ptr<A> > >::iterator>(...)': test.cpp:26: instantiated from here /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `value_type' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `reference' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: no type named `pointer' in `struct boost::detail::traits_of_value_type<std::list<boost::shared_ptr<A>,std::allo cator<boost::shared_ptr<A> > >::iterator>' /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 2 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 3 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: template argument 5 is invalid /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp: In function `{error} boost::make_indirect_iterator<std::list<boost::shared_ptr<A>,std::allocator< boost::shared_ptr<A> > >::iterator>(...)': /home/rwolf/boat/src/boost_1_27_0/boost/iterator_adaptors.hpp:1177: confused by earlier errors, bailing out cc: /usr/lib/gcc-lib/ntox86/2.95.2/cc1plus error 34 make: *** [test] Error 1 [View Less]

3 5

tokenizer
by Vijay 30 Aug '02

30 Aug '02

Hello, Is there anyway I can combine two tokens and check it as single one? I want to divide my string when both "-" and ">" occur together: Cell 12-1 -> xyz... I want to get the first token as Cell 12-1, how can I achive this via tokenizer? Thank you, Vijay

1 0

msvc-stlport build problems
by David Resnick 30 Aug '02

30 Aug '02

Hi, I'm trying to build boost version 1.28.0, msvc-stlport build, using the following line: bjam -sTOOLS=msvc-stlport -sstlport-iostream=on -sSTLPORT_PATH=c:\etc I have no problems building the msvc build. It seems to me that the problem has to do with the MS Platform SDK that I have installed. When compiling STLPort (version 4.5.3) I had similar warnings. 2 work arounds that I found there were either to remove the platform SDK from the include enviroment variable, or (when I found it) to … [View More]define _STLP_NEW_PLATFORM_SDK in stl_user_config.h. I've tried variations of that with compiling Boost, but nothing makes a difference. I've included the error messages that I get for most files. ---------------------------- CUT HERE ---------------------------- vc-C++ libs\regex\build\bin\libboost_regex.lib\msvc-stlport\debug\runtime-link- dynamic\stlport-cstd-namespace-std\stlport-ios tream-off\stlport-version-4.5.3\c_regex_traits.obj c_regex_traits.cpp C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1011) : error C2733: second C linkage of overloaded function 'InterlockedIncremen t' not allowed C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1009) : see declaration of 'InterlockedIncrement' C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1018) : error C2733: second C linkage of overloaded function 'InterlockedDecremen t' not allowed C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1016) : see declaration of 'InterlockedDecrement' C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1026) : error C2733: second C linkage of overloaded function 'InterlockedExchange ' not allowed C:\PROGRA~1\MICROS~3\VC98\include\winbase.h(1023) : see declaration of 'InterlockedExchange' "cl" /Zm400 -nologo -GX -c -DBOOST_REGEX_NO_LIB=1 -DBOOST_REGEX_STATIC_LINK=1 -D_STLP_NO_SGI_IOSTREAMS=1 -D_STLP_DO_IMP ORT_CSTD_FUNCTIONS=1 -D_STLP_DEBUG=1 -D_STLP_DEBUG_UNINITIALIZED=1 -D_STLP_NEW_PLATFORM_SDK=1 /Z7 /Od /Ob0 /GX /GR /MDd -I "libs\regex\build" -I"C:\etc\boost_1_28_0" -I"c:\etc\STLport-4.5.3\stlport" -I"C:\PROGRA~1\MICROS~3\VC98\include" -Fo"libs \regex\build\bin\libboost_regex.lib\msvc-stlport\debug\runtime-link-dyna mic\stlport-cstd-namespace-std\stlport-iostream-off\s tlport-version-4.5.3\c_regex_traits.obj" -Tp"libs\regex\build\../src\c_regex_traits.cpp" ...failed vc-C++ libs\regex\build\bin\libboost_regex.lib\msvc-stlport\debug\runtime-link- dynamic\stlport-cstd-namespace-std\s tlport-iostream-off\stlport-version-4.5.3\c_regex_traits.obj... ---------------------------- CUT HERE ---------------------------- Thanks in advance, David Resnick MobileSpear Inc. [View Less]

2 1

BJam and XEmacs on WinXP
by Dan Muller 30 Aug '02

30 Aug '02

This may be a tad off-topic, but I couldn't find any reference to this relative to XEmacs, and the problem seems to be peculiar to bjam. If I try to run bjam under XEmacs, e.g. via M-x compile, M-x shell-command, or even from inside an XEmacs shell buffer (running CMD), I get the error "spawn: Invalid argument". More specifically, if I run it via shell-command, I get this: ===================== ...found 331 targets... ...updating 1 target... gcc-Archive-action ..\phys_sim\bin\… [View More]

2 3

problem with preprocessing library
by Ellis Cohen 30 Aug '02

30 Aug '02

Using the Boost preprocessor library, I'm getting an unexpected diagnostic from the HP-UX C++ compiler (aCC, version "HP ANSI C++ B3910B A.03.34"). The generated output -- see the last line of "Compiler output", below -- *is* correct. I'm using Boost_1_28_0. Is my use of the preprocessor library incorrect? Ellis Cohen ======================================================================== Code fragment triggering the diagnostic: #include <boost/preprocessor/cat.hpp> #include … [View More]<boost/preprocessor/comma_if.hpp> #include <boost/preprocessor/repeat.hpp> #include <boost/preprocessor/tuple/elem.hpp> #define FOO0 (0, double, some_value) #define FOO1 (0, double, some_other_value) #define FOO2 (0, double, some_other_other_value) #define FOO_CNT 3 #define PPV(I) FOO##I #define PPV_FLAG(I) BOOST_PP_TUPLE_ELEM(3,0,PPV(I)) #define PPV_TYPE(I) BOOST_PP_TUPLE_ELEM(3,1,PPV(I)) #define PPV_NAME(I) BOOST_PP_TUPLE_ELEM(3,2,PPV(I)) #define BOOST_PP_DEF(I,_) BOOST_PP_COMMA_IF(I) BOOST_PP_CAT(d_,PPV_NAME(I))(BOOST_PP_CAT(other.d_,PPV_NAME(I))) BOOST_PP_REPEAT(FOO_CNT, BOOST_PP_DEF, _) #undef BOOST_PP_DEF ======================================================================== Compiler command: /opt/aCC/bin/aCC \ -Iboost_includes \ -Wc,-ansi_for_scope,on \ -Aa \ +inst_compiletime +inst_v \ -E -c Isrc/boost_bug.C -o boost_bug.o ======================================================================== Compiler output: Warning (anachronism) 823: "Isrc/boost_bug.C", line 18 # Redundant preprocessing concatenation operation results in two valid preprocessing tokens. Depending on this implementation defined behavior will result in non-portable code. BOOST_PP_REPEAT(FOO_CNT, BOOST_PP_DEF, _) ^^^^^^^^^^^^^^^ Warning (anachronism) 823: "Isrc/boost_bug.C", line 18 # Redundant preprocessing concatenation operation results in two valid preprocessing tokens. Depending on this implementation defined behavior will result in non-portable code. BOOST_PP_REPEAT(FOO_CNT, BOOST_PP_DEF, _) ^^^^^^^^^^^^^^^ Warning (anachronism) 823: "Isrc/boost_bug.C", line 18 # Redundant preprocessing concatenation operation results in two valid preprocessing tokens. Depending on this implementation defined behavior will result in non-portable code. BOOST_PP_REPEAT(FOO_CNT, BOOST_PP_DEF, _) ^^^^^^^^^^^^^^^ #line 1 "Isrc/boost_bug.C" #line 1 "boost_includes/boost/preprocessor/cat.hpp" #line 2 "Isrc/boost_bug.C" #line 1 "boost_includes/boost/preprocessor/comma_if.hpp" #line 1 "boost_includes/boost/preprocessor/comma.hpp" #line 17 "boost_includes/boost/preprocessor/comma_if.hpp" #line 1 "boost_includes/boost/preprocessor/empty.hpp" #line 18 "boost_includes/boost/preprocessor/comma_if.hpp" #line 1 "boost_includes/boost/preprocessor/if.hpp" #line 1 "boost_includes/boost/preprocessor/logical/bool.hpp" #line 17 "boost_includes/boost/preprocessor/if.hpp" #line 1 "boost_includes/boost/preprocessor/tuple/elem.hpp" #line 18 "boost_includes/boost/preprocessor/if.hpp" #line 19 "boost_includes/boost/preprocessor/comma_if.hpp" #line 3 "Isrc/boost_bug.C" #line 1 "boost_includes/boost/preprocessor/repeat.hpp" #line 4 "Isrc/boost_bug.C" #line 18 d_some_value( other.d_some_value) , d_some_other_value( other.d_some_other_value) , d_some_other_other_value( other.d_some_other_other_value) [View Less]

3 2