November 2008 - Boost - lists.boost.org

[Thread] Win32 exception handling
by David Abrahams 29 Nov '08

29 Nov '08

I talked to an organization a few days ago that wasn't using Boost.Thread because of the catch(...) clause in the thread launching functions. They wanted the usual Win32 termination behavior (where you get a stack backtrace) instead. While that might seem like a silly reason not to use Boost.Thread, it's legitimate. I told them about several ways to work around that issue, but I think all of them are more hassle and provide a less useful result (to them) than simply letting the exception leak. I wonder if the that would be a conforming implementation, whether a call to terminate() is required, and whether a preprocessor switch to allow exceptions to leak would be a good idea? -- Dave Abrahams BoostPro Computing http://www.boostpro.com

14 46

[MultiIndex] Random Access mental model?
by David Abrahams 29 Nov '08

29 Nov '08

Hi, I'm trying to get a grip on what it means when I have a random access index in a multi_index_container. I have no mental model for what data structure you're actually creating, which makes it difficult to evaluate multi-index vs. hand-rolling my own container. If I was doing this myself, I'd use a combination of these two: hash_map<key, value> deque<hash_map<key, value>::pointer> because I need to maintain an LRU cache of what has been put in the map (i.e. I need O(1) push_back and pop_front). MultiIndex only lets me use sequenced<> which it implies essentially has the properties of list<hash_map<key, value>::iterator>... although I can imagine you could save a lot by using the same nodes for the hash_map and the list. Do you do that? Regardless, I could still save roughly one pointer per node with my deque. I'd think about trying to modify MultiIndex to let it do random access with deques, but I can't make head or tail of the implementation code used for random access. Could someone clarify what's going on in there? -- Dave Abrahams BoostPro Computing http://www.boostpro.com

7 27

[math distributions] where to check for validity of distribution variables?
by Thijs van den Berg 29 Nov '08

29 Nov '08

I was playing around with implementing the (simple) Laplace distribution to get some feeling with "math/distributions" code and concepts. A lot of non-member functions for statistical distributions (like pdf, cdf) make a local copy of the distribution internal variables, and validate those local variables. An alternative would be to move the checking to member function of the distribution. instead of // CREATE LOCAL COPY OF DISTRIBUTION VARIABLES RealType sd = dist.standard_deviation(); RealType mean = dist.mean(); ... // VALIDATE THOSE LOCAL VARIABLES RealType result; if(false == detail::check_scale(function, sd, &result, Policy())) { return result; } if(false == detail::check_location(function, mean, &result, Policy())) { return result; } do it like this // VALIDATE DISTRIBUTION RealType result; if(false == dist.check()) { return result; } // CREATE LOCAL COPY OF VALID DISTRIBUTION VARIABLES RealType sd = dist.standard_deviation(); RealType mean = dist.mean(); I see two benefits: * the code is more compact this way and repeated code in most of the non member functions is centralized (into the distribution) * for multivariate distributions, the checking can be expensive (a covariance matrix of a multivariate normal needs to be semi positive definite). We could do the checking only once in the constructor & cache the result. What do you think? We might turn "having valid parameters" into a property of *all* distribution. As an alternative, we might add a non member function bool valid<distributionType... but that wouldn't allow for caching validation in e.g. a constructor In general (but in the scope of the constructs used in math/distributions & its non member functions): what are the arguments for placing code in either member or non-member functions ?

4 37

Bug with gcc and array
by Andreas Klein 29 Nov '08

29 Nov '08

