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

BoostPython and VC 7.1 Everett ( again )
by Bernhard Glueck 25 Sep '02

25 Sep '02

Hi again. John, i checked out the RC_1_29_0 branch a few hours ago, and tried to compile everything. Using bjam everything builds fine, EXCEPT Boost Python... all other libs work as expected using MSVC1310.... Here is the error i get for all the targets of boost python: vc-C++ libs\python\build\bin\boost_python.dll\vc7\debug\runtime-link-dynamic\typ es.obj types.cpp E:\sdk\boost\boost\boost\python\reference.hpp(213) : error C2888: 'boost::shared _ptr' : symbol cannot be defined within namespace 'python' E:\sdk\boost\boost\boost\python\reference.hpp(222) : see reference to cl ass template instantiation 'boost::python::reference<T>' being compiled Maybe this just is not fixed yet... or its an error of mine Till next time Bernhard [Non-text portions of this message have been removed]

1 0

Boost Python and VC7.1 ( Everett )
by Bernhard Glueck 25 Sep '02

25 Sep '02

Since we switched our projects to the new VC7.1 C++ Compiler ( MSVC 1310 ) recently i am not able to compile Boost Python anymore. The question is, if that's not supported at all, or if there is a workaround to do this. ( Compiling with VC7.0 works fine for me ) I upgraded to the most recent CVS version of Boost today, but still no luck ( using bjam "-sTOOLS=vc7" ) at least it does not spit out a "Unknown compiler version" warning anymore.... Any clues? Thanks, Bernhard Glueck [Non-text portions of this message have been removed]

4 3

Quicker than boost RegEx?
by shevaxp 25 Sep '02

25 Sep '02

Hi. After trying boost RegEx++ in intensive string processing(NLP), performance is poor. Simply, for those who wants the quickest regex modules in C++/C , does anybody know what´s the best open source alternative? Thank you.

4 4

How to visualise a graph
by tomislav_trajkovski 25 Sep '02

25 Sep '02

I am using the Boost 1.28.0 library on Windows 2000 with MSVC 6.0. Among other things I want to visualise a graph. The graph is a directed acyclic graph and what I want is an optimal presentation that occupies as little screen space as possible and where edges do not cross. Does anyone have any tips? Tomislav Trajkovski

2 1

RE: [Boost-Users] cluttered mail
by Garriss, Michael 25 Sep '02

25 Sep '02

Cluttered mailbox? Come on now, most modern mail clients include some sort of option to have mail from certain senders moved to a special folder..... -----Original Message----- From: Rama Rao M.V. [mailto:ramu_mallela@yahoo.com] Sent: Wednesday, September 25, 2002 3:55 AM To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] Boost Python and VC7.1 ( Everett ) Please tell me how to UNSUBSRIBE to Boost. My mail box is getting cluttered with mails Rama Rao --- Bernhard Glueck <bernhard(a)realspace.org> wrote: > Since we switched our projects to the new VC7.1 C++ > Compiler ( MSVC 1310 ) recently i am not able to > compile Boost Python anymore. > The question is, if that's not supported at all, or > if there is a workaround to do this. ( Compiling > with VC7.0 works fine for me ) > > I upgraded to the most recent CVS version of Boost > today, but still no luck ( using bjam "-sTOOLS=vc7" > ) at least it does not spit out a "Unknown compiler > version" warning anymore.... > > Any clues? > > Thanks, > Bernhard Glueck > > [Non-text portions of this message have been > removed] > > > ===== M.V.Rama Rao __________________________________________________ Do you Yahoo!? New DSL Internet Access from SBC & Yahoo! http://sbc.yahoo.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.

1 0

Unsubscribe [was: RE: [Boost-Users] Boost Python and VC7.1]
by Björn Karlsson 25 Sep '02

25 Sep '02

> From: Rama Rao M.V. [mailto:ramu_mallela@yahoo.com] > Please tell me how to UNSUBSRIBE to Boost. My mail box > is getting cluttered with mails > Rama Rao Assuming you have tried (without success) the link included in each of the messages "cluttering" you mailbox, please send a note to the list administrators, and we'll do it manually for you. > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Regards, Bjorn Karlsson Moderator

1 0

RE: [Boost-Users] Boost Python and VC7.1 ( Everett )
by Jim.Hyslop 25 Sep '02

25 Sep '02

Rama Rao M.V. [mailto:ramu_mallela@yahoo.com] wrote: > Please tell me how to UNSUBSRIBE to Boost. My mail box > is getting cluttered with mails I'll give you a hint - look at the bottom of any message sent via the newsgroup. There are instructions right there. -- Jim

1 0

metaprogramming and MPL
by Ihsan Ali Al Darhi 25 Sep '02

25 Sep '02

Hi... I am interested in metaprogramming and Boost mpl. But I can't find a complete doc about the two subjects together. Where on the net I can such info? Mohammed

1 0

Really dumb question from g++ newbie
by Craig Henderson 25 Sep '02

25 Sep '02

I've developed my library with MSVC7 and am now trying to test on as many compiler as possible. Using g++ 2.95.3-5 on cywin, I get a compiler error using std::distance `distance' undeclared in namespace `std' I have tried all the obvious includes, but the problem seems to be a configuration issue for using namespaces. The code compiles on VC7/Dinkumware, VC7/STLport-4.5.3 and BCC 5.5.1 so I am confident that there is no error in the code itself. Could someone please point me in the right direction? TIA -- Craig

4 5

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

24 Sep '02

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

1 0