- Boost - lists.boost.org

[1.43.0] Release schedule
by Beman Dawes 28 Apr '10

28 Apr '10

The question came up as to whether 1.43.0 is still open for bug fixes. The answer is, yes, with permission from one of the release managers. My rationale is that there are still an uncomfortable number for test failures, and so taking a few more days to clear more failures is well worthwhile. The release is currently scheduled for next Monday, but I'm guessing release may run a few days later than that. --Beman

4 3

[async] withdrawn
by Scott Woods 28 Apr '10

28 Apr '10

Hi Boost, To prevent any further related effort, the library previously offered for review is withdrawn. Vicente explained why my work would need re-licensing and conversion to Boost componentry. Robert explained why the library is not a proper candidate for acceptance into Boost. I respect both of these positions. However, re-licensing and conversion then has little purpose. Regards, Scott

1 0

Library proposal: odeint
by Karsten Ahnert 28 Apr '10

28 Apr '10

Hi, some months ago, I proposed a library for solving ordinary differential equations, which can be found at http://svn.boost.org/svn/boost/sandbox/odeint/ Is it possible to add odeint to the Libraries Under Construction page? Best regards, Karsten

2 3

[range][1.43] Range Algorithms clasification
by vicente.botet 27 Apr '10

27 Apr '10

Hi, The documentation of the range library contains the following sections for Range Algorithms: * Introduction and motivation * Mutating algorithms * Non-mutating algorithms * Set algorithms * Heap algorithms * Permutation algorithms * New algorithms * Numeric algorithms I don't find the clasification enough clear in particular we can find a New algorithms section with the following algorithms * erase * for_each * insert * iota * overwrite * push_back * push_front * remove_erase * remove_erase_if Shouldn't these algorithms be included on the other cathegories? Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

2 1

[range][1.43] mismatch doc
by vicente.botet 27 Apr '10

27 Apr '10

The documentation of the mistmatch function contains several errors. The prototypes return a pair of iterators, but the description talk about The versions of mismatch that return an iterator or a range_return. Could this be improved for 1.43 release or it is better I make a ticket? "Description The versions of mismatch that return an iterator, return an iterator to the first position where rng1 and rng2 differ. Equality is determined by operator== for non-predicate versions of mismatch, and by satisfying pred in the predicate versions. The versions of mismatch that return a range_return, defines found in the same manner as the returned iterator described above." Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

2 1

[range] Check if one sequence is a rotation of other sequence.
by vicente.botet 27 Apr '10

27 Apr '10

Hi I want to define a function is_rotation that check if a sequence is a rotation of another using the following algorithm: a.. First make sure s1 and s2 are of the same length. b.. Check to see if s2 is a substring of s1 concatenated with s1. I have started to implement this using boost range, using the join view to avoid the phisical concatenation but I'm not sure that testing 'boost::search(boost::join(s1,s1), s2) != end(boost::join(s1,s1))' is the best way to do with Boost.Range. bool is_rotation(std::string const &s1,std::string const &s2) { return (boost::size(s1) == boost::size(s2)) && boost::search(boost::join(s1,s1), s2) != end(boost::join(s1,s1))); } Sugestion for improvement? Best regards, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

1 0

[System] Non-standard code in error_code_user_test
by Doug Gregor 27 Apr '10

27 Apr '10

The code in lib/system/test/error_code_user_test.cpp attempts to default-initialize a const-qualified variable non-POD class type that does not have a user-declared default constructor, which is ill-formed per C++03 [dcl.init]p9 (C++0x [dcl.init]p6). The attached patch fixes the problem be introducing a user-declared default constructor for two of the types we're testing with. - Doug

1 0

[fiber] With MSVC71
by Chard 27 Apr '10

27 Apr '10

I was hoping to try the latest fiber library from the vault, but it currently does not compile successfully with MSVC71. Is it the intention to support this compiler? There are two compilation failures: fiber/strategy.hpp, lines 77-8 template< typename Callable > friend void this_fiber::at_fiber_exit( Callable); I believe this is a VC71 compiler bug; the forward declaration of a template function that is subsequently given friend access to a class does not seem to work. I don't know the workaround. The other can be trivially fixed, and should not cause any issues on other compilers. Here's the patch: --- X:/Old/boost/libs/fiber/src/fiber.cpp Fri Apr 09 19:33:08 2010 +++ X:/New/boost/libs/fiber/src/fiber.cpp Fri Apr 23 11:41:58 2010 @@ -90,7 +90,7 @@ return * this; } -fiber::operator unspecified_bool_type() const +fiber::operator fiber::unspecified_bool_type() const { return info_; } bool

1 0

Re: [boost] VC10 config - some regressions in several libraries
by Brian Wood 27 Apr '10

27 Apr '10

> I've made a note to myself to request that /Za be removed or at least deprecated in VC11 > (our command-line deprecation warnings aren't silenceable, so they're pretty effective). [ snip] Please don't top post and please trim quotes to make things less cumbersome. Regards, Brian Wood Ebenezer Enterprises http://webEbenezer.net

2 1

Color of nodes in Edmonds & Karps max flow algorithms.
by Dan Jiang 27 Apr '10

27 Apr '10

Hi All, I have a question: What is the color(s) of nodes that can still be labeled after max flow is found in the Edmonds and Karp's algorithm? Are they black AND grey or just black? I know black nodes can still be labeled, what about nodes with grey color? -Thanks, Dan _________________________________________________________________ Videos that have everyone talking! Now also in HD! http://go.microsoft.com/?linkid=9724465

2 1