- Boost-users - lists.boost.org

program_options and BOOST_ALL_NO_LIB=1
by Gianni Ambrosio 10 Mar '11

10 Mar '11

Dear All, I have a simple test using program_options but even if I set BOOST_ALL_NO_LIB=1 the linker gives me errors. Any idea? Regards Gianni

5 11

lambda::var( i )++
by er 10 Mar '11

10 Mar '11

Hello, Is there a variant of this int i = 0; lambda::var( i )++; in which I can do away with the external variable, i? In other words, a nullary functor that returns 0, 1, 2, successively? Thanks.

3 3

[ASIO] async_accept : Error m_val 1.
by Cyprien DIOT 09 Mar '11

09 Mar '11

Hello, I'm currently developping a tcp server with boost asio with vs2010 on win 7. My server class: Header file: class Server { private: boost::asio::io_service &_io; boost::asio::ip::tcp::acceptor *acceptor; bool connected; boost::asio::ip::tcp::socket *_client; }; Source file: Server::Server(boost::asio::io_service& io) : _io(io) { connected = false; } void Server::receiving() { boost::system::error_code error; acceptor = new tcp::acceptor(_io, tcp::endpoint(tcp::v4(), 14242)); _client = new tcp::socket(_io); connected = false; try { acceptor->async_accept(*_client, boost::bind(&Server::handle_accept, this, boost::asio::placeholders::error)); } catch(...) { } } void Server::handle_accept(const boost::system::error_code& error) { // problem appears here } In main function, i'm running io.run(); I'm using in another class boost asio as a tcp client (which work properly) with the same io_service. When a tcp client connect to boost asio tcp server (Class Server), handle_accept is called. error has the following values: m_val = 1; m_cat = 0x00ab8d00 instance; | [boost::asio::error::detail::misc_category] = {...} | boost::noncopyable_::noncopyable = {...} | __vfptr = 0x00a8bf18 const boost::asio::error::detail::misc_category::`vftable' | [0] = 0x0098aaaa boost::asio::error::detail::misc_category::`scalar deleting destructor'(unsigned int) | [1] = 0x0098b4e1 boost::asio::error::detail::misc_category::name(void) | [2] = 0x0098b603 boost::asio::error::detail::misc_category::message(int) | [3] = 0x0098e39e boost::system::error_category::default_error_condition(int) | [4] = 0x0098bef0 boost::system::error_category::equivalent(class boost::system::error_code const &,int) | [5] = 0x0098cb61 boost::system::error_category::equivalent(int,class boost::system::error_condition const &) Do anyone know what does it mean? Can you help me to fix it? Thank you ! Cyprien DIOT France

2 1

[iostreams] restriction device/filter
by Borko Jandras 09 Mar '11

09 Mar '11

Hello, I'm looking at the implementation of the "restriction" device, from Boost.Iostreams library, which provides access to a subsequence of the original device. When it reaches the end of the input subsequence, the restriction device start performing read()'s of size zero on the original device. Shouldn't it be returning an end-of-sequence marker (EOF) instead? I am using a restriction device as source parameter for the iostreams::copy function and this always results in an infinite loop. Am I doing something wrong? Thanks! - Borko

3 3

[Context] Mac OS X support?
by Nat Linden 09 Mar '11

09 Mar '11

I just glanced over the proposed Boost.Context library documentation prior to a more thorough read, and this TODO item jumped out at me: * support of Mac OS X This is one of our major target platforms. However, it's worth noting that Mac OS X 10.5 introduced support for the ucontext family. We are currently using the (proposed) Boost.Coroutine library [1], [2], a GSoC project from a couple years back. On Windows, Boost.Coroutine uses fibers; on Posix platforms, it uses ucontext. Because Mac OS X 10.4 did not yet support ucontext, I hacked in context-switching for that target based on the Pth library [3]. Boost.Coroutine did not introduce a context-library abstraction layer. Presumably one of the fruits of accepting Boost.Context would be the opportunity to port the Boost.Coroutine API to use Boost.Context rather than its own (similar but not as well-encapsulated) underpinnings. (If anyone cares -- I realize that acceptance of Boost.Fiber could make Boost.Coroutine moot. I intend to read up on that too.) Anyway -- it seems likely to me that Boost.Context will support Mac OS X 10.5+ "out of the box." I intend to check that. If it's important for Boost.Context to support Mac OS X <= 10.4, it might be fairly straightforward to implement the Boost.Context API on top of Pth. Reference [2] contains my macro-based attempt to establish equivalences between the ucontext API and the Pth API. However, at this moment in history, one must ask how important it still is to support Mac OS X <= 10.4? [1] http://www.crystalclearsoftware.com/soc/coroutine/ [2] http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-… [3] http://www.gnu.org/software/pth/

1 0

[Join] Simplified concept introduction?
by Nat Linden 09 Mar '11

09 Mar '11

I saw the Join library on the review queue and am somewhat curious. But I find the terminology a bit off-putting: ports, chords, joints. I've read the Introduction, the discussion on Join concurrency and the comparison with Futures/Promises. I know this sounds awfully dumb, but I still don't understand the moving parts or how they relate to each other. The Introduction leaves the impression that I could only understand (would only be interested) if I were already a fan of JoCaml or C(omega), neither of which I'd ever heard of before. The library author might reasonably assert that I should read all the available documentation if I want to understand the library. But that's backwards: I have not yet found any reason why I should want to understand this library. When I encounter a new Boost library, my first question is always: how would I use this? What problems in my work would be addressed by this library? How could it make my life easier? The closest I've so far gotten with Join is a vague sense that I could use it to implement Futures, if I didn't already have such a thing. Were I not already somewhat curious about ways to organize async code, I wouldn't have read even this much of the documentation. What's the point of this rant? - I'd like to request a bit more introductory material. If one of the References includes an excellent discussion of why I should be interested, please promote the link (a specific section link) to the Introduction. Otherwise, please add some new prose with specific examples. - I'm aware that this may be clearer to others than it is to me. If you understand the proposed Join library and feel its documentation is sufficient, now would be a good time to say so. My assumption at the moment is that if the Join library were accepted as-is into Boost, few people would even attempt to understand it because, like me, they would have a tough time figuring out how it might apply to their problem space.

2 1

[Review] Phoenix V3: review results
by Hartmut Kaiser 09 Mar '11

09 Mar '11

All, The review of Phoenix V3 ended on March 2nd. We've got quite some discussion, even if we hoped for more. Overall, 3 people have confirmed that the Phoenix rewrite addresses all issues raised during the original review back in 2008. Nobody raised any concerns or serious issues. So here is the result of the mini-review: Boost.Phoenix is ready to be moved to the Boost SVN trunk! All other discussions were about minor inconsistencies, which Thomas has already fixed by now. There are a couple of suggestions related to the documentation, which he agreed to address as soon as possible: 1) The Phoenix documentation should have a "What's New" section 2) Compile time is often a concern with libraries that make heavy use of expression templates. Adding a compile time test would be ideal. This should be easily invoked and results from various compilers reported within the documentation. The only thing, which needs to be decided (and which has not been discussed yet) is how the migration from Boost.Bind, Boost.Lambda, and Phoenix V2 has to be organized, ensuring minimal disruption for the users of those libraries. I see several possible ways of doing so, but would like to open up the discussion. Any suggestions and comments are welcome. With high likelihood this migration process will be implemented using forwarding headers. Therefore, this point has not to be resolved before moving the main code base to trunk. On the other hand, this migration strategy needs to be in place before merging to the release branch. -------------------- This mini-review wraps up the review process of Boost.Phoenix. Congratulations to Thomas for this version of the excellent library, which will contribute to the unification of the functional landscape in Boost. At the same time I would like to mention a couple of names which are related to the development of Phoenix since its inception, and without those Boost.Phoenix wouldn't have happened. - Joel de Guzman, who wrote the initial V1 and since then was actively involved and driving the development of Boost.Phoenix - Dan Marsden, who is the main developer (with Joel) of Phoenix V2 - Angus Leeming and Daniel Wallin who contributed to V2 - Eric Niebler, the author of Boost.Proto, who contributed to V2 and was actively driving and supporting the development of V3, he also mentored Thomas Heller's GSoC project. Regards Hartmut Review Manager --------------- http://boost-spirit.com

2 1

Review Wizard Report for March 2011
by Ronald Garcia 09 Mar '11

09 Mar '11

============================================== Review Wizard Status Report for March 2011 ============================================== News ==== 1. Move Library Accepted 2. Ratio Library Accepted 3. Chrono Library Accepted 4. GIL.IO Library Accepted 5. Boost 1.46 Released New Libraries: Interval Containers Revised Libraries: Array, Asio, Bind, Concepts, Filesystem, Fusion, Graph, Hash, Iterator, Math, Meta State Machine, Optional, Pool, Program Options, Proto, Signals, Spirit, Tokenizer, Unordered, Wave Revised Tools: Boostbook, Inspect, Quickbook Open Issues =========== The following libraries have been reviewed and await reports from their review managers: * Process - reviewed February 2011; review manager: Marshall Clow. * Phoenix - reviewed March 2011; review manager: Hartmut Kaiser. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * GIL.IO - accepted January 2011; author: Christian Henning. * Move - accepted February 2011; author: Ion Gaztanaga. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Geometry Library - accepted November 2009; author: Barend Gehreis et al. * Ratio - accepted October 2010; author: Vicente Botet. * GIL.IO - accepted January 2011; author: Christian Henning. * Chrono - accepted January 2011; author: Vicente Botet. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Switch - accepted provisionally January 2008; author: Steven Watanabe. * Log - accepted provisionally March 2010; author: Andrey Semashev. General Announcements ===================== As always, we need experienced review managers. The review schedule has grown substantially but we have few volunteers, so manage reviews if possible and if not please make sure to watch the review schedule and participate. 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 mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report before we do that, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Pimpl (M) * Endian * Conversion (M) * Sorting (M) * AutoBuffer (M) * Convert * Containers * Type Traits Extensions * Lockfree (M) * Fiber (M) * Quaternions, Vectors, Matrices (M) * Locale * Context * Stopwatches * Autoindex * Variadic Macro Data (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: | `Boost Vault <http://www.boost-consulting.com/vault/index.php?action=downloadfile&fil…>`__ | http://www.ddj.com/cpp/205918714 (documentation) :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. Endian ------ :Author: Beman Dawes :Review Manager: Joel Falcou :Download: http://svn.boost.org/svn/boost/sandbox/endian/ :Description: Conversion ---------- :Author: Vicente Botet :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=co…>`__ :Description: Generic explicit conversion between unrelated types. Boost.Conversion provides: * a generic ``convert_to`` function which can be specialized by the user to make explicit conversion between unrelated types. * a generic ``assign_to`` function which can be specialized by the user to make explicit assignation between unrelated types. * conversion between ``std::complex`` of explicitly convertible types. * conversion between ``std::pair`` of explicitly convertible types. * conversion between ``boost::optional`` of explicitly convertible types. * conversion between ``boost::rational`` of explicitly convertible types. * conversion between ``boost::interval`` of explicitly convertible types. * conversion between ``boost::chrono::time_point`` and ``boost::ptime``. * conversion between ``boost::chrono::duration`` and ``boost::time_duration``. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=al…>`__ :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. AutoBuffer ---------- :Author: Thorsten Ottosen :Review Manager: Robert Stewart :Download: http://www.cs.aau.dk/~nesotto/boost/auto_buffer.zip :Description: Boost.AutoBuffer provides a container for efficient dynamic, local buffers. Furthermore, the container may be used as an alternative to std::vector, offering greater flexibility and sometimes better performance. Convert -------------- :Author: Vladimir Batov :Review Manager: Edward Diener :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo…>`__ :Description: The Convert library takes the approach of boost::lexical_cast in the area of string-to-type and type-to-string conversions, builds on the past boost::lexical_cast experience and advances that conversion functionality further to additionally provide: * throwing and non-throwing conversion-failure behavior; * support for the default value to be returned when conversion fails; * two types of the conversion-failure check -- basic and better/safe; * formatting support based on the standard I/O Streams and the standard (or user-defined) I/O Stream-based manipulators (like std::hex, std::scientific, etc.); * locale support; * support for boost::range-compliant char and wchar_t-based string containers; * no DefaultConstructibility requirement for the Target type; * consistent framework to uniformly incorporate any type-to-type conversions. It is an essential tool with applications making extensive use of configuration files or having to process/prepare considerable amounts of data in, say, XML, etc. Containers ---------- :Author: Ion Gaztanaga :Review Manager: John Maddock :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo…>`__ :Documentation: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/move/libs/container/doc/html/index.h…>`__ :Description: Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that comply with C++03. Type Traits Extensions -------------------------- :Author: Frederic Bron :Review Manager: Joel Falcou :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=ty…>`__ :Description: The purpose of the addition is to add type traits to detect if types T and U are comparable in the sense of <, <=, >, >=, == or != operators, i.e. if t<u has a sens when t is of type T and u of type U (same for <=, >, >=, ==, !=). The following traits are added: is_equal_to_comparable<T,U> is_greater_comparable<T,U> is_greater_equal_comparable<T,U> is_less_comparable<T,U> is_less_equal_comparable<T,U> is_not_equal_to_comparable<T,U> The names are based on the corresponding names of the standard template library (<functional> header, section 20.3.3 of the standard). The code has the following properties: * returns true if t<u is meaningful and returns a value convertible to bool * returns false if t<u is meaningless. * fails with compile time error if t<u is meaningful and returns void (a possibility to avoid compile time error would be to return true with an operator, trick but this has little sens as returning false would be better) Lockfree ------------------ :Author: Tim Blechmann :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo…>`__ :Documentation: http://tim.klingt.org/boost_lockfree/ :Description: Lockfree provides implementations of lock-free data structures. Lock-free data structures can be accessed by multiple threads without the necessity of blocking synchronization primitives such as guards. Lock-free data structures can be used in real-time systems, where blocking algorithms may lead to high worst-case execution times, to avoid priority inversion, or to increase the scalability for multi-processor machines. Lockfree provides: * boost::lockfree::fifo, a lock-free fifo queue * boost::lockfree::stack, a lock-free stack Fiber ----- :Author: Oliver Kowalke :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo…>`__ :Description: C++ Library for launching fibers (micro-threads) and synchronizing data between the fibers. 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. Locale ------ :Author: Artyom Beilis :Review Manager: Chad Nelson :Download: https://sourceforge.net/projects/cppcms/files/boost_locale/boost_locale_for… :Description: The Locale library provides powerful tools that extend existing built-in C++ localization facilities in a Unicode-aware way. Context ------- :Author: Oliver Kowalke :Review Manager: Vicente Botet :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo…>`__ :Description: Context provides the ability to switch between different user-level context and is intended to be the basis for a higher abstraction like coroutine and fiber. A user-level context represents the current execution state, including all registers and CPU flags, the instruction pointer, the stack pointer. boost::context encapsulates such a user-level context and is able to store/restore its associated user-level context. This allows multiple execution paths running on a single thread using a sort of cooperative scheduling (in contrast a thread is preemptively scheduled) - the running boost::context decides explicitly when its yields to allow another boost::context to run (user-level context switching). A context can only run on a single thread at any point in time but may be migrated between thread. Stopwatches ----------- :Author: Vicente Botet :Review Manager: Anthony Williams :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=st…>`__ :Description: On top of the standard facilities of Boost.Chrono, Stopwatches provides: * Stopwatches: A facility to measure elapsed time with the ability to start, stop, suspend, or resume measurement. * Stopwatch concept * Scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * stopwatch, model of Stopwatch capturing elapsed Clock times. * stopwatch_accumulator, model of Stopwatch capturing accumulated elapsed Clock times. * Stopclocks: a complete time reporting package that can be invoked in a single line of code. * stopwatch_reporter, convenient reporting to an output stream (including wide char streams) of the elapsed time of models of Stopwatch results. * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> AutoIndex (Tool) ---------------- :Author: John Maddock :Review Manager: Daniel James :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=au…>`__ :Documentation: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/tools/auto_index/doc/html/index.html>`__ :Description: AutoIndex is a tool for taking the grunt work out of indexing a Boostbook/Docbook document (perhaps generated by your Quickbook file mylibrary.qbk, and perhaps using also Doxygen autodoc) that describes C/C++ code. Traditionally, in order to index a Docbook document you would have to manually add a large amount of <indexterm> markup: in fact one <indexterm> for each occurrence of each term to be indexed. Instead AutoIndex will automatically scan one or more C/C++ header files and extract all the function, class, macro and typedef names that are defined by those headers, and then insert the <indexterm>s into the Docbook XML document for you. Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: The variadic_macro_data 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. Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

