- Boost-users - lists.preview.boost.org

[BGL] vecS for vertex container and vertex index adjustments
by Sergey Mitsyn 03 Oct '12

03 Oct '12

Hi all, I know that while using vecS for vertices one has no vertex iterator stability upon removing vertices. But I have a question if there exists something like vertex _index_ stability. The documentation says that indices for vertices are automatically adjusted so that they are still in contiguous range, but it is not specified how it is done. Is it okay to assume that if a vertex with an index I is removed, then vertices with indices < I have their indices unchanged, while vertices with indices > I have their indices decreased by one? The actual problem is removing all vertices meeting some condition. Is the following code ok? // traverse all vertices and remove those for which predicate // condition_to_remove_vertex returns true. // graph is adjacency_list<.., vecS, ...> vertex_iterator vi = vertices(graph).first, vi_end = vertices(graph).second; while (vi != vi_end) { if (condition_to_remove_vertex(vi, graph)) { vertices_size_type end_index = vertex_index[*vi_end] , vi_index = vertex_index[*vi]; remove_vertex_f(*vi, graph); // vi and vi_end are invalid --end_index; vi = vertices(graph).first + vi_index; vi_end = vertices(graph).first + end_index; // now vi and vi_end are valid again } else ++vi; } This way seems to be more effective than to start iteration again every time a vertex is removed. ------------ Sergey Mitsyn.

3 14

C++ (boost) library for serial port communication
by Alexander Dietz 03 Oct '12

03 Oct '12

Hi all, I wonder if there is a boost-library that enables easy and robust communication to a serial port, just as e.g. the python library pyserial does. Maybe there is a boost-library which can be used for those purpose instead of implementing my own C-style classes and functions? Thanks a lot, Alex

5 7

A couple of odeint questions
by Tiago Gehring 02 Oct '12

02 Oct '12

Hello, I've been using the odeint library for some time now - and I really like it, thanks for the great work! I know that the odeint library is currently being reviewed but I'm actually writing here to ask a couple of questions about my usage scenario, hope that I'm in the right place. My usage scenario involves neural networks where I have a set of n equations for the N neurons themselves and another m equations for all the M synapses (connections) where usually M >> N and the two sets of equations depends on each other. What I'm trying to do is to put all these N + M equations into one large system and to integrate them at once while also keeping the state vectors separated. This is because of the different dimensionality of the two sets of equations and because my intention is to later use OpenCL to do the calculations (which as I understand works better if you use something like a vexcl::multivector<double, M> + another vexcl::multivector<double N> and I don't see how to pack all of this in one large state vector); So my first question is: can I somehow "combine" two sets of state vectors into one thing or integrate two systems in parallel (synchronously)? I tried the former (one combined state object) and even defined my own combined algebra (a std::pair of std::vectors - later vexcl::multivectors) but then stumbled into problems with my value type (which I defined as a std::array<double, 2>). It seems that I have to define all possible mathematical and comparison operations for my pairs (arrays). And my second question: my problem involves integrating the system until one of the neurons fires - at which point it's state variable (membrane potential) jumps to a fixed value, i.e., I have a sharp discontinuity in the state variable. My way of dealing with this right now was to implement a custom integration function (based on the adaptive integration one) which has a built in function that checks if the threshold was reached at every integration step. When this happens I break the integration, reset the state of the neuron in question to the fixed value and start integrating again. I wonder if it's possible to solve this in an easier way... Is it possible for example to change the state on the fly and can the system handle discontinuities? (i.e. can I integrate without stopping each time a neuron fires). Thanks a lot, Tiago

2 2

lisp like operetor collection on well kown C++ data structure
by Niitsuma Hirotaka 02 Oct '12

02 Oct '12

I wrote scm2cpp.hpp https://github.com/niitsuma/scm2cpp.hpp/blob/master/scm2cpp.hpp scm2cpp.hpp is lisp like operetor collection on well kown C++ data structure lisp function car cdr cons list-ref set-car! .. etc can use for std::vector std::list boost::ptr_list boost::fusion::list and std::pair is regard as cons example usage https://github.com/niitsuma/scm2cpp.hpp/blob/master/usage.cpp https://github.com/niitsuma/scm2cpp.hpp/blob/master/list-test.cpp Also eq? eqv? equal? quote symbol functions are implemented. plz see usege https://github.com/niitsuma/scm2cpp.hpp/blob/master/equal-test.cpp eq? function implimeted as direct addrest comparison template<typename T> bool is_eq(T & x, T & y) {return (&x)==(&y);} thus cons(T, std::list<T>) becomes boost::ptr_list<T> All lisp like operator keep same address for same object.

1 0

[Build] configure files copied into stage directory
by Alexander Khomyak 01 Oct '12

01 Oct '12

Hi. I build library binaries from source using build system. And now the system copies dll and lib-files into stage directory. But I also need to copy pdb-files. How to configure the build system to do so? Regards, Alexander Khomyak

1 0

[ICL] Specific interval_map
by A G 01 Oct '12

01 Oct '12

Hello, I am trying to see whether I can use interval_map for my project. I was initially amazed with interval_map and thought this would be it, but then I have some doubts: I need a interval tree like interval_map, but the aggregated values have the following equivalent property: equal to the length of the interval it is aggregated with. An example: [0:3] -> 3 [4:8] -> 4 Then if I add the interval [2:5] with aggregated value 3 (step 1) to this container, this should end up with: [0:1] -> 1 [2:3] -> 1 [4:5] -> 1 [6:8] -> 2 which I would later need to change into (step 2) : [0:1] -> 1 [2:5] -> 3 ([2:3] and [4:5] are merged because what matter is the last inserted interval: [2:3]). [6:8] -> 2 I am not sure I can do step 1 in just overloading the operator+= over my aggregated values. Could you please confirm ? If so, is there any part of the library I can reuse to do this task (like a function overloading, but which one) or do I have to rewrite an ad-hoc insert-like method myself ? Thank you for your hints. BR, AG.

2 2

Video About Open Source Credit Rating Tool Using Boost
by Marc Joffe 30 Sep '12

30 Sep '12

I am looking for users and developers interested in collaborating on an open source sovereign rating model project. If you don't agree with your country's credit rating, here is a chance to do something about it! A video describing this project is available at http://www.youtube.com/watch?v=71d3FXCqKtY and a journal article explaining the rationale can be found at http://econjwatch.org/articles/rating-government-bonds-can-we-raise-our-grad e. The tool is available at http://www.publicsectorcredit.org/pscf.html. Source is posted at http://www.github.com/joffemd/pscf. The tool uses a Monte Carlo simulation which includes calls to Boost's normal and Cauchy random number generators. There are many opportunities for improvement upon the initial version. Please contact me if interested. Regards, Marc Joffe Public Sector Credit Solutions marc(a)publicsectorcredit.org

2 1

Re: [Boost-users] [Review] ODEInt review starts today, September 19, ends September 28
by Mario Mulansky 29 Sep '12

29 Sep '12

Hi Paul, thanks for your comments, I have just a quick note. > ... > Modern expression templates are de rigeur. Works with Boost.Units which > is a big plus. Also meshes > with Fusion and Arbitrary Precision types so will presumably work with > the recently accept > Multiprecision library. Yes, odeint works out-of-box with the Multiprecision library. I have checked this in the course of the multiprecision review process [1]. Best, Mario [1] http://lists.boost.org/Archives/boost/2012/06/194473.php

2 1

[Serialization] GCC Symbol Visibility
by drivehappy 29 Sep '12

29 Sep '12

I'm attempting to build the serialization library outside of the standard build mechanism for Boost. For the most part this works great, with the exception that the symbol visibility under GCC is not defined correctly - our compiler settings set visibility to "hidden". Snippets from boost/serialization/config.hpp: #define BOOST_SERIALIZATION_DECL(T) __declspec(dllexport) T ... #define BOOST_SERIALIZATION_DECL(T) __declspec(dllimport) T I believe there has been previous discussion on changing these to BOOST_SYMBOL_EXPORT and BOOST_SYMBOL_IMPORT respectively since the __declspec is MSVC specific (http://boost.2283326.n4.nabble.com/Questions-regarding-new-visibility-stuff…) Additionally a patch was suggested (https://svn.boost.org/trac/boost/ticket/2114) that I believe at the time covered all of the boost libraries with the same changes. It doesn't appear to have gotten into Boost.Serialization (at least as of 1.51). If it would save time I could provide a patch specifically for Serialization. Thanks.

2 1

Handling core dumps when process is holding boost interprocess lock
by Rajalakshmi Iyer 28 Sep '12

28 Sep '12

Hello, I am working on application where several multi-threaded processes are attempting to acquire a lock on the shared memory files managed via boost interprocess. It appears that if one of these processes dumps a core while holding a lock on the shared memory file, all the other processes end up waiting for this lock to be released. Any ideas on how this can be overcome? I want to ensure that when a process that is holding the lock dies, it should ensure that the lock is released. Thanks, Raj -- *Twitter: @Blismedia <http://twitter.com/#%21/blismobile> BlisMedia 32 Percy Street, London W1T 2DE www.blismedia.com <http://www.blismobile.com/>** *** <http://www.blismobile.com/>* ****[image: Follow on Twitter]* <http://twitter.com/#%21/blismobile>*[image: Blis Website]* <http://www.blismobile.com/> *This communication is from Blis Media Ltd, a company registered in England and Wales with registered number 06455773. Its registered office is 32 Percy Street, London W1T 2DE, United Kingdom.* * * *This communication contains information that is confidential and may also be privileged. It is for the exclusive use of the intended recipient(s). If you are not the intended recipient(s), please (1) notify info(a)blismedia.com<info(a)blismobile.com> by forwarding this email and delete all copies from your system and (2) note that disclosure, distribution, copying or use of this communication is strictly prohibited. Email communications cannot be guaranteed to be secure or free from error or viruses. All emails sent to or from a Blismobile email account are securely archived and stored by an external supplier. This email does not constitute a contractual agreement; such agreements are in specified contractual or Insertion Order (IO) form only and exclusively contain all the terms to which Blis Mobile Ltd will be bound. To the extent permitted by law, Blis Mobile Ltd does not accept any liability for use of or reliance on the contents of this email by any person save by the intended recipient(s) to the extent agreed in a contract or Insertion Order.* * * *Opinions, conclusions and other information in this email which have not been delivered by way of the business of Breeze Tech (UK) Ltd are neither given nor endorsed by it.*

2 1

Review of ODEInt
by Rhys Ulerich 28 Sep '12

28 Sep '12

Here is my review of the proposed ODEInt library... I'm abstaining on the yes/no library acceptance vote. > - What is your evaluation of the design? As a user, I can find my way around. Several particular nits appear in my miscellaneous comments section. I'm not convinced that the interfaces, which differ from many other ODE integration packages, are a marked improvement from those other packages (e.g. GSL, PETSc, Trilinos, SUNDIALS, etc). I think that adding more than classical use cases could be difficult, in particular IMEX schemes. In particular, my personal research code (a turbulence DNS platform requiring semi-implicit time advance for a hyperbolic PDE system) could not be retrofit into this framework. > - What is your evaluation of the implementation? I've not read through the implementation. > - What is your evaluation of the documentation? Fairly good on the whole. I wish the math more clearly appeared using display-style equations rather than inline text. One table appears repeatedly and many links are missing. The applications section is quite nice. > - What is your evaluation of the potential usefulness of the library? I think the collection of features are useful, but I'd not adopt this library over the GSL, PETSc's time steppers, or Trilino's Rythmos when working in C or C++. GSL's APIs are quite easy and have no learning curve. PETSc's steppers are very powerful and support many new, exotic schemes. Rythmos build atop clean C++ vector space abstractions from the rest of Trilinos. odeint-v2 doesn't seem to beat any of these three alternatives at their game nor does it feel like enough of a winning compromise to make it compelling to me. > - Did you try to use the library? With what compiler? Did you have any problems? No. > - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? 45 minutes of reading. > - Are you knowledgeable about the problem domain? Somewhat. In conclusion, I'm thrilled to see someone put forward an ODE integration library for Boost but I feel the design doesn't address current application needs and best practices in many portions of the numerical PDE communities. That said, I applaud the authors' effort and I'm sure odeint-v2 will be useful for other folks. - Rhys P.S.: Miscellaneous, jumbled comments: Within the documentation, Table 1.1's stepper algorithm classes should link to the class. Ditto for lists of models within, e.g., http://headmyshoulder.github.com/odeint-v2/doc/boost_numeric_odeint/concept… Table 1.2 appears to duplicate Table 1.1 and should simply be linked. Ditto for Table 1.7. Stray < and > appear within the generated documentation, e.g. at http://headmyshoulder.github.com/odeint-v2/doc/boost_numeric_odeint/concept… sys.first(...) and sys.second(...) don't describe what's happening within the ImplicitSystem interface. sys.calculate_dxdt(...) and sys.calculate_dfdx(...) describe the operations involved. That they're called in some sequence shouldn't determine the names. Moreover, sometimes big gains can be made by simultaneously computing the Jacobian and the function evaluation in a single call. ImplicitSystem should be a System, but it's not. System should use a calculate_dxdt(...) method rather than operator(...) so that one has a hierarchy of system concepts. Similar naming concerns apply to the symplectic system concepts. In- versus out-of-place do_step(...) method signatures should differ by more than the method signatures. In my own codes I've used terminology like 'apply' and 'accumulate' and modeled the signatures off Level 1 and Level 2 BLAS calls. WRT ImplicitSystem, either providing or recommending some mechanism for finite differenced or complex-stepped Jacobians would be useful. Naming inconsistencies in the dense output schemes: bulirsch_stoer_dense_out vs rosenbrock4_dense_output Unclear if the design permits low storage Runge Kutta schemes, singly diagonally implicit.schemes, and other fun implicit-explicit things. E.g., there are IMEX schemes with different formal orders of accuracy for the implicit vs explicit portions of the scheme. Unclear if the design permits CFL-related maximum stable step sizes within f(u). The System interface would need to be adapted to have each method return maximum stable eigenvalue magnitudes for first and second order differential operators.` Rather than limiting implicit systems to folks using uBLAS matrices, it may be better to define the abstract operations a class would need to support to plug into the ImplicitSystem infrastructure. Especially because getting a uBLAS "wrapper" around an existing chunk of memory is quite a PITA and relies upon non-standard parts of the uBLAS (See, e.g., http://agentzlerich.blogspot.com/2009/10/boostublasshallowarrayadaptor.html) Why in http://headmyshoulder.github.com/odeint-v2/doc/boost_numeric_odeint/odeint_… are static_casts preferred to using constructors a la Value(2) / Value(3)?

2 1

[Review] ODEInt review starts today, September 19, ends September 28
by Steven Watanabe 28 Sep '12

28 Sep '12

AMDG The review of Karsten Ahnert and Mario Mulansky's ODEInt library starts today September 19th and will end on September 28. -------------------------------------- About the library: 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. Features: - provides most of the standard algorithms, including step size control, dense ouput and extrapolation routines - symplectic routines for Hamiltonian systems - implicit routines based on boost::ublas (MTL4 in progress) - high level integrate functions - interchangeable computation backend with existing bindings to CUDA and OpenCL - native support of ODEs defined for complex values - support of Boost.Units in most of the algorithms - support of arbitrary precision types You can download the library and view the documentation here: zip: http://github.com/headmyshoulder/odeint-v2/zipball/master github: http://headmyshoulder.github.com/odeint-v2/ docs: http://headmyshoulder.github.com/odeint-v2/doc/index.html -------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? In Christ, Steven Watanabe

5 5

[boost] [containers] wrong flat_xxx::insert(ordered_unique_range_t, first, last) ?
by TONGARI 28 Sep '12

28 Sep '12

Hi there, Say, if I have a set A{0, 1} and now I insert B{0.2, 0.8} into A, using that function, I'd expect A{0, 0.2, 0.8, 1}, but what I really get is A{0, 1}; If A is {0, 0.1}, I'll get A{0, 0.1, 0.2, 0.8} as expected... So it looks like that insert(ordered_unique_range_t...) can only insert elements subsequent to A. If this is the expected behavior, this function is useless to me, or is it a bug? File attached. Thanks.

2 2

Re: [Boost-users] [Polygon] How to put self intersect polygon into PolygonSet
by Luke Simonson 27 Sep '12

27 Sep '12

On Thu, Sep 27, 2012 at 1:25 AM, 李洋(zeal) <li.y-neu(a)neusoft.com> wrote: > I want to put a self intersect polygon > > |\ /| > | \ / | > | \/ | > | /\ | > | / \ | > |/ \| > into a Polygon set ps, > But when I use ps += poly to put it, in the ps the polygon has been cut to > /| > / | > / | > \ | > \ | > \| > > and the left part doesn't exist anymore. > I'm not sure whether I use it in a wrong way, or the library doesn't support this kind of operation? Very few libraries handle self intersecting polygons. This is actually one of Polygon's great strengths. There are three ways to handle self intersection. non-zero winding rule, odd winding rule and positive winding rule. The library does handle self intersecting polygons, just not the way you wanted. Your expectation is that the library applies the non-zero winding rule or the odd winding rule. Polygon uses the positive winding rule. The triangle on the left looks like a hole outside of a polygon to the library and has a winding of -1. Try putting your self intersecting polygon in a vector with a rectangle that is much bigger than it and then do ps += poly_vector and you will get a rectangle with a hole that is the left triangle. >From there you can do a NOT between the original rectangle and the rectangle with the hole to turn the hole positive and then OR it with the right hand triangle. Regards, Luke

1 0

Review Wizard Status Report for September 2012
by Ronald Garcia 27 Sep '12

27 Sep '12

============================================== Review Wizard Status Report for September 2012 ============================================== News ==== 1. Boost 1.51.0 Released. New Libraries: 1) Context 2. Multiprecision Accepted 3. Type Erasure Accepted 4. Contract Reviewed 5. Coroutine Reviewed 6. ODEInt Reviewed 7. Contract Accepted 8. Polygon Extensions integrated into Polygon 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) ``(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 Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

[reminder] [Review] ODEInt review ends tomorrow September 28
by Steven Watanabe 27 Sep '12

27 Sep '12

AMDG The review of Karsten Ahnert and Mario Mulansky's ODEInt library will end tomorrow. Only a few reviews have been submitted so far. If you plan to submit a review, please let me know. If anyone needs more time, we can see about extending the review period. -------------------------------------- About the library: 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. Features: - provides most of the standard algorithms, including step size control, dense ouput and extrapolation routines - symplectic routines for Hamiltonian systems - implicit routines based on boost::ublas (MTL4 in progress) - high level integrate functions - interchangeable computation backend with existing bindings to CUDA and OpenCL - native support of ODEs defined for complex values - support of Boost.Units in most of the algorithms - support of arbitrary precision types You can download the library and view the documentation here: zip: http://github.com/headmyshoulder/odeint-v2/zipball/master github: http://headmyshoulder.github.com/odeint-v2/ docs: http://headmyshoulder.github.com/odeint-v2/doc/index.html -------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? In Christ, Steven Watanabe

1 0

[GIL] copy_and_convert_pixels vs transform_pixels
by Mateusz Loskot 27 Sep '12

27 Sep '12

Hi, What is relation, if any, and differences between these two Boost.GIL algorithms? They seem to be similar or the copy_and_convert_pixels seems like a specialisation of the transform_pixels. Is that correct understanding of these algorithms? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

2 2

How to Boost serialize a Eigen::Matrix class
by Dip Ghosh 27 Sep '12

27 Sep '12

Hi, I have used Eigen::Matrix class in my project. Now i wants to serialize the value of it through Boost::Serialize. Can someone help me on how to achieve that. My class is following, class RandomNode { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & is_leaf_; ar & depth_; ar & num_classes_; ar & num_features_; // Split node members ar & random_feature_indices_; ar & random_feature_weights_; ar & threshold_; ar & leftChild_; ar & rightChild_; } bool is_leaf_; int depth_; int num_classes_; int num_features_; // Split node members VectorXi random_feature_indices_; VectorXd random_feature_weights_; double threshold_; RandomNode* leftChild_; RandomNode* rightChild_; // Methods and so on } And i am getting the following error : /usr/include/boost/serialization/access.hpp:118:9: error: ‘class Eigen::Matrix<double, 10000, 1>’ has no member named ‘serialize’ thanks in advance. Regards, Dip

3 4

Preprocessor sequence of "pairs"
by driscoll＠cs.wisc.edu 26 Sep '12

26 Sep '12

I have a question about the use of the preprocessor library. I'll describe my ultimate goal in a moment, but I've simplified my first problem to the following. Also, I know what I'm doing looks a lot at first glance like Fusion's ADAPT_STRUCT, but I took a quick look at that documentation and I don't think it matches. However, if you disagree with me and think it does, or can suggest a totally different solution, feel free to describe how. == My problem == I don't like C's struct syntax, so I'm trying to define my own. (</sarcasm> Really for purposes of this section I'm just doing this to figure out all the steps I'll need.) What I want to do is something like the following: #include <boost/preprocessor/seq/for_each.hpp> #define DEFINE_FIELD(r, os, field_pair) [....] #define DEFINE_STRUCT(struct_name, fields) \ struct struct_name { \ BOOST_PP_SEQ_FOR_EACH(DEFINE_FIELD, ~, fields) \ } DEFINE_STRUCT(mystruct, (int, x)(int, y)(double, z)) but this doesn't work, because the sequence is made up of pairs instead of single preprocessor arguments. (GCC complains about "macro "BOOST_PP_SEQ_SIZE_0" passed 2 arguments, but takes just 1" and same for PP_EXPR_IIF_0.) I can get it to work by double-parenthesizing the stuff in the sequence (saying "((int, x))((int, y))((double, z))") then defining DEFINE_FIELD as follows: #define DEFINE_FIELD_REAL(type, name) type name; #define DEFINE_FIELD(r, os, field_pair) DEFINE_FIELD_REAL field_pair but this is less than optimal. Is there a way that I can do this easily, or would I effectively have to re-implement SEQ_FOR_EACH? (And how hard would that be if it's necessary?) == What I'm actually trying to do == What I'm actually doing is trying to write a macro that will define a function like the following: DEFINE_SERIALIZED_STRUCT(mystruct, (int, x)(int, y)(double, z)) | V struct mystruct { int x; int y; double z; }; void serialize(ostream & os, mystruct const & s) { os << "x: " << s.x << "\n"; os << "y: " << s.y << "\n"; os << "z: " << s.z << "\n"; } (I didn't see a way to recover the field names from a Fusion-adapted struct -- from what I can tell, it more just seems to be a way to iterate over the fields.)

4 3

autoconf/automake and boost
by ilya shlyakhter 26 Sep '12

26 Sep '12

Dear Boosters, Can you point me to instructions for specifying dependency on Boost in an autoconf/automake project? I'd like the configure script to have an option --with-boost=... to point to a Boost installation, to specify a minimum required Boost version, and to require the presence of particular Boost libraries. Searching the list and the web does not seem to give a definitive answer. Thanks for help, Ilya

2 1

GGL: cartesian_to_spherical_equatorial2 conversion returning nan and not returning false (failed)
by David Doria 25 Sep '12

25 Sep '12

Using this: #include <boost/geometry/geometry.hpp> #include <iostream> int main() { namespace bg = boost::geometry; // bg = 'B'oost 'G'eometry namespace cs = bg::cs; // cs = 'C'oordinate 'S'ystem typedef bg::model::point<long double, 3, cs::cartesian> CartesianType; CartesianType cartesian(-6.89, -1.61, -1.64); // (theta, phi) typedef bg::model::point<long double, 2, cs::spherical<bg::degree> > SphericalType; SphericalType spherical; bg::strategy::transform::from_cartesian_3_to_spherical_equatorial_2<CartesianType, SphericalType> strategy; bg::transform(cartesian, spherical, strategy); std::cout << "cartesian: " << bg::dsv(cartesian) << std::endl << "spherical: " << bg::dsv(spherical) << std::endl; return 0; } I am getting the second coordinate of 'spherical' equal to 'nan'. I stepped through the Boost code, and got to this in strategy_transform.hpp: template <typename P, typename T> inline bool cartesian_to_spherical_equatorial2(T x, T y, T z, P& p) { assert_dimension<P, 2>(); set_from_radian<0>(p, atan2(y, x)); set_from_radian<1>(p, asin(z)); return true; } Here you see asin(z) . asin() requires the argument to be [-1,1] (http://www.cplusplus.com/reference/clibrary/cmath/asin/) However, this should just be the z component of any Cartesian point right? Is there some restriction on the input Cartesian point to cartesian_to_spherical_equatorial2 (and hence the from_cartesian_3_to_spherical_equatorial_2 strategy)? I see a restriction on from_cartesian_3_to_spherical_polar_2: \note If x,y,z point is not lying on unit sphere, transformation will return false but I don't see the same restriction on from_cartesian_3_to_spherical_equatorial_2. Additionally, it doesn't seem to just be a missing comment because the transform() call actually returns true even though this point is not on the unit sphere. If I normalize the point and call the function: CartesianType cartesian(-0.94862, -0.22167, -0.22580); The conversion seems to work successfully, and the call still returns true. Any thoughts? Is this a bug? If not, why is the function not returning false? And better, shouldn't this condition have at least an assertion (i.e. if the norm != 1, then return false or throw)? Thanks, David

2 1

[Fusion] BOOST_FUSION_ADAPT_STRUCT with templated member
by Nevin Liber 25 Sep '12

25 Sep '12

The following piece of code: #include <boost/fusion/include/adapt_struct.hpp> template<int a, int b> struct AB {}; BOOST_FUSION_ADAPT_STRUCT( , Silly, (AB<2,3>, ab)) fails with: main.cpp:8:15: error: macro "BOOST_FUSION_ADAPT_STRUCT" passed 3 arguments, but takes just 2 main.cpp:6:1: error: 'BOOST_FUSION_ADAPT_STRUCT' does not name a type I am assuming this is because the preprocessor splits line 8 into 'AB<2', '3>', 'ab'. How do I work around this? Regards, -- Nevin ":-)" Liber <mailto:nevin@eviloverlord.com> (847) 691-1404

6 10

b2 build problem: fatal error C1189: #error : "This is a GCC specific test case"
by Gunther Laure 25 Sep '12

25 Sep '12

Hi guys! I am getting a build error during build configuration using Visual Studio 2010: ...found 25 targets... ...updating 3 targets... compile-c-c++ C:\Users\glaure\SvnProject\SW_APP\3rdparty\test\boost\bin.v2\libs\regex\build\msvc-10.0\debug\address-model-64\threading-multi\has_icu_test.obj has_icu_test.cpp libs\regex\build\has_icu_test.cpp(12) : fatal error C1083: Cannot open include file: 'unicode/uversion.h': No such file or directory And more important: compile-c-c++ C:\Users\glaure\SvnProject\SW_APP\3rdparty\test\boost\bin.v2\libs\math\config\msvc-10.0\debug\address-model-64\threading-multi\has_gcc_visibility.obj has_gcc_visibility.cpp libs\math\config\has_gcc_visibility.cpp(7) : fatal error C1189: #error : "This is a GCC specific test case". The error is only reproduceable when i am using the --build-dir option of b2. Example: b2.exe -j8 install --build-dir=C:/boost_test --libdir=C:/boost_lib/release address-model=64 --prefix=C:/boost --without-python link=shared threading=multi variant=release Of course boost builds successfully, but the problem is that Visual Studio thinks that the build failed. These checks are not done if you build boost within the source tree. Currently I am using boost 1.50 Bye Gunther

2 1

Boost.Serialization and ordering of multimap elements with the same key
by Jeremiah Willcock 25 Sep '12

25 Sep '12

At least in C++11, std::multimap is required to be stable for elements with the same key. However, serializing and then deserializing a multimap with Boost.Serialization can change the order of elements with the same key to be different than their order in the input multimap. Would it be possible to change multimap deserialization (since serialization appears to preserve the order already) to ensure that the output multimap exactly matches the input one? Thank you. -- Jeremiah Willcock

1 0

boost::graph find the cycle
by tolik levchik 24 Sep '12

24 Sep '12

The following code http://ideone.com/MbvUI outputs 'false', why?

2 11

compilation problems on spirit::karma
by Erik Thiele 24 Sep '12

24 Sep '12

Hello in the attachment there is a single c++ file. on debian squeeze with g++ (Debian 4.4.5-8) 4.4.5 it compiles. debian standard libboost1.42-dev is installed. if you run the program: erik@ludwig:~/allesfresser/karma_problem$ ./a.out ruleSetModal(subCall(projectMemberIdentifier(siemensAltNumber=100, fanucNumber=0, name=)) erik@ludwig:~/allesfresser/karma_problem$ that's the required behaviour. now on new system with g++ (Debian 4.7.1-7) 4.7.1, and libboost1.49-dev, it does not compile. a short excerpt of the enormously long chain of error message: problem.cpp:254:5: required from ‘astGenerate<OutputIterator>::astGenerate() [with OutputIterator = std::back_insert_iterator<std::basic_string<char> >]’ problem.cpp:307:56: required from here /usr/include/boost/spirit/home/support/attributes.hpp:519:28: error: cannot convert ‘const boost::variant<astProjectMemberIdentifier, astErikNcBohrPlanSenk>’ to ‘boost::spirit::traits::attribute_size<boost::optional<boost::variant<astProjectMemberIdentifier, astErikNcBohrPlanSenk> >, void>::type {aka unsigned int}’ in return if you remove the rule in line 254 (ruleSetModal = "ruleSetModal(" << -ruleSubCall << ')';), then the program will compile. but it will output nothing of course. i need this line. it worked all the times and now after update it does not work. honestly i do not understand the long chain of error message. i checked with boost 1_51_1 with the same not working result. also with clang++ compiler it does not work with the same error message. maybe someone on the list can enlighten me why this does not compile anymore. Thanks Erik

2 2

[graph][heap][coroutine] interruptable dijkstra shortest path function
by Alex Hagen-Zanker 23 Sep '12

23 Sep '12

Hi, A few months ago I posted here to gauge interest for an interruptable and resumable version of the dijkstra_shortest_path algorithm. The initial response was positive, but Jeremiah considered the proposed solution lacking compared to an algorithm object model that inverts the control over the algorithm, Additional to my original solution, I now have two implementations of the algorithm object model. 1. Visitor based interruption. This is my original approach. It separates the algorithm into an init and main function. The main function asks the visitor if it should be halted afer each iteration. After halting, the main function can be used to resume the calculation. auto dijkstra = make_dijkstra_object(graph, named_parameters); dijkstra.init_from_sources(sources); dijkstra.expand( interruptor); dijkstra.expand( other_interruptor); auto distance_map = dijkstra.get<vertex_distance_t>(); auto color_map = dijkstra.get<vertex_color_t>(); 2. Algorithm object implementation. This was suggested by Jeremiah. The algorithm object iterates from control point to control point in the algorithm. Giving at each stop access to the intermediate results of the algorithm. The two implementations are a) Using the [Coroutine] library that is currently under review to step in and out of the function. b) Fragmenting the function into many subfunctions that are chained together and the other works by fragmenting the original algorithm into a number of small interlinked functions starting at one control point and returning at the next. The interface of a and b is exactly the same and it works like this: auto dijkstra = make_dijkstra_object(graph, sources, named_parameters); while(dijkstra.next() ) { control_point cp = dijkstra.get_control_point(); vertex u = dijkstra.get_u(); auto distance_map = dijkstra.get<vertex_distance_t>(); if(cp == cp_finish_vertex && get(distance_map, u) > 42) { cout << "far enough" << endl; break; } } auto distance_map = dijkstra.get<vertex_distance_t>(); The algorithm object offers most flexibility for interweaving multiple searches. The visitor based solution on the other hand is more efficient. The latter has no loss in performance compared to the existing dijkstra functions. The coroutine algorithm object was extremely easy to implement but it is not very efficient. Does anybody have a suggestion how that can improve? Besides these interruptable and resumable shortest path searches, there are a few more advantages to the implementation. a. All dijkstra parameters are bundled in a light-weight dijkstra_state object that is returned by algorithms, giving direct access to all results of the algorithm, for instance: auto dijkstra_state = dijkstra_shortest_paths(graph, sources, no_named_parameters() ); auto distance_map = dijkstra_state.get<vertex_distance_t>(); b. Named parameters (old style) are also used for the priority queue and the color map c. Boost.Heap mutable queues can be used with Boost.Graph via the named parameter interface. It doesn't help performance now, but may be a good base for experimentation. d. Separation of the dijkstra shortest path algorithm in init and main function makes it easier to provide custom initialization. For instance: multiple sources or only re-initializing changed vertices Can anybody use this? The latest version is here: http://people.pwf.cam.ac.uk/ahh34/dijkstra.zip Kind regards, Alex p.s. below are timings for a large graph: bimba_6M.obj... 2090 ms. Boost Graph Library 2121 ms. With interruption visitor 5601 ms. With Coroutine(*) 2621 ms. With fragmented functions (*) 2840 ms. With Boost.Heap (*) halting at all control points of the dijkstra visitor

