- Boost - lists.boost.org

GCC 4.0 Compiler Review \ Performance Tests
by Brian Braatz 03 May '05

03 May '05

http://www.coyotegulch.com/reviews/gcc4/index.html The review is interesting, but of most relevant interest to boosters would be the following: "The C++ compiler is now faster, particularly on code heavy with templates; the Standard C++ library has improved stream and strings classes, and it includes preliminary new classes from the recent C++ Technical Report 1 (an update to Standard C++)." The review is interesting. For those who don't wish to read through it, basically 4.0 is more of an incremental version, no real performance leaps in compilation or performance.

3 2

Re: [boost] Re: Re: Re: Formal Review: FOREACH macro
by brangdon＠cix.compulink.co.uk 03 May '05

03 May '05

In-Reply-To: <d55r5q$9h2$1(a)sea.gmane.org> gennadiy.rozental(a)thomson.com (Gennadiy Rozental) wrote (abridged): > > Adding #defines is adding complexity. > > I think it's a kinda an attitude issue: you see all macros as enemies. No. Adding almost anything is adding complexity. It's another layer. And of course a rather powerful layer - a macro can do almost anything. Also you snipped the context. Your proposal here was, if I understand correctly, to use conditional compilation to switch off FOREACH's support for corner cases. So we are adding more options and configurability, and the potential for my corner cases not to work because support for them has somehow been switched off (where - in the makefile?). Even if I know how FOREACH works in my project, it might work differently on my colleague's project. And I have yet more code to read when I look at the header. It's as if we were trying to build the most complex thing that could possibly work. > I see some of them as friends. Macros in general (and FOREACH in > particular) are in most cases only usability helpers (there is also > configuration switched domain, but it's beside the point). And until > language provide as-convenient alternatives I am ready to accept the > macro nature of these tools. I'm ready to accept them too, when they do something worth while. This one doesn't. -- Dave Harris, Nottingham, UK.

2 1

The View concept
by Maciej Sobczak 03 May '05

03 May '05

Hi, There is a thread on comp.lang.c++.moderated where the problem of manipulating with "heavy" data in STL containers was raised. The name of the thread is "Messign with expensive objects in containers". I have posted a solution with the help of a simple view adaptor class that I wrote a while ago. The code with examples and documentation is here: http://www.msobczak.com/prog/bin/view.zip (11kB) Alberto Barbati suggested to post it here for review. It is different from boost::multi_index in that view operates on already existing objects or sequences. Note: the view class itself is very simple and as a concept is only a fraction of what is available in the View Template Library: http://www.zib.de/weiser/vtl/ I would like to know your opinion about the view as a concept, and its simple implementation that I referenced above. It might fit into the Containers category of Boost libraries. Regards, -- Maciej Sobczak http://www.msobczak.com

2 1

why the demo.cpp in serialization can't be built?
by Jun Lu 03 May '05

03 May '05

Lots of link errors (VC7.1). One of them: Test error LNK2019: unresolved external symbol "public: __thiscall boost::archive::basic_text_oprimitive<class std::basic_ostream<char,struct std::char_traits<char> > >::~basic_text_oprimitive<class std::basic_ostream<char,struct std::char_traits<char> > >(void)" (??1?$basic_text_oprimitive@V?$basic_ostream@DU?$char_traits@D@std@@@std@@@archive@boost@@QAE@XZ) referenced in function "public: virtual __thiscall boost::archive::text_oarchive_impl<class boost::archive::text_oarchive>::~text_oarchive_impl<class boost::archive::text_oarchive>(void)" (??1?$text_oarchive_impl@Vtext_oarchive@archive@boost@@@archive@boost@@UAE@XZ)

2 1

Re: [boost] Re: Formal Review: FOREACH macro
by brangdon＠cix.compulink.co.uk 03 May '05

03 May '05

In-Reply-To: <4276723A.5020107(a)boost-consulting.com> eric(a)boost-consulting.com (Eric Niebler) wrote (abridged): > OK, that's true. But the same can be said of any third-party library. Quite. There seems to be a general view in Boost that users don't care about the complexity of the implementation. It is with the general view that I disagree. It is also a problem with shared_ptr, for example. However, the complexity can be justified if the library delivers enough bang for the buck. In my view this one doesn't. > I guess the only problem is that most debuggers don't let you step > into a macro. Yes, that's a problem specific to macros :-) > Neither of these loops "work" -- they are both broken in the same way. As others have pointed out, the first one works with reserve(). Or they might work with other containers than std::vector - let's not get hung up on details. I'm sure you are as capable as I at manufacturing examples which do work and which demonstrate the problem. > I don't think it's reasonable to assume rational behavior when you > are altering the sequence while you are iterating it. Do you see how the proposed library is making life more complicated? It is adding unobvious restrictions and rules. > But perhaps it should be worth noting in the docs that FOREACH > doesn't perform any heroics to make this work. Definitely. Especially as others have suggested non-caching implementations. The only way to know whether FOREACH caches is to consult the documentation, or look at its implementation. And again I see this as adding a little bit of complexity. -- Dave Harris, Nottingham, UK.

1 0

[Filesystem] i18n
by Martin 02 May '05

02 May '05

