- Boost - lists.boost.org

[filesystem] Failures on FAT32
by Stefan Slapeta 12 Oct '04

12 Oct '04

Hi all, there are two failures reported for the intel-win32-8.1 toolset (both in operations_test): http://tinyurl.com/5dbla After some investigation I've found out now that the tests fail only because they are run on a FAT32 disk! It was just coincidence that the failures popped up in the Intel 8.1 tests (...and it's quite amusing to say that we would need another toolset dimension for the filesystem :) ) Anyway, here some analysis (the second failure seems to be a general design problem!): First failure: operations_test.cpp(287): test time_diff >= 0.0 && time_diff < 60.0 failed --> the actual difference is -2! Second failure: std::exception: boost::filesystem::last_write_time ("wrong parameter") last_write_time contains this code: ::utimbuf buf; buf.actime = std::time_t(); ^^^^^^^^^^^^^ buf.modtime = new_time; This means that the last access (!) time is set to 1970-01-01-... when the last write time is changed by this call! IMO that's absolutely incorrect because it's a side effect which I'm sure the user wouldn't expect to happen! Furthermore - a nice coincidence again - it seems not to be allowed to set this early access time for FAT32. I didn't investigate too much, but what I can say for sure is that it works to set an access time of this year, but not for 1970 (-> results in an error "wrong parameter"). Stefan

3 5

as_sequence<R(T0,T1)> ?
by Alexander Nasonov 12 Oct '04

12 Oct '04

I have one addition to '[type_traits] "member_function_pointer_traits" ?' thread started long time ago (29 Jul 2004) by Tobias Schwinger. Is it makes sense to modify as_sequence to convert function type into a sequence? Eg: as_sequence<R (T0,T1)> ---> vector<R,T0,T1> as_sequence<R(*)(T0,T1)> ---> vector<R,T0,T1> as_sequence<R(&)(T0,T1)> ---> vector<R,T0,T1> as_sequence<R(C::*)(T0,T1)> ---> vector<R,C,T0,T1> -- Alexander Nasonov

5 16

Boost.Build V2 link on top-level page?
by Vladimir Prus 12 Oct '04

12 Oct '04

