January 2003 - Boost-users - lists.stage.boost.cppalliance.org

boost::shared_ptr and stl algorithms
by Bill Eidson 15 Apr '05

15 Apr '05

std::vector< boost::shared_ptr<T> > TVec; I want to write a function object to run std::for_each. to do somework against members of T and accumulate results in functor. My attempts have failed in VC7 with memory errors in my operator() method. struct fo { bool operator()( boost::shared_ptr<T>& t ) { return true; } }; Thanks in advance bille

5 9

BGL and reversing / moving edges
by joshrose 17 Dec '03

17 Dec '03

G'day, I was hoping someone might be able to tell me if they've run into any situations using BGL where they needed to move (or reverse (i.e. flip the source and target)) an edge within a graph implemented as an adjacency_list. I'm working on an implementation of an algorithm for max. weight bipartite matching ("the assignment problem"), and one of the assumptions in the algorithm is that non-matched edges are directed from one subgraph, A, to the other subgraph, B, and matched edges are directed the other way. Over the course of growing the matching, a simple way to add and remove edges from the candidate set is just to reverse the edge, thus the need for some way to reverse the edge within BGL. I don't think I can just remove and then re-add the edge in the other direction, primarily because doing so will (I believe) invalidate any edge_descriptors referring to that edge. In particular, there are property maps keeping track of the weight of edges, the predecessors of certain nodes, etc. that use edge descriptors as keys. I've spent a fair bit of time reading the documentation and looking through the implementation of adjacency_lists (incl. edge_list_impl), and I'm not really sure of a way to either move an edge directly within a graph, or even to create a new edge from another s.t. they have the same edge_descriptor (in general a bad thing, probably). Anyone have any thoughts on this? Thanks, -Josh

4 10

bjam and windows command line problem.
by Fernando Cacciola 07 May '03

07 May '03

