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

BGL : Undirected graph form a directed graph
by Jean-Noël Monette 14 Feb '06

14 Feb '06

Hello, I want to find the (weakly) connected components and the biconnected components of a directed(bidirectional) graph. But these methods need a undirected graph as input. Does anyone know a simple way to create a undirected graph from a directed graph or a undirected view of a directed graph? Thanks a lot, Jean-Noël

1 0

[Boost.Build v2] problem with multiple version build
by Dick Bridges 14 Feb '06

14 Feb '06

I can't seem to get bjam v2 to build multiple library versions. The O/S is: # uname -a Linux myhost 2.6.9-1.667 #1 Tue Nov 2 14:41:25 EST 2004 i686 i686 i386 GNU/Linux First I untarD boost_1_33_1.tar.bz2 to /home/dick and followed the instructions for building bjam. Then I copied bjam to /home/dick/bin. Next I modified /home/dick/boost_1_33_1/tools/build/v2/example/hello/user-config.jam adding the 3.4.4.x86 and 3.3.arm versions like so: <mod> # Configure specific gcc version, giving alternative name to use # using gcc : 3.2 : g++-3.2 ; using gcc : 3.4.4.x86 ; using gcc : 3.3.arm : <fake CR> /opt/crosstool/arm-softfloat-linux-gnu/<fake CR> gcc-3.3.3-glibc-2.3.2<fake CR> /bin/arm-softfloat-linux-gnu-c++ ; </mod> Then (because I'm confused) I copied the modified user-config.jam to /home/dick/boost_1_33_1 as well. The version seems to be correct. cd /home/dick/boost_1_33_1 # ~/bin/bjam --v2 --version Boost.Build V2 (Milestone 10) Boost.Jam 03.01.11 The example/hello build seems to work. cd /home/dick/boost_1_33_1/tools/build/v2/example/hello # ~/bin/bjam gcc-3.4.4.x86 gcc-3.3.arm ...found 13 targets... ...updating 9 targets... MkDir1 bin MkDir1 bin/gcc-3.4.4.x86 MkDir1 bin/gcc-3.4.4.x86/debug gcc.compile.c++ bin/gcc-3.4.4.x86/debug/hello.o gcc.link bin/gcc-3.4.4.x86/debug/hello MkDir1 bin/gcc-3.3.arm MkDir1 bin/gcc-3.3.arm/debug gcc.compile.c++ bin/gcc-3.3.arm/debug/hello.o gcc.link bin/gcc-3.3.arm/debug/hello ...updated 9 targets... Now I hit a brick wall. I've tried setting both BOOST_BUILD_PATH and BOOST_ROOT to both /home/dick/boost_1_33_1/tools/build/v2 and /home/dick/boost_1_33_1. If I try cd /home/dick/boost_1_33_1 # ~/bin/bjam gcc-3.4.4.x86 gcc-3.3.arm install I get <msg> don't know how to make gcc-3.4.4.x86 don't know how to make gcc-3.3.arm </msg> If I try cd /home/dick/boost_1_33_1/tools/build/v2 # ~/bin/bjam gcc-3.4.4.x86 gcc-3.3.arm install I get <msg> notice: could not find main target install notice: assuming it's a name of file to create /home/dick/boost_1_33_1/tools/build/v2/build/project.jam:680: in attribute warning: rulename $($(project).attributes).get expands to empty string /home/dick/boost_1_33_1/tools/build/v2/build/project.jam:690: in project.target /home/dick/boost_1_33_1/tools/build/v2/build-system.jam:256: in load /home/dick/boost_1_33_1/tools/build/v2/kernel/modules.jam:259: in import /home/dick/boost_1_33_1/tools/build/v2/kernel/bootstrap.jam:153: in boost-build /home/dick/boost_1_33_1/tools/build/v2/boost-build.jam:2: in module scope /home/dick/boost_1_33_1/tools/build/v2/build/project.jam:680: in project.attribute warning: rulename $($(project).attributes).get expands to empty string /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:200: in object(project-target)(a)3.__init__ /home/dick/boost_1_33_1/tools/build/v2/kernel/class.jam:92: in new /home/dick/boost_1_33_1/tools/build/v2/build/project.jam:690: in project.target /home/dick/boost_1_33_1/tools/build/v2/build-system.jam:256: in load /home/dick/boost_1_33_1/tools/build/v2/kernel/modules.jam:259: in import /home/dick/boost_1_33_1/tools/build/v2/kernel/bootstrap.jam:153: in boost-build /home/dick/boost_1_33_1/tools/build/v2/boost-build.jam:2: in module scope /home/dick/boost_1_33_1/tools/build/v2/build/project.jam:680: in project.attribute warning: rulename $($(project).attributes).get expands to empty string /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:219: in get /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:281: in targets-to-build /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:250: in object(project-target)(a)3.generate /home/dick/boost_1_33_1/tools/build/v2/build-system.jam:267: in load /home/dick/boost_1_33_1/tools/build/v2/kernel/modules.jam:259: in import /home/dick/boost_1_33_1/tools/build/v2/kernel/bootstrap.jam:153: in boost-build /home/dick/boost_1_33_1/tools/build/v2/boost-build.jam:2: in module scope /home/dick/boost_1_33_1/tools/build/v2/build/project.jam:680: in project.attribute warning: rulename $($(project).attributes).get expands to empty string /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:219: in get /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:282: in targets-to-build /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:250: in object(project-target)(a)3.generate /home/dick/boost_1_33_1/tools/build/v2/build-system.jam:267: in load /home/dick/boost_1_33_1/tools/build/v2/kernel/modules.jam:259: in import /home/dick/boost_1_33_1/tools/build/v2/kernel/bootstrap.jam:153: in boost-build /home/dick/boost_1_33_1/tools/build/v2/boost-build.jam:2: in module scope /home/dick/boost_1_33_1/tools/build/v2/build/project.jam:680: in project.attribute warning: rulename $($(project).attributes).get expands to empty string /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:219: in get /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:281: in targets-to-build /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:250: in object(project-target)(a)3.generate /home/dick/boost_1_33_1/tools/build/v2/build-system.jam:267: in load /home/dick/boost_1_33_1/tools/build/v2/kernel/modules.jam:259: in import /home/dick/boost_1_33_1/tools/build/v2/kernel/bootstrap.jam:153: in boost-build /home/dick/boost_1_33_1/tools/build/v2/boost-build.jam:2: in module scope /home/dick/boost_1_33_1/tools/build/v2/build/project.jam:680: in project.attribute warning: rulename $($(project).attributes).get expands to empty string /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:219: in get /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:282: in targets-to-build /home/dick/boost_1_33_1/tools/build/v2/build/targets.jam:250: in object(project-target)(a)3.generate /home/dick/boost_1_33_1/tools/build/v2/build-system.jam:267: in load /home/dick/boost_1_33_1/tools/build/v2/kernel/modules.jam:259: in import /home/dick/boost_1_33_1/tools/build/v2/kernel/bootstrap.jam:153: in boost-build /home/dick/boost_1_33_1/tools/build/v2/boost-build.jam:2: in module scope don't know how to make install ...found 1 target... ...can't find 1 target... </msg> Apologies for all the error messages but I'm so lost I don't even know what can be snipped and what is meaningful. I'd be very grateful if someone could point me in the right direction. Regards, Dick Bridges

