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

1_32 compiling xml_grammer
by Jeremy Jurksztowicz 02 Apr '05

02 Apr '05

Hi, I am having problems compiling 1_32 on a G4 darwin system with GCC 3.x. 1_31 compiles fine, but when I the xml_grammer.o is being compiled in 1_32, it seems to take forever... as in forever. My computer seems to be doing things but I wonder if a modern processor should take over 4 hours to compile 1 lousy object file. That is how long I have left the compiler running for, 4 hours, still churning away at xml_grammer.o. Is it normal for xml_grammer to take a long time to compile? Nothing in xml_grammer.hpp (and xml_grammer.ipp) indicates that it should take so long. Perhaps it is my bjam build? I am using the bjam I installed with 1_31 to compile 1_32. Thanks, Jeremy Jurksztowicz

3 2

mingw and boost
by Srinivasan, Rajagopalan (GE Healthcare) 01 Apr '05

01 Apr '05

all, i have mingw g++ version 3.4.2 i got boost compiled and installed on c:\Boost my simple app does not link. Error Message is - C:/DOCUME~1/208004~1/LOCALS~1/Temp/ccK6caaa.o(.text$_ZN5boost15program_options16validation_errorC1ERKSs[boost::program_options::validation_error::validation_error(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)]+0x53):hello.cpp: variable 'vtable for boost::program_options::validation_error' can't be auto-imported. Please read the documentation for ld's --enable-auto-import for details. I cannot seem to find such a switch for ld. also - I am using make. should i be using jam (or bjam?) for my app. If these are in addressed some FAQ please point me. regards srini DISCLAIMER: This e-mail and any attachment is intended only for the exclusive and confidential use of the addressee(s). If you are not the intended recipient, any use, interference with, disclosure or copying of this material is unauthorised and prohibited. If you have received this message in error, please notify the sender by return e-mail immediately and delete the message from your computer without making any copies. Please see http://www.ge.com.au/help/email_privacy_policy.html for information about our privacy practices.

5 13

Directed graphs in Graph Library
by Dimitris Xochelis 01 Apr '05

01 Apr '05

Hi list, I am very interested in the graph library, which I am planning to use quite soon. My biggest concern is whether Graph Library can help me to find a minimum spanning tree in an *directed* graph with weighted edges. I know that for undirected graphs I can use either the Kruskal's algorithm or the Prim's algorithm, that Graph Library already provides. But what if I need to work with directed graphs? Please note (in case it helps): The problem that I am trying to solve does not require the use of weighted edges actually, I only need to enforce some constrains, giving absolute priority to some (directed) edges. I could just as well use Boolean flags instead of weights. Thanks in advance, Jim Xochellis This email and any files transmitted with it are confidential and intended solely for the use of the individual or entity to whom they are addressed. If you have received this email in error please notify the system manager. This message contains confidential information and is intended only for the individual named. If you are not the named addressee you should not disseminate, distribute or copy this e-mail.

2 1

Lambda expression with boost::scoped_array
by Sean DeNigris 01 Apr '05

01 Apr '05

I want to write: vector<int> MyClass::MemFunc(const Cartridge&) const; int numCartridges = Cartridge::size(); scoped_array< vector<int> > vectorArray(new vector<int>[numCartridges]); int i = 0; for_each(CartridgeVector::begin(), CartridgeVector::end(), var(vectArray)[var(i)++] = bind(&MyClass::Memfunc, &db, _1)); I already compiled: vector<int>* vectArray = new vector<int>[CartridgeVector::size()] int i = 0; for_each(CartridgeVector::begin(), CartridgeVector::end(), var(vectArray)[var(i)++] = bind(&MyClass::Memfunc, &db, _1)); But when I add in the scoped_array, I can't get it to work. - Sean

1 0