- Boost - lists.preview.boost.org

Re: [boost] Countertree
by Leo Goodstadt 18 Nov '12

18 Nov '12

> Subject: Re: [boost] Review Wizard Report for November 2012 > Hi all, > I would like to request a formal review of the library ?Countertree + > Suballocator? [countertree] > > Project location ( zip file with code and documentation) : > https://dl.dropbox.com/u/8437476/works/countertree_code_doc.zip > > Quick view of documentation with code download : > https://dl.dropbox.com/u/8437476/works/countertree/index.html > > For the people who don't know this project, this is a description : > > *COUNTERTREE* > > 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 Among other things, countertree would allow the boost Statistical Accumulators Library to support rolling median and rolling quantiles efficiently. This would be very useful. I had previously had to hack the tree class in the Policy-Based Data Structures part of the gnu c++ library. (see http://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/tree_order_statistics_nod…) Leo Goodstadt

4 5

Review Wizard Report for November 2012
by Ronald Garcia 17 Nov '12

17 Nov '12

============================================== Review Wizard Status Report for November 2012 ============================================== News ==== 1. ODEInt Reviewed 2. Boost 1.52.0 Released. No New Libraries. 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: * Predef - reviewed February 2012; review manager: Joel Falcou. * Coroutine - reviewed September 2012; review manager: Hartmut Kaiser. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Constrained Value - accepted September 2010; author: Robert Kawulak. * GIL.IO - accepted January 2011; author: Christian Henning. * Contract - accepted September 2012; author: Lorenzo Caminiti. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Atomic - accepted July 2011; author Helge Bahmann. * Type Traits Introspection - accepted August 2011; author: Edward Diener. * Lockfree - accepted August 2011; author: Tim Blechmann. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Endian - accepted provisionally November 2011; author: Beman Dawes. * Log - accepted provisionally March 2010; author: Andrey Semashev. 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 cmu dot edu" and "phillips at pacific dot mps dot ohio-state dot edu" 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) * Pimpl (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Variadic Macro Data (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Polygon: Voronoi Extensions * Coroutine * Range Extensions * Nowide (M) * Array (M) * TypeIndex (M) * STL Extensions (M) ``(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. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: https://github.com/boost-vault/Miscellaneous/blob/master/Pimpl.zip :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: This library adds support and functionality for variadic macros to Boost as well as integrating variadic macros with the Boost PP library without changing the latter library in any way. 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) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Polygon: Voronoi Extensions --------------------------- :Author: Andril Sydorchuk :Review Manager: Lucanus Simonson :Download: http://svn.boost.org/svn/boost/sandbox/gtl/ :Description: This library extends Boost.Polygon with the following features: - Robust and efficient implementation of the sweepline algorithm that allows to construct Voronoi diagram, Delaunay triangulation and medial axis of a set of points and line segments. - Coordinates of the output geometries are computed within the 64 machine epsilon relative error (6 mantissa bits). - Voronoi diagram data structure that allows efficient traversal and data association with the output Voronoi graph. - No 3rd party dependencies (e.g. GMP, MPFR), all the required multiple precision types are implemented as part of the library. - The input and output coordinate type domains are configurable via coordinate type traits, thus allowing to compute coordinates of the Voronoi vertices within any required precision. - The full construction of the Voronoi diagram of 100 000 points takes only 0.27 seconds (see benchmarks). Coroutine --------- :Author: Oliver Kowalke :Review Manager: Hartmut Kaiser :Download: http://gitorious.org/boost-dev/boost-dev/archive-tarball/coroutine :Description: This library is an implementation of coroutines and generators using Boost.Context. 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. TypeIndex --------- :Author: Antony Polukhin :Review Manager: Needed :Download: https://github.com/apolukhin/type_index :Description: TypeIndex is an extended C++11 type_index library, that * works with disabled RTTI * can store const-volatile-reference info about types (if user requested it) * has all the functionality of std::type_index * has portable across compilers and platforms functionality for getting demangled type names * works across modules/shared libraries * does not require C++11 to work 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. Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

3 8

[1.53] request to merge lockfree (c++11 only)
by Tim Blechmann 17 Nov '12

17 Nov '12

hi all, i'm not sure about the state of atomic, as the original author hardly reacts on emails and atm, i don't have the time to adopt it ... i'd therefore request permission to merge boost.lockfree into release, depending on std::atomic<>. this means, that it will require gcc-4.8 or msvc 2012 in c++11 mode to compile it (not sure about clang++, as their c++11 support under linux is pretty broken). the architecture of boost.lockfree is modular, so once boost.atomic is merged, it is trivial to use it again and allow use of the library with pre-c++11 compilers ... this is far from ideal, but boost.atomic has been blocking the release of boost.lockfree for a long time and it doesn't look like that it will be available before std::atomic<> is widely supported ... thoughts? tim

