May 2016 - Boost - lists.preview.boost.org

Re: [boost] [Boost-users] Boost 1.61.0 has been released
by Daniel James 18 May '16

18 May '16

On 17 May 2016 at 21:42, Raffi Enficiaud <raffi.enficiaud(a)mines-paris.org> wrote: > > Thanks! > The boost.test documentation has the banner "click here to view the latest > version on this page" on the top: > http://www.boost.org/doc/libs/1_61_0/libs/test/doc/html/index.html > > Sorry for the late mention, I thought it was because 1.61 was not released > yet. > Anything I did wrong? Anything I can do? Sorry about that, it was a bug. It should be fixed now, you might have to shift-refresh to see the fixed page.

1 0

Review Wizard Report for May 2016
by Ronald Garcia 18 May '16

18 May '16

============================================== Review Wizard Status Report for May 2016 ============================================== News ==== 1. Boost 1.58 Released April 2015. New Libraries: Endian, Sort 2. Metaparse Library Accepted 3. Hana Library Accepted 4. DLL Library Accepted 5. Http Library Rejected 6. Boost 1.59 Released August 2015. New Libraries: Coroutine2, Convert 7. AFIO Library Reviewed 8. Fiber Library Conditionally Accepted 9. Boost 1.60 Released December 2015. New Libraries: Variadic Macro Data 10. Quaternions, Vectors, Matrices Accepted 11. Fit Library Rejected 11. Boost 1.61 Released May 2016. New Libraries: Compute, DLL, Metaparse, Hana Open Issues =========== The following libraries have review managers, but have not yet been scheduled for review: * Range Extensions - added May 2012; review manager: Neil Groves. The following libraries have been reviewed and await reports from their review managers: * AFIO - reviewed August 2015; review manager: Ahmed Charles. The following libraries have been accepted to Boost, but have not yet been integrated into Boost Git: * Contract - accepted September 2012; author: Lorenzo Caminiti. * Quaternions,Vectors,Matrices - accepted December 2015; author: Emil Dotchevski The following libraries have been accepted and submitted to Boost Git, but have not yet appeared in a release: * none The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * none General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot ubc dot ca" and "johnphillipsithica at gmail dot com" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Boost.Range Extensions * Nowide (M) * Array (M) * STL Extensions (M) * Countertree (M) * Process (M) * Application (M) * Edit Distance (M) * Mixin (M) * Dependency Injection (M) * Segmented Tree * Fiber ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. Array ----- :Author: Brian Smith :Review Manager: Needed :Download: https://github.com/BrianJSmith/Array :Description: The array class is a C++11 compatible implementation of static multidimensional arrays. STL Extensions -------------- :Author: Vadim Stadnik :Review Manager: Needed :Download: https://github.com/vstadnik/stl_ext_adv_review :Description: The proposed library [stl_ext_adv] offers augmented array based B+ trees and STL containers that support the interfaces of the C++03 sequences and associative containers. The library offers a number of extensions and performance improvements that are not available in C++03 and C++11 standard containers. Countertree ----------- :Author: Francisco Jose Tapia :Review Manager: Needed :Download: https://dl.dropbox.com/u/8437476/works/countertree_code_doc.zip :Description: This library is an implementation of a binary red-black counter tree. This tree have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. COUNTERTREE This kind of trees have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. With unordered information we have a vector with the same speed inserting and deleting in any position (O(log N)). With ordered information, we have the classes set, multiset, map and multimap, with identical interface than the STL classes, with the plus of access to the elements by position, like in a vector. The iterators are random access , and you can subtract them. SUBALLOCATOR The suballocator is a layer between the allocator and the data structures, compatible with any allocator with the STL definition. The suballocator replace to the allocator in the allocation of equal size elements. It provides speed, return the unused memory and decrease the memory used by the program and improve the cache performance due to the data locality improvement ( 30% of improvement of speed respect the std::allocator with GCC 4.7) Process ------- :Author: Boris Schaeling :Review Manager: Needed :Download: http://www.highscore.de/boost/process0.5/process.zip :Description: Boost.Process is a library to manage system processes. It can be used to: * create child processes * setup streams for child processes * communicate with child processes through streams (synchronously or asynchronously) * wait for processes to exit (synchronously or asynchronously) * terminate processes Application ----------- :Author: Renato Tegon Forti :Review Manager: Needed :Download: https://github.com/retf/Boost.Application :Documentation: http://www.dokfile.com/appbeta4/docs/libs/application/doc/html/index.html :Description: Application provides an application environment, or start point to any people that want a basic infrastructure to build an system application on Windows or Unix Variants (e.g. Linux, MacOS). Application uses behaviours modeled using 'aspects' concept proposed by 'Vicente J. Botet Escriba', that allow easy extension and customization of library components. The application modes uses these components internally to achieve the user desirable behaviours. Application provide many useful ready-to-use features, e.g: * Run application as Windows Service; * Run application as UNIX/POSIX Daemon; * Plugin extension system; * Process(executable) Single instance Instantiation support; * Application SIGNAL/Callbacks customization; * Windows Service Setup feature; * And many others. Edit Distance ------------- :Author: Erik Erlandson :Review Manager: Needed :Download: https://github.com/erikerlandson/algorithm/tree/edit_distance/sequence :Description: The edit distance is the length of the shortest (or least-cost) edit script from one sequence to another, where an edit script is defined as a sequence of insertion, deletion and (optionally) substitution operations. The function implementing the edit distance is named edit_distance. This function will return the edit distance between two sequences, where sequences may be any valid range object supporting forward iteration. The edit_distance function will also, if requested, return the edit script. Mixin ----- :Author: Borislav Stanimirov :Download: https://github.com/iboB/boost.mixin :Documentation: http://ibob.github.io/boost.mixin/ :Review Manager: Needed :Description: Boost.Mixin is a library that allows the composition and modifications of polymorphic types at run time. Types and objects are constructed out of building blocks called mixins. The library uses the type boost::mixin::object as a placeholder, whose instances can be extended with existing classes (mixins), thus providing a particular instance with the functionality of all those types. Accessing the newly formed type's interface is made through messages: stand-alone functions generated by the library, which can be thought of as methods. This is given while also having full abstraction between the interface and the definition of types. An existing feature in another language similar to Boost.Mixin and also an inspiration for the library are the mixins in Ruby. The library also has similarities with the pattern entity-component-system. Dependency Injection -------------------- :Author: :Download: https://github.com/krzysztof-jusiak/di :Documentation: http://krzysztof-jusiak.github.io/di/boost/libs/di/doc/html :Incubator: http://rrsd.com/blincubator.com/bi_library/di-dependency-injection/?gform_p… :Review Manager: Needed :Description: Boost.DI is a dependency injection library improving manual dependency injection by simplifying object instantiation with automatic dependencies injection. Using Boost.DI has many advantages over manual dependency injection. * Reduce boilerplate code (No factories, no objects creation in specific order) * Reduce cost of maintenance effort (Constructor signature change won't affect di configuration) * Reduce testing effort * Give better control of what and how is created (Policies, Providers) * Give better understanding about objects hierarchy (UML Dumper) Segmented Tree -------------- :Author: Chris Clearwater :Download: http://rrsd.com/blincubator.com/bi_library/segmentedtreeseq-2/?gform_post_i… :Repository: http://github.com/det/segmented_tree :Documentation: https://det.github.io/segmented_tree :Review Manager: Glen Fernandes :Description: SegmentedTreeSeq is a sequence data structure like vector and deque that supports efficient random access insert and erase. It is implemented using B+Trees and has an emphasis on speed and a low memory overhead. Fiber ----- :Author: Oliver Kowalke :Download: https://github.com/olk/boost-fiber :Documentation: http://olk.github.io/libs/fiber/doc/html/ :Review Manager: Nat Goodspeed :Description: Boost.Fit is a header-only C++11/C++14 library that provides utilities for functions and function objects. Libraries under development =========================== See The Boost Library Incubator Project at http://blincubator.com for discussion of libraries currently under development.

