- Boost - lists.boost.org

Review Request: Boost.Align
by Glen Fernandes 22 Feb '14

22 Feb '14

I'd like to request a formal review of Boost.Align Description: Boost.Align is a tiny library that provides alignment related utilities that several Boost libraries (Boost.Log, Boost.Smart_Ptr, etc.) re-implement themselves. Specifically it provides a function for pointer alignment (boost::align, as many vendors do not provide the C++11 std::align), functions for aligned allocation (boost::aligned_alloc, and boost:: aligned_free), and a class template for a C++ allocator that respects type (or minimum) alignment (boost::aligned_ that can serve as a replacement for std::allocator that works with over-aligned types). Source code: https://github.com/glenfe/align Documentation: http://glenfe.com/align/doc/align.html Satisfies following requirements for a fast-track review: 1. The component must be small. 2. The technique must be already in use in Boost libraries and the new component provides a common implementation. 3. A full Boost-conformant implementation is available. Thanks, Glen

1 0

Developing a (nearly new) library possibly to be proposed for Boost
by Paul A. Bristow 22 Feb '14

22 Feb '14

I'm revisiting https://svn.boost.org/trac/boost/wiki/StartModDev to try set up a new library. I've started by trying to use the simple 'library' I created over a year ago using a previous version of this document. Is it intended that users should place their 'Boost-Wannabe' libraries in the modular-boost in /libs/mylibrary as other real Boost libraries ? When I assumed this, I found it impossible to GIT clone my existing 'simple' library into the /libs folder as it is not empty, so the 2nd line git clone <mailto:git@github.com:Beman/simple.git> git@github.com:Beman/simple.git fails. This feels the right place for Or is recommended to use some folder like sandbox/libs/mylibrary/ for one's stuff, including of course a sandbox/libs/mylibrary/include/boost/mylibrary/ to hold my .hpp files? Either way I presume I need a link from modular-boost/boost to point to sandbox/libs/mylibrary/include/ Should I provide a symbolic link /D or a hardlink (as b2 headers creates)? C:\Windows\system32>mklink /D I:\modular-boost\boost\ mylibrary I:\sandbox\libs\ mylibrary \include\boost\ mylibrary symbolic link created for I:\modular-boost\boost\ mylibrary <<===>> I:\sandbox\libs\ mylibrary \include\boost\ mylibrary seems to work. Or do I add this folder to the Include directory list? (Tiresome) Suggestions? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

5 20

Gsoc project discussion
by Abhishek Kumar 21 Feb '14

21 Feb '14

Hi, I am interested in participating gsoc (google summer of code) this year with Boost. I went through the ideas page and at the bottom section i found some ideas related to data-structures and algorithms. But the page said that students have to propose their own project using the ideas listed there. I need to discuss what things i can do related to the ideas as my gsoc project..? Frankly, at present i dont have any idea on what to propose, how to propose etc.. any help on this would be appreciated..! Thanks! Abhishek Kumar

1 0

Project Idea for 2014 GSoC
by Prabhat Kumar 21 Feb '14

21 Feb '14

Hello, In forthcoming google summer of code I'm thinking of implementing *Suffix Array* data structure. As a data structure, it is widely used in areas such as data compression, bioinformatics and, in general, in any area that deals with strings and string matching problems. So I think It would be very cool to add this data structure in Boost Libraries. Here is some brief description of some method which I have planned so far :- 1) Creation of Suffix array in O(n log n ), there is a relatively easy implementation in O(n (log n)^2) using STL's sort function, but radix sort we can achieve O(n log n) .... :) 2) Longest common prefix of any two suffix in O (log n) 3) Total distinct substring of given string in O(n log n) I'll be glad to hear some suggestion. Prabhat Kumar Indian Institute of Information Technology, Allahabad , India

2 2

[log] Default logging configuration for trivial logger
by Ben Pope 21 Feb '14

21 Feb '14

Hi, I'm using the trivial logging interface, but I need to tweak the default configuration. I want to be able to flush after every log entry, and I also want to be able to do file rolling. As far as I can tell, in order to configure it this way, I pretty much need to configure the whole thing from scratch including formatters, but I can't find the code that sets up the default logger to replicate it. Any pointers? Cheers, Ben

2 4

[move] interest: the pass-by-value and swap idiom, and explicit copy constructors
by Krzysztof Czainski 20 Feb '14

20 Feb '14

