November 2012 - Boost - lists.preview.boost.org

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

19 Nov '12

On 17 November 2012 19:44, Francisco Jos? Tapia <fjtapia(a)gmail.com> wrote: > 2012/11/16 Vadim Stadnik <vadimstdk(a)gmail.com> > > On Sat, Nov 17, 2012 at 4:25 AM, Leo Goodstadt <leo.goodstadt(a)llew.org.uk wrote: > > > > > > 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 > > > > > > > > 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… ) > > As far as I know, this support is not yet available in countertree project, > > although this is possible in principle. > > About the compatibility with the boost Statistical Accumulators Library, I > didn't thought about it, but it would be useful. I will try to implement, > but I need to examine in deep for to provide you a well founded opinion. > 1) For counter trees, the median is just the N/2-th value in the counter tree, where K is the size of the tree. The Nth-percentile can be calculated similarly. A rolling median with a fixed size window requires there to be an insertion and deletion for each (most!) new value, so I am guessing it should run in O(N log K) time, where N = size of data, K = size of window 2) The alternative is to use two multisets corresponding to values smaller and larger than the current median (or the Nth percentile). This should also have O(N log K) complexity. 3) With the special case where the data consists of integers in a fixed range, we can use a segment tree where the complexity would be O(N log R) where R = the size of the fixed range of data values. This can result in considerable speed ups. The best bit about counter trees are their flexibility, we can calculate multiple Nth-percentiles at the same time (e.g. all the quartiles). As to the actual rather than theoretical speed, I think we need bench-marking.... Leo

2 1

[boostcon12]Trouble with tuples very compiler dependent
by Larry Evans 19 Nov '12

19 Nov '12

This thread is a continuation of that started here: http://article.gmane.org/gmane.comp.lib.boost.devel/235427 It's been renamed because the new name is more topical. The tree_builder benchmarks mentioned here: http://article.gmane.org/gmane.comp.lib.boost.devel/235386 were refactored into: tuple_benchmark.tree_builder.cpp tuple_impl.bcon12_horizontal.hpp tuple_impl.bcon12_vertical.hpp and various other .hpp files. The benchmark was run as shown in the attached filt.compilation. The output after line: :filt_dr= shows with compiler=gcc4_8, the bcon12_horizontal implementation is slower than the bcon12_vertical. This agrees, at least qualitatively, with the page 12 bar chart from Eric's boostcon12 pdf file: trouble_with_tuples.pdf downloadable from here: https://github.com/boostcon/cppnow_presentations_2012/zipball/master and in the mon directory. The variadic bar in the pag12 bar chart corresponds to the: tuple_impl.bcon12_horizontal.hpp tuple implementation in the sandbox slim/test directory. The unrolled bar in the pag12 bar chart corresponds to the: tuple_impl.bcon12_vertical.hpp In contrast to the gcc4_8 compiler, with the clangxx compiler, the relative qualitative performance, is just the opposite. IOW, the bcon12_horizontal implementation is faster than the bcon12_vertical implementation. In fact, the rate of change of the performance difference accelerates as tree depth goes from 2 to 4. The rate of change is so stark that it suggests, at least to me, there may be some bug in clang. Of course that conclusion is based on almost no knowledge, on my part, of the clang implementation. The tuple_benchmark_filt.py can be modified to filter out other parts of the benchmark run output, which is here: http://svn.boost.org/svn/boost/sandbox/variadic_templates/sandbox/slim/test… In conclusion, whether it's best to use vertical or horizontal tuple implementation depends on the compiler. -regards, Larry

2 3

Build errors with msvc/release/pdb
by Christoph Macheiner 19 Nov '12

19 Nov '12

