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

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

14 Sep '02

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

2 1

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 more about Computers, uwe.schmitt(a)procoders.net than astronomy is about telescopes. (Dijkstra) http://www.procoders.net

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.end(), cout << _1 << endl); } -------------------------------------- I am met by: % g++ -I/usr/local/boost -c lambda_test.cpp lambda_test.cpp: In function `int main()': lambda_test.cpp:17: no match for `const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda:: bitwise_action<boost::lambda::leftshift_action>, boost::tuples::tuple<std::ostream&, boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > > << <unknown type>' operator Any suggestions? I am aware that I can replace endl by '\n' and get a compilable program. I worry that this problem extends to other manipulators... Thanks, Ken

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 there something I could change to enfinciently use boost regex in NLP programming? If not, what´s the better(at least better than Perl!) regex engine in C/C++ for NLP programming (and,of course... OPEN SOURCE) ? Thank you. (and sorry for my english) Bye!

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<dimension; ++i) for (int j=0; j<dimension; ++j) { Covariance(i,j)=0; for (int k=0; k<n; ++k) Covariance(i,j) += M(i,k)*M(j,k); Covariance(i,j) /= n; } What am I doing wrong? I'm using gcc 2.95.3 under Linux 2.4.18 on a mobile Pentium III, if it matters. Thanks in advance Thomas

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() { map<string, Block*> blocks; for_each(blocks.begin(), blocks.end(), *****); } what should I replace the ***** with to call update() on each block? Any help appreciated! Mark.

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*>::const_iterator i = find_if(col.begin(),col.end(),mem_fun(&Widget::IsPrimary)); However, when I try to use the boost::shared_ptr library like so... typedef boost::shared_ptr<Widget> WidgetPtr; vector<WidgetPtr> col; This statement causes gcc to bark with all manner of errors... vector<WidgetPtr>::const_iterator i = find_if(col.begin(),col.end(),mem_fun(&Widget::IsPrimary)); I'm thinking I've missed something basic, but it's eluding me...

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 867 BOOST_FUNCTION_DEPRECATED_INNER I'm using a relatively new CVS snapshot (<2 days old). -- Free Crypto Token - FCT www.FreeCryptoToken.org

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