Didn't find any comments on the new filesystem implementation so here are mine - Would it be possible to store the new files in the vault? I find it inconvenient to check out a special branch just to read the documentation. - I haven't compiled the new files but I have had a good look at the documentation and the source. My impression is that it is a very nice implementation. (All the #ifdefs make the source hard to follow but I'm not the maintainer) - Specially I like the switch from default portable syntax to default native syntax. It means that I no longer need to change the default name checker in each application and that the "native_" prefix from the access functions are gone. (Maybe the name checker could be a template parameter (with default "none") for those who still want to use it. Would complicate implementation of operations.) The comments I have on the new implementation is: - Operations are limited to std::string (and std::wstring on win32) as external type. Why not allow any range of characters? Current implementation will not work with const_string, flex_string and a basic_string with a custom allocator. - Why not have a static locale member in the class instead of using the utf-8 facet. The locale could then be used both for internal/external conversion via the codecvt facet and get operator< to work with a custom locale. (for posix the locale would default to locale::global() with the utf-8 facet added) I also had hopes for some new things that didn't appear in the new implementation. - non-throwing is_* functions. I find it very inconvenient and error prune to put try/catch around each is_directory call. Calling is_accessible before every other is_* function is an option but not much easier and still leaves a risk for an exception if another process is accessing the file. The throwing is_* functions also makes it impossible(?) to use the directory iterator with algorithms like remove_copy_if(directory_iterator(path), directory_iterator(), back_inserter(filelist), is_directory) My suggestion is to add non-throwing overloads where a second parameter tells what the function should return in case of error. e.g. is_directory(path, true). - The directory iterator is still very limited since you can't specify a filter (e.g. "*.txt"). If used on a win32 system with a mounted posix disk or a posix system with a CD problems might arise. (There is no portable way to tell if "FILE.TXT" matches "*.txt"). - Why doesn't last_write_time return a boost::ptime

7 38

Re: [boost] Re: Formal Review: FOREACH macro
by brangdon＠cix.compulink.co.uk 02 May '05

02 May '05

In-Reply-To: <4276462D.1020501(a)boost-consulting.com> eric(a)boost-consulting.com (Eric Niebler) wrote (abridged): > It injects 5 local variables. I haven't checked, but I suspect that > some can be optimized away sometimes. I doubt they will be in debug mode, which is when I need to look at them. > I'm not sure why users will need to understand how FOREACH uses > its hidden variables. Can you explain? When I am debugging, I need to understand what the code is doing else how I can I understand what it is doing wrong? For example, from looking at the implementation it seems that the macro caches the end() value in a variable called _foreach_end. This means that if some random memory corruption changes that variable the loop may never terminate. I need to know. Incidently, if it is caching then code like: BOOST_FOREACH( int i, vec ) if (condition(i)) vec.push_back( filter(i) ); will not work the same as: for (iterator i = vec.begin(); i != vec.end(); ++i) if (condition(*i)) vec.push_back( filter(*i) ); Which at least needs to be documented. Again the implementation is complex enough that I can't tell at a glance whether these are the same, so I may have this wrong, but I strongly suspect they are different. -- Dave Harris, Nottingham, UK.

4 9

Re: xpressive as scanner generator [was: new version of xpressive]
by Andreas Pokorny 02 May '05

02 May '05

Resending that message, accidently sent it to eric directly, so again: On Mon, May 02, 2005 at 09:50:37AM -0700, Eric Niebler <eric(a)boost-consulting.com> wrote: > About a year ago, Hartmut Kaiser wrote an xpressive_p() parser for > Spirit which wrapped an xpressive regex. It worked a bit like the > current regex_p parser. Would that meet your needs? I don't know what > became of it. Perhaps Hartmut knows. Thats also an interesting usage of xpressive. I dont have an acute need for scanners, my parsing needs are currently focused on biological formats which are just database dumps most of the time. So I have to work on character level most of the time. But provided that I work on parsing a scripting language, or rather a language which is intended for parsing by software, I would try to implement a lexer first. And use that lexer as scanner object in spirit. I think it is a bit strangely that there are several generic C++ replacements for yacc/bison, but nothing similar to lex/flex, that can be intergrated into spirit (integrated as scanner that is). Andreas Pokorny

2 1

RE: [boost] lambda bind breaks VC 7.1
by Brian Braatz 02 May '05

02 May '05

Try turning off the automatic auto completion functionality in the IDE I have seen this, not repeatable though. In one case, I re-formatted the call and by doing this I got it to not crash anymore. I have also run into problems with conflicts with the win32 bind() call. (but that is a whole different ball of wax) > -----Original Message----- > From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] > On Behalf Of Jason Hise > Sent: Sunday, May 01, 2005 12:22 PM > To: boost(a)lists.boost.org > Subject: [boost] lambda bind breaks VC 7.1 > > For some reason, it seems that whenever I type '(' after > boost::lambda::bind (which would normally cause the intellisence list to > pop up with the arguments the function takes), visual studio completely > locks up. Does anyone else have this problem? Are there known fixes or > work-arounds? > > -Jason > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

[ptr_container] metrowerks problems
by Thorsten Ottosen 02 May '05

02 May '05

Hi All, I haven't got a metrowerks compiler and can't fix the problems easily; so I *need* somebody to help me. The alterantive is that I will have to mark them as unusable. Please contact me if you would like to help and need directions. Thanks -Thorsten -- Thorsten Ottosen ---------------------------- www.dezide.com http://www.cs.aau.dk/index2.php?content=Research/mi www.boost.org www.open-std.org/JTC1/SC22/WG21/

3 18