The following libraries generate errors when using msvc, building for release and generating the program debug database: date_time, locale, math (all), thread, wave. Except for math, this seems to be caused by having at least one directory specified in the /Fd option. Also, there are 251 .pdb files in the boost root directory instead of their respective output directory (presumably from serialization, unit_test, math, and most probably others). The command-line is: bjam link=shared runtime-link=shared variant=release --layout=system --stagedir=.\stage stage debug-symbols=on debug-store=database I am at a loss on how to fix this. Can someone help? On a related note, the .pdb files are automatically generated when building for debug. Is there an easy switch somewhere in the sources, so that I can turn this on globally also for release as a work-around? For reference, below is the output for the first file for each library, plus contents of the corresponding .rsp file Thanks, Christoph. ======================================== compile-c-c++ bin.v2\libs\date_time\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\gregorian\greg_month.obj greg_month.cpp libs\date_time\src\gregorian\greg_month.cpp : fatal error C1033: cannot open program database 'd:\dev\boost_1_52_0\gregorian\greg_month.pdb' call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\date_time\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\gregorian\greg_month.obj.rsp" ---------------------------------------- "libs\date_time\src\gregorian\greg_month.cpp" -Fo"bin.v2\libs\date_time\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\gregorian\greg_month.obj" /Fd"gregorian\greg_month.pdb" -TP /O2 /Zi /Ob2 /W3 /GR /MD /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_DYN_LINK=1 -DBOOST_ALL_NO_LIB=1 -DDATE_TIME_INLINE -DNDEBUG "-I." ======================================== compile-c-c++ bin.v2\libs\locale\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\encoding\codepage.obj codepage.cpp libs\locale\src\encoding\codepage.cpp : fatal error C1033: cannot open program database 'd:\dev\boost_1_52_0\encoding\codepage.pdb' call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\locale\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\encoding\codepage.obj.rsp" ---------------------------------------- "libs\locale\src\encoding\codepage.cpp" -Fo"bin.v2\libs\locale\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\encoding\codepage.obj" /Fd"encoding\codepage.pdb" -TP /O2 /Zi /Ob2 /W3 /GR /MD /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_NO_LIB=1 -DBOOST_LOCALE_DYN_LINK=1 -DBOOST_LOCALE_NO_POSIX_BACKEND=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_THREAD_NO_LIB=1 -DNDEBUG "-I." ======================================== compile-c-c++ bin.v2\libs\math\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\assoc_laguerre.obj assoc_laguerre.cpp libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : error C2858: command-line option 'program database name (/Fdd:\dev\boost_1_52_0\assoc_laguerre.pdb)' inconsistent with precompiled header, which used '/Fdd:\dev\boost_1_52_0\vc110.pdb' libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : error C2859: d:\dev\boost_1_52_0\assoc_laguerre.pdb is not the pdb file that was used when this precompiled header was created, recreate the precompiled header. call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\math\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\assoc_laguerre.obj.rsp" ---------------------------------------- "libs\math\build\..\src\tr1\assoc_laguerre.cpp" -Fo"bin.v2\libs\math\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\assoc_laguerre.obj" /Fd"assoc_laguerre.pdb" -Yu"pch.hpp" -Fp"bin.v2\libs\math\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\pch.pch" -TP /O2 /Zi /Ob2 /W3 /GR /MD /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_NO_LIB=1 -DBOOST_BUILD_PCH_ENABLED -DBOOST_MATH_TR1_DYN_LINK=1 -DNDEBUG "-I." "-Ilibs\math\src\tr1" ======================================== compile-c-c++ bin.v2\libs\thread\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\win32\thread.obj thread.cpp libs\thread\src\win32\thread.cpp : fatal error C1033: cannot open program database 'd:\dev\boost_1_52_0\win32\thread.pdb' call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\thread\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\win32\thread.obj.rsp" ---------------------------------------- "libs\thread\src\win32\thread.cpp" -Fo"bin.v2\libs\thread\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\win32\thread.obj" /Fd"win32\thread.pdb" -TP /O2 /Zi /Ob2 /W4 /GR /MD /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_SYSTEM_NO_DEPRECATED -DBOOST_THREAD_BUILD_DLL=1 -DBOOST_THREAD_DONT_USE_CHRONO -DBOOST_THREAD_THROW_IF_PRECONDITION_NOT_SATISFIED -DNDEBUG "-I." ======================================== compile-c-c++ bin.v2\libs\wave\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\cpplexer\re2clex\aq.obj aq.cpp libs\wave\src\cpplexer\re2clex\aq.cpp : fatal error C1033: cannot open program database 'd:\dev\boost_1_52_0\cpplexer\re2clex\aq.pdb' call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"bin.v2\libs\wave\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\cpplexer\re2clex\aq.obj.rsp" ---------------------------------------- "libs\wave\src\cpplexer\re2clex\aq.cpp" -Fo"bin.v2\libs\wave\build\msvc-11.0\release\debug-store-database\debug-symbols-on\threading-multi\cpplexer\re2clex\aq.obj" /Fd"cpplexer\re2clex\aq.pdb" -TP /O2 /Zi /Ob2 /W3 /GR /MD /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_DYN_LINK=1 -DBOOST_ALL_NO_LIB=1 -DNDEBUG -D_CRT_SECURE_NO_DEPRECATE -D_SCL_SECURE_NO_DEPRECATE "-I." ========================================

