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

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

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 > > > Apologies wrt saying code snippet ws not present - have got it now, but comments on recursion still apply. James

1 0

Re: [Boost-users] Boost-users Digest, Vol 815, Issue 1
by Scott 13 Feb '06

13 Feb '06

> Robert Vinluan wrote: > > >Right now, in order to compile and link to the iostreams > library with > >zlib/bzip2 support, I have to include the .cpp files in my > project (as > >mentioned in the boost docs). I'm not too fond of this idea > as I want > >to keep 3rd-party code outside of my project build. > > > >Perhaps I have missed something in the docs, but is there > another way to > >link with the iostreams library without including the .cpp files? > > > > > Huh ? I don't understand... forgive me for my ignorance, since I'm > probably missing your point, but I just, for example, #include > <boost/iostreams/stream.hpp> and it just works, without > linking to any > special lib... what exactly are your needs that require > linking against > a lib? Or is it that bzip2/zlib support needs linking with a boost > library ? > > Regards, > > Leon Mergen > http://www.solatis.com/ I have the exact same problem Robert describes. I have compiled iostreams on Windows XP with zlib support (using my downloaded copy of zlib) and I added the various ZLIB parameters to bjam for compiling iostreams with zlib support. However, anytime I try to compile/link a program using iostreams with zlib, I get the same error message. (It's looking for a non-existent zlib library to link to, instead of the zlib library I compiled boost with).

2 1

Re: [Boost-users] progress_timer writes two newlines?
by Daniel Lidström 13 Feb '06

13 Feb '06

Beman Dawes scribbled: > Daniel Lidström scribbled: > > > > Hello! > > > > > > Why does boost::progress_timer write two newlines on destruction? > > > One would suffice for me. > > > Another thing about progress_timer: Why is the only option to > > output seconds? I'd like to be able to use my own formatter, so > > that I can have the output in HH:MM:SS.mmm for example: > > > boost::progress_timer timer(cout, hhmmssmmm_formatter()); > > Care to submit a patch? Here is a patch. With it, it is possible to use progress_timer as such: #include <boost/progress.hpp> #include <iomanip> using namespace std; // Time: S.mmm struct my_formatter { string operator()(double s) const { stringstream stream; stream << "Time: " << fixed << setprecision(3) << s << " s\n" ; return stream.str(); } }; // formats as HH:MM:SS.mmm string form(double s) { stringstream stream; int h = static_cast<int>(s/3600); int min = static_cast<int>((s-h*3600))/60; double sec = s - h*3600 - min*60; stream << setfill('0') << setw(2) << h; stream << ':'; stream << setfill('0') << setw(2) << min; stream << ':'; stream << fixed << setprecision(3) << setfill('0') << setw(6) << sec; stream << '\n'; return stream.str(); } int main() { { boost::progress_timer t(cout, my_formatter()); } { boost::progress_timer t(cout, form); } } Hälsningar, Daniel

1 0

[filestreams] Does native not work correctly in Windows?
by Paul Giaccone 13 Feb '06

13 Feb '06

The following line in my Windows program: boost::filesystem::path my_path(my_filename, boost::filesystem::native); converts backslashes in my_filename to forward slashes, which means than when I use boost::filesystem::exists on the result, the file is reported as not existing even though it does. I notice the comments in boost::filesystem::m_path_append(), which is called by the constructor of boost::filesystem::path, say that this is what the function does, but this contradicts the documentation. http://boost.org/libs/filesystem/doc/portability_guide.htm says, of native: Side effect: Syntax for path constructor /src/ string is implementation defined according to the path syntax rules for the operating system. Use: In path constructors, when the source is operator input or other sources which are formatted according to operating system rules. I understand this to mean that boost::filesystem::native converts the file into the format required by the OS. I certainly would not expect it to make the format wrong if it is already correct. Is there something I've overlooked here, or is this a bug, or is the documentation wrong (or just misleading)? I'm puzzled. Paul

2 3

Re: [Boost-users] Getting started with Boost: what did you need to know?
by Toby Smith 13 Feb '06

13 Feb '06

> I'm giving a talk about getting started with Boost > (https://www.cmpevents.com/SDw6/a.asp?option=G&V=3&id=271893) and I > thought it would be a good idea to solicit input from those who have > recently gone through the process. What do you wish someone had > explained to you? With what did you need hand-holding? Based on this > feedback I expect to make some improvements to the Boost website, > also. Any information you can give me will be much appreciated. Personally, my biggest problem with getting started with boost was realizing that I should get started in the first place. I'd had friends & coworkers mention boost, but to the new visitor, the website (as clean and readable as it is) doesn't do a good sell job for the product. It starts off well, saying that there's some sort of libraries to be had in here somewhere. But the first eight links the reader encounters have nothing to do with explaining why it is you might want to use these libraries. The ninth link, "Background information page," finally gives us a teaser, claiming our productivity will increase, but we still don't know why. Only the intrepid explorer who delves into the tiny "Documentation" link on the main page will be rewarded with a catalog of functionality. In short, I think the main page, the page that should be grabbing the casual surfer's attention, should at least highlight some of the functionality the consumer can expect from boost (cross-platform serialization, anyone? How about containers done right, or a well- designed thread package?), instead of devoting real estate and reader attention to links to random unix distros. Cheers, tob

4 3

[regex] - bk_parens and bk_braces missing from 1.33.x
by Keith MacDonald 13 Feb '06

13 Feb '06

Resending due to no response since 4th Feb: It states in history.html for regex 1.33.0 that "some of the more esoteric options have now been removed, so there is the possibility that existing code may fail to compile: however equivalent functionality should still be available". I suppose bk_parens and bk_braces could be considered esoteric, but I cannot find any equivalent functionality. Is that intentional? Thanks, Keith MacDonald

4 7

[ptr_container] ptr_map predicates
by Bill Buklis 13 Feb '06

13 Feb '06