1 0

Is there any function can help me to generate GUID in Boost?
by zsp 14 Feb '06

14 Feb '06

It seem the Serialization lib can generate GUID. But I don't konw which function do this job. I think it'll be useful if give this function alone. Thanks.

2 1

Deadlock issue with boost::condition
by Matt Schuckmann 14 Feb '06

14 Feb '06

I'm having a deadlock problem with boost::condition variables and I'm not sure if I'm miss using condition variables or if condition variables aren't the right tool for the job. The basic problem appears to be that the thread calling notify_all (lets call it thread1) calls notify_all before the thread calling wait (lets call it thread2) calls wait. The result is thread2 waits forever for the notify that thread1 already sent. To further complicate the matter thread1 can't call notify_all again until it has been signaled to run (via a different condition variable) which is signaled by thread2. Does this make sense? Here's some pseudo code for what I'm doing. Thread1() //Worker thread { while(1) { DoSomeStuff(); condition1.notify_all() scoped_lock l(mutex2); condition2.wait(l); } } Thread2() //Master thread. { while(1) { scoped_lock l(mutex1); condition1.wait(l) DoSomeOtherStuff(); condition2.notify_all(); } } StartMulitThreadedTask() { startThread( thread2 ); Sleep( 2000 ) startThread( thread1 ); } Here is a little time line of what I think is happening thread2 locks mutex1 thread2 calls wait on condition1 thread1 calls DoSomeStuff thread1 calls notify_all on condition1 thread1 locks mutex2 thread1 calls wait on condition2 thread2 calls DoSomeOtherStuff thread2 calls notify_all on condition2 thread1 calls DoSomeStuff thread1 calls notify_all on condition1 thread1 locks mutex2 thread1 calls wait on condition1 thread2 locks mutex1 thread2 calls wait on condition1 DEADLOCK OCCURS I've done this sort of thing with plain old binary mutexes or single count semaphores and I can go back to that but it really seemed like boost::conditions simplified things a bit and should be right choice except for this one problem. Is there something I can do to make boost::conditions work in this case? Should I be doing additional or different locking of mutex1 and mutex2? do I need yet another mutex? Thanks Matt S.

3 4

BGL memory inefficient/hog problem
by David Brumley 14 Feb '06