2 1

Re: [boost] [proto][variant] variant crashes proto expression
by Igor R. 17 May '16

17 May '16

> // The values bound to the placeholders > Value *d[2]; <...> > // The result of evaluating arithmetic expressions > typedef Value& result_type; So, you store pointers to the variants and return references, thus preventing copying. But why does the copying cause the aforementioned crash? Does it look like a bug in Proto? That's quite weird, because I never encountered any issue with variant copying... -- View this message in context: http://boost.2283326.n4.nabble.com/proto-variant-variant-crashes-proto-expr… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Boost Build and Test
by Robert Ramey 17 May '16

17 May '16

I started a new thread to accommodate the widening discussion on CMake. Build and Test systems: I've always been a big complainer about Boost Build. Now I'm a big complainer about CMake as well. Just so you know. I always found it weird that the buiding of libraries jam file was stashed in it's own directory - build while jam files for other components like test and building docs was found inside their respective directories. I also added to the serialization library some other jam files in subdirectories example and in performance. So to me by far the most natural place to find the library jam file would be in the directory we've agreed to name src. I never made any issue of this as my whole progress through life is about moving on to get my own projects done. Largely motivated by the desire to do cutting edge C++ development I replaced my old windows system with a mac mini. Soon I wanted to build and test my projects in XCode IDE. I like to use an IDE, but setting it and maintaining it for a project like the serialization library is an incredible amount of work. So I resolved to setup CMake to do the job. I had exposure to CMake before and found it no better than all the other build systems. But it needed to do what I wanted it to do - create the IDE project and it was very popular. So I managed to make it work in this context and the result has been quite satisfactory. But making it run all the tests I want to run - different compilers, libraries, etc. etc. integrating with my own library_status dashboard builder looked like a serious pain and I already had an elaborate Jamfile set for doing all of that. So upshot is I use them both for different purposes. I don't see anything wrong with that. In order not to upset the established structure I put my CMakeLists.txt file inside it's own directory. If it was totally up to me, what I'd like to see is: a) jam files in the build directory moved to src b) thereby acknowledging the practice of having jam files in the same directories which contain the build sources. c) which is pretty much the same as the CMake approach. c) official tolerance for including other build systems at the same level such as CMakeLists.txt and maybe MS projects and solutions. d) official tolerence for including a top level CMakeLists.txt. Personally I don't think this is necessary or even a good idea - but I want to leave that as a separate discussion. Robert Ramey

