November 2002 - Boost-users

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

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

4 3

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

5 13

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

2 3

RE: [Boost-Users] Warnings compiling smart_ptr_test.cpp under MSVC++ 6.0
by Randy Bowen 01 Dec '02

01 Dec '02

Visual Studio 6 maintained at 255-character limit on identifiers in its debug information. You'll see this warning with just about any usage of STL containers and non-simple data types. It's basically harmless... annoying, but harmless. Randy Bowen -----Original Message----- From: fejimush [mailto:greitz@tomotherapy.com] Sent: Wednesday, November 13, 2002 10:59 AM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] Warnings compiling smart_ptr_test.cpp under MSVC++ 6.0 I am brand new to boost. I have been able to compile and link smart_ptr_test.cpp. I have also been able to successfully run the test without errors. Can anyone tell me why I am getting numerous warnings? (shown below) One more item, the warning takes me to c:\...\VC98\Include\UTILITY Is this a stl implentation problem? Thanks in advanced. ---------------Build Output----------------------- Compiling... smart_ptr_test.cpp c:\program files\microsoft visual studio\vc98\include\utility(25) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > > ::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\libs\smart_ptr\smart_ptr_test.cpp(198) : see reference to class template instantiation 'std::pair<std::_Tree<boost::shared_ptr<int>,boost::shar ed_ptr<int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_pt r<int> >,std ::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>' being compiled c:\program files\microsoft visual studio\vc98\include\utility(25) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_ array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\libs\smart_ptr\smart_ptr_test.cpp(242) : see reference to class template instantiation 'std::pair<std::_Tree<boost::shared_array<char>,boost::s hared_array<char>,std::set<boost::shared_array<char>,std::less<boost:: shared_array <char> >,std::allocator<boost::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>' being compiled c:\program files\microsoft visual studio\vc98\include\utility(21) : warning C4786: 'std::pair<std::_Tree<boost::shared_ptr<int>,boost::shared_ptr< int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_pt r<int> > >::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>::pair<std::_Tree<boost::shared_ptr<int>,boost::share d_ptr<int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_ptr <int> >,std::allo cator<boost::shared_ptr<int> > >::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information c:\program files\microsoft visual studio\vc98\include\utility(21) : warning C4786: 'std::pair<std::_Tree<boost::shared_array<char>,boost::shared_a rray<char>,std::set<boost::shared_array<char>,std::less<boost::shared_ array<char> >,std::allocator<boos t::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>::pair<std::_Tree<boost::shared_array<char>,boost::sh ared_array<char>,std::set<boost::shared_array<char>,std::less<boos t::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Nil' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Nilrefs' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Nilrefs' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::const_iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Node' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Redbl' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::const_iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Redbl' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::pair<std::_Tree<boost::shared_ptr<int>,boost::shared_ptr< int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std: :less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::pair<std::_Tree<boost::shared_array<char>,boost::shared_a rray<char>,std::set<boost::shared_array<char>,std::less<boost::shared_ array<char> >,std::allocator<boost::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information Linking... GRPostOffice.exe - 0 error(s), 17 warning(s) Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed]

2 1

RE: [Boost-Users] Extended use of BGL File Dependency Example
by Tom Matelich 01 Dec '02

01 Dec '02

> I was excited to get to use the graph library for a > dependency tracking tool > we needed, now I have a feature that I don't know how to do. This is > mapping library/executable dependencies and we have a lot of apps with > common sub-libraries. I'd like to extract a full-rebuild > order for only > certain nodes, i.e. what libs do I need to build for apps A > and B? Since > its a DAG, I thought something about reachability, perhaps? > I'm not too > familiar with graph theory :( Okay, so I solved that one with using a "depends on" relationship rather than "used by", then used a breadth_first_search. Now I have a tougher question, maybe I'll get an answer this time :). I'm trying to make my graphviz representation look nicer and I was wondering if there is an algorithm already for simplifying: -----B\ A--< \ --------C to: A---B---C of course this is happening on a much larger scale. Thanks for any input you might have, Tom pardon the disclaimer... ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

2 1

boost::iterator_adaptor
by Julia Donawald 01 Dec '02

01 Dec '02

Hi, I am trying to write my own iterator - class and using for that the boost::iterator_adaptor. I could find on the webpage several examples of how to connect an existing iterator like std::string::iterator or a simple array as "base-class" for my new iterator, but what can I do if I dont have any base-iterator? In the documentation I found the following sentence: "The Iterator Adaptor library allows you transform an arbitrary ``base'' type into a standard-conforming iterator with the behaviors you choose. Doing so is especially easy if the ``base'' type is itself an iterator." In my situation I dont have any base type which is an iterator, so how should I now create such a base-type? Which are the specifications of such a base-type? Where can I get information on how to create a new base-type? I am trying to write an iterator which reads records from a file or a database and always when I do the it++ the next record is read from the file or database. Thanks a lot in advance Julia

