July 2012 - Boost-users - lists.boost.org

Re: [Boost-users] testing archive version of boost::serialize
by Sam Appleton 16 Jul '12

16 Jul '12

Hi Robert Thanks for replying. I realize perhaps I was not clear or do not fully understand your answer. I was not really looking for ways to test my archive class. Let's say I know I have an archive file that's been generated by my archival class, but it has an indeterminate version that may or may not be compatible with the present version. In order for me to determine the embedded version of the archive, the only way I know of is to just attempt to deserialize (I do this using (archive-stream) >> (object) ; ) and seeing if a version incompatability is flagged. However, is there any way to determine just from an open archive stream what the version number of the embedded stream or classes implied by the stream contains? Sam >Check the documentation section Reference/Archive Class Reference/Testing > >This explains how you can submit your archive class to the exhaustive >series of tests that all the "built-in" archives are subjected to. It does >take a while to run the tests. And then it makes even more time to >get your custom archive to pass all the tests. But you will be >rewarded with something you should be able to depend upon. > >Robert Ramey -- -- Sam Appleton CEO, Ausdia Inc. o: (408) 914 2704 x801 f: (408) 914 2704 c: (650) 242 2908 Email sam(a)ausdia.com Skype samsappleton

2 1

[1.50.0] PDF documentation available
by John Maddock 15 Jul '12

15 Jul '12

With apologies for being so late with these.... The PDF build of Boost's documentation for 1.50 is available from the usual SF site: https://sourceforge.net/projects/boost/files/boost-docs/1.50/ John.

2 1

testing archive version of boost::serialize
by Sam Appleton 14 Jul '12

14 Jul '12

Is there any way to "test" the version of a boost serialization archive. I know that we can always just attempt to deserialize and catch the generated exception, but is there any way to just test the version of the archive before attempting deserialization? Best Sam Appleton

2 1

aiso signal handling, daemon shutdown
by Kraus Philipp 13 Jul '12

13 Jul '12

Hello, I try to create a working example for a daemon with http://www.boost.org/doc/libs/1_50_0/doc/html/boost_asio/overview/signals.h… I have created a program like: static bool run = true; void handler( const boost::system::error_code& error, int signal_number) { if (!error) { run = false; std::cout << "signal" << std::endl; } } and the main with int main(..) { boost::asio::io_service io_service; boost::asio::signal_set signals(io_service, SIGINT, SIGTERM); signals.async_wait(handler); while (run) { boost::this_thread::yield(); } } The program runs, but if I do "kill pid" the program does not stop or shows the message. I would like to create a small daemon which runs some threads and can stop with the normal stop signal and can reload the configuration on reload. Can anyone help me to create a working example first !? Thanks a lot Phil

2 2

mult_array view question
by Petros 13 Jul '12

13 Jul '12

Hi, I have the following question: The documentation describes how to obtain an array view for a small number of dimensions by repeated application of the [] operator of boost::indices. Is there a way to do it in a single call, bypassing the C-type notation? Say, I have a five dimensional multi_array (ma, henceforth) and want to get a slice in one dimension. Is there a call to do this ? I am looking for a generic answer. TIA, Petros PS: was hoping that the ranges_ field of extent_gen could do the trick, since all the info is there - I know it’s in the detail namespace which practically means private/subject-to-change but had no better idea.

1 0

What algorithms for solving the Shortest Paths problem are implemented in BOOST?
by Alex Sadovsky 13 Jul '12

13 Jul '12

I know, Dijkstra's and the Bellman-Ford one are. Is Dial's? http://dl.acm.org/citation.cfm?id=363610 Thanks, Al

2 1

Review Wizard Status Report for July 2012
by Ronald Garcia 13 Jul '12

13 Jul '12

============================================== Review Wizard Status Report for July 2012 ============================================== News ==== 1. Multiprecision Arithmetic Reviewed 2. Boost 1.50.0 Released. New Libraries: 1) Algorithm 2) Functional/OverloadedFunction 3) LocalFunction 4) Utility/IdentityType Open Issues =========== The following libraries have been reviewed and await reports from their review managers: * Conversion - reviewed August 2011; review manager: Gordon Woodhull. * Predef - reviewed February 2012; review manager: Joel Falcou. * Multiprecision - reviewed June 2012; review manager: Jeffrey Hellrung 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. 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. * Context - accepted January 2012; author: Oliver Kowalke. 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 before we do that, 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 * Type Erasure * Range Extensions * Contract * Nowide (M) * ODEint (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. Type Erasure ------------ :Author: Steven Watanabe :Review Manager: Lorenzo Caminiti :Download: http://sourceforge.net/projects/steven-watanabe.u/files/ :Description: The TypeErasure library is a generalization of boost::any and boost::function. It allows easy composition of arbitrary type erased operators. 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. Contract -------- :Author: Lorenzo Caminiti :Review Manager: Dave Abrahams :Download: http://sourceforge.net/projects/contractpp/files/latest/download :Description: This library implements Contract Programming for the C++ programming language (see the end of this email). In addition, the library implements virtual specifiers (final, override, and new, see C++11), concept checking, and named parameters. This library is implemented for the C++03 standard and it does not require C++11. 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. ODEint ------ :Author: Karsten Ahnert and Mario Mulansky :Review Manager: Needed :Download: https://github.com/headmyshoulder/odeint-v2 :Description: odeint provides routines for numerically solving Ordinary Differential Equations, a task heavily required when approaching scientific problems numerically. In odeint we have implemented the most common algorithms in a modern, generic way which provides several advantages over existing implementations. The main focus of odeint is to separate algorithms from the underlying basic computation unit. This allows for example to easily use the power of modern GPUs via CUDA or OpenCL to speed up computational heavy simulations. Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

eos_portable_archive for 1.49
by Paul Harris 13 Jul '12

13 Jul '12

Hi all, Does anyone know if eos_portable_archive is still actively used and maintained? It doesn't compile with boost 1.49, and before I try to fix it up, I was wondering if anyone else has fixed it up. cheers Paul

7 11

[1.48] interprocess consumes 100% on 32bit Windows systems
by Bogdan Slusarczyk 13 Jul '12

13 Jul '12

Hi All, I found such problem: N+1 (where N is number of cpu cores) processes with interprocess syncing use 100% cpu on 32 bit Windows system. Cause of bug: https://svn.boost.org/trac/boost/changeset/74110 void sched_yield() -{ Sleep(1); } +{ + if(!SwitchToThread()){ + Sleep(1); + } Test case: #include <windows.h> #include <iostream> int main() { int i = 0; while( true ) { if ( !SwitchToThread() ) { std::cout << "sleep" << i++ << std::endl; Sleep(1); } } } On 32 bit windows system running this in N+1 separate processes will stop printing and use 100% CPU. On 64 bit system for any number of processes printing will not stop. Kind regards, Bogdan

1 0

const native arrays at compile time
by Hicham Mouline 12 Jul '12

12 Jul '12

Hello, I have a number of questions, some of which are boost specific. 1. const std::string cols[] = { "col1", "col2", "col3" }; Is the const native array cols completely a compile-time construct or are std::string objects constructed at runtime? I would guess the latter? 2. const char const* cols[] = { "col1", "col2", "col3" }; This on the other hand would be pure compile time? 3. struct S1 { const char const* cols[] = { "col1", "col2", "col3" }; }; struct S2 { const char const* cols[] = { "colx", "coly", "coly" }; }; template <typename T> /// T is either S1 or S2 struct S { const char const* col1s[] = { "othercol", /// elements of T::cols }; }; Is there a way to build col1s at compile time? MM

3 2