- Boost - lists.preview.boost.org

How to determine if a function with a given signature is declared?
by andrew.beck＠astc-design.com 24 May '11

24 May '11

Hi, Newbie question follows... I've used BOOST_MPL_HAS_XXX_TRAIT_DEF in the past but recently needed to determine if a function was defined with a given signature. Searching boost::mpl, stackoverflow etc, I couldn't find anything to do what I needed. I've attached my solution below. Basically, I'm wondering if there is a boost::mpl solution or some other more elegant solution. thanks, andrew #include <boost/mpl/bool.hpp> #include <boost/mpl/assert.hpp> #define XXX_DEFINED(symbol) \ template <typename T, T* = symbol> \ struct check_ ## symbol \ { \ typedef void type; \ }; \ \ template <typename T, typename enable = void> \ struct symbol ## _defined : \ boost::mpl::false_ \ { }; \ \ template <typename T> \ struct symbol ## _defined<T, typename check_ ## symbol<T>::type > : \ boost::mpl::true_ \ { }; // declare a some_func(int) so we can see if its declared... void some_func(int) {} // defines some_func_defined template XXX_DEFINED(some_func); BOOST_MPL_ASSERT(( some_func_defined<void(int)> )); // some_func(double) hasn't been declared BOOST_MPL_ASSERT_NOT(( some_func_defined<void(double)> ));

5 7

[function] Problem copying when constructed with a functor
by Edward Diener 24 May '11

24 May '11

This simple code: #include <boost/detail/lightweight_test.hpp> #include <boost/function.hpp> struct p_functor_class_int { p_functor_class_int() : data(50) { } int operator()() const { return data; } void operator()(int d) { data = d; } int data; }; int main() { boost::function<int ()> bfun(p_functor_class_int()); boost::function<int ()> bfun2(bfun); return boost::report_errors(); } gives compiler errors. On gcc-4.6 I get: "In file included from C:\Programming\VersionControl\boost/boost/function/detail/maybe_include.hpp:13:0, from C:\Programming\VersionControl\boost/boost/function/detail/function_iterate.hpp:14, from C:\Programming\VersionControl\boost/boost/preprocessor/iteration/detail/iter/forward1.hpp:47, from C:\Programming\VersionControl\boost/boost/function.hpp:64, from test_function_bug.cpp:2: C:\Programming\VersionControl\boost/boost/function/function_template.hpp: In static member function 'static R boost::detail::function::function_invoker0<FunctionPtr, R>::invoke(boost::detail::function::function_buffer&) [with FunctionPtr = boost::function<int()> (*)(p_functor_class_int (*)()), R = int]': C:\Programming\VersionControl\boost/boost/function/function_template.hpp:907:60: instantiated from 'void boost::function0<R>::assign_to(Functor) [with Functor = boost::function<int()> (*)(p_functor_class_int (*)()), R = int]' C:\Programming\VersionControl\boost/boost/function/function_template.hpp:722:7: instantiated from 'boost::function0<R>::function0(Functor, typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, int>::type) [with Functor = boost::function<int()> (*)(p_functor_class_int (*)()), R = int, typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, int>::type = int]' C:\Programming\VersionControl\boost/boost/function/function_template.hpp:1042:16: instantiated from 'boost::function<R()>::function(Functor, typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, int>::type) [with Functor = boost::function<int()> (*)(p_functor_class_int (*)()), R = int, typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, int>::type = int]' test_function_bug.cpp:15:37: instantiated from here C:\Programming\VersionControl\boost/boost/function/function_template.hpp:95:39: error: too few arguments to function C:\Programming\VersionControl\boost/boost/function/function_template.hpp:96:9: warning: control reaches end of non-void function [-Wreturn-type] " I am sure I must be doing something wrong but I can not see it.

3 5

Review Wizard Report for May 2011
by Ronald Garcia 23 May '11

23 May '11

