- Boost - lists.boost.org

Re:Re: [boost] Re: [Boost.Test] New testing procedure?
by Robert Ramey 22 May '04

22 May '04

Reece Dunn wrote: > I don't know how feasable this would be, but you might also want to > consider library dependancies so that if you modify the iterator adaptors > library you can pull a list of tests that need to be re-run because the > associated libraries use iterator adaptors. This would reduce the number > of tests that need to be performed on each cycle, but you'd need some way > of archiving the results and only updating the ones that are re-run. I thought that's what it already did! Isn't that the whole point of the BJAM system? Is there not a way to "compose" Jamfile(s) into a one so that only dependent tests are run? Just a thought. More food for thought. The serialization library relies on spirit. The current version of spirit (1.8?) doesn't build on older platforms such as VC 6. For me this isn't a problem. For testing on other platforms spirit 1.61 will have to be installed in a "known" place. These kind of testing tweaks can occur inside the runtest.sh but that would inhibit the composition of Jamfiles described above. - maybe this is not a consideration. I recognize that the current testing procedure is exhaustive and that's a good thing. If I were to add exhaustive testing of the serialization library (35 tests * 5 archives (maybe 10) * 2 (debug/release) * 2 (dll/lib) * 8 compilers ) that would be 5600 build and run tests. This would take a while. (I havn't included polymorphic archive versions which would double this). So I'm resigned to the fact that I'm not going to be able to test exhaustively on a continuing basis. I would like to be able to solicite a test for a given combination on demand. Robert Ramey

1 0

boost.css validation
by Gennaro Prota 22 May '04

22 May '04

Hi, the W3C online validator accessible at http://jigsaw.w3.org/css-validator/ gives a warning on our main .css file: Warnings URI : http://www.boost.org/boost.css * Line : 0 font-family: You are encouraged to offer a generic family as a last alternative This looks like a good idea. What about adding 'monospace' as the last choice for both the PRE and the CODE rules? Genny.

2 1

[MPL] Integral constant expressions and MSVC.
by Cromwell Enage 22 May '04

22 May '04

Morning, all. I'm trying to implement a compile-time greatest common divisor metafunction, a key component of which is boost::mpl::modulus_c. Am I correct if I say that the following is typical usage of this class template? #include <iostream> #include <boost/mpl/modulus.hpp> int main() { typedef typename boost::mpl::modulus<int,14,6>::type remainder_type; std::cout << "The remainder of 14 divided by 6 is "; std::cout << remainder_type::value << std::endl; return 0; } MinGW 3.2 accepts this usage, but MSVC 7.1 files the following complaint: ..\..\Libraries\boost\boost\mpl\modulus.hpp(39) : error C2975: 'N' : invalid template argument for 'boost::mpl::integral_c', compile-time evaluatable constant expression expected It seems MSVC doesn't recognize A % B as an integral constant expression. What's the proper way of handling this? Cromwell Enage __________________________________ Do you Yahoo!? Yahoo! Domains � Claim yours for only $14.70/year http://smallbusiness.promotions.yahoo.com/offer

2 2

RE: [boost] Wave/flex_string with VC7.0 + dinkumware (new problem)
by Reece Dunn 22 May '04

22 May '04

Hartmut Kaiser wrote: >Reece Dunn wrote: > > I have this in my implementation if you want to take a look, > > along with > > several other changes to the flex_string implementation. > >Yes please send it to me (perhaps privately). I'll have to make some >changes >anyway, so I'll try to incorporate your fix along the lines. It is available on the sandbox (boost-sandbox/boost/fixed_string/detail/basic_string_impl.hpp). Feel free to incorporate any of my changes. NOTE: My version is still slightly defective because it uses std::allocator< value_type >::pointer for the iterator type, but I aim to fix this at some point. Also, I am wondering how good are flex_string and my basic_string_impl (based on flex_string) at handling rope-like containers and iterators. Regards, Reece _________________________________________________________________ Express yourself with cool new emoticons http://www.msn.co.uk/specials/myemo