2 1

User config commands needed to find Clang tools ar and ranlib
by Paul A. Bristow 19 Nov '12

19 Nov '12

I am trying to use the Clang compiler to build a Boost.Test library and have now found the necessary user-config.jam to select the compiler (thanks Jurgen Hunold) , but the link stage tools are not being found. Can anyone suggest what bjam incantation is needed ? Thanks Paul clang-linux.archive i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\th reading-multi\libboost_prg_exec_monitor-clang31-mt-sd-1_53.lib '"ar"' is not recognized as an internal or external command, operable program or batch file. '"ranlib"' is not recognized as an internal or external command, operable program or batch file. "ar" rc "i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\t hreading-multi\libboost_prg_exec_monitor-clang31-mt-sd-1_53.lib" "i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\t hreading-multi\execution_monitor.obj" "i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\t hreading-multi\debug.obj" "i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\t hreading-multi\cpp_main.obj" "ranlib" "i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\t hreading-multi\libboost_prg_exec_monitor-clang31-mt-sd-1_53.lib" ...failed clang-linux.archive i:\boost-trunk\boost\bin.v2\libs\test\build\clang-linux-3.1\debug\link-static\runtime-link-static\th reading-multi\libboost_prg_exec_monitor-clang31-mt-sd-1_53.lib... My user-config.jam contains using clang : #version 3.1 : # compiler "C:/mingw32-dw2/bin/clang++.exe" #"C:/mingw32-dw2/bin/ar.exe" <<<< actual locations of tools #"C:/mingw32-dw2/bin/ranlib.exe" <<<< actual locations of tools : # options <cxxflags>-v # verbose for testing. <cxxflags>-IC:/mingw32-dw2/include/c++/4.6.3 # for stdlib? #e:/dev/apps/mingw64/include/c++/4.7.2 <cxxflags>-IC:/mingw32-dw2/i686-w64-mingw32/include #e:/dev/apps/mingw64/include/c++/4.7.2/x86_64-w64-mingw32 # <cxxflags>-std="c++11" <root>"C:/mingw32-dw2/bin" # attempt to find the link tools ; --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

[container] Missing image
by Klaim - Joël Lamotte 19 Nov '12

19 Nov '12

Hi, I thought I pointed it already last year but there is at least one missing important image in the boost container documentation: http://www.boost.org/doc/libs/1_52_0/doc/html/container/non_standard_contai… Joel Lamotte

1 0

[#pragma once]
by Sid Sacek 18 Nov '12

18 Nov '12

I've worked with the MSVC, Sun and GCC compilers. Each one of them supports #pragma once. Is there any reason to wrap this pragma within #ifdefs? Are there any compilers out there today that don't support this #pragma? #if defined( _MSC_VER ) && ( _MSC_VER >= 1020 ) # pragma once #endif Could we change this coding pattern so that it no longer looks like MSVC is being selfish? -Sid Sacek

17 20

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