How would I accomplish the following using ptr_map instead of std::map? typedef std::map< std::string, int* > stlmap; bool predicate( stlmap::value_type& mapitem ) { // return true if key value has at least 4 characters return( mapitem.first.size() > 3 ); } void sample( stlmap& themap ) { std::find_if( themap.begin(), themap.end(), predicate ); } The predicate for std::find_if requires *iterator for the parameter. However, with ptr_map *iterator returns a reference to the element value instead of the key/value pair. Normally this is fine (in general code I like this feature), but in this case I need access to the key in the predicate. How do I get at it? ptr_map version of above: typedef boost::ptr_map< std::string, int > bpmap; bool predicate( ??? ) { ??? } void sample( bpmap& themap ) { std::find_if( ??? ); }

3 12

boost::xtime quesion
by Tim Blechmann 13 Feb '06

13 Feb '06

hi all, maybe it's just a stupid newbie question, but i'm a bit confused by boosts timed locks ... they're using a time, that's based on the timeval struct on posix systems ... what's the difference between this and ptime from the date_time library? ptime can be used with a clock with microsecond granularity, too ... in any case, how do i convert times from ptime to xtime? thanks in advance ... tim -- mailto:TimBlechmann@gmx.de ICQ: 96771783 http://www.mokabar.tk Every word is like an unnecessary stain on silence and nothingness Samuel Beckett

1 0

[serialization] I am unable to link the serialization demo.cpp
by Michael Shapiro 12 Feb '06

12 Feb '06

I would like to use the boost serialization library to do checkpointing for a simulation which runs for one or more weeks. However, I have not been able to get past the "hello world" stage. I have tried to do this on both a linux machine running gcc 3.4.5 and Mac OS X using gcc 3.3. In both cases, my attempts to compile the demo.cpp program fail with long lists of undefined symbols. I will give the specifics for the Mac because this is where it will ultimately be used and because the instalation seems more standard there. The demo.cpp I am trying to compile is the one available on http://www.boost.org/libs/serialization/doc/tutorial.html The boost include files are installed in /usr/local/boost/gcc/ The libraries are installed in /usr/local/lib/ For example, here I find libboost_serialization.a and libboost_serialization.dylib. I am attempting to compile as follows: gcc \ -L/usr/local/lib/ \ -I/usr/local/include/ \ -lboost_serialization \ demo.cpp I have tried various variations on this including adding all the .a files to the list of libraries to link, and adding stdc++. I get error messages of which the following are typical ld: Undefined symbols: __ZNKSs5c_strEv __ZNKSt9basic_iosIcSt11char_traitsIcEE4failEv __ZNSaIcEC1Ev __ZNSaIcED1Ev followed by more of the same. I have no doubt there is something very simple I am failing to do, very likely something so simple no one knowledgeable would think to put it in the documentation. So I will probably feel very dumb when someone educates me about this, but I will also feel very relieved. Thanks in advance for your help.

2 1

[bjam] Boost Jam 3.1.12 release.
by Rene Rivera 12 Feb '06

12 Feb '06

Like the subject says, Boost Jam 3.1.12 is available on the SourceForge release system: <https://sourceforge.net/project/showfiles.php?group_id=7586&package_id=7294…>. This should be the bjam used for the next Boost release. Enjoy. -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

1 0

Creating a copy of a subset of a graph
by Adam Teasdale Hartshorne 12 Feb '06

12 Feb '06

Hi All, I want to form a new graph B from an existing graph A, copying out only edges(and their all their vertices) given that an edge contains at least one of the vertices in a given list (i.e. I am going to end up with a graph with more than just the vertices in the list and their adjacency information. With some extra vertices, where an edge exists between them and vertices in the defined list.) I know I should be using filter_graph and copy_graph, but not 100% sure how. Any help/code snippets would be much appreciated, I am new to boost graph library so please make any explanations as simple as possible, Adam

1 0

Template metaprogramming for compile-time initialization of complex types?
by Arno Schödl 12 Feb '06

12 Feb '06

Hello, here is my problem: I have a complex data type, like a std::vector< std::string > and need some global constant values of this type. The type is also used non-constant throughout the program, so I do not want to use dumb types, but rather STL containers. In an ideal world, initialization of these constants would not happen at runtime, but at compile time, essentially generating a constant memory image of this type via meta-programming. The exact memory layout is compiler-dependent, of course, but the difficult, but portable part would be the programmer's interface, in particular for nested types and user-defined ones. Why do I want this? Start-up time is a big problem for larger apps, and CRT init code filling std::vectors with stuff causes lots of page faults slowing down the start. This is particularly annoying if the constant never happens to be used in that particular run. And of course it is inelegant to keep data around twice, once in dumb constant arrays, and once on the heap after the containers have been filled from these arrays. Why can't I use POD arrays for constant data instead of STL containers? Because the same data type is often used both const (for default values, to list possible choices in menus, etc.) and non-const (for user-defined values). Unifying the access would be awfully convenient. I have implemented this approach with the boost preprocessor library for MSVC 8 std::vector< integral type >, which works, but is nowhere general enough. Has anyone else made attempts in this direction? Arno

1 0

Boost, STLport, and Visual Studio 2005
by Robert S. Grimes 11 Feb '06

11 Feb '06

Hi all, Trying to get Boost 1.33.1 and STLport 5.0.1 to co-exist under Micro$oft Visual Studio 2005. I got them both to apparently compile and install okay, but when I attempt a Boost::Serialization test, I run into a problem: LINK : fatal error LNK1104: cannot open file 'libboost_serialization-vc80-mt-gdp-1_33_1.lib' >From the docs, I indeed find that the "-gdp-" library is non-existent; specifically, the 'p' for STLport is missing. How do I build the STLport runtimes? Thanks! -RSG

2 1

Minor spurious warning message -- Very Trivial
by Robert S. Grimes 11 Feb '06

11 Feb '06

Hi all, Using Boost 1.33.1 serialization library with Micro$oft Visual Studio 2005, I get two minor warnings while compiling the demo_xml.cpp program. They are in boost/serialization/collections_save_imp.hpp. Lines 36 and 37 in the function template save_collection are the culprit, resulting in warnings of the form: warning C4267: 'initializing' : conversion from 'size_t' to 'unsigned int', possible loss of data These are the problem lines: unsigned int count = s.size(); ar << make_nvp("count", const_cast<const unsigned int &>(count)); Changing the "unsigned int" to "size_t" fixes the warnings, like this: size_t count = s.size(); ar << make_nvp("count", const_cast<const size_t &>(count)); Trivial problem, I admit, but warnings are warnings... Cheers, -RSG

2 1

Boost thread library wrapper
by boostguy＠kapiladhanvi.com 10 Feb '06

10 Feb '06

Hi all This mail is in continuation to the earlier mail I had written asking for help in writting a thread wrapper for boost.threads. We already have an existing interface to which we would like our wrapper for boost.threads to adhere to. We have a runnable class which is inherited by the applications wanting to create threads and they override the run method. This is how our application currently creates threads. Thanks Peter for your earlier mail explaining on how to use boost::shared_ptr and boost::bind Your code for a Runnable interface > struct Runnable > { > virtual ~Runnable() {} > virtual void run() = 0; > }; We have a class Runnable with nearly the same code as above. To make a dummy implementation, I made the run methd a normal function. Nothing derives from it.. run is what I want to execute in a thread. > > void execute_in_thread( boost::shared_ptr<Runnable> pr ) > { > boost::thread th( boost::bind( &Runnable::run, pr ) ); > } I am creating a thread in MyThread class using the following code. --- MyThread.h ---- typedef boost::shared_ptr<Runnable> myPtr; class MyThread { public: MyThread( ); ~MyThread( ); private: myPtr p1; } --- MyThread.cpp ---- MyThread::MyThread( ) : p1( new Runnable() ) { cout << "MyThread::MyThread( ) constructor " << endl; boost::thread th( boost::bind( &Runnable::run, p1) ); } ---- Runnable.cpp --- // this is the only function in Runnable.h void Runnable::run() { cout << "Runnable::run() YUPPIE! "<< endl; } ------ end ----------- The code compiles, but nothing happens.. I am missing something here ?? Is there something else I need to do to start my thread?? Thanks Dhanvi

4 6

newbie question
by Lawrence Lim 10 Feb '06

10 Feb '06

Hello, I'm trying to compile the following: #include <boost/type_traits/is_integral> int main() { return 0; } I'm getting a long_long_type is undeclared in namespace boost error. I worked around it by: namespace boost { typedef long long long_long_type; typedef unsigned long long ulong_long_type; } #include <boost/type_traits/is_integral> int main() { return 0; } Is there a better way to fix this issue? My compiler is gcc3.2.3 in Red Hat Linux. Thanks, Lawrence

1 0

[Unit Test Framework]
by Evan Carew 10 Feb '06

10 Feb '06

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm trying out Unit Test for the first time & decided to try out the first example listed in the getting started docs. It compiled fine on my g++ v4.0 boost v1_32 setup, but I get the following output which looks wrong to me: [root@r3-mobile src]# ./test_watchdog Running 1 test case... /root/projects/IBS/test_watchdog/src/test_watchdog.cpp(38): error in "free_test_function": test 2 == 1 failed Exception in "free_test_function": signal: memory access violation /usr/src/build/570409-i386/BUILD/boost_1_32_0/libs/test/build/../src/unit_test_suite.cpp(150): fatal error in "free_test_function": Testing aborted *** 1 failure detected (1 failure expected) in test suite "Unit test example 1" Is there an easily explained (and implemented) way to get the output for this test app to work? Thanks, Evan Carew -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFD7NkKpxCQXwV2bJARAmHfAJ40gh9/WXZe+sXCNgCZzPfea4nciQCgojG1 9L8mgvqBJxLAxE9V1UAy2tw= =KfmW -----END PGP SIGNATURE-----

2 1

Re: [Boost-users] [program_options] Bug in program_options with vc-8_0 build target when displaying the help descriptions
by boost＠nogga.de 10 Feb '06

10 Feb '06

Hi Will, thanks for the answer. I still ask myself what is the correct way of handling these situations with the new standard library. I had a similar issue in my own software and I didn't liked the solution to fall back to manually track the array bounds. The only way to write this line safe would be: > if (par_end - line_begin < line_length - indent) in order to compute a distance between the two involved iterators. But is this really better? Is the old line really a safety problem? Or is this type of problem the penalty one have to pay for the enhanced security in other areas? Best regards Dirk Will Bryant schrieb: > Hmm, Vladimir Prius doesn't seem to be responding on the list at the > moment, but FWIW this is a known bug - see my November 2005 posts > about it in the mailing list archive. Vladimir was working on a fix, > but the last version he sent still had the problems... > > Will > > > boost(a)nogga.de wrote: > > Hello, > > > > there is a bug in the help output generated from > > > > void format_paragraph(std::ostream& os, std::string par, unsigned > > first_column_width, unsigned line_length) > > > > function. The error message is cryptic and something like that: > > > > _Myptr + _Off <= (((_Mystring *)this->_Mycont)->_Myptr() + > > ((_Mystring *)this->_Mycont)->_Mysize) && _Myptr + _Off >= > > ((_Mystring *)this->_Mycont)->_Myptr(): > > > > The point is that the new vc8.0 compiler (or better the vs2005 > > standard library) performs a lot of additional iterator checking. > > In the function format_paragraph the "line_begin" iterator is > > checked, whether there is one more line to indent in the help > > output or whether this is the last line. During this process, the > > "line_begin" iterator is incremented behind the end of the current > > string "par.end()" and this will trigger the > > _SCL_SECURE_VALIDATE_RANGE warning from the new library. > > > > if (line_begin + (line_length - indent) > par_end) { line_end = > > par_end; } > > > > You should be able to trigger this behavior with every application > > when printing the help text for an option that is longer than one > > line. > > > > This new iterator checking has it's pros and cons. While it is good > > to find any sort of error, how would you safely write the case > > above without reverting to index like operations? > > > > Best regards Dirk _______________________________________________ > > Boost-users mailing list Boost-users(a)lists.boost.org > > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > > >

1 0

Re: [Boost-users] pd darwin Symbol not found
by RIVASSEAU Jean Noel 10 Feb '06

10 Feb '06

Do you develop in XCode ? I remember that while developing on XCode there is an option that does fast linking (it is called Zero Link) and if you check that, it does not really link your application at link time but only at run time. So I think this is in fact a linking problem, disable the Zero Link option under XCode and your code will probably fail to link. As to why it does not link, I do not know, which library (boost) are you trying to link to ? Jean-Noël _____ De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Locatelli Jérôme Envoyé : jeudi 9 février 2006 14:14 À : boost-users(a)lists.boost.org Objet : [Boost-users] pd darwin Symbol not found I'am writing a application on MacOS 10.4.4 using darwin 8 with gcc 4, I compile and link my application without problem but when I run my application , I've got the error bellow. Has anybody got an idear?? Thanks. dyld: lazy symbol binding failed: Symbol not found: __ZN5boost6detail3tss4initEPNS_9function1IvPvSaINS_13function_baseEEEE Referenced from: /Users/locatelli/Projets/ics/IcsServer/obj.ics/../lib/libIcsServerCommandSystem.0 Expected in: flat namespace dyld: Symbol not found: __ZN5boost6detail3tss4initEPNS_9function1IvPvSaINS_13function_baseEEEE Referenced from: /Users/locatelli/Projets/ics/IcsServer/obj.ics/../lib/libIcsServerCommandSystem.0 Expected in: flat namespace Trace/BPT trap --------------------------------------------------- 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 ---------------------------------------------------

3 2

bcp: towards a library dependency list
by John Maddock 10 Feb '06

10 Feb '06

I've just committed some changes to bcp that give it a shortened list option: bcp --list-short truncates the list so you just see directory names where appropriate, for example: bcp --list-short shared_ptr.hpp Gives the dependency list: boost/assert.hpp boost/checked_delete.hpp boost/config.hpp boost/config boost/current_function.hpp boost/detail boost/mpl boost/non_type.hpp boost/preprocessor boost/shared_ptr.hpp boost/static_assert.hpp boost/throw_exception.hpp boost/type.hpp boost/type_traits boost/version.hpp which is reasonably nice and compact :-) Now, here's the question: what did the folks who were asking for this functionality actually want to use the information for? I should stress that it's overkill for extracting subsets of Boost, because many libraries will depend on just one or two files inside boost/mpl or boost/preprocessor, so using the list for that purpose will result in an even "thicker" dependency than copying with bcp already produces. It's possible to contract the above list even further: for example by contracting to library names where possible, so for example contracting all of: boost/regex.hpp boost/regex libs/regex to just "regex" However there would still be a lot of Boost headers that can't automatically be assigned to any library name, so it's not clear to me how much use this would be? If folks can give me an idea of what they were looking to use a dependency list for it'll help me decide whether to stop here or to continue trying to contract the list further. John.

1 0

Unable to figure out how to get zlib support in iostreams on windows
by cheesy4poofs 10 Feb '06

10 Feb '06

Hi, I've posted this on the boost build forums, but never got a response, so I'm hoping someone in this group can help me. I've spent several days banging my head with iostream zlib support on windows. For the life of me, I cannot figure out how to get this to compile. This is on a windows XP machine with Microsoft VS 2003. I've installed the zlib source at C:\dev\zlib and set the appropriate command line arguments (I believe anyway) to point to it. However, it continues to give me an error of "unknown dependent target <@boost!libs!iostreams!build>libboost_zlib.lib" If I remove the zlib command line arguments, the boost library builds fine. Can anyone please explain what I'm doing wrong? I'm sure it is something simple, but I cannot figure it out. I looked at the jam file regarding this and it seems to indicate that it will compile zlib automatically. But apparently that isn't happening. The complete output from the command window follows. Thanks in advance for any help! Scott bjam "-sTOOLS=vc-7_1" "-sNO_COMPRESSION=0" "-sNO_ZLIB=0" "-sZLIB_SOURCE=C:\Dev\zlib" "-sZLIB_INCLUDE=C:\Dev\zlib" stage ****************************************************** Building Boost.Iostreams with bzip2 support disabled. To enable bzip2, consult the Boost.Iostreams documentation ****************************************************** --------------------------------------------------------------------- *** If you don't need Boost.Python, you can ignore this section *** *** pass --without-python to suppress this message in the future *** skipping Boost.Python library build due to missing or incorrect configuration couldn't find Python.h in "c:/Python24/include" You can configure the location of your python installation by setting: PYTHON_VERSION - The 2-part python Major.Minor version number (e.g. "2.2", NOT "2.2.1") - currently "2.4" PYTHON_ROOT - automatically configured from PYTHON_VERSION if not otherwise set ; currently "c:/Python24" The following are automatically configured from PYTHON_ROOT if not otherwise set: PYTHON_LIB_PATH - path to Python library object; currently "c:/Python24/libs" --------------------------------------------------------------------- Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (and if you don't know what ICU is then you probably don't need it). unknown dependent target <@boost!libs!iostreams!build>libboost_zlib.lib

3 2

Re: [Boost-users] [Serialization]Working without RTTI
by RIVASSEAU Jean Noel 10 Feb '06

10 Feb '06

I already pointed this out to Robert, the correct use is on the cpp file, not the documentation. I am also using no RTTI, for me it works fine except that I have to do all sort of strange things to get the thing to link correctly without multiple definitions. Jean-Noël -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Alexandre Gacon Envoyé : vendredi 10 février 2006 10:11 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Serialization]Working without RTTI I looked at the test_no_rtti.cpp and I have a question: In the cpp file, the macro BOOST_CLASS_TYPE_INFO is used like this: BOOST_CLASS_TYPE_INFO( derived_base, extended_type_info_no_rtti<derived_base> ) But in the documentation, the macro is used like that: BOOST_CLASS_TYPE_INFO( derived_base, extended_type_info_no_rtti<base_class> ) What is the good use of the macro ? Thank you Alexandre Gacon -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Robert Ramey Envoyé : jeudi 9 février 2006 16:17 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Serialization]Working without RTTI I've included that facility and a test which demonstrates it. test_no_rtti demonstrates how it can be used with a type_info facility which uses the string associated with the type via BOOST_CLASS_EXPORT. Other than that it hasn't been really tested/explored extensively. After doing all this, it occurred to me that it RTTI would still be required to serialize the std::vector etc. This could be worked around by some combination of the above a) implemented BOOST_CLASS_EXPORT for those serializations in the library b) making a custom extended_type_info class which uses some other yet to be determined method. c) avoiding serialization of types not exported via pointers. That is, only types serialized via pointers required RTTI. (at least that's the intention - better test this!!) Robert Ramey Alexandre Gacon wrote: > Hi, > > I would like to use the serialization library inside one of my project > which do not use the RTTI. I produce a first version using > boost::serialization::extended_type_info to produce the key associated > to the class. > > Is it possible to use my own keys instead of the extended_type_info > class to serialize my classes ? > > Thank you, > > Alexandre Gacon > Project Manager _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Bug report : incorrect documentation for biconnected_components
by Jean-Noël Monette 10 Feb '06

10 Feb '06

Hello, The documentation given in this page : http://www.boost.org/libs/graph/doc/biconnected_components.html is incompleet. The function signatures don't match the functions found in the file biconnected_components.hpp. The VertexIndexMap index_map parameter was omitted from the declarations at the beginning of the doc page. It should be added for users of listS. Jean-Noël Monette

1 0

[Serialization]Working without RTTI
by Alexandre Gacon 10 Feb '06

10 Feb '06

Hi, I would like to use the serialization library inside one of my project which do not use the RTTI. I produce a first version using boost::serialization::extended_type_info to produce the key associated to the class. Is it possible to use my own keys instead of the extended_type_info class to serialize my classes ? Thank you, Alexandre Gacon Project Manager

2 2

Re: [Boost-users] progress_timer writes two newlines?
by Daniel Lidström 10 Feb '06

10 Feb '06

Daniel Lidström scribbled: > Hello! > > Why does boost::progress_timer write two newlines on destruction? One > would suffice for me. Another thing about progress_timer: Why is the only option to output seconds? I'd like to be able to use my own formatter, so that I can have the output in HH:MM:SS.mmm for example: boost::progress_timer timer(cout, hhmmssmmm_formatter()); Hälsningar, Daniel

2 1

multiple implicit constructors (MPL?)
by Cory Nelson 10 Feb '06

10 Feb '06

Hello, I have a class, large_integer<BaseT>. I build 256bit integers by doing: typedef large_integer<unsigned long long> uint128; typedef large_integer<uint128> uint256; Unfortunately C++ only seems to allow one implicit conversion, so I'm unable to do uint256 a = 0, and have to do uint256 a = uint128(0); instead. I'm able to get around one of these by having a constructor which takes the base type, but that only gets me one free conversion, meaning a uint512 has the same issue. Is there a way around this (I'm guessing MPL would be my best bet?)? -- Cory Nelson http://www.int64.org

1 0

[thread] Mysterious deadlock
by David Greene 10 Feb '06

10 Feb '06

I have this simple testcase (below) which runs into deadlock (full run trace after the testcase): ... [Producer] Producer generated data 28 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 29 [Producer] push(): about to lock [Producer] push(): locked [Consumer] Signaled for data [Consumer] empty(): about to lock <<DEADLOCK>> The call to empty() by Consumer is after the first time it is woken up from full_condition. So the deadlock occurs right when the consumer first attempts to grab some data. Is there something I'm not understanding about how mutexes and locks work in Boost.Thread? I feel like I'm missing something obvious. This comes out of a larger and more complicated program but I was able to isolate the mysterious (to me) behavior I'm seeing. I used to use LOG for debugging but I thought there might be some interaction between the queue mutex locks and the print mutex locks so I switched to the non-locking LOG_NOLCK but observed no change in behavior. Any help is greatly appreciated. -Dave --------------------------------- Testcase #include <iostream> #include <queue> #include <map> #include <string> #include <boost/thread.hpp> #include <boost/thread/recursive_mutex.hpp> #include <boost/thread/condition.hpp> #include <boost/bind.hpp> #include <pthread.h> typedef boost::recursive_mutex mutex_type; typedef mutex_type::scoped_lock lock_type; // Atomic prints mutex_type print_mutex; mutex_type print_map_mutex; // For print/debug purposes typedef std::map<pthread_t, std::string> thread_map_type; thread_map_type thread_map; template<typename T> void register_thread_id(const T &entity) { lock_type lock(print_map_mutex); std::cout << "Registering " << pthread_self() << " to " << entity.name() << std::endl; thread_map[pthread_self()] = entity.name(); } #define LOG(msg) \ { \ lock_type lock(print_mutex); \ std::cout << "[" << thread_map[pthread_self()] \ << "] " << msg << std::endl; \ } #define LOG_NOLCK(msg) \ { \ std::cout << "[" << thread_map[pthread_self()] \ << "] " << msg << std::endl; \ } // Synchronize start (make sure all registered) mutex_type go_mutex; boost::condition go_condition; bool ready = false; class Consumer { private: boost::thread thread; std::queue<int> queue; typedef boost::recursive_mutex mutex_type; typedef mutex_type::scoped_lock lock_type; mutable mutex_type mutex; mutable mutex_type full_mutex; mutable boost::condition full_condition; void wait_until_ready(void) const { ::lock_type lock(go_mutex); while(!ready) { go_condition.wait(lock); } LOG_NOLCK("go!"); }; void wait_for_data(void) const { lock_type lock(full_mutex); while(empty()) { LOG_NOLCK("Waiting for data"); full_condition.wait(lock); LOG_NOLCK("Signaled for data"); } LOG_NOLCK("Wakeup for data"); }; void event_loop(void) { register_thread_id(*this); wait_until_ready(); while(true) { wait_for_data(); LOG_NOLCK("Consumer received data " << top()); pop(); } }; public: Consumer(void) : thread(boost::bind(&Consumer::event_loop, this)) {}; std::string name(void) const { return("Consumer"); }; void push(int val) { LOG_NOLCK("push(): about to lock"); { lock_type lock(mutex); LOG_NOLCK("push(): locked"); queue.push(val); lock_type full_lock(full_mutex); LOG_NOLCK("push(): about to unlock"); } full_condition.notify_all(); }; int top(void) const { LOG_NOLCK("top(): about to lock"); lock_type lock(mutex); LOG_NOLCK("top(): locked"); int item = queue.front(); LOG_NOLCK("top(): about to unlock"); return(item); }; void pop(void) { LOG_NOLCK("pop(): about to lock"); lock_type lock(mutex); LOG_NOLCK("pop(): locked"); queue.pop(); LOG_NOLCK("pop(): about to unlock"); }; bool empty (void) const { LOG_NOLCK("empty(): about to lock"); lock_type lock(mutex); LOG_NOLCK("empty(): locked"); bool val = queue.empty(); LOG_NOLCK("empty(): about to unlock"); return(val); }; }; class Producer { private: boost::thread thread; void wait_until_ready(void) const { lock_type lock(go_mutex); while(!ready) { go_condition.wait(lock); } LOG_NOLCK("go!"); }; void event_loop(void) { int i = 0; register_thread_id(*this); wait_until_ready(); while(true) { LOG_NOLCK("Producer generated data " << i); consumer->push(i); ++i; }; }; Consumer *consumer; public: Producer(Consumer *c) : consumer(c), thread(boost::bind(&Producer::event_loop, this)) {}; std::string name(void) const { return("Producer"); }; }; void go(void) { // Wait until everyone arrives lock_type lock(go_mutex); ready = true; // Notify everyone go_condition.notify_all(); } int main(void) { Consumer c; Producer p(&c); go(); while(true); return(0); } ----------------- Ouput Trace [Consumer] empty(): about to unlock [Consumer] Waiting for data Registering 48958384 to Producer [Producer] go! [Producer] Producer generated data 0 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 1 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 2 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 3 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 4 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 5 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 6 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 7 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 8 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 9 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 10 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 11 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 12 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 13 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 14 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 15 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 16 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 17 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 18 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 19 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 20 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 21 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 22 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 23 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 24 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 25 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 26 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 27 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 28 [Producer] push(): about to lock [Producer] push(): locked [Producer] push(): about to unlock [Producer] Producer generated data 29 [Producer] push(): about to lock [Producer] push(): locked [Consumer] Signaled for data [Consumer] empty(): about to lock <<DEADLOCK>>

4 5

unit test framework problems
by Niklas Wiberg 09 Feb '06

09 Feb '06

Hi, I'm having problems with the unit test framework when I try to run it in release mode. My compiler is VC++ 6 sp6. The unit test executable I'm building is "Using MFC as a shared DLL" and is set to use the "Multithreaded DLL" runtime library. The test subject code that is linked to this app is built with the same settings. I'm linking with libboost_unit_test_framework-vc6-mt-1_33.lib. The problem is that when the unit test starts to execute it fails with an access violation. In debug build it works fine. I enabled some debug info in the release build and found that what seems to be happening is a deallocation of "invalid" heap memory, which I'm guessing could be a result of different runtime libs being used. The stack trace at the point of the crash is included below. Has anyone had the same kind of problem and perhaps found a solution? Best regards, Niklas Wiberg NTDLL! 7c901230() NTDLL! 7c96cd80() NTDLL! 7c960af8() KERNEL32! 7c85e7af() _CrtIsValidHeapPointer(const void * 0x003b2418) line 1697 _free_dbg_lk(void * 0x003b2418, int 1) line 1044 + 9 bytes _free_dbg(void * 0x003b2418, int 1) line 1001 + 13 bytes free(void * 0x003b2418) line 956 + 11 bytes operator delete(void * 0x003b2418) line 7 + 10 bytes std::allocator<char>::deallocate(void * 0x003b2418, unsigned int 33) line 64 + 16 bytes std::basic_string<char,std::char_traits<char>,std::allocator<char> >::_Tidy(unsigned char 1) line 592 std::basic_string<char,std::char_traits<char>,std::allocator<char> >::~basic_string<char,std::char_traits<char>,std::allocator<char> >() line 59 + 17 bytes boost::filesystem::path::m_path_append(const std::basic_string<char,std::char_traits<char>,std::allocator<char> > & {0x0032f9f1 "D:\dev\UnitTest"}, unsigned char (const std::basic_string<char,std::char_traits<char>,std::allocator<char> > &)* 0x0054f9b3 boost::filesystem::native(const std::basic_string<char,std::char_traits<char>,std::allocator<char> > &)) line 351 boost::filesystem::path::path(const char * 0x0032f988, unsigned char (const std::basic_string<char,std::char_traits<char>,std::allocator<char> > &)* 0x0054f9b3 boost::filesystem::native(const std::basic_string<char,std::char_traits<char>,std::allocator<char> > &)) line 220 + 37 bytes boost::filesystem::current_path() line 803 + 22 bytes boost::filesystem::initial_path() line 810 + 28 bytes init_unit_test_suite(int 1, char * * 0x003b2da0) line 19 + 5 bytes UNITTEST! boost::unit_test::framework::init(int,char * * const) + 201 bytes UNITTEST! main + 54 bytes UNITTEST! mainCRTStartup + 227 bytes KERNEL32! 7c816d4f()

2 3

[iostreams] Hang when constructing an xml_iarchive with non-existent source
by Paul Giaccone 09 Feb '06

09 Feb '06

I have a function that uses a chain of filters that I am using to read encrypted, bzipped data from file. It is working fine. However, I have just discovered that if I call my function with a file that does not exist, the code hangs in the constructor for xml_iarchive. Of course, I have since edited my code to trap non-existent files before the code gets that far, but I am surprised that: * is_complete() returns true when the source is a non-existent file * the constructor for xml_iarchive hangs when it is given a stream that has a non-existent file as its source Is this correct behaviour or a bug? Of course, it is the programmer's responsibility to ensure the source exists, but a hang rather than an exception seems suggests to me that something has been overlooked in the library. The (edited) function exhibiting this behaviour is given below. I am using gcc 3.2.3 and Boost 1.33.1. Paul void load(const std::string& filename) { //my revised tests "filename" here and bails out if the file does not exist try { boost::iostreams::filtering_istream in; in.push(boost::iostreams::bzip2_decompressor()); in.push(MyInputEncryptionFilter()); in.push(boost::iostreams::bzip2_decompressor()); in.push(boost::iostreams::file_source(filename, BOOST_IOS::in | BOOST_IOS::binary)); if (!in.is_complete()) { std::cerr << "Error creating filtering input stream" << std::endl; return; } boost::archive::xml_iarchive input_archive(in); //deserialise file here return; } //various catches removed }

2 3

[bgl]
by Marcio Paim de Aquino 09 Feb '06

09 Feb '06

Hi, I'm trying to compile this example http://www.boost.org/libs/graph/example/johnson-eg.cpp. I have the following error from VC++ 6 SP2: --------------------Configuration: johnson-eg - Win32 Debug-------------------- Compiling... johnson-eg.cpp c:\arquivos de programas\microsoft visual studio\vc98\include\boost\graph\graph_concepts.hpp(479) : error C2664: 'const_constraints' : cannot convert parameter 1 from 'int [5][5]' to 'const int (&)[5][5]' Reason: cannot convert from 'int [5][5]' to 'const int [5][5]' There is no context in which this conversion is possible c:\arquivos de programas\microsoft visual studio\vc98\include\boost\graph\graph_concepts.hpp(477) : while compiling class-template member function 'void __thiscall boost::BasicMatrixConcept<int [5][5],unsigned int,int>::constraints(void)' Error executing cl.exe. johnson-eg.exe - 1 error(s), 0 warning(s) Does anyone know what's wrong? Regards Marcio Paim

2 1

Re: [Boost-users] [Serialization]: bug while serializing a std::string
by RIVASSEAU Jean Noel 09 Feb '06

09 Feb '06

I am assuming you meant : std::ofstream ifs("container.mob"); boost::archive::text_oarchive ia(ofs); oa << MyObject; ofs << std::endl; and not std::ifstream ifs. So if I understand well, this "patch" only adds a newline to the archive at the saving stage. I tried it but it did not help in any way; in fact I cannot see how it could help, since the problem is at the point of the loading of the std::string, not at the end of the load of the whole object. What I mean here is that MyObject is, in my case, a class containing a std::vector of pointers to class containing std::strings. One of these strings is too long, which causes the crash. Maybe what you meant is appending the std::endl after the serialization of the std::string, but this is not possible since at this point I have only access to the archive, not the underlying ofstream : template<class Archive> void serialize(Archive & ar, const MyClass& m, const unsigned int version) { ar & m.a_standard_string; } I do not have access there to the underlying ofstream of the implementation. Note that here, MyObject would contain a std::vector < MyClass * >. And I am serializing directly MyObject which causes the serialization of MyClass later. So, what do you mean? Have you located the bug ? _____ De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Robert Ramey Envoyé : jeudi 9 février 2006 04:46 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Serialization]: bug while serializing astd:string Untl 1.34 comes out try the following on the output stream std::ifstream ofs("container.mob"); boost::archive::text_oarchive ia(ofs); oa << MyObject; ofs << std::endl; "RIVASSEAU Jean Noel" <JN.RIVASSEAU(a)oberthurcs.com> wrote in message news:87F60F7FA02FF749AFB02BD9FCAA6B04C87411@naserv31.nanterre.oberthurcs.com... I have been able to test with a string stream; the bug does not occur. That is, this code produces the bug: std::ifstream ifs("container.mob"); boost::archive::text_iarchive ia(ifs); ia & MyObject; while the following does not: std::ifstream ifs("container.mob"); std::ostringstream tmp; tmp << ifs.rdbuf(); std::istringstream is(tmp.str()); boost::archive::text_iarchive ia(is); ia & MyObject; a) try using a different stream buffer - strstream So do you have any clue, Robert ?? Clearly the problem has to do with buffering somewhere.... Jean-Noël _____ _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

