April 2014 - Boost - lists.preview.boost.org

[assign] [tokenizer] Please pull two trivial patches
by Gregor Jasny 23 Apr '14

23 Apr '14

Hello, since four months two trivial patches to replace a plain throw with BOOST_THROW_EXCEPTION sit in the trac and github (as pull requests). Could anyone please review and submit them? I'd like to see them in the next release or the one after. #9504 - https://github.com/boostorg/assign/pull/1 #9505 - https://github.com/boostorg/tokenizer/pull/1 Thanks, Gregor

1 0

[utility] Pull request: Use an unsigned type as an intermediate result instead of left shifting a negative integral constant
by Ben Pope 22 Apr '14

22 Apr '14

https://github.com/boostorg/utility/pull/4 No maintainer listed in maintainers.txt so cross posting this one. Ben

4 5

[gsoc2014] This year's students announced
by Niall Douglas 22 Apr '14

22 Apr '14

Dear Boost, We are pleased to announce that the following eight students will be this year's Google Summer of Code for 2014: 1. Anton Bikineev Mentor: Christopher Kormanyos Topic:Boost.Math Generalized Hypergeometric Functions 2. Ian Forbes Mentor: Tim Blechmann Topic: Boost.Thread Scheduled Executors 3. Louis Dionne Mentor: Joel Falcou Topic: A C++11 template metaprogramming library 4. Mark Lingle Mentor: David Bellot Topic: Boost.uBlas: Optimization via Smart Templating and a Tree Optimizer class 5. Roshan Mentor: Kyle Lutz Topic: Expand and Improve Boost.Compute 6. Saksham Maheshwari Mentor: Stefan Seefeld Topic: Boost.XML - A Standard XML Library 7. Thaler Benedek Mentor: Vicente J. Botet Escriba Topic: Boost.Pipeline 8. Vinícius dos Santos Oliveira Mentor: Bjorn Reese Topic: HTTP server on Boost At US$5,000 funding per student, this represents an investment of US$40,000 into Boost by Google this year, for which we are extremely grateful. Our thanks to everyone in Google who makes this happen every year. With so few slots available from Google some very good candidates and proposals could not be selected, so if you were not selected this year, better luck next year (remember to come early!). Congratulations to the students who did make it, and our collective thanks go to the primary mentors above for taking the time this summer, as well to the secondary mentors not listed above as well as everyone who helped out with the proposal review and the ranking and voting this year. Niall & Boris --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

8 7

Strange use of random values in regression test ...
by Chris Cooper 21 Apr '14

21 Apr '14

The test_main() of libs/utility/operators_test.cpp loops 1000 times, running a variety of tests on random values. However, since the randomizer (boost::minstd_rand) is instantiated inside the loop, it appears that the randomizer is re-seeded for each loop, meaning it runs the test 1000x with the exact same values each time. I’m not 100% familiar with the boost random value generators, am I missing something? Or should the boost::minstd_rand be instantiated outside the loop? I’m happy to add this as a boost bug if my understanding is correct … Thanks, Chris

2 1

[type traits] has_complement, enum class, and gcc 4.9
by Nevin Liber 21 Apr '14

21 Apr '14

We are seeing build problems with gcc 4.9 RC1 and Boost 1.55. Given the following test program: #include <boost/type_traits.hpp> #include <iostream> enum class E {}; int main() { std::cout << boost::has_complement<E>() << std::endl; } Using g++ -std=c++11, we get: In file included from */opt/local/include/boost/config.hpp:57:0*, from */opt/local/include/boost/type_traits/add_const.hpp:13*, from */opt/local/include/boost/type_traits.hpp:13*, from *a.cpp:1*: /opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp: In instantiation of '*const bool boost::detail::has_complement_impl::operator_exists<E>::value*': */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:173:4:* required from '*const bool boost::detail::has_complement_impl::trait_impl1<E, boost::detail::has_complement_impl::dont_care, false>::value*' */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:195:4:* required from '*const bool boost::detail::has_complement_impl::trait_impl<E, boost::detail::has_complement_impl::dont_care>::value*' */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:202:1:* required from '*struct boost::has_complement<E>*' *a.cpp:7:41:* required from here */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:152:56:* *error: *no match for '*operator~*' (operand type is '*E*') BOOST_STATIC_CONSTANT(bool, value = (sizeof(check(((BOOST_TT_TRAIT_OP make<Rhs>()),make<has_operator>())))==sizeof(::boost::type_traits::yes_type))); * ^* /opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp: In instantiation of '*const bool boost::detail::has_complement_impl::operator_returns_void<E>::value*': */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:173:4:* required from '*const bool boost::detail::has_complement_impl::trait_impl1<E, boost::detail::has_complement_impl::dont_care, false>::value*' */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:195:4:* required from '*const bool boost::detail::has_complement_impl::trait_impl<E, boost::detail::has_complement_impl::dont_care>::value*' */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:202:1:* required from '*struct boost::has_complement<E>*' *a.cpp:7:41:* required from here */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:89:102:* *error: *no match for '*operator~*' (operand type is '*E*') BOOST_STATIC_CONSTANT(bool, value = (sizeof(::boost::type_traits::yes_type)==sizeof(returns_void((BOOST_TT_TRAIT_OP make<Rhs>(),returns_void_t()))))); * ^* *a.cpp:* In function '*int main()*': *a.cpp:7:41:* *error: *cannot bind '*std::ostream {aka std::basic_ostream<char>}*' lvalue to '*std::basic_ostream<char>&&*' { std::cout << boost::has_complement<E>() << std::endl; } * ^* In file included from */opt/local/include/gcc49/c++/istream:39:0*, from */opt/local/include/gcc49/c++/sstream:38*, from */opt/local/include/gcc49/c++/complex:45*, from */opt/local/include/boost/type_traits/is_complex.hpp:12*, from */opt/local/include/boost/type_traits.hpp:49*, from *a.cpp:1*: */opt/local/include/gcc49/c++/ostream:602:5:* *note: *initializing argument 1 of '*std::basic_ostream<_CharT, _Traits>& std::operator<<(std::basic_ostream<_CharT, _Traits>&&, const _Tp&) [with _CharT = char; _Traits = std::char_traits<char>; _Tp = boost::has_complement<E>]*' operator<<(basic_ostream<_CharT, _Traits>&& __os, const _Tp& __x) * ^* It compiles fine under gcc 4.7.2 and clang 3.4. It also compiles fine for plain enums. Any ideas? -- Nevin ":-)" Liber <mailto:nevin@eviloverlord.com> (847) 691-1404