1 0

Final benchmark graphs for Colony vs std:: containers now available
by Soul Studios 17 May '16

17 May '16

Re-wrote my benchmark code from scratch a month or two ago with some help from Baptiste Wiche, have run over std::list, std::map, std::multiset, std::deque, std::vector, and for GCC, Chris's segmented_tree implementation. To be honest there's not much point comparing against segmented_tree, as the goals are totally different (efficient random access insertion for segtree, vs efficient unordered erasure/insertion/iteration without pointer invalidation colony), but there was some interest last time I wrote here. In addition I compared against other methods for ensuring pointer/index validity using deques and vectors, to see how those things pan out. Graphs are available here: http://www.plflib.org/colony.htm#benchmarks and here: http://www.plflib.org/stack.htm There are also MSVC 2013 results linked to in the first paragraph of the benchmarks. Comments are welcome, but please read the page first. Stack performs particularly well, outperforming all alternatives in both GCC/MSVC.

3 16

Boost ICL tests attempting to pass non-bidirectional iterator to std::reverse_copy
by Billy O'Neal (VC LIBS) 16 May '16

16 May '16

Hi folks. I'm not a Boost.ICL expert, but we detected this one failure with our in-development STL and this test case: template <ICL_IntervalSet_TEMPLATE(_T) IntervalSet, class T> void interval_set_element_iter_4_discrete_types() { typedef IntervalSet<T> IntervalSetT; typedef typename IntervalSetT::interval_type IntervalT; typedef std::vector<T> VectorT; IntervalSetT set_a; set_a.add(I_I(1,3)).add(I_I(6,7)); VectorT vec(5), cev(5); vec[0]=MK_v(1);vec[1]=MK_v(2);vec[2]=MK_v(3);vec[3]=MK_v(6);vec[4]=MK_v(7); cev[0]=MK_v(7);cev[1]=MK_v(6);cev[2]=MK_v(3);cev[3]=MK_v(2);cev[4]=MK_v(1); VectorT dest; std::copy(elements_begin(set_a), elements_end(set_a), std::back_inserter(dest)); BOOST_CHECK_EQUAL( vec == dest, true ); dest.clear(); std::copy(elements_rbegin(set_a), elements_rend(set_a), std::back_inserter(dest)); BOOST_CHECK_EQUAL( cev == dest, true ); dest.clear(); std::reverse_copy(elements_begin(set_a), elements_end(set_a), std::back_inserter(dest)); BOOST_CHECK_EQUAL( cev == dest, true ); dest.clear(); std::reverse_copy(elements_rbegin(set_a), elements_rend(set_a), std::back_inserter(dest)); BOOST_CHECK_EQUAL( vec == dest, true ); } which produces this failure: C:\Dev\WCFB01_01\binaries\x86ret\inc\algorithm(1672): error C2665: 'std::_Reverse_copy1': none of the 2 overloads could convert all the argument types C:\Dev\WCFB01_01\binaries\x86ret\inc\algorithm(1655): note: could be '_OutIt std::_Reverse_copy1<_Iter,_OutIt>(_BidIt,_BidIt,_OutIt,std::random_access_iterator_tag,std::random_access_iterator_tag)' with [ _OutIt=std::back_insert_iterator<VectorT>, _Iter=boost::icl::element_iterator<std::_Tree_const_iterator<std::_Tree_val<std::_Tree_simple_types<boost::icl::discrete_interval<bicremental_type_5,std::less>>>>>, _BidIt=boost::icl::element_iterator<std::_Tree_const_iterator<std::_Tree_val<std::_Tree_simple_types<boost::icl::discrete_interval<bicremental_type_5,std::less>>>>> ] C:\Dev\WCFB01_01\binaries\x86ret\inc\algorithm(1645): note: or '_OutIt std::_Reverse_copy1<_Iter,_OutIt>(_BidIt,_BidIt,_OutIt,std::bidirectional_iterator_tag,std::_Any_tag)' with [ _OutIt=std::back_insert_iterator<VectorT>, _Iter=boost::icl::element_iterator<std::_Tree_const_iterator<std::_Tree_val<std::_Tree_simple_types<boost::icl::discrete_interval<bicremental_type_5,std::less>>>>>, _BidIt=boost::icl::element_iterator<std::_Tree_const_iterator<std::_Tree_val<std::_Tree_simple_types<boost::icl::discrete_interval<bicremental_type_5,std::less>>>>> ] C:\Dev\WCFB01_01\binaries\x86ret\inc\algorithm(1672): note: while trying to match the argument list '(boost::icl::element_iterator<std::_Tree_const_iterator<std::_Tree_val<std::_Tree_simple_types<boost::icl::discrete_interval<DomainT,Compare>>>>>, boost::icl::element_iterator<std::_Tree_const_iterator<std::_Tree_val<std::_Tree_simple_types<boost::icl::discrete_interval<DomainT,Compare>>>>>, std::back_insert_iterator<VectorT>, boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag,Traversal>, std::output_iterator_tag)' with [ DomainT=bicremental_type_5, Compare=std::less ] and [ DomainT=bicremental_type_5, Compare=std::less ] and [ Traversal=boost::iterators::bidirectional_traversal_tag ] c:\dev\wcfb01_01\src\qa\vc\fe\3rdpartycomp\boost_1_60_0\libs\icl\test\fastest_interval_set_\../test_interval_set_shared.hpp(810): note: see reference to function template instantiation '_OutIt std::reverse_copy<boost::icl::element_iterator<std::_Tree_const_iterator<std::_Tree_val<std::_Tree_simple_types<boost::icl::discrete_interval<DomainT,Compare>>>>>,std::back_insert_iterator<VectorT>>(_BidIt,_BidIt,_OutIt)' being compiled with [ _OutIt=std::back_insert_iterator<VectorT>, DomainT=bicremental_type_5, Compare=std::less, _BidIt=boost::icl::element_iterator<std::_Tree_const_iterator<std::_Tree_val<std::_Tree_simple_types<boost::icl::discrete_interval<bicremental_type_5,std::less>>>>> ] c:\dev\wcfb01_01\src\qa\vc\fe\3rdpartycomp\boost_1_60_0\libs\icl\test\fastest_interval_set_\../fastest_interval_set_cases.hpp(61): note: see reference to function template instantiation 'void interval_set_element_iter_4_discrete_types<boost::icl::interval_set,discrete_type_2>(void)' being compiled We are considering reverting this enforcement of iterator category tag in our STL, but technically a standard library appears within its rights to reject this. Billy Robert O'Neal III SDE II - Visual C++ Libraries bion(a)microsoft.com