3 2

FW: [Boost-Users] Spirit build problems on msvc
by HartmutKaiser＠t-online.de 30 Nov '02

30 Nov '02

Holger Thiele wrote: > Spirit has been accepted into boost, so i guess this is the > correct group > for posting this question. > Trying to build the simplexml example, i get the following > output from msvc6 > sp5 > (and similar ones from msvc 7): > [sniped error messages] Not all features of spirit are supported for all compilers (yet). Please have a look at http://spirit.sourceforge.net/wiki/index.php?page=Compiler+Table, where you can find a list of supported compilers (which compiler can handle which sample/feature). Regards Hartmut PS: I took the liberty to forward your message to the spirit mailing list. > I downloaded the spirit-only-1.5.1.zip and included it in my > boost directory > tree. > > Any ideas?

2 1

Spirit build problems on msvc
by Holger Thiele 29 Nov '02

29 Nov '02

Spirit has been accepted into boost, so i guess this is the correct group for posting this question. Trying to build the simplexml example, i get the following output from msvc6 sp5 (and similar ones from msvc 7): -------------------Configuration: simplexml - Win32 Debug-------------------- Compiling... ****** {BD Software Proxy CL v2.26} STL Message Decryption is Off ****** simplexml.cpp f:\swd\boost\boost\spirit\core\impl\primitives.ipp(88) : warning C4244: 'return' : conversion from 'int' to 'char', possible loss of data f:\swd\boost\boost\spirit\core\impl\primitives.ipp(89) : warning C4244: 'return' : conversion from 'int' to 'char', possible loss of data f:\swd\boost\boost\spirit\iterator\impl\msvc_ps_helper.hpp(60) : error C2371: 'true_t' : redefinition; different basic types f:\swd\boost\boost\spirit\core\basics.hpp(38) : see declaration of 'true_t' f:\swd\boost\boost\spirit\iterator\impl\msvc_ps_helper.hpp(65) : error C2371: 'false_t' : redefinition; different basic types f:\swd\boost\boost\spirit\core\impl\basics.ipp(23) : see declaration of 'false_t' f:\swd\boost\boost\spirit\iterator\impl\multi_pass_msvc.hpp(402) : fatal error C1903: unable to recover from previous error(s); stopping compilation Error executing cl.exe. I downloaded the spirit-only-1.5.1.zip and included it in my boost directory tree. Any ideas?

1 0

Date_Time library question...
by Luc Bergeron 29 Nov '02

29 Nov '02

Hello everyone, I was wondering, while looking at the source files, why the date_iterator doesn't provide an operator--() ??? I've added this in the "date_iterator.hpp" file : //--------------------------------------------------------- date_itr_base& operator--() { current_ = current_ - get_offset(current_); return *this; } //--------------------------------------------------------- I've rebuilt the library and done this little test : //--------------------------------------------------------- #include <iostream> #include <boost/date_time/gregorian/gregorian.hpp> int main(void) { using namespace boost::gregorian; date today = day_clock::local_day(); day_iterator ditr(today, 1); int nbDaysToIterate = 360; for (;nbDaysToIterate != 0; --ditr, --nbDaysToIterate) { std::cout << to_iso_extended_string(*ditr) << std::endl; } } //--------------------------------------------------------- Everything seems to run OK. I've checked the february month and it has a 28th... Now I wonder why wasn't it included in the release ??? Cheers. Luc Bergeron.

2 1

Using function_traits
by Marshall Clow 29 Nov '02

29 Nov '02

I'm trying to use the function traits to extract the return type of a template parameter, but it's not compiling. Any ideas what's wrong here? -------- begin simplified code ------ template<typename Proc> class CacheValue { typedef boost::function_traits<Proc>::R ReturnType; template<typename Arg1> ReturnType operator () ( Arg1 arg1 ) { /* do something */ } }; CacheValue<unsigned long (*) ( unsigned long )> aValue; -------- end simplified code ------ Gets the error: Error : illegal use of incomplete struct/union/class 'boost::detail::function_traits_helper<unsigned long (**)(unsigned long)>' (point of instantiation: 'main()') (instantiating: 'CacheValue<unsigned long (*)(unsigned long)>') (instantiating: 'boost::function_traits<unsigned long (*)(unsigned long)>') function_traits.hpp line 170 public detail::function_traits_helper<typename add_pointer<Function>::type> Error : 'R' is not a member of class 'boost::function_traits<unsigned long (*)(unsigned long)>' (point of instantiation: 'main()') (instantiating: 'CacheValue<unsigned long (*)(unsigned long)>') HelloWorld.cp line 57 CacheValue<TickGetter> ticks ( GetCount ); Environment: MacOS 10.2.2, CodeWarrior 8.3, boost from CVS this morning. It seems as if the "add_pointer" in function_traits_helper is messing things up. Of course, it's more likely that I am using this wrong ;-) Thanks in advance! -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> Hey! Who messed with my anti-paranoia shot?