2 2

Corruption in container::string when used with boost::interprocess
by Lars Hagström 21 Apr '14

21 Apr '14

Found this bug recently, but since theres been no activity on it on Trac I'm double-posting here. https://svn.boost.org/trac/boost/ticket/9855 Cheers Lars

2 1

Boost.Align review begins today
by Ahmed Charles 21 Apr '14

21 Apr '14

Hi all, The review of Boost.Align by Glen Fernandes commences today, Friday, 11 April, and concludes Sunday, 20 April. Boost.Align provides: 1. Function align() to align a pointer, for implementations which do not provide C++11's std::align(). 2. Functions aligned_alloc() and aligned_free() for dynamic allocation with specified alignment. { For use in place of ::operator new() and ::operator delete(). } 3. Class template aligned_allocator as an alignment-aware allocator that also allows specifying a minimum alignment. { For use in place of std::allocator. } 4. Class template aligned_allocator_adaptor to turn any existing allocator into an alignment-aware allocator that also allows specifying a minimum alignment. { For use in place of any existing allocator type. } 5. Function is_aligned() to test the alignment of a pointer. Rationale: C++11 added the ability to specify increased alignment (over-alignment) for class types. Unfortunately, ::operator new allocation functions, new expressions, and the default allocator, std::allocator, do not support dynamic memory allocation of over-aligned data. Notes: This library also meets needs in existing Boost libraries. - Boost.Smart_Ptr has its own implementation of align(). - Boost.Interprocess and Boost.Log each have their own implementation of aligned_alloc() and aligned_free(). Source: doc: http://glenfe.github.io/align git: http://github.com/glenfe/align zip: http://github.com/glenfe/align/archive/master.zip 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? Ahmed Charles Review Manager

10 26

Boost.Align review results
by Ahmed Charles 21 Apr '14

21 Apr '14

The review of the proposed Boost.Align library ended on April 20, 2014. The result is: Accepted with conditions. Glen and I would like to thank everyone for contributing to the review for Boost.Align. either with a review or comments in the discussions. The summary of formal votes is as follows (alphabetical order): Andrey Semashev - Yes (conditional) Antony Polukhin - Yes (conditional) Bjorn Reese - Yes Lars Viklund - Yes Michael Spencer - Yes For a total of 5 votes for acceptance and 0 votes for rejection. The conditional acceptance is based on the quality of documentation, as the feedback given on code and design has already been addressed. The conditions below are agreeable to the author: 1. QuickBook documentation should be used, following typical Boost documentation structure. 2. Additional examples should be used to make the understanding/use of the library easier. 3. Additional minor comments from the reviews should be addressed. I would like to thank Glen for making this an easy first review manager experience and I look forward to reviewing other libraries in the future.

2 1

Application need a Review Manager. Anyone is interested?
by Renato Forti 21 Apr '14

21 Apr '14

>> So do a ton of other libraries waiting in the review queue. >> One trend I've noticed in recent reviews is that the libraries which find review managers are small, sometimes very small. It might be worth breaking up Application into smaller libraries if you want a faster review. I think that I can split it. >> Equally, AFIO has 1000 active lines of code, and I very much doubt it'll see a review manager any time soon. I'm thinking maybe next year it might >> (I will speak at C++ Now introducing the session on the Future of Boost, which will mention AFIO :) ). Nice! I will check! >> FYI, I'd just love if Application's design rationale told me why and how it's similar or different to Boost.Process. Process is one of the most popular non-official Boost libraries out there. Well, I think that are totally different. Quick, Boost.Process is used to start a new process, Boost.Application is the process in fact. Boost.Application provides a model/environment to build any application, not start an application. Some features are: With it you can deploy your application as server (service on windows, and daemon on unix). It provides a plug-in system tool and other facilities (like aspects) that will help developer on application development. It provides a way to create other applications modes, e.g. Apache http server module. Some references: http://www.codeproject.com/Articles/756866/Build-a-Server-Application-using… http://www.codeproject.com/Articles/695937/Creating-a-New-Application-Mode Thanks alot for your comments.

4 4

GSoC 2014 - Functional - Monad
by Ding Xiangfei 19 Apr '14

19 Apr '14

Hello, Boost. This is Xiangfei, a first year CS student from National University of Sinagpore. I am familiar with C++ template programming and have learnt a little functional programming language by myself. Therefore I find the monad project in boost will be very interesting and useful. This is my first time applying for GSoC. I have past boost use experience, but it is my first time also to contribute in Boost library. I have a question for the implementation of monad. What is the degree of integration of this module with other Boost utilities other than sequences and containers? Thank you. Regards, Xiangfei

2 10