1 0

Updating Test Regression for HP-UX
by DY, JERRY U (SBCSI) 22 May '04

22 May '04

How does the Boost Regression Test page for HP-UX aC++ get updated? I have the latest results using aC++ 3.55 compiler (including recent fixes) generated by the run_tests.sh script. The next aC++ patch I'm being told is scheduled to be released this July where the aC++ team hope to include as many fixes as possible. -Jerry

2 1

RE: [boost] Wave/flex_string with VC7.0 + dinkumware (new problem)
by Reece Dunn 22 May '04

22 May '04

Hartmut Kaiser wrote: >Reece Dunn wrote: > > > I reported that VC7 uses the correct implementation of > > reverse_iterator, and that this can be detected via > > BOOST_NO_STD_ITERATOR. Although this compiles, you cannot use > > reverse iterators. > > > > The problem is that the iterator is of the form (const) T *, > > and this fails because there is not a correct implementation > > of iterator_traits (due to a lack of partial template > > specialization) that *is* detected by BOOST_NO_STD_ITERATOR_TRAITS. > > > > The solution would therefore be to - in this case - provide > > an iterator wrapper around a standard pointer so it has the > > correct Iter::value_type, etc definitions. Is there an > > iterator_adaptor that provides this within boost? If not, > > should there be one? I am looking into this and will commit > > the solution to my iterator_adaptor-style implementation > > (sandbox/boost/fixed_string/detail/basic_string_impl.hpp). > > > > NOTE: If you want to add any of my modifications to the Wave > > flex_string implementation, feel free, but be warned that I > > haven't run full tests on it yet and thus there might be bugs > > in it (especially the pod_xxx --> traits_type::xxx, since > > these functions have different parameters). > >Thanks again for pointing that out. I'll have a look at it next week, when >I'm back home. Is this problem specific for VC7 or does it occur on the >VC7.1 platform also? If it's specific, then I would some need from somebody >to fix this, because I don't have it handy to reproduce the problem. Could >you provide a fix for Wave then? It is just a VC 7 problem, because VC 7 does not have partial template specialization. I have a fix now for this: replace std::reverse_iterator< Iterator > with boost::reverse_iterator< Iterator > (I do not have a proper diff): +# include <boost/iterator/reverse_iterator.hpp> // ... - typedef std::reverse_iterator<iterator -#ifdef BOOST_NO_STD_ITERATOR_TRAITS - , value_type -#endif - > reverse_iterator; + typedef boost::reverse_iterator< iterator > reverse_iterator; - typedef std::reverse_iterator<const_iterator -#ifdef BOOST_NO_STD_ITERATOR_TRAITS - , const value_type -#endif - > const_reverse_iterator; + typedef boost::reverse_iterator< const_iterator > const_reverse_iterator; I have this in my implementation if you want to take a look, along with several other changes to the flex_string implementation. Regards, Reece _________________________________________________________________ Get a FREE connection, FREE modem and one month's FREE line rental, plus a US or European flight when you sign up for BT Broadband! http://www.msn.co.uk/specials/btbroadband

2 1

Re: PING: Lambda Documentation Problem
by Stephan T. Lavavej 21 May '04

21 May '04

[Jaakko Jarvi] > I'm reading the standard back and forth and I do not agree > with you. The Standard is not very well written when it comes to this point, yes. However, I am right, and in the course of this E-mail, you will be convinced that I am right. :-> > What do you mean by "inherently mutating sequences"? Algorithms which always modify the sequences that they are given. > Does std::replace inherently modidfy sequences? Yes, because its purpose is to write NewValue in every place that OldValue occurs. In contrast, for_each does not necessarily have to modify sequences, if given a functor that inspects its argument and mutates itself. However, the functor can modify the sequence. This caused me some confusion (I thought, as you do, that conforming implementations could implement for_each in such a way as to disallow functors from mutating the values, and hence that for_each was morally bankrupt) until I read something that cleared it up for me. http://www.cuj.com/documents/s=7998/cujcexp1902langer/ "the function object may produce an effect by modifying the input sequence, and it can produce a useful result by mutating itself in the course of its invocations" for_each is special, because all of the other "non-modifying sequence operations" are /really/ non-modifying. If you are still unconvinced, see Library DR 290, where Angelika Langer (coauthor of the above article) complains that there are insufficient restrictions on for_each's functor. Note that she asks that the functor be required to not invalidate iterators or subranges. The DR is still open, but note that the LWG's response so far is "we think this should be a blanket statement", not "what are you talking about, for_each's functor cannot mutate its argument period, much less invalidate iterators". Finally: http://www.research.att.com/~bs/3rd_printing5.html "pg 524 add at the end of the page: "The for_each() algorithm is classified as nonmodifying because it doesn't explicitly modify a sequence. However, if applied to a non-const sequence for_each() may change the elements of the sequence. For an example, see the use of negate() in 11.9." (recent standards resolution)." If your TC++PL3 is 5th printing or higher (or if it's any printing of Special), you can look on page 524, and there it is. Spoken by the Bearded One himself. Stephan T. Lavavej http://nuwen.net

2 1

Newbie to Regex simple test failure...
by Richard Latter 21 May '04

21 May '04

Hello All, I'm probably missing something obivous here.....So please fogive me if it's a basic error. I am using regex for the first time on MSVC 6 and would like to create a simple function that could pass in a string and an expression to do a regular match on it. I believe I have successfully compiled this library, but I don't understand why either of these simple functions are not working.... bool TestStr (std::string& szExpr, const std::string& szSearch) { bool bResult=false; boost::regex cExpr(szExpr); bResult = boost::regex_match(szSearch, cExpr); return bResult; } or bool TestStr2 (std::string& szExpr, std::string& szSearch) { return boost::regex_match(szSearch, boost::regex(szExpr)); } After debugging these routines, it appears thta the boost::regex declaration fails (at least for the first function) returning a Kernel32.dll exception with some kind of address. The credit card example implies that the search and the regex example I have observed keeps the regex expressions as constansts inside the function, but I would like to be able to parse in my own string Questions? 1. Wht doesn't any of the functions work? 2. Is there a tutorial outside of the regex library I could look at. 3. I would be interested to know if anyone had any POSIX regex examples.... Many thanks in advance, Richard

4 7

bjam - building binaries in one dir
by John Torjo 21 May '04

21 May '04

Hi all, Looking at how bjam makes its great subdirs - when creating binaries for a library, I see that each libs/dlls is put in its own sub-directory. As I see, anyway, the binary name already indicates the compiler + release type + etc. And all the library linkinage is solved automatically (for instance, if I need boost_date_time-vc71-mt-gd-1_31.lib, it will automatically be added to my dependencies). I would like however for all binaries for a specific library to be built in the same dir. This way all I need to remember is the directory where the library binaries are, and include that in my 'Additional library directories'. I know that the current behavior (making subdirs) is much better for existing libraries, but I would like to create a new library, and build all binaries in the same dir. Does bjam allow this? (note: I will have four binaries per compiler) Best, John -- John Torjo Freelancer -- john(a)torjo.com -- http://www.torjo.com/logview/ - viewing/filtering logs is just too easy!

3 3

how to get the files for review?
by Oliver Kullmann 21 May '04

21 May '04

Hi, I just subscribed, and I would like to review the three--valued-logic library. So I click "Files" at the Boost home page. As a result I'm transferred to http://login.yahoo.com/config/login?.intl=us&.src=ygrp&.done=http://groups.… where my ID is asked for?!?! I have never used Yahoo, so I don't know what to do here (given that subscribing with Boost doesn't involve some ID) ?!?! Oliver

2 1