14 Feb '06

Hi, I'm switching from a home-grown graph library to BGL (for creating control flow graphs and callgraphs of program binaries). I must not be using BGL correctly because I keep running out of memory (I'm running FC4 with 1GB). For example, given the following simple program: int main(int argc, char *argv[]) { // create a typedef for the Graph type typedef adjacency_list<vecS, vecS, bidirectionalS> Graph; unsigned int *array; array = new unsigned int[50]; unsigned int i; for(i = 0; i < 50; i++){ array[i] = i + 0x8000000; } // writing out the edges in the graph Graph g; for(i = 0; i < 50; i++){ add_edge(array[i % 50], array[ (i+1) % 50], g); } } And the error I get is: [dbrumley@localhost ~/tmp]$ ./a.out terminate called after throwing an instance of 'std::bad_alloc' what(): St9bad_alloc Abort which is caused by new/new[] throwing an exception on the add_edge line. What am I doing wrong here? I would like to index each node in the graph by its address, which is in the range 0x8000000-0xffffffff. (I would rather not keep a separate index in the range 0-num(verticies)). Thanks, David

2 1

[program_options] multitoken
by Alexander Kondratyuk 14 Feb '06

14 Feb '06

Hello all. Is there any way to get the library to work with the following command line: "--first=11 --first=12" ? So, I want to see the two values for the 'first' option in variable_map, but cant figure out how to do it using program_options features. Thank you in advance.

2 1

Re: [Boost-users] bind()ing only some arguments of a member function
by Sohail Somani 13 Feb '06

13 Feb '06

I think you need to modify the bind to be: bind(&MyClass::foo,this,_1); > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Sean Rhea > Sent: Monday, February 13, 2006 2:54 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] bind()ing only some arguments of a > member function > > Hello, > > Can someone please tell me why this doesn't work? > > > #include <boost/bind.hpp> > #include <boost/function.hpp> > #include <boost/shared_ptr.hpp> > > using namespace std; > using namespace boost; > > struct MyClass { > int i; > void foo(int j){ > printf("%d, %d\n", i, j); > } > function<void(int)> bar() { > return bind<void>(&MyClass::foo, this); > } > }; > > > $ g++ -c -g -I/usr/local/include/boost-1_33_1 -I.. foo.cpp > /usr/local/include/boost-1_33_1/boost/mem_fn.hpp: In member function > 'R& boost::_mfi::dm<R, T>::operator()(T*) const [with R = void () > (int), T = MyClass]': > /usr/local/include/boost-1_33_1/boost/bind.hpp:229: instantiated > from 'void boost::_bi::list1<A1>::operator()(boost::_bi::type<void>, > F&, A&, int) [with F = void (MyClass::*)(int), A = > boost::_bi::list1<int&>, A1 = boost::_bi::value<MyClass*>]' > /usr/local/include/boost-1_33_1/boost/bind/bind_template.hpp:32: > instantiated from 'typename boost::_bi::result_traits<R, F>::type > boost::_bi::bind_t<R, F, L>::operator()(A1&) [with A1 = int, R = > void, F = void (MyClass::*)(int), L = > boost::_bi::list1<boost::_bi::value<MyClass*> >]' > /usr/local/include/boost-1_33_1/boost/function/function_template.hpp: > 136: instantiated from 'static void > boost::detail::function::void_function_obj_invoker1<FunctionObj, R, > T0>::invoke(boost::detail::function::any_pointer, T0) [with > FunctionObj = boost::_bi::bind_t<void, void (MyClass::*)(int), > boost::_bi::list1<boost::_bi::value<MyClass*> > >, R = void, > T0 = int]' > /usr/local/include/boost-1_33_1/boost/function/function_template.hpp: > 479: instantiated from 'void boost::function1<R, T0, > Allocator>::assign_to(FunctionObj, > boost::detail::function::function_obj_tag) [with FunctionObj = > boost::_bi::bind_t<void, void (MyClass::*)(int), > boost::_bi::list1<boost::_bi::value<MyClass*> > >, R = void, T0 = > int, Allocator = std::allocator<void>]' > /usr/local/include/boost-1_33_1/boost/function/function_template.hpp: > 430: instantiated from 'void boost::function1<R, T0, > Allocator>::assign_to(Functor) [with Functor = > boost::_bi::bind_t<void, void (MyClass::*)(int), > boost::_bi::list1<boost::_bi::value<MyClass*> > >, R = void, T0 = > int, Allocator = std::allocator<void>]' > /usr/local/include/boost-1_33_1/boost/function/function_template.hpp: > 294: instantiated from 'boost::function1<R, T0, > Allocator>::function1(Functor, typename > boost::enable_if_c<boost::type_traits::ice_not<boost::is_integ > ral<Functo > r>::value>::value, int>::type) [with Functor = > boost::_bi::bind_t<void, void (MyClass::*)(int), > boost::_bi::list1<boost::_bi::value<MyClass*> > >, R = void, T0 = > int, Allocator = std::allocator<void>]' > /usr/local/include/boost-1_33_1/boost/function/function_template.hpp: > 637: instantiated from 'boost::function<R ()(T0), > Allocator>::function(Functor, typename > boost::enable_if_c<boost::type_traits::ice_not<boost::is_integ > ral<Functo > r>::value>::value, int>::type) [with Functor = > boost::_bi::bind_t<void, void (MyClass::*)(int), > boost::_bi::list1<boost::_bi::value<MyClass*> > >, R = void, T0 = > int, Allocator = std::allocator<void>]' > foo.cpp:15: instantiated from here > /usr/local/include/boost-1_33_1/boost/mem_fn.hpp:347: error: invalid > use of non-static member function > > > Thanks, > Sean > -- > Compassion, tolerance, consideration of others, the > responsible > use of knowledge and power. These principles transcend the > barriers between religious believers and non-believers; they > belong not to one faith, but to all faiths. > -- The 14th Dalai Lama > > >