Dear developers. I send this both to the boost and the gcc developers. I have found a strange limitation for the size of an array. The error is the same both for boost 1.36 and for the array in gcc 4.3.2 (and in the gcc 4.4 snapshot I use). I am almost sure that it is a bug of gcc and not of the array implementation. Here is the code. #include<array> using namespace std; int main () { array<unsigned int, (1<<22)> a; // Create a big array a[(1<<22)-13]=0; // This give a segmantation fault } In contrast a C-array works fine. int main () { unsigned int a[1<<22]; a[(1<<22)-13]=0; } Since the naturale implementation of the array class is just a wrapper around the C-style array this is very strange. I tryed to track down the bug. You use the following implementation: template<typename T, unsigned int n> class array { T C[n]; public: typedef unsigned int size_type; T& operator[](size_type p) { return C[p]; } }; If we change the C[n] to an explicite new it works fine. template<typename T, unsigned int n> class array { T* C; public: typedef unsigned int size_type; array() { C = new T[n]; } T& operator[](size_type p) { return C[p]; } }; It seams that this resolves the bug. But I can not explain why. I tested the code with the intel compiler and it works fine for both implementations. So it seams that it is a gcc bug, that the first solution do not work. What happens here? Kind regards Andreas Klein

6 8

Is Boost.Range broken?
by Tomas Puverle 28 Nov '08

28 Nov '08

I decided to split off this part of another thread to try to get a consensus on the changes that occurred in Boost.Range with boost 1.35. The background is discussed elsewhere. What I'd like to do here is to come to an agreement with Thorsten and other developers on the following issues: 1) Is the change in the behaviour of Boost.Range in fact a defect? 2) What should be done about it? Here are the reasons why I think Boost.Range is broken: 1) Empty ranges are useless and they cannot even be reliably tested for emptiness. The empty() function now asserts and the is_singular() function behaves differently between debug and release builds, making it impossible to detect if a range is, in fact, empty. In addition, this is not documented well and can lead to subtle bugs and undefined behaviour, which will only manifest itself in release builds. 2) The behaviour is unintuitive. Range is a generalisation of the interface of the std::containers. With this change, containers and ranges can no longer be used in the same code path. 3) Reintroducing the "singular" member into release builds to make the is_singular() function work correctly will defeat the purpose of the size optimisation, while still not achieving interface compatibility with std::containers. 4) Having the additional if() condition in size() and empty()is unlikely to be a large burden on most programs. I would expect most programs will spend more time iterating data than testing ranges for emptiness. 5) The change could be reverted without affecting users. For those who are relying on the new behaviour, the change to empty() and size() should be immaterial, as they cannot be calling them now on singular ranges anyway. My proposed fix would be the following: Roll back iterator_range to the pre-1.35 release state immediately. For a future release, create a new class, boost::simple_range which has the behaviour of the new version (i.e. no singular member). Publicly derive iterator_range from simple_range and provide additional factory functions such as make_simple_range(). I would appreciate any feedback on this issue. Kind regards, Tom

16 106

Review Wizard Report for November 2008
by Ronald Garcia 28 Nov '08

28 Nov '08