1 0

transform_iterator and c++11 lambda expression
by MM 22 Sep '12

22 Sep '12

hello it would be great to be pass transform_iterator( my_iterator, []( reference ) { return /// something } ); directly to STL algorithms. Currently, one needs to define separately the unarfy function as far as i could see MM

3 2

[Interprocess] Different shared memory locations in Windows
by Aaron_Wright＠selinc.com 21 Sep '12

21 Sep '12

I'm attempting to share memory between two services on a Windows Server 2008 Core box. One service is postgres running as a user created just for that purpose, and the other service is my application running as the Local System user. The issue I'm seeing is that it seems that the two services do not agree on the location of the shared memory files. The postgres service is looking at "C:\Users\<user>\AppData\Local\Temp\boost_interprocess", while my application is looking at "C:\Windows\TEMP". Diving into the code I found that it first tries to use the value of a registry key, "HKLM\SOFTWARE\Microsoft\Windows\CurrentVersion\Explorer\Shell Folders\Common AppData", however this key doesn't exist in Windows Server 2008 R2 Core, presumably because there is no explorer.exe running on the box, and thus, no shell folders under it. When that fails, the code attempts to use the TMP environment variable, however that is dependent upon the environment that the user has setup, so the TMP variable is not guaranteed to be the same across users. Indeed in my case the TMP variable for the Local System user was "C:\Windows\TEMP", while the TMP variable for the other user was in its user folder. I'm not sure what the correct answer here is, but I have some ideas: -- The "HKLM\SOFTWARE\Microsoft\Windows\CurrentVersion\Explorer\User Shell Folders\Common AppData" registry key seems to exist for Windows XP, Windows Server 2008 R2 Core, and Windows 7. And according to TechNet, "The entries that appear in user User Shell Folders take precedence over those in Shell Folders." So maybe that registry key should be used instead. -- Use the ALLUSERESPROFILE variable, which is "C:\Documents and Settings\All Users" on Windows XP, and "C:\ProgramData" on Windows Server 2008 R2 Core and Windows 7. The TMP variable seems to be different for every user. -- Provide a way to tell the library what directory to use. (This doesn't exist does it?) Or hint at what library to use. -- Can/Should the code assert when the folder chosen contains a user name. Might be impracticable, but sure helpful. --- Aaron Wright

3 2

Re: [Boost-users] chaining functions input output
by MM 21 Sep '12

21 Sep '12

great, this is not blocking in my case, as I have written a 3rd function that merges the implementation of the 2 functions that are provided to me with matching results, and therefore avoiding the need for intermediate storage. I can move to your solution in a few months there are 10million entries so it's worth the trouble thanks

1 0

[Multi-Array] Coercion to multi_array_ref from array_view?
by Jason Sewall 21 Sep '12

21 Sep '12

I'd like to have functions that can be passed references to arrays of a given storage type and rank. Take a look at the following code: template <class A> void foo_duck(A ma) { ma[0][1] = 1.0; } typedef boost::multi_array_ref<double, 2> ref_array_2d; void foo_ref(ref_array_2d ma) { ma[0][1] = 1.0; } int main() { typedef boost::multi_array<double, 3> array_3d; typedef boost::multi_array_types::index_range range; array_3d A(boost::extents[3][4][4]); array_3d::array_view<2>::type slice = A[boost::indices[1][range()][range()]]; foo_duck(slice); foo_ref(slice); return 0; } foo_duck works fine, but foo_ref does not; I get a compiler error (gcc 4.6.3, boost 1.47) like so: "error: could not convert ‘slice’ from ‘boost::multi_array<double, 3ul>::array_view<2ul>::type {aka boost::detail::multi_array::multi_array_view<double, 2ul>}’ to ‘ref_array_2d {aka boost::multi_array_ref<double, 2ul>}’" I suspect, without having looked at the code itself, that multi_array_ref was never designed to be coerced from array_view, but I don't understand why. Is there a solution to my foo_ref problem that doesn't involve moving all such functions to headers and templating them? Cheers, Jason

3 2

[Context] Building 32-bit Context?
by Nat Linden 21 Sep '12

21 Sep '12

Our product uses many third-party libraries, all built for 32 bits. On a couple platforms we still support users with 32-bit systems. We build our Boost libraries with address-model=32, which has so far worked (for the subset of libraries we use) even on 64-bit build systems. Now we would like to introduce Boost.Context. However, address-model=32 --with-context causes the Boost build to break on Mac OS X. Indeed, the Requirements page [0] for Boost.Context says: "Please note that address-model=64 must be given to bjam command line on 64bit Windows (boost-build issue)." Does the same boost-build issue affect Mac OS X? Is there a workaround for this boost-build issue? I don't think we can integrate Boost.Context any time soon if it would require converting everything to 64 bits. [0] http://www.boost.org/doc/libs/1_51_0/libs/context/doc/html/context/requirem…

2 9

Xcode 4.5 and boost 1.51.0 semantic issues with implicit conversions long to int
by Graham Reitz 20 Sep '12

20 Sep '12

Recently upgraded to Xcode 4.5 and boost 1.51 and started getting a pile of: /Users/grahamreitz/Development/src/libs/boost_1_51_0/boost/asio/detail/impl/socket_ops.ipp:952:20: Implicit conversion loses integer precision: 'size_t' (aka 'unsigned long') to 'int' ...warnings I'm guessing this is a 64 bit/32 bit issue. Should I be seeing these warnings out of the box?

1 0

[boost.org] Getting Started list of built libraries
by Nat Linden 20 Sep '12

20 Sep '12

Both Getting Started pages [0], [1] list libraries that must be built separately. With Boost 1.51, Boost.Context should be added to those lists. [0] http://www.boost.org/doc/libs/1_51_0/more/getting_started/windows.html#head… [1] http://www.boost.org/doc/libs/1_51_0/more/getting_started/unix-variants.htm…

1 0

[filesystem] using locales on Solaris with GCC
by JonathonS 20 Sep '12

20 Sep '12

Hi, I am currently battling a buggy locale implementation (or lack thereof) in GCC on Solaris, which is affecting my use of boost::filesystem. Please have a look at the following thread for more information regarding this: http://gcc.gnu.org/ml/gcc-help/2009-09/msg00212.html In short, Solaris/GCC has a huge limitation that it does not support locales besides "C" or "POSIX". I talked to the GCC folks regarding this issue, and they said that at ONE time, GCC implemented the locale support for Solaris, but over time, the code was not maintained and therefore died :( This is very unfortunate because after looking through the boost filesystem code (boost/libs/filesystem/src/path.cpp), I found out that it creates a default locale by invoking std::locale("") (boost/libs/filesystem/src/path.cpp @ line 911) . Therefore, if my client sets the locale to anything but "C" or "POSIX", when it tries to create the default locale object via std::locale(""), it throws a runtime exception which crashes my program. So, my question is whether anyone knows of a work-around for this? I came up with one idea, but it seems very hackish. I can try to construct a boost::filesystem::path object and try to catch the exception thrown by std::locale(""). If the exception is thrown, I can set the environment variable to "C" or "POSIX" and continue with the program. My other idea is to manually patch boost::filesystem::path to use the following code to create the default locale. (again line 911 in path.hpp) try { use std::locale("") as the default locale; } catch ( std::runtime_error& ) { // We were unable to construct a locale, now use the global locale. use std::locale() as the default locale; } using std::locale() as the default will *always* succeed since it will just use whatever the current global locale is. My concern with this, is that I'll have to manually patch boost for this. Thanks, J

3 4

[boost.build] Problems getting PDB files withs DLLs
by Jonathan Jones 19 Sep '12

19 Sep '12

Hi all, I'm having problems getting PDB files built with the DLLs using Boost 1.49 and Visual Studio 2010. I have both debug-symbols=on and debug-store=database specified, but the PDB files are never built. Am I missing something? Thanks, Jon

1 1

(newbie) is_regular_file vs. symlinks in boost::filesystem ?
by Christian Convey 18 Sep '12

18 Sep '12

I'm writing code that takes a file pathname as a command-line argument. My program doesn't care whether the pathname is for a regular file, or if it's a symlink that ultimately leads to a regular file. This seems like such a common usage pattern that I would have expected Boost to have a built-in solution to this problem. But I don't see one. At the moment it looks like I'll have to write code like this: my_path = argv[1]; while (my_path is a symlink) { set my_path to the target of the symlink; error out of a cycle or excessive indirection is detected; } if (! is_regualr_file( my_path )) { tell user there's a problem; } Do I really need to write code like this?

2 3

using boost shared memory
by Dave Dyer 18 Sep '12

18 Sep '12

I'm contemplating using boost to implement inter process communication between a 32 bit process and a 64 bit process. I'm pretty sure there will be no problem at the raw bits level, but I suspect that if I attempt to use any of the higher order constructs, such as allocators or message queues, the disparate size of pointers will make hash of it. Does anyone have any experience (or advice) ?

1 0

Crash in boost::function destructor in my thread pool implementation
by Marcin Adamski 18 Sep '12

18 Sep '12

Hi I am trying to implement thread pool in C++ using pthread and boost::function as a wrapper for any function that client would like to call in the worker thread. I want to encapsulate logic related to threads management in one object which is taking ownership of these threads. That means whenever this object is destroyed, threads must be stopped and cleaned up. I've been testing my code and it turns out that I get segmentation fault when I destroy WorkerThreadManager object while there is boost::function processed in worker thread. See the code in attachment and backtrace from GDB below. I don't really understand why it happens, as far as I know boost::function is copyable, so once I get a copy of it from the queue, I can pop() it and even destroy whole queue (I prooved that in some small test) and then call the function's copy. So why is destruction of std::queue< boost::function<void() > causing problems? Or maybe it is something else. (gdb) bt #0 0xb7ad33a0 in ?? () from /lib/i386-linux-gnu/libc.so.6 #1 0x0807d3a7 in boost::function0<void>::clear (this=0x858db48) at /home/marcin/intel_build/boost_1_42_0/boost/function/function_template.hpp:856 #2 0x0807d17b in boost::function0<void>::~function0 (this=0x858db48, __in_chrg=<optimized out>) at /home/marcin/intel_build/boost_1_42_0/boost/function/function_template.hpp:752 #3 0x0807cec5 in boost::function<void()>::~function(void) (this=0x858db48, __in_chrg=<optimized out>) at /home/marcin/intel_build/boost_1_42_0/boost/function/function_template.hpp:1043 #4 0x0807ced8 in std::_Destroy<boost::function<void ()> >(boost::function<void ()>*) (__pointer=0x858db48) at /usr/include/c++/4.6/bits/stl_construct.h:94 #5 0x0807c868 in std::_Destroy_aux<false>::__destroy<boost::function<void ()>*>(boost::function<void ()>*, boost::function<void ()>*) (__first=0x858db48, __last=0x858d928) at /usr/include/c++/4.6/bits/stl_construct.h:104 #6 0x0807bd05 in std::_Destroy<boost::function<void ()>*>(boost::function<void ()>*, boost::function<void ()>*) (__first=0x858d938, __last=0x858d928) at /usr/include/c++/4.6/bits/stl_construct.h:127 #7 0x0807af23 in std::_Destroy<boost::function<void ()>*, boost::function<void ()> >(boost::function<void ()>*, boost::function<void ()>*, std::allocator<boost::function<void ()> >&) (__first=0x858d938, __last=0x858d928) at /usr/include/c++/4.6/bits/stl_construct.h:153 #8 0x0807a037 in std::deque<boost::function<void ()>, std::allocator<boost::function<void ()> > >::_M_destroy_data_aux(std::_Deque_iterator<boost::function<void ()>, boost::function<void ()>&, boost::function<void ()>*>, std::_Deque_iterator<boost::function<void ()>, boost::function<void ()>&, boost::function<void ()>*>) (this=0x858beec, __first=..., __last=...) at /usr/include/c++/4.6/bits/deque.tcc:795 #9 0x08076153 in std::deque<boost::function<void ()>, std::allocator<boost::function<void ()> > >::_M_destroy_data(std::_Deque_iterator<boost::function<void ()>, boost::function<void ()>&, boost::function<void ()>*>, std::_Deque_iterator<boost::function<void ()>, boost::function<void ()>&, boost::function<void ()>*>, std::allocator<boost::function<void ()> > const&) (this=0x858beec, __first=..., __last=...) at /usr/include/c++/4.6/bits/stl_deque.h:1816 #10 0x08073411 in std::deque<boost::function<void()>, std::allocator<boost::function<void()> > >::~deque(void) (this=0x858beec, __in_chrg=<optimized out>) at /usr/include/c++/4.6/bits/stl_deque.h:898 #11 0x0806a355 in std::queue<boost::function<void()>, std::deque<boost::function<void()>, std::allocator<boost::function<void()> > > >::~queue(void) (this=0x858beec, __in_chrg=<optimized out>) at /usr/include/c++/4.6/bits/stl_queue.h:92 #12 0x0815a054 in WorkerThreadManager::~WorkerThreadManager (this=0x858be98, __in_chrg=<optimized out>) at WorkerThreadManager.cpp:42 #13 0x0815a1e3 in WorkerThreadManager::~WorkerThreadManager (this=0x858be98, __in_chrg=<optimized out>) at WorkerThreadManager.cpp:56 #14 0x080c6c51 in std::auto_ptr<WorkerThreadManager>::reset (this=0x85463e4, __p=0x0) at /usr/include/c++/4.6/backward/auto_ptr.h:244 #15 0x080604a9 in main () Regards Marcin Adamski

2 2

[ANN] ODB C++ ORM 2.1.0 released, adds support for Uuid, Multi-Index
by Boris Kolpackov 18 Sep '12

18 Sep '12

Hi, I am pleased to announce the release of ODB 2.1.0. ODB is an open source object-relational mapping (ORM) system for C++. It allows you to persist C++ objects to a relational database without having to deal with tables, columns, or SQL and without manually writing any of the mapping code. Major new features in this release: * Ability to use accessor/modifier functions and expressions to access data members. In most cases ODB is capable of discovering suitable accessor/modifier functions automatically. * Support for virtual (imaginary) data members that can be used to handle the C++ pimpl idiom as well as aggregate or dis-aggregate real data members. * Ability to define database indexes on data members. Multi-member indexes as well as indexes with database-specific index types, methods, and options are supported. * Support for mapping extended database types, such as geospatial types, user-defined types, collections (arrays, table types, etc.), key-value stores, XML, JSON, etc., to suitable C++ types. * The Boost profile library now provides persistence support for the Uuid and Multi-Index container libraries. * The Qt profile library now provides persistence support for the QUuid type. * Support for generating single (combined) database schema file from multiple C++ header files. This release also adds support for Visual Studio 2012 and Clang 3.1. Specifically, all the runtime libraries, examples, and tests now come with project/solution files for Visual Studio 2012 in addition to 2010 and 2008. A more detailed discussion of these features can be found in the following blog post: http://www.codesynthesis.com/~boris/blog/2012/09/18/odb-2-1-0-released/ For the complete list of new features in this version see the official release announcement: http://www.codesynthesis.com/pipermail/odb-announcements/2012/000018.html ODB is written in portable C++ and you should be able to use it with any modern C++ compiler. In particular, we have tested this release on GNU/Linux (x86/x86-64), Windows (x86/x86-64), Mac OS X, and Solaris (x86/x86-64/SPARC) with GNU g++ 4.2.x-4.7.x, MS Visual C++ 2008, 2010, and 2012, Sun Studio 12, and Clang 3.1. The currently supported database systems are MySQL, SQLite, PostgreSQL, Oracle, and SQL Server. ODB also provides profiles for Boost and Qt, which allow you to seamlessly use value types, containers, and smart pointers from these libraries in your persistent classes. More information, documentation, source code, and pre-compiled binaries are available from: http://www.codesynthesis.com/products/odb/ Enjoy, Boris

1 0

[Review.Coroutine] Coroutine review comments
by Nat Linden 17 Sep '12

17 Sep '12

I like what I see so far, but I'm missing the coroutine future API. We use Giovanni Deretta's Summer of Code Coroutine prototype in production code, and we rely on his 'future' semantics. My intention was to test Oliver's Coroutine proposal by replacing it into our code, but this is not possible without something equivalent to 'future'. Accordingly, this review is based on the library documentation rather than on actual usage. (One could imagine passing a coroutine object itself as a callback for some other library, then calling yield() to await that callback. There are two obstacles. One is that I know of no way to obtain, within the coroutine-function, a reference to the containing coroutine object. The initial 'self' parameter is not that object; it presents a different API. A more serious problem is that the value returned by yield() is fixed by the coroutine template's Signature parameter. With futures, each future object can return a different type; a given coroutine can instantiate an arbitrary number of future objects with an arbitrary number of types to await an arbitrary sequence of callbacks.) > Please always state in your review, whether you think the library should be > accepted as a Boost library! I vote: conditionally accept. I cannot switch to this library without 'future' support. > Additionally please consider giving feedback on the following general > topics: > > - What is your evaluation of the design? Good > - What is your evaluation of the implementation? Did not review > - What is your evaluation of the documentation? Generally good; detailed suggestions follow > - What is your evaluation of the potential usefulness of the library? HIGH. More people need this functionality than realize it. :-) > - Did you try to use the library? With what compiler? Did you have any > problems? I did not > - How much effort did you put into your evaluation? A glance? A quick > reading? In-depth study? I read the documentation at the cited link: http://ok73.ok.funpic.de/boost/libs/coroutine/doc/html/ > - Are you knowledgeable about the problem domain? Yes ======================================================================== Detailed comments on documentation: First example in section "Coroutine": "boost::coro::coroutine< void() > c( make_coroutine() );" This example might benefit from a couple comments explaining its purpose. As the first example in the documentation, I thought it might illustrate a short but complete use case. It's only intended to demonstrate a coroutine object being returned by value from a function; but when I first read it I thought make_coroutine() was part of the library API, like make_shared(). "The coroutine-function, as well as its arguments, if any, are copied into the coroutine's state. If a reference is required, use boost::ref." Excellent! This is an important point. "The maximum number of arguments of coroutine-function is 10." Is that limit adjustable with a #define symbol? If not, it should be. Second example under "Executing a coroutine": coro_t c( boost::bind( fn, _1, 7) ); std::cout << "main() starts coroutine c" << std::endl; // yield was called so we returned ^ This comment, at this point in the code, perplexed me. while ( ! ctx.is_complete() ) ^ 'ctx' undefined, I think you mean coro_t 'c' { std::cout << "main() calls coroutine c" << std::endl; // execution control is transfered to c c(); // yield() was called within fn() } "In contrast to threads, which are preemtive, coroutine switches are cooperative (programmer controls when a switch will happen). The kernel is not involved in the coroutine switches." s/preemtive/preemptive/ I would love it if, somewhere in the introductory material, the library documentation emphasized the pragmatic benefit of cooperative switching: it requires no new defensive locking. s/allways/always/ "The arguments passed to coroutine<>::operator()(), in one coroutine, is returned by coroutine<>::self_t::yield() in the other coroutine..." At first glance this makes the reader wonder how yield() can possibly return up to 10 coroutine arguments. May I suggest: "...is returned (as a boost::tuple) by..." ? Example under "coroutine-function with multiple arguments": "boost::tuple< int, int > ret = self.yield( tmp);" This describes exactly the type returned, so is correct. Even so, I find myself thinking that a dubious reader might be more favorably impressed by an example using a couple scalar variables with boost::tie(). And it might clarify the example to use different types for the coroutine parameters. Example under "Exit a coroutine-function": s/self.yield_return()/self.yield_break()/ "An exception thrown inside coroutine-function (transfered via exception-pointer - see Boost.Exception for details and requirements) will be re-thrown by coroutine<>::operator()()." I'm not familiar with Boost.Exception. Will any exception be re-thrown, including exceptions raised by the runtime? Or does this only apply to exceptions derived from a particular base class, or thrown in a particular way? If there are such limitations, mentioning them briefly here would be extremely useful. "Code executed by coroutine must not prevent the propagation of the forced_unwind exception. Absorbing that exception will cause stack unwinding to fail. Thus, any code that catches all exceptions must rethrow the pending exception." This and the example should clarify that we're talking about code within the coroutine-function. (And is forced_unwind also within the boost::coro namespace?) If forced_unwind is the exception thrown when a (! is_complete()) coroutine object is destroyed, that's worth mentioning. It's possible that a coroutine-function might want to perform cleanup specific to that case. coroutine::self_t reference: "T yield( R);" T and R undefined. "template< typename Fn > coroutine( Fn fn, std::size_t size = ctx::default_stacksize(), flag_unwind_t do_unwind = stack_unwind, bool preserve_fpu = true, Allocator alloc = Allocator() );" flag_unwind_t undefined. "R operator()(A0 a0, ..., A9 a9);" R, A0, ... A9 undefined. Example in section "Generator": Undefined make_generator() function wants a comment. Again, this is a hypothetical user function rather than part of the boost::coro::generator API. "The first argument of generator-function must be of type generator<>::self_t, ..." The "only" argument? I'd like to see some words when generator is first introduced clarifying the ways in which it differs from coroutine. This what I think: * A generator-function accepts no arguments (other than self_t), so yield() always returns void. * yield_break() does not throw an exception in the invoking coroutine. * Anything else? It might be worth a few words to clarify that when you pass a boost::bind() expression, *that* is the generator-function, and it must accept only self_t. Any other parameters bound by boost::bind() are irrelevant to boost::coro::generator. In that connection, the function f() in the first "Executing a generator" example should probably accept a different parameter type than int so the reader can clearly distinguish between the type accepted by f() and the type passed to yield(). And in *that* connection, the self.yield() call in that example should pass an int value. "The generator-function, as well as its arguments, if any, are copied into the generator's state." Um, what arguments? Again, if you're using boost::bind() to adapt a function that accepts anything more than self_t, processing of additional arguments is up to boost::bind() -- not boost::coro::generator. "The maximum number of arguments of generator-function is 10." What does this mean? "generator-function is invoked the first time inside the constructor of generator." That makes no sense to me. Is the value passed to the first yield() call simply discarded? If so, why? "If generator-function can not return valid values anymore generator<>::self_t::yield_break() should be called. This function returns the execution control back to the caller and sets the generator to be complete (is_complete() returns true)." is_complete() is not documented for boost::coro::generator. "Of curse the generator-function can be exited with a return expression." s/curse/course/ Is there any semantic difference between executing 'return' in a generator-function and calling yield_break() in a generator-function? If not, is yield_break() provided only for consistency with coroutine? If a generator-function has a declared return type, is that value discarded? Example in "Exit a generator-function": "self_yield( i);" should be self.yield(i); "self.yield_return();" should be self.yield_break(); class generator::self_t reference: "void yield( R);" Is R the same as Result here? "Result operator()() Preconditions: *this is not a not-a-generator, ! is_complete()." is_complete() is not documented for boost::coro::generator. "void self_t::yield( Result) Effects: Gives execution control back to calling context by returning a value of type Result. The return type of this function is a boost::tuple<> containing the arguments passed to generator<>::operator()()." That entire last sentence seems untrue. "void self_t::yield_break() Effects: Gives execution control back to calling context and sets the generator to be complete. generator<>::operator()() in the other generator throws exception coroutine_terminated." Last sentence above contradicts other generator documentation.