============================================== Review Wizard Status Report for May 2011 ============================================== News ==== 1. Process Library Rejected 2. Phoenix Library Accepted 3. XInt Library Rejected 4. Type Traits Extensions Accepted 5. Locale Library Accepted 6. Convert Library Withdrawn 7. Conversion Library Accepted Provisionally 8. Context Library Accepted Provisionally 9. Boost 1.46.1 Released Revised Libraries: Asio, Filesystem, Fusion, Graph, ICL, Math, Polygon, Proto, Property Tree, Signals2, TR1, Unordered Revised Tools: Quickbook Open Issues =========== The following libraries have been reviewed and await reports from their review managers: * AutoIndex(Tool) - reviewed May 2011; review manager: Daniel James. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * GIL.IO - accepted January 2011; author: Christian Henning. * Type Traits Extensions - accepted March 2011; author: Frederic Bron. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Phoenix - accepted March 2011; author: Joel de Guzmann. * Move - accepted February 2011; author: Ion Gaztanaga. * Geometry Library - accepted November 2009; author: Barend Gehreis et al. * Ratio - accepted October 2010; author: Vicente Botet. * 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. * Context - accepted provisionally May 2011; author: Oliver Kowalke. 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 pacific dot mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report before we do that, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Pimpl (M) * Endian * Conversion * Sorting (M) * AutoBuffer * Containers * Lockfree * Fiber (M) * Quaternions, Vectors, Matrices (M) * Stopwatches * Variadic Macro Data (M) * Type Traits Introspection * Block Pointer (M) * Heaps * Assign v2 * Network (M) * Algorithm * Local (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: Gordon Woodhull :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. 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. Lockfree ------------------ :Author: Tim Blechmann :Review Manager: Hartmut Kaiser :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. 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>> 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. Type Traits Introspection ------------------------- :Author: Edward Diener :Review Manager: Joel Falcou :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/tti/>`__ :Description: The TTI library, which is an abbreviation for the 'Type Traits Introspection' library, allows a programmer to introspect at compile time the inner elements of a C++ type. The introspection process depends on specifying the name of the inner element by different macros for different types of elements, and then using a generated metafunction to determine whether that element exists within the enclosing type. The inner elements which can be introspected are type, class template, member data, member function, static member data, and static member function. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: `Boost Sandbox <https://svn.boost.org/svn/boost/sandbox/block_ptr/>`__ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Heaps ----- :Author: Tim Blechmann :Review Manager: Andrew Sutton :Download: http://tim.klingt.org/git?p=boost_heap.git;a=snapshot;h=HEAD;sf=tgz :Description: The Heap library is an implementation of priority queues, data structures that order their elements priority. They are useful in a number of different applications especially graph search algorithms and queuing systems. Whereas the STL provides a class template std::priority_queue, Boost.Heap implements data structures with different features and performance characteristics. One key feature is the inclusion of "mutable" heaps, which allow the priorities of enqueued objects to modified and their position in the queue updated. The heaps in the library also support merging, stable sorting, and equality and less-than comparison. Assign v2 --------- :Author: Erwann Rogard :Review Manager: John Bytheway :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/assign_v2>`__ :Description: This library is an upgrade of Boost.Assign 1.0 that redefines its functionality, with optional C++0x support and new features. It expresses repetitive statements for assigning or inserting elements via a basic grammar. Network ------- :Author: Dean Michael Berris :Review Manager: Needed :Download: http://cplusplus-soup.com/2011/04/18/cpp-netlib-0-9-0-released/ :Description: This is a library that provides application layer protocol support using modern C++ techniques. It is light-weight, fast, cross-platform and is intended to be as easy to configure as possible. Algorithm --------- :Author: Marshall Clow :Review Manager: Dave Abrahams :Download: `Boost Sandbox Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=Boost.…>`__ :Description: Boost.Algorithm is a collection of general purpose algorithms. While Boost contains many libraries of data structures, there is no single library for general purpose algorithms. Even though the algorithms are generally useful, many tend to be thought of as "too small" for Boost. An implementation of Boyer-Moore searching, for example, might take a developer a week or so to implement, including test cases and documentation. However, scheduling a review to include that code into Boost might take several months, and run into resistance because "it is too small". Nevertheless, a library of tested, reviewed, documented algorithms can make the developer's life much easier, and that is the purpose of this library. Local ----- :Author: Lorenzo Caminiti :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/local/>`__ :Description: This library supports local functions, local blocks, and local exits Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

3 3

[exception] warnings on top of trunk
by Bryce Lelbach 23 May '11

23 May '11

/opt/boost/trunk/stage/gcc-4.4.4-release/include/boost/exception/detail/exception_ptr.hpp: In function ‘void boost::rethrow_exception(const boost::exception_ptr&)’: /opt/boost/trunk/stage/gcc-4.4.4-release/include/boost/exception/detail/exception_ptr.hpp:458: warning: ‘noreturn’ function does return Is it cool for me to remove this attribute? -- Bryce Lelbach aka wash boost-spirit.com px.cct.lsu.edu github.com/lll-project

5 5

[Review] Type Traits Extension by Frederic Bron - Review summary and decision
by Joel Falcou 23 May '11

23 May '11

Hello all, Frederic Bron's type traits extension proposal review ended up last week. In so far, we received SEVEN reviews which are all voting YES for the inclusion of Type Traits extension in Boost. So the result is that the Type Traits Extension is ACCEPTED into Boost. Suggestions include: - some clean-up in the implementation like "Renam[ing] the detail classes inside the specific namespace without using number, i.e. with a clear meaning. The use of tag, tag 2 could be renamed check_pass, check_fail or something like that." - Sensibility on cv-ref qualifiers in traits call is important. This is being addressed by Frederic. - Frederic is OK to keep the detection of void as a valid return type by using some dont_check type as default. - small comprehensive example of some of the traits like a "maybe_print function, which prints a value if the appropriate operator<< ostream overload exists, else prints "<NOT PRINTABLE>". [...] a small example like this would show a practical use of the library, and how to make use of enable_if, or some other overload method." - The main recurring suggestions found was the choice of name for the operator traits with respect to the standard naming, naming in proto and other boost libraries. This topic is still hot and alive. An alternative to the naming scheme consensus was proposed in the form of alias of commonly used operator traits. This issue is I think beyond bikeshed-color argumentation and I think it is a good point if Frederic could step up and provide a definite and rationalized answer to this point. The current status is : * the namespace options is out casue the standard didnt choose this way; * Frederic and a few other seems to favor the proto naming scheme (more or less the negate issue and the pre/post operator) * the question of a common prefix is still open * the std:: like naming seems limited as not all operators are there. Thanks to all reviewers and people participating to the discussions. Thanks to Frederic for his work.

18 67

Small nitpick in boost::iterator
by Joel Falcou 23 May '11

23 May '11

Seems boost.Iterator pass some parameter by value in the make(Reference r) function. However, MSVC 2010 and I suspect below dont like passing value which alignment is greater than 8 ( **cough** SIMD vector **cough** ) The fix is trivial, adding const & to this function. Should I go ahead and commit this to trunk ?

4 4

[pool] pool-based allocators and order of destruction
by John Maddock 23 May '11

23 May '11

I'm looking for second opinions on this bug report: https://svn.boost.org/trac/boost/ticket/5526#comment:1 The issue is this: if you use singleton_pool either directly or indirectly (via [fast_]pool_allocator), there is a potential order-of-destruction issue if you use it from within globally declared objects. I *think* it's OK, if the global object directly uses the singleton pool - or is it? But, things get really nasty if it's used indirectly as in the bug report via a thread_specific_ptr - the latter gets destructed very late - much later than the pool which is used by the object it points to, so the result is a program crash on exit. In general though, anything that uses indirection and "late initialization, late destruction" will cause problems. I see a number of solutions: * Document the limitation and leave it at that. * Make the singleton eternal and leak the pool's memory at program exit. * Use some kind of complex reference counting scheme so the pool is only destroyed when all it's memory has been released *and* main has exited. To be honest, I'm not thrilled by any of the above, but any opinions? Thanks in advance, John.

3 3

Boost.Log status
by Vicente BOTET 23 May '11

23 May '11

Hi, what is going on Boost.Log? The library was accepted provisionally on March 2010 * Log - accepted provisionally March 2010; author: Andrey Semashev. Best, Vicente

7 18

[review][autoindex] AutoIndex review ends tomorrow
by Daniel James 23 May '11

23 May '11

Hello everyone, Just a quick reminder that Saturday 21st May is the final day for the AutoIndex review. I'm going to wait for one final review before announcing the result, but other than that you need to contact me by then. thanks, Daniel James AutoIndex Review Manager

2 3

Re: [boost] [ICL] some improvement proposals
by Joachim Faulhaber 23 May '11

23 May '11

2011/5/23 Denis <denis(a)camfex.cz>: > Hi Joachim. > I think, I explained badly and unclear the issue about contains(). > If you will have look at its implementation, you will find there a few > specialized versions of contains(), but all of them have structure of > handmadely inlined code `!below(interval, elt) && !above(interval, elt)`. So > it looks like those two functions are part of the minimal set, and > contains() made on top of them. I propose to have there the specialized > below() and above() and the general implementation of contains(). I understand. That would be a good refactoring making the code smaller and more concise. Good proposal :) Cheers, Joachim -- Interval Container Library [Boost.Icl] http://www.joachim-faulhaber.de

