November 2002 - 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

1 0

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

3 6

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

3 3

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

1 0

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 2

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

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

Building problems with regex on a SuSE 8.1 installation
by beat.schaer＠ruag.com 15 Dec '02

15 Dec '02

Hi I tried to compile boost 1.29.0 on a SuSE 8.1 machine and got the following error: gcc-C++-action libs/regex/build/bin/libboost_regex.so/gcc/release/runtime-link-dynamic/shar ed-linkable-true/cregex.o /home/adtsbuilder/boost_1_29_0/boost/regex/detail/regex_match.hpp: In member function `unsigned int boost::RegEx::GrepFiles(bool (*)(const char*, const boost::RegEx&), const char*, bool, unsigned int)': /home/adtsbuilder/boost_1_29_0/boost/regex/detail/regex_match.hpp:1902: Internal compiler error in expand_call, at calls.c:3049 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://www.gnu.org/software/gcc/bugs.html> for instructions. The used compiler is the one delivered with SuSE 8.1. It is a gcc 3.2. Does anybody knows what the problem might be? Regards Beat

1 1

Regex Match() Abortion
by eydelber 07 Dec '02

07 Dec '02

This probably is annoying me to no end. I have a string that I am matching against a pattern called 'sql'. My program tests 'sql' against 14 possible patterns. The patterns are in an array of strings. EVERYTHING works except for the last pattern. And even then, only when the 2nd sub-expression is longer than a certain length. For example, this works: insert into test (one,two,three) values () Through a lot of testing, I have seen that after the comma delimitted list in the second sub-expression surpasses a certain length, then my program gets aborted at the line if(sqlRegex.Match (sql)) { I am running the latest version of boost regex++, and I am running g++ 2.96 on Linux. I ran gdb, and I seemed to have narrowed down the problem to c_str(), but this is not logical. Here is the part of my program: string checks[] = { /* 0 */ "create table (_ID_) (\\(((\\s*,?\\s*(_ID_) (_TYPES_)( not null)?( unique)?( default ((\\d+(\\.\\d+)?)|(\"[^\"] *\")))?( unique)?\\s*)+)\\))", /* 1 */ "show tables", /* 2 */ "drop table (_ID_)", /* 3 */ "show tdb\\.xml", /* 4 */ "desc( table)? (_ID_)", /* 5 */ "alter table (_ID_) add( column)? ((_ID_) (_TYPES_) ( not null)?( unique)?( default ((\\d+(\\.\\d+)?)|(\"[^\"]*\")))?( unique)?( first| after (_ID_))?)", /* 6 */ "alter table (_ID_) drop( column)? (_ID_)", /* 7 */ "alter table (_ID_) add( column)? \\(((\\s*,?\\s* (_ID_) (_TYPES_)( not null)?( unique)?( default ((\\d+(\\.\\d+)?)| (\"[^\"]*\")))?( unique)?( first| after (_ID_))?\\s*)+)\\)", /* 8 */ "rename table (_ID_) (to|as) (_ID_)", /* 9 */ "alter table (_ID_) alter( column)? (_ID_) (set default ((\\d+(\\.\\d+)?)|(\"[^\"]*\"))|drop default)", /* 10 */ "alter table (_ID_) modify( column)? ((_ID_) (_TYPES_)( not null)?( unique)?( default ((\\d+(\\.\\d+)?)|(\"[^\"] *\")))?( unique)?( first| after (_ID_))?)", /* 11 */ "alter table (_ID_) change( column)? (_ID_) ((_ID_) (_TYPES_)( not null)?( unique)?( default ((\\d+(\\.\\d+)?)|(\"[^\"] *\")))?( unique)?( first| after (_ID_))?)", /* 12 */ "alter table (_ID_) rename( to| as) (_ID_)", /* 13 */ "insert( into)? (_ID_)( \\(((\\s*,?\\s*(_ID_)\\s*)+) \\))? values \\(\\)" }; int checksLength = sizeof checks / sizeof *checks; int i; RegEx sqlRegex; for(i=0;i<checksLength;i++) { sqlRegex.SetExpression(checks[i],true); if(sqlRegex.Match(sql)) { break; } } The interesting thing is that the first string, checks[0] is similar to the insert syntax, and when I use a very long string for the create table syntax, it works perfectly fine. Also, I tried just adding another element to checks, just trying, but that didn't work. Also, I had no such problem for the other 12 cases, it only happens with this last insert case. Any help will be greatly appreciated, I have been stuck on this for days!! Thanks, Kevin

1 0

Lambda questions
by Claus Rasmussen 02 Dec '02

02 Dec '02

Is it possible to discern one-argument lambda expressions from two-argument expressions ? I would like to do something like this: template<typename UNARY_LAMBDA_FUNC> void f(UNARY_LAMBDA_FUNC ulf) { ulf(arg); } template<typename BINARY_LAMBDA_FUNC> void f(BINARY_LAMBDA_FUNC blf) { blf(arg1, arg2); } -Claus

1 0