2 7

If *boost::filesystem::path::iterator was mutable it would be considerably more user friendly
by Sebastian Karlsson 17 Sep '12

17 Sep '12

Why is *boost::filesystem::path::iterator immutable? If it wasn't transformation of paths would be very user friendly, and we'd be able to leverage all the niceties which already works with iterators. As it is one has to create a ton of temporaries, and common operations which should be one liners becomes a mess. Kind regards, Sebastian Karlsson

1 0

[Review:Contract] Boost.Contract Library is Accepted
by Dave Abrahams 17 Sep '12

17 Sep '12

Lorenzo Caminiti's Boost.Contract Library is hereby accepted into Boost. I will be brief but that should in no way be construed as a lack of enthusiasm. Reviewing the review commentary was a genuine pleasure. Anyone interested in this domain could learn a lot by going through the threads the way I did. There were five "yes" votes, one of which was very late (but I'm counting it), and one of which was conditional, and one "no" vote. I am accepting the library unconditionally because of Lorenzo's demonstrated responsiveness to issues. He gave thoughtful responses to the review comments and entered every issue raised that remained open into a bug database (http://sourceforge.net/apps/trac/contractpp/report/3) Congratulations, Lorenzo! -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

1 0

[boost] [contract] static_assert in contracts or not?
by Lorenzo Caminiti 17 Sep '12