============================================== Review Wizard Status Report for November 2008 ============================================== News ==== May 7 - Scope Exit Library Accepted - Awaiting SVN May 17 - Egg Library Rejected August 14 - Boost 1.36 Released New Libraries: Accumulators, Exception, Units, Unordered Containers August 27 - Finite State Machines Rejected September 10 - Data Flow Signals Rejected September 30 - Phoenix Accepted Conditionally November 3 - Boost 1.37 Released New Library: Proto November 10 - Thread-Safe Signals Accepted - Awaiting SVN November 25 - Globally Unique Identifier Library mini-Review in progress Older Issues ============ The Quantitative Units library, accepted in April 2007 is in SVN (listed as units). The Time Series Library, accepted in August 2007, has not yet been submitted to SVN. The Switch Library, accepted provisionally in January 2008, has not yet been submitted for mini-review and full acceptance. Property Map (Fast-Track) and Graph (Fast-Track) have been removed from the review queue. The author (Andrew Sutton) intends to submit a new version of this work at a later time. A few libraries have been reviewed and accepted into boost, but have not yet appeared in SVN as far as I can tell. Could some light be shed on the status of the following libraries? Apologies if I have simply overlooked any of them: * Flyweight (Joaquin Ma Lopez Munoz) * Floating Point Utilities (Johan Rade) * Factory (Tobias Schwinger) * Forward (Tobias Schwinger) * Scope Exit (Alexander Nasonov) * Time Series (Eric Niebler) * Property Tree (Marcin Kalicinski) -- No documentation in SVN Any information on the whereabouts of these libraries would be greatly appreciated. For libraries that are still waiting to get into SVN, please get them ready and into the repository. The developers did some great work making the libraries, so don't miss the chance to share that work with others. Also notice that the review process page has been updated with a section on rights and responsibilities of library submitters. General Announcements ===================== As always, we need experienced review managers. The review queue has been growing substantially but we have had 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 or library contributors. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "garcia at osl dot iu 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. A recent effort is trying to secure at least five people who promise to submit reviews as a precondition to starting the review period. Consider volunteering for this and even taking the time to create the review as early as possible. 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. If you're a library author and plan on submitting a library for review in the next 3-6 months, send Ron or John a short description of your library and we'll add it to the Libraries Under Construction below. We know that there are many libraries that are near completion, but we have hard time keeping track all of them. Please keep us informed about your progress. Review Queue ============ * Lexer * Boost.Range (Update) * Shifted Pointer * Logging * Futures - Williams * Futures - Gaskill * Join * Pimpl * Constrained Value * Thread Pool * Polynomial -------------------- Lexer ----- :Author: Ben Hanson :Review Manager: Eric Neibler :Download: `Boost Sandbox Vault <http://boost-consulting.com/vault/ index.php? action=downloadfile&filename=boost.lexer.zip&directory=Strings%20-% 20Text%20Processing&>`__ :Description: A programmable lexical analyser generator inspired by 'flex'. Like flex, it is programmed by the use of regular expressions and outputs a state machine as a number of DFAs utilising equivalence classes for compression. Boost.Range (Update) -------------------- :Author: Neil Groves :Review Manager: Needed :Download: `Boost Sandbox Vault <http://www.boost-consulting.com/ vault/index.php?action=downloadfile&filename=range_ex.zip&directory=>`__ :Description: A significant update of the range library, including range adapters. Shifted Pointer --------------- :Author: Phil Bouchard :Review Manager: Needed :Download: `Boost Sandbox Vault <http://www.boost-consulting.com/ vault/index.php?&direction=0&order=&directory=Memory>`__ :Description: Smart pointers are in general optimized for a specific resource (memory usage, CPU cycles, user friendliness, ...) depending on what the user need to make the most of. The purpose of this smart pointer is mainly to allocate the reference counter (or owner) and the object itself at the same time so that dynamic memory management is simplified thus accelerated and cheaper on the memory map. Logging ------- :Author: John Torjo :Review Manager: Gennadiy Rozental :Download: http://torjo.com/log2/ :Description: Used properly, logging is a very powerful tool. Besides aiding debugging/testing, it can also show you how your application is used. The Boost Logging Library allows just for that, supporting a lot of scenarios, ranging from very simple (dumping all to one destination), to very complex (multiple logs, some enabled/some not, levels, etc). It features a very simple and flexible interface, efficient filtering of messages, thread-safety, formatters and destinations, easy manipulation of logs, finding the best logger/filter classes based on your application's needs, you can define your own macros and much more! Futures ------- :Author: Braddock Gaskill :Review Manager: Tom Brinkman :Download: http://braddock.com/~braddock/future/ :Description: Joint review of the Futures libraries scheduled for 1/5/09-1/20/09. The goal of the boost.future library is to provide a definitive future implementation with the best features of the numerous implementations, proposals, and academic papers floating around, in the hopes to avoid multiple incompatible future implementations in libraries of related concepts (coroutines, active objects, asio, etc). This library hopes to explore the combined implementation of the best future concepts. Futures ------- :Author: Anthony Williams :Review Manager: Tom Brinkman :Download: http://www.justsoftwaresolutions.co.uk/files/ n2561_future.hpp (code) http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/ n2561.html (description) :Description: Joint review of the Futures libraries scheduled for 1/5/09-1/20/09. This paper proposes a kind of return buffer that takes a value (or an exception) in one (sub-)thread and provides the value in another (controlling) thread. This buffer provides essentially two interfaces: * an interface to assign a value as class promise and * an interface to wait for, query and retrieve the value (or exception) from the buffer as classes unique_future and shared_future. While a unique_future provides move semantics where the value (or exception) can be retrieved only once, the shared_future provides copy semantics where the value can be retrieved arbitrarily often. A typical procedure for working with promises and futures looks like: * control thread creates a promise, * control thread gets associated future from promise, * control thread starts sub-thread, * sub-thread calls actual function and assigns the return value to the promise, * control thread waits for future to become ready, * control thread retrieves value from future. Also proposed is a packaged_task that wraps one callable object and provides another one that can be started in its own thread and assigns the return value (or exception) to a return buffer that can be accessed through one of the future classes. With a packaged_task a typical procedure looks like: * control thread creates a packaged_task with a callable object, * control thread gets associated future from packaged_task, * control thread starts sub-thread, which invokes the packaged_task, * packaged_task calls the callable function and assigns the return value, * control thread waits for future to become ready, * control thread retrieves value from future. Notice that we are in the unusual position of having two very different libraries with the same goal in the queue at the same time. The Review Wizards would appreciate a discussion of the best way to hold these two reviews to produce the best possible addition to Boost. 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 Sandbox Vault <http://www.boost-consulting.com/ vault/index.php?action=downloadfile&filename=Pimpl.zip&directory=&>`__ 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. Constrained Value ----------------- :Author: Robert Kawulak :Review Manager: Jeff Garland :Download: http://rk.go.pl/f/constrained_value.zip :Description: Review scheduled for 12/1/08-12/10/08 The Boost Constrained Value library contains class templates useful for creating constrained objects. A simple example is an object representing an hour of a day, for which only integers from the range [0, 23] are valid values: :: bounded_int<int, 0, 23>::type hour; hour = 20; // OK hour = 26; // exception! Behavior in case of assignment of an invalid value can be customized. For instance, instead of throwing an exception as in the example above, the value may be adjusted to meet the constraint: :: wrapping_int<int, 0, 255>::type buffer_index; buffer_index = 257; // OK: wraps the value to fit in the range assert( buffer_index == 1 ); The library doesn't focus only on bounded objects as in the examples above -- virtually any constraint can be imposed by using a predicate: :: // constraint (a predicate) struct is_odd { bool operator () (int i) const { return (i % 2) != 0; } }; :: // and the usage is as simple as: constrained<int, is_odd> odd_int = 1; odd_int += 2; // OK ++odd_int; // exception! The library has a policy-based design to allow for flexibility in defining constraints and behavior in case of assignment of invalid values. Policies may be configured at compile-time for maximum efficiency or may be changeable at runtime if such dynamic functionality is needed. Thread Pool ----------- :Author: Oliver Kowalke :Review Manager: Needed :Download: `Boost Sandbox Vault <http://www.boostpro.com/vault/ index.php?action=downloadfile&filename=boost-threadpool. 2.tar.gz&directory=Concurrent%20Programming>`__ :Description: The library provides: - thread creation policies: determines the managemnt of worker threads - fixed set of threads in pool - create workerthreads on demand (depending on context) - let worker threads ime out after certain idle time - channel policies: manages access to queued tasks - bounded channel with high and low watermark for queuing tasks - unbounded channel with unlimited numer of queued tasks - rendezvous syncron hand-over between producer and consumer threads - queueing policy: determines how tasks will be removed from channel - FIFO - LIFO - priority queue (attribute assigned to task) - smart insertions and extractions (for instance remove oldest task with certain attribute by newst one) - tasks can be chained and lazy submit of taks is also supported (thanks to Braddocks future library). - returns a task object from the submit function. The task it self can be interrupted if its is cooperative (means it has some interruption points in its code -> ``this_thread::interruption_point()`` ). Polynomial ---------- :Author: Pawel Kieliszczyk :Review Manager: Needed :Download: `Boost Sandbox Vault <http://www.boostpro.com/vault/ index.php? action=downloadfile&filename=polynomial.zip&directory=>`__ :Description: The library was written to enable fast and faithful polynomial manupulation. It provides: - main arithmetic operators (+, -, * using FFT, /, %), - gcd, - different methods of evaluation (Horner Scheme, Compensated Horner Algorithm, by preconditioning), - derivatives and integrals, - interpolation, - conversions between various polynomial forms (special functions for creating Chebyshev, Hermite, Laguerre and Legendre form). Libraries under development =========================== Please let us know of any libraries you are currently developing that you intend to submit for review.