pd darwin Symbol not found
by Locatelli Jérôme 09 Feb '06

09 Feb '06

I'am writing a application on MacOS 10.4.4 using darwin 8 with gcc 4, I compile and link my application without problem but when I run my application , I've got the error bellow. Has anybody got an idear?? Thanks. dyld: lazy symbol binding failed: Symbol not found: __ZN5boost6detail3tss4initEPNS_9function1IvPvSaINS_13function_baseEEEE Referenced from: /Users/locatelli/Projets/ics/IcsServer/obj.ics/../lib/ libIcsServerCommandSystem.0 Expected in: flat namespace dyld: Symbol not found: __ZN5boost6detail3tss4initEPNS_9function1IvPvSaINS_13function_baseEEEE Referenced from: /Users/locatelli/Projets/ics/IcsServer/obj.ics/../lib/ libIcsServerCommandSystem.0 Expected in: flat namespace Trace/BPT trap --------------------------------------------------- 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 ---------------------------------------------------

1 0

[any] Converting between types
by Iulian M 09 Feb '06

09 Feb '06

Hello, I'm trying to use boost::any to store a group of types. For value types everything works as expected. The problem is that i need to store some polymorphic types also. The following code explains what i'm trying to accomplish. #include <boost/any.hpp> class A {}; //base calss class B: public A {}; // derived class int main() { B *b = new B(); //create derived class boost::any n(b); // place inside boost::any /* other part of code where i only know n contains a pointer to a class derived from A this will throw bad_any_cast: typeid(A*) != typeid (B*) */ A* a = boost::any_cast<A*>(n); } Is there any way of making boost::any_cast work work ok with "convertible" types? Or is there a way of storing different types of objects and having the possibility of retrieving them as compatible objects ? I've looked into any.hpp and found that it uses a typeid() equality test to see if the cast can be made. Can't there be a is_convertible test insted , at least for the case when is holding pointer to objects? Iulian -- Blessed is the man who, having nothing to say, abstains from giving wordy evidence of the fact. -- George Eliot

3 6

A problem with '^' and '$' in boost regex
by Alan Huang 09 Feb '06

09 Feb '06

Hi, In boost document I saw that the '^' matches all the blank chars in the begin of line and the '$' matches all the blank chars in the end of line. Just like regex( "^abc$" ) can't match the string " abc ". What's wrong? -- Yours Sincerely, Alan Huang

3 3

Re: [Boost-users] [GRAPH] Is the HP aCC compiler supported?
by Oliver.Kowalke＠infineon.com 09 Feb '06

09 Feb '06

Hello, aCC V6 is only available on HP/UX 11 Itanium systems. On HP/UX 11.11 PA-RISC only the old 3.x versions are available which are unable to compile boost libraries. I use gcc 3.4.4 on HP/UX together with boost - works fine. Oliver >The aCC V6 compiler is not listed as a supported compiler with boost >because nobody is running boost regression tests with this compiler, >but we are working on this... > >I ran boost regression tests with aCC A.06.06 for the latest boost >release: 1.33.1 and the results were on par with that for the supported >compilers. Specifically, for the graph library, 32 tests succeeded and >two tests failed to compile: graphviz_test and layout_test. > >graphviz_test failed to compile with: > >"/opt/aCC/include_std/utility", line 103: error #2144: a value of type > "const char *" cannot be used to initialize an entity of type > "std::pair<char [2], char [2]>::first_type" > >layout_test failed to compile because the compiler ran out of memory. > >I used extended acc jamfile with some compilation warnings disabled, >like "#2340-D: value copied to temporary, reference to temporary used", >"#2068-D: integer conversion resulted in a change of sign", "#2111-D: >statement is unreachable", ...etc. > >I suggest, you try BGL with aCC V6. > >Boris Gubenko >HP C++ team > >----- Original Message ----- >From: "rohit wadhwa" <rohit.wadhwa(a)teleatlas.com> >To: <boost-users(a)lists.boost.org> >Sent: Wednesday, February 08, 2006 12:01 PM >Subject: [Boost-users] [GRAPH] Is the HP aCC compiler supported? > > >> Can I use BGL with HP aCC compiler? If so, what version? >> >> Any help is really appreciated. >> >> Rohit. >> >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >> >> > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[GRAPH] Is the HP aCC compiler supported?
by rohit wadhwa 09 Feb '06

09 Feb '06

Can I use BGL with HP aCC compiler? If so, what version? Any help is really appreciated. Rohit.

3 2

Re: [Boost-users] [Serialization]: bug while serializing astd:string
by RIVASSEAU Jean Noel 09 Feb '06

09 Feb '06

I have been able to test with a string stream; the bug does not occur. That is, this code produces the bug: std::ifstream ifs("container.mob"); boost::archive::text_iarchive ia(ifs); ia & MyObject; while the following does not: std::ifstream ifs("container.mob"); std::ostringstream tmp; tmp << ifs.rdbuf(); std::istringstream is(tmp.str()); boost::archive::text_iarchive ia(is); ia & MyObject; a) try using a different stream buffer - strstream So do you have any clue, Robert ?? Clearly the problem has to do with buffering somewhere.... Jean-Noël

2 1

[Regex] extracting with bcp and size
by Orhun Birsoy 08 Feb '06

08 Feb '06

I was able to extract regex and build it, Thanks for the help for my previous problem. But, (there is always a but) the size is huge (well, more than one expects). I used "bcp boost/regex.hpp C:\Development\3rdParty\Regex" to extract the regex library. For now, I do not need to build the examples etc. The extracted directory contains 1246 Files (8.75 MB), and it looks like it contains bind, function, iterator, mpl, preprocessor, regex, thread, type_traits, utility, smart_ptr libraries from boost. (boost/mpl contains 649 files, boost/preprocessor contains 149 files) Although I used make files to build (VC80), when building regex, it didn't require the thread library. I wonder whether it is really necessary. Is there anything I can do to reduce the size of this? Or am I doing something wrong? For example when extracting smart_ptr library I commented out the line that includes <boost/detail/quick_allocator.hpp> in sp_counted_impl.hpp (I will not use it), so that bcp does not extract the mpl library, which reduced the extracted file count to 85, from 345. I wonder whether similar tricks are available for regex as well. -- Orhun Birsoy

2 2

[program_options] Bug in program_options with vc-8_0 build target when displaying the help descriptions
by boost＠nogga.de 08 Feb '06

08 Feb '06

Hello, there is a bug in the help output generated from void format_paragraph(std::ostream& os, std::string par, unsigned first_column_width, unsigned line_length) function. The error message is cryptic and something like that: _Myptr + _Off <= (((_Mystring *)this->_Mycont)->_Myptr() + ((_Mystring *)this->_Mycont)->_Mysize) && _Myptr + _Off >= ((_Mystring *)this->_Mycont)->_Myptr(): The point is that the new vc8.0 compiler (or better the vs2005 standard library) performs a lot of additional iterator checking. In the function format_paragraph the "line_begin" iterator is checked, whether there is one more line to indent in the help output or whether this is the last line. During this process, the "line_begin" iterator is incremented behind the end of the current string "par.end()" and this will trigger the _SCL_SECURE_VALIDATE_RANGE warning from the new library. if (line_begin + (line_length - indent) > par_end) { line_end = par_end; } You should be able to trigger this behavior with every application when printing the help text for an option that is longer than one line. This new iterator checking has it's pros and cons. While it is good to find any sort of error, how would you safely write the case above without reverting to index like operations? Best regards Dirk

1 0

[BGL] infinite loop in astar_search (there are no negative edge costs)
by Detlef Mages 08 Feb '06

08 Feb '06

