- Boost - lists.boost.org

[proposal] The boost.org Maintenance Effort
by Dean Michael Berris 28 May '10

28 May '10

Hi Everyone, [First of all, this is a warning -- this is a long post, and I would really appreciate it if you read through the whole thing first before posting a comment on any specific thing I say. What follows is more supposed to be read as a document, so please bear with me. :D] A couple of days ago I posted a question about who is managing the boost.org website and the current process by which the website is being generated/hosted. That discussion led to a few realizations for me that I am including in this proposal to address the relative "pain" required to maintain the current site and move forward. This post is a proposal is designed to address three key areas of the boost.org maintenance effort: * The toolchain requirements for building/generating the boost.org site. * Addressing the non-interactivity of the boost.org website and the related pages. * Per-library community/documentation management. First, a preamble: The boost.org website is meant to be the face of the Boost C++ Libraries. It should be the facade that communicates the quality and the high standard the the Boost development community hold dear as the differentiating factors that make Boost what it is. As the face of the community, the website should encourage: participation, collaboration, community building, and open communication. The website shall host all community-developed and enforced policies, all official communications from the Boost community to the world, and serve as an umbrella that shelters the libraries and communities that do become part of the Boost C++ Library effort. Next, let me outline a few broad things with specific points: Communication * We should make it easy for the whole boost community (boost.org) and individual library maintainers/community to communicate messages to the world at large in an easy, unobtrusive manner. * We should make communication a two-way process by encouraging participation (see Participation below). * We should strive to communicate more, instead of communicating less -- to do this we should make it part of the goal of those in the Boost community (not necessarily developers) to promote the libraries and the website itself. Participation * Let's encourage participation in the form of comments to blog posts, feedback on documentation pages, and discussions on specific topics/threads. * Let's make it easier for non-developers to contribute to the effort in the form of community building, providing support, and advocate the library. * We should use the boost.org website as a means of reaching out to and being one of the ways the open source community and industry at large can get in touch with: individual developers, library maintainers, or the Boost community (including users) at large. Collaboration * Let's add the boost.org website as an additional channel through which collaboration can occur as a complement to the boost-developers and boost-users mailing lists. * Let's foster a more community-driven way of solving problems without having to require everyone to be part of a central list. * Let's allow communities around Boost libraries to grow and get things done on the boost.org website. After all the "marketing" stuff above, I'll outline below the concrete steps I propose people allow me to do. Ultimately though there should be a means of measuring whether the steps I take would lead to an agreeable measure of success, so I point out some measures by which you may hold me accountable to getting done. I invite everyone to please comment on and discuss whether the steps/proposal makes sense and whether there is a better way you think I can achieve this in case you agree to my above statements. Step 1: Move static and not-so-static content over to Wordpress MU [0] The current boost.org website is composed of mostly static content that says things about the submission-review process, the guidelines for libraries, what the goal of the project is, and the like. These pages can be ported to Wordpress MU manually either by copy-pasting the content into the WYSIWYG editor or typing the content in (and editing it in the process). This step will include the establishment of who would be the administrators and the eventual maintainers of the boost.org facade. All the information regarding the Boost Community and the maintaining of the content that's specific to the boost.org website would be written, article submissions curated, and copy-edited by the administrators. I have personally volunteered to be one of these administrators who would basically act as an editor for the site. I would take on the responsibility of achieving the following (measurable) goals: 1. Establishing a "Feedback" button that allows anybody visiting the site to post feedback on whatever they think. I would prefer to use a service called Get Satisfaction [1] to gather and manage the feedback, as well as responding to feedback posted through that service. 2. Incorporating a DisQus [2] discussion system to manage comments on pages. There is already a Wordpress plugin for this and comment moderation would mostly be handled initially by me and other administrators interested in helping out in this effort. 3. Integrating and publishing regularly the Google Analytics and Wordpress MU stats on the whole site. Regularly can mean either monthly or weekly depending on who often the community wants information about the site. [0] http://mu.wordpress.org/ [1] http://getsatisfaction.com/ [2] http://disqus.com/ Step 2: Make it easy to jump from Wordpress MU to Trac for the Wiki, Tickets, and Source Viewer This would mean adding links to the appropriate pages in Trac, and in these pages a way to jump back to the boost.org website. This will require some changes in the Trac site which should be easy to pull off. The measurable outcome for this would be to see the actual integration done in a satisfactory manner. Satisfactory of course means, that it works. ;) Step 3: Set up blogs for individual libraries (who want it, or at least for library maintainers/volunteers who want to manage it) Ideally this should be done for all the libraries. Each sub-site would include (at the minimum): * A blog -- where only the maintainers and those nominated by the maintainers to have blog posting access can communicate what's happening, what's coming, whether they need help, or whether there are any nasty bugs that need attention (as well as just some general updates or cool findings regarding the library). * Static Pages -- typically there would be pages like "About", "History", "Examples", and "FAQs" which generally are mostly static. These can be edited by the maintainers and those nominated by the maintainers who would have access to these pages. * Support Information -- this would be a special static page which would point to Trac, or other places where the development and support system of the library is hosted. I am not excluding the possibility of having libraries developed in github/gitorious/sourceforge. Links to things like the mailing list on which the discussion happens, whether there's a web-based forum, or whether there's a number/company to call for support would generally go here too. * Online documentation -- as an absolute minimum there should be a page on documentation for each library in Boost accessible from the boost.org website. It would be a good thing to integrate the generated library documentation into the wordpress system itself, but at the minimum links to the generated library docs that are statically served (just like now) would be acceptable. My personal vision for boost.org would be to become the hub over which the Boost C++ community and the surrounding ecosystem of companies can join in on the action. I would even go so far as say that we should encourage and allow industry players that offer support for Boost libraries or who use Boost libraries to place advertising on the site to help with shouldering the cost of BoostCon, or other things that the Free Software Conservancy would deem necessary to spend money on. I also would like to see it be the face of the Boost community, and really a means to get users to start using boost, get excited about it, and eventually contribute back to the cause. Users who are already passionate about providing support for a wider audience of Boost users could also contribute to the cause not as library developers but people who publicize and liberally put links to the boost.org site on their blogs, on their email correspondence, and in stackoverflow.com answers. Ultimately I would personally want to see boost.org be able to handle the growth of the Boost C++ Library, and allow for more communities (not just one community) to through the site. I don't want it to replace the mailing list for Internet old timers like me who like this feel of email conversation, but for things like announcements and communicating to the wider audience I think the website should do that job superbly. Thanks for reading this far, comments, suggestions, reactions, and pledges to help would be greatly appreciated. Have a great day everyone and I hope to hear from you soon! -- Dean Michael Berris deanberris.com