Hello, I would like to ask about interest in an idea of mine. I described it in detail [1] and implemented it as part of my cz libraries [2]. In short, the idea presents: - an alternative to implicitly copyable and movable types: making them explicitly copyable; - a protocol for explicitly stating in code, where a copy is to be made (boost::copy()), which compliments the protocol for explicitly stating in code, where a move is allowed (std::move() or boost::move()); - a Boost.move extension for implementing movable types with use of the pass-by-value and swap idiom, backwards-compatible with C++98, which allows to choose copying policies (and eases changing between these policies during maintenance): - movable but not copyable, - movable and explicitly-copyable, - movable and copyable; - an example, showing how simply a CloneablePtr can thereby be implemented. This extension to Boost.move is hosted and developed as part of my cz libraries [2], but it isn't tied to them at all. It only consists of two headers. I extracted the two headers together with samples and docs, and they are available as a zip archive [3]. I would be most excited if there was interest in adding this functionality to Boost.move, but in any case, all comments are much appreciated. Regards, Kris [1] http://kristoczaj.bitbucket.org/cz/copy_move_types.html [2] http://kristoczaj.bitbucket.org/cz/index.html [3] http://bitbucket.org/kristoczaj/cz/downloads/move-0.7.1.zip

5 10

[build] Headers rule does both too much and too little
by John Maddock 20 Feb '14

20 Feb '14

Folks I don't think the headers rule is working very well at present - it seems to both do too much and too little depending on the context: Too much: If I build the type_traits tests so everything is up to date, and then touch say type_with_alignment.hpp, then in libs/type_traits/test do: bjam add_const_test And for some strange reason bjam thinks there's a dependency on type_with_alignment.hpp from add_const_test, and there really isn't. In fact *every* test seems to be out of date now. Too little: The headers under boost/config/ are included via macros so aren't placed in the dependency graph. I can fix this easily enough in the Boost.Config tests, but ideally this should be fixed at the top level by making everything under boost/config/ a dependency of boost/config.hpp. This is currently causing some Boost.Config tests to fail in the online matrix, I bet there are others as well. Anyone any ideas? Thanks, John.

7 17

[move] [range] move algorithm (was: interest: the pass-by-value...)
by Krzysztof Czainski 20 Feb '14

20 Feb '14

2014-02-15 1:05 GMT+01:00 Adam Wulkiewicz <adam.wulkiewicz(a)gmail.com>: > Hi, > > Krzysztof Czainski wrote: > >> 2014-02-14 18:16 GMT+01:00 Lars Viklund <zao(a)acc.umu.se>: >> >> On Fri, Feb 14, 2014 at 05:52:53PM +0100, Krzysztof Czainski wrote: >>> >>>> - a protocol for explicitly stating in code, where a copy is to be made >>>> (boost::copy()), which compliments the protocol for explicitly stating >>>> in >>>> >>> Note that boost::copy already exists as the widely used Range-based >>> complement of std::copy algorithm. >>> >>> I just want to get this out of the way so people can focus on the actual >>> proposal and not parrot this over and over again. >>> >>> Good point, thanks Lars. >> >> Note, that an algorithm boost::move also exists: >> http://www.boost.org/doc/libs/1_55_0/doc/html/move/move_algorithms.html >> And I'm not sure how a Range-based complement to the move algorithm could >> look like, but it may also turn out useful. >> > > Probably like this: > boost::move(range, out_it) ; > > Regards, > Adam Hmm, how about: boost::copy( range | movable, out_it ); Regards, Kris

6 22

[Boost.Test] Assertion changes in trunk? [WAS: Call for Review: Boost.Test documentation rewrite]
by Dominique Devienne 19 Feb '14

19 Feb '14

On Wed, Jan 22, 2014 at 11:25 AM, Alexander Lamaison <awl03(a)doc.ic.ac.uk>wrote: > [...] As for as I'm aware, the only change is > to the assertion macros, which move to a more natural syntax: > > BOOST_CHECK_EQUAL(a, b) becomes BOOST_TEST(a == b) > BOOST_CHECK_LT(a, b) becomes BOOST_TEST(a < b) > ... etc. > BOOST_REQUIRE_EQUAL(a, b) becomes BOOST_TEST_REQUIRE(a == b) > ... etc. > BOOST_WARN_EQUAL(a, b) becomes BOOST_TEST_WARN(a == b) > But don't we then miss better messages which actually show the values themselves when the assert fails? I do BOOST_CHECK(a == b) only when a and b lack the op<<, but otherwise greatly prefer BOOST_CHECK_EQUAL(a, b). And what's the point of going from BOOST_REQUIRE(expr) to BOOST_TEST_REQUIRE(expr), i.e. make it longer / more typing? What am I missing? --DD

11 17

Meeting C++ 2014 - Call for Papers
by Jens Weller 19 Feb '14

19 Feb '14

Hello boost community, Meeting C++ 2014 has been announced today, it will be in Berlin on the 5th and 6th December! More details on the conference in the official announcement: http://meetingcpp.com/index.php/newsreader/items/announcing-meeting-c-2014-… With the announcement, also the call for paper is now again open till April 20th. This years theme track of the conference is "Scientific Programming with C++". I'm looking for a diverse set of talks about C++, talks about boost, Qt, STL, any libraries, testing, the C++ language (C++11/14/1y) or any other C++ related topic. More details on the call for papers: http://meetingcpp.com/index.php/newsreader/items/call-for-papers-meeting-c-… Kind regards, Jens Weller

1 0