1 0

Fwd: [Boost-users] condensed overview of boost
by Joachim Faulhaber 23 May '11

23 May '11

---------- Forwarded message ---------- From: Joachim Faulhaber <afojgo(a)googlemail.com> Date: 2011/5/23 Subject: Re: [boost][Boost-users] condensed overview of boost To: boost(a)lists.org, boost-users(a)lists.boost.org Hi Olaf, Hallo Dresden, 2011/5/12 Olaf Krzikalla <olaf.krzikalla(a)tu-dresden.de>: > Hi @boost, > > recently I've given some lectures about some selected boost libraries. Thank you for teaching boost! (boo to the community for not answering for so long ;) > After > that the audience expressed the wish to get an overview over all current > boost libraries. Thus for my next lecture I sat down and digged through the > complete 1.46 for several day. I found a lot of useful stuff, but I also > found a lot of obsolete, superseded, replaced or will-be-superseded stuff. > Some libraries seems to be sub-libs of other libs. Is there an overview of > inner lib relations and the actual lib state wrt. to the overall > development? There is an overview on the boost web-site www.boost.org of course in an synoptic quality with short descriptions of each library. As far as I know there is no single documentation on inter library relationships that is maintained, correct me if I'm wrong. Generated dependency graphs were provided by Chrisoph Heindl in December 2008. http://lists.boost.org/Archives/boost/2008/12/146290.php http://picasaweb.google.com/christoph.heindl/BoostDependencies1370 for boost-1.37 but not updated later. > The issues I've found so far: > > - Compatibility: very narrow. Is it still needed as a public lib? > - Functional, MemFun: superseded by Bind > - Call Traits, Functional/Forward, Lambda: will be superseded by C++0x > - Interval: can this become a sub-lib of ICL? boost::numeric::interval is closed interval on numeric types with a focus on interval arithmetic. It is also suitable handle numeric precision problems AFAIK, but I'm not an expert for that. In contrast ICL has a focus on the set character of intervals and their composition in interval containers. Non numeric intervals are possible as long as there is an ordering on the domain_type. I think it is unfortunate that ICL and numeric::interval do not interplay well. One of the main obstacle are the fixed closed borders of numeric::intervals, that lead to problems when adding or subtracting intervals to and from interval containers. There were discussions on this on the list but the authors of numeric::interval seemed not to be active at the time. Since numeric::intervals serve numeric purposes and icl::interval serve more general pusposes I think they can coexist happiely. As long a numeric::interval is not actively maintained, I don't think there is a chanche for change. > - Meta State Machine / Statechart: whats the actual difference? I.e. Meta State Machine is a library that generates finite state machines completely at compile-time from meta code. MSN is more expensive at compile time but may generate even faster code than a "traditional" FSM. Maybe Christophe can comment on this. > which problem is solved by one lib but not by the other? > - Fusion & Tuple: how are these related? Could boost::tuple become a > typedef to boost::fusion::vector. > > I know that most of these relations are there for historical reasons and > won't be changed. However I wish it had been documented somewhere. That > would make an in-depth introduction of boost a lot easier. There is no ready made structure or institution within boost for this. But definitely there are people who have similar thoughts, concerns and intentions. It depends if someone is going to contribute and/or is taking the lead for an effort like this. As mentioned above Chrisoph Heindl provided generated dependency graphs. Boris Schäling wrote an online book http://www.highscore.de/cpp/boost/index.html that has been translated by others. Paul Bristow cares on documentation quality for the math stuff. Robert Ramey, Dean Berris and others had initiatives about redesigning the boost web-site, just to mention a few things. So your effort on creating an overview and document on inter library relationships could be an own contribution and other could join in. Thanks again, Joachim -- Interval Container Library [Boost.Icl] http://www.joachim-faulhaber.de