9 25

BoostCon 2011 Dates and Hotel Discount (this week only!)
by David Abrahams 28 May '10

28 May '10

Hi All, BoostCon #4 was a resounding success, with 95 registrants—attendance holding steady in the face of a poor economy—and nothing but smiles all ’round. One participant was heard to say “after last year, I thought about not coming because I was sure nothing could possibly be cooler that experience, but this is even better.” I'll have more to say about the event soon, but for now a couple important details about next year: 1. Next year, BoostCon is scheduled a week later: May 15-20, 2011 which avoids a conflict with Mother's Day, a perennial issue for some attendees… and is a bit less likely to bring us snow ;-) 2. Because BoostCon has been an excellent regular customer, the Aspen Meadows is offering a $20/night discount for any Boost participant who books on or before **this Friday**, May 21 2010. After taxes, etc., that's more than a $100 savings. Use the following link to make your reservation: https://resweb.passkey.com/Resweb.do?mode=welcome_ei_new&eventID=2547965&fr… Lastly, the Meadows wants you to know that your companies or universities are welcome back for other meetings, and requests that, if you had a good hotel experience this year, you please post positive feedback on http://tripadvisor.com. See you next year, if not before! Cheers, -- Dave Abrahams Meet me at BoostCon: http://www.boostcon.com BoostPro Computing http://www.boostpro.com

27 72

[concept] "not" and "or" concept constraints (N2081)
by Lorenzo Caminiti 28 May '10

28 May '10

