December 2012 - Boost - lists.boost.org

Another set of macros to deprecate (and then remove)?
by Marshall Clow 18 Dec '12

18 Dec '12

There are a set of macros in Boost.config that describe "features that are not required by the C++ standard" Some of these features have been incorporated into C++11. I propose that we retire these macros, and have people use the shiny C++11 versions. In particular: BOOST_HAS_STATIC_ASSERT should be ! BOOST_NO_CXX11_ASSERT BOOST_HAS_VARIADIC_TMPL should be ! BOOST_NO_CXX11_VARIADIC_TEMPLATES BOOST_HAS_RVALUE_REFS should be ! BOOST_NO_CXX11_RVALUE_REFERENCES BOOST_HAS_CHAR_16_T should be ! BOOST_NO_CXX11_CHAR_16_T BOOST_HAS_CHAR_32_T should be ! BOOST_NO_CXX11_CHAR_32_T I'm using "!" here generically; in code you would replace #ifdef OLD_MACRO with #ifndef NEW_MACRO etc. I don't think this will be very disruptive; very few boost libraries use these macros. Opinions? Other macros that fit into this group? -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

8 12

compilation warning on HEAD
by Gaetano Mendola 18 Dec '12

18 Dec '12

The HEAD in trunk have some compilation warnings using gcc 4.7.2 the following will fix some of those. Another warning about unused result is in here: libs/serialization/src/basic_iarchive.cpp line 576, the value is used in a BOOST_ASSERT, I don't know how you manage those cases. Regards Gaetano Mendola Index: libs/serialization/src/basic_serializer_map.cpp =================================================================== --- libs/serialization/src/basic_serializer_map.cpp (revision 81900) +++ libs/serialization/src/basic_serializer_map.cpp (working copy) @@ -43,8 +43,7 @@ BOOST_ARCHIVE_DECL(bool) basic_serializer_map::insert(const basic_serializer * bs){ // attempt to insert serializer into it's map - const std::pair<map_type::iterator, bool> result = - m_map.insert(bs); + m_map.insert(bs); // the following is commented out - rather than being just // deleted as a reminder not to try this. Index: boost/archive/iterators/transform_width.hpp =================================================================== --- boost/archive/iterators/transform_width.hpp (revision 81900) +++ boost/archive/iterators/transform_width.hpp (working copy) @@ -112,6 +112,7 @@ transform_width(BOOST_PFTO_WRAPPER(T) start) : super_t(Base(BOOST_MAKE_PFTO_WRAPPER(static_cast< T >(start)))), m_buffer_out_full(false), + m_buffer_in(), m_remaining_bits(0), m_end_of_sequence(false) {} @@ -119,8 +120,8 @@ transform_width(const transform_width & rhs) : super_t(rhs.base_reference()), m_buffer_out_full(rhs.m_buffer_out_full), + m_buffer_in(rhs.m_buffer_in), m_remaining_bits(rhs.m_remaining_bits), - m_buffer_in(rhs.m_buffer_in), m_end_of_sequence(false) {} }; -- cpp-today.blogspot.it

4 4

[Git] Documentation for Git and Modular Boost conversion
by Beman Dawes 18 Dec '12

18 Dec '12

We are starting to pull together documentation for the Git and Modular Boost conversion. https://svn.boost.org/trac/boost/wiki/WikiStart#GitandModularBoost Comments and corrections welcome! I'm particularly interested in unanswered questions you have after reading these initial docs. --Beman

20 98

static_vector using aligned_storage
by Adam Wulkiewicz 18 Dec '12

18 Dec '12