1 0

[ICL] interval_map::find(const domain_type_comparable&) instead of interval_map::find(const domain_type&)
by Denis 23 May '11

23 May '11

Hi Joachim One small note about Icl maps. I think would be useful to make interval_map::find()'s function accept any type comparable to map's key. For example, the key type is std::string and the user want to search using a 0-terminated string or a string defined as arbitrary pointer and a length. Then the user will have to allocate the temporary string only to pass it to interval_map::find() You may argue that the std::map works same way. But there is the difference. If I want to do the trick above, I can use boost::multi_index or at least instead of std::map<std::string, ValueT> I can define something like std::map<tuple<const char*, size_t>, tuple<std::string, ValueT>> with key's const char* and size_t pointing to the data hosted in value. This is not possible with interval_map, where the values can be joined

3 3

BoostCon video mirror
by Jeroen Habraken 23 May '11

23 May '11

Hi, After becoming annoyed with blip.tv I've created a mirror of the BoostCon videos with the help of Nikhef (http://www.nikhef.nl/en/) It can be found at http://wipkip.nikhef.nl/events/BoostCon/2010/ and there's a quick overview over at http://vexocide.org/boostcon.html. If desired we'll gladly host the 2011 videos as well. Regards, Jeroen Habraken

1 0

[process] boostcon code now on github
by Jeff Flinn 22 May '11