Hello all, How can I use Boost.ConceptCheck to implement "not" and "or" concept constraints as they are defined in N2081? (If this is obvious from the documentation, please just point me to the link.) For example, how can I program the following code from N2081 using Boost.ConceptCheck: // "not" `!` concept constraint for some concept C (not C++ code). template<Regular T> where !C<T> void f(T x) { ... } // "or" `||` concept constraint (not C++ code). template<Regular T> where Integral<T> || Floating<T> T cos(T x) { ... } If I understand it right, I can program the "and" concept constraints in Boost.ConceptCheck just by specifying multiple concepts as in: // "and" `&&` concept constraint. template<typename T> BOOST_CONCEPT_REQUIRES( ((boost::Integral<T>)) ((boost:: Arithmetic<T>)), T) f(T x) { ... } But how do I use BOOST_CONCEPT_REQUIRES(), etc to program "not" and "or" concept constraints? Thank you very much. -- Lorenzo

3 3

Re: [boost] [boost::endian] Request for comments/interest
by Dave Handley 28 May '10

28 May '10

"Scott McMurray" wrote: > On 28 May 2010 13:44, Cliff Green <cliffg(a)codewrangler.net<mailto:cliffg@codewrangler.net>> wrote: > > > > Studies have been performed comparing "receiver makes right" designs (where > > swapping is only performed by the receiver, if needed) with others. The > > costs of swapping on modern processors is pretty minimal compared with the > > design overhead and complexity, so "receiver makes right" many times is not > > justified. > > > > I understood it more as "we use little-endian for our network format, > since most of our machines are little-endian, but still want to allow > things to work on the couple of big-endian machines", not as "receiver > makes right". I need to reiterate that I was not talking about a "receiver makes right" design. I don't like these at all for complexity reasons. But in this day and age when a significant percentage of computers being sold are little-endian, deciding to make an internal protocol little-endian and almost completely eliminating endian swaps can make a lot of sense. If you are processing data off multiple 10Gb Ethernet feeds simultaneously, removing a single copy can make all the difference. Especially when you consider memory bandwidth constraints on a multi-threaded process. If you consider the hoops that C++0x has tried to jump through to make move semantics work, removing unnecessary copies, especially in a low level process, seems to be important to a lot of people. Dave

1 0

Re: [boost] [boost::endian] Request for comments/interest
by Dave Handley 28 May '10

28 May '10

"Cliff Green" wrote: > In most general marshalling / serialization designs where portable binary > values are required, the transform step (from "wire" to "object / memory" > model) requires a copy anyway. The low-level endian facilities should not > require an extra copy, but trying to minimize all copying and constraining > the endian library design might be misguided. In the sort of code I write, an endian swapper that had copies that weren't necessarily required, especially in the "do nothing" case where network and machine have the same endianness would not be fit for purpose. " " wrote: > This is not completly true, as your implementation will at least visit the instance. I disagree. If you look in more detail at the code that Tom has submitted, the "do nothing" case does exactly that - nothing. Specifically line 147-154 has the template specialisations that get invoked when a no-op is required, and they have no code in them. Only in the case where an endian swap is required does the implementation walk through the whole data structure. Dave

1 0

Review of a safer memory management approach for C++?
by Bartlett, Roscoe A 28 May '10

28 May '10

Hello Boost developers, I am interested in finding one or more individuals who are knowledgeable about memory management in C++ (and especially of the reference-counting approach taken by boost::shared_ptr and boost::weak_ptr) to review an idea for a comprehensive approach to safer memory management in C++ that encapsulates all raw C++ pointers in high-level code. The technical report for the approach is: Teuchos C++ Memory Management Classes, Idioms, and Related Topics The Complete Reference A Comprehensive Strategy for Safe and Efficient Memory Management in C++ for High Performance Computing and can be found at: http://www.cs.sandia.gov/~rabartl/TeuchosMemoryManagementSAND.pdf If someone would be willing to at least go through the abbreviated table of contents laid out in the Preface and provide some feedback, I would be greatly appreciative. If there is a better mail list to send this too, please let me know. Thanks, - Ross P.S. Please make sure and respond to me personally (rabartl(a)sandia.gov<mailto:rabartl@sandia.gov>) or a spam filter will likely kill it. ----------------------------------------------------------------------- Dr. Roscoe A. Bartlett Sandia National Laboratories Department of Optimization and Uncertainty Estimation Trilinos Software Engineering Technologies and Integration Lead (505) 844-5097

