July 2006 - Boost-users - lists.boost.org

astar-cities.cpp internal compile error
by bringiton bringiton 03 Aug '06

03 Aug '06

Hi, I'm trying to compile the sample from astar-cities.cpp. I however get a INTERNAL COMPILER ERROR. I'm using ms vc++ 6. Can I assume the sample does not run on the old vc++ version? Anything I can do to get around this? Test5.cpp xxx\boost\random\lagged_fibonacci.hpp(81) : fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 1794) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information Generating Code... Error executing cl.exe. Test2.exe - 1 error(s), 1 warning(s)

3 2

[bgl documentation] corrections (?) and improvements to help new users
by David Baird 03 Aug '06

03 Aug '06

Hi! I'm a new user of the BGL. I've attached a couple patches to the BGL documentaion which I think will be very helpful to new users. For example, one of the websites, http://www.boost.org/libs/graph/doc/file_dependency_example.html seems to contain a simple, but confusing (for new users) error: Graph g(N, used_by, used_by + sizeof(used_by) / sizeof(Edge)); In boost-1.33.0, the correct line AFAICT is, Graph g(used_by, used_by + sizeof(used_by) / sizeof(Edge), N); I successfully tested the new instructions in the documentation (which the attached patches apply to) with boost-1.33.0 under Gentoo Linux. If this is the wrong list to post this, please direct me toward the correct place. -David

2 1

[BGL] traversing edges in the graph
by Alejandro Aragón 03 Aug '06

03 Aug '06

Hello, I'm working with undirected graphs and I was wondering if there is an algorithm that traverses all the edges in the graph in such a way that this task is optimized. That is, if you draw a graph with a pencil, the number of times that you should lift the tip of the pencil is minimized. Can anyone give me a hint on this? Thanks, Alex

2 1

[bgl] user defined vertex_descriptor?
by timblech 03 Aug '06

03 Aug '06

hi all, i'm curious, if it's possible to change the type, that a graph uses as vertex_descriptor... i went through the examples, where usually int values are used, which seems to be the default ... for my application, i'd like to use a class pointer as vertex_descriptor, though... the problem i had with property map is, that i was only able to look up a property by vertex_descriptor, but not the other way round... it's possibly only a problem caused by my limited knowledge of the bgl, but it would be very nice, if someone could enlighten me. thanks in advance ... tim -- View this message in context: http://www.nabble.com/-bgl--user-defined-vertex_descriptor--tf2008709.html#… Sent from the Boost - Users forum at Nabble.com.

2 1

help building shared library for lib/filesystem on RHEL4 with gcc 3.4.4
by William Deegan 03 Aug '06

03 Aug '06

Greetings, When I do the following: pushd libs/filesystem/build bjam "-sTOOLS=gcc" I only end up with the /boost-1.30.2/libs/filesystem/build/bin/libboost_filesystem.a/gcc/release/runtime-link-dynamic/libboost_filesystem.a Built and no .so What am I missing? Thanks, Bill

2 3

[test] how to use register_exception_translator with auto_test?
by Jörg Becker 03 Aug '06

03 Aug '06

How can I use the the register_exception_translater with the Auto unit test framework? With boost 1.31 / VC7.1 I wrote a dummy test only containing the register_exception_translator call. This works fine, but with boost 1.33 / gcc3.3 this workaround does not work. Any Suggestions? Jörg

3 6

Re: [Boost-users] [multi_index] illegal indirection compile error
by JOAQUIN LOPEZ MU?Z 01 Aug '06

01 Aug '06

----- Mensaje original ----- De: Themistoklis Bourdenas <themis(a)ics.forth.gr> Fecha: Lunes, Julio 31, 2006 4:47 pm Asunto: [Boost-users] [multi_index] illegal indirection compile error > Could you help me understand what I'm doing wrong in the code > below? I'm > trying to setup a multi_index structure of class B. > > class A > { > const std::string& ID(void) const; > ... > }; > > class B : public A > { > ... > }; > > typedef boost::multi_index::multi_index_container< > B*, > boost::multi_index::indexed_by< > boost::multi_index::ordered_unique< > boost::multi_index::const_mem_fun<A, const > std::string&, &A::ID> > > > > > > BSet; > > However when I compile VS2005 returns me an "illegal indirection" > compile error. Any thoughts? Hello Themistoklis, You've found a limitation in Boost.MultiIndex (as of Boost 1.33.1) by which one cannot specifiy a key in a given base class and pass derived classes as elements. This is solved in what will become Boost 1.34, please read bullet 3 of Boost.MultiIndex release notes at: http://boost- consulting.com/boost/libs/multi_index/doc/release_notes.html#boost_1_34 Until this release is out, you can use the following workarond: simply define a custom key extractor like this (warning, I haven't compiled it, beware typos): struct pB_ID_extractor { typedef std::string result_type; const std::string& operator()(const B* pb)const { return pb->ID(); } }; typedef boost::multi_index::multi_index_container< B*, boost::multi_index::indexed_by< boost::multi_index::ordered_unique< pB_ID_extractor > > > BSet; Does this help? Thank you for using Boost.MultiIndex, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

in_edges inconsitency
by Louis Lavery 01 Aug '06

01 Aug '06

p219 of the BGL book says that in_edges(...) is available for bidirectional graphs but that in_degree(...) is not. Shouldn't both or neither be available? Louis.

2 1

boost.program_options gives ./first: free(): invalid pointer with g++ 4.0.3 and 4.1.0
by William Lederer 01 Aug '06

01 Aug '06

In compiling and testing the 'first.cpp' program from the example directory of the program_options directory, the program fails with the message: *** glibc detected *** ./first: free(): invalid pointer: 0x00000000005104e8 *** I built g++ version 4.1.0 and received the same result. The hardware is AMD opteron 64 bit, the OS is Linux fedora core 4. I had upgraded the compiler earlier to 4.0.3, and all other compiles/execution work fine and also tried 4.1.0 gcc. Nonetheless, I cannot shake the notion that this might be related to the compiler. Are there any ideas regarding what I might try next? Thanks -- William Lederer <wgl(a)ciexinc.com> CIEX, Incorporated

2 1

Re: [Boost-users] performance of template expression
by Sohail Somani 01 Aug '06

01 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > divyank shukla > Sent: Monday, July 31, 2006 8:06 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] performance of template expression > > snip.... > > My question is does the performance penalty still > exist with g++(4.1) compilers as against boost::lambda > functions. Where are your performance results (hard numbers)? Have you measured them as compared to the rest of your algorithm? For example, if you do the general QR decomposition, chances are that's going to be the slow part. One should usually profile after coding, rather than optimizing prematurely. Generally it's the algorithm that is slow.

2 1