22 May '11

The source code as presented at the boostcon "Boost Process" session is now available at: https://github.com/JeffFlinn/boost-process Let me know if there are any problems accessing this as I'm a github newbie. Thanks, Jeff

1 0

[btree] Status report
by Beman Dawes 22 May '11

22 May '11

The slides for my BoostCon "Proposed Boost B-tree Library" presentation are available: http://github.com/boostcon/2011_presentations/raw/master/tue/proposed_b_tre… Please be aware that while the library is progressing nicely, it isn't ready for production use: * There are outstanding bugs, particularly with variable length data. * Names and signatures may still change. * Documentation is barely started. * Build is failing on Mac OS X. That probably won't get fixed until after BoostCon. (Reported by Marshall Clow) That said, the response to the presentation was very positive and I'm actively continuing development. Anyone interested in the library is encouraged to take a look and give it a try. See http://github.com/Beman/Boost-Btree/blob/master/README for install instructions. Feedback welcome! Thanks, --Beman

5 12

Invitation to connect on LinkedIn
by Илья Биин via LinkedIn 21 May '11

21 May '11

LinkedIn ------------Илья Биин requested to add you as a connection on LinkedIn: ------------------------------------------ Yuriy, I'd like to add you to my professional network on LinkedIn. - Илья Accept invitation from Илья Биин http://www.linkedin.com/e/bv6hcz-gnyytzl3-3y/uV9CsZkavY-uKU5A7C-1JbkavY-u5P… View invitation from Илья Биин http://www.linkedin.com/e/bv6hcz-gnyytzl3-3y/uV9CsZkavY-uKU5A7C-1JbkavY-u5P… ------------------------------------------ DID YOU KNOW that LinkedIn can find the answers to your most difficult questions? Post those vexing questions on LinkedIn Answers to tap into the knowledge of the world's foremost business experts: http://www.linkedin.com/e/bv6hcz-gnyytzl3-3y/ask/inv-23/ -- (c) 2011, LinkedIn Corporation

1 0

Invitation to connect on LinkedIn
by Serge Blazhievsky 21 May '11

21 May '11

LinkedIn ------------ I'd like to add you to my professional network on LinkedIn. - Serge Serge Blazhievsky Staff Software Engineer at LiveOps San Francisco Bay Area Confirm that you know Serge Blazhievsky https://www.linkedin.com/e/bv6hcz-gny8eb0s-6p/isd/2953122588/yo_3A_ww/ -- (c) 2011, LinkedIn Corporation

2 1

Boost statechart viewer
by Petr Šilhavík 20 May '11

20 May '11

Dear Boost-Statechart developers and users, I would like to ask you to try the tool that I am developing in my bachelor thesis and give me your opinion about it. The tool is able to visualize state machines that use Boost-Statechart library. It uses Clang and LLVM *(version 2.9)* for producing the output files that can be visualized using dot. Now it can work with states (not the orthogonal states), transitions and custom reactions. You can find more information about it on the web page of this project where you can also download the source codes and see some examples of the output pictures. http://rtime.felk.cvut.cz/statechart-viewer/ I am looking forward to your answers. Best regards Petr Silhavik

