- Boost - lists.boost.org

[1.54.0] Deadline for major changes approaching
by Daniel James 22 May '13

22 May '13

Hello everyone, This is just a quick reminder that the release branch is closed for major changes on Monday. thanks, Daniel

3 6

[heap] van Emde Boas tree proposal
by Jeremy Murphy 22 May '13

22 May '13

Hi everyone, I propose to add the van Emde Boas tree (vEBt) to Boost, primarily as a container adaptor to satisfy the Boost.Heap concept and interface. Rationale The vEBt is an extremely efficient data structure for satisfying the operations of a priority queue. Where u = |U| and U is the universe of numbers that can be stored in the container, the vEBt performs top() in O(1) and push(), pop(), erase() in O(lg lg u). U is, however, limited by type and range: positive integer values from 0 to 2^w (where w is the word size)*. The naive implementation uses an abysmal Θ(u) space but this can be improved to Θ(n) with hashing. Design If people support the idea of the vEBt in principle then I would be really interested in their thoughts on ... should u be a run-time or compile-time constant? Should the vEBt be available as a data structure for purposes other than a priority queue? Implementation I recently finished the basic implementation of the algorithm, so anyone interested in seeing a teething new-born is welcome to take a look.** Gritty questions and constructive criticism about class structure, etc are always welcome. The code won't meet all the programming guidelines yet, but don't worry, I have them in mind. Cheers. Jeremy * There is a good lecture on it from MIT here: https://www.youtube.com/watch?v=AjFtTQevtq0 ** https://code.google.com/p/veb-heap/

1 0

Returned mail: Data format error
by sean.farrow＠seanfarrow.co.uk 22 May '13

22 May '13

The original message was received at Wed, 22 May 2013 15:02:28 +0800 from seanfarrow.co.uk [86.198.252.36] ----- The following addresses had permanent fatal errors ----- <boost(a)lists.boost.org> ----- Transcript of session follows ----- while talking to lists.boost.org.: >>> MAIL From:sean.farrow@seanfarrow.co.uk <<< 501 sean.farrow(a)seanfarrow.co.uk... Refused

1 0

Git Modularization Ready for Review
by Dave Abrahams 22 May '13

22 May '13

Hi All, After substantial work, including massive changes by me and Daniel Pfeifer to KDE's svn->Git conversion tool, we have captured every Boost SVN commit in a Git repository. You can view the results at http://github.com/boostorg http://bitbucket.org/boostorg or you can pull from these repositories and view them in your local browser. The conversion process is automated by http://jenkins.boost.org/job/Boost2Git/ using the tool at http://github.com/ryppl/Boost2Git The rules that describe how commits are distributed are in https://github.com/ryppl/Boost2Git/blob/master/repositories.txt To understand how to edit that file, please read https://github.com/ryppl/Boost2Git/wiki/Editing-repositories.txt Daniel and I are ready to accept your feedback on the results of modularization, and especially your pull requests containing edits to the ruleset. I will the steering committee to establish a formal review period, though. -- Dave Abrahams

16 41

[graph] A few additions to propose to BGL
by Mikael Persson 21 May '13

21 May '13