Hi all I am using astar_search from the BGL and have sometimes hangs due to an infinite loop (no, I do not use negative costs or negative heuristic values). Now here is the strange problem: when compiling the attached (see below) test program with compiler optimization enabled it runs into an infinite loop. Without optimization a solution is found. I need help, because I do not know what I should do next. Is this a compiler bug? Is there something boost can do (workaround)? Is there a known issue (could not find anything) with the relax function? -- Detlef Here are the facts: I condensed one of the malicious (undirected) graphs to <SNIP> V ar[181]; for( unsigned int i = 0; i < 181; ++i ) { ar[i] = add_vertex( VProp(i, 1.0), g ); } add_edge( ar[1], ar[18 ], EProp( 2.20 ), g ); add_edge( ar[0], ar[30 ], EProp( 1.58 ), g ); add_edge( ar[0], ar[66 ], EProp( 0.93 ), g ); add_edge( ar[66], ar[100 ], EProp( 2.72 ), g ); add_edge( ar[66], ar[101 ], EProp( 2.87 ), g ); add_edge( ar[30], ar[142 ], EProp( 4.88 ), g ); add_edge( ar[18], ar[142 ], EProp( 3.29 ), g ); </SNAP>. There are no other edges. A complete listing of the program is attached. My compiler version: # g++ -v Using built-in specs. Target: i586-suse-linux Configured with: ../configure --enable-threads=posix --prefix=/usr --with-local-prefix=/usr/local --infodir=/usr/share/info --mandir=/usr/share/man --libdir=/usr/lib --libexecdir=/usr/lib --enable-languages=c,c++,objc,f95,java,ada --disable-checking --with-gxx-include-dir=/usr/include/c++/4.0.2 --enable-java-awt=gtk --disable-libjava-multilib --with-slibdir=/lib --with-system-zlib --enable-shared --enable-__cxa_atexit --without-system-libunwind --host=i586-suse-linux Thread model: posix gcc version 4.0.2 20050901 (prerelease) (SUSE Linux) # g++ -O2 searchtest4.cpp && a.out 2>/dev/null discover: 0 examine: 0 edge_relaxed: 0 -- 30 discover: 30 edge_relaxed: 0 -- 66 discover: 66 examine: 66 edge_not_relaxed: 66 -- 0 edge_relaxed: 66 -- 100 discover: 100 edge_relaxed: 66 -- 101 discover: 101 examine: 30 edge_not_relaxed: 30 -- 0 edge_relaxed: 30 -- 142 discover: 142 CYCLE: examine: 100 CYCLE: edge_relaxed: 100 -- 66 CYCLE: black_target: 100 -- 66 CYCLE: examine: 66 CYCLE: edge_not_relaxed: 66 -- 0 CYCLE: edge_relaxed: 66 -- 100 CYCLE: black_target: 66 -- 100 CYCLE: edge_relaxed: 66 -- 101 >From now on the lines marked CYCLE are repeated. --> infinite loop # g++ -O0 searchtest4.cpp && a.out 2>/dev/null discover: 0 examine: 0 edge_relaxed: 0 -- 30 discover: 30 edge_relaxed: 0 -- 66 discover: 66 examine: 66 edge_not_relaxed: 66 -- 0 edge_relaxed: 66 -- 100 discover: 100 edge_relaxed: 66 -- 101 discover: 101 examine: 30 edge_not_relaxed: 30 -- 0 edge_relaxed: 30 -- 142 discover: 142 examine: 100 edge_not_relaxed: 100 -- 66 // from here on the two outputs differ examine: 101 edge_not_relaxed: 101 -- 66 examine: 142 edge_not_relaxed: 142 -- 30 edge_relaxed: 142 -- 18 discover: 18 examine: 18 edge_relaxed: 18 -- 1 discover: 1 edge_not_relaxed: 18 -- 142 examine: 1 found 1->18->142->30->0 --> success Here is the listing "searchtest4.cpp": ---------------------------------- #include <boost/graph/astar_search.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graphviz.hpp> #include <iostream> using namespace std; using namespace boost; struct VProp { VProp() : m_distance(1.0) {} VProp( size_t invar_id, double heuristic ) : m_vertex_invariable_id( invar_id ), m_heuristic( heuristic ), m_distance( .0 ) {} size_t m_vertex_invariable_id; // my id that is not changed by rebuilding the index map double m_heuristic; // a really simple heuristic double m_distance; // altered by the algo: this id is the distance boost::default_color_type m_color; }; struct EProp { EProp() : m_weight( .0 ) {} EProp( double weight ) : m_weight( weight ) {} double m_weight; }; typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, VProp, EProp > G; typedef G::vertex_descriptor V; typedef G::edge_descriptor E; struct found_goal {}; template< class Vertex, class Edge > class GoalVisitor : public boost::default_astar_visitor { public: GoalVisitor(Vertex goal) : m_goal(goal) {} template <class Graph> void examine_vertex(Vertex u, Graph& g) { cout << "examine: " << u << endl; if(u == m_goal) throw found_goal(); } template <class Graph> void discover_vertex(Vertex u, Graph& g) { cout << "discover: " << u << endl; } template <class Graph> void black_target(Edge u, Graph& g) { cout << "black_target: " << boost::source( u, g ) << " -- " << boost::target( u, g ) << endl; } template <class Graph> void edge_relaxed(Edge u, Graph& g) { cout << "edge_relaxed: " << boost::source( u, g ) << " -- " << boost::target( u, g ) << endl; } template <class Graph> void edge_not_relaxed(Edge u, Graph& g) { cout << "edge_not_relaxed: " << boost::source( u, g ) << " -- " << boost::target( u, g ) << endl; } private: Vertex m_goal; }; template< class Graph, class CostType > class DistanceHeuristic : public boost::astar_heuristic<Graph, CostType > { public: DistanceHeuristic( Graph & graph ) : m_graph(graph) {} template< class Vertex > CostType operator()( Vertex u) { return m_graph[u].m_heuristic; } private: Graph & m_graph; }; class EdgeWeightWriter { public: EdgeWeightWriter( G & graph ): m_graph( graph ) {} template< class OStream > void operator()( OStream& out, V v ) { // out << " [label= \"" << v <<"\"]"; } template< class OStream > void operator()( OStream& out, E v ) { out.precision( 30 ); out << " [label= \"" << m_graph[v].m_weight <<"\"]"; } private: G & m_graph; }; int main() { G g; V ar[181]; for( unsigned int i = 0; i < 181; ++i ) { ar[i] = add_vertex( VProp(i, 1.0), g ); } // add_edge( ar[1], ar[18 ], EProp( 2.20307469298885294506362697575 ), g ); // add_edge( ar[0], ar[30 ], EProp( 1.58945958901181461087048774061 ), g ); // add_edge( ar[0], ar[66 ], EProp( 0.937232823257896585644743936427 ), g ); // add_edge( ar[66], ar[100 ], EProp( 2.72761497732282665040770552878 ), g ); // add_edge( ar[66], ar[101 ], EProp( 2.87914914272965027919326530537 ), g ); // add_edge( ar[30], ar[142 ], EProp( 4.8843528076143511995610424492 ), g ); // add_edge( ar[18], ar[142 ], EProp( 3.29201592753501959265349796624 ), g ); add_edge( ar[1], ar[18 ], EProp( 2.20 ), g ); add_edge( ar[0], ar[30 ], EProp( 1.58 ), g ); add_edge( ar[0], ar[66 ], EProp( 0.93 ), g ); add_edge( ar[66], ar[100 ], EProp( 2.72 ), g ); add_edge( ar[66], ar[101 ], EProp( 2.87 ), g ); add_edge( ar[30], ar[142 ], EProp( 4.88 ), g ); add_edge( ar[18], ar[142 ], EProp( 3.29 ), g ); map< V, V > predecessor; associative_property_map< map< V, V > > predecessorMap( predecessor ); /** * solution to this: 1->18->142->30->0 */ try { astar_search(g, ar[0], DistanceHeuristic<G, double>( g ), predecessor_map( predecessorMap ). weight_map( get(&EProp::m_weight, g) ). color_map( get(&VProp::m_color, g) ). distance_map( get(&VProp::m_distance, g) ). visitor(GoalVisitor<V, E>( ar[1] ) ) ); } catch ( found_goal ) { cout << "found" << endl; for(V v = ar[1];; v = predecessor[v]) { cout << v; if(predecessor[v] == v) break; cout << "->"; } cout << endl; } boost::write_graphviz( std::cerr, g, EdgeWeightWriter( g ), EdgeWeightWriter( g ), default_writer() ); }

2 2

Re: [Boost-users] [Serialization]:
by sui tam 08 Feb '06

08 Feb '06

I am trying to use the macro : BOOST_CLASS_EXPORT(A) and the compiler issue the warning: warning #880: omission of explicit type is nonstandard ("int" assumed) Also I have to change to BOOST_CLASS_EXPORT(A); in order to compile, but I do not think the semicolon is in the example. --------------------------------- Brings words and photos together (easily) with PhotoMail - it's free and works with Yahoo! Mail.

1 0

regex matching
by Dave 08 Feb '06

08 Feb '06

#define BOOST_REGEX_DYN_LINK #include <iostream> #include <boost\regex.hpp> using namespace boost; using namespace std; int main() { regex reg_exp("\xF8.\x2A..\x0D(P|V)[0-9A-F]{3}"); // I would expect this to match. cout << regex_match("\xF8p\x2Aqf\x0DPFFF", reg_exp) << endl; // I would expect this to not match due to the 'w'. // Why does it match? cout << regex_match("\xF8p\x2Aqfw\x0DPFFF", reg_exp) << endl; }

3 2

Re: [Boost-users] [Serialization]: bug while serializing astd:string
by RIVASSEAU Jean Noel 08 Feb '06

08 Feb '06

Hello I've tried to reproduce the bug with an XML archive : nothing happens there. So only a text_archive triggers it. I've also examined the text output, but nothing seems really obvious, it just seems that after the 512 characters garbage is loaded into the std::string (something present earlier in the string); For example If my saved string was: Abalvqdslfldls****************tons of other characters *********** this is the 512th character HERE___and there it is beyond 512 The reloaded string before the next load which will crash will look something like: Abalvqdslfldls****************tons of other characters *********** this is the 512th character HEREons of other characters Or: Abalvqdslfldls****************tons of other characters *********** this is the 512th character HERE Abalvqdslfldls********* I will try to investigate more on this, but nothing is obvious. About the stream buffers, I am not really knowledgeable on this but from what I've read you cannot change the size of the stream buffer used (there is an overloaded method pubsetbuf but the standard says that behaviour is not defined if its arguments are something other than 0,0). So what do you mean? I will tomorrow try to read the file first into a string stream and try to load from there using a text archive. We will see if the bug happens Jean-Noël Without being able to reproduce it its going to be tough for me to find the problem or know when its fixed. try the following a) try using a different stream buffer - strstream b) try changing the size of the streambuffer used c) try xml_serialization d) examine the text output where the load fails to see if there's anything obvious there You've made some progress - but not enough for me to work with. Robert Ramey "RIVASSEAU Jean Noel" <JN.RIVASSEAU(a)oberthurcs.com> wrote in message news:87F60F7FA02FF749AFB02BD9FCAA6B04C1E144@naserv31.nanterre.oberthurcs.com... Hi I have tested with a binary archive and the problem does not occur. Only text archives seem to trigger it (I have not yet tested XML archives). I have replaced all "strange" (non-letters) characters and the problem still happens. So the string contains only letters, I even removed the spaces. However do not forget that I left the line breaks in it (if I remove the line breaks, the problem does not appear). To recapitulate: the problem appears when *all* of the following conditions are met: * using a text archive * using a std::string with line breaks * with a length >=512 * * And even like that, I am not able to reproduce this bug in a small program, although in my program it is triggered all the time. Now, Robert, if you could look into that, I'd appreciate it... Jean-Noël _____ De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Robert Ramey Envoyé : mercredi 1 février 2006 18:13 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] [Serialization]: bug while serializing astd:string This sounds like a bug to me. To help me out - check the following: try different types of archives xml, binary, etc. xml archives have a pending issue if a string contains a character (e.g. '\0') which is not representable in an xml string. Other archive classes don't have this problem. Check to see if its related to a particular character. be sure its really question of size. Robert Ramey "RIVASSEAU Jean Noel" <JN.RIVASSEAU(a)oberthurcs.com> wrote in message news:87F60F7FA02FF749AFB02BD9FCAA6B04C1D8FA@naserv31.nanterre.oberthurcs.com... Hello It seems I have come against a bug in the BSL. I am running on Win 2000 Pro, MinGW (gcc 3.4.2), Boost 1.33.1. If I serialize a standard string with 512 or more characters, the save goes ok but a stream error exception occurs while trying to reload it later from archive. Any string with size < 512 is ok. Also this bug is really strange. It does not happen if the string has no line breaks in it (even if it is more than 512 chars). It also happens on my program, but I was unable to reproduce it with a small test program, even using the same string. Could it be a bug in another part of my rather large program? Or is it really a bug in the BSL? Jean-Noël _____ _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _____ _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

test_suite execution (unit test framework)
by Alexander Eisenhuth 08 Feb '06

08 Feb '06

Hello alltogether, it seems, that the a test_case-failure (BOOST_ERROR("")), skips only the actual test case, but all following tests are executed. Is that possible ? ... or am I doing something wrong? Here my code: [...] boost::shared_ptr<testTestExecutor> aInstance( new testTestExecutor ); // here happens a failure pTestSuite->add( BOOST_CLASS_TEST_CASE(&testTestExecutor::setUp, aInstance)); // but this is also executed pTestSuite->add( BOOST_CLASS_TEST_CASE(&testTestExecutor::testConstruction, aInstance)); pTestSuite->add( BOOST_CLASS_TEST_CASE( &testTestExecutor::testTestExecutorMethode, aInstance)); [...] Can I configure that behaviour ? Regards Alexander

2 1

Re: [Boost-users] [program_options]allow_unregistered() ignored?
by Merrill Cornish 08 Feb '06

08 Feb '06

Volodya, >>> Are you sure you have all the catch clauses in place. Several days ago, I posted a short, single file program that exhibited the throw problem. That example, however, didn't have the allow_unregistered() call in it. That example has a catch for both std::exception (in which case it prints the exception message) and ... (in which case it prints a messages saying unknown exception. Merrill

1 0

progress_timer writes two newlines?
by Daniel Lidström 08 Feb '06

08 Feb '06

Hello! Why does boost::progress_timer write two newlines on destruction? One would suffice for me. Hälsningar, Daniel

1 0

[Regex] : Unknown character sequence.
by Sandeep Bantia 08 Feb '06

08 Feb '06

Hi, I'm new to regex. This is basically what I was trying. #include <iostream> #include <boost/regex.hpp> int main() { std::string input = "sand._12"; boost::regex reg(".*\._[0-9]+"); ...... } I get a warning which says "Unknown escape sequence '\.' . Its the same case with any other special character or even '\s' . I guess I'm missing something very simple. Any ideas ? Thanks in advance. -- -Sandeep.

2 1

Re: [Boost-users] [Regex] : Unknown character sequence.
by paul.floyd 08 Feb '06

08 Feb '06

> Hi, > > I'm new to regex. This is basically what I was trying. > > #include <iostream> > #include <boost/regex.hpp> > > int main() > { > std::string input = "sand._12"; > boost::regex reg(".*\._[0-9]+"); Hi In C++, you need to double your escape characters, so that in order to pass '.*\._[0-9]+' to the RE, you need to pass '.*\\._[0-9]+' to the compiler. With the string that you use, the compiler will strip the sole backslash, and the RE will get '.*._[0-9]+', which isn't what you want. A+ Paul Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34 /mn) ; tél : 08 92 68 13 50 (0,34/mn)

1 0

Re: [Boost-users] Multi_index Container
by Soni, Aashit 08 Feb '06

08 Feb '06

Hi Joaquín It worked fine. Thanks for the quick answer. I really appreciate this. now, I can go ahead and use it in my project. regards, aashit ________________________________ From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Joaquín Mª López Muñoz Sent: Wednesday, February 08, 2006 1:16 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Multi_index Container "Soni, Aashit" ha escrito: Hi Joaquín, Éric I appreciate your response, Before that I got some workaround from the web and the snippet I have written to port it to my existing project worked until I face real problem. My observation is like when I have Ordered_index with std::string, the code I have written compiles really well and works also. But when I remove this ordered_index, the code does not compile.Here is the code that compiles: <<Multi_index_container_working.txt>>Here is the code that does not compile: <<Multi_index_container_not_working.txt>>If you see the difference I have only two lines commented. Yes, I'm able to reproduce the problem you report under MSVC 6.0. Two remarks: * The problem does not show with the CVS version of Boost.MultiIndex (to be shipped in Boost 1.34), as it includes a number of optimizations alleviating the choking of MSVC 6.0 with very long symbol names, which is the core reason for this weird behavior. * Until you switch to Boost 1.34 (and even when you do), you can try avoiding the use of tags and using numeric identifiers instead. Tags add some stress to such a weak compiler as MSVC 6.0. The attached file is a variation of your Multi_index_container_not_working.txt file where tags have been suppressed and numerical identifiers used instead. I have checked it out to compile and work OK under MSVC 6.0. I hope this helps, please keep me informed otherwise, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

Re: [Boost-users] Multi_index Container
by Soni, Aashit 08 Feb '06

08 Feb '06

Hi Joaquín, Éric I appreciate your response, Before that I got some workaround from the web and the snippet I have written to port it to my existing project worked until I face real problem. My observation is like when I have Ordered_index with std::string, the code I have written compiles really well and works also. But when I remove this ordered_index, the code does not compile. Here is the code that compiles: <<Multi_index_container_working.txt>> Here is the code that does not compile: <<Multi_index_container_not_working.txt>> If you see the difference I have only two lines commented. ... //ordered_non_unique<tag<name>,BOOST_MULTI_INDEX_MEMBER(employee,std::string,name) >, .... .... //typedef boost::multi_index::index<employee_set,name>::type employee_set_by_name;... Same boost::multi_index::index<employee_set,ssnumber>::type is not working if the std::string is not indexed. right now I am working with dummy string. But I need to scrap the string and have some real code in place that should go into my project. If I am not able to solve this. I can not use multi_index_container and it is real loss for me. Help always appreciated. Thanks in advance. aashit ps: please consider these txt files are cpp files. ________________________________ From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Joaquín Mª López Muñoz Sent: Tuesday, February 07, 2006 9:39 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Multi_index Container Hello Aashit, "Soni, Aashit" ha escrito: Hi all, I am newbie to Boost library. I am trying to use multi_index_container library in my project. The problem I have at my hands needs One Hash index and one ordered indexed. I refer the Boost tutorial and Advance topic and tried to write the following snippet. But when I compiled it gives compilation error. I searched lot of different options and tried to fix it but I could not able to do it so. If you can guide me how to shut the compilation errors it will be great. If anyone of you is having any decent example tried out for Hash having ordered indexes please send it to me so I can go through and build my logic on top of that.... Code Follows. I am using MSVC SP6 on Win XP . This is primarily the problem: To make MSVC 6.0 compile a program using Boost.MultiIndex you've got to observe some stricter rules than in the normal case. Please read the section on MSVC 6.0 at http://boost.org/libs/multi_index/doc/compiler_specifics.html#msvc_60 typedef employee_set::index<employee_set,ssnumber>::type employee_set_by_ssn; Problem #1: MSVC 6.0 does not support the "index" nested typedef. Instead, write typedef index<employee_set,ssnumber>::type employee_set_by_ssn; employee_set_by_ssn& ssn_index=es.get<2>(); Problem #2: MSVC 6.0 does not support the get member function, use the global version instead: employee_set_by_ssn& ssn_index=get<2>(es); With these changes, and also tweaking /Zm and /ZI (as explained in the aforementioned section), your program compiles. Bare in mind that your compiler is very old and broken and making Boost.MultiIndex work for it can be quite a challenge, although it is doable. Good luck with your project, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