Hi, I'm developing R-tree container for Boost.Geometry. To keep it short, there are containers of Values in leaf nodes. Those containers must have push_back() functionality. For static-size nodes I'm using a container based on boost::array. Unfortunately this means that default constructors of stored Values are called when the container is created. I'd like not to expect that Values have their default ctor implemented. I've implemented an alternative container using boost::aligned_storage. This is just a proof of concept. The code is available here: https://svn.boost.org/svn/boost/sandbox-branches/geometry/index/tests/stati… I've searched for this kind of container in Boost since I remember that someone proposed it some time ago but didn't find it anywhere. Is it released somewhere? Maby as a part of some library? If not, would you be so kind and see if my solution should work for any/most popular compiler/platform? I've tested it only on clang. To be specific, won't there be any problems with the memory aligmnent if I use this code for storage: boost::aligned_storage<sizeof(Value) * Capacity> m_storage; this for access: *(reinterpret_cast<Value*>(m_storage.address()) + i); and this for construction new (reinterpret_cast<Value*>(m_storage.address()) + i) Value(value); Regards, Adam

8 26

[range] Adapter to select class member
by Mark Snelling 17 Dec '12

17 Dec '12

Hi, I'm not sure if this has already been done but I have created a new Boost.Range adapter that will return a specified member variable of the class in the range, similar to the existing map_keys and map_values adapters. Would there be interest in this? For example consider the following code: #include <boost/range/adaptor/member.hpp> #include <boost/range/algorithm/copy.hpp> #include <boost/lexical_cast.hpp> #include <iostream> #include <vector> #include <string> struct A { int foo; std::string bar; }; int main(int argc, char* argv[]) { std::vector< A > input; for ( int i = 0; i < 10; ++i ) { A a; a.foo = i; a.bar = boost::lexical_cast< std::string >( i * 10 ); input.push_back( a ); } boost::copy( input | boost::adaptors::selected_member( &A::foo ), std::ostream_iterator< int >( std::cout, "," ) ); std::cout << std::endl; boost::copy( input | boost::adaptors::selected_member( &A::bar ), std::ostream_iterator< std::string >( std::cout, "," ) ); return 0; } Cheers, Mark

2 1

[crypto]not in https://github.com/boost-vault
by Jeff Flinn 16 Dec '12

16 Dec '12

It appears the crypto library that was in: http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam… Didn't get moved to https://github.com/boost-vault. Does anyone have access to the last vault incarnation? Thanks, Jeff

2 2

[release] permission to merge atomic and lockfree
by Tim Blechmann 16 Dec '12

16 Dec '12

hi all, apparently boost.atomic has been abandoned. i must admit, i'm very disappointed that the original author did hardly reacted neither on-list nor off-list. furthermore, it is blocking the release of boost.lockfree, so i'm volunteering to maintain this library. i'd rather see helge bahmann coming back and taking over responsibility for his code, but frankly, i lost all hopes that this is going to happen. iac, i'd like to get permission from the release managers to merge both atomic and lockfree to the release branch. thanks, tim

6 15

[GitHelp] Help desk support for developers moving to Git and modular Boost
by Beman Dawes 15 Dec '12

15 Dec '12

Documentation will aid developers moving to Git and modular Boost. See https://svn.boost.org/trac/boost/wiki/WikiStart#GitandModularBoost Beyond documentation, simply asking questions via a search engine works particularly well for Git. There is a vast amount of Git material available on the web, including some excellent YouTube videos. But documentation, web searches, and YouTube videos are not enough. Learning Git can be daunting - Git has more surface area than Subversion and it isn't obvious at first why some operations need to be done in a certain sequence or in a certain way or why they even need to be done at all. Two or three developers at C++Now mentioned that they became discouraged when they inadvertently got painted into a Git corner and couldn't find a way out. And even experienced git uses occasionally run into something they need human help with. This post proposes a virtual "Help Desk" to provide Boost specific answers to the inevitable questions that will come up during the transition to Git and modular Boost. The idea is that postings with at [GitHelp] subject tag will signal a request for help wrt Git or modular Boost. Anyone who can help should jump right in with a response. Comments? Suggestions? --Beman

3 2

[graph] A* search applied to knight's tour
by Dave Abrahams 15 Dec '12

15 Dec '12