17 Sep '12

Hello all, If static assertions make sense within contracts (preconditions, postconditions, and class invariants) is a questions that has been raised by both Vicente and Andrzej. I don't have a definitive answer so I'd like to discuss with the ML. On Wed, Aug 29, 2012 at 2:48 PM, Andrzej Krzemienski <akrzemi1(a)gmail.com> wrote: > (6) > Static assertions: is there any value in providing them, given that we > already have this ability in Boost? I see that N1962 decided to abandon > them; I am pretty sure the reason was that static_assert was already there. > They somehow do not fit conceptually into the model of preconditions, > postconditions and invariants. Precondition, for instance tries to detect a > run-time condition occurring immediately before a function is called this > time. Static assertion is not even executed then. What point is there in > putting such assertion into the precondition? Documentation says " static > assertions can be selectively disabled depending on where they are > specified [...] so it is still important to logically associate them with > preconditions, postconditions, etc." -- technically this sentence makes > logical sense, but can you think of a single example where this selective > disabling of assertions would be useful? What is the point in disabling > such assertions at all, if they cost you nothing in run-time? I propose to > remove them and give a sort of recommendation that software quality is > assured by using a number of fairly independent tools: DbC, concepts, > static assertions. I think we can break down the question in two parts. Let's assume N1962 is accepted into C++1x so we have both contracts and static_assert. 1) Would you expect to be able to use static_assert within contract assertions (preconditions, postconditions, and class invariants)? Note that only boolean conditions are allowed by N1962 within contracts, general code is not allowed, therefore this is not a trivial question. For example, would you expect to be able to do the following option A: template< typename To, typename From > To* memcopy ( To* to, From* from ) precondition{ static_assert(sizeof(To) >= sizeof(From), "destination too small"); static_assert(boost::is_convertible<From, To>::value, "incompatible types"); to; // pointer not null from; // pointer not null } { // ... } In this case, would it ever make sense to use static_assert in postcondition and/or class invariants even if that were allowed? Or would you just use static_assert in the body, option B: template< typename To, typename From > To* memcopy ( To* to, From* from ) precondition{ to; // pointer not null from; // pointer not null } { static_assert(sizeof(To) >= sizeof(From), "destination too small"); static_assert(boost::is_convertible<From, To>::value, "incompatible types"); // ... } I don't like this because the assertions are about the specifications (they assert a requirement of the interface) so they should go in the declaration and not in the implementation. Or maybe the assertions should be represented as concept requirements on To and From, option C: template< typename To, typename From > requires SizeofGreaterEqual<To, From>, Convertible<From, To> To* memcopy ( To* to, From* from ) precondition{ to; // pointer not null from; // pointer not null } { // ... } (Only we don't have concepts...) 2) Let's assume, we answered option A to question 1): template< typename To, typename From > To* memcopy ( To* to, From* from ) precondition{ static_assert(sizeof(To) >= sizeof(From), "destination too small"); static_assert(boost::is_convertible<From, To>::value, "incompatible types"); to; // pointer not null from; // pointer not null } { // ... } Would you expect these static_asserts to be disabled when precondition compilation and checking is turned off at compilation time? I'd think so. Thanks. --Lorenzo

3 2

Using Boost.Process on Windows
by Ronan Trépos 15 Sep '12

15 Sep '12

Hello, I'm trying to compile start_child example of Boost.Process with this configuration: Windows 64 bits MinGW g++ 4.6.2 boost_1-51 Boost.Process 0.5 And I have this error: error: no matching function for call to 'boost::system::system_error::system_error(DWORD, const boost::system::error_category& (&)(), const char [54])' note: candidates are: boost::system::system_error::system_error(int, const boost::system::error_category&, const char*) ... This difficulty was mentioned on the list "[Boost-users] [Process] Can't build example" at date 12/4/10. Am i missing something ? Thank you in advance Best regard Ronan Trépos -- Trépos Ronan INRA unité BIA, équipe MAD, Toulouse http://carlit.toulouse.inra.fr/wikiz/index.php/Ronan_TREPOS tel : 05 61 28 51 89

3 3

How to compile static library with -fPIC from boost.python
by simon zhang 15 Sep '12

15 Sep '12

Hi all Default,libboostpython.a has be compiled without -fPIC.But I have to make a python extending and it is a dynamic library with -fPIC that link to static library. How to compile static library (libboostpython.a) with -fPIC from boost.python simon

2 2

std::set_intersection without results
by Jens Müller 14 Sep '12

14 Sep '12

Hi everyone, I'm trying to test whether two std::vector's intersect. A straightforward way is to sort them, apply std::set_intersection and test whether the result set is non-empty. However, I don't need the result. Is there some algorithm in boost that just _tests_ for intersection, i.e., stops when it has found one common element? Best regards, Jens

2 1

[filesystem] boost::filesystem::current_path: No such file or directory
by Frédéric Bron 14 Sep '12

14 Sep '12

Hi, sometimes, when I run my program, I get that exception: terminate called after throwing an instance of 'boost::filesystem3::filesystem_error' what(): boost::filesystem::current_path: No such file or directory Aborted What could be the cause for this? I am using 1.49.0 on linux x86_64 compiled with g++ 4.6.2. Regards, Frédéric

4 5

[lambda] Using a reference in an expression
by Bill Buklis 13 Sep '12

13 Sep '12

How does one use a reference in a lambda expression? The documentation says that "var" does, but it clearly doesn't. For example this fails to compile because it can't access the copy constructor: #include <boost/lambda.hpp> namespace bll = boost::lambda; class sample { public: sample() { } sample& operator<<( int ) { return(*this); } private: sample( const sample& ); }; void test() { typedef std::vector<int> V; V v; sample s; std::for_each(v.begin(), v.end(), bll::var(s) << bll::_1); }; -- Bill

2 2

[scope exit] docs broken in 1.50
by Ovanes Markarian 13 Sep '12

13 Sep '12

2 3

Install boost on OS X via homebrew with c++11 and libc++
by christoffer.buchholz＠gmail.com 13 Sep '12

13 Sep '12

I'm trying to install boost on OS X with c++11 and libc++. I'm using homebrew (boost formular with the --build-from-source argument) and have tried various options with adding stuff like * toolset=clang * cxxflags="-stdlib=libc++ -std=c++11" * cxxflags="-stdlib=libc++" * linkflags="-stdlib=libc++ -std=c++11" * linkflags="-stdlib=libc++" as arguments to bjam, but it all fails. Now... The "toolset" part doesn't do anything to make it fail though, its the cxx- and linkflags part that does. This is what I get when it fails clang-darwin.archive bin.v2/libs/exception/build/clang-darwin-4.2.1/release/link- static/threading-multi/libboost_exception-mt.a common.copy /usr/local/Cellar/boost/1.50.0/lib/libboost_exception-mt.a clang-darwin.compile.c++ bin.v2/libs/wave/build/clang-darwin-4.2.1/release/link- static/threading-multi/cpplexer/re2clex/cpp_re.o clang-darwin.archive bin.v2/libs/wave/build/clang-darwin-4.2.1/release/link-static/threading-multi/libboost_wave-mt.a common.copy /usr/local/Cellar/boost/1.50.0/lib/libboost_wave-mt.a ...failed updating 2 targets... ...skipped 4 targets... ...updated 10592 targets... Error: #<BuildError: Failed executing: ./bjam toolset=clang cxxflags="-stdlib=libc++" linkflags="-stdlib=libc++" --prefix=/usr/local/Cellar/boost/1.50.0 -- libdir=/usr/local/Cellar/boost/1.50.0/lib -j2 --layout=tagged --user-config=user-config.jam threading=multi install> How do I get boost installed on OS X Mountain Lion with c++11 and libc++ preferably via homebrew for the ease it adds. Sincerely, Christoffer Buchholz

2 3

[test] BOOST_CHECK_EQUAL comparisons with NULL don't compile
by James Mathiesen 13 Sep '12

13 Sep '12

This use case seems really common and I was surprised it gave me problems. I assume that nullptr_t in C++11 fixes this but then I was wondering if the cases were basic and common enough it would make sense to have a BOOST_CHECK_NULL / BOOST_CHECK_NOT_NULL and the assorted variants. james --- #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MODULE Hello #include <boost/test/unit_test.hpp> // main() etc... is defined by the headers BOOST_AUTO_TEST_CASE( null_compare ) { const char *ptr = NULL; // // Equality comparisons with NULL Fail to compile using boost 1.46 // and g++-4.6 // // /usr/include/boost/test/test_tools.hpp:536:20: // error: ISO C++ forbids comparison between pointer and // integer [-fpermissive] // // Which seems to be flagging this // // template <class Left, class Right> // predicate_result equal_impl( Left const& left, Right const& right ) // { // return left == right; // } // // Where Left is of type "const char *" and Right is of type "long int". // BOOST_CHECK_EQUAL(ptr, NULL); // // these tests compile and pass // BOOST_CHECK(ptr == NULL); BOOST_CHECK_EQUAL(ptr, ptr); BOOST_CHECK_EQUAL(ptr, (void *)ptr); BOOST_CHECK_EQUAL(ptr, (void *)NULL); } ... example.cc:33:1: error: passing NULL to non-pointer argument 9 of ‘bool boost::test_tools::tt_detail::check_frwd(Pred, const boost::unit_test::lazy_ostream&, boost::test_tools::const_string, std::size_t, boost::test_tools::tt_detail::tool_level, boost::test_tools::tt_detail::check_type, const Arg0&, const char*, const Arg1&, const char*) [with Pred = boost::test_tools::tt_detail::equal_impl_frwd, Arg0 = const char*, Arg1 = long int, boost::test_tools::const_string = boost::unit_test::basic_cstring<const char>, std::size_t = long unsigned int]’ [-Werror=conversion-null] example.cc:33:1: error: passing NULL to non-pointer argument 9 of ‘bool boost::test_tools::tt_detail::check_frwd(Pred, const boost::unit_test::lazy_ostream&, boost::test_tools::const_string, std::size_t, boost::test_tools::tt_detail::tool_level, boost::test_tools::tt_detail::check_type, const Arg0&, const char*, const Arg1&, const char*) [with Pred = boost::test_tools::tt_detail::equal_impl_frwd, Arg0 = const char*, Arg1 = long int, boost::test_tools::const_string = boost::unit_test::basic_cstring<const char>, std::size_t = long unsigned int]’ [-Werror=conversion-null] In file included from /usr/include/boost/test/unit_test.hpp:19:0, from example.cc:7: /usr/include/boost/test/test_tools.hpp: In function ‘boost::test_tools::predicate_result boost::test_tools::tt_detail::equal_impl(const Left&, const Right&) [with Left = const char*, Right = long int]’: /usr/include/boost/test/test_tools.hpp:560:40: instantiated from ‘boost::test_tools::predicate_result boost::test_tools::tt_detail::equal_impl_frwd::call_impl(const Left&, const Right&, mpl_::false_) const [with Left = const char*, Right = long int, mpl_::false_ = mpl_::bool_<false>]’ /usr/include/boost/test/test_tools.hpp:575:56: instantiated from ‘boost::test_tools::predicate_result boost::test_tools::tt_detail::equal_impl_frwd::operator()(const Left&, const Right&) const [with Left = const char*, Right = long int]’ /usr/include/boost/test/test_tools.hpp:523:1: instantiated from ‘bool boost::test_tools::tt_detail::check_frwd(Pred, const boost::unit_test::lazy_ostream&, boost::test_tools::const_string, std::size_t, boost::test_tools::tt_detail::tool_level, boost::test_tools::tt_detail::check_type, const Arg0&, const char*, const Arg1&, const char*) [with Pred = boost::test_tools::tt_detail::equal_impl_frwd, Arg0 = const char*, Arg1 = long int, boost::test_tools::const_string = boost::unit_test::basic_cstring<const char>, std::size_t = long unsigned int]’ example.cc:33:1: instantiated from here /usr/include/boost/test/test_tools.hpp:536:20: error: ISO C++ forbids comparison between pointer and integer [-fpermissive]

4 3

boost 1.47.0 installation
by Usman Dastgeer 13 Sep '12

13 Sep '12

Hello, I am trying to install boost for the first time as part of rose compiler installation. Here is what I did on a Linux machine: downloaded, extracted boost 1.47.0 ./bootstrap.sh --prefix=/home/usmda/rose/ boost/install2 --with-python-version=2.7 ./bjam install -sGCC=gcc-4.4 -sGXX=g++-4.4 --prefix=/home/usmda/rose/boost/install2 Default gcc version is 4.7.1 [/usr/bin/g(cc|++)] on this machine so I specify the gcc 4.4 [/usr/bin/g(cc|++)-4.4] for 2 reasons: 1) I need to use gcc 4.4 to compile rose compiler as well. 2) I read that gcc 4.7.1 disables boost threading support so that's why I want to use gcc 4.4 but specifying -sGCC and -sGXX didn't help as still I guess it uses gcc-4.7.1 (as shown in log below).* * Build fail for 4 targets. Here is the build message... ... In file included from ./boost/thread/detail/platform.hpp:17:0, from ./boost/thread/detail/config.hpp:20, from libs/thread/src/pthread/thread.cpp:8: ./boost/config/requires_threads.hpp:29:4: error: #error "Threading support unavaliable: it has been explicitly disabled with BOOST_DISABLE_THREADS" In file included from ./boost/thread/pthread/mutex.hpp:14:0, from ./boost/thread/mutex.hpp:16, from ./boost/thread/pthread/thread_data.hpp:12, from ./boost/thread/thread.hpp:17, from libs/thread/src/pthread/thread.cpp:10: ./boost/thread/xtime.hpp:23:5: error: expected identifier before numeric constant ./boost/thread/xtime.hpp:23:5: error: expected ‘}’ before numeric constant ./boost/thread/xtime.hpp:23:5: error: expected unqualified-id before numeric constant ./boost/thread/xtime.hpp:46:14: error: expected type-specifier before ‘system_time’ In file included from ./boost/thread/pthread/mutex.hpp:14:0, from ./boost/thread/mutex.hpp:16, from ./boost/thread/pthread/thread_data.hpp:12, from ./boost/thread/thread.hpp:17, from libs/thread/src/pthread/thread.cpp:10: ./boost/thread/xtime.hpp: In function ‘int xtime_get(xtime*, int)’: ./boost/thread/xtime.hpp:73:40: error: ‘get_system_time’ was not declared in this scope ./boost/thread/xtime.hpp:73:40: note: suggested alternative: In file included from ./boost/thread/locks.hpp:12:0, from ./boost/thread/pthread/mutex.hpp:12, from ./boost/thread/mutex.hpp:16, from ./boost/thread/pthread/thread_data.hpp:12, from ./boost/thread/thread.hpp:17, from libs/thread/src/pthread/thread.cpp:10: ./boost/thread/thread_time.hpp:19:24: note: ‘boost::get_system_time’ In file included from ./boost/thread/pthread/mutex.hpp:14:0, from ./boost/thread/mutex.hpp:16, from ./boost/thread/pthread/thread_data.hpp:12, from ./boost/thread/thread.hpp:17, from libs/thread/src/pthread/thread.cpp:10: ./boost/thread/xtime.hpp: At global scope: ./boost/thread/xtime.hpp:88:1: error: expected declaration before ‘}’ token "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -Wno-long-long -DBOOST_ALL_NO_LIB=1 -DBOOST_THREAD_BUILD_LIB=1 -DBOOST_THREAD_POSIX -DNDEBUG -I"." -c -o "bin.v2/libs/thread/build/gcc-4.7.1/release/link-static/threading-multi/pthread/thread.o" "libs/thread/src/pthread/thread.cpp" ...failed gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.7.1/release/link-static/threading-multi/pthread/thread.o... gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.7.1/release/link-static/threading-multi/pthread/once.o In file included from ./boost/thread/detail/platform.hpp:17:0, from ./boost/thread/once.hpp:12, from libs/thread/src/pthread/once.cpp:7: ./boost/config/requires_threads.hpp:29:4: error: #error "Threading support unavaliable: it has been explicitly disabled with BOOST_DISABLE_THREADS" "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -Wno-long-long -DBOOST_ALL_NO_LIB=1 -DBOOST_THREAD_BUILD_LIB=1 -DBOOST_THREAD_POSIX -DNDEBUG -I"." -c -o "bin.v2/libs/thread/build/gcc-4.7.1/release/link-static/threading-multi/pthread/once.o" "libs/thread/src/pthread/once.cpp" ...failed gcc.compile.c++ bin.v2/libs/thread/build/gcc-4.7.1/release/link-static/threading-multi/pthread/once.o... ...skipped <pbin.v2/libs/thread/build/gcc-4.7.1/release/link-static/threading-multi>libboost_thread.a(clean) for lack of <pbin.v2/libs/thread/build/gcc-4.7.1/release/link-static/threading-multi>pthread/thread.o... ...skipped <pbin.v2/libs/thread/build/gcc-4.7.1/release/link-static/threading-multi>libboost_thread.a for lack of <pbin.v2/libs/thread/build/gcc-4.7.1/release/link-static/threading-multi>pthread/thread.o... ...skipped <p/home/usmda/rose/boost/install2/lib>libboost_thread.a for lack of <pbin.v2/libs/thread/build/gcc-4.7.1/release/link-static/threading-multi>libboost_thread.a... gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/instantiate_cpp_exprgrammar.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/instantiate_cpp_grammar.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/instantiate_cpp_literalgrs.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/instantiate_defined_grammar.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/instantiate_predef_macros.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/instantiate_re2c_lexer.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/instantiate_re2c_lexer_str.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/token_ids.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/wave_config_constant.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/cpplexer/re2clex/aq.o gcc.compile.c++ bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/cpplexer/re2clex/cpp_re.o gcc.archive bin.v2/libs/wave/build/gcc-4.7.1/release/link-static/threading-multi/libboost_wave.a common.copy /home/usmda/rose/boost/install2/lib/libboost_wave.a ...failed updating 4 targets... ...skipped 9 targets... ...updated 9270 targets...