[program_options]allow_unregistered() ignored?
by Merrill Cornish 08 Feb '06

08 Feb '06

I have this problem that while program options works just fine for processing registered options, an unregistered option triggers a MS runtime exception (I'm using MinGW, so it uses MS runtime) that can't be caught at the C++ level. My store() function is shown below: po::store(po::command_line_parser(argc, argv). options(all_verbose). positional(pd). run(), vm); I saw the allow_unregistered() feature. I thought this would be a way to get all illegal command line options "out of the way" so they couldn't trigger the exception. So I modified the above to be: po::store(po::command_line_parser(argc, argv). options(all_verbose). positional(pd). allow_unregistered(). run(), vm); However, putting an illegal argument on the command line, say --x, still gives the message, "This application has requested the Runtime to terminate it in an unusual way." Is an unregistered option triggering some sort of NULL access? Merrill

2 1

Creating static libraries of boost
by boostguy＠kapiladhanvi.com 08 Feb '06

08 Feb '06

Hi all, I am trying to compile boost into static libraries on windows, but I am not able to create static libraries. Can someone point out what I am missing ? I am on a windows XP machine with mingW installed and in path. This is a simple task but somehow I am not getting static libraries. The command line I am using on my command prompt is : bjam "-sTOOLS=gcc" "-sBUILD=release static multi" stage The output libraries created are .lib and .dll, but the filenames are not starting with libboost-*.lib , they are just boost-*.lib. According to the http://boost.org/more/getting_started.html#Build_Install , windows static libraries should have lib*.lib as the format for the name.. Can someone tell me what I am doing wrong ? Thanks. Dhanvi

2 1

Re: [Boost-users] [Regex] : Unknown character sequence.
by Sohail Somani 08 Feb '06

08 Feb '06

________________________________ From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Sandeep Bantia Sent: Tuesday, February 07, 2006 7:23 PM To: boost-users(a)lists.boost.org Subject: [Boost-users] [Regex] : Unknown character sequence. Hi, I'm new to regex. This is basically what I was trying. #include <iostream> #include <boost/regex.hpp> int main() { std::string input = "sand._12"; boost::regex reg(".*\._[0-9]+"); If you're trying to escape the "." you probably also need to escape the "\" by using "\\". It is a C string after all.

1 0

Re: [Boost-users] Getting started with Boost: what did you need to know?
by Drumheller, Michael 07 Feb '06

07 Feb '06

>>> Date: Tue, 07 Feb 2006 09:12:31 -0500 >>> From: Deane Yang <deane_yang(a)yahoo.com> >>> Subject: Re: [Boost-users] Getting started with Boost: what did you need to know? >>> bjam *is* difficult to learn at first. For me one reason >>> was simply how alien it looks compared to an IDE or make. >>> And until recently the documentation was simply incomprehensible. >>> >>> Although I'm really looking forward to the new >>> documentation Dave is going to write, the existing >>> documentation of Boost Build v2 is really not too bad for >>> learning how to compile and link libraries and executables. I have shied away from boost.build v2 because it says on the opening page "an *onging project* to rewrite Boost.Build" at <<http://www.boost.org/tools/build/v2/>>--I always assumed it was not ready fro prime time. Sounds like you're saying that, from a doc point of view, it is a good resource for learning v1. I'll check it out--thanks. >>> And once you've got the hang of it, building software on >>> different platforms (I've done it on Windows, Linux, >>> Solaris, MacOSX) is incredibly easy and can be done using a >>> single Jamfile. Do you mean that you have adopted bjam as your day-to-day build tool? Just curious. Mike D.

3 3

[BGL] there is no in_edges() function for adjacency_matrix<>
by Dmitry Bufistov 07 Feb '06

07 Feb '06

> > > On Feb 7, 2006, at 7:14 AM, Dmitry Bufistov wrote: > > --- Dmitry Bufistov wrote: > > But what about > boost::adjacency_matrix<boost::directedS>? > > No, that too has to be > boost::adjacency_matrix<boost::bidirectionalS>. > > > I've attached an updated adjacency_matrix header (also in Boost CVS) > that implements the Bidirectional Graph requirements for > adjacency_matrix. It works with adjacency_matrix<directedS>; there is > no adjacency_matrix<bidirectionalS> because it isn't needed. > > 2 Doug, > Now I also can't use > > template <typename MutableGraph> > bool read_graphviz(std::istream& in, MutableGraph& graph, > dynamic_properties& dp, > std::string const& node_id = "node_id") ; > function for the same type. I think because of following > declaractions in "adjacency_matrix.hpp" > [unimplemented add_vertex] > Will it be also implemented or how I can read my graph? > > > Adding vertices to an adjacency_matrix is *extremely* expensive, > requiring reallocation of the entire data structure. That > functionality may be implemented at some point, but I won't be able to > do it any time soon. > > Doug > Doug, Thank you very much! Now my if_enabled() function compiles and works for boost::adjacency_matrix<>. I'm gonna define read_net() function for boost::adjacency_matrix<> just by first read graph to appropriate boost::adjacency_list<> and then construct matrix from list. Is this approach ok? Thank you once again, --dima

2 1

Re: [Boost-users] [Boost][Tuples] Compilation error VC7.1 w/ enumin namespace
by Marc VIALA 07 Feb '06

07 Feb '06

Hi Stuart, Thank you for your CV7.1 workaround. Once again a mystery of VC7.1... Best regards, Marc Viala "Stuart Dootson" <stuart.dootson(a)gmail.com> a écrit dans le message news:<8b56cad40602070003m1432d360td4d3d32066a7f2e9(a)mail.gmail.com>... > On 2/6/06, Marc Viala <mviala(a)acticm.com> wrote: > > > > Hi, > > > > I've just tried to define a boost::tuples::tuple with an enum in a > > namespace, see code hereafter: > > > > \code > > > > namespace adv { namespace rbt { > > enum MyType { > > Type_1, Type_2 > > } ; > > } } > > > > boost::tuples::tuple<size_t, adv::rbt::MyType> t ; > > > > \endcode > > > > But during the compilation step, I've got an error w/ BOOST 1.33.1 and VC7.1 > > like that: "error MyType not defined". > > > > Remark: If the enum is not defined in a namespace, there are no compilation > > errors. > > > > Is there any workaround to deals with this compilation error? > > > > Thanks in advance > > > > Marc Viala > > > > mailto:mviala@acticm.com > > 1. Move to VC8 :-) Your code compiles fine with VC8 > > 2. Putting 'using adv::rbt::MyType;' immediately before the tuple > typedef gets it to compile on VC7.1. I don't know why, though :-( > > Stuart Dootson

1 0

linker problems with boost::test examples
by Markus Werle 07 Feb '06

07 Feb '06

Hi! I have some problems getting started with boost::test. I tried to build a Vc7 project using the code of http://boost.org/libs/test/test/result_report_test.cpp, but this fails to compile due to unresolved symbol init_unit_test_suite. libboost_unit_test_framework-vc71-mt-sgd-1_33_1.lib(framework.obj) : error LNK2019: Nicht aufgelöstes externes Symbol '"class boost::unit_test::test_suite * __cdecl init_unit_test_suite(int,char * * const)" (?init_unit_test_suite@@YAPAVtest_suite@unit_test@boost@@HQAPAD@Z)', verwiesen in Funktion '"void __cdecl boost::unit_test::framework::init(int,char * * const)" (?init@framework@unit_test@boost@@YAXHQAPAD@Z)' Debug/test.exe : fatal error LNK1120: 1 unaufgelöste externe Verweise Am I missing anything? I found out that #include <boost/test/included/test_exec_monitor.hpp> resolves the problem, but is this the correct solution? best regards, Markus

2 1

Re: [Boost-users] Multi_index Container
by EMalenfant＠interstarinc.com 07 Feb '06

07 Feb '06

From: Soni, Aashit [mailto:aashit.Soni@networkgeneral.com] > > typedef > employee_set::index<employee_set,ssnumber>::type employee_set_by_ssn; > I'm not a seasoned user of the MultiIndex library but, looking at the documentation, it seems that the above should be written as: typedef employee_set::index<ssnumber>::type employee_set_by_ssn; HTH, ----------------------------- Éric A conclusion is the place where you got tired of thinking

1 0

Multi_index Container
by Soni, Aashit 07 Feb '06

07 Feb '06

Hi all, I am newbie to Boost library. I am trying to use multi_index_container library in my project. The problem I have at my hands needs One Hash index and one ordered indexed. I refer the Boost tutorial and Advance topic and tried to write the following snippet. But when I compiled it gives compilation error. I searched lot of different options and tried to fix it but I could not able to do it so. If you can guide me how to shut the compilation errors it will be great. If anyone of you is having any decent example tried out for Hash having ordered indexes please send it to me so I can go through and build my logic on top of that.... Code Follows. I am using MSVC SP6 on Win XP . /*****************************************/ #define BOOST_MULTI_INDEX_CHECK_INVARIANT #include <boost/config.hpp> #include <boost/multi_index_container.hpp> #include <boost/multi_index/member.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/hashed_index.hpp> #include <algorithm> #include <iostream> #include <iterator> #include <string> using boost::multi_index_container; using namespace boost::multi_index; struct employee { int id; std::string name; int ssnumber; employee(int id,const std::string& name,int ssnumber): id(id),name(name),ssnumber(ssnumber){} bool operator<(const employee& e)const{return id<e.id;} }; struct id{}; struct name{}; struct ssnumber{}; typedef multi_index_container< employee, indexed_by< // sort by employee::operator< ordered_unique<tag<id>,BOOST_MULTI_INDEX_MEMBER(employee,int,id) >, // sort by less<string> on name ordered_non_unique<tag<name>,BOOST_MULTI_INDEX_MEMBER(employee,std::stri ng,name) >, // hashed on ssnumber hashed_unique<tag<ssnumber>,BOOST_MULTI_INDEX_MEMBER(employee,int,ssnumb er) > > > employee_set; void main() { employee_set es; typedef employee_set::index<employee_set,ssnumber>::type employee_set_by_ssn; es.insert(employee(1,"aashit",323)); es.insert(employee(3,"chetan",443)); employee_set_by_ssn& ssn_index=es.get<2>(); } --------------------Configuration: MyHash - Win32 Debug-------------------- Compiling... main.cpp f:\practice\multiindex_examples\myhash\main.cpp(53) : error C2039: 'index<class boost::multi_index::multi_index_container<struct employee,struct boost::multi_index::indexed_by<struct boost::multi_index::ordered_unique<struct boost::multi_index::tag< struct id,struct boost::mpl::na,struct boost::mpl::na>,struct boost::multi_index::member_offset<struct employee,int,0>,struct boost::mpl::na>,struct boost::multi_index::ordered_non_unique<struct boost::multi_index::tag<struct name,struct boost::mpl: :na,struct boost::mpl::na>,struct boost::multi_index::member_offset<struct employee,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,4>,struct boost::mpl::na>,struct boost::multi_index::hashed_unique<struct boo st::multi_index::tag<struct ssnumber,struct boost::mpl::na,struct boost::mpl::na>,struct boost::multi_index::member_offset<struct employee,int,20>,struct boost::mpl::na,struct boost::mpl::na>,struct boost::mpl::na,struct boost::mpl::na>,class std::a llocator<struct employee> >,struct ssnumber>' : is not a member of 'multi_index_container<struct employee,struct boost::multi_index::indexed_by<struct boost::multi_index::ordered_unique<struct boost::multi_index::tag<struct id,struct boost::mpl::na, struct boost::mpl::na>,struct boost::multi_index::member_offset<struct employee,int,0>,struct boost::mpl::na>,struct boost::multi_index::ordered_non_unique<struct boost::multi_index::tag<struct name,struct boost::mpl::na,struct boost::mpl::na>,struc t boost::multi_index::member_offset<struct employee,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,4>,struct boost::mpl::na>,struct boost::multi_index::hashed_unique<struct boost::multi_index::tag<struct ssnu mber,struct boost::mpl::na,struct boost::mpl::na>,struct boost::multi_index::member_offset<struct employee,int,20>,struct boost::mpl::na,struct boost::mpl::na>,struct boost::mpl::na,struct boost::mpl::na>,class std::allocator<struct employee> >' f:\practice\multiindex_examples\myhash\main.cpp(53) : error C2146: syntax error : missing ';' before identifier 'employee_set_by_ssn' f:\practice\multiindex_examples\myhash\main.cpp(53) : error C2065: 'employee_set_by_ssn' : undeclared identifier f:\practice\multiindex_examples\myhash\main.cpp(60) : error C2065: 'ssn_index' : undeclared identifier f:\practice\multiindex_examples\myhash\main.cpp(60) : error C2039: 'get' : is not a member of 'multi_index_container<struct employee,struct boost::multi_index::indexed_by<struct boost::multi_index::ordered_unique<struct boost::multi_index::tag<struc t id,struct boost::mpl::na,struct boost::mpl::na>,struct boost::multi_index::member_offset<struct employee,int,0>,struct boost::mpl::na>,struct boost::multi_index::ordered_non_unique<struct boost::multi_index::tag<struct name,struct boost::mpl::na,s truct boost::mpl::na>,struct boost::multi_index::member_offset<struct employee,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,4>,struct boost::mpl::na>,struct boost::multi_index::hashed_unique<struct boost::m ulti_index::tag<struct ssnumber,struct boost::mpl::na,struct boost::mpl::na>,struct boost::multi_index::member_offset<struct employee,int,20>,struct boost::mpl::na,struct boost::mpl::na>,struct boost::mpl::na,struct boost::mpl::na>,class std::alloca tor<struct employee> >' f:\practice\multiindex_examples\myhash\main.cpp(60) : error C2059: syntax error : ')' Error executing cl.exe. main.obj - 6 error(s), 0 warning(s) A a s h i t

2 1

Getting started with Boost: what did you need to know?
by David Abrahams 07 Feb '06

07 Feb '06

I'm giving a talk about getting started with Boost (https://www.cmpevents.com/SDw6/a.asp?option=G&V=3&id=271893) and I thought it would be a good idea to solicit input from those who have recently gone through the process. What do you wish someone had explained to you? With what did you need hand-holding? Based on this feedback I expect to make some improvements to the Boost website, also. Any information you can give me will be much appreciated. Thanks, -- Dave Abrahams Boost Consulting www.boost-consulting.com

18 48

Re: [Boost-users] [BGL] there is no in_edges() function for adjacency_matrix<>
by Dmitry Bufistov 07 Feb '06

07 Feb '06

> > >--- Dmitry Bufistov wrote: > > >>But what about >>boost::adjacency_matrix<boost::directedS>? >> >> > >No, that too has to be >boost::adjacency_matrix<boost::bidirectionalS>. > > Unfortunately this doesn't help( > > > >>Where I can read your answer before I recieve >>e-mail? >> >> > >Try <http://lists.boost.org/Archives/boost-users/> > > > I can see my post's here http://lists.boost.org/boost-users/2006/02/date.php but I can't reply on them( > Cheers! > Cromwell D. Enage > Thanks for the reply. 2 Doug, Now I also can't use template <typename MutableGraph> bool read_graphviz(std::istream& in, MutableGraph& graph, dynamic_properties& dp, std::string const& node_id = "node_id") ; function for the same type. I think because of following declaractions in "adjacency_matrix.hpp" ////////////////////////////////////////////////// template <typename D, typename VP, typename EP, typename GP, typename A> inline typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor add_vertex(adjacency_matrix<D,VP,EP,GP,A>& g) { // UNDER CONSTRUCTION assert(false); return *vertices(g).first; } template <typename D, typename VP, typename EP, typename GP, typename A> inline typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor add_vertex(const VP& vp, adjacency_matrix<D,VP,EP,GP,A>& g) { // UNDER CONSTRUCTION assert(false); return *vertices(g).first; } template <typename D, typename VP, typename EP, typename GP, typename A> inline void remove_vertex(typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor u, adjacency_matrix<D,VP,EP,GP,A>& g) { // UNDER CONSTRUCTION assert(false); } //////////////////////////////////////////////////////////// Will it be also implemented or how I can read my graph? Many thanks for the reply, --dima

2 1

[filesystem] Other reasons for directory_iterator to crash?
by Paul Giaccone 07 Feb '06

07 Feb '06

I am iterating over the subdirectories in a directory. The code I have for this has always worked up until now, but now it is crashing when I create the iterator (ask "What did you change?" if you like; the answer is "If I knew that..."). My question is: what can cause the creation of an iterator to crash? Looking at the documentation, directory_iterator(my_path) throws if !exists(my_path), which is fair enough. This check is already in my code, however, and does not report that the path does not exist. Here is a (revised) segment of my code: const char* source_directory = getenv(MYENVVAR); if ((source_directory == NULL) || (source_directory[0] == '\0')) { return false; } boost::filesystem::path dir_path(source_directory, boost::filesystem::native); boost::filesystem::directory_iterator end_iterator; if (!exists(dir_path)) { return false; } boost::filesystem::directory_iterator dir_iterator(dir_path); //CRASH while (dir_iterator != end_iterator) { //do whatever I do here dir_iterator++; } The program crashes where indicated. The path exists. I've tried replacing the const char* at the beginning with a std::string (then using .c_str() where appropriate) but this makes no difference. So, apart from the path not existing, how else can directory_iterator(dir_path) cause an error? Incidental info: This works fine in Windows (albeit with a different path); this code builds a shared object for use in Shake, meaning I can't use gdb; I am working with gcc 3.2.3 and Boost 1.33.1. Paul

1 1

Cross compiling
by David Charles Todd 07 Feb '06

07 Feb '06

We're using boost, and I'm tasked with getting it working on an embedded board, via BlueCat linux. The BlueCat envorinment is its own little world, meant to make it exceptionally easy to build things for the target. Because of this, they violate a few expectations for a cross-compile environment. One of these is that their compiler looks for headers in the wrong place for boost. What I am trying to figure out is how to tell the boost build process to append a path onto the list of include search paths. setting HDRS, either in the environment or on the bjam invocation line doesn't seem to help. I guess it's not propagating down? Thanks in advance for your advice.

3 2

Re: [Boost-users] stopping a boost::thread
by Frank Hess 07 Feb '06

07 Feb '06

On Monday 06 February 2006 04:37 pm, boost-users-request(a)lists.boost.org wrote: > Date: Mon, 6 Feb 2006 20:28:49 +0000 (UTC) > From: xargon <pankaj.daga(a)gmail.com> > Subject: [Boost-users] stopping a boost::thread > To: boost-users(a)lists.boost.org > Message-ID: <loom.20060206T212759-680(a)post.gmane.org> > Content-Type: text/plain; charset=us-ascii > > Hi everyone, > > I am trying to use the boost multithreading library. I am having a > problem as the join() function for the thread never returns. I am using > a boolean variable to indicate when the thread should stop running. > Here is basically a stub of what I am doing: > > > //........................................ > bool m_RunThread = false; It's because m_RunThread isn't volatile. -- Frank

2 2

serialisation::archive - no test for eof after reading from istream?!
by Oliver.Kowalke＠infineon.com 07 Feb '06

07 Feb '06

Hello, I don't know why in basic_test_iprimitive::load the stream isn't tested for eof or fail after reading from it? In my case I get a string-resize-exception thrown because it is not tested for eof or fail after 'is >> t' (text_iarchive_impl.ipp line 48; size is not initialized and contains a to huge number which causes a resize exception on line 55). This was raised from the stream which was connected to a socket. The peer has closed the socket and the read operation on the socket has returned EOF.

1 0

[Boost][Tuples] Compilation error VC7.1 w/ enum in namespace
by Marc Viala 07 Feb '06

07 Feb '06

Hi, I've just tried to define a boost::tuples::tuple with an enum in a namespace, see code hereafter: \code namespace adv { namespace rbt { enum MyType { Type_1, Type_2 } ; } } boost::tuples::tuple<size_t, adv::rbt::MyType> t ; \endcode But during the compilation step, I've got an error w/ BOOST 1.33.1 and VC7.1 like that: "error MyType not defined". Remark: If the enum is not defined in a namespace, there are no compilation errors. Is there any workaround to deals with this compilation error? Thanks in advance Marc Viala mailto:mviala@acticm.com <mailto:mviala@acticm.com>

2 1

iostreams::indirect_streambuf -> sync_impl returning integer?
by Oliver.Kowalke＠infineon.com 07 Feb '06

07 Feb '06

Hello, wouldn't it be better if indirect_streambuf::sync_impl returns a integer? In device::write I want to indicate that no character can be written to the external source via returning EOF (external device == socket -> peer has closed socket) instead throwing an exception. Regards, Oliver

1 0

[BGL] Problem implementing dijkstra
by Thomas Gelzhaeuser 07 Feb '06

07 Feb '06

Hello everyone. I've got a small problem when trying to use the dijkstra-shortest-path algorithm. The error reported by the compiler is: 'void put<void*,void*>(T *,ptrdiff_t,const V &)' : cannot convert parameter 2 from 'void *' to 'ptrdiff_t' Can anyone give me a hint what I am missing? Thanks. Thomas. I made up a small example with the compiler error I receive (VS2005) >>>>>>>>> problem.cpp #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/properties.hpp> #include <vector> //defining vertex properties typedef boost::property<boost::vertex_name_t, std::string> VName; typedef boost::property<boost::vertex_index_t, int, VName> VIndex; typedef boost::property<boost::vertex_index_t, int, VIndex> VertexProperties; //defining edge properties typedef boost::property<boost::edge_weight_t, int> EdgeProperties; typedef boost::adjacency_list <boost::listS, boost::listS, boost::directedS, VertexProperties, EdgeProperties> PespGraph_t; typedef boost::graph_traits < PespGraph_t >::vertex_descriptor Pesp_Vertex; typedef boost::graph_traits < PespGraph_t >::edge_descriptor Pesp_Edge; int main(int argc, char* argv[]) { PespGraph_t g; Pesp_Vertex v1, v2; v1 = boost::add_vertex(g); boost::put(boost::vertex_name, g, v1, "Vertex 1"); boost::put(boost::vertex_index, g, v1, 1); v2 = boost::add_vertex(g); boost::put(boost::vertex_name, g, v2, "Vertex 2"); boost::put(boost::vertex_index, g, v2, 2); Pesp_Edge e; bool inserted; tie(e,inserted) = boost::add_edge(v1, v2, g); boost::put(boost::edge_weight, g, e, 10); std::vector<Pesp_Vertex> pred(boost::num_vertices(g)); std::vector<int> dist(boost::num_vertices(g)); dijkstra_shortest_paths(g, v1, boost::predecessor_map(&pred[0])); return 0; } >>>>>>>>> compiler output 1>------ Build started: Project: playground, Configuration: Debug Win32 ------ 1>Compiling... 1>problem.cpp 1>c:\boost\include\boost-1_33_1\boost\graph\dijkstra_shortest_paths.hpp(251) : error C2664: 'void put<void*,void*>(T *,ptrdiff_t,const V &)' : cannot convert parameter 2 from 'void *' to 'ptrdiff_t' 1> with 1> [ 1> T=void *, 1> V=void * 1> ] 1> There is no context in which this conversion is possible 1> c:\boost\include\boost-1_33_1\boost\graph\dijkstra_shortest_paths.hpp(291) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths<VertexListGraph,boost::dijkstra_visitor<>,void**__w64 ,DistanceMap,WeightMap,IndexMap,std::less<_Ty>,boost::closed_plus<T>,int,int,ColorMap>(const VertexListGraph &,void *,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,DijkstraVisitor,ColorMap)' being compiled 1> with 1> [ 1> VertexListGraph=PespGraph_t, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<int,std::allocator<int>>,boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>,int,int &>, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>, 1> _Ty=D, 1> T=D, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &>, 1> PredecessorMap=void **__w64 , 1> Compare=std::less<D>, 1> Combine=boost::closed_plus<D>, 1> DistInf=int, 1> DistZero=int, 1> DijkstraVisitor=boost::dijkstra_visitor<> 1> ] 1> c:\boost\include\boost-1_33_1\boost\graph\dijkstra_shortest_paths.hpp(321) : see reference to function template instantiation 'void boost::detail::dijkstra_dispatch2<VertexListGraph,boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>,WeightMap,IndexMap,Params,boost::iterator_property_map<std::_Vector _iterator<_Ty,_Alloc>,IndexMap,boost::default_color_type,boost::default_color_type &>>(const VertexListGraph &,void *,DistanceMap,WeightMap,IndexMap,const Params &,ColorMap)' being compiled 1> with 1> [ 1> VertexListGraph=PespGraph_t, 1> RandomAccessIterator=std::_Vector_iterator<int,std::allocator<int>>, 1> IndexMap=boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>, 1> T=int, 1> R=int &, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> Params=boost::bgl_named_params<void **__w64 ,boost::vertex_predecessor_t,boost::no_property>, 1> _Ty=boost::default_color_type, 1> _Alloc=std::allocator<boost::default_color_type>, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<int,std::allocator<int>>,boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>,int,int &>, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &> 1> ] 1> c:\boost\include\boost-1_33_1\boost\graph\dijkstra_shortest_paths.hpp(341) : see reference to function template instantiation 'void boost::detail::dijkstra_dispatch1<VertexListGraph,boost::detail::error_property_not_found,boost::adj_list_edge_property_map<Directed,Value,Ref,Vertex,Property,Tag>,boost::adj_list_vertex_property_map<Graph,ValueType,Reference,boost::vertex_index_t>,boost::bgl_named_params<T,boost::vertex_predecessor_t,Base>,boost::detail::error_property_not_found>(const VertexListGraph &,void *,DistanceMap,WeightMap,IndexMap,const Params &,ColorMap)' being compiled 1> with 1> [ 1> VertexListGraph=PespGraph_t, 1> Directed=boost::directed_tag, 1> Value=int, 1> Ref=const int &, 1> Vertex=void *, 1> Property=const boost::property<boost::edge_weight_t,int>, 1> Tag=boost::edge_weight_t, 1> Graph=Graph, 1> ValueType=int, 1> Reference=const int &, 1> T=void **__w64 , 1> Base=boost::no_property, 1> DistanceMap=boost::detail::error_property_not_found, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>, 1> Params=boost::bgl_named_params<void **__w64 ,boost::vertex_predecessor_t,boost::no_property>, 1> ColorMap=boost::detail::error_property_not_found 1> ] 1> c:\dokumente und einstellungen\gelzi.mediber\eigene dateien\visual studio 2005\projects\playground\playground.cpp(43) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths<PespGraph_t,void**__w64 ,boost::vertex_predecessor_t,boost::no_property>(const VertexListGraph &,void *,const boost::bgl_named_params<T,Tag,Base> &)' being compiled 1> with 1> [ 1> VertexListGraph=PespGraph_t, 1> T=void **__w64 , 1> Tag=boost::vertex_predecessor_t, 1> Base=boost::no_property 1> ] 1>playground - 1 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========

1 0

Boost.MultiArray bounds checking
by Frank Hess 07 Feb '06

07 Feb '06

I'm using boost 1.32, and boost::multi_array doesn't seem to provide any bounds-checked access. I'm curious if there are any plans to add a bounds-checked at() member function to complement the [] operator? Or, is there some reason it is impractical? -- Frank

3 3

Re: [Boost-users] [Review] Shmem Library
by Fred Bertsch 06 Feb '06

06 Feb '06

shmemdoc-0.9.zip and shmemlib-0.9.zip are the most recent versions of the library and documentation. They are the ones getting reviewed. -Fred > > Both documentation and the library itself can be downloaded here: > > http://tinyurl.com/9t5qy > > Which file needs to be dounloaded. There are lots of'em there. > > Gennadiy

1 0

[BGL] there is no in_edges() function for adjacency_matrix<>
by Dmitry Bufistov 06 Feb '06

06 Feb '06

Hi, A huge disappointment again came to me today. I used boost::adjacency<boost::directedS> class for representation of simple Petri net. I was trying to define the following function ////////////////////////////////////////// bool if_enabled(transition_descriptor_t tr, graph_t net) { assert((net[tr].m_node_type == TRANSITION) && "if_enabled called with non transition node"); BGL_FORALL_INEDGES_T(tr, ed, net, graph_t) { if (net[boost::source(ed, net)].m_tokens_number < net[ed].m_weight) return false; } return true; } ////////////////////////////////////////////////////////// But I failed because of lack of boost::in_edges() function specialization for type that I've chosen. Am I doing something wrong? Any ideas how to implement my function in resonable way would be greatly appreciated. Note: all works fine with "adjacency_list<vecS, vecS, bidirecrionalS>" Many thanks in advance, --dima

3 2

Boost thread library wrapper
by boostguy＠kapiladhanvi.com 06 Feb '06

06 Feb '06

Hi all, I am trying to write a generalized object oriented wrapper for thread library implementation of Boost. Boost threads take a function name as an argument when creting a thread. I would like create a warpper in C++ which would in some respects mimic JAVA and have a runnable interface which an threaded application would implement. This code would explain what I want to do.. but my question is how can I do it or if there are already some wrappers out there that I can use for boost threads? Sample code : ----- MyThread.h ----- #include "myRunnable.h" #include <boost/thread/thread.hpp> class MyThread { private: Runnable& task; boost::thread thr; public: MyThread( Runnable& threadTask ) : task( threadTask ), thr( &task.run) // how do I do this ? { } }; --------------------------- Thanks, Dhanvi

3 2

stopping a boost::thread
by xargon 06 Feb '06

06 Feb '06

Hi everyone, I am trying to use the boost multithreading library. I am having a problem as the join() function for the thread never returns. I am using a boolean variable to indicate when the thread should stop running. Here is basically a stub of what I am doing: //........................................ bool m_RunThread = false; scoped_ptr myThread; //....................................... void MyObject::StartThread() { m_RunThread = true; myThread.reset(new boost::thread(boost::bind (&MyObject::MyThreadFunc, this))); } void MyObject::StopThread() { m_RunThread = false; myThread.join(); // this function never returns! ... Never gets here.... } void MyObject::MyThreadFunc() { while (m_RunThread) { // do something } } However, the join() function in StopThread never returns. I think that using a variable to synchronize this is probably not a good idea. Any thoughts and suggestions? Cheers, K

1 0

[Review] Shmem Library
by Fred Bertsch 06 Feb '06

06 Feb '06

Hello everyone, The review of the proposed Boost Shmem library written by Ion Gaztañaga starts today (February 6th, 2006) and ends after 10 days (February 16, 2006). Documentation for the library can be found online here: http://tinyurl.com/e2os3 Both documentation and the library itself can be downloaded here: http://tinyurl.com/9t5qy --------------------------------------------------- About the library: The Shmem Library simplifies the use of shared memory and provides some STL compatible allocators that allow shared memory STL container placement. It also offers helper classes, such as offset pointers, process shared mutexes, condition variables, and named semaphores. Library users can apply all STL algorithms and utilities with created shared memory objects. Shmem also wants to present a portable implementation, unifying UNIX and Windows shared memory object creation, providing simple wrapper classes. Shmem offers the following to the user: - Portable synchronization primitives for shared memory, including shared mutexes and shared condition variables. - Dynamic allocation of portions of a shared memory segment. - Named allocation in shared memory. Shmem can create objects in shared memory and associate it with a c-string offering a similar mechanism to a named new/delete. Created object can be found by other processes using Shmem framework. - Offset pointers that can be safely placed in shared memory to point to another object of the same shared memory segment even if the memory is mapped to a different address. - STL compatible shared memory allocators so that STL containers can be placed in shared memory. Shmem also offers a pooled node allocator to save and optimize shared memory allocation in node containers. - STL compatible containers for systems with STL implementations that cannot deal with shared memory. The user can map shared memory to different addresses and use STL compatible containers and algorithms. Useful to store common data or implement shared memory databases. These containers also show how STL compatible containers can make use of shared memory STL compatible allocators to place such containers in the shared memory. Shmem also offers the basic_string pseudo-container to use full-powered C++ strings in shared memory. --------------------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Fred Bertsch Review Manager

2 1

[BGL] Converting my graph to BGL.
by Robert Bigaignon 06 Feb '06

06 Feb '06

Hi all, I have been trying to convert an existing graph implementation to BGL. I have followed this example http://www.boost.org/libs/graph/doc/leda_conversion.html and implemented the incidence_graph, adjacency_graph and vertex_list_graph concepts. The following concept check compiles : boost::function_requires< boost::GraphConcept<graph_t> >(); boost::function_requires< boost::IncidenceGraphConcept<graph_t> >(); boost::function_requires< boost::AdjacencyGraphConcept<graph_t> >(); boost::function_requires< boost::VertexListGraphConcept<graph_t> >(); and the basic functions for these concepts seems to work properly (out_degree(), num_vertices(), etc..). But when I try to call an algorithm, like for instance articulation_points() (which takes a graph which model must be of Vertex List Graph and Incidence Graph), compilation fails: /usr/include/boost/graph/biconnected_components.hpp: In function 'OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = vcsn::Graph<vcsn::labels_are_series, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, bool, vcsn::algebra::polynom<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, bool>, char, vcsn::NoTag, vcsn::geometry>, OutputIterator = std::back_insert_iterator<std::vector<vcsn::handler<vcsn::state_h>, std::allocator<vcsn::handler<vcsn::state_h> > > >]': test2.cc:77: instantiated from here /usr/include/boost/graph/biconnected_components.hpp:246: error: no matching function for call to 'get(boost::vertex_index_t, const vcsn::Graph<vcsn::labels_are_series, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, bool, vcsn::algebra::polynom<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, bool>, char, vcsn::NoTag, vcsn::geometry>&)' Compilation exited abnormally with code 1 at Fri Feb 3 17:38:31 What did I forgot to do ? -- Robert

2 1

Boost.Statechart: Cannot compile example with GCC 4.0.2?
by Bardur Arantsson 06 Feb '06

06 Feb '06

Hi all, I'm trying to compile the StopWatch.cpp example on SuSE10 and I'm getting a whole bunch of errors (or at least what gcc thinks are errors): $ gcc --version gcc (GCC) 4.0.2 20050901 (prerelease) (SUSE Linux) Copyright (C) 2005 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. $ g++ StopWatch.cpp /usr/include/c++/4.0.2/bits/stl_tree.h: In member function âvoid std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::destroy_node(std::_Rb_tree_node<_Val>*) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â: /usr/include/c++/4.0.2/bits/stl_tree.h:1096: instantiated from âvoid std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_erase(std::_Rb_tree_node<_Val>*) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â /usr/include/c++/4.0.2/bits/stl_tree.h:570: instantiated from âstd::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::~_Rb_tree() [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â /usr/include/c++/4.0.2/bits/stl_map.h:92: instantiated from âboost::statechart::state_machine<MostDerived, InitialState, Allocator, ExceptionTranslator>::state_machine() [with MostDerived = StopWatch, InitialState = Active, Allocator = std::allocator<void>, ExceptionTranslator = boost::statechart::null_exception_translator]â StopWatch.cpp:74: instantiated from here /usr/include/c++/4.0.2/bits/stl_tree.h:389: error: no matching function for call to âstd::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>::destroy(std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >*)â /usr/include/c++/4.0.2/ext/new_allocator.h:109: note: candidates are: void __gnu_cxx::new_allocator<_Tp>::destroy(_Tp*) [with _Tp = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*] /usr/include/c++/4.0.2/bits/stl_tree.h: In member function âstd::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_create_node(const _Val&) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â: /usr/include/c++/4.0.2/bits/stl_tree.h:793: instantiated from âtypename std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, const _Val&) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â /usr/include/c++/4.0.2/bits/stl_tree.h:902: instantiated from âtypename std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::insert_unique(std::_Rb_tree_iterator<_Val>, const _Val&) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Val = std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >, _KeyOfValue = std::_Select1st<std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â /usr/include/c++/4.0.2/bits/stl_map.h:384: instantiated from âtypename std::_Rb_tree<_Key, std::pair<const _Key, _Tp>, std::_Select1st<std::pair<const _Key, _Tp> >, _Compare, _Alloc>::iterator std::map<_Key, _Tp, _Compare, _Alloc>::insert(typename std::_Rb_tree<_Key, std::pair<const _Key, _Tp>, std::_Select1st<std::pair<const _Key, _Tp> >, _Compare, _Alloc>::iterator, const std::pair<const _Key, _Tp>&) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Tp = std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â /usr/include/c++/4.0.2/bits/stl_map.h:339: instantiated from â_Tp& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const _Key&) [with _Key = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*, _Tp = std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > >, _Compare = std::less<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>, _Alloc = std::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>]â ../../../../boost/statechart/state_machine.hpp:576: instantiated from âvoid boost::statechart::state_machine<MostDerived, InitialState, Allocator, ExceptionTranslator>::defer_event(const boost::statechart::event_base&, const boost::statechart::detail::state_base<Allocator, boost::statechart::detail::rtti_policy>*) [with MostDerived = StopWatch, InitialState = Active, Allocator = std::allocator<void>, ExceptionTranslator = boost::statechart::null_exception_translator]â ../../../../boost/statechart/simple_state.hpp:495: instantiated from âboost::statechart::detail::reaction_result boost::statechart::simple_state<MostDerived, Context, InnerInitial, historyMode>::react_impl(const typename Context::inner_context_type::event_base_type&, typename Context::inner_context_type::rtti_policy_type::id_type) [with MostDerived = Stopped, Context = Active, InnerInitial = boost::mpl::list<mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::statechart::history_mode historyMode = has_no_history]â StopWatch.cpp:188: instantiated from here /usr/include/c++/4.0.2/bits/stl_tree.h:367: error: no matching function for call to âstd::allocator<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*>::construct(std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >*, const std::pair<const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>* const, std::list<boost::intrusive_ptr<const boost::statechart::event_base>, std::allocator<boost::intrusive_ptr<const boost::statechart::event_base> > > >&)â /usr/include/c++/4.0.2/ext/new_allocator.h:105: note: candidates are: void __gnu_cxx::new_allocator<_Tp>::construct(_Tp*, const _Tp&) [with _Tp = const boost::statechart::detail::state_base<std::allocator<void>, boost::statechart::detail::rtti_policy>*] ---- end of output ---- Does anyone have any clues to impart as to what's going on? -- Bardur Arantsson <bardur.arantsson(a)gmail.com> Bardur Arantsson <bardur(a)scientician.net> Bardur Arantsson <bardur(a)imada.sdu.dk>