7 8

Is the bellman_ford_shortest_paths function missing an overload with the root vertex?
by Geoff Hilton 28 Nov '08

28 Nov '08

Quick question, was the fact that there is no bellman_ford_shortest_paths overload in the BGL that allows for the specification of the root vertex intentional? I'm using MSVC9 and tried using the named parameters overload but it won't compile. Ditto for dijkstra_shortest_paths and dag_shortest_paths actually. Here's what I have that won't compile with (twice) the error message: error C2248: 'Weight<long long>::Weight': cannot access private member declared in class 'Weight<long long>' c:\program files\boost\boost_1_37_0\boost\graph\bellman_ford_shortest_paths.hpp 155 class ShortestPathBellmanFordForward: public ShortestPathFunction { public: virtual ~ShortestPathBellmanFordForward(){} virtual AlgoResult operator()( const vertex_descriptor startingVertex, const WeightComparer<long long>& comparer, Graph& graph) const { const size_t numVertices = boost::num_vertices(graph); AlgoResult retval; retval.first = PredecessorMap(numVertices); retval.second = DistanceMap(numVertices); vertex_index_prop_t vindex = get(boost::vertex_index, graph); boost::bellman_ford_shortest_paths(graph, numVertices, weight_map(boost::get(&EdgeProp::weights, graph)). predecessor_map(boost::make_iterator_property_map( retval.first.begin(), vindex)). distance_map(boost::make_iterator_property_map( retval.second.begin(), vindex)). root_vertex(startingVertex). distance_combine(WeightCombiner<long long>()). distance_compare(comparer)); return retval; } }; Thanks, Geoff