2 1

[Interprocess] Growing resets permissions
by Aaron_Wright＠selinc.com 12 Sep '12

12 Sep '12

I have a situation where I don't know how much shared memory I need, so I made the shared memory grow when it ran out of space. My shared memory is shared between a process running as root and postgres, which won't run as root. So I set the permissions to unrestricted (0666) when I create the shared memory. My problem is that when I grow the shared memory, the permissions are reset to (0644). This breaks things, as postgres can no longer open the shared memory for writing. I followed the code a bit and saw that it was using ftruncate. Checking the man page for ftruncate reveals, "the set-user-ID and set-group-ID permission bits may be cleared." Has anyone else ran into this? What is the easy solution? Should I just set the permissions manually after growing? Is this a bug in the interprocess library? --- Aaron Wright

2 1

FW: [Review] Coroutine review starts today, September 3rd, ends September 12th
by Hartmut Kaiser 11 Sep '12

11 Sep '12

This is just a reminder that the review of Oliver's Boost.Coroutine is ending tomorrow (see below for the initial announcement). Please get your reviews in as soon as possible. If you need more time, please let me know. Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu > -----Original Message----- > From: Hartmut Kaiser [mailto:hartmut.kaiser@gmail.com] > Sent: Monday, September 03, 2012 6:46 AM > To: boost-users(a)lists.boost.org > Subject: {Review] Coroutine reviewstarts today, September 3rd > > > Hi all, > > The review of Oliver Kowalke's Boost.Coroutine library starts today, > September 3rd 2012, and will end on September 12th. > I really hope to see your vote and your participation in the discussions > on the Boost mailing lists! > > ----------------------------------------------------- > > About the library: > > Boost.Coroutine provides templates for generalized subroutines > (coroutines) which allow multiple entry points for suspending and resuming > execution at certain locations. It preserves local state/data and allows > re-entering subroutines more than once (useful if state must be kept > across function calls). Coroutines can be viewed as a language-level > construct providing a special kind of control flow. > > You can download the library and the view documentation here: > > docs: http://ok73.ok.funpic.de/boost/libs/coroutine/doc/html/ > src: http://ok73.ok.funpic.de/boost.coroutine.zip > > --------------------------------------------------- > > Please always state in your review, whether you think the library should > be accepted as a Boost library! > > Additionally please consider giving feedback on the following general > topics: > > - What is your evaluation of the design? > - What is your evaluation of the implementation? > - What is your evaluation of the documentation? > - What is your evaluation of the potential usefulness of the library? > - Did you try to use the library? With what compiler? Did you have any > problems? > - How much effort did you put into your evaluation? A glance? A quick > reading? In-depth study? > - Are you knowledgeable about the problem domain? > > Regards Hartmut > Review Manager

1 0

Fusion error: wrong number of template arguments (30, should be 20)
by Joost Kraaijeveld 11 Sep '12

11 Sep '12

Hi, I have the following error after an upgrade to Boost 1.49 (Debian Wheezy): /usr/include/boost/fusion/container/deque/detail/preprocessed/deque_initial_size30.hpp:14:196: error: wrong number of template arguments (30, should be 20) In file included from /usr/include/boost/mpl/aux_/include_preprocessed.hpp:37:0, from /usr/include/boost/mpl/vector.hpp:46, from /usr/include/boost/fusion/container/deque/detail/deque_initial_size.hpp:16, from /usr/include/boost/fusion/container/deque/deque.hpp:15, from /usr/include/boost/fusion/container/deque.hpp:11, from /usr/include/boost/fusion/container.hpp:14, from ../../../library/../include/Danu/DanuModelObjects/Login.hpp:12, from ../../../library/DanuModelObjects/Login.cpp:7: /usr/include/boost/mpl/aux_/preprocessed/gcc/vector.hpp:22:8: error: provided for 'template<class T0, class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class T10, class T11, class T12, class T13, class T14, class T15, class T16, class T17, class T18, class T19> struct boost::mpl::vector' I have defined the following: #define FUSION_MAX_VECTOR_SIZE 30 #define FUSION_MAX_MAP_SIZE 30 How can I solve this problem? TIA -- Groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl

3 7

[Range] insert algorithm fails if target is a map
by Robert Jones 11 Sep '12

11 Sep '12

The title says it all really. The failure occurs because the insert algorithm expects the container to provide a 3-arg insert of the form container.insert( position, begin, end ); whereas map's, multimap's and set's insert method only takes two arguments... map.insert( begin, end ); Is this limitation by design? It would be easy to provide specialisations for maps, mmaps and sets, but that would not be a completely general solution. - Rob.

3 3

Compilation error trying to pull in Boost::threads header file
by Sunil Matta 10 Sep '12

10 Sep '12