4 11

[Unicode] Library info
by Mathias Gaunard 20 May '11

20 May '11

Just a remainder for people that followed my Unicode presentation at Boostcon: Library is available on the Boost Sandbox: <https://svn.boost.org/svn/boost/sandbox/SOC/2009/unicode> Documentation is available here: <http://mathias.gaunard.com/unicode/doc/html/>

2 4

How to inspect state of boost::mt19937?
by Matthew Gwynne 20 May '11

20 May '11

Hi, Does anyone know how I can access the internal state of the Mersenne twister (boost::mt19937) easily? That is the 623 state bytes. I am looking to initialise a random number generator and then inspect the state to compare it to another system which apparently implements MT19937 but gives different results. If someone could point me in the right direction, that would be great! Thanks! Matthew Gwynne http://cs.swan.ac.uk/~csmg/

2 2

Generic try, catch in boost::lexical_cast
by Jeroen Habraken 20 May '11

20 May '11

Hi, Whilst updating SVN today I spotted a change to boost::lexical_cast, https://svn.boost.org/trac/boost/changeset/71958, which introduces a try { } catch(...) { } construction. I'm curious as to why this catch-all is needed since it seems to be there to deal with boost::numeric_cast exceptions and whether it could lead to a std::bad_alloc being rethrown as a bad_lexical_cast. Kind regards, Jeroen Habraken

3 5

[local] this_ or _this?
by Lorenzo Caminiti 19 May '11

19 May '11

Hello all, Boost.Local uses a special name `this_` to access the object `this` bound from the enclosing scope. Shall this name be `this_` or `_this` according to Boost practices? struct c { void g(int x) { ... } void f() { void BOOST_LOCAL_FUNCTION_PARAMS( (int x) (bind this) ) { this_->g(x); // <<<<<<<<< Shall this be `_this->g(x);` instead? ... } BOOST_LOCAL_FUNCTIO_NAME(l) ... } ... }; In particular, some library uses _ postfix for statements like mpl::if_ (not mpl::_if) while other uses _ prefix for variables like phoenix::local_names::_f (not local_names::f_). Thanks a lot. -- Lorenzo

12 21

Forum created for IDL to C++0x work
by Johnny Willemsen 19 May '11

19 May '11

Hi, Last year I posted on the boost list about ideas for a new IDL to C++0x language binding for CORBA/CCM/DDS. The OMG has issued a RFP for this (see www.omg.org) In order to share technical ideas, we have opened a forum on http://www.orbzone.org, the community portal for Corba, CCM, and related middleware technologies. If you have any ideas, please share them on ORBzone. Regards, Johnny Willemsen Remedy IT

1 0

anonymous svn checkout
by Mathieu Champlon 19 May '11

19 May '11

Hi, http://svn.boost.org/svn/boost seems to be asking for credentials, is it on purpose ? Thanks, MAT.

1 1

Fwd: [ICL] some improvement proposals
by Denis 19 May '11

19 May '11

Hi 1. (questionable because it changes the visible interface): rename `left_open` and `right_open` to `right_closed` and `left_closed`. Reason: interval_bounds is used in bitwise operations with bit=1 means `closed`. `left_closed() | open()` resulting in `left_closed()` is more readable than `right_open() | open()` resulting in `left_closed()`. Also, there are checkers `is_left_closed()` and `is_right_closed()` but not for *_open I had to use `class bounded_value` in my program (as in Icl details: calculating lower and upper bound of interval separately, then constructing the interval, bitwise or'ing bounds) and I commented every usage of `right_open()` as `left closed` in order to explain why I use `interval_bounds::*right*_open()` in constructing the *left `*bounded_value` of the interval. This resulted in the idea of renaming. Maybe making bit=1 mean `open` would be less painful for other users ? 2. define `contains(interval, elt)` as `!below(interval, elt) && !above(interval, elt)` allowing the user to use `below()` and `above()`. Sometimes it is useful. Anyway, all the versions of `contains()` are made of checking for both bounds. 3. It would nice if the functions taking two intervals will have versions taking an element as second argument. I mean functions like `left_subtract`, `operator &`, etc. (I cannot tell all the list at the moment) Constructing temporary `close_interval` object in order only to pass it into those functions is cheap with ints but would be expensive with heap-allocated domains (blobs, strings, etc).

1 0