Hi, I was just trying to work up an example for a class I'm teaching, to illustrate implicit graphs. The following shows how far I've gotten: https://gist.github.com/4153918 This is attempting to apply Warnsdorff's heuristic (choose the next move with the least out-degree) using A* search. I'm running into several problems having to do with the requirements of astar_search_no_init. In particular, the requirement that we can assign an index to every vertex is quite painful, since enumerating all the possible vertices in the search space is difficult. Any advice here? I suppose I could keep a real map and simply assign indices in the order vertices are encountered, but that seems pretty ugly to me. Any hints? -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

2 4

Deadline extension: C++ Now 2013, Call for Submissions
by Hartmut Kaiser 15 Dec '12

15 Dec '12

Please see below for the extended deadline. ---------------------------------------------------------------------------- C++ NOW CONFERENCE 2013 - Aspen CO, USA, May 13-17, 2013, www.cppnow.org ---------------------------------------------------------------------------- CALL FOR SUBMISSIONS -------------------- We invite you to submit session proposals to the 2nd annual C++ Now Conference (Aspen CO, USA, May 13-17, 2013). Building upon the resounding success of C++ Now 2012 and five years of BoostCon, C++ Now 2013 will present leading speakers from the whole C++ community. The C++ Now Conference is dedicated to discussion and education about C++, an open and free language and standard. Our Conference will focus on discussion and education about open source software usage and developments in the C++ developer and user community. To reflect the breadth of the C++ and Boost communities, the conference includes sessions aimed at three constituencies: C++ and Boost end-users, hard-core Boost library and tool developers, and researchers pushing the boundaries of computation. The program fosters interaction and engagement within and across those groups, with an emphasis on hands-on, participatory sessions. As a multi-paradigm language, C++ is a melting pot where the most compelling ideas from other programming communities are blended in powerful ways. Historically, some of the most popular sessions at C++ Now have highlighted these concepts, from DSLs to functional programming to transactional memory and more. Bring your C#, Python, Ruby or Haskell influences to bear in an environment that will broaden their exposure. At C++ Now 2013 we would like to focus on parallel and distributed computing with C++. However, by no means this is intended to restrict the topics of proposals we hope to see. Any other topic related to C++ as outlined below is perfectly fine for submission. IMPORTANT DATES --------------- New proposal submissions due: January 5th, 2013. Proposals decisions sent (tentative program available): January 30th, 2013. Fully scheduled program available: February 24th, 2013. BEST PRESENTATION AWARDS ------------------------ We know how much effort it takes to prepare talks for our conference. For this reason we will award the best presentations in the following categories: Best Presentation, Best Short Presentation, Best Tutorial, and Best Workshop. The awards will be given based on the audience's voting. Each award will include the author's name listed on the cover of the C++ Now website for that year and a plaque containing all the C++ Now conference information. SESSION TOPICS -------------- Topics of interest include, but are not restricted to, the following: * Parallelism in the new C++11 standard * Parallel, distributed and GPGPU topics relating to C++ * C++11 and how it changes life for users and library writers * General tutorial sessions on C++11, the C++11 Standards library, and one or more Boost libraries * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Software development tools and their application to C++ and or Boost * Other topics likely to be of great interest to C++ users and developers Interactive and collaborative sessions are encouraged, as this is the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. SESSION FORMATS --------------- Presentations Presentations focus on a practitioner's ideas and experience with anything relevant to C++11, Boost and users. Panels Panels feature three or four people presenting their ideas and experiences relating to C++11 and Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials Tutorials are sessions at which instructors teach conference participants specific skills relevant to C++11 and Boost. Workshops Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors Presentations We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. SUBMITTING A PROPOSAL --------------------- Standard Sessions are 90 minutes. You may submit a proposal for fractions Or multiples of 90-minutes. Fractional proposals will be grouped into 90 Minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10-20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * Your contact information (will not be made public). SUBMISSION DETAILS ------------------ All submissions should be made through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=cppnow2013. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the C++ Now website and will be available to attendees. For general information on the C++ Now 2013 paper submission or the scope of technical papers solicited; please refer to the conference website at www.cppnow.org. For any other questions about the submission process or paper format, please contact the Program Committee at cppnow2013(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to C++ Now. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) Dave Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0