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

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

16 Sep '02

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

2 2

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

16 Sep '02

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

2 5

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

16 Sep '02

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

1 0

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

16 Sep '02

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

1 0

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

16 Sep '02

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

2 1

lexical_cast question
by Mark Snelling 16 Sep '02

16 Sep '02

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

1 0

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

16 Sep '02

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

5 9

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

16 Sep '02

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

2 1

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

16 Sep '02

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

1 0

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

15 Sep '02

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

2 1

tokenizer bug? core dump
by wugui 14 Sep '02

14 Sep '02

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

1 1

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) is the default set? On another note: the online reference manual is pretty good in my opinion, but it's hard to get a real overview of the contents. It also lacks an index, making it hard to look up questions like the one above. Is the book any better in this respect? Any other references worth looking up - books or webpages? Thanks, Erik

3 4

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

14 Sep '02

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

2 1

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

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 they are binary compatible. > If you have trouble compiling bjam yourself, could you provide the error-log ? > Finally I just renamed bjam.gz to bjam and it seems to run. My problem was that the bjam.gz wasn't a .gz after all. We'll see how much futher I get. Thanks, Glen [Non-text portions of this message have been removed]

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 the compiler to recognise invalid statements is to undefine BOOST_MSVC6_MEMBER_TEMPLATES. We are now considering to enforce this undefine across our project. Does anyone know which boost features would become inaccessible? Regards, Jacob

2 1