5 13

1.53 schedule change
by Daniel James 17 Nov '12

17 Nov '12

Hello everyone, I just noticed that I forgot to account for Christmas when setting the schedule for 1.53. I've adjusted it so that the deadlines for new libraries and major changes are a week earlier (as specified on the release schedule page). Sorry about that. There's still 3 weeks before the new library deadline, but please let us know soon if you have a new library for 1.53. thanks, Daniel

3 6

Boost.Process 0.5: Another update/potential candidate for an official library
by Boris Schaeling 17 Nov '12

17 Nov '12

I've uploaded a new version of Boost.Process 0.5 to <http://www.highscore.de/boost/process0.5/>: - Made child movable and non-copyable on Windows (destructor closes handles) - Added cross-platform helpers in a new header file boost/process/mitigate.hpp - Updated and improved documentation (eg. FAQ is new) - Added the POSIX initializer notify_io_service (Boost.Asio helper) - Minor bug fixes and improvements (eg. in search_path() on Windows) At this point there is nothing left on my todo list. I got quite a lot of feedback so far and would appreciate if people can look at this new version again. If there are no major shortcomings found, I'll ask for a formal review. Boris

10 53

[container] container_detail::pair piecewise constructor
by László Szécsi 17 Nov '12

17 Nov '12

Hi everyone, boost::container::container_detail::pair's piecewise constructor is missing, as acknowledged in a comment. This makes container::flat_map::emplace less useful (perhaps useless) as the following will not work: boost::container::flat_multimap<TestKey, TestValue> testMap; testMap.emplace(boost::container::container_detail::piecewise_construct, boost::make_tuple(30), boost::make_tuple(50)); where both TestKey and TestValue are non-copyable, moveable classes with a constructor taking an int. The compilation error message will correctly say that boost::container::container_detail::pair does not have a constructor with three arguments. I tried to implement the missing piecewise constructor based on std::pair's in the g++ standard libraries. I failed at it, so I would like to request some assistance and education. This is where I got: // from the standard lib template<std::size_t _Num> struct _Build_index_tuple { typedef typename _Build_index_tuple<_Num-1>::__type::__next __type; }; // from the standard lib template<> struct _Build_index_tuple<0> { typedef _Index_tuple<> __type; }; template <class... Args1, class... Args2> pair(piecewise_construct_t, ::boost::tuple<Args1...> first_args, ::boost::tuple<Args2...> second_args) : pair(::boost::move(first_args), ::boost::move(second_args), typename _Build_index_tuple<sizeof...(Args1)>::__type(), typename _Build_index_tuple<sizeof...(Args2)>::__type()) {} template<typename... Args1, std::size_t... Indices1, typename... Args2, std::size_t... Indices2> explicit pair(tuple<Args1...> tuple1, tuple<Args2...> tuple2, _Index_tuple<Indices1...>, _Index_tuple<Indices2...>) : first(::boost::forward<Args1>(std::get<Indices1>(tuple1))...), second(::boost::forward<Args2>(std::get<Indices2>(tuple2))...) { } This gets me a recursive error message far too long to quote, starting with: error C2664: 'boost::container::container_detail::pair<Key,T>::pair(std::pair<Key,T> &&)' : cannot convert parameter 3 from 'boost::tuples::tuple<int,boost::tuples::null_type // lot of null_types omitted to 'boost::tuples::tuple<boost::tuples::null_type, // lot of null_types omitted I used the VS2012 Nov CTP compiler. I understand that variadic templates have not been very portable and boost::unordered, which has a piecewise constructor implementation, does it completely differently and much more painfully. But is there a reason for the approach I tried not to work with boost at all? Could you please help me fix this code? Thank you very much, Laszlo Szecsi

3 3

Updated serialization performance tests
by Brian Wood 16 Nov '12

16 Nov '12

Shalom I've updated this page -- http://webEbenezer.net/comparison.html with results from Boost 1.52. A few notes about the testing: I decided to use -O2 on the Linux/g++ tests. In previous tests I used -O3. I hadn't updated the Windows test results since the Boost 1.48 time-frame. Around Boost 1.51 I had to start building the serialization library in Boost with runtime-link=static in order to get the Windows tests to build. I haven't understood why that became necessary, but the results for the serialization library in Boost seem to have been adversely affected by this. On Windows, I now report that tests built with the serialization library in Boost are over 1.8 times slower than parallel Ebenezer tests. Previously I reported the tests built with the serialization library in Boost were between 1.7 and 1.8 times slower than the Ebenezer tests. -- Brian Ebenezer Enterprises -- making programming fun again. http://webEbenezer.net

1 0

Boost.Test and Xcode 4.5 in C++11 Mode
by Dean Michael Berris 16 Nov '12

16 Nov '12

