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

Setup Boost::Signals2 with Remote Objects?
by Clark Cianfarini 18 Aug '12

18 Aug '12

Hello, I am trying to develop a server/client set of applications in C++ that has the ability to be setup either all on one computer, or distributed across multiple machines (generally over an intranet). The goal is to have a possibility of N clients all connected to a single server. The server collects data from our various sensors, bundles it into a single object, and ideally triggers a Boost::Signal2, passing the object, to send the data to all subscribed clients. The resulting processing methods of each client would be the subscribed slots and thus the processing would automatically be triggered. The current software is designed this way through the use of .NET remoting, but we are trying to move away from being tied down to the Windows realm. I cannot seem to find documentation as to how to set up remote objects in such a way to connect the signals and slots across processes/computers. Do I have to do this through the use of Boost::MPI in some manner? Or do I need to change my thought process and use just Boost::MPI with object serialization to just pass the data? Or is there some third option I should be looking at instead? Thank you, Clark <mailto:ccianfarini@Lumetrics.com> ccianfarini(a)Lumetrics.com

2 1

boost optional assignment
by tolik levchik 17 Aug '12

17 Aug '12

The following code gives me compilation error. With const reference it's ok. Is it right behaviour? #include <boost/optional.hpp> #include <boost/shared_ptr.hpp> struct foo{ // foo(int const& of) good foo(int& of) // error {} }; int main(){ boost::shared_ptr<int> ptr; boost::optional<foo> opt; opt = *ptr; }

2 1

boost::math::standard_deviation how to use ?
by leeto 17 Aug '12

17 Aug '12

How to compute standard_deviation using boost I want that interface will be like in excel i mean you mark some data and that all ) How do the same in c++ boost using data from a standard container like vector for example... Many thanks in advance #include <boost/math/distributions.hpp> // For non-member functions of distributions #include <vector> #include <numeric> using namespace std; int main () { std::vector<double> v; for (unsigned int i = 0; i < 7; i++) { v.push_back(std::rand()%7); } std::vector<double>::iterator i = v.begin(); for (i ; i != v.end(); ++i) { std::cout << (*i) << ", "; } cout << std::accumulate(v.begin(), v.end(),0) << endl; //boost::math::normal_distribution cout << "\n\n\n" ; return 0; -- View this message in context: http://boost.2283326.n4.nabble.com/boost-math-standard-deviation-how-to-use… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

interrupt a blocking stream read
by Chris Stankevitz 17 Aug '12

17 Aug '12

I am attempting to interrupt a blocking stream read. The below code doesn't work since std::istream::read is not a valid boost thread interruption point. Can someone recommend a way to get something like this work work, preferably using boost's cross-platform constructs? Thank you, Chris === void f() { try { char c[999999999]; cin.read(c, 999999999); } catch (boost::thread_interrupted) { } } int main() { boost::thread t(f); f.interrupt(); f.join() return 0; }

1 0

[chrono] Issues with _ITERATOR_DEBUG_LEVEL
by Christian Henning 17 Aug '12

17 Aug '12

Hi there, compiling with the latest trunk version gives me the following linker error with the chrono lib: libboost_chrono-vc100-mt-1_51.lib(chrono.obj) : error LNK2038: mismatch detected for '_ITERATOR_DEBUG_LEVEL': value '0' doesn't match value '2' in Factory.obj Usually the solution is to recompile the lib with _ITERATOR_DEBUG_LEVEL=2 but the problem preservers. Can someone tell what wrong with compiling boost with: bjam -j8 --toolset=msvc --without-mpi variant=debug link=static runtime-link=shared define=_CRT_NONSTDC_NO_DEPRECATE define=_CRT_SECURE_NO_DEPRECATE define=_SCL_SECURE_NO_DEPRECATE define="_ITERATOR_DEBUG_LEVEL=2" stage I mean, is the define="_ITERATOR_DEBUG_LEVEL=2" syntactically correct? Thanks, Christian

3 7

Removing intermediate files
by Lloyd 17 Aug '12

17 Aug '12

Hi, I am using bjam to buiild boost (1.47) Windows. I would like to remove the temporary/intermediate files created by the build process to save the space. Checking the documentation, I found the --clean, --clean-all options but they removes the library. Whats the right method to remove the intermediate files? Thanks, Lloyd

2 1

[mpi] communicators constructed from groups are invalid
by Daniel Mitchell 16 Aug '12

16 Aug '12

Hi everyone, when I construct a communicator from a group, the resulting communicator is invalid. Here's an example. //------------------------------ example begin -------------------------------// #include <boost/mpi/communicator.hpp> #include <boost/mpi/environment.hpp> #include <boost/mpi/group.hpp> int main(int ac, char** av) { boost::mpi::environment env(ac, av); boost::mpi::communicator world; int rank[] = {0}; boost::mpi::communicator comm(world, world.group().include(rank, rank + 1)); } //------------------------------ example end ---------------------------------// This program throws an exception when comm is destroyed (MPI_Comm_free: MPI_ERR_COMM: invalid communicator). If I try calling comm.size() or something, it throws an "invalid communicator" exception then, too. However, asserting on comm succeeds, so clearly comm is confused about its state. I found some outstanding tickets (5596, 6436) but those discussions don't seem to go anywhere. Can anyone offer help?

1 0

[MPI] how to compile Boost.MPI on Cray Linux?
by Riccardo Murri 16 Aug '12

16 Aug '12

Hello, I'm trying to compile Boost.MPI on a Cray XK6 machine. The MPI wrapper compiler is called `CC` and should be invoked with no particular options. However, Boost complains that `CC` is not known and does not compile Boost.MPI: MPI auto-detection failed: unknown wrapper compiler CC Please report this error to the Boost mailing list: http://www.boost.org You will need to manually configure MPI support. warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. I have added the following to the top-level `project-config.jam` file, but it does not help Jam to DTRT: using mpi : CC ; Any hints on how to proceed? Thanks, Riccardo

3 3

[xpressive] accessing nested results from a submatch
by Nathan Ridge 16 Aug '12

16 Aug '12

Hi, Is there a way to access nested results associated with a submatch? For example: sregex A = some_xpr; sregex B = (s1 = A) >> other_xpr >> (s2 = A); smatch m; regex_match(str, m, B); I know I can get a list of all the nested matches inside m, and I can filter it down by regex id to matches for A, but is there a way to get, say, "the nested matches for A that occurred inside the sub-match s2" without necessarily knowing what is the position of that in the list of all nested matches for A? Thanks, Nate

1 0

Review Wizard Status Report for August 2012
by Ronald Garcia 15 Aug '12

15 Aug '12

============================================== Review Wizard Status Report for August 2012 ============================================== News ==== 1. Multiprecision Arithmetic Reviewed 2. Type Erasure Reviewed 3. 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: * 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, 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 * Contract * Nowide (M) * ODEint * Array (M) * TypeIndex (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. 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: Steven Watanabe :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. 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 Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0