Hi all, I have developed a number of small additions to the BGL, nothing major, just things that were useful to me and more practical as an extension to BGL instead of as a separate library, and if you're interested, I'm willing to contribute them back. These are non-intrusive additions, no modifications of existing BGL code is required (although some can be discussed, see below). The proposed additions are: 1) Additional property-maps to fill the void between bundled properties and boost::property_map<> mechanisms. Incl. descriptor-to-bundle maps, bundle-to-property maps, composite maps (i.e., chaining property maps), etc. https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 2) A few more property-tags that are common for graph algorithms. https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 3) A few more graph-concepts: a) Tree concept: Facilities for tree inspection. b) MutableTree concept: Facilities for tree construction / destruction. c) MutablePropertyTree concept: Same as MutableTree concept but with properties (like MutablePropertyGraph concept). d) NonCompactGraph concept: For graphs / trees that may contain invalid vertices or edges (i.e., "holes"). https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 4) Boost Graph Library Tree adaptors. This is for using the boost::adjacency_list to store a tree (and comply to tree concepts). https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 5) Pooled Adjacency-list. This is a wrapper around the boost::adjacency_list class which uses a method similar to Boost.Pool to store vertices in a contiguous storage (boost::vecS) while keeping vertex descriptors and iterators valid after removals. https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… Here are the some subjective issues to discuss: w.r.t.-3c) In my MutablePropertyTree concept, I have included removal functions that extract the properties of the elements to be removed. This can usually be implemented easily and provides symmetry w.r.t. to element-adding functions (if you can provide properties when creating elements, you should be able to retrieve them when removing elements). Without this, you can either copy the properties before removing the elements (needless copy and destruct), or you can std::move them out before removing the elements (leaving zombie elements in the graph in the meanwhile). The preferred option is to have the removal function move the properties into a destination (e.g. back-inserter). I would argue that the existing MutablePropertyGraph concept should include overloads for recording properties during removals, this shouldn't break any existing user-side code and be easily added to existing graph data structures. w.r.t.-3d) I have two issues with the NonCompactGraph concept: 1) Invalid elements mostly (or only) show up from iterators. So, one practical option is to have the iterators skip invalid elements. This effectively makes a "non-compact" graph look "compact". This would make this concept useless. However, iterators that must skip over invalid elements cannot provide random-access. There are ways to get the best of both worlds, such as introducing some "always-valid" iterators, which might or might not be identical to the base iterators (zero-overhead) depending on whether the graph is compact or not (a tag or meta-function might be needed to identify this). 2) A common operation with non-compact containers is to "re-pack" it. Generally, the advantage of leaving holes in a container is to avoid invalidating iterators. But, at certain points, one can decide to compact the container again. In the non-compact implementations that I have, I have included such functions, but never really needed them in practice (when removals <= insertions). I wonder if such functions should be included in the NonCompactGraph concept. This is mainly what I propose to contribute back to the BGL (or any part of it). I have, however, lots of other code that is peripheral or closely tied to the BGL. Some is a bit more experimental at this stage, while other things are too peripheral or too specific. You are welcome to browse my library to see if anything else grabs your attention. See below for a short list of a few specific items that might be of interest. Cheers, (and pardon the lengthy email) Mikael. P.S.: Other interesting items that I have developed that might be worth proposing: 6) Linked-tree. A classic linked-tree data structure. It has similar signature as boost::adjacency_list and models the relevant BGL graph concepts and the proposed tree concepts: https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 7) Contiguous layout trees. These are fixed-arity (D-ary) trees that use a breadth-first layout (similar to heaps) in contiguous memory. They model the relevant BGL concepts and the proposed tree concepts. a) D-ary BF-tree uses one contiguous storage with vertices laid out in breadth-first order. It works great, it's my work-horse tree-implementation and the memory-locality it provides has been a major performance factor in my code. https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… b) D-ary COB-tree (Cache-Oblivious B-tree) uses a tree of moderately-sized contiguous blocks with breadth-first layout within them. This thing is nice in theory, but in practice it has been difficult to guarantee correctness and to deliver good performance (it only out-performs the BF-tree when the size of the tree is in the gigabytes range). https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 8) I wrote an AD* algorithm, which I modeled after the BGL's existing A* search implementation. It's rather old code that I haven't done much with for a while, but I'm willing to resurrect it if there is interest for it. The fact that it is a dynamic / anytime / on-line graph algorithm makes it a bit odd compared to the other existing algorithms in BGL (all static / batch / off-line algorithms, AFAIK). https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 9) I wrote a multi-graph template to overlay an adjacency-list (i.e., general "graph") and a tree (i.e., complying to the proposed tree concepts). The point here is to have one set of vertices and two sets of edges, one forming a general graph and one forming a tree. The motivation is to: keep the graph and tree strongly synchronized by sharing the same storage; and, benefit from cache-friendly tree layouts (e.g., BF-tree) when using the general graph. My reservations with this are that the code is (1) not be quite polished yet, (2) a bit too advanced / specific for the general nature of the BGL, and (3) a bit convoluted to use (user-side code is messy). https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 10) If you find anything else you like, we can discuss it. I mostly write path-planning code and lots of numerical stuff. I have a nice sampling-based motion-planning framework in place that builds upon the BGL, and extended (and more mathematically sound) "Topology" concepts, as well as space-partitioning trees and stuff like that: https://github.com/mikael-s-persson/ReaK/tree/master/src/ReaK/ctrl/graph_alg https://github.com/mikael-s-persson/ReaK/tree/master/src/ReaK/ctrl/path_pla… https://github.com/mikael-s-persson/ReaK/tree/master/src/ReaK/ctrl/topologi… -- Sven Mikael Persson

2 2

Re: [boost] [ASIO] Having a hard time after upgrading my boost
by Marat Abrarov 20 May '13

20 May '13