Hi Everyone, I'm trying to build Boost.Test in trunk in C++11 mode with Apple's released Clang compiler with Xcode 4.5. Is this supported by Boost.Test? I keep getting this error somewhere deep in some preprocessor parts which is far outside my understanding. Here's my user-config.jam: using clang : : : <cxxflags>-Wall <cxxflags>-Wself-assign <cxxflags>-std=c++11 <cxxflags>-stdlib=libc++ <linkflags>-stdlib=libc++ ; I ask because I'm using Boost.Test as my current unit testing framework for cpp-netlib. I'm going to need to make a decision on whether I can continue using Boost.Test in C++11 mode as cpp-netlib is moving to C++11-only in its next version. Thanks in advance. -- Dean Michael Berris www.deanberris.com

5 13

[test] A new ERROR in trunk including C++11 features on C++98 mode
by Vicente J. Botet Escriba 16 Nov '12

16 Nov '12

Hi, there is yet an error including C++11 features. Please could you take care of it? Thanks, Vicente darwin.compile.c++ ../../../bin.v2/libs/test/build/darwin-4.2.1/debug/link-static/threading-multi/framework.o In file included from ../../../boost/test/tools/assertion.hpp:19, from ../../../boost/test/tools/impl.hpp:25, from ../../../boost/test/test_tools.hpp:373, from ../../../boost/test/impl/framework.ipp:27, from ../../../libs/test/src/framework.cpp:16: ../../../boost/test/utils/is_forward_iterable.hpp:58: error: ‘>>’ should be ‘> >’ within a nested template argument list ../../../boost/test/utils/is_forward_iterable.hpp:61: error: ‘>>’ should be ‘> >’ within a nested template argument list "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -pedantic -g -gdwarf-2 -fexceptions -DBOOST_ALL_NO_LIB=1 -I"../../.." -c -o "../../../bin.v2/libs/test/build/darwin-4.2.1/debug/link-static/threading-multi/framework.o" "../../../libs/test/src/framework.cpp" ...failed darwin.compile.c++ ../../../bin.v2/libs/test/build/darwin-4.2.1/debug/link-static/threading-multi/framework.o...

6 16

BOOST_FUSION_ADAPT_STRUCT - Printing Array Elements
by forums_mp 16 Nov '12

16 Nov '12

Given the snippet below. How do I print the contents within the array ? I'd expect to see a counting pattern when the array is encountered but that's not the case. Thanks in advance. [code] #include <boost/mpl/eval_if.hpp> #include <boost/mpl/identity.hpp> #include <boost/mpl/next_prior.hpp> #include <boost/fusion/mpl.hpp> #include <boost/fusion/adapted.hpp> // BOOST_FUSION_ADAPT_STRUCT // boost::fusion::result_of::value_at #include <boost/fusion/sequence/intrinsic/value_at.hpp> #include <boost/fusion/include/value_at.hpp> // boost::fusion::result_of::size #include <boost/fusion/sequence/intrinsic/size.hpp> #include <boost/fusion/include/size.hpp> // boost::fusion::at #include <boost/fusion/sequence/intrinsic/at.hpp> #include <boost/fusion/include/at.hpp> # include <iostream> # include <vector> typedef std::vector < int > INT_VEC ; // Your existing struct struct my_struct { int i; bool j; int arr1 [ 100 ]; // INT_VEC vv ; // my_struct() // : vv ( 100 ) // {} }; // Generate an adapter allowing to view "Foo" as a Boost.Fusion sequence BOOST_FUSION_ADAPT_STRUCT( my_struct, (int, i) (bool, j) (int, arr1[ 100 ] ) // (int, vv[100]) ) template <typename T2> struct parse_foo { static void parse(T2 & f); }; struct display { template <typename T> void operator()(T& t) const { std::printf(" --%s--%s-- \n", typeid(t).name(), boost::lexical_cast<std::string>(t).c_str()); if (typeid(t).name()[0] == 'c') std::printf(" --%s--%s-- \n", typeid(t).name(), t); parse_foo<T>::parse(t); } }; template <> void parse_foo<int >::parse(int & f) { std::cout << f << std::endl; } template <> void parse_foo<char>::parse(char & f) {}; template <> void parse_foo<bool>::parse(bool & f) { std::cout << f << std::endl; }; #include <boost/fusion/include/sequence.hpp> #include <boost/fusion/include/algorithm.hpp> #include <boost/fusion/include/vector.hpp> #include <boost/fusion/include/adapt_struct.hpp> #include <boost/lexical_cast.hpp> int main() { my_struct f; f.i = 33 ; f.j = false ;; for ( int odx ( 0 ); odx < 100; ++odx ) { f.arr1 [ odx ] = odx ; } boost::fusion::for_each(f, display()); } [/code] -- View this message in context: http://boost.2283326.n4.nabble.com/BOOST-FUSION-ADAPT-STRUCT-Printing-Array… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0