2 1

boost::iterator_adaptor
by Julia Donawald 29 Nov '02

29 Nov '02

Hi, I am trying to write my own iterator - class and using for that the boost::iterator_adaptor. I could find on the webpage several examples of how to connect an existing iterator like std::string::iterator or a simple array as "base-class" for my new iterator, but what can I do if I dont have any base-iterator? In the documentation I found the following sentence: "The Iterator Adaptor library allows you transform an arbitrary ``base'' type into a standard-conforming iterator with the behaviors you choose. Doing so is especially easy if the ``base'' type is itself an iterator." In my situation I dont have any base type which is an iterator ( as base type I have a simple int ), so how should I now create such a base-type? Which are the specifications of such a base-type? Where can I get information on how to create a new base-type? I am trying to write an iterator which reads records from a file or a database and always when I do the it++ the next record is read from the file or database. Bye, Julia

1 0

Re: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Stephen Crowley 28 Nov '02

28 Nov '02

On Thu, Nov 28, 2002 at 09:12:53AM -0500, Toon Knapen wrote: > On Wednesday 27 November 2002 20:46, Stephen Crowley wrote: > > What do you mean by "just use it as" ? > > > > For example.. I have a matrix<double> m(5,5); > > > > In some code I actually need to use it as a 5x5 matrix.. but other parts > > must reference it as a vector (to pass to another library). > > OK, So as to get to the bottom of this. Do you really want to perform vector > operations on a vector that consists of a concatenation of all rows (or > columns) of the matrix do you want to get access to the storage to pass your > information to another library. > > The latter case is dealt with in the boost-sandbox/boost/numeric/bindings. > There we've spend effort to be able to extract the begin- and end-pointer > (not iterator) from any vector or matrix. (In the bindings it's used to pass > these pointers to e.g. BLAS) > > In the former case, could you enlighten me what kind of numeric operations > you're dealing with ? The matrix I am working with is a set of weights for a neural net. I am using a kalman filtering library (http://www.acfr.usyd.edu.au/technology/bayesianfilter/Bayes++.htm) that treats the weights as a vector. So, I'm not really sure how to answer your question. I guess I would say that I need to access a vector as a concatenation of the rows or columns of the matirx (for this purpose it does not matter as long as it is consistent). However, copying undering data() member is working for now, although not as quickly as I would like. -- Stephen

2 1

RE: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Scott Sinclair 28 Nov '02

28 Nov '02

Hi Stephen Yes, just use a (1, n) or (n, 1) matrix as appropriate and do matrix operations instead of vector ops. The results will be correct as long as you make sure you have a correctly dimensioned matrix in place of your vector (i.e one that matches your vectors size and orientation). After all a matrix is just a collection of vectors ;-) cheers, Scott On 27/11/2002 05:10, Stephen Crowley wrote > It is possible for a vector and a matrix to share the same storage, as > long as the dimensions agree? > > Some of the algorithms I am implementing require some objects > to be treated > as an arbitrarily sized matrix, and sometimes as a vector, > and it would be > convient to have a matrix and a vector share the same memory. > > -- > Stephen The contents of this email may be confidential. Unauthorised use is prohibited. Umgeni Water does not accept liability for any statements and opinions which are the sender's own view and not expressly made on its behalf.

4 4

RE: [Boost-Users] MSVC++, bind and namespaces
by Antoine Boivin Filion 28 Nov '02

28 Nov '02

Hi, FYI, the code below compiles and runs OK on MSVC++7... so you might just be right! Regards, Antoine -----Original Message----- From: Andre Hentz [mailto:ahentz@cariden.com] Sent: November 28, 2002 09:42 To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] MSVC++, bind and namespaces I've just encountered this problem and it looks like a MS bug. Not sure it deserves a Boost workaround but I thought it would be nice to let you know (in case you don't already). Here's the code: #include <boost/bind.hpp> namespace A{ struct c{ void setName(const char*) {} }; } namespace B{ struct c{ void setName(const char*) {} }; } using namespace B; using namespace A; int main() { boost::bind(&A::c::setName, _1, _2); return 0; } It looks legal to me but I'm no expert. GCC compiles with no warnings but MSVC++ 6sp5 gives the error below. boost/bind/mem_fn_vw.hpp(29) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void ,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,cla ss boost::arg<2> > >' being compiled boost/bind/mem_fn_vw.hpp(31) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled Best, Andre Hentz Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=237459.2675695.4055211.2225243/D=egroupweb/S=17050067 88:HM/A=1267611/R=0/*http://ad.doubleclick.net/jump/N2524.Yahoo/B1071650;sz= 300x250;ord=1038499880908608?> <http://us.adserver.yahoo.com/l?M=237459.2675695.4055211.2225243/D=egroupmai l/S=:HM/A=1267611/rand=601430356> Info: < http://www.boost.org <http://www.boost.org> > Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed]