5 4

Re: [Boost-users] Getting started with Boost: what did you need to know?
by Hickman, Greg 06 Feb '06

06 Feb '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Foster Brereton > Sent: Friday, February 03, 2006 5:20 PM > I have found the mailing list archives proved helpful, but > took an inordinate amount of time to search through. Is it > possible to take threads in the mailing lists that look > something like this: > - A: I have problem XYZ > - B-Z: Oh, you need to do this > - A: That fixed it, thanks! > and convert them to a FAQ or additional documentation? How about encouraging Boost library developers to maintain library-specific FAQs along with their respective library documentation? -Greg Hickman

3 12

Re: [Boost-users] [BGL] there is no in_edges() function for adjacency_matrix<>
by Dmitry Bufistov 06 Feb '06

06 Feb '06

> > >Dmitry Bufistov <dmitry(a)lsi.upc.edu> writes: > > > >>Hi, >>A huge disappointment again came to me today. I used >>boost::adjacency<boost::directedS> class for representation of simple >>Petri net. I was trying to define the following function >>////////////////////////////////////////// >>bool if_enabled(transition_descriptor_t tr, graph_t net) { >> assert((net[tr].m_node_type == TRANSITION) && >>"if_enabled called with non transition node"); >> >> BGL_FORALL_INEDGES_T(tr, ed, net, graph_t) >> { >> if (net[boost::source(ed, net)].m_tokens_number < >>net[ed].m_weight) return false; >> } >> return true; >> } >> >>////////////////////////////////////////////////////////// >>But I failed because of lack of boost::in_edges() function >>specialization for type that I've chosen. >>Am I doing something wrong? >>Any ideas how to implement my function in resonable way would be greatly >>appreciated. >>Note: all works fine with "adjacency_list<vecS, vecS, bidirecrionalS>" >> >> > >By /definition/, BidirectionalGraph is a graph where you can enumerate >the incoming edges for any node. Unless you specify bidirectionalS, >an adjacency list won't be a BidirectionalGraph, and you can't use >in_edges. So everything is working just as I would expect it to. > > > But what about boost::adjacency_matrix<boost::directedS> ? Is there any way to iterate over all incoming edges? Where I can read your answer before I recieve e-mail? Time is very important ) Thank you, --dima