6 12

[concept] concept-based overloading (N2081)
by Lorenzo Caminiti 28 May '10

28 May '10

Hello all, How do I use Boost.ConceptCheck and/or Bosot.EnableIf to implement concept-based overloading (as discussed in N2081)? For example, from N2081, the following functions are selected based on `Iter` matching one of the two specified concepts: template<InputIterator Iter> // proposed concept syntax (not C++) void advance(Iter& x, Iter::distance_type n) { while (n > 0) { ++x; --n; } } template<BidirectionalIterator Iter> // proposed concept syntax (not C++) void advance(Iter& x, Iter::distance_type n) { if (n > 0) while (n > 0) { ++x; --n; } else while (n < 0) { --x; ++n; } } How do I program this in C++ using Boost libraries? N2081 briefly mentions this can be done in C++ using SFINAE, etc. I think I could use `enable_if` if I had some sort of `is_input_iterator` metafunction... Please just point me to the documentation if this has already been addressed there. Thank you very much. -- Lorenzo

5 8

[iterator] issues with Boost.Iterator and Boost.MultiArray
by Thomas Klimpel 28 May '10

28 May '10

Hi, The issues reporteted in <http://lists.boost.org/Archives/boost/2010/05/165798.php> are still open. Even so I wrote: > But from my point of view, the only responsibility I may > have with respect to these issues is to notify the authors > of the affected libraries, which I have done now. it seems that I wasn't yet successful in my attemps to notify the authors. The only one that has answered so far was Thomas Witt <http://lists.boost.org/Archives/boost/2010/05/165837.php>, claiming that the bug is in Boost.MultiArray. However, my personal belief is that the bug is in <http://svn.boost.org/svn/boost/trunk/boost/iterator/detail/facade_iterator_…>. But there is definitively a "quasi unrelated" bug in Boost.MultiArray on trunk (and Thomas Witt might refer to this bug), as the "resize" regression test fails on nearly all compilers on trunk but passes on release <http://lists.boost.org/Archives/boost/2010/05/165810.php> (the link contains a patch that fixes the failures). I would be most happy, if 1) Ron (or somebody else that is allowed to apply patches to Boost.MultiArray) would simply fix the failure of the "resize" regression test on trunk (either by applying the provided patch or by fixing it in some other way). 2) Dave (or somebody else that has deep knowledge about Boost.Iterator) would confirm that the failures of Boost.MultiArray on MSVC-10 are caused by an issue in Boost.Iterator (and are probably related to Jeremy Siek's patch <https://svn.boost.org/trac/boost/changeset/21683>). I guess the result if somebody will answer at all is that I will be asked to enter a track ticket for Boost.Iterator. So if this mail should stay without useful feedback, I will enter two track tickets for Boost.MultiArray and one track ticket for Boost.Iterator, in anticipation that the feedback would probably have suggested that I should do that. Regards, Thomas

3 2

Review Wizard Report for May 2010
by Ronald Garcia 28 May '10

28 May '10