1 0

Re: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Toon Knapen 28 Nov '02

28 Nov '02

On Wednesday 27 November 2002 20:46, Stephen Crowley wrote: > What do you mean by "just use it as" ? > > For example.. I have a matrix<double> m(5,5); > > In some code I actually need to use it as a 5x5 matrix.. but other parts > must reference it as a vector (to pass to another library). OK, So as to get to the bottom of this. Do you really want to perform vector operations on a vector that consists of a concatenation of all rows (or columns) of the matrix do you want to get access to the storage to pass your information to another library. The latter case is dealt with in the boost-sandbox/boost/numeric/bindings. There we've spend effort to be able to extract the begin- and end-pointer (not iterator) from any vector or matrix. (In the bindings it's used to pass these pointers to e.g. BLAS) In the former case, could you enlighten me what kind of numeric operations you're dealing with ? toon -------------------------------------------------------

1 0

MSVC++, bind and namespaces
by Andre Hentz 28 Nov '02

28 Nov '02

I've just encountered this problem and it looks like a MS bug. Not sure it deserves a Boost workaround but I thought it would be nice to let you know (in case you don't already). Here's the code: #include <boost/bind.hpp> namespace A{ struct c{ void setName(const char*) {} }; } namespace B{ struct c{ void setName(const char*) {} }; } using namespace B; using namespace A; int main() { boost::bind(&A::c::setName, _1, _2); return 0; } It looks legal to me but I'm no expert. GCC compiles with no warnings but MSVC++ 6sp5 gives the error below. boost/bind/mem_fn_vw.hpp(29) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void ,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,cla ss boost::arg<2> > >' being compiled boost/bind/mem_fn_vw.hpp(31) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled Best, Andre Hentz

1 0

Re: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Toon Knapen 28 Nov '02

28 Nov '02

On Wednesday 27 November 2002 20:46, Stephen Crowley wrote: > What do you mean by "just use it as" ? > > For example.. I have a matrix<double> m(5,5); > > In some code I actually need to use it as a 5x5 matrix.. but other parts > must reference it as a vector (to pass to another library). OK, So as to get to the bottom of this. Do you really want to perform vector operations on a vector that consists of a concatenation of all rows (or columns) of the matrix do you want to get access to the storage to pass your information to another library. The latter case is dealt with in the boost-sandbox/boost/numeric/bindings. There we've spend effort to be able to extract the begin- and end-pointer (not iterator) from any vector or matrix. (In the bindings it's used to pass these pointers to e.g. BLAS) In the former case, could you enlighten me what kind of numeric operations you're dealing with ? toon

1 0

RE: [Boost-Users] Is intrusive_ptr the thing to use?
by Hickman, Greg 28 Nov '02

28 Nov '02

From: Peter Dimov [mailto:pdimov@mmltd.net] > From: "Hickman, Greg" <greg.hickman(a)lmco.com> > > > From: Peter Dimov [mailto:pdimov@mmltd.net] > > > If 'f' is virtual, have the object store a weak_ptr to itself: > > > > > > class X > > > { > > > private: > > > > > > weak_ptr<X> weak_this; > > > > > > X(); > > > X(X const &); > > > X& operator=(X const &); > > > > > > public: > > > > > > static shared_ptr<X> create() > > > { > > > shared_ptr<X> px(new X); > > > px->weak_this = px; > > > return px; > > > } > > > > I must be missing something here, because it appears as though you > > can't derive a Y from X and still initialize X::weak_this. > > You could simply make X::weak_this and X::X() protected... > although if you follow the design rule that says that > non-leaf classes should be abstract (and if possible contain > no data) this shouldn't be necessary, as X as pictured above > would be a leaf. Its seems the leaf itself must implement the factory method/weak_this idiom. This initially didn't seem like a good idea in our case since clients write the leaves - we only provide X. But on second thought, perhaps two alternatives are (1) provide a helper template for clients to use when deriving from X to automatically declare the static create()/weak_this pair, or (2) use an intrusive reference counting approach for X. If an intrusive approach ultimately works better for us, what should I do as a boost 1.29.0 user: use counted_base/shared_from_this, or intrusive_ptr (which I admittedly haven't even looked at)? Any suggestions you have are more than welcome. -Greg

2 1