2 1

[xint] Review ending in 2 days
by Vladimir Prus 09 Mar '11

09 Mar '11

Boosters, I just wanted to remind that review of the Boost.XInt library, by Chad Nelson, is about to end at March 11. So, if you plan to submit a review, please do it now. The documentation for the current version is available at: http://www.oakcircle.com/xint_docs/ The source code is available via Subversion at: http://svn.boost.org/svn/boost/sandbox/xint or can be downloaded at: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=xint.z… Here are the important points: 1. All comments are appreciated. Even if you don't have the time for in-depth study of everything, comments on parts of the library are welcome. In particular, if you are already using logging in your applications and have specialized requirements, you might want to directly check how the proposed library handles them. 2. The reviews and all comments should be submitted to the developers list, boost(a)lists.boost.org and the email should have "[xint]" prefix in the subject to make sure it's not missed. The deadline for reviews is 23:59, March 11, PST, or 2:59, March 12, EST, or 7:59 March 12, UK time, 10:59, March 12 MSK 4. The general review checklist is provided below: - 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? Thanks, Volodya -- Vladimir Prus Mentor Graphics +7 (812) 677-68-40

1 0

Thread question.... detecting deadlocks?
by Eric J. Holtman 09 Mar '11

09 Mar '11

I assume I will find the answer to this right after hitting "send", but my googling so far has turned up nothing. Is there a way to turn on deadlock detection in the thread library somehow? I realize it would be slow, and possibly change the behavior of my program so as to give a "false negative", but I'd still like the option. Sigh. (note to self: don't hold locks across a function, unless you know exactly who and what that function will call).

4 8