2 1

<smart_ptr> scoped_ptr with an ownership flag?
by Guy Peleg 06 Feb '06

06 Feb '06

Suppose that class A that accepts a pointer to class B. An instance of A class can own the pointer or it can share it with some other A instances. The knowledge of whether or not the A instance should own the pointer is something that depends by the one that construct the instance. Shared_ptr seems as a good candidate for this problem but what if the pointer passed to the A instance might come from a legacy code that works with raw-pointers ? I think that a kind of scoped_ptr with a ownership flag will help here __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

[boost-users] [parameter] Error using positional arguments
by Cromwell Enage 06 Feb '06

06 Feb '06

In one of my projects the header files contain code like the following: #ifndef BOOST_PARAMETER_RANDOM_EXAMPLE_HPP #define BOOST_PARAMETER_RANDOM_EXAMPLE_HPP #include <boost/type_traits/remove_const.hpp> #include <boost/random/uniform_int.hpp> #include <boost/random/variate_generator.hpp> #include <boost/parameter.hpp> namespace example { BOOST_PARAMETER_KEYWORD(tag, rng_engine) BOOST_PARAMETER_KEYWORD(tag, min) BOOST_PARAMETER_KEYWORD(tag, max) BOOST_PARAMETER_KEYWORD(tag, factor) BOOST_PARAMETER_KEYWORD(tag, addend) struct foo_parameters : boost::parameter::parameters< boost::parameter::required<tag::rng_engine> , boost::parameter::required<tag::min> , boost::parameter::required<tag::max> , boost::parameter::optional<tag::factor> , boost::parameter::optional<tag::addend> > { }; BOOST_PARAMETER_FUN(unsigned int, foo, 3, 5, foo_parameters) { typedef typename boost::remove_const< typename boost::parameter::binding< Params , tag::rng_engine >::type >::type RNGEngine; typedef boost::uniform_int<unsigned int> RNGDist; typedef boost::variate_generator<RNGEngine, RNGDist> RNG; RNGEngine rng_engine = p[example::rng_engine]; RNG rng(rng_engine, RNGDist(p[min], p[max])); return rng() * p[factor | 10] + p[addend | 5]; } } // namespace test #endif // BOOST_PARAMETER_RANDOM_EXAMPLE_HPP The following snippet would then exemplify typical user code: #include <iostream> #include <boost/ref.hpp> #include <boost/random/mersenne_twister.hpp> #include "boost_parameter_random_example.hpp" int main() { boost::mt19937 rng; std::cout << "Named: " << example::foo( example::rng_engine = rng , example::min = 12 , example::max = 24 ) << std::endl; // Ok std::cout << "Unnamed: "; std::cout << example::foo(rng, 12, 24); // error std::cout << std::endl; return 0; } MinGW reports: 'static const T& boost::random::detail::ptr_helper<T&>::ref(const T&) [with T = const boost::mt19937]' and 'static T& boost::random::detail::ptr_helper<T&>::ref(T&) [with T = const boost::mt19937]' cannot be overloaded When I wrap boost::ref around rng, the program runs fine. I'm curious as to why I get this error only when specifying positional arguments. Have I run afoul of something fundamental, such as the forwarding problem? Cromwell D. Enage __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 5

Test of e-mail client - please ignore.
by Brian Allison 06 Feb '06

06 Feb '06