1 2

Mingw testing
by Vladimir Prus 28 Nov '08

28 Nov '08

There seem to be no trunk tests running for gcc on windows (mingw). Did I miss something? Assuming I'm not, it would be really great to see mingw tested, as this is becoming a commonly used thing these days. Is anybody willing to do mingw testing? Thanks, Volodya

2 1

Re: [boost] [Review] UUID library (mini-)review starts today, November 23rd
by Vladimir.Batov＠wrsa.com.au 28 Nov '08

28 Nov '08

*** What is your evaluation of the design? Unfortunately I have serious reservations about the interface. Like, 1. "uuids" namespace seems unnecessary and burdensome. The generator classes can be introduced inside boost::uuid. 2. handling "char const*", "wchar_t const*", std::basic_string-based arguments should be templated/generalized. 3. Using a separate "generator" class to create a new UUID seems unorthodox as I feel the standard way of calling a constructor would be more inline with the standard C++ practices. Like boost::uuids::basic_uuid_generator<boost::mt19937> gen2; boost::uuid id(gen2); instead of boost::uuids::basic_uuid_generator<boost::mt19937> gen2; boost::uuids::uuid u2 = gen2(); That way boost::uuid id; // Works as Linux uuid_generate(); boost::uuid id(gen2); // Works as Linux uuid_generate_random(); 4. The default uuid() creating a "null" UUID is too subtle, wide open for misinterpretation and in fact counter-intuitive. For example, my (and many others that I know) interpretation of that constructor is like Linux uuid_generate() was called behind it. The creation of an invalid/null UUID needs to be explicitly stated with something like boost::uuid id = boost::uuid::null(); boost::uuid id = boost::uuid::invalid(); then "is_null()" method would be somewhat expected/justified. 5. I'd expect to be able to use "if (!uuid) then..." rather than "if (uuid.is_null()) then...". 6. to_wstring() does not seem to belong to the class. I understand it is conveniend but I fdo not feel that is core UUID functionality and, therefore, should (and can) be handled by other means. *** What is your evaluation of the implementation? I am OK with the implementation with a few comments. 1. Unfortunately, it does not seem to provide time-based construction. I read explanations why not but the usefulness of such a simple concept very much depends on its completeness. 2. I was surprised to see NULL used and postincrements. 3. A lot of raw numbers around the code. 4. I am very suspicious of using std::streams as from what I know they are not exactly fast. *** What is your evaluation of the documentation? Well, in all honesty I do not feel like the uuid.html file supplied with the package (uuid_v13.zip) can be considered as adequate documentation. Explanations seem scetchy. Links seem broken (like "see operators.hpp" points to a non-existing "operators.htm"). *** What is your evaluation of the potential usefulness of the library? I certainly think such a facility needed. *** Did you try to use the library? With what compiler? Did you have any problems? Tried with MSVC8 with results similar to already reported. Iseems like at least some of the warnings (like "warning C4244: '=' : conversion from 'int' to 'char', possible loss of data") need to be addressed. *** How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? I spent a couple of hours with it. *** Are you knowledgeable about the problem domain? Well, I consider myself a "knowledgeable user". I certainly will not be able to claim to be intimately familiar with the generation algorithms. *** Conclusion: The UUID concept is most certainly very useful and such a facility is an essential gadget in everyone's toolbox. However, there are many implementations around (OpenLDAP, Linux, Windows to name a few). For boost::uuid to be accepted and used instead other alternatives it needs to be as complete as its competitors and to stand out -- to be superior in interface, convenience or something. In a couple of hours I spent with boost::uuid I unfortunately did not manage to get that impression. Therefore, I am reluctantly voting against its acceptance in its present form. Thanks, Vladimir.