1 0

Rép : [Boost-users] pd darwin Symbol not found
by Locatelli Jérôme 13 Feb '06

13 Feb '06

I found that I can't use static boost lib with my dylib program library. I test with all dylib (boost libraries and my libraries) or all static libraries, it runs in the two cases !!! --------------------------------------------------- Locatelli Jérôme Institut Laue-Langevin Service Contrôle des instruments 6 rue Jules Horowitz, BP 156 38042 Grenoble cedex 9 http://www.ill.fr/ Tel: 33 (0)4 76 20 76 27 Fax: 33 (0)4 76 20 77 00 ---------------------------------------------------

2 1

[any] bug? any_cast<>( any& ) returns by value
by Marc Mutz 13 Feb '06

13 Feb '06

Hi, I was wondering why any_cast doesn't return a reference (as boost::get does for boost::variant). To me, it seems to make little sense to supply a any_cast overload with argument any& in addition to const any &, for return-by-value. It also needlessly invokes T's copy ctor, which esp bad if that one throws. Both observations considered, I think the implementation should rather be template <typename T> T & any_cast( any & ); template <typename T> const T & any_cast( const any & ); template <typename T> T * any_cast( any * ); template <typename T> const T * any_cast( const any * ); Don't you agree? Thanks, Marc -- Marc Mutz -- marc(a)klaralvdalens-datakonsult.se, mutz(a)kde.org phone: +49 521 521 45 45; mobile: +47 45 27 38 95 Klarälvdalens Datakonsult AB, Platform-independent software solutions

2 2

Re: [Boost-users] Meta Template Programming with MPL - Compiler B ug or is the code really so evil slow?
by James Hughes 13 Feb '06

13 Feb '06

> -----Original Message----- > From: Vinzenz 'evilissimo' Feenstra [mailto:evilissimo@web.de] > Sent: 13 February 2006 12:40 > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Meta Template Programming with MPL - > Compiler Bug > or is the code really so evil slow? > > > > Hi, > > I've written a little Meta Template Program which should > calculate the > first 3 perfect numbers. ( range 1 - 500 ) > > The code is compilable if you use the range 1 - 30 really > fast and works > correctly. But I've tried to compile the code but I can't get > it finished. > > Someone tried it on a Machine with 40 GB RAM and it now compiles for > more than 12 hours and uses more than 7.1 GB RAM ( the compilation ) > > I've tried it by myself with g++ 3.4.x and g++ 4.0.x and with VC++ 7.1 > > The code works on all tested compilers if the range would be > 1 - 30 but > > If the range is 1 - 500 VC++ says: > > d:\boost\vc71\include\boost-1_33_1\boost\mpl\aux_\preprocessed > \plain\apply_wrap.hpp(48): > fatal error C1204: compiler limit: internal structure overflow. > > ( This seems to be a known bug in VC++ > http://support.microsoft.com/default.aspx?scid=kb;en-us;883655 ) > > and g++ compiles and compiles and uses more and more RAM. > > > Is the code really so evil slow or is it a compiler Bug in g++? > > Maybe anyone has an answer. > > BR > evilissimo > > Without the code its difficult to tell, but this meta programming uses recursive definitions of templates, and with a lot of information required per template per iteration, you are running out of memory, as the error messages indicate. Not a compiler bug I don't expect - you are just asking too much. Templates require quite a bit of memory for a single instance - multiply that by the 500 you are asking for and things rapidly go downhill, which is why 30 works - you haven't hit the point at which you run out of memory (and hence require swapping which is a very slow process in comparison to memory access). In fact the multiplication factor is probably more than 500, it may go up as exponential or perhaps even factorial depending on the code James

2 1