> My code is heavily multi-threaded. This problem doesn't show up in > single threaded environment at all. My OS is SUSE 11 and g++-4.3.3 as the > compiler. I may have to post some code eventually but on the top off your > head - do you have any pointers for me? Note that free functions like asio::async_read/aync_read_untill (async_write/async_write_until, etc) are composed operations so "... The program must ensure that the stream performs no other read operations (such as async_read, async_read_until, the stream's async_read_some function, or any other composed operations that perform reads) until this operation completes" (http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/reference/async_re ad_until.html). Also note that most of Asio classes (sockets, timers, etc.) are not thread safe. So in multi-threaded program you have to use some kind of synchronization if there is no implicit strand (http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/overview/core/stra nds.html). The simplest kind of synchronization is asio::io_service::strand. If you use something else (for example, mutex) then notice intermediate handlers created by composed operations (http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/overview/core/stra nds.html, asio_handler_invoke) and use your synchronization in a right way (for mutex see https://github.com/boostcon/2011_presentations/raw/master/mon/thinking_async hronously.pdf, struct mutex_wrapper at page 95-97). There is a feature named "Handler Tracking" (http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/overview/core/hand ler_tracking.html) that can help you to investigated the order of handler invocation. Regards, Marat Abrarov.

2 1

[ASIO] Having a hard time after upgrading my boost libraries
by Arpan Sen 20 May '13

20 May '13

Folks, I recently moved to boost 1.52, been using a pretty old version of boost earlier. Quite a number of pieces of my code have stopped working since then, but the one that's really a pain is the ASIO piece. I have a lot of code that makes use of ASIO's async read/write and other calls and there seems to be a problem reading data from socket with async_read_until - sometimes I get empty string, there's valid data at other times. My code is heavily multi-threaded. This problem doesn't show up in single threaded environment at all. My OS is SUSE 11 and g++-4.3.3 as the compiler. I may have to post some code eventually but on the top off your head - do you have any pointers for me? Thanks for your time. Arpan

3 2

atomic lockpool and alignment
by Jesper Storm Bache 20 May '13

20 May '13

I am new to this list, so I apologize if this has already been discussed. boost_1_53_0/libs/atomic/src/lockpool.cpp contains: static lockpool::lock_type lock_pool_[41]; On most systems, I would expect that lock_type becomes atomic<bool> v_; I therefore seems to me that we are packing a large number of commonly used locks into sequential memory and therefore increasing the risk of false sharing due to cache line sharing. At the same time, I expect that the 41 lock instances will be used frequently and as such it seems to make sense to align the array to a VM page boundary (to get only a single hot VM page). Has alignment/padding been considered for the lock_pool implementation? If so what are the reasons for its dismissal? Thanks, Jesper Storm Bache

2 1

Can't find documentation for contributing to Boost.
by Jeffrey Yasskin 20 May '13

20 May '13

I'm thinking of sending in a fix for https://svn.boost.org/trac/boost/ticket/7630, and to do that I need to check out Boost at head and run the tests for the Range project. So I went to http://www.boost.org/development/index.html hoping to find instructions. That page has some useless graphs and a calendar, but no mention of source control or command lines. I don't want to contribute testing resources, so I look on the right side for something that looks useful. "Submissions" leads to http://www.boost.org/development/submissions.html, which talks about contributing a whole new library rather than fixing bugs in an existing one. Nothing else in the right-side navigation box looks like it's going to help. A couple times in the past, I've just given up at this point, but this time I decided to let you know about the problem. Could someone write down how to fix a bug in Boost and put it somewhere I can find it on the website? Thanks, Jeffrey

3 3

[string_ref] Don't rely on implicit conversation for operators
by Nicola Bizzoca 20 May '13

20 May '13

Hi, This is a follow up of "[string_ref] Add an equality operator between string_ref and char*" I'm sorry for the previous message, I'm started learning C++ and I'm making some errors Here the new topic: boost::string_ref rely on implicit conversation for using operators For example this operator: template<typename charT, typename traits> bool operator==(basic_string_ref<charT, traits> x, basic_string_ref<charT, traits> y) Is bad because if I write this: boost::string_ref("http") == "http" The compiler complains: error: no match for ‘operator==’ (operand types are ‘boost::basic_string_ref<char, std::char_traits<char> >’ and ‘const char [5]’) It can't find the correct overload because implicit conversion is considered after candidate templates have been considered boost::string_ref should offer overloads for string and const char* so it can be possible write code like boost::string_ref("boost") == "boost" && boost::string_ref("c++") == std::string("c++")

3 2