Error compiling a program trying to use Boost::thread. Nothing special on the offending line, simply an include of thread.hpp Fedora 17 gcc 4.7 Boost: 1_47_0 /usr/local/lib/Boost/boost_1_ 47_0/boost/thread/pthread/thread_data.hpp:36:41: error: use of deleted function ‘boost::shared_ptr<boost::detail::tss_cleanup_function>::shared_ptr(const boost::shared_ptr<boost::detail::tss_cleanup_function>&)’ 1) Seems like boost is trying to pull in boost:shared_ptr. Shouldnt this be pulling this from the std namespace now ? 2) Why are the boost libraries in a stage dir ? i.e. boost_1_47_0/*stage/* lib/libboost_program_options.so.1.47.0 Is this standard now ? tia, Sunil

3 3

[serialization] disable BOOST_STATIC_WARNING for track_never objects?
by Brian Budge 10 Sep '12

10 Sep '12

Hi all - It's possible that I'm still doing something questionable, in which case, I hope you'll let me know. If what I'm doing is okay, perhaps there's a way to disable this warning. I have a virtual class hierarchy which I use to pass messages via boost.mpi. These messages then perform dispatch through helper objects on either side of the communication. I want to turn off object pointer tracking, so I've set my classes via BOOST_CLASS_TRACKING(myclass, boost::serialization::track_never). I thought this would just turn it off without a hitch, but I get a huge cascade of warning/error messages stemming from check_pointer_tracking(), where there is a comment that "serializing an object of a type marked "track_never" through a pointer could result in creating more objects than were saved!". If this is expected, how can I turn the warning off? If it is not expected, are there suggestions for what might be changed? Thanks, Brian

2 2

boost program options with ublas vector
by Kraus Philipp 10 Sep '12

10 Sep '12

Hello, I try to read a boost::ublas::vector with the boost::program_options and I get an error "abort trap". My call shows ("init", po::value< ublas::vector<double> >()->multitoken(), "Initialization") With a std::vector everything works fine. po is a shortcut to boost::program_option and ublas to boost::ublas How / can I use a ublas vector with a multitoken on the program options? Thanks Phil

1 0

boost replacement for std::ostringstream
by Chris Stankevitz 07 Sep '12

07 Sep '12

Hello, Does boost provide a replacement for std::ostringstream? If so, can you please tell me the name so I can read the docs on it? The first thing I am going to read is whether or not such a best would provide "reserve". I would like to do this: //----- std::ostringstream Stream; // Stream.reserve(99999); // error: std::ostringstream does not provide reserve Stream.write(pBuffer, 99999); //----- Thank you, Chris

2 4

Boost.Hash and enums
by Filip Konvička 07 Sep '12

07 Sep '12

Hi, In Boost 1.51, it looks to me like boost::hash_value no longer knows how to handle enums anymore. Is the following the right way to tell it to treat enums like ints? #if (BOOST_VERSION >= 105100) // Boost 1.51.0+ namespace boost { /// Enable hashing of enums. template<typename E> size_t hash_value( E const e, typename std::enable_if<std::is_enum<E>::value, E>::type def = static_cast<E>(0)) { return hash_value((int)e); } } #endif Is enum hashing support going to be added to the library in the future? Thanks, Filip

3 5

Re: [Boost-users] Why is there so much co-dependency in Boost? Is there anything to be done about it?
by steve＠parisgroup.net 07 Sep '12

07 Sep '12

Hi again, I'm the original poster that started this thread. WOW! Thanks for all of the great responses. I apologize for posting this message and then getting called away on a business trip. It is only just now that I'm getting back to see what kind of response I got, and I'm thrilled. I'm happy to see that a number of folks involved with Boost see this issue as a significant problem, if only to certain types of companies. APOLOGY: I must apologize for a small mistake in my numbers, that might be somewhat important to someone. I managed to reverse the counts for the "Smart Ptr" and "String Algo" libraries. I remember thinking it kinda strange that one referenced more modules but the other referenced more lines. So it's really true that "String Algo" causes 382 files to be read, while "Smart Ptr" causes only 180 to be read. Sorry about that. I've taken a first pass through all the responses, and rather than respond to each of them individually, I'll offer some more information here and attempt to address address some of the questions that have been pointed back to me. 1) How did I get these numbers. Give some examples. Here's one of the places I'd love to be shown to be wrong. If my numbers are inflated, my sales job to my boss will be that much easier. So by all means, someone correct me if my approach is unsound. What I did was very simple. All I did was compile a very simple program and have g++ give me a list of all of the headers it read during the compilation, excluding system headers. This is done using the following line from my test Makefiles: $(CXX) $(CPPFLAGS) $(CXXFLAGS) -c $< 2> /dev/null -MM > headers.lst Here's the test for SmartPtr: #include <iostream> #include <boost/smart_ptr.hpp> using namespace std; int main(int argc, char* argv[]) { return 0; } This simple test produces a file named headers.lst with 180 unique header paths in it, all starting with "boost/". Discovering the modules used by each module took a few hours of fairly tedious labor, where I sorted and then grouped each list of headers, where each group consisted of headers coming from the same module. 2) Here are the specific module dependencies: Any: "base", Config, Exception, MPL, Preprocessor, Static Assert, Type Traits, Utility Filesystem: "base", Config, Exception, Functional, Integer, Iterators, MPL, Preprocessor, Smart Ptr, Static Assert, Type Traits, Utility SmartPtr "base", Config, Exception, MPL, Preprocessor, Static Assert, Type Traits, Utility StringAlgo: "base", Bind, Compatibility, Concept Check, Config, Exception, Function, Integer, Iterators, MPL, Preprocessor, Range, Static Assert, String Algo, Type Traits, Utility 3) In response to the suggestion to not use the convenience headers, like say "smart_ptr.hpp" as apposed to a header for an individual header type. It's bad enough to tell my programmers they can only use certain Boost modules. To tell them that they can only use certain parts of certain Boost modules just gets to be too much. Plus, I can see eventually using most, if not all of the functionality of the SmartPtr module. The same can be said for the other modules I'm interested in. If I have to run to my boss every time I want to use one new particular feature from a Boost module, it's not worth the effort. Nor would it be worth the overhead of figuring out how to police such a level of code use. So for better or worse, my consideration of the use of Boost has to be on a Module by Module basis. 4) In response to "the license says that it's free to use, and the copyright holders have agreed to that license, so everything is fine". That's not true in the legal world. Neither the license nor any statements made by the person stating a copyright mean anything if that person somehow, if intentionally or unintentionally, included some bit of someone else's code in what they are calling their own. If the original writer of the code can prove original authorship of the code, nothing done without THAT PERSON'S GRANT OF LICENSE means anything. That original author owns all rights to the use of that code, and can dictate how it can and cannot be used. It is this issue that concerns companies like mine. 5) In response to "Who cares how much code there is. How does one "vet" a piece of code, regardless of how much of it there is". It is not hard to look at 100 or 1000 lines of code in a few files and say "there's nothing novel here". If the code is all written to do one basic thing or set of things in a direct way, it's pretty easy to believe that a single or a few individuals wrote the code. And, if the claimed authorship is invalid, real damages would easy to justify as being minimal, given the very limited scope of what the code is capable of doing. It's also much easier to feel comfortable in the fact that many other developers are using these 1000 lines of code in their commercial products and haven't yet been sued over the use of some portion of it. And if/when one wants to upgrade to the next version of a module consisting of 1000 lines of code, it's pretty easy to see what was added/removed. But in the case of boost, with hundreds and possibly thousands (with fuller adoption) of individual files involved, consisting of tens to hundreds of thousands of lines of code, you can't have any idea what you've got In fact, you can feel fairly confident that all of those lines of code are NOT NECESSARY in the basic sense to the benefit you wish to gain from the module in question. So you have to ask yourself "what more does all this code do?", and you certainly can't read and understand the purpose of every line of such a quantity of code to answer that question And the fact that there's so much of it, leads one to wonder "what novel things might be going on in that code to require so much of it"? I mean, 384 header files being read for a Smart Ptr library is pretty darn "novel" in and of itself. Finally, there's mere statistics involved. If 1000 lines of code opens a company to a certain amount of negative exposure, 100,000 lines of code, one might argue, opens the company to 100 times as much exposure. 6) And...I'm not sure this question was asked specifically, but I'll ask it myself..."what are you so worried about". Here's an example of what we're worried about.... Say we develop a tool for Disney to use on one of its feature length films. A month before the premier date of the film, someone takes Disney to court and claims that one of their production tools, the one we wrote, contains code that was stolen from them. Disney asks us to come to court to defend our use of that code. In the case of 1000 lines, we can say exactly what we did to vet the use of the code, and state exactly what that code does not just for us but for anyone who might use it, pointing out that each of those users has a very clear idea of what the code does, what it's worth to them, and why they considered the copyright given by the supposed author to be valid. For 100,000 lines of code we say, well the 1% of the code we use kinda/sort works by doing this, but it does that by going off and using bits and pieces of all these other files, and frankly, we couldn't take the time to understand what all that code is for, and therefore can not possibly have understood that the code contained something novel that might have been misrepresented as to its authorship for reason of personal gain on the part of the offending copyright grantor. In the first case, maybe the judge puts some value on the 1000 lines of code, and because it's Disney, that number gets multiplied by 10X. It's still a small amount of money for Disney, so they pay the money and just decide never to do business with us again. In the second case, the judge says "wow, there's a lot of code here. This is going to take a lot of time to work out the ramifications of, and to put a dollar amount on" and files an injunction against Disney releasing their film. This costs Disney many millions of dollars on everything they've set in motion in order to release the film, that will now all be wasted money. Disney sues us for all of that money. We, as a very small software company, talk to our lawyer, who tells us our best bet is to fold the company and go find jobs working for Google. 7) Use a more modern C++ Some of our customers are in the Operating System Stone Age. For example, I often develop on Fedora, but my code has to be able to compile and run on Red Hat 5. AND, we are often told exactly what compiler to use, and that compiler sometimes not open source, and in a few cases no longer supported. So solving these issues with newer compilers is not an option. 8) Conclusion So, it DOES MATTER, IN A BIG WAY how much code I have to bring into my project's codebase to get SmartPtr capabilities. And even if it turned out that it didn't, my boss doesn't consider it worth the risk to make that call. He'd rather hire another programmer just to write a SmartPtr library, so that our project can stay on schedule and he can sleep at night, knowing his company isn't going to some day go "poof" due to a relaxed approach to using Open Source. Some of our customers don't allow their engineering departments any access to code on the internet for this very reason. There are firewalls designed solely to look for and disallow anything that looks like significant code or other data from coming into the company walls. We have to justify our use of each specific piece of Open Source to EACH OF THESE COMPANIES before we can begin to supply them with anything. So another big issue for us is that as soon as we say "We use Boost", we are dismissed from consideration for a project. I bet this happens all the time. Thanks All for all the interesting and valuable discourse! Take care! Steve PS) My company DOES already use the Boost Smart Ptr library. However, it uses a much earlier version of the library, one that depends on just a dozen or so headers. So I guess at one point individual Boost modules were more separable. Or maybe it was just generally smaller back when that module was adopted. So we DO already have and use Boost Smart Ptrs...we just don't have all the nifty new features in the latest and greatest, the most important of which is the ability to not require that the pointed to class be defined wherever a Smart Ptr is instantiated. I'm dying for that feature.

6 11

[mpi] Linking with MPICH2 under Cygwin
by Murphy, John T. 07 Sep '12

07 Sep '12

Hello all, I recently posted two messages concerning linking boost.mpi with MPICH2 under Cygwin. For the list archives, the solution to this problem was to make sure that the boost libraries were created using the link=static and runtime-link=static boost build options, which creates libraries appropriate for static linking (and marked with a -s infix). When linked statically to the MPICH libraries and the appropriate boost libraries my code can execute correctly. Best, John -- John T. Murphy Computational Postdoctoral Fellow Decision and Information Sciences and Argonne Leadership Computing Facility Argonne National Laboratory jtmurphy(a)anl.gov

1 0

boost::asio buffer questions, and boost::bind question
by Littlefield, Tyler 07 Sep '12

07 Sep '12

Hello: I had a couple of questions. I'm really confused about how the buffers in boost::asio work. I'm using async_read_until, and it wants a streambuf. so I looked at that, and it's a typedef for basic_streambuf. so I'm looking at how to set one of these up, and stackoverflow shows something like: boost::asio::streambuf streamBuffer; boost::asio::streambuf::mutable_buffers_type mutableBuffer = streamBuffer.prepare(max_length); so I'm curious what the mutable buffer is, and how it wraps around streambuf. I'm also curious how people generally handle buffers in their classes. I have a Session class, which will hold a buffer of data to be read, so that when I call HandleRead, it can just look at that buffer for the last line read in. Do I need to store a mutable_buffer and a streambuf? Or is the streambuf ok (and can I pull the data out of it somehow). Also, in that article it shows that it wraps the mutableBuffer in a boost::asio::buffer(what's the point in that?) Finally, my boost::bind question. I was curious how that worked out. When I use _1, _2 as placeholders, does the templating get substituted in somehow? Does it somehow construct an object that just has a () operator to take arguments? Also, if I wanted to write something to let me pull in the errors like placeholders, how do placeholders work/get translated out? Thanks, -- Take care, Ty http://tds-solutions.net The aspen project: a barebones light-weight mud engine: http://code.google.com/p/aspenmud He that will not reason is a bigot; he that cannot reason is a fool; he that dares not reason is a slave.

2 1

Boost.Thread win32 mutex implementations
by Collin Dauphinee 06 Sep '12

06 Sep '12

I was just looking at the win32 implementations of the various Boost.Thread mutex classes (specifically basic_recursive_mutex). I was surprised to see that they use WaitForSingleObject internally, rather than a CRITICAL_SECTION. I've found mentions that it originally used a CRITICAL_SECTION, but no explanation of why it was changed. It seems to me, personally, that the hybrid locking functionality of the CRITICAL_SECTION implementation would be more desirable than the WaitForSingleObject implementation in most use cases. Is there a reason for this choice? At first glance, it looks like it was just done to re-use code from the timed_mutex, which can't (easily) be implemented with CRITICAL_SECTION. Regards, Collin

1 0

Re: [Boost-users] Accessing MSM attribute under specific conditions causes non-compile
by Chiem Whua Ma 06 Sep '12

06 Sep '12

Thank you for your help! I see now that it's not that that the sub-machine is a state of the main machine, but ANY time you have an entry action performed directly from the machine level the fsm is reported as a state and not as an fsm. This isn't a problem since I know this is happening, but perhaps it might be possible to change this so fsm entry actions put the fsm in the fsm parameter slot? What is fsm equal to when an entry action is performed? Here's some code that shows exactly what can be set where and when for anyone else who is trying to figure this out... #include <vector> #include <iostream> #include <boost/msm/back/state_machine.hpp> #include <boost/msm/front/euml/euml.hpp> using namespace std; using namespace boost::msm::front::euml; namespace msm = boost::msm; namespace MSM_A // Concrete FSM implementation { BOOST_MSM_EUML_DECLARE_ATTRIBUTE(int, borrowedBuffer_attribute); BOOST_MSM_EUML_DECLARE_ATTRIBUTE(int, someother_Attribute); BOOST_MSM_EUML_ACTION(someAction) { template <class Event,class FSM,class STATE> void operator()(Event const& event,FSM& , STATE& state) { std::cout<<"Doing someAction."<<std::endl; state.get_attribute(borrowedBuffer_attribute)=1; } }; BOOST_MSM_EUML_ACTION(someOtherAction) { template <class Event,class FSM ,class STATE> void operator()(Event const& event,FSM& fsm, STATE& state) { std::cout<<"Doing someOtherAction."<<std::endl; fsm.get_attribute(borrowedBuffer_attribute)=1; state.get_attribute(someother_Attribute)=1; } }; BOOST_MSM_EUML_EVENT(someevent) BOOST_MSM_EUML_STATE((someOtherAction, no_action, attributes_<<someother_Attribute), someStateA) BOOST_MSM_EUML_STATE((no_action), someStateB) BOOST_MSM_EUML_TRANSITION_TABLE(( someStateA + someevent == someStateB ),transition_table) BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, init_ << someStateA, someAction, // <-------------------- ACTION IS AN ENTRY ACTION no_action, attributes_ << borrowedBuffer_attribute, configure_ << no_configure_ ), MSM_A_frontEnd) //fsm name typedef msm::back::state_machine<MSM_A_frontEnd> MSM_A_player; } namespace MSM_B // Concrete FSM implementation { ::MSM_A::MSM_A_player subMachine; BOOST_MSM_EUML_DECLARE_ATTRIBUTE(int, rootFSM_attribute); BOOST_MSM_EUML_DECLARE_ATTRIBUTE(int, rootstate_attribute); BOOST_MSM_EUML_EVENT(someEvent) BOOST_MSM_EUML_ACTION(rootFSM_action) { template <class Event,class FSM,class STATE> void operator()(Event const& event,FSM& , STATE& state) { std::cout<<"Doing rootFSM_action."<<std::endl; state.get_attribute(rootFSM_attribute)=1; } }; BOOST_MSM_EUML_ACTION(another_rootFSM_action) { template <class Event,class FSM,class STATE> void operator()(Event const& event,FSM& fsm , STATE& state) { std::cout<<"Doing another_rootFSM_action."<<std::endl; fsm.get_attribute(rootFSM_attribute)=1; state.get_attribute(rootstate_attribute)=1; } }; BOOST_MSM_EUML_STATE((another_rootFSM_action, no_action, attributes_<<rootstate_attribute), someState) BOOST_MSM_EUML_TRANSITION_TABLE(( someState + someEvent == someEvent ), transition_table) BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT init_ << subMachine << someState, rootFSM_action, // Entry no_action, // Exit attributes_ << rootFSM_attribute, // Attributes configure_ << no_configure_ ), MSM_B_frontEnd) //fsm name typedef msm::back::state_machine<MSM_B_frontEnd> MSM_B_player; } int main() { std::cout<<"Making player."<<std::endl; MSM_B::MSM_B_player player; std::cout<<"Starting player."<<std::endl; player.start(); std::cin.ignore(1); return 0; }

2 3

Why is there so much co-dependency in Boost? Is there anything to be done about it?
by steve＠parisgroup.net 06 Sep '12

06 Sep '12

Greetings, As a veteran C++ programmer, I've been an admirer of the Boost library for many years. I've used it at a number of companies I've worked for, especially the SmartPtr library. Right now I'm working for a company that worries a lot about negative exposure to Open Source software issues such as questions that might arise about authorship, copyright or even patent issues. The company does allow the use of Open Source software, but it requires that each piece of code that is brought in first be justified and vetted. Unfortunately, I'm finding this to be a nearly impossible task when I look at the amount of code that must be compiled to use the Boost modules I'm interested in. I've done a study and written some tools, to determine just how many Boost header files must be included to use some of the Boost modules. The numbers are staggering: Any: 79 FileSystem: 276 Smart Ptr: 382 String Algo: 180 I went on and did a tally of which modules these header files came from. Here are the counts for how many other Boost modules each of these modules depends upon: Any: 8 FileSystem: 13 SmartPtr: 8 String Algo: 15 Given these numbers, I think I have to abandon any thoughts of using Boost within my current company. There's no way I'm going to get approval to bring so much code into our work just to get a SmartPtr or FIleSystem library. This is unfortunate, because due to Boost's existence there doesn't seem to be much work going on out there to offer lighter weight alternatives. I'm writing this request in the hopes that there's something I'm missing here, and that someone can point out my folly. Is there a way to utilize any of these Boost modules in such a way that they do not require the inclusion of so much code? If not, does anyone have any suggestions as to how to make this fly with my boss? Has this issue come up before and been considered by the Boost designers? I find the issue baffling. TIA for any help or insight anyone can provide. Steve

20 29

[mpi] broadcast performance
by Brian Budge 06 Sep '12

06 Sep '12

Hi all - I need some advice for using the broadcast function of boost::mpi. We have a large buffer (sometimes gigabytes) that we need to get to all child nodes. We currently use boost::serialization with a binary archive to write the data into a std::vector<char>. Then we send that data across, and deserialize. The data is sent with MPI_Bcast. I've started testing with similar functionality using boost::mpi::broadcast to handle serialization and deserialization. Tracing through the code, it seems that the data is sent to all the child nodes via isend. Is there something I can do to ensure that Bcast will be used instead? If I only have a couple of nodes, the former is fine, but with more nodes, the MPI implementation of Bcast may do a better job (logarithmic or even constant time with the number of nodes). What are the suggestions for getting fast broadcast in this case? I don't think that using skeletons will help, since each instance of the broadcast will have unique data with potentially different layouts. Thanks, Brian

2 6

serialisation use of asserts versus throw ?
by Avi Bahra 06 Sep '12

06 Sep '12

This is question about use of asserts in boost serialisation. As a program migrates from one release to another the api changes. This is expected. In my case I have client/server that uses boost serialisation. I was expecting an throw due to the incompatibility not a an assert. The assert crashes my client, giving no chance for recovery, and informing the user that they are using previous out of date release/server. In may case: boost_iarchive.cpp inline const basic_pointer_iserializer * 399 basic_iarchive_impl::load_pointer( 400 basic_iarchive &ar, 401 void * & t, 402 const basic_pointer_iserializer * bpis_ptr, 403 const basic_pointer_iserializer * (*finder)( 404 const boost::serialization::extended_type_info & type_ 405 ) 406 407 ){ ..... 436 BOOST_ASSERT(NULL != bpis_ptr); 437 class_id_type new_cid = register_type(bpis_ptr->get_basic_serializer()); 438 int i = cid; 439 cobject_id_vector[i].bpis_ptr = bpis_ptr; 440 BOOST_ASSERT(new_cid == cid); // yikes How do people get round this issue, where old and new release of software need to co-exist ? Would it be possible to use a #define to configure use of asserts or throw ? Any help apperciated . Best regards, Ta, Avi

4 3

Boost.Variant: Infinite recursion in constructor
by Markus Lenger 06 Sep '12

06 Sep '12

Hi! I face a problem using Boost.Variant 1.48 under Windows with Cygwin and g++ (GCC) 4.5.3. The following code crashes due to infinite recursion in the constructor of a_t: #include <boost/variant.hpp> #include <iostream> struct a_t { boost::variant< boost::recursive_wrapper<a_t>,int > child; }; int main() { a_t a; std::cout << "OK" << std::endl; return 0; } If I change the type of "child" to "boost::variant< int, boost::recursive_wrapper<a_t> >" (I just swapped the template parameters) the program prints "OK". Any ideas?

2 1

boost dijkstra : retrieve the whole path
by Viviane Parent 06 Sep '12

06 Sep '12

Hello people I'm stubbling on a very stupid problem I think, but I can't find any hint about it. I'm using the boost algorithm dijkstra_shortest_path and I simply want to know how to retrieve all the steps the algo goes through for the shortest path found. To illustrate : I'm glad to know that to go from A to Z, the minimal cost is 26, but I would like also to know that this path goes from A to B then from B to C etc. I used the example http://www.boost.org/doc/libs/1_51 [...] ample.cpp<http://www.boost.org/doc/libs/1_51_0/libs/graph/example/dijkstra-example.cp…> So I ended up with dijkstra_shortest_paths(g, s, &p[0], &d[0], weightmap, indexmap, std::less<int>(), closed_plus<int>(), (std::numeric_limits<int>::max)(), 0,default_dijkstra_visitor()); (I use Visual) Is the info I need somewhere in the visitor, or something ? Thanks for any help you can provide, Sorry for my crappy english V

2 3

Strange linker error
by John M. Dlugosz 06 Sep '12

06 Sep '12

On a Mac, I'm getting a strange linker error, Duplicate symbol typeinfo name for boost::tag_original_exception_type* (in two .o files). Now I only see that name used once in the boost source code, in exception/detail/exception_ptr.hpp, and don't see how it could mean different things in different translation units. Any clue what that's about? —John

2 1

Using a binomial_heap with indirect_cmp
by David Doria 05 Sep '12

05 Sep '12

I am trying to keep a heap sorted by values in a property map. I tried the code below, but the compiler does not like my arguments to the heap constructor (PriorityQueueType pq(indirectComparison);). According to the documentation (http://www.boost.org/doc/libs/1_51_0/doc/html/boost/heap/binomial_heap.html) there is a constructor: explicit binomial_heap(value_compare const & = value_compare()); that takes a value_compare, which I was thinking would of type IndirectComparisonType that I provided (I don't really understand the optional template arguments and the base_maker::compare_argument type of things)? Here is the indirect_cmp doc for reference: http://www.boost.org/doc/libs/1_51_0/boost/pending/indirect_cmp.hpp #include <boost/heap/binomial_heap.hpp> #include <boost/pending/indirect_cmp.hpp> #include <boost/array.hpp> #include <boost/graph/grid_graph.hpp> #include <iostream> int main(int, char*[]) { // Construct a graph boost::array<std::size_t, 2> lengths = { { 2,2 } }; typedef boost::grid_graph<2> GraphType; GraphType graph(lengths); typedef boost::graph_traits<GraphType>::vertex_descriptor Vertex; typedef boost::property_map<GraphType, boost::vertex_index_t>::const_type GridIndexMapType; GridIndexMapType gridIndexMap(get(boost::vertex_index, graph)); // Construct a property map typedef boost::vector_property_map<float, GridIndexMapType> PriorityMapType; PriorityMapType priorityMap(gridIndexMap); // Construct the indirect comparison functor typedef boost::indirect_cmp<PriorityMapType, std::less<float> > IndirectComparisonType; IndirectComparisonType indirectComparison(priorityMap); // Construct the queue typedef int ValueType; typedef boost::heap::binomial_heap<ValueType, boost::heap::stable<false>, IndirectComparisonType> PriorityQueueType; PriorityQueueType pq(indirectComparison); return 0; } Does anyone know how to provide this indirect comparison functor to the queue properly? Thanks, David

1 1

Problems in boost/mpl/aux_/template_arity.hpp when BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS is defined on g++ 4.6.3 and boost 1.50
by Alach 05 Sep '12

05 Sep '12

Hi, Please help. I have encountered a problem on gcc 4.6.3 and boost 1.50 when trying to compile my library with extensive usage of boost::mpl and boost::fusion on gcc. It was required to enable customization of the number of template arguments handled by boost::fusion and boost::mpl containers and mpl meta functions. Not surprisingly the code compiles fine in visual studio 2010. whole code can be found here: svn checkout svn://svn.code.sf.net/p/d-injection/code-0/trunk This is how I have altered template arguments count: #define FUSION_MAX_VECTOR_SIZE DI_MAX_NUM_INJECTIONS #define FUSION_MAX_VECTOR_SIZE DI_MAX_NUM_INJECTIONS #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #define BOOST_MPL_LIMIT_VECTOR_SIZE DI_MAX_NUM_INJECTIONS #define BOOST_MPL_LIMIT_SET_SIZE DI_MAX_NUM_INJECTIONS #define BOOST_MPL_LIMIT_METAFUNCTION_ARITY DI_MAX_NUM_INJECTIONS #include <boost/fusion/include/as_vector.hpp> #include <boost/fusion/include/as_set.hpp> #include <boost/fusion/adapted/mpl.hpp> #include <boost/fusion/include/mpl.hpp> #include <boost/fusion/include/for_each.hpp> #include <boost/fusion/include/at_key.hpp> #include <boost/mpl/vector.hpp> #include <boost/mpl/remove.hpp> #include <boost/mpl/inserter.hpp> #include <boost/mpl/transform.hpp> #include <boost/mpl/insert.hpp> #include <boost/mpl/count.hpp> #include <boost/mpl/copy.hpp> #include <boost/mpl/set.hpp> #include <boost/mpl/inherit.hpp> #include <boost/mpl/joint_view.hpp> #include <boost/mpl/contains.hpp> #include <boost/mpl/size.hpp> #undef FUSION_MAX_VECTOR_SIZE #undef FUSION_MAX_SET_SIZE #undef BOOST_MPL_LIMIT_VECTOR_SIZE #undef BOOST_MPL_LIMIT_SET_SIZE #undef BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #undef BOOST_MPL_LIMIT_METAFUNCTION_ARITY And I get this error: In file included from ../../libraries/boost_1_50_0/boost/mpl/aux_/full_lambda.hpp:29:0, from ../../libraries/boost_1_50_0/boost/mpl/lambda.hpp:22, from ../../libraries/boost_1_50_0/boost/mpl/apply.hpp:25, from ../../libraries/boost_1_50_0/boost/mpl/aux_/fold_impl.hpp:19, from ../../libraries/boost_1_50_0/boost/mpl/fold.hpp:20, from ../../libraries/boost_1_50_0/boost/fusion/sequence/intrinsic/detail/segmented_size.hpp:12, from ../../libraries/boost_1_50_0/boost/fusion/sequence/intrinsic/size.hpp:16, from ../../libraries/boost_1_50_0/boost/fusion/view/joint_view/joint_view.hpp:15, from ../../libraries/boost_1_50_0/boost/fusion/algorithm/transformation/push_back.hpp:11, from ../../libraries/boost_1_50_0/boost/fusion/view/iterator_range/detail/segmented_iterator_range.hpp:19, from ../../libraries/boost_1_50_0/boost/fusion/view/iterator_range/detail/segments_impl.hpp:13, from ../../libraries/boost_1_50_0/boost/fusion/view/iterator_range/iterator_range.hpp:21, from ../../libraries/boost_1_50_0/boost/fusion/view/iterator_range.hpp:10, from ../../libraries/boost_1_50_0/boost/fusion/sequence/intrinsic/detail/segmented_begin.hpp:12, from ../../libraries/boost_1_50_0/boost/fusion/sequence/intrinsic/begin.hpp:17, from ../../libraries/boost_1_50_0/boost/fusion/container/vector/vector10.hpp:15, from ../../libraries/boost_1_50_0/boost/fusion/container/vector/vector_fwd.hpp:14, from ../../libraries/boost_1_50_0/boost/fusion/container/vector/vector.hpp:10, from ../../libraries/boost_1_50_0/boost/fusion/container/vector/detail/as_vector.hpp:18, from ../../libraries/boost_1_50_0/boost/fusion/container/vector/convert.hpp:10, from ../../libraries/boost_1_50_0/boost/fusion/include/as_vector.hpp:10, from ./di/detail/variadics.hpp:42, from ./di/subject.hpp:10, from test/abstract_builder_should.hpp:11, from test/main.cpp:6: ../../libraries/boost_1_50_0/boost/mpl/aux_/template_arity.hpp:86:1: error: macro "BOOST_PP_TUPLE_ELEM_E_2" requires 2 arguments, but only 1 given ../../libraries/boost_1_50_0/boost/mpl/aux_/template_arity.hpp:86:1: error: macro "BOOST_PP_SEQ_ELEM_III" requires 2 arguments, but only 1 given ../../libraries/boost_1_50_0/boost/mpl/aux_/template_arity.hpp:86:1: error: macro "BOOST_PP_SEQ_ELEM_III" requires 2 arguments, but only 1 given There are more of course, but the consensus is that all errors are somewhat connected to BOOST_PP_ macros. I've tried to find the reason, but with no luck. Thank you in advance, Adam. -- View this message in context: http://boost.2283326.n4.nabble.com/Problems-in-boost-mpl-aux-template-arity… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

[mpi] linking MPI with MPICH2 under Cygwin
by Murphy, John T. 05 Sep '12

05 Sep '12

Hello, I'm getting a very consistent problem trying to link with the Boost.MPI library and MPICH2 under Cygwin. What seems to be happening is that the libboost_mpi library that is created contains redundant copies of elements from the MPI libraries. For example: It is possible to add debugging code to MPICH2 source code, build MPICH2, build Boost's mpi library against this, then compile, link, and run an executable, with the result that the debugging code is output from the MPICH functions. Then it is possible to modify the MPICH debugging code and rebuild MPICH2, but leave Boost's mpi library so that it is _not_ rebuilt. When the executable is rebuilt and linked to the boost and MPICH libraries, the output indicates that some of the old versions of the debugging code are still being used while other functions have the new code. The error I am getting is 'Attempting to use an MPI routine before initializing MPICH'. My debugging suggests that during execution there are two distinct copies of the MPICH flag that indicates that MPICH has been initialized; one of these shows that the MPI_Init initialization has been run but the other does not. Additionally, an MPI program that contains no reference to boost and that compiles and runs cleanly when linked only with the MPICH libraries will crash with the same error if the linker is instructed to link against the boost mpi library, even though nothing in the boost namespace appears in the code. Has anyone seen this, or have a solution? The issue seems to be something that is happening with linking while the Boost.mpi library is being built, part of which is being done by bjam (aka b2). Is it possible to specify how boost's mpi library will be built and linked against the MPICH libraries, and if so is there a strategy I can use to avoid the problems I am having? I'm using Boost 1.48 for compatibility with other code we're using. I have the same code built and running on other systems; the error seems to be specific to the Cygwin environment. Thanks, John -- John T. Murphy Computational Postdoctoral Fellow Decision and Information Sciences and Argonne Leadership Computing Facility Argonne National Laboratory jtmurphy(a)anl.gov

1 0

BGL: d_ary_heap_indirect duplicated values
by David Doria 05 Sep '12

05 Sep '12

I am using a d_ary_heap_indirect as a priority queue using a property map to store the priorities. However, I when I change the values in the priority property map and push vertices that are already in the queue into the queue again, it results in kind of an invalid state where the vertex appears in the queue twice at different positions. Here is a demo: http://programmingexamples.net/wiki/CPP/Boost/BGL/IndirectPriorityQueue It simply sets random priority values for every vertex, and pushes them all into the queue. It then does exactly the same thing again. You can see that some vertices appear twice in the queue at different positions. For example, vertex (3,0) occurs at position 0 in the queue, and again at position 6. Of course the priority values that are output are the same because the demo simply outputs the values that are currently in the priority property map, but I guess I would expect the two instances of a vertex to appear at back-to-back positions in the queue (as it should have used their current value to sort the queue)? Is there a way to replace a vertex in the queue when it is pushed instead of adding a second one? (like an std::set instead of the current behavior which is like std::multiset)? Thanks, David

3 17

asio: question regarding design
by Goran 05 Sep '12

05 Sep '12

Hi all, I wanna change the design of some async client (code at end of this message) towards something like "run as a server and pull a message from another server". The so called "another server" will be my master server in future. At the moment I'm taking some example from asio's documentation: http://www.boost.org/doc/libs/1_46_1/doc/html/boost_asio/tutorial/tutdaytim… The async client is derived from another example of asio's documentation: http://www.boost.org/doc/libs/1_46_1/doc/html/boost_asio/example/http/clien… My simple question is: How would you change the code below to run in a loop and pulls 'let's say' every second a message from master server? Thanks a lot! #include <iostream> #include <istream> #include <ostream> #include <string> #include <boost/asio.hpp> #include <boost/bind.hpp> using boost::asio::ip::tcp; class client { public: client(boost::asio::io_service& io_service, const std::string& server, const std::string& port) : resolver_(io_service), socket_(io_service) { // Start an asynchronous resolve to translate the server and service names // into a list of endpoints. tcp::resolver::query query(server, port); resolver_.async_resolve(query, boost::bind(&client::handle_resolve, this, boost::asio::placeholders::error, boost::asio::placeholders::iterator)); } private: void handle_resolve(const boost::system::error_code& err, tcp::resolver::iterator endpoint_iterator) { if (!err) { // Attempt a connection to each endpoint in the list until we // successfully establish a connection. tcp::endpoint endpoint = *endpoint_iterator; socket_.async_connect(endpoint, boost::bind(&client::handle_connect, this, boost::asio::placeholders::error)); } else { std::cout << "Error: " << err.message() << "\n"; } } void handle_connect(const boost::system::error_code& err) { if (!err) { // The connection was successful. Read the response. boost::asio::async_read(socket_, response_, boost::bind(&client::handle_response, this)); } else if (err != boost::asio::error::eof) { std::cout << "Error: " << err.message() << "\n"; } } void handle_response() { if (response_.size() > 0) std::cout << "Response: " << &response_; else std::cout << "Response is empty." << std::endl; } tcp::resolver resolver_; tcp::socket socket_; boost::asio::streambuf request_; boost::asio::streambuf response_; }; int main(int argc, char* argv[]) { try { if (argc != 3) { std::cout << "Usage: async_client <server> <port>\n"; std::cout << "Example:\n"; std::cout << " async_client localhost 2020\n"; return 1; } boost::asio::io_service io_service; client c(io_service, argv[1], argv[2]); io_service.run(); } catch (std::exception& e) { std::cout << "Exception: " << e.what() << "\n"; } return 0; }

1 0

Re: [Boost-users] compilation problems with thread/chrono & boost 1.51 & HPUX
by Avi Bahra 05 Sep '12

05 Sep '12

>Le 04/09/12 11:44, Avi Bahra a ?crit : >>>> On 3.9.2012. 10:26, Avi Bahra wrote: >>>>> Can any one suggest *any* hacks/workarounds that gets me pass these errors. >>>>> Is it possible to use gcc on HPUX with boost 1.51 ? >>>> The docs for boost thread 1.51 say this: >>>> >>>> Boost.Thread uses by default Boost.Chrono for the time related >>>> functions. For backward compatibility and also for compilers that don't >>>> work well with Boost.Chrono the user can define >>>> BOOST_THREAD_DONT_USE_CHRONO. If BOOST_THREAD_DONT_USE_SYSTEM is defined >>>> then BOOST_THREAD_DONT_USE_CHRONO is defined implicitly. >>>> >>>> BOOST_THREAD_USES_CHRONO is defined when Boost.Thread uses Boost.Chrono. >> I have already tried BOOST_THREAD_DONT_USE_CHRONO and it has no effect. >> It appears that some of headers files are not guarded with this. >> >> In my case >> $BOOST_ROOT/boost/chrono/system_clocks.hpp >This evidently should not be included. Could you point from where it is >included? libs/chrono/src/chrono.cpp fails to compile with errors in system_clocks.hpp and overflow_helpers.hpp >> $BOOST_ROOT/boost/ratio/detail/overflow_helpers.hpp >This evidently should not be included. Could you point from where it is >included? libs/chrono/src/chrono.cpp fails to compile with errors in system_clocks.hpp and overflow_helpers.hpp libs/chrono/src/process_cpu_clocks.cpp fails to compile with error in overflow_helpers.hpp >> $BOOST_ROOT/boost/thread/future.hpp >Could you point where in this file the compiler fails? >> do not compile, >> "libs/thread/src/future.cpp" >> >> Also Is it possible to make a request to change: >> >> $BOOST_ROOT/boost/thread/future.hpp >> >> line:603 >> for(count_type i=0;i<count;++i) >> { >> #if defined __DECCXX || defined __SUNPRO_CC >> locks[i]=boost::unique_lock<boost::mutex>(futures[i].future_->mutex).move(); >> #else >> locks[i]=boost::unique_lock<boost::mutex>(futures[i].future_->mutex); >> #endif >> } >> >> T0: >> >> for(count_type i=0;i<count;++i) >> { >> #if defined __DECCXX || defined __SUNPRO_CC || defined __hpux >> locks[i]=boost::unique_lock<boost::mutex>(futures[i].future_->mutex).move(); >> #else >> locks[i]=boost::unique_lock<boost::mutex>(futures[i].future_->mutex); >> #endif >> } >> >Please could you create a ticket for that? created ticket 7329. It should be noted that there also numerous warnings in compiling file libs/chrono/src/process_cpu_clocks.cpp i.e "./boost/chrono/detail/inlined/posix/process_cpu_clocks.hpp", line 118: warning #2940-D: missing return statement at end of non-void function "boost::chrono::process_real_cpu_clock::now(boost::system::error_code &)" } "./boost/chrono/detail/inlined/posix/process_cpu_clocks.hpp", line 194: warning #2940-D: missing return statement at end of non-void function "boost::chrono::process_user_cpu_clock::now(boost::system::error_code &)" } "./boost/chrono/detail/inlined/posix/process_cpu_clocks.hpp", line 271: warning #2940-D: missing return statement at end of non-void function "boost::chrono::process_system_cpu_clock::now(boost::system::error_code &)" } "./boost/chrono/detail/inlined/posix/process_cpu_clocks.hpp", line 350: warning #2940-D: missing return statement at end of non-void function "boost::chrono::process_cpu_clock::now(boost::system::error_code &)" } These could easily be removed by simple restructure of the code. Best regards, Ta, Avi

2 1

Re: [Boost-users] [boost] [Review.Coroutine] Some comments
by Oliver Kowalke 05 Sep '12

05 Sep '12

> * I don't know if showing the signature in the documentation will be > more informative. OK > * Could you add the following noexcept specifier? OK > * As the template class Allocator is not used to allocate internal > memory of the coroutine class. Could the Allocator parameter be renamed > StackAllocator? OK > * Could you add an standard Allocator parameter as e.g. the one of > packaged_task? > > C++ International Standard > > * I understand that the Boost.Context Allocator parameter is part od the > class, as context is a low-level class, but coroutine is more high > level. Is there a possibility to type erase the StackAllocator (and > preceding Allocator) template parameter, as packaged_task do? This will > allow to store coroutines (and generators) with the same signature in a > container even if they don't share the Allocator. You mean coroutine would have two allocators - one for allocating internal memory and one for allocating the stack? Removing the StackAllocator from the template arguments of coroutine should not that problem (would require an internal pointer to an internal interface - maybe detail::context_exec is a candidate). I've some concerns about having two allocator objects in coroutine's ctor . > * Parameters and move semantics. Could the signature parameters be > rvalue references? > > R operator()(A0 a0, ..., A9 a9); Hmmm - this would require a second version of opertor() and all arguments are moveable?! R operator()(BOOST_RV_REF( A0) a0, ..., BOOST_RV_REF( A)) a9); > I'm asking this because I think that Boost.Tuple has not implemented yet > move semantics. don't know - would that be an issue > * What about moving some of the coroutine/generator optional parameters > to a coro::attributes class > > std::size_t size = ctx::default_stacksize(), > flag_unwind_t do_unwind = stack_unwind, > bool preserve_fpu = true, instead of passing those threee params as args to coroutine ctor? good point > * Usually (at least in the C++ standard) a function doesn't throws > because of its preconditions are not satisfied. then assert? pre-conditions should be checked but how should I react if I get garbage from the user? > This should be coherent with > > > |Result operator()()| > > Preconditions: > > |*this| is not a /not-a-generator/, |! is_complete()|. > > which doesn't throws any specific exception if the preconditions are not > satisfied. does an assert - OK the I'll replace throwing excpetions be assertions > Documentation > ========= > > coroutine.html > > s/it can migrated between threads/it can migrate between threads/ OK > s/yield_return/yield_break/ > > * documentation for the following constructor is missing in the reference > > template< typename Fn > > coroutine( Fn && fn, > std::size_t size = ctx::default_stacksize(), > flag_unwind_t do_unwind = stack_unwind, > bool preserve_fpu = true, > Allocator alloc = Allocator() ); OK I think it will be easy to incorporate your suggestions - but during the boost.context review I was told not to modify the reviewd library (if the review is still on-going). regards, Oliver

1 0

can different versions of boost coexist in an executable?
by Nathan Ridge 05 Sep '12

05 Sep '12

Hello, I am developing a C++ library, which I distribute in binary form as a static library. The implementation of my library uses Boost, but the interface does not, so I completely shield my users from the Boost dependency by linking the Boost object files that my implementation requires into the static library. Suppose a client of my library uses Boost in their own code. When they link their executable, the linker now sees two copies of some Boost libraries: the copy in my static library, and their own copy that they are linking. It seems that the linker only keeps one of the two and discards the other. If the Boost version that I linked into my static library is different from the Boost version my client uses, then one of my code and their code will be linked to a different version of Boost that the one it was compiled against, leading to a crash. I suppose one way to rectify this problem would be for me to document what version of Boost libraries I compiled and linked against, and require that if my clients use Boost themselves, they use the same version. However, I dislike this solution for two reasons: 1) It exposes my library's dependence on Boost, which was meant to be an implementation detail. 2) It limits my clients to using a particular version of Boost. They may have good reasons for using an older (or newer!) version instead. I would much prefer if the linker kept both copies of the Boost libraries in the executable, and each piece of code (mine and my client's) used whichever version of the libraries it was compiled against. Can this be accomplished? Thanks, Nate

2 1

[fusion] Wrapping a Fusion sequence
by Agustín K-ballo Bergé 04 Sep '12

04 Sep '12

I'm looking for a way to create a Fusion sequence wrapper that is itself a Fusion sequence and forwards all 'calls' to its wrapped sequence. Something in the lines of template< typename Sequence > struct sequence_wrapper { explicit sequence_wrapper( Sequence const& s ) : seq( s ){} Sequence seq; }; where sequence_wrapper< Sequence > is a Fusion sequence as well, and works just as Sequence would. The reason I need this is that I have several functions that operate on Fusion sequences (where all elements satisfy some special requirements), and I would like to add some syntax sugar for which I need a custom type to add overloaded operators to. I do not need the result of operations on a sequence_wrapper to return a sequence_wrapper as well, only the syntax sugar related calls would return a (manually) wrapped sequence. For instance, appending elements to a sequence using the comma operator (somewhat of a Boost.Assign for Fusion sequences): template< typename Sequence, typename T > sequence_wrapper< typename boost::fusion::result_of::push_back< Sequence const& , T >::type > operator,( Sequence const& seq, T const& v ) { return sequence_wrapper< typename boost::fusion::result_of::push_back< Sequence const& , T >::type >( boost::fusion::push_back( seq, v ) ) ; } What would be the best way to achieve this (if it is indeed supported by the library)? I'm particularly trying to avoid creating a Fusion sequence from scratch, as I would like to use whatever sequence is returned by Fusion operations. Would inheritance + specialization of `tag_of` to return the tag of the wrapped sequence just work? Or will I need to define a tag of my own and implement all required functions to just forward the call? Thank you in advance. Agustín K-ballo Bergé.- http://fusionfenix.com

2 4

Trying to compile and use boost on proprietary complier similar to MPICH2 CXX
by Chris 04 Sep '12

04 Sep '12

Hi all, hope this is the right list for my question. So here it goes: When it try to use boost using a proprietary MPIC++ compiler I have no control over, I get the following errors: In file included from ../boost_1_43_0/boost/thread/detail/platform.hpp:17, from ../boost_1_43_0/boost/thread/thread.hpp:12, from ../boost_1_43_0/boost/thread.hpp:13, from test.cpp:37: ../boost_1_43_0/boost/config/requires_threads.hpp:47:5: error: #error "Compiler threading support is not turned on. Please set the correct command line options for threading: -pthread (Linux), -pthreads (Solaris) or -mthreads (Mingw32)" In file included from ../boost_1_43_0/boost/thread/thread.hpp:12, from ../boost_1_43_0/boost/thread.hpp:13, from test.cpp:37: ../boost_1_43_0/boost/thread/detail/platform.hpp:67:9: error: #error "Sorry, no boost threads are available for this platform." In file included from ../boost_1_43_0/boost/thread.hpp:13, from test.cpp:37: ../boost_1_43_0/boost/thread/thread.hpp:19:2: error: #error "Boost threads unavailable on this platform" The thing is, when I use the standard mpicxx from MPICH2, things work out fine. I'm now trying to find out if the problem lies in the complier, or if I simply did not compile and bootstrap boost properly. What I did when building boost is the following: ./bootstrap.sh --with-libraries=date_time,filesystem,serialization,iostreams,system,thread,mpi ./bjam cxxflags="-O2" release threading=multi link=static After bootstrap, I tried to manually edit the user-config.jam to add "using mpi ;" and explicitly added the path to the compiler, but this all did not change the above mentioned error when I try to compile my code that uses boost. Is this enough information for you to judge if I might have overlooked something when building boost? Many thanks, Chris

3 3

filesystem directory_iterator run-time error during construction after upgrading to OSX Lion
by Martin Searancke 04 Sep '12

04 Sep '12

I have just upgraded my Mac to Lion and code that worked fine under snow leopard is giving me a run-time exception when constructing a directory_iterator. The error I am getting is "malloc: pointer being freed was not allocated" The line in question that raises this error is: for ( directory_iterator itr( my_path ); itr != end_itr; ++itr ) taken directly from the example and working fine under windows. This is version 1.49 installed with MacPorts. Is this a known problem? I found some vague references to a similar problem in an earlier version of boost but no solution. I have confirmed that I only have 1 copy of the headers and libs on the system and in the correct path. The date stamp on the files matches the last time I did a macports update so this should be the matching library for the header. Please note that I am a real novice to Mac development and have only just started porting code from windows for less than a month. Thanks in advance, Martin

3 2

Re: [Boost-users] compilation problems with thread/chrono & boost 1.51 & HPUX
by Avi Bahra 04 Sep '12

04 Sep '12

>>On 3.9.2012. 10:26, Avi Bahra wrote: >>> Can any one suggest *any* hacks/workarounds that gets me pass these errors. >>> Is it possible to use gcc on HPUX with boost 1.51 ? >> >>The docs for boost thread 1.51 say this: >> >>Boost.Thread uses by default Boost.Chrono for the time related >>functions. For backward compatibility and also for compilers that don't >>work well with Boost.Chrono the user can define >>BOOST_THREAD_DONT_USE_CHRONO. If BOOST_THREAD_DONT_USE_SYSTEM is defined >>then BOOST_THREAD_DONT_USE_CHRONO is defined implicitly. >> >>BOOST_THREAD_USES_CHRONO is defined when Boost.Thread uses Boost.Chrono. I have already tried BOOST_THREAD_DONT_USE_CHRONO and it has no effect. It appears that some of headers files are not guarded with this. In my case $BOOST_ROOT/boost/chrono/system_clocks.hpp $BOOST_ROOT/boost/ratio/detail/overflow_helpers.hpp $BOOST_ROOT/boost/thread/future.hpp do not compile, Also Is it possible to make a request to change: $BOOST_ROOT/boost/thread/future.hpp line:603 for(count_type i=0;i<count;++i) { #if defined __DECCXX || defined __SUNPRO_CC locks[i]=boost::unique_lock<boost::mutex>(futures[i].future_->mutex).move(); #else locks[i]=boost::unique_lock<boost::mutex>(futures[i].future_->mutex); #endif } T0: for(count_type i=0;i<count;++i) { #if defined __DECCXX || defined __SUNPRO_CC || defined __hpux locks[i]=boost::unique_lock<boost::mutex>(futures[i].future_->mutex).move(); #else locks[i]=boost::unique_lock<boost::mutex>(futures[i].future_->mutex); #endif } Best regards, Ta, Avi

2 1

[traits, fusion, mpl] Basic question about is_base_of and template ancestors
by Rindeberg Magnus 04 Sep '12

04 Sep '12

Hello List! I have an issue understanding how to combine CRTP with the "is_base_of" trait when iterating over a fusion vector. I have tried to illustrate my problem in the test program below. The idea is to first "do stuff" to all instances of types derived from A and then "do stuff" to the ones derived from B. I just don't know what to write instead of "WHAT_GOES_HERE?" below. I have tried to use "::boost::mpl::_" in different ways to get the "type" type of B but failed miserably every time. I'm also curious about how to negate the "is_base_of" predicate. I tried using "not_<>" but that didn't work at all... Very thankful for any and all help! // Magnus P.S. Sorry if this question has been answered already! I have looked at the documentation, searched archives and the web but couldn't find the solution. Maybe I searched using the wrong keywords... #include <boost/type_traits.hpp> #include <boost/mpl/vector.hpp> #include <boost/fusion/include/mpl.hpp> #include <boost/fusion/container.hpp> #include <boost/fusion/include/at_key.hpp> #include <boost/fusion/include/for_each.hpp> #include <boost/fusion/include/filter_if.hpp> struct dostuff { template<typename T> void operator()(T const & x) const { // Do stuff here! } }; template<class D> struct A { }; template<class D, typename T> struct B { typedef T type; }; struct derived_from_A : public A<derived_from_A> { }; struct derived_from_B : public B<derived_from_B, int> { }; typedef ::boost::mpl::vector<derived_from_A, derived_from_B>::type typelist_type; ::boost::fusion::result_of::as_set<typelist_type>::type typeset_; int main(int argc, char ** argv) { dostuff ds; // This seems to be working! ::boost::fusion::for_each( ::boost::fusion::filter_if < ::boost::is_base_of<A< ::boost::mpl::_>, ::boost::mpl::_> > (typeset_), ds); #if(0) // Don't know how to do this! Preferably I'd like to check for inheritance from B. // If that isn't possible I'll settle for "not inheriting from A". ::boost::fusion::for_each( ::boost::fusion::filter_if < ::boost::is_base_of<B< ::boost::mpl::_, WHAT_GOES_HERE? >, ::boost::mpl::_> > (typeset_), ds); #endif }

3 3

Boost source code ?
by Sajith Kariyawasam 04 Sep '12

04 Sep '12

Hi all, Could any one of you point me to Boost source repository ? Im planning to build from the source. I got nothing in this link http://www.boost.org/users/download/#repository -- Best Regards Sajith

2 2

a client for echo server example
by Goran 04 Sep '12

04 Sep '12

Hi all, I took a look into asio and "boost_asio/example/echo/async_tcp_echo_server.cpp". This example is clear. But I'm looking for something like an "async tcp echo client". The client should send every second one status message. Maybe client is not the correct word. My desired architecture should be "slave server" <--> "master server" where "master server" sends an "ACK" to "slave server" for every "DATA" packet "master server" receives. Something similar to an echo / ping pong server. Can someone provide hints or even an example for a "slave server" similar to "boost_asio/example/echo/async_tcp_echo_server.cpp"? Thanks in advance! Goran

1 0

problems in compiling application using IBM XL C/C++ V12.1 and boost1.50.0
by Pravar 04 Sep '12

04 Sep '12

Hi All, I am getting compilation errors when I try to build my application code which includes some boost headers using IBM XL C/C++ compiler V12.1. ------------------------------------------------------------------------------------------------ "/opt/boost/include/boost/date_time/time_resolution_traits.hpp", line 71.21: 1540-0063 (S) The text "->" is unexpected. "/opt/boost/include/boost/date_time/time_resolution_traits.hpp", line 135.33: 1540-0040 (S) The text "<" is unexpected. "time_resolution_traits" may be undeclared or ambiguous. "/opt/boost/include/boost/date_time/time_resolution_traits.hpp", line 136.33: 1540-0040 (S) The text "<" is unexpected. "time_resolution_traits" may be undeclared or ambiguous. "/opt/boost/include/boost/date_time/time_resolution_traits.hpp", line 137.33: 1540-0040 (S) The text "<" is unexpected. "time_resolution_traits" may be undeclared or ambiguous. "/opt/boost/include/boost/date_time/posix_time/posix_time_config.hpp", line 40.44: 1540-0040 (S) The text "<" is unexpected. "date_time::time_resolution_traits" may be undeclared or ambiguous. ------------------------------------------------------------------------------------------------- These errors seems come due to the fact that this version of compiler is claimed to have more standard conformance than its predecessors. I confirmed from boost release notes of boost 1.50.0 that V12. of XL C/C++ supports this boost version. But still I encountered above errors. Should I use an older version of XL C/C++ compiler so that such errors can be avoided ? Does anybody encountered similar issues ? I am completely stuck at this point and would greatly appreciate any ideas to understand and resolve this. Thanks, Pravar DISCLAIMER: ----------------------------------------------------------------------------------------------------------------------- The contents of this e-mail and any attachment(s) are confidential and intended for the named recipient(s) only. It shall not attach any liability on the originator or NECHCL or its affiliates. Any views or opinions presented in this email are solely those of the author and may not necessarily reflect the opinions of NECHCL or its affiliates. Any form of reproduction, dissemination, copying, disclosure, modification, distribution and / or publication of this message without the prior written consent of the author of this e-mail is strictly prohibited. If you have received this email in error please delete it and notify the sender immediately. . -----------------------------------------------------------------------------------------------------------------------

2 4

asio::posix::stream_descriptor throws with redirected stdin
by Chris Stankevitz 04 Sep '12

04 Sep '12

Hello, Please consider the program listed below. I compiled with the command "g++ test.cpp -lboost_system-mt" using GCC 4.5 on Gentoo linux with boost 1.48. When I invoke the program like this it works fine: cat test.cpp | ./a.out When I invoke the program like this it throws: ./a.out < test.cpp The exception thrown: terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::system::system_error> >' what(): assign: Operation not permitted Aborted Question: Why does the program throw when I redirect stdin to point to a file? Thank you, Chris //=== begin test.cpp === #include <boost/asio.hpp> int main() { boost::asio::io_service IoService; int Fd = ::dup(STDIN_FILENO); boost::asio::posix::stream_descriptor Stream(IoService, Fd); return 0; }

1 0

Accessing MSM attribute under specific conditions causes non-compile
by Chiem Whua Ma 03 Sep '12

03 Sep '12

This is my first post to the list. I've been working with MSM and have been pulling my hair out over what I now think is a bug, either in the library or the compiler. If you create an action, and inside that action you do a get_attribute on the state machine, and that state machine (MSM) is a sub-statemachine of another (parent) MSM, and that sub-machine state happens to be the initial state of the parent machine (that's a lot of ifs!), the code will not compile. It aborts with the mysterious error: c:\boost_1_51_0\boost\fusion\container\map\detail\deref_data_impl.hpp(28): error C2039: 'second_type' : is not a member of 'boost::mpl::void_' followed by the traditional slew of other stuff. Although this example is easy enough to work around, I've found whether it works or not is erratic. The one thing that seems to work OK is to move the action out of the entry for the sub machine and into the entry of the first state, but I haven't done enough testing to show that this works. I've attached a zip and included the text of a sample. As is it will not compile. You can either uncomment the attribute assignment or change the initial state to make it compile. Any help with this would be appreciated! Thanks! -Chiem Here's sample code. I've also attached a zip: #include <vector> #include <iostream> #include <boost/msm/back/state_machine.hpp> #include <boost/msm/front/euml/euml.hpp> using namespace std; using namespace boost::msm::front::euml; namespace msm = boost::msm; namespace MSM_A // Concrete FSM implementation { BOOST_MSM_EUML_DECLARE_ATTRIBUTE(int, borrowedBuffer_attribute); BOOST_MSM_EUML_ACTION(someAction) { template <class Event,class FSM,class STATE> void operator()(Event const& event,FSM& fsm, STATE&) { fsm.get_attribute(borrowedBuffer_attribute)=1; // <--------------- UNCOMMENTING THIS WILL ALSO ALLOW COMPILATION } }; BOOST_MSM_EUML_EVENT(someevent) BOOST_MSM_EUML_STATE((no_action), someStateA) BOOST_MSM_EUML_STATE((no_action), someStateB) BOOST_MSM_EUML_TRANSITION_TABLE(( someStateA + someevent == someStateB ),transition_table) BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, init_ << someStateA, someAction, // <-------------------- ACTION IS AN ENTRY ACTION no_action, attributes_ << borrowedBuffer_attribute, configure_ << no_configure_ ), MSM_A_frontEnd) //fsm name typedef msm::back::state_machine<MSM_A_frontEnd> MSM_A_player; } namespace MSM_B // Concrete FSM implementation { ::MSM_A::MSM_A_player subMachine; BOOST_MSM_EUML_EVENT(someEvent) BOOST_MSM_EUML_STATE((no_action), someState) BOOST_MSM_EUML_TRANSITION_TABLE(( someState + someEvent == subMachine ), transition_table) BOOST_MSM_EUML_DECLARE_STATE_MACHINE(( transition_table, //STT //init_ << someState, // <---------------- WORKS init_ << subMachine, // <---------------- DOES NOT COMPILE no_action, // Entry no_action, // Exit attributes_ << no_attributes_, // Attributes configure_ << no_configure_ ), MSM_B_frontEnd) //fsm name typedef msm::back::state_machine<MSM_B_frontEnd> MSM_B_player; } int main() { MSM_B::MSM_B_player player; player.start(); return 0; }

2 1

{Review] Coroutine reviewstarts today, September 3rd
by Hartmut Kaiser 03 Sep '12

03 Sep '12

Hi all, The review of Oliver Kowalke's Boost.Coroutine library starts today, September 3rd 2012, and will end on September 12th. I really hope to see your vote and your participation in the discussions on the Boost mailing lists! ----------------------------------------------------- About the library: Boost.Coroutine provides templates for generalized subroutines (coroutines) which allow multiple entry points for suspending and resuming execution at certain locations. It preserves local state/data and allows re-entering subroutines more than once (useful if state must be kept across function calls). Coroutines can be viewed as a language-level construct providing a special kind of control flow. You can download the library and the view documentation here: docs: http://ok73.ok.funpic.de/boost/libs/coroutine/doc/html/ src: http://ok73.ok.funpic.de/boost.coroutine.zip --------------------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Regards Hartmut Review Manager

1 0

compilation problems with thread/chrono & boost 1.51 & HPUX
by Avi Bahra 03 Sep '12

03 Sep '12

I am transitioning from boost 1.47 to boost 1.51. Using compiler : aCC: HP C/aC++ B3910B A.06.20 [May 13 2008] Using: ./bjam --build-dir=./tmpBuildDir toolset=acc stage link=static --layout=tagged --with-thread variant=debug It appears that building thread requires chrono, which now fails to compile. ========================== acc.compile.c++ tmpBuildDir/boost/bin.v2/libs/chrono/build/acc/debug/link-static/threading-multi/chrono.o "./boost/ratio/detail/overflow_helpers.hpp", line 164: error #2063: shift count is too large (BOOST_RATIO_INTMAX_C(1) << (sizeof(boost::intmax_t) * CHAR_BIT - 1)); "./boost/chrono/system_clocks.hpp", line 71: error #2035: #error directive: <time.h> does not supply CLOCK_REALTIME # error <time.h> does not supply CLOCK_REALTIME "./boost/ratio/detail/overflow_helpers.hpp", "./boost/thread/v2/thread.hpp", line 45: error #2135: namespace "boost::chrono" has no member "steady_clock" void sleep_until(const chrono::time_point<chrono::steady_clock, Duration>& t) acc.compile.c++ tmpBuildDir/boost/bin.v2/libs/thread/build/acc/debug/link-static/threading-multi/future.o "./boost/thread/future.hpp", line 608: error #2330-D: "boost::unique_lock<Mutex> &boost::unique_lock<Mutex>::operator=(boost::unique_lock<Mutex> &) [with Mutex=boost::mutex]" (declared at line 287 of "./boost/thread/locks.hpp") is inaccessible locks[i]=boost::unique_lock<boost::mutex>(futures[i].future_->mutex); ============================= Can any one suggest *any* hacks/workarounds that gets me pass these errors. Is it possible to use gcc on HPUX with boost 1.51 ? Best regards, Ta, Avi

2 1

boost UTF suite namespace collision with user class names
by Aras Vaichas 03 Sep '12

03 Sep '12

Hello, I've just started using the Boost Unit Test Framework so my problem may be a bit naive. I would like to name each test suite after each of my classes. e.g. class foo { } BOOST_AUTO_TEST_SUITE(foo) { foo bar; BOOST_REQUIRE_SOMETHING(bar ... etc ...); } This is a problem because the BOOST_AUTO_TEST_SUITE macro expands to: namespace foo { ... etc ... } and the compiler gives an error: 'namespace foo{}' redeclared as a different symbol. I solved the problem by changing the namespace name to something less likely to collide. e.g. #define BOOST_AUTO_TEST_SUITE( suite_name ) \ namespace suite_name ## _boost { \ BOOST_AUTO_TU_REGISTRAR( suite_name ## _boost )( BOOST_STRINGIZE( suite_name ) ); \ /**/ Tested and it works. Comments? regards, Aras Vaichas