1 0

media file errors
by Rainer Deyke 15 May '16

15 May '16

"CDs/Reverend Bizarre - III - So Long Suckers (disc 1)" is redundant and should be deleted. In "CDs/Shadow Gallery - Room V": "Shadow Gallery - Seven Seas.mp3" -> "Shadow Gallery - Seven Years.mp3" -- Rainer Deyke (rainerd(a)eldwood.com)

1 0

Call for Submissions: International Conference on Information Society (i-Society 2016), Technical Co-Sponsored by IEEE UK/RI Chapter!
by Faye Bewsy 13 May '16

13 May '16

1 0

[proto][variant] variant crashes proto expression
by Igor R 13 May '16

13 May '16

The following code is a slightly modified Proto calc2 example. Instead of doubles I use variant<int, double>, and the expression is just _1 = _2. This code triggers assertion in variant/detail/forced_return.hpp, so it looks like some variant instance gets messed up. It happens when the value returned from proto::eval(*this, ctx) is being copied. It can be reproduced both with MSVC and gcc, with Boost 1.60. Is there any workaround for this issue? Thanks. ////////////// #include <iostream> #include <boost/proto/proto_typeof.hpp> #include <boost/proto/core.hpp> #include <boost/proto/context.hpp> #include <boost/variant.hpp> namespace proto = boost::proto; using proto::_; typedef boost::variant<int, double> var_t; template<typename Expr> struct calculator_expression; // Tell proto how to generate expressions in the calculator_domain struct calculator_domain : proto::domain<proto::generator<calculator_expression> > {}; // Will be used to define the placeholders _1 and _2 template<int I> struct placeholder {}; // Define a calculator context, for evaluating arithmetic expressions // (This is as before, in calc1.cpp) struct calculator_context : proto::callable_context< calculator_context const > { // The values bound to the placeholders var_t d[2]; // The result of evaluating arithmetic expressions typedef var_t result_type; explicit calculator_context(const var_t &d1 = var_t(), const var_t &d2 = var_t()) { d[0] = d1; d[1] = d2; } // Handle the evaluation of the placeholder terminals template<int I> result_type operator ()(proto::tag::terminal, placeholder<I>) const { return d[ I - 1 ]; } }; // Wrap all calculator expressions in this type, which defines // operator () to evaluate the expression. template<typename Expr> struct calculator_expression : proto::extends<Expr, calculator_expression<Expr>, calculator_domain> { explicit calculator_expression(Expr const &expr = Expr()) : calculator_expression::proto_extends(expr) {} BOOST_PROTO_EXTENDS_USING_ASSIGN(calculator_expression<Expr>) // Override operator () to evaluate the expression var_t operator ()() const { calculator_context const ctx; return proto::eval(*this, ctx); } var_t operator ()(const var_t &d1) const { calculator_context const ctx(d1); return proto::eval(*this, ctx); } var_t operator ()(const var_t &d1, const var_t &d2) const { calculator_context const ctx(d1, d2); return proto::eval(*this, ctx); } }; // Define some placeholders (notice they're wrapped in calculator_expression<>) calculator_expression<proto::terminal< placeholder< 1 > >::type> const _1; calculator_expression<proto::terminal< placeholder< 2 > >::type> const _2; // Now, our arithmetic expressions are immediately executable function objects: int main() { BOOST_PROTO_AUTO(expr, _1 = _2); var_t a1(1), a2(2.5); expr(a1, a2); return 0; }

3 2

[intrusive] crash with slist push_back
by Arpan Sen 12 May '16

12 May '16

Hi Boost Dev, Please consider the following code, this crashes with slist but works just fine if I replace slist with list. Also flat_map crashes but std::map works fine. Am I doing something gross or is there a bug here? #include <iostream> #include <boost/container/flat_map.hpp> #include <map> //#include <boost/intrusive/list.hpp> #include <boost/intrusive/slist.hpp> using namespace boost::intrusive; struct m : public slist_base_hook<> { int n; public: m(int k) : n(k) { } }; int main() { boost::container::flat_map<int, slist<m, cache_last<true> > > c1; std::map<int, slist<m, cache_last<true> > > c2; m* m1 = new m(22); c1[1].push_back(*m1); m* tt = new m(99); c2[1].push_back(*tt); } Regards Arpan

2 1