2 1

Making a new contribution - weak_hash_map
by Yoni Lavi 28 Nov '08

28 Nov '08

I'd like to contribute a C++ class template that implements something similar to java.util.WeakHashMap; it uses boost::intrusive::iunordered_set and boost::pool::fast_pool_allocator internally. This is the first time I'm looking to get into boost development in general. I'm not aware of any trivial way to implement this using existing components of the boost library, but I could have easily overlooked something so let me know if I am mistaken. I'd also like to know if there's any interest in such a contribution at all - anyone else thinks this class could be useful? Briefly, given a key space and value space, the class provides a way to lookup (and optionally create) values by a unique key, in a thread safe manner. A smart pointer to the entry (<key, value> pair) is returned from the lookup/create function. The tricky part is to make such entries automatically destroy themselves when no longer in use. The set itself cannot store a shared_ptr or the use count would never reach zero; it has to rely on weak_ptr and try to lock() it. There is also a race condition that needs to be taken care of (lock() may fail if refcount just dropped to zero in another thread). Lastly, it also has to handle the case where the weak_hash_map is destroyed but its entries persist, and again this needs to be properly synchronized. The implementation makes use of insert_check and insert_commit to implement a "create-or-get" function as well. I have also written an intrusive smart pointer type and that made it possible to use raw pointers instead of the weak_ptr's in the implementation. It's not that this stuff is rocket science as much as it involves lots of boilerplate code (e.g. making an entry hasher out of a key hasher, key/entry and entry/entry equality from key/key equality, resizing the hash table automatically, synchronization, allocation... the class I've written takes care of a lot of the ugly details. If anyone's interested, please fill me in on the process of making such a contribution? Thanks.

1 0