Hi, I'm having a hard time trying to use bjam to build boost 1.29.0. I have Win98 in Spanish, and I use Borland C++ Builder 5.0 (its bcc32.exe corresponds to is BCC5.5.1) I have boost 1.29.0 installed at: "C:\Libraries\boost\Repository\boost" I've downloaded bjam for Microsoft Windows: >bjam -v Boost.Jam Version 3.1.0. OS=NT. Copyright 1993-2002 Christopher Seiwald and Perforce Software, Inc. Copyright 2001 David Turner. Copyright 2001-2002 David Abrahams. I've temporarily modified the root 'jamfile' so that it builds only the Test library. and I've done: subst d: "c:\archivos de programa\borland\cbuilder5" set BCCROOT=d: (you'll see why in a moment) If I try: c:\>cd C:\Libraries\boost\Repository\boost" C:\Libraries\boost\Repository\boost> bjam -sTOOLS=borland I receive messages of the form: borland-C++-action libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\threading-s ingle\execution_monitor.obj "d:\bin\bcc32" -j5 -q -c -P -w -Ve -Vx -a8 -v -Od -vi- -tWC -WM- -w-8001 -I"libs\test\build" -I"C:\Libraries\boost\Repository\boost" -I"d:\includ e" -o"libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\thre ading-single\execution_moni Error E2266: No file names given tor.obj" "libs\test\build\../src\execution_monitor.cpp" C:\WINDOWS\TEMP\JAMTMP00.BAT [2] Unknown command "TOR.OBJ" "LIBS\TEST\BUILD\.." "d:\bin\bcc32" -j5 -q -c -P -w -Ve -Vx -a8 -v -Od -vi- -tWC -WM- -w-8001 -I"libs\test\build" -I"C:\Libraries\boost\Repository\boost" -I"d:\includ e" -o"libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\thre ading-single\execution_monitor.obj" "libs\test\build\../src\execution_monitor.cpp" ...failed borland-C++-action libs\test\build\bin\libpem.lib\borland\debug\runtime-link-static\threading-s ingle\execution_monitor.obj... If I'm interpreting this output correctly, the problem is that the command line feed to bcc32 exceeds 256 characters. What can be done about this? Is there a way for 'borland-tools.jam' to put the bcc32 parameters in a tmp response file and use: bcc32.exe @tmprsp.rsp? Any help will be appreciated. TIA, -- Fernando Cacciola

4 22

boost/type_traits/config.hpp
by H. Morishima 26 Mar '03

26 Mar '03

My compiler issues the following warning message (boost v1.29.0, G++ 3.2 with warning level high): boost_1_29_0/boost/type_traits/config.hpp:90:55: warning: "BOOST_MSVC" is not defined boost/type_traits/config.hpp: line 90 is: # if (........ || BOOST_MSVC > 1301 || ........) Shouldn't it be as follows? # if (........ || #defined(BOOST_MSVC) && BOOST_MSVC > 1301 || ........) H. Morishima

4 5

adjacency_matrix
by agiatojon 12 Mar '03

12 Mar '03

Hello all, I'm new to the list and to Boost in general and am trying to use an adjacency_matrix in order to plot coordinates (hopefully that is a good use for it). I just started trying to learn it and have entered the sample program from page 237 into my compiler (VS.NET) Below is the program I have entered. I am getting errors in that print_vertices, print_edges, and print_graph are undefined and are not members of boost. Any help apprechiated! Thanks. /** * adjaMatri.cpp * Nov 7th, 2002 * Boost Graph Library, pg. 237 */ #include <iostream> using std::cout; using std::cin; using std::endl; #include <boost/graph/adjacency_matrix.hpp> using namespace boost; int main() { enum { A, B, C, D, E, F, N }; const char *name = "ABCDEF"; typedef boost::adjacency_matrix<boost::undirectedS> UGraph; UGraph ug(N); add_edge(B, C, ug); add_edge(B, F, ug); add_edge(C, A, ug); add_edge(D, E, ug); add_edge(F, A, ug); cout << "vertex set: "; boost::print_vertices(ug, name); cout << endl; cout << "edge_set: "; boost::print_edges(ug, name); cout << endl; cout << "incident edges: "; boost::print_graph(ug, name); cout << endl; cout << "Press enter to exit..."; cin.get(); return EXIT_SUCCESS; } Jon Agiato JonAgiato(a)nyc.rr.com

2 1

Re: [Boost-Users] stop a thread
by William E. Kempf 03 Mar '03

03 Mar '03

> From: "hlh771 <hlh771(a)yahoo.com.cn>" <hlh771(a)yahoo.com.cn> > > How to stop(or cancel) a thread? Suppose I have a main thread and a > worker thread, the worker thread does something looply,and when the > main thread get a message indicating the process should exit, I want > stop the worker thread,how to do that?I have read other thread > library,their thread class supply a method called stop or cancel > which stops the thread. Their Implementation is:the thread class has > a data member indicating whether the thread should stop,and the > thread function looply check the data member whether the thread > should stop.Generally the data member's type is a bool or Event. > Is it the best way to stop the thread? How the boost to deal with > this? > Thanks in advance. Today you should use a flag and a condition/mutex combination. Direct support for cancellation is being provided in a future release. William E. Kempf wekempf(a)cox.net

3 4

VC7 says 'fatal C1067' compiling multi_array?
by Clift Norris 01 Mar '03

01 Mar '03

Greetings: I'm using VC7 and boost_1_29_0 to compile this code that is using multi_array.hpp. typedef boost::multi_array<double, 4> theta4_t; typedef theta4_t::index index; theta4_t Theta_Trun( boost::extents[10000][2][10][256] ); I'm receiving this error: "fatal error C1067: compiler limit: debug information module size exceeded" Of course, the code compiles fine using the "Release" configuration, but I need the "Debug" one also. Is there a workaround for this, other than the 'make your variables shorter' suggested in the VC7 documentation? Thanks, -Clift

2 1

Why scoped_ptr dost provide custom deallocation?
by Black Ice 17 Feb '03

17 Feb '03

As following manner: template<class D> scoped_ptr(Y * p, D d); Any suggestion are appreciated. -- /*******************/ ×ÔÓÉ£šliberty£©ÎÞ·ÇŸÍÊÇÕâÑùÒ»ÖÖ³ÐÅµ£ºÃ¿žöÈËœ«»áµÃµœÒ»ÖÖ±£ÕÏ£¬±£ÕÏÎÒÃÇ¿ÉÒÔÓë ÈšÍþ¡¢¶àÊý¡¢Á÷Ë×Œ°ÓßÂÛµÄÓ°ÏìÏà¿¹ºâ¡£ /*******************/

4 7

bug report: boost::tokenizer with VC6
by Navi Singh 09 Feb '03

09 Feb '03

The boost release 1.28.0 of the tokenizer library has the following problem: There are 5 examples, namely, simple_example_1.cpp thru simple_example_5.cpp If I change the main() in each of the 5 to to main1() thru main5() and return 0; the vc60 compiler generates an internal compiler error when parsing the file boost\iterator_adapters.hpp on line 869, where it is parsing the following lines: reference operator*() const { return policies().dereference(*this); }

3 2

[BGL] Using BGL for huge graphs
by Erik Arner 03 Feb '03

03 Feb '03

Hi, has anybody tried using BGL for really huge graphs? I mean graphs that are so big that there's no way to store the whole graph in memory. Any ideas on how it should be implemented? My first thought is that it should be fairly straightforward: simply construct classes that model Sequence or RandomAccessContainer for the VertexList parameter etc. The classes store part of the data in memory and read/write data to disc when necessary. Any pitfalls, gotchas or other stuff I should be aware of before embarking on this? Thanks, /Erik

4 9