2 2

Boost.Test + Boost.Spirit fails for *many* enable/disable_if calls
by Mario Lang 03 Sep '12

03 Sep '12

Hi. On trunk with gcc 4.7, the following minimalistic test case fails: ---<snip>--- #define BOOST_TEST_MODULE "broken_enable_if" #include <boost/test/included/unit_test.hpp> #include <boost/spirit/include/qi_parse.hpp> ---<snip>--- Compiling this gives me the following error: ./boost/spirit/home/qi/detail/parse.hpp:64:69: error: template argument 2 is invalid This apparently only happens if I include unit_test before spirit. And its not the only error, fixing this one by qualifying enable_if with boost:: reveals a chain of similar errors. Can someone please take a look at this? -- CYa, ⡍⠁⠗⠊⠕ | Debian Developer <URL:http://debian.org/> .''`. | Get my public key via finger mlang/key(a)db.debian.org : :' : | 1024D/7FC1A0854909BCCDBE6C102DDFFC022A6B113E44 `. `' `- <URL:http://delysid.org/> <URL:http://www.staff.tugraz.at/mlang/>

2 1

boost 1.51.0 bz2 archive observations
by Aras Vaichas 03 Sep '12

03 Sep '12

Sorry for the cross-posting, but I'm not sure where to put this. There is a slight difference between the 1.51.0 and 1.50.0 boost bz2 files. e.g. \boost_1_50_0.tar.bz2\boost_1_50_0.tar\boost_1_50_0\ \boost_1_51_0.tar.bz2\boost_1_51_0.tar\.\boost_1_51_0\ I went looking for this because I updated the Boost version to 1.51.0 in Buildroot and it failed to find the bootstrap.sh file because it wasn't in the expected directory. e.g. /opt/br/output/build$ find -name "bootstrap.sh" ./boost-1.51.0/boost_1_51_0/tools/build/v2/bootstrap.sh ./boost-1.51.0/boost_1_51_0/bootstrap.sh ./boost-1.50.0/tools/build/v2/bootstrap.sh ./boost-1.50.0/bootstrap.sh Buildroot fails to find the boostrap.sh file and the build fails. When I tried to untar it manually I got an error. $ tar xjf boost_1_51_0.tar.bz2 tar: .: Cannot utime: Operation not permitted tar: .: Cannot change mode to rwxr-xr-t: Operation not permitted tar: Exiting with failure status due to previous errors 1.50.0 does not have this problem. regards, Aras Vaichas