============================================== Review Wizard Status Report for May 2010 ============================================== News ==== Boost 1.42 Released New Libraries: UUID Revised Libraries: Asio, Circular Buffer, Fusion, Graph, Integer, Iostreams, Program.Options, Property Map, Proto, Regex, Spirit, Unordered, Xpressive Meta State Machine (MSM) Library Accepted Boost 1.43 Released New Libraries: Functional/Factory, Functional/Forward Revised Libraries: Range, Accumulators, Array, Asio, Fusion, Iostreams, Multi-index Containers, Proto, Random, Spirit, Thread, Unordered, Uuid, Wave, Xpressive Open Issues =========== The Constrained Value Library was reviewed in December 2008 but no review result has been reported. We would appreciate it if someone who knows the review manager, Jeff Garland, could contact him. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Time Series (accepted August 2007). * Floating Point Utilities (accepted March 2008). * Futures (accepted April 2009). * Polygon Library (accepted November 2009). * Geometry Library (accepted November 2009). * Meta State Machine (accepted January 2010). 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) * Phoenix (accepted provisionally September 2008) General Announcements ===================== As always, we need experienced review managers. The review queue 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 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. The included review queue isn't a classic queue. It is more an unordered list of the libraries awaiting review. As such, any library in the queue can be reviewed once the developer is ready and a review manager works with the wizards and the developer to schedule a review. It is not FIFO. Review Queue ============ * Lexer * Shifted Pointer * Logging * Join * Pimpl * Task * Endian * Conversion * Sorting * GIL.IO * AutoBuffer * String Convert * Containers * Type Traits Extensions * Interthreads * Bitfield * Lockfree * Fiber * Chrono * Sequence Properties * Static Size Linear Algebra * Locale -------------------- Lexer ----- :Author: Ben Hanson :Review Manager: Eric Neibler :Download: `Boost Vault <http://boost-consulting.com/vault/index.php?action=downloadfile&filename=bo… >`__ :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. Shifted Pointer --------------- :Author: Phil Bouchard :Review Manager: Needed :Download: `Boost Vault <http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directo… >`__ :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! 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&filenam… >`__ | 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. Task ---- :Author: Oliver Kowalke :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: Formerly called Thread Pool The library provides: * thread creation policies: * determines the management 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 number 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 newest 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()`` ). Endian ------ :Author: Beman Dawes :Review Manager: Needed :Download: http://mysite.verizon.net/beman/endian-0.10.zip :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 8X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 7X as fast as std::sort on x86 processors. string_sort is roughly 2X as fast as std::sort. GIL.IO ------ :Author: Christian Henning :Review Manager: Needed :Download: `GIL Google Code Vault <http://gil-contributions.googlecode.com/files/rc2.zip >`__ :Description: I/O extension for boost::gil which allows reading and writing of/in various image formats ( tiff, jpeg, png, etc ). This review will also include the Toolbox extension which adds some common functionality to gil, such as new color spaces, algorithms, etc. AutoBuffer ---------- :Author: Thorsten Ottosen :Review Manager: Needed :Download: `Here <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. String Convert -------------- :Author: Vladimir Batov :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: The 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: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.… :Documentation: 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: Needed :Download: http://svn.boost.org/trac/boost/browser/sandbox/type_traits :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) InterThreads ------------------- :Author: Vicente J. Botet Escriba :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=in… >`__ :Description: Boost.InterThreads extends Boost.Threads adding some features: * thread decorator: thread_decorator allows to define setup/cleanup functions which will be called only once by thread: setup before the thread function and cleanup at thread exit. * thread specific shared pointer: this is an extension of the thread_specific_ptr providing access to this thread specific context from other threads. As it is shared the stored pointer is a shared_ptr instead of a raw one. * thread keep alive mechanism: this mechanism allows to detect threads that do not prove that they are alive by calling to the keep_alive_point regularly. When a thread is declared dead a user provided function is called, which by default will abort the program. * thread tuple: defines a thread groupe where the number of threads is know statically and the threads are created at construction time. * set_once: a synchonizer that allows to set a variable only once, notifying to the variable value to whatever is waiting for that. * thread_tuple_once: an extension of the boost::thread_tuple which allows to join the thread finishing the first, using for that the set_once synchronizer. * thread_group_once: an extension of the boost::thread_group which allows to join the thread finishing the first, using for that the set_once synchronizer. (thread_decorator and thread_specific_shared_ptr) are based on the original implementation of threadalert written by Roland Schwarz. Boost.InterThreads extends Boost.Threads adding thread setup/cleanup decorator, thread specific shared pointer, thread keep alive mechanism and thread tuples. Bitfield --------------- :Author: Vicente J. Botet Escriba :Review Manager: Needed :Download: http://svn.boost.org/svn/boost/sandbox/bitfield with documentation available at http://svn.boost.org/svn/boost/sandbox/bitfield/libs/bitfield/doc/index.html :Description: Portable bitfields traits. Boost.Bitfield consists of: * a generic bitfield traits class providing generic getter and setter methods. * a BOOST_BITFIELD_DCL macro making easier the definition of the bitfield traits and the bitfield getter and setter functions. Lockfree ------------------ :Author: Tim Blechmann :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… ; :Documentation: http://tim.klingt.org/boost_lockfree/ :Description: boost.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. boost.lockfree provides: * boost::lockfree::fifo, a lock-free fifo queue * boost::lockfree::stack, a lock-free stack the code is available from from my personal git repository: * git://tim.klingt.org/boost_lockfree.git * http://tim.klingt.org/git?p=boost_lockfree.git Fiber ----- :Author: Oliver Kowalke :Review Manager: Needed Download: 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. Chrono ------ :Author: Vicente Botet :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=ch… ; :Documentation: http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht… . :Description: The Boost Chrono library provides: The C++0x Standard Library's common_type. The C++0x Standard Library's compile-time rational arithmetic. The C++0x Standard Library's time utilities, including: Class template duration Class template time_point Clocks: system_clock monotonic_clock high_resolution_clock typeof registration for classes duration and time_point Process clocks: process_real_CPU_clocks, capturing real-CPU times. process_user_CPU_clocks, capturing user-CPU times. process_system_CPU_clocks, capturing system-CPU times. process_cpu_clock, tuple-like class capturing at once real, user- CPU, and system-CPU times. Stopwatches: stopwatch, capturing elapsed Clock times. stopwatch_accumulator, capturing cummulated elapsed Clock times. scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. Stopclocks or Stopwatch reporters: stopwatch_reporter, convenient reporting of models of Stopwatch results. stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> Support wide characters for stopwatch formatters Sequence Properties ------------------- :Author: Grant Erickson :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=cr… :Description: The creasing algorithm templates define four template functions for determining the order properties of sequences, specifically: * Increasing * Decreasing * Strictly Increasing * Strictly Decreasing The implementation is a fairly trivial composition of the STL adjacent_find, not2 and {greater,less,greater_equal,less_equal}. For the purposes of sequence ordering validation, using these templates is more efficient and straightforward than creating a temporary, sorted version of some sequence and comparing it against the original sequence. Example: :: bool CheckPoints(const Points & inPoints) { const bool strictlyIncreasing = is_strictly_increasing(inPoints.begin(), inPoints.end()); if (!strictlyIncreasing) { cerr << "Points must be in increasing order with " "no duplicate values." << endl; } return strictlyIncreasing; } Static Size Linear Algebra -------------------------- :Author: Emil Dotchevski :Review Manager: Needed :Download: :Description: Locale ------ :Author: Artyom Beilis :Review Manager: Needed :Download: https://sourceforge.net/projects/cppcms/files/boost_locale/boost_locale_for… :Description: Boost.Locale is powerful localization library that provides powerful localization tool extending existing built-in C++ localization facilities in Unicode aware way. Libraries under development =========================== Persistent ---------- :Author: Tim Blechmann :Description: A library, based on Boost.Serialization, that provides access to persistent objects with an interface as close as possible to accessing regular objects in memory. * object ownership concepts equivalent to the ones used by Boost.SmartPtr: shared, weak, scoped (and raw) * ACID transactions, including recovery after a crash and "Serializable" isolation level * concurrent transactions, nested transactions, distributed transactions * concurrent access containers: STL containers whose nodes are implemented as persistent objects and can be accessed without moving the container to memory. Concurrent transactions modifying the container are only repeated in the rare cases the same container node is changed simultanisouly by 2 threads. * extensible by other transactional resources, e.g. an object relational mapper based on the upcoming Boost.Rdb library. Multiple resources can be combined to one database, with distributed transactions among them. Please let us know of any libraries you are currently developing that you intend to submit for review. See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

9 13

[GIL] 2D kernel convolution
by fabien.castan＠free.fr 27 May '10

27 May '10

I looked at the documentation and examples of GIL, but if I have well understood, the extension "numeric convolve" does not allow to do a convolution with a 2D kernel ? Is there another extension ? Or has someone a good code sample (with convolve_boundary_option, etc.) ? Best regards, Fabien

3 2