I had, but our mail server munges things, and I'm not always aware of the ways in which they're munged. For better or for worse (and yes, I have a NSHO on the matter :/ ) our system admin functionalities are almost black-boxed from the rest of the geeks here. [I don't mention it for discussion, but for explanation.] Well - it should be taken care of now. If it weren't for some of our rather odd mail message requirements, I'd just use the mail command. ObNostalgia: Oh, for the BITNET days... David Abrahams wrote: >Brian Allison writes: > > > >>The test below this line should be 'quoted'. Hopefully the mail gate won't wreck it. >> >>Brian Allison wrote: >> >> Testing quoting other messages... >> >> > >Try turning off HTML messages in your client. > > >

1 0

[signals] calling delete member on connect?
by Evan Carew 06 Feb '06

06 Feb '06

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Ok, am I wrong in assuming this shouldn't be happening on my linux box? [gcc 4.0.2][boost 103200] First the test program, then the output: #include <iostream> #include <cstdlib> #include <boost/signals.hpp> using namespace std; using namespace boost; class tst_out{ public: void operator()() const{ cout << "test out data1" << endl;} ~tst_out(){ cout << "Called del for tst_out" << endl;} }; class tst_out2{ public: void operator()() const{ cout << "test out 2" << endl;} ~tst_out2(){ cout << "Called del for tst_out2" << endl;} }; signal<void ()> sig; int main(int argc, char *argv[]) { tst_out tst1; tst_out2 tst2; sig.connect(tst1); sig.connect(tst2); sig(); cout << "exiting program" << endl; return EXIT_SUCCESS; } Now the output: Called del for tst_out Called del for tst_out Called del for tst_out Called del for tst_out Called del for tst_out Called del for tst_out Called del for tst_out Called del for tst_out2 Called del for tst_out2 Called del for tst_out2 Called del for tst_out2 Called del for tst_out2 Called del for tst_out2 Called del for tst_out2 test out data1 test out 2 exiting program Called del for tst_out2 Called del for tst_out Called del for tst_out Called del for tst_out2 -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFD5RS4pxCQXwV2bJARAkBzAJ9mSmfH79X/IaOlmlquUMk9Ww/dAgCdH9xz /BaVLQC9shMvnYxBPMv13DU= =jU/r -----END PGP SIGNATURE-----

2 5

boost python (compiling an extension)
by Themistoklis Bourdenas 06 Feb '06

06 Feb '06

I'm trying to build a simple python extension similar to the one in boost.python tutorial. I really haven't yet understood the process of creating an extension for python using boost. I have to build boost.python either using bjam or loading its .sln in VS (I've used the second method). Then I write some simple code like that in the tutorial exporting a simple function and then what? I guess I have to build a .dll file for python to link to. I'm building a dynamic link library project in VS8 write the appropriate code and that successfully creates a dll file. However when importing my module python returns a runtime error: ImportError: dynamic module does not define init function (inittest_boost) What is the .pyd created in the tutorial? How is it created? I'm trying to avoid bjam as and use just VS project files. Is that possible? PS - I know I should send this message in c++-sig list but for three days now it can not confirm my subscription for some reason.

2 3

[parameters] Runtime enumeration of parameter list
by Neil Hunt 05 Feb '06

05 Feb '06

>From a post about using strings as an indexing mechanism: "David Abrahams" <dave(a)boost-consulting.com> wrote in message news:ubqzqz3sw.fsf@boost-consulting.com... <snip> >> Since all are known at compile time I'm sure it must be easy to do >> this. I'm pretty sure when someone shows me the obvious solution I >> will be very embarrassed, but until then I can do this with a >> std::map at runtime, but not at compile time. > I'm pretty sure the parameter library is a good -- if not perfect -- > match for your problem. Since I've pointed at it twice now, if you're > not embarrassed yet, I'll stop pushing ;-) I too am quite interested in this process of compile time indexing. Let me think out loud (visibly?). Question at the bottom. I have often used this pattern of access for a vector of a known size (contrived example): enum TabIndices { PERSON_TAB, ADDRESS_TAB, EMPLOYER_TAB, TAB_COUNT }; Window windows[TAB_COUNT]; ... display_window( TabIndices tab_index ) { windows[tab_index].display(); for( int i = 0; i < (int)TAB_COUNT; ++i ) { if( i != (int)tab_index ) windows[i].hide(); } } ... display_window( PERSON_TAB ); Let me have go at converting this to use the parameter keyword system for indexing by using an ArgumentPack. BOOST_PARAMETER_KEYWORD(tag, PERSON_WINDOW) BOOST_PARAMETER_KEYWORD(tag, ADDRESS_WINDOW) BOOST_PARAMETER_KEYWORD(tag, EMPLOYER_WINDOW)XXXX windows( ( PERSON_WINDOW = Window(), ADDRESS_WINDOW = Window(), EMPLOYER_WINDOW = Window() ) ); ... template<class keyword> display_window( keyword tab_index) { windows[tab_index].display(); for( YYYY ) { if( *iterator != tab_index ) windows[iterator].hide(); } } ... display_window( PERSON_TAB ); My two immediate problems are how to declare the type of the ArgumentPack that would actually hold the window objects. (XXXX) And secondly, how to iterate over the windows at runtime. (YYYY). I guess the main thrust of the question is "Does the parameters library support runtime enumeration?" or should I be looking at MPL? Neil

4 7

[date_time] How to create a time_zone_ptr from the machine settings?
by Christian Henning 05 Feb '06

05 Feb '06

Hi there, I would like to know how to create a local_date_time object. The only thing I have is a UTC time object. How do I create a time_zone_ptr from the machine settings. Thanks ahead, Christian

2 1

Crossbuild, on linux using mingw32 for win32
by Rafał Maj Raf256 05 Feb '06

05 Feb '06

What is the best way to crossbuild on linux, using mingw32, to win32? I dont see no description about such configuration on http://boost.org/more/getting_started.html mingw executable is: i586-mingw32msvc-g++

2 3

[Review] Fixed strings library
by Hartmut Kaiser 05 Feb '06

05 Feb '06

Hi all, the formal review period of the Fixed strings library written by Reece Dunn ends today. Since there was complete consent with regard to this library among all submitted reviews, it is straight forward for me to make the final decision. The library is rejected and will not be included into Boost at this point in time. The main points listed during review were: - Do we need a fixed_string library at all, is it worth the overhead? - Insufficient/confusing documentation . insufficient description of general design, design rationales and motivations . it says more about implementation details rather then the public interface . missing or insufficient documentation of parts of the library - The overall architecture of the implementation is too complicated and needs to be reworked - Missing interface for construction/interaction with std::string's - Unclear benefit to have the strings truncated to avoid overflows - Missing performance comparison with std::string and other alternatives - Compilation problems with the library as submitted for review Reece already expressed his interest to resubmit the library for review again, after he has been able to address the mention issues. I'ld like to thank Reece for submitting this library and all reviewers for their time they invested in preparing the reviews. Regards Hartmut Review Manager

1 0

Re: [Boost-users] boost::pp application
by Marco Correia 05 Feb '06

05 Feb '06

Thanks! Today I managed to get a little bit further, let me tell you where I am. First I aliased every symbol of the alphabet as an integer. #define A 1 #define B 2 ... Then I guess there are two options: 1) #define NOT_EQ(s,E1,E2) \ BOOST_PP_NOT_EQUAL(E1,E2) #define REMOVE_ALL(Elem,Seq) \ BOOST_PP_SEQ_FILTER(NOT_EQ, Elem, Seq) #define REMOVE_ELEM(s,Seq,Elem) REMOVE_ALL(Elem,Seq)(Elem) #define REMOVE_DUPLICATES(Seq) \ BOOST_PP_SEQ_FOLD_LEFT(REMOVE_ELEM, Seq, Seq) This starts with the full sequence, and for each element, removes all occurences and add it in the end. 2) The other option is similar but instead of starting with the full sequence and remove each element, it starts with an empty sequence and adds each element if it is not already there (kind of insertion sort but without sorting). I think the solution 1) is faster, but I confess it's only an intuition :) Do you see any other way, more efficient than this? Thanks a lot for trying to help! Marco On Friday 03 February 2006 22:48, you wrote: > Hi Marco, > > I just say this post now, so I'll get back to it after I get home from > work. I the pp-lib can help you with this. > > Regards, > Paul Mensonides > > > -----Original Message----- > > From: boost-users-bounces(a)lists.boost.org > > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > > Marco Correia > > > > I would like to ask if there is a way boost::preprocessor may > > be used to solve the following problem: > > > > The problem is to define a macro that expands to the > > concatenation of their arguments, without duplicates. The > > arguments are symbols belonging to a known alphabet. -- Marco Correia <mvc(a)netcabo.pt>

2 2

<cassert> in the boost libraries
by Joerg Ruedenauer 05 Feb '06

05 Feb '06

Hello, we use our own assertion handler and assert macro in our code, defined in a header which gets included at the end of our precompiled header file. Unfortunately, many boost libraries undermine this because they include the cassert header, which redefines the assert macro. Currently we work around this by putting some boost libraries in the precompiled header and including our own assert header again in each source file which includes boost headers, but this is a clumsy and error-prone solution. Boost already nominately provides a solution through BOOST_ENABLE_ASSERT_HANDLER, but it's just not used consequently throughout the libraries. Could the authors of the libraries (or the reviewers) please grep through the code and change the cassert (or assert.h) includes to boost/assert.hpp, and consequently, change assert(...) to BOOST_ASSERT(...)? I've found the inclusion particularly often in the serialization, graph, iostream and random libraries, but also in regex, signals, ptr_container and many other headers. Regards, Joerg Ruedenauer

3 4

Re: [Boost-users] Boost-users Digest, Vol 807, Issue 1
by Drumheller, Michael 05 Feb '06

05 Feb '06

>>> ------------------------------ >>> >>> Message: 9 >>> Date: Sat, 04 Feb 2006 10:30:25 +0000 >>> From: Jim Douglas <jim(a)dramatec.co.uk> >>> Subject: Re: [Boost-users] Getting started with Boost: what did you >>> need to know? >>> To: boost-users(a)lists.boost.org >>> Message-ID: <ds1vo5$ue6$1(a)sea.gmane.org> >>> Content-Type: text/plain; charset=ISO-8859-1; format=flowed >>> >>> Drumheller, Michael wrote: >>> > Main stumbling point for me was bjam. It's not so much >>> of a problem for <..snip...> >>> Perhaps people don't complain because most only use bjam it >>> to build the >>> libraries (archives and shared objects) and then (like me) they use >>> 'make' to build the projects that incorporate Boost. I >>> would guess that you are in the minority if you write in-house extensions to >>> the Boost library. Sorry about that, I was being very unclear. I did not mean in-house extensions to the Boost library, I meant C++ extensions to Python, using Boost.Python. The Boost.Python tutorial contains an extremely ominous warning, in a big yellow box, here: <<http://www.boost.org/libs/python/doc/tutorial/doc/html/python/hello.ht ml>>, It says, in so many words, that you're a masochist if you try to build your Boost.Python extensions with anything but bjam. >>> Having said that, I can appreciate that bjam is a *very* >>> powerful tool and has many advantages over make, but I just can't find >>> the time to study the docs enough to make a trial switch. >>> >>> Jim Don't get me wrong, I can't stand the error-prone, undebuggable dinosaur that is make, and I would never advocate it for a new project. I too can appreciate that bjam seems very powerful. And elegant, in its own way. It also seems very fast. But with a monster learning curve. That's not necessarily a downer--you don't get something for nothing, and I actually *like* learning new tools, so I was happy to see the "Abandon hope, all ye who <would use a tool other than bjam>" warning on the gates of Boost.Python (yellow box above), because I thought, well, there's my motivation to learn bjam--maybe bjam will be my new default build tool(!) I read all the documents I could find, but man, it's like learning Turkish or Vietnamese or something. You need a teacher, and there are just zero teachers in my org. Alas, the bjam files in Boost themselves (those that are used to build the Boost libraries) are (or at least seem) *extremely* sohpisticated, and are woefully uncommented--in fact, absolutely *un*commented if you define a comment as something with tutorial value, e.g., "Here is an excellent example of a rule to do such-and-such." Personally, I was unable to get past the knee of the curve given my other commitments. Again, maybe it's just me. I'm curious: How many Boost users out there use bjam as the default build tool for their day-to-day programming? I recall hearing at one time that there was a movement afoot, at one time at least, to switch the Boost build process over to using scons. Any truth to that? Thanks, MD

2 1

Re: [Boost-users] <cassert> in the boost libraries
by Merrill Cornish 05 Feb '06

05 Feb '06

Include files such as <cassert> usually have a guard involving the #define of a specific symbol to prevent then from being included twice. Once you have defined your own version of assert(), perhaps you could #define the <cassert> guard symbol as a way of preventing the local <cassert> from being included. This would work, of course, only if your version of <cassert> would work for Boost also. Merrill

2 1

Problems Compiling in VS 2005
by Sergey Tiraspolsky 05 Feb '06

05 Feb '06

I'm attempting to upgrade my solution to 2005 from 2003 and it compiles fine until it gets to boost then I get errors. Here's the error: Error 889 error C2665: 'boost::python::detail::make_getter' : none of the 3 overloads could convert all the argument types ...\boost-1.32.0\include\boost\python\data_members.hpp 277 I thought it may be related to having an older version of Boost so I upgraded to 1.33.1 and am still having the same error: boost-1.33.1\include\boost\python\data_members.hpp(277) : error C2665: 'boost::python::detail::make_getter' : none of the 3 overloads could convert all the argument types Any ideas? --------------------------------- Brings words and photos together (easily) with PhotoMail - it's free and works with Yahoo! Mail.

3 2

please help with cross building linux->win32 using mingw
by Rafał Maj Raf256 04 Feb '06

04 Feb '06

Hi, I have had a terrible time when trying to crossbuild. Is it really not possible with boost? I want to build, on linux, boost for win32 programs (to crossbuild programs using boost), using mingw g++ compiler. It worked fine with other libraries, usually just CXX=i586-mingw-msvc-g++ && ./configure --prefix=/usr/local/win32/ && make install but it do not work with boost / bjam :-/ I even got wine installed and installed MinGW 5 and MSys there, the MSys didnt worked (probably wine windows emulator fault), as for MinGW bjam have problems with some shell commands like it tries to call MkDir1, raf256@lore:~/.wine/drive_c/boost_1_33_1$ wine ../bjam/bjam.exe Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (and if you don't know what ICU is then you probably don't need it). ****************************************************** Building Boost.Iostreams with bzip2 support disabled. To enable bzip2, consult the Boost.Iostreams documentation ****************************************************** ****************************************************** Building Boost.Iostreams with zlib and gzip support disabled. To enable zlib and gzip, consult the Boost.Iostreams documentation ****************************************************** --------------------------------------------------------------------- *** If you don't need Boost.Python, you can ignore this section *** *** pass --without-python to suppress this message in the future *** skipping Boost.Python library build due to missing or incorrect configuration couldn't find Python.h in "c:/Python24/include" You can configure the location of your python installation by setting: PYTHON_VERSION - The 2-part python Major.Minor version number (e.g. "2.2", NOT "2.2.1") - currently "2.4" PYTHON_ROOT - automatically configured from PYTHON_VERSION if not otherwise set ; currently "c:/Python24" The following are automatically configured from PYTHON_ROOT if not otherwise set: PYTHON_LIB_PATH - path to Python library object; currently "c:/Python24/libs" --------------------------------------------------------------------- ...patience... ...patience... ...found 9007 targets... ...updating 1363 targets... MkDir1 bin spawn: No such file or directory bjam with -d+4 ends with: PYTHON_LIB_PATH - path to Python library object; currently "c:/Python24/libs" --------------------------------------------------------------------- Executing through .bat file Executing command [cmd.exe] [/Q/C] [c:\windows\temp\jam8-00.bat] spawn: No such file or directory and his bat contains only mkdir "bin" ... $ cat ../windows/temp/jam8-00.bat mkdir "bin" btw. the moderation system of NNTP access is horrible, it took 3 days to send this meesage, after several email (register, verify, send, re-verify, and so on) it really is not too wellcomming for new members of community, IMHO, perhaps such strong anti-spam security is not needed.

1 0

[regex] - bk_parens and bk_braces missing from 1.33.x
by Keith MacDonald 04 Feb '06

04 Feb '06

It states in history.html for regex 1.33.0 that "some of the more esoteric options have now been removed, so there is the possibility that existing code may fail to compile: however equivalent functionality should still be available". I suppose bk_parens and bk_braces could be considered esoteric, but I cannot find any equivalent functionality. Is that intentional? Thanks, Keith MacDonald

1 0

[date_time] local_time_facet to format strings
by Christian Henning 04 Feb '06

04 Feb '06

Hi there, I'm trying to format a time string based on a local_time_facet. For some reason it isn't working as expected. Here is the code (I basically copied from the Date Time IO Tutorial): ptime t( microsec_clock::local_time() ); std::stringstream ss; local_time_facet* output_facet = new local_time_facet(); ss.imbue( std::locale( std::locale::classic(), output_facet)); output_facet->format("%a %b %d, %H:%M %z"); ss.str(""); ss << t; std::cout << ss.str() << std::endl; The output isn't formated in the way it's specified. Cout will basically spit out the same result as to_simple_string(). 2006-Feb-03 16:38:57.046875 The expected result would something like this: Fri Feb 3, 16:38 EDT I'm using MSVC 7.1 and Boost 1.33.1. Thanks in advance, Christian

2 2

Re: [Boost-users] Getting started with Boost: what did you need to know?
by Drumheller, Michael 04 Feb '06

04 Feb '06

Main stumbling point for me was bjam. It's not so much of a problem for building the libraries themselves--you don't need to know anything about it at all, really. But when you start building your own extensions, it would be helpful to have a dozen or so examples of really basic operations, like changing the destination directory, defining a preprocessor macro on the compiler command line, stuff like that. I have to say, I'm almost embarrassed to be writing this, because it seems like nobody on this list ever complains about bjam. So maybe it's just me. But to me, bjam is an incomprehensible monster, a big YALITTC (yet-another-link-in-the-tool-chain) that just makes it harder to sell boost within an organization. Michael D.

3 2

[serialization] seems like a bug in MSVS 7.1 is preventing use of the library
by cheesy4poofs 04 Feb '06

04 Feb '06

Hello, I've been trying for days to get a simple serialization example to work in our main project. I finally started taking snippets of code from the regular project into a sample project to post the code here. However, all the code in my sample project always compiles and runs. It's practically identical to our main project. At this point, I'm pretty sure I've stumbled unto a bug in the compiler. I even found a web page that seems to have the same problem I have: http://aspn.activestate.com/ASPN/Mail/Message/boost/2768351 Here's a small sample of the problem: struct Node { unsigned int handle; template <typename Archive> void save(Archive& ar, const unsigned int version) const { ar << handle; } template <typename Archive> void load(Archive& ar, const unsigned int version) { ar >> handle; } BOOST_SERIALIZATION_SPLIT_MEMBER() } In a nutshell, I have a std::map<unsigned int, Node> that I'm trying to serialize. The code to save compiles fine. But the load() method fails on compile with the STATIC_ASSERTION_FAILURE. If I comment out the ar >> handle;, it compiles fine. If I then uncomment ar >> handle; (after a good compile), it STILL COMPILES FINE. If I do a clean/rebuild of the project, it then fails with the STATIC_ASSERTION_FAILURE! I went into the iserializer.hpp:577 header of boost and found the offending line: // if this assertion trips. It means we're trying to load a // const object with a compiler that doesn't have correct // funtion template ordering. On other compilers, this is // handled below. BOOST_STATIC_ASSERT(! boost::is_const<T>::value); Based on the comment above, it seems MSVC 7.1 is having problems with correct function template ordering? On a whim, I commented out the BOOST_STATIC_ASSERT and now I see this compile error: ..\API\inc\boost\archive\basic_text_iprimitive.hpp(80) : error C2679: binary '>>' : no operator found which takes a right-hand operand of type 'const unsigned int' (or there is no acceptable conversion) ..\API\inc\boost\archive\text_iarchive.hpp(45) : see reference to function template instantiation 'void boost::archive::basic_text_iprimitive<IStream>::load<T>(T &)' being compiled with [ IStream=std::istream, T=const unsigned int ] My question is - how can I solve this so I can use serialization? The link above seems to indicate boost 1.32 works for Microsoft Visual Studio 7.1. Are there any other possible solutions that don't involve rolling back to an earlier boost version? Thanks for any help, Scott

2 1

Re: [Boost-users] walk thru multi_index
by JOAQUIN LOPEZ MU?Z 03 Feb '06

03 Feb '06

[About the documentation of Boost.MultiIndex, Evan says:] ----- Mensaje original ----- De: Evan Carew <carew(a)pobox.com> Fecha: Jueves, Febrero 2, 2006 7:56 pm Asunto: Re: [Boost-users] walk thru multi_index > -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA1 > > Joaquín, > > They are a little lite. I had to ask for help as well to get started. > In my case, I defined a fact pattern I needed help with and someone > kindly gave me an example, which I am now using. > Could you elaborate on that pattern? If it's general enough, I can look for a way to have it explained in the docs. When receiving specific reports about the docs I usually try to use the feedback --for instance, you complained some weeks ago about the lack of a explicit mention to index_iterator<> and family, and I added it to the docs for Boost 1.34 (you can check the preview version at the Vault.) Other than this, I'm sorry you found the documentation somewhat light. I've made sure every feature of the lib is treated, but I try also to keep the tutorial compact, and sometimes the style can be terser than desired. Also, sometimes people have questions wich are actually not related to Boost.MultiIndex --the very same problem posed by Dmitriy Bure, for instance, is more of an associative container issue, not specifically related to multi_index_container. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo > Version: GnuPG v1.4.1 (GNU/Linux) > > iD8DBQFD4lXApxCQXwV2bJARAsaxAJ9rF9IBfLTUWKwh8DCUHPnCj/5gkACgmj/q > NpcBmDY2hDI+IF+ZAWQPUb0= > =EfPx > -----END PGP SIGNATURE----- > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

3 3

Re: [Boost-users] Test of e-mail client - please ignore.
by Sohail Somani 03 Feb '06

03 Feb '06

> Brian Allison <brian(a)dtmr.com> writes: > > > The test below this line should be 'quoted'. Hopefully the > mail gate won't wreck it. > > > > Brian Allison wrote: > > > > Testing quoting other messages... > > Try turning off HTML messages in your client. :) I love how these threads start.

1 0