2 1

[fusion] push_back documentation issue
by Agustín K-ballo Bergé 03 Sep '12

03 Sep '12

The documentation for push_back specifies a return type of result_of::push_back<Sequence, T>::type where Sequence is not const-qualified: template< typename Sequence, typename T > typename result_of::push_back<Sequence, T>::type push_back( Sequence const& seq, T const& t); yet the implementation is defined to return result_of::push_back<Sequence const, T>::type, note the const-qualified Sequence: template <typename Sequence, typename T> inline typename lazy_enable_if< traits::is_sequence<Sequence> , result_of::push_back<Sequence const, T> >::type push_back(Sequence const& seq, T const& x) Is this a documentation bug? Agustín K-ballo Bergé.- http://fusionfenix.com

2 1

[Range] Proposal to add a new range adaptor (first_nd), or modify sliced
by Gábor Márton 01 Sep '12

01 Sep '12

Hi, Problem: Get the first N element of a SinglePassRange. It is not possible with sliced, because it requires RandamAccessRange. (Similar discussion was on the list about this in 2011 January: http://lists.boost.org/boost-users/2011/01/65757.php) Possible solutions: A) Modify sliced implementation to use std::advance instead of boost::size. (Boost::size calls operator+ on the end iterator of the adapted range, that is why it requires the random access.) However using std::advance is not efficient in case of iterators which are not random access ones. I think this efficiency problem is the reason why the author(s) decided to not use std::advance, but rather boost::size. So this is not a real solution. B) Introduce a new range adaptor, which has an underlying adapted iterator with a "count" member: template <class Iterator> class first_n_iterator : public boost::iterator_adaptor<first_n_iterator<Iterator>, Iterator> { ... first_n_iterator(const Iterator& it, std::size_t n) : first_n_iterator::iterator_adaptor_(it), initial(it), count(n) {} ... void increment() { ++(this->base_reference()); ++count; } bool equal(first_n_iterator const& other) const { return this->initial == other.initial && this->count == other.count; } Iterator initial; // used to be able to differentiate ranges std::size_t count; }; One can find the whole solution and the test for it attached (first_nd.hpp, first_nd_test.cpp). I think this is more effective than a sliced implementation with std::advance would be. The structure first_nd could be changed to support two parameters, so one could provide the start position too (so it wouldn't be fixed to zero). In the implementation (first_nd_range) std::advance could be used to point the starting iterator to the start position. However in this case we would get the same functionality as slice now has ... I am asking the boost community, 1) Would it be useful, to have such a new range adaptor? If yes, -- what would be the best name for it (first_nd is not the best, I know) ? -- I would be pretty enthusiastic to contribute it to boost. 2) Are the upper arguments valid against the current implementation of sliced? If yes, would it worth to change it to a similar to first_nd one? Or maybe, it would even be better to specialize sliced_range based on the iterator_tag of the range, what do you think? Best Regards, Gabor

7 7

[Function] Move semantics
by Szymon Gatner 31 Aug '12

31 Aug '12

Is there a plan to add move semantics to the Function library via Boost.Move? Many of us will be stuck in 03 compilers for a while and that would be a very nice update. -- Szymon Gatner The Lordz Games Studio www.thelordzgamesstudio.com

1 0

How to get the name of a boost::interprocess::managed_shared_memory::segment_manager
by Markus Bader 31 Aug '12

31 Aug '12

Hi I created a boost::interprocess::managed_shared_memory::segment_manager with an name an size. Afterwords I like to get the name again, but how? managed_shared_memory shm(create_only, "myShm", 65536) std::string name = shm.get_name()? // does not exist std::string name = shm.get_device().get_name();? // is not accessable Any ideas Greetings Markus

1 0