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

Solved my problem, RE: program_options wide chars.
by John Gardner 14 Feb '06

14 Feb '06

Apparently the library is compiled treating wchar_t as a built-in type. This applies to at least Visual Studio .Net 2003, and probably 2005. Programs that link with the program_options lib need to define /Zc:wchar_t, e.g. Project Properties -> C/C++ -> Language -> Treat wchar_t as Built-in Type -> Yes --John Gardner

1 0

program options, link error on wide char support
by John Gardner 14 Feb '06

14 Feb '06

I'm having a problem with the wchar_t functions on windows with VS .Net 2003. I compiled with bjam "-sTOOLS=vc-7_1" -sBOOST_LIB_DIAGNOSTIC --without-python install In a program with a _tmain (wchar_t argv), I have: #ifdef BOOST_NO_STD_WSTRING cout << "No standard wstring! " << BOOST_NO_STD_WSTRING << endl; #endif cout << "Stdlib version: " << BOOST_STDLIB << endl; wstring wstr = L"abc"; string str = "abc"; str = boost::program_options::to_internal(wstr); I get: error LNK2019: unresolved external symbol "class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > __cdecl boost::program_options::to_internal(class std::basic_string<unsigned short,struct std::char_traits<unsigned short>,class std::allocator<unsigned short> > const &)" (?to_internal@program_options@boost@@YA?AV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@ABV?$basic_string@GU?$char_traits@G@std@@V?$allocator@G@2@@4@@Z) referenced in function _main However, if I call to_internal() with 'str' instead of 'wstr', it links fine, and the output is: Stdlib version: Dinkumware standard library version 313 abc I have similar problems with other functions, but I've narrowed it down to a single function here. Is there anything special that needs to happen for wchar_t functions in program_options? TIA, John Huxoll Gardner

1 0

Tree data structure
by Jeroen Vanattenhoven 14 Feb '06

14 Feb '06

Which of the boost libraries do I need for creating a tree data structure? Purpose is to hold data for a legend for a map. The legend has different layers and each layer may have sublayers. Thanks, Jeroen Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm

2 1

Re: [Boost-users] BGL : Undirected graph form a directed graph
by Dmitry Bufistov 14 Feb '06

14 Feb '06

boost-users-request(a)lists.boost.org wrote: > > 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 > > > ------------------------------------------------------------------------ > Hi, Probably this could help #include <boost/graph/copy.hpp> boost::copy_graph() if not something like this should work template <class TGraph1, class TGraph2> void directed2undirected(const TGraph1& directed_graph, TGraph2& undirected_graph) { typedef typename boost::graph_traits<TGraph1>::vertex_descriptor vertex1; typedef typename boost::graph_traits<TGraph2>::vertex_descriptor vertex2; typedef typename boost::graph_traits<TGraph1>::edge_iterator edge_iterator; std::vector<vertex1> orig_vertices; std::copy(vertices(directedt_graph).first, vertices(directed_graph).second, std::back_inserter(orig_vertices)); std::map<vertex1, vertex2> vertex_map; // undirected = TGraph2(boost::num_vertices(directed_graph)); for (std::size_t i = 0; i < num_vertices(directed_graph); ++i) { vertex_map[orig_vertices[i]] = boost::add_vertex(undirected_graph); ///Also would be good to copy properties, but it isn't necessary as far as I understand } for (edge_iterator e = edges(directed_graph).first; e != edges(directed_graph).second; ++e) { boost::add_edge(vertex_map[source(*e, directed_graph)], vertex_map[target(*e, directed_graph)], /*directed_graph[*e],*/ undirected_graph); } } I don't know if there is some way to do it without copying. If some, please let me know. Regards, --dmitry

1 0

Boost random hangs
by gast128 14 Feb '06

14 Feb '06

Dear all, probably alread posted a hundred times, but the follwoing code hangs on my pc: int MakeRandomInt() { const int nMin = std::numeric_limits<int>::min(); const int nMax = std::numeric_limits<int>::max(); typedef boost::minstd_rand Generator; typedef boost::uniform_int<> Distributor; typedef boost::variate_generator<boost::minstd_rand, Distributor> VariateGenerator; Generator generator(static_cast<unsigned>(time(NULL))); Distributor uni_dist(nMin, nMax); VariateGenerator uni(generator, uni_dist); return uni(); } Making the range half the size does help. Did I miss the documentation? Wkr, me

1 0

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