Are there any objection to my adding Boost.Build V2 link (http://boost.org/boost-build2) to the top-level "index.htm", under "Official branch sites", using the patch below? - Volodya

2 3

Review of Daryle Walker's "More IO" library begins today, August 21, 2004.
by tom brinkman 12 Oct '04

12 Oct '04

The review of Daryle Walker's "More IO" library begins today, August 21, 2004. Download: http://groups.yahoo.com/group/boost/files/more_io_4.zip [or] http://boost-sandbox.sourceforge.net/more_io_4.zip Description: Provides a multitude of I/O-oriented extensions. Some are extra manipulators; variants of "std::endl", a resetting manipulator, and a configurable manipulator. The library includes a set of base class templates for wrapping a new stream-buffer type around a stream class. Changes from the last interim version (called "more_io_3b.zip"): * split the manipulator header into several headers * refined the license statements in some already-affected files Changes from the first formal review (called "more_io.zip"): * refined the interface and implementation of array-streams and stream-buffer wrappers (including a wrapping example) * added the null-stream, value-stream, and pointer-stream headers * added generalizations to the new-line and skip-line manipulators * added the non-oriented 'reset' and 'form' manipulators * split the manipulator header into several headers * changed the license statements Your comments may be brief or lengthy, but basically the Review Manager needs your evaluation of the library. If you identify problems along the way, please note if they are minor, serious, or showstoppers. Here are some questions you might want to answer in your review: 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? And finally, every review should answer this question: Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. For information about submitting a Formal Review, see http://www.boost.org/more/formal_review_process.htm The Review manager is: Tom Brinkman reportbase(a)yahoo.com

9 56

matching algorithm
by Gunnar W. Klau 12 Oct '04

12 Oct '04

Hello, does anybody know whether there's an implementation to compute (maximum weight) matchings in general graphs? Thanks for any help, --gunnar--

2 1

Re: [boost] Re: [review] Formal review of
by brangdon＠cix.compulink.co.uk 12 Oct '04

12 Oct '04

In-Reply-To: <loom.20041011T172801-139(a)post.gmane.org> nesotto(a)cs.auc.dk (Thorsten Ottosen) wrote (abridged): > If there is no null in the tree, then why test for it? The test is to prevent moving a null dog to the tree. > I suspect having null is reasonable, but I explicitly requested to see > the code. There is no real code; the example was invented to illustrate the importance of post-conditions. Which is another way of putting what it says in the .pdf file you referenced: the Null Object pattern is not universally applicable. The point is general and not about the specific code. Are you claiming that Null Object is, in fact, applicable in every situation? If not, just imagine I picked an example where you agree its not applicable. If, on the other hand, you believe no such example is possible, then you surprise me. Regardless I don't think further discussion is appropriate here, because it is not crucial to the Smart Container proposal. As I said in my original message: ... this is no more an argument against ptr_vector<Dog> than it is against std::vector<Dog>. In saying that I was supporting your proposed library. Given that ptr_vector<T> behaves more like vector<T> than vector<T*>, the restriction on NULLs is logical and reasonable. -- Dave Harris, Nottingham, UK

1 0

[lambda] cw83-release vs. cw83-debug failures...
by Rene Rivera 12 Oct '04

12 Oct '04

I became a bit curious as to why two Lambda tests fail in the only release configuration for CW8.3, but don't fail in the debug tests. As seen in: http://www.meta-comm.com/engineering/boost-regression/developer/lambda.html And the really strange part is the lack of information from Boost.Test about it. It only outputs: Run output [2004-10-11 02:46:48 UTC]: **** no errors detected EXIT STATUS: 1 Which seems like a rather contradictory statement from the test system I don't really know what is going on here. But I've narrowed it down to some strange interaction when the "--" and "++" pre-ops are used. If I make the following changes the tests pass... Index: bind_tests_advanced.cpp =================================================================== RCS file: /cvsroot/boost/boost/libs/lambda/test/bind_tests_advanced.cpp,v retrieving revision 1.8 diff -u -r1.8 bind_tests_advanced.cpp --- bind_tests_advanced.cpp 27 Jul 2004 03:43:33 -0000 1.8 +++ bind_tests_advanced.cpp 12 Oct 2004 03:02:38 -0000 @@ -110,7 +110,7 @@ int i = 1; BOOST_TEST(unlambda(_1 + _2)(i, i) == 2); - BOOST_TEST(unlambda(++var(i))() == 2); + { bool t = unlambda(++var(i))() == 2; BOOST_TEST(t); } BOOST_TEST(call_with_100(_1 + 1) == 101); Index: operator_tests_simple.cpp =================================================================== RCS file: /cvsroot/boost/boost/libs/lambda/test/operator_tests_simple.cpp,v retrieving revision 1.8 diff -u -r1.8 operator_tests_simple.cpp --- operator_tests_simple.cpp 27 Jul 2004 03:43:33 -0000 1.8 +++ operator_tests_simple.cpp 12 Oct 2004 03:02:38 -0000 @@ -175,11 +175,11 @@ BOOST_TEST(i == -1); i = 0; - BOOST_TEST((++_1)(i) == 1); + { bool t = (++_1)(i) == 1; BOOST_TEST(t); } BOOST_TEST(i == 1); i = 0; - BOOST_TEST((--_1)(i) == -1); + { bool t = (--_1)(i) == -1; BOOST_TEST(t); } BOOST_TEST(i == -1); i = 0; =================================================================== Any ideas, clues, etc. ?? -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com - 102708583/icq

1 0

[ANN] Boost testing mailing list
by Misha Bergal 12 Oct '04

12 Oct '04

The boost-testing mailing list is now operational: The setup, procedures and tools necessary for running Boost regression tests are discussed on this list. The list main participants are regression runners - people who run Boost tests on a variety of compilers and platforms, and the maintainers of tools for collecting and processing test results. Important: questions relevant to a wider audience, including questions about Boost.Test framework or test results for a particular library, should be posted to main development list. You can subscribe to the list at http://lists.boost.org/mailman/listinfo.cgi/boost-testing. -- Misha Bergal MetaCommunications Engineering

3 4

filesystem::is_directory return true when exception is disabled and this directory does't exist
by Liao Weijie 12 Oct '04

12 Oct '04

// the snip of code in filesystem::is_directory begin--- DWORD attributes = ::GetFileAttributesA( ph.native_directory_string().c_str() ); if ( attributes == 0xFFFFFFFF ) boost::throw_exception( filesystem_error( "boost::filesystem::is_directory", ph, fs::detail::system_error_code() ) ); return (attributes & FILE_ATTRIBUTE_DIRECTORY) != 0; //-------------------------------------------------------end-- When GetFileAttributesA failed but the exception is disabled, the (attributes & FILE_ATTRIBUTE_DIRECTORY) will always be true. Is it a bug?

4 4

Suggestion for multi_array query information
by Anders Edin 11 Oct '04

11 Oct '04

Hello, I have a short suggestion about the interface for multi_array. It is possible to query a multi_array<T,N> for information about the storage: // queries ... const size_type* shape() const; const index* strides() const; const index* index_bases() const; ... It appears multi_array uses a boost::array internally to store this information, and uses the data() method to return a pointer in the above methods. Wouldn't it be better to return a reference to the array directly: // queries ... const array<size_type, N>& shape() const; const array<index, N>& strides() const; const array<index, N>& index_bases() const; ... With this interface the information about the number of elements of shapes and strides is not lost during the query. -- Anders Edin, Sidec Technologies AB Fogdevreten 2A, 171 77 Stockholm, Sweden Phone: +46850884525, Fax: +46850884522

2 1