- Boost - lists.preview.boost.org

[process] working directory issue
by Bertolino, Keith D. 18 May '12

18 May '12

I'm attempting to use boost::process to launch a command line tool called "catdoc.exe." Catdoc takes one argument (the path to a word document). Catdoc will then extract the text from the doc file and output it via standard error to the command line which I've redirected into a string below. So far everything works with the below code except instead of getting the text out of "a.doc" I get an error saying "catdoc cannot find codepage 1251" these codepages are saved in a directory called "charsets" which is saved in the same place catdoc.exe. The problem, I believe, is that the working directory is not set as Catdoc works fine (and finds the codepages) when I execute it manually from the command line, outside of my C++ code. My two questions are as follows: 1. Is there a way to set the working directory (and if so, will this fix my problem)? 2. Is there a way to set a time-out on the underlying process (ie. kill the process if it becomes unresponsive)? Thanks in advance for your help! My Code: using namespace boost; process::child start_child() { string exec = "catdoc.exe"; std::vector<std::string> args; args.push_back("C:\\a.doc"); process::context ctx; ctx.stderr_behavior = process::capture_stream(); return process::launch(exec, args, ctx); } string ExtractText() { string rawtext = ""; process::child c = start_child(); process::pistream &is = c.get_stderr(); std::string line; while (std::getline(is, line)) rawtext += line; return rawtext; } v/r -Keith

2 1

Re: [boost] [Boost-commit] svn:boost r78497 - website/public_html/beta/users/history
by Steven Watanabe 18 May '12

18 May '12

AMDG On 05/17/2012 08:20 AM, garcia(a)osl.iu.edu wrote: > Author: garcia > Date: 2012-05-17 11:20:21 EDT (Thu, 17 May 2012) > New Revision: 78497 > URL: http://svn.boost.org/trac/boost/changeset/78497 > > Log: > Message for fixes to MultiArray. > > Text files modified: > website/public_html/beta/users/history/version_1_50_0.html | 11 +++++++++++ > 1 files changed, 11 insertions(+), 0 deletions(-) > You need to edit the quickbook source in feed/history, or these changes will be lost when the html is rebuilt. > Modified: website/public_html/beta/users/history/version_1_50_0.html > ============================================================================== > --- website/public_html/beta/users/history/version_1_50_0.html (original) > +++ website/public_html/beta/users/history/version_1_50_0.html 2012-05-17 11:20:21 EDT (Thu, 17 May 2012) > @@ -73,6 +73,17 @@ > </ul> > </div> > </li> > + <li> > + <div> > + <span class="library"><a href="/libs/multi_array/index.html">MultiArray</a>:</span> <ul> > + <li> > + <div> > + Concepts bug fix and Workaround for Visual Studio 2010 (<a href="https://svn.boost.org/trac/boost/changeset/78496">Patch</a>) > + </div> > + </li> > + </ul> > + </div> > + </li> > </ul> > </div> > <div id="version_1_50_0.compilers_tested"> > In Christ, Steven Watanabe

1 0

repository
by Frédéric Bron 18 May '12

18 May '12

I would like to work on a fix for the operator traits applied to STL containers but I have changed my computer and do not remember what is the official repository. Is there an official git repository that can be used? or have we to use the svn repository? What is the address to clone (git) or checkout (svn)? Regards, Frédéric

3 3

[Trac] No notification email when adding an attachment to a ticket
by Michel Morin 17 May '12

17 May '12

It is inconvenient that no notification email is sent when adding an attachment to a ticket. Alas, it's a limitation of trac for a long time. http://trac.edgewall.org/ticket/2259 Is there any plugin to automatically send notification email when attaching a file to a ticket? If not, probably we should change the message (which is displayed when we attach a file to a ticket) to explicitly say "No notification email will be sent by attaching a file. To automatically send a notification email, please leave some comment in the ticket!" Regards, Michel

1 0

[any] Move semantic
by Klaim - Joël Lamotte 17 May '12

17 May '12

Hi, My current understanding of the new rules of 5 tells me that boost::any isn't "move aware". First, am I correct? Second, I think that adding the move constructor and move operator is trivial. Again, am I correct or is there some tricks to know before adding them? Third, I want to use boost::any in a value-semantic type. Sometime it would keep a unique_ptr. If I understand correctly move semantic and unique_ptr implementation, the current boost::any implementation don't forbid me to use unique_ptr as a value type. Am I correct? Joel Lamotte

2 1

[result_of, phoenix] Inconsistency between result_of and tr1_result_of
by Michel Morin 17 May '12

17 May '12

To support nullary-callable polymorphic function objects in C++03 `result_of`, we have to specialize `result_of` for the zero-argument case. (If we don't provide specializations, the type determined by C++03 `result_of` for zero-argument function calls is defaulted to void. See the rationale in N1454.) Library authors have implemented the specialization for `result_of` to support the zero-argument case. But, in most cases, they have not specialized `tr1_result_of`. I checked a few Boost libraries: * Boost.Phoenix and Boost.Functional/Forward Only `result_of` is specialized; `tr1_result_of` is not specialized. (* Boost.Lambda Neither `result_of` nor `tr1_result_of` is specialized. So `result_of` and `tr1_result_of` for nullary function calls always evaluate to `void`.) This results in inconsistency between `result_of` and `tr1_result_of`. For example, boost::result_of< decltype(boost::phoenix::val(3))() >::type evaluates to `int const&`. But boost::tr1_result_of< decltype(boost::phoenix::val(3))() >::type evaluates to `void`. Shouldn't we provide specializations for both `result_of` and `tr1_result_of` to make result_of and tr1_result_of equivalent? (Additional question: Should we avoid the specialization of result_of when we use decltype-based result_of?) Regards, Michel

2 2

Re: [boost] [Intrusive] Cleaning up trailing white space
by Brian Wood 17 May '12

17 May '12

From: Ion Gazta?aga <igaztanaga(a)gmail.com> > It's easy to implement, I've just erased several trailing spaces in my > local copy, but it's hard to believe it can actually improve much > compilation times or file sizes. This is probably the easiest way to improve Boost. I hope authors will add this to their list of finishing touches. I know it won't make a big difference, but still think it's worthwhile. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net

2 1

Boost.PropertyTree custom allocator?
by Klaim - Joël Lamotte 17 May '12

17 May '12

Hi, Is there any plan to add custom allocators to boost.property_tree ? Joel Lamotte

2 1

[fusion] Trouble using BOOST_FUSION_ADAPT_ADT with boost::fusion::operator<
by GOODHART, TAYLOR 17 May '12

17 May '12

Hi all, I'm attempting to adapt a third-party struct into a fusion sequence using BOOST_FUSION_ADAPT_ADT to get access to a nice operator<. Unfortunately compilation fails and I'm not sure if it's a bug or me using the library incorrectly. As best I can read the error message, it looks like the code is attempting to compare adt_attribute_proxy structs instead of the values represented by these. Below is some code that demonstrates the problem. Can anybody help me out? Thanks, Taylor #include <boost/fusion/adapted/adt/adapt_adt.hpp> #include <boost/fusion/adapted/struct/define_struct.hpp> #include <boost/fusion/adapted/struct/adapt_struct.hpp> #include <set> #include <string> #include <boost/fusion/sequence/comparison/less.hpp> struct test1 { std::string s; const std::string & getS() const { return s; } void setS( const std::string & s_) { s = s_; } }; BOOST_FUSION_ADAPT_ADT( test1, (const std::string &, const std::string &, obj.getS(), obj.setS(val)) ) BOOST_FUSION_DEFINE_STRUCT( , test2, (std::string, s) (int, a) ) struct test3 { std::string s; }; BOOST_FUSION_ADAPT_STRUCT( test3, (std::string, s) ) using boost::fusion::operator<; int main( int argc, char * argv[]) { //Fails /*std::set<test1> destinations1; destinations1.insert(test1());*/ std::set<test2> destinations2; destinations2.insert(test2()); std::set<test3> destinations3; destinations3.insert(test3()); return 0; }

3 7

[type_erasure] RFC: New version
by Steven Watanabe 15 May '12

15 May '12

AMDG I've just committed an updated version of my type_erasure library to the sandbox at http://svn.boost.org/svn/boost/sandbox/type_erasure. Highlights of this version: * Simplified primitive concept definitions. Now, all it takes is: template<class T = _self> struct incrementable { static void apply(T& t) { ++t; } }; * Support for associated types and same_type. This allows defining iterator concepts in a uniform way: typedef mpl::vector< forward_iterator<>, same_type<forward_iterator<>::value_type, _a>, copy_constructible<_a>, typeid_<_a> > concept; std::vector<int> vec(10); for(any<concept> first(vec.begin()), last(vec.end()); first != last; ++first) { std::cout << any_cast<int&>(*first) << std::endl; } Now, _a automatically binds to int. The core library is now feature complete. Once I finish updating the iterator concepts, I think this should be ready for a formal review. Any thoughts, comments, or criticism is greatly appreciated. In Christ, Steven Watanabe

4 7

[Intrusive] Cleaning up trailing white space
by Brian Wood 14 May '12

14 May '12

>From what I can tell a lot of Boost libraries would benefit from this, but in particular I want this for the Intrusive library. It helps to improve compile times and reduce the space needed by Boost. I used grep " $" * to help with that here. Shalom, Brian Wood Ebenezer Enterprises http://webEbenezer.net

3 2

ice_and/or vs. mpl::and_/or_
by Nathan Ridge 14 May '12

14 May '12

Hi, Is there any difference between boost::type_traits::ice_and (ice_or) and boost::mpl::and_ (or_)? Should one be preferred over the other in the implementation of other Boost libraries? Thanks, Nate

3 3

[config] 4 new C++11 macros added
by John Maddock 14 May '12

14 May '12

A long time back I was asked for a bunch of new config macros which have finally now been added: BOOST_NO_CXX11_ALLOCATOR The standard library does not provide a C++11 version of `std::allocator` in <memory>. BOOST_NO_CXX11_ATOMIC_SP The standard library <memory> does not support atomic smart pointer operations. BOOST_NO_CXX11_HDR_FUNCTIONAL The standard library does not provide a C++11 compatible version of <functional>. BOOST_NO_CXX11_SMART_PTR The standard library header <memory> has no shared_ptr and unique_ptr. Enjoy, John.

6 11

[ICL] #6853: boost::icl::contains(NaN) returns true
by Andrew Hundt 13 May '12

13 May '12

I had submitted a bug report for icl, and the response I included below seemed indicate this is more for the list than a bug report. It deals with an issue where boost::icl::contains(NaN) returns true, where any NaN value cannot actually be contained within an interval, and so should return false. I'm dealing with data that comes from a physical device, so each measurement the system returns is not guaranteed to be valid. We set those invalid measurements to NaN. However, when the data is valid it falls into certain intervals that I found icl well suited for, despite not falling into the original use case of time scheduling I find it to be a reasonable representation to work with. While IEEE floating point numbers is not required by the C++ standard, it is a standard that does seem to have fairly wide use in C++. It seems, at least in my use case, that NaN is a very reasonable value to use and fits well with the functionality icl provides. However, I wanted to open this to wider opinions to learn about the state of the issue. Cheers! Andrew Hundt ---------- Forwarded message ---------- From: Boost C++ Libraries <noreply(a)lists.boost.org> Date: Fri, May 4, 2012 at 6:50 AM Subject: Re: [Boost C++ Libraries] #6853: [ICL] boost::icl::contains(NaN) returns true To: Cc: boost-bugs(a)lists.boost.org #6853: [ICL] boost::icl::contains(NaN) returns true -----------------------------------------------+---------------------------- Reporter: Andrew Hundt <ATHundt@…> | Owner: jofaber Type: Bugs | Status: closed Milestone: To Be Determined | Component: ICL Version: Boost 1.49.0 | Severity: Problem Resolution: invalid | Keywords: icl -----------------------------------------------+---------------------------- Changes (by jofaber): * status: new => closed * resolution: => invalid Comment: Hi Andrew, icl code is not intended to be NaN complete. NaN is a weird animal that breaks concepts the icl is based on. Completing icl for NaN would make the code unnecessarily clumsy for cases that are hardly ever used. If you desire to complete your code for NaN cases you will have to do it in your code or write your own NaN layer around the icl. Regards, Joachim -- Ticket URL: <https://svn.boost.org/trac/boost/ticket/6853#comment:1> Boost C++ Libraries <http://www.boost.org/> Boost provides free peer-reviewed portable C++ source libraries.

7 15

[complex] Feedback and Potential Review Manager
by Christopher Kormanyos 13 May '12

13 May '12

Hi Matthieu, I would like to provide a detailed feedback on the proposed Boost.Complex. I am terribly sorry about the late response on this, as I was not doing well in winter when this topic was more active. First of all, great work with this, Matthieu. I believe the community desperately requires this facility. Boost.Complex appears to have two main goals: A) Provide acceleration for pure imaginary numbers. B) Allow complex to be used with user-defined types. For goal B), I have briefly tested parts of the Boost.Complex code with the cpp_dec_float multiprecision data type proposed for Boost.Multiprecision by John Maddock. My Tests include: * Test some elementary transcendental functions. * Test the overall package via computation of orthogonal polynomials.* My test file (complex.cpp) is included in this e-mail. * Visual Studio 2010, SP1. * Proposed Boost.Multiprecision and boost trunk. Remarks: 1) Various functions use macros like M_PI_2. These macros do not provide enough precision for a multiprecision type. And they will be inefficient for some fixed-point types. Perhaps you need to "bite the bullet" and use boost::math::constants. (Is M_PI_2 even part of C++, or is it only lurking around in <math.h> of GCC?) 2) Ditto for the LN_10 and LN_2 constants. Does boost::math::constants support ln_ten()? I do know that it has ln_two(). 3) I disagree with explicit complex(const T& re = T(0.), const T& im = T(0.)) I believe this constructor should be non-explicit. See ISO/IEC 14882:2011, Section 26.4.2. 4) I would really like to see global operators for seamless interaction of complex<T> with integer PODs. The proposed code of boost::complex forces explicit construction from integer "all the way" to boost::complex<T> just to, for example, multiply with 2. This is extremely costly as most multiprecision or fixed-point types have specially optimized routines for multiplication with integer PODs. Perhaps something like this would be good template<typename T> complex<T> operator*(const complex<T>& z, int n) { T re(z.real()); T im(z.imag()); re *= n; im *= n; return complex<T>(re, im); } 5) In the exp() function, polar() can not be resolved without explicit template parameter. Instead of this: template<typename T> inline complex<T> exp(const complex<T>& x) { return polar(exp(x.real()), x.imag()); } I needed this: template<typename T> inline complex<T> exp(const complex<T>& x) { return polar<T>(exp(x.real()), x.imag()); } I don't know who's right here, your code or the compiler. 6) The tanh() function and some other functions compute the exponent twice. By that I mean both exp(x) as well as exp(-x). I believe that division would be faster if exp(-x) were computed with (1 / exp(x)). Or is there an issue with branch cuts that mandates the potentially redundant calculation? 7) I hope to find time to test this code further with a tiny fixed-point class. But I might be too busy for that extra work. REVIEW PROGRESS: I may potentially be qualified for review manager. I do know the math and the code. I am also well-versed with all aspects of software review, assessment and audit situations. BUTTT!!! I'm not as good at C++ as some of you folks and I'm a real beginner at boost. Nonetheless, If nobody better steps forward, I could potentially manage the review of Boost.Complex. Best regards, Chris.

8 33

Latest changes to scoped enum emulation break existing code
by Hartmut Kaiser 13 May '12

13 May '12

Hey all, The latest commit to the scoped enumerator emulation breaks existing code using the previous version of this functionality. Please see the Spirit regression tests for examples. Revision: 78407 Author: anthonyw Date: Thursday, May 10, 2012 12:06:15 PM Message: Combine scoped enum emulation from thread library into detail/scoped_enum_emulation.hpp ---- Modified : /trunk/boost/detail/scoped_enum_emulation.hpp Modified : /trunk/boost/thread/cv_status.hpp Deleted : /trunk/boost/thread/detail/scoped_enum.hpp Modified : /trunk/boost/thread/future.hpp Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

4 9

[context] - Mac OS X fix
by Daniel Larimer 13 May '12

13 May '12

It seems that while I was off using an old (but stable) version of Boost.Context Oliver has gone and rewritten it (again) and it has been approved (awesome)! I decided I should migrate my code to the latest API but it appears that no one tested it on OS X. I had to update the fcontext_x86_64_sysv_macho_gas.S: 1) @PLT is an ELF concept that generates the error: junk `@PLT' after expression 2) I had to add an '_' before align_stack otherwise things didn't link. + call _align_stack /* align stack */ - call align_stack@PLT /* align stack */ - call _exit@PLT /* exit application */ + call _exit /* exit application */ With that fix, you can add OS X x64 to your tested platforms. What version of boost will include Context? Dan

2 1

[newbie] running tests
by Nathan Ridge 13 May '12

13 May '12

Hi, I have a (probably silly) question about running Boost tests. Where can I find a summary of the results after running the tests? For example, I ran the Boost.Fusion tests by going to libs/fusion/test and running ../../../bjam. Here's the last few lines of the output: common.mkdir ../../../bin.v2/libs/fusion/test/invoke_procedure.test common.mkdir ../../../bin.v2/libs/fusion/test/invoke_procedure.test/gcc-4.8.0 common.mkdir ../../../bin.v2/libs/fusion/test/invoke_procedure.test/gcc-4.8.0/debug common.mkdir ../../../bin.v2/libs/fusion/test/invoke_procedure.test/gcc-4.8.0/debug/functional gcc.compile.c++ ../../../bin.v2/libs/fusion/test/invoke_procedure.test/gcc-4.8.0/debug/functional/invoke_procedure.o gcc.link ../../../bin.v2/libs/fusion/test/invoke_procedure.test/gcc-4.8.0/debug/invoke_procedure testing.capture-output ../../../bin.v2/libs/fusion/test/invoke_procedure.test/gcc-4.8.0/debug/invoke_procedure.run **passed** ../../../bin.v2/libs/fusion/test/invoke_procedure.test/gcc-4.8.0/debug/invoke_procedure.test common.mkdir ../../../bin.v2/libs/fusion/test/swap.test common.mkdir ../../../bin.v2/libs/fusion/test/swap.test/gcc-4.8.0 common.mkdir ../../../bin.v2/libs/fusion/test/swap.test/gcc-4.8.0/debug common.mkdir ../../../bin.v2/libs/fusion/test/swap.test/gcc-4.8.0/debug/sequence gcc.compile.c++ ../../../bin.v2/libs/fusion/test/swap.test/gcc-4.8.0/debug/sequence/swap.o gcc.link ../../../bin.v2/libs/fusion/test/swap.test/gcc-4.8.0/debug/swap testing.capture-output ../../../bin.v2/libs/fusion/test/swap.test/gcc-4.8.0/debug/swap.run **passed** ../../../bin.v2/libs/fusion/test/swap.test/gcc-4.8.0/debug/swap.test ...updated 1098 targets... I can tell from this that the last two tests passed, but what about the other 1096 that scrolled off the screen? Should there not be a summary somewhere? Thanks, Nate

2 1

[quickbook] incorrect image path for note, warning, etc
by lcaminiti 12 May '12

12 May '12

Hello all, When generating Quickbook docs on a single HTML page `bjam onehtml` the images for notes, warning, etc do not appear because they have the incorrect path: onehtml path (incorrect) images/note.png normal path (correct) ../../../../../doc/src/images/warning.png How do I fix this? Thanks a lot. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-quickbook-incorrect-image-path-for… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 3

[general] Preventing compiler ABI clashes
by Vicente J. Botet Escriba 12 May '12

12 May '12

Hi, After some exchanges with Anthony, I have recently reread http://www.boost.org/development/separate_compilation.html#abi and I suspect that I'm not the single one that misunderstood the context of this protocol. As noted in "Counter Argument #2: Prefix/suffix headers have a tendency to "spread" to other boost libraries - for example if boost::shared_ptr<> forms part of your class's ABI, then including prefix/suffix headers in your code will be of no use unless shared_ptr.hpp also uses them. Authors of header-only boost libraries may not be so keen on this solution - with some justification - since they don't face the same problem. " even header-only libraries should use this protocol if other not-header only libraries must conform to it. Shouldn't every Boost library use this protocol? Or at least, allows the user to enable it? What about adding an attribute (ABI Clash Protected) to the library documentation stating if a library supports this protocol? Is there a way to check if a library supports this protocol completely? Best, Vicente

1 0

[hash] Turn on BOOST_HASH_NO_IMPLICIT_CASTS by default
by Daniel James 12 May '12

12 May '12

Hello everyone, There have been occasional issues where Boost.Hash will incorrectly hash an object that doesn't have a hash function but is convertible to bool. I added an extra templated overload of hash_value which contains a static assert. The idea is that it's a better match than the implicit cast, so it will cause a compile error in this case. This is currently only activated when a macro is defined, as it could break otherwise valid code. I was a bit worried about making any interface changes because at this stage, Boost.Hash should be very stable from release to release. The problem turned up again yesterday, so I'm starting to think it's enough of a problem that it's worth activating this be default. A different solution might be to change the implement of Boost.Hash for bools, so that the bool overload isn't required. But that would be treating the sympton, as other implicit casts could cause problems. An example of valid code that will now break is something like: struct base; std::size_t hash_value(base const&); struct derived : base { void some_method_but_no_extra_state(); }; boost::hash<derived> derived_hash; Currently that will automatically use base's hash_value, with this change it will be a compile error. Although that might be a good thing, as sometime it is an error to use the base's hash function. Of course, there will be a macro to keep the old behaviour. Any objections to this change?

3 5

Re: [boost] [Review Request] Multiprecision Arithmetic Library
by Christopher Kormanyos 11 May '12

11 May '12

Sorry, John my file was too big and admin rejected post. The candidate file is now 7-zip and should make it through. <snip> >> I experimented with FFTs. We need your inputs if we *really* >> want to make very high-precision available at this stage. <snip> >> maybe about 30 lines of code. > Nice, had no idea it could be implemented in such a small space! Ooops, my bad. It was 100 lines. I guess I was in a daze by then. <snip> > So my gut feeling is to hold off for now, and maybe do things > properly later (dynamic allocation, better std lib support etc)? I agree. We should pull the reigns on it for now. We won't get the reliability we need if we try to do something fast. I could go on indefinitely with big-numbs, but we have to get that first version potentially reviewed. I should really get back to my book project soon. But I'm definitely in on any relevant review issues. > I think the existing ones work out quite nicely now thanks, > I could use some ideas for integer and maybe rational number examples, > but that's a whole other ball game ;-) I'm not an integer guy. Maybe someone could help us out here. But what springs to my mind is: * Prime factorization * Greatest common denominator (GCD) * Primality testing for Mersenne Primes (has an exceptionally simple algo) * MD5, SHA-1, 2, etc. (but cool std::uint32_t reference apps already exist)<snip> >> I resolved the excessive guard digit issue and reduced the guard digits >> to the necessary amount (and provide rationale in a code comment). <snip> > Sure, or mail me a patch and I'll run the full tests > (or you can - just cd into libs/multiprecision/test and > do a "bjam --enable-specfun" and then wait for a long time!) > Thanks, John. OK. I attached my proposed version in /big_number/multiprecision/cpp_dec_float.hpp. The diffs include the removal of some non-needed constants, the trimming of max_digits10 and a minor improvement to the multiplication. Thanks, Chris.

4 29

[config] New NO_COPYABLE, DELETE_COPY_CTOR and DELETE_COPY_ASSIGN macros
by Vicente J. Botet Escriba 11 May '12

11 May '12

Hi, I'm using the following BOOST_NO_COPYABLE, BOOST_DELETE_COPY_CTOR, BOOST_DELETE_COPY_ASSIGN and macros in Boost.Thread (see http://svn.boost.org/svn/boost/trunk/boost/thread/detail/delete.hpp) I guess some of you have their own similar macros. For uniformity purposes, couldn't them be added to Boost.Config/ Boost Helper Macros <cid:part1.09000208.02050709@wanadoo.fr> if I provide a patch with doc and tests? Best, Vicente [section:delete `=delete` emulation] C++11 allows to delete some implicitly generated functions as constructors and assignment using '= delete' as in public: CLASS(CLASS const&) = delete; CLASS& operator=(CLASS const&) = delete; On compilers not supporting this feature, we can relays on a partial simulation, by declaring the function as private without definition. private: CLASS(CLASS &); CLASS& operator=(CLASS&); The emulation is good but partial as the private functions are still visible. To have the best the user should write public: #ifndef BOOST_NO_DELETED_FUNCTIONS CLASS(CLASS const&) = delete; CLASS& operator=(CLASS const&) = delete; #else // BOOST_NO_DELETED_FUNCTIONS private: CLASS(CLASS&); CLASS& operator=(CLASS&); public: #endif // BOOST_NO_DELETED_FUNCTIONS The following macros allows to take in account the features the compiler provides and have the same effect public: BOOST_DELETE_COPY_CTOR(CLASS) BOOST_DELETE_COPY_ASSIGN(CLASS) As these come together quite often when we want to make a non copyable class the user can use instead public: BOOST_NO_COPYABLE(CLASS) [section:delete_copy_ctor `BOOST_DELETE_COPY_CTOR(CLASS)`] This macro deletes the copy constructor when the compiler supports it or makes it private. It can be included on the public section only. [endsect] [section:delete_copy_assign `BOOST_DELETE_COPY_ASSIGN(CLASS)`] This macro deletes the copy assignment when the compiler supports it or makes it private. It can be included on the public section only. [endsect] [section:no_copyable `BOOST_NO_COPYABLE(CLASS)`] This macro makes a class as no copyable, disabling copy construction and assignment. It can be included on the public section only. [endsect] [endsect]

3 3

[build]
by Emil Dotchevski 11 May '12

11 May '12

Hello, I get the following Boost Build error and I have no idea what's wrong. Halp! C:\Users\Zajo\z\git\reverge\bjam\test c:/Users/Zajo/z/git/munch/boost-build/build\feature.jam:138: in feature.feature from module feature error: feature already defined: error: in feature declaration: error: feature "boost.locale.iconv" : "on" "off" : "optional" "propagated" c:\Users\Zajo\z\git\lib\boost_1_49_0\libs\locale\build\Jamfile.v2:19: in modules.load from module Jamfile</c:/Users/Zajo/z/git/lib/boost_1_49_0/libs/locale/build> c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:314: in load-jamfile from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:62: in project.load from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:766: in project.use from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:89: in load-used-projects from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:73: in project.load from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:766: in project.use from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:89: in load-used-projects from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:73: in project.load from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:766: in project.use from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:89: in load-used-projects from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:73: in load from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:115: in load-parent from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:464: in initialize from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:309: in load-jamfile from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:62: in load from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:115: in load-parent from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:464: in initialize from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:309: in load-jamfile from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:62: in load from module project c:/Users/Zajo/z/git/munch/boost-build/build\project.jam:168: in project.find from module project c:/Users/Zajo/z/git/munch/boost-build/build\targets.jam:369: in find-really from module object(project-target)@683 c:/Users/Zajo/z/git/munch/boost-build/build\targets.jam:435: in object(project-target)(a)683.find from module object(project-target)@683 c:/Users/Zajo/z/git/munch/boost-build/build\targets.jam:816: in resolve-reference from module targets c:/Users/Zajo/z/git/munch/boost-build/build\targets.jam:833: in targets.generate-from-reference from module targets c:/Users/Zajo/z/git/munch/boost-build/build\targets.jam:1217: in generate-dependencies from module object(typed-target)@1905 c:/Users/Zajo/z/git/munch/boost-build/build\targets.jam:1268: in object(typed-target)(a)1905.generate from module object(typed-target)@1905 c:/Users/Zajo/z/git/munch/boost-build/build\targets.jam:732: in generate-really from module object(main-target)@2599 c:/Users/Zajo/z/git/munch/boost-build/build\targets.jam:704: in object(main-target)(a)2599.generate from module object(main-target)@2599 c:/Users/Zajo/z/git/munch/boost-build\build-system.jam:736: in load from module build-system c:\Users\Zajo\z\git\munch\NT\..\..\munch\boost-build\kernel\modules.jam:283: in import from module modules c:\Users\Zajo\z\git\munch\NT\..\..\munch\boost-build\kernel\bootstrap.jam:142: in boost-build from module c:\Users\Zajo\z\git\munch\NT\..\..\munch\boost-build.jam:6: in module scope from module Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

2 2

For Boost PP: IF_NONEMPTY(), IS_NONEMPTY
by Daniel Santos 11 May '12

11 May '12

I came up with some macros the other day trying to solve a kernel problem and I haven't seen them anywhere else and if I found one, I sure would have stolen it. :) I used this to have a single function-like macro service different numbers of parameters, essentially adding "optional parameter" support so I didn't have to have different version of the macro. IF_NONEMPTY(test, result) expands to result if test is non-empty, empty otherwise. IS_NONEMPTY(arg) expands to 0 if arg is empty, 0x1 if it isn't. OPT_OFFSETOF(type, member) isn't very useful in C++, but it is an example of how the above can be used. It expands to a compiler-time constant that is the offset of the member in the struct or union type, unless member isn't specified, in which case it's zero. #define __JUNK junk, #define _if_nonempty(arg1_or_junk, result) __if_nonempty(arg1_or_junk, result) #define __if_nonempty(__ignored, result, ...) result #define CONCAT_TOKEN(a, b) _concat_token(a, b) #define _concat_token(a, b) a ## b #define IF_NONEMPTY(test, result) _if_nonempty(__JUNK##test, result) #define IS_NONEMPTY(arg) CONCAT_TOKEN(0, IF_NONEMPTY(arg, x1)) #define OPT_OFFSETOF(type, m) ((size_t) &((*((type *)0)) IF_NONEMPTY(m,.)m))

3 3

[reference_wrapper] add operator()(Args...) to reference_wrapper
by Philipp Moeller 10 May '12

10 May '12

Given that Boost now has perfect forwarding emulation through Boost.Move and a better result_of, would it be possible to enable reference_wrapper to forward the function call operator? The current behavior is somewhat surprising and makes a few of the most promising applications of reference_wrapper (reference wrap polymorphic boost::function objects) impossible with code that is no prepared to work with reference_wrapper. It would also be more consistent with reference_wrapper of the stdlib. I can file a corresponding bug report and add a patch, if there is interest. Cheers, Philipp Moeller

2 5

[multi_array] Updated patches
by Bill Buklis 10 May '12

10 May '12

For the multi_array library, there is an updated version of the library in the trunk plus a few tickets that have proposed patches. These are updates for some fairly important issues. I'd absolutely love it if these patches could be incorporated into the next boost release, whenever that may be. I realize that the official maintainer, Garcia, is understandably very busy, so could one of the powers that be please review these patches for correctness and update the official libraries as needed? Here are the tickets that already have proposed fixes: ticket:4874 <https://svn.boost.org/trac/boost/ticket/4874> - multi_array compile errors using Visual C++ 2010 in debug mode ticket:6554 <https://svn.boost.org/trac/boost/ticket/6554> - Compiler error dereferencing multi_array value via an iterator ticket:6811 <https://svn.boost.org/trac/boost/ticket/6811> - Default argument of type multi_array fails under MSVC 2010 SP1 Thanks, -- Bill

1 0

[preprocessor] include speed question
by lcaminiti 10 May '12

10 May '12

Hello all, I have a general question about what's the best way to include files that results in faster compilation time. In my example, I have *a lot* of files that use different parts of Boost.Preprocessor. Each header includes the specific Boost.Preprocessor headers that it needs. As a results the same Boost.Preprocessor header and #included many times (50+?) even if the including has no effect after the first inclusion. Furthermore, at the end essentially all Boost.Preprocessor header get included. This way is more module in that each single file includes all the headers that it needs. But, does that slow down compilation? Would it be faster to just #include <boost/preprocessor.hpp> just once into a front-end header that then includes all my single header files? (Maybe with modern compilers and file-systems this makes no difference?) Thanks a lot. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-preprocessor-include-speed-questio… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 2

Scoped enum emulation
by Anthony Williams 10 May '12

10 May '12

Hi, On trunk there are currently two scoped enum emulation headers. One is the one that Beman wrote, in boost/detail/scoped_enum_emulation.hpp and the other is the one that Vicente has developed for the new version of Boost.Thread, in boost/thread/detail/scoped_enum.hpp It seems to me that it is a shame to have two implementations of the same thing in boost. Since Vicente's version provides additional facilities, I would therefore like to merge Vicente's code into the boost/detail header. We could retain the simple macros from Beman's header as wrappers for the more complex macros that Vicente has written. What do you think? Anthony -- Author of C++ Concurrency in Action http://www.stdthread.co.uk/book/ just::thread C++11 thread library http://www.stdthread.co.uk Just Software Solutions Ltd http://www.justsoftwaresolutions.co.uk 15 Carrallack Mews, St Just, Cornwall, TR19 7UL, UK. Company No. 5478976

3 2

[mpl] cross product and gcc specific compiler error
by Josh Quigley 10 May '12

10 May '12

Hi, A question from the grossly uninformed: I grabbed an mpl cross product implementation (product_view) of this mailing list. It works fine in MSVC but fails in gcc: typedef boost::mpl::vector<float, double, long double> DecimalTypes; typedef boost::mpl::vector<int, unsigned int, long, unsigned long, long long, unsigned long long> IntegralTypes; typedef product_view<boost::mpl::vector<DecimalTypes, IntegralTypes> > EachDecimalWithEachIntegralT; BOOST_AUTO_TEST_CASE_TEMPLATE(MyTest, DecimalIntegralT, EachDecimalWithEachIntegralT) { { typename DecimalIntegralT::item1 r(1234567); // Fails on gcc: no type named ‘item0’ in ‘struct boost::mpl::v_item<long long unsigned int, boost::mpl::v_item<ext::decimal::decimal128, boost::mpl::vector0<mpl_::na>, 0>, 0> typename DecimalIntegralT::item0 d(r); BOOST_CHECK_EQUAL(static_cast<long long>(d), r); } } A complete listing is below. The thing that has me really stumped is the type exsits in MSVC, so I'm at a bit of loss of how to proceed debugging. // // LISTING // #include <boost/mpl/vector.hpp> #include <boost/mpl/if.hpp> #include <boost/mpl/at.hpp> #include <boost/mpl/copy.hpp> #include <boost/mpl/transform.hpp> #include <boost/type_traits/is_same.hpp> #include <boost/function.hpp> #include <boost/mpl/vector.hpp> #include <boost/mpl/list.hpp> #include <boost/mpl/joint_view.hpp> #include <boost/test/unit_test.hpp> namespace detail { using boost::mpl::at_c; using boost::mpl::at; using boost::mpl::vector3; using boost::mpl::true_; using boost::mpl::false_; using boost::mpl::if_; using boost::mpl::next; using boost::mpl::bool_; using boost::mpl::front_inserter; using boost::mpl::clear; using boost::mpl::forward_iterator_tag; using boost::mpl::reverse_copy; using boost::mpl::transform1; using boost::mpl::deref; using boost::mpl::_1; using boost::mpl::_2; using boost::mpl::int_; using boost::mpl::fold; using boost::mpl::or_; using boost::mpl::nested_begin_end_tag; template<typename S, typename O> struct state_with_overflow { typedef S state; typedef O overflow; }; template<typename I3S> struct i3s_increment_inserter { template<typename I3, typename O> struct i3_ { typedef I3 i3; typedef O overflow; }; template<typename I3> struct incr_ { typedef typename next< typename at_c< I3, 1 >::type >::type next_; typedef bool_< boost::is_same< next_, typename at_c<I3,2>::type >::value > overflow_; typedef i3_< vector3< typename at_c<I3,0>::type, typename if_< overflow_, typename at_c<I3,0>::type, next_ >::type, typename at_c<I3,2>::type >, overflow_ > type; }; typedef front_inserter< typename clear<I3S>::type > base_; typedef state_with_overflow< typename base_::state, true_ > state; struct operation { template<typename S, typename I3> struct apply { typedef typename if_< typename S::overflow, typename incr_<I3>::type, i3_<I3,false_> >::type next_; typedef state_with_overflow< typename base_::operation::template apply< typename S::state, typename next_::i3 >::type, typename next_::overflow > type; }; }; }; template< typename SWO > struct product_iterator { private: typedef typename SWO::state I3S; public: typedef forward_iterator_tag category; typedef typename transform1< I3S, deref< at< _1, int_<1> > > >::type type; typedef product_iterator< typename reverse_copy< I3S, i3s_increment_inserter<I3S> >::type > next; }; template<typename S> struct product_view { private: typedef typename transform1< S, vector3< boost::mpl::begin<_1>, boost::mpl::begin<_1>, boost::mpl::end<_1> > >::type begin_impl; typedef typename fold< S, false_, or_< _1, boost::is_same< boost::mpl::begin<_2>, boost::mpl::end<_2> > // empty<_2> refuses to compile on MSVC 7.1 > >::type empty_result; public: typedef nested_begin_end_tag tag; typedef product_iterator< state_with_overflow< begin_impl, empty_result > > begin; typedef product_iterator< state_with_overflow< begin_impl, true_ > > end; }; } using detail::product_view; // typedef boost::mpl::vector<decimal32, decimal64, decimal128> DecimalTypes; // Original typedef boost::mpl::vector<float, double, long double> DecimalTypes; // for demonstration typedef boost::mpl::vector<int, unsigned int, long, unsigned long, long long, unsigned long long> IntegralTypes; typedef product_view<boost::mpl::vector<DecimalTypes, IntegralTypes> > EachDecimalWithEachIntegralT; BOOST_AUTO_TEST_CASE_TEMPLATE(MyTest, DecimalIntegralT, EachDecimalWithEachIntegralT) { { typename DecimalIntegralT::item1 r(1234567); // Fails on gcc: no type named ‘item0’ in ‘struct boost::mpl::v_item<long long unsigned int, boost::mpl::v_item<ext::decimal::decimal128, boost::mpl::vector0<mpl_::na>, 0>, 0> typename DecimalIntegralT::item0 d(r); BOOST_CHECK_EQUAL(static_cast<long long>(d), r); } }

1 0

[coroutine]
by Christopher Kormanyos 10 May '12

10 May '12

Hello, I am checking out the fascinating work with Boost.Coroutine. Excellent! This is definitely paving the way for C++ threads. I have been looking for this kind of thing for quite some time now. I am mostly interested in adaptability, as I386 and the lot are mostly done. It's always the same game with the cooperative context switching. Time-after-time, you identify the clobbered registers after a cooperative yield, save them in a context structure and restore them after the yield. Then you deal with the stacks. OK, fine. But how can you approach the dream of generic context switching? So you know, here I am. I would want Boost.Context for numerous GCC targets: Atmel AVR, Renesas V850, Renesas RL78, Cortex-M3/4. And the list goes on, as I use numerous embedded processors. The compiler's calling convention is poorly documented at best. And various compiler vendors may or may not coordinate the calling convention among each other. Can the documentation of Boost.Coroutine aid in adaptation in any way? Or is this simply beyond the present scope of the proposed Boost.Coroutine? * Is there any documentation regarding the context switch? * Are you specifically targeting preemptive yields? * If so, is the compiler's calling convention taken into account? * Can the remarkable Boost.Coroutine be adapted to other CPUs? * How? * Is Coroutine meant to be compatible with std::this_thread::yield(), etc? * Can the user select the stack sizes? * How? Thank you. And keep up the great work! Best regards, Chris.

3 6

[coroutine] request for review manager
by Oliver Kowalke 10 May '12

10 May '12

Hi, I want to ask who wants to be the review manager for boost.coroutine? The documentation is updated and available at: http://ok73.ok.funpic.de/boost/libs/coroutine/doc/html/index.html best regards, Oliver

2 4

[serialization] portable_binary_archive using shared lib
by Renato Tegon Forti 09 May '12

09 May '12

Hi, I want use portable_binary_archive, but using shared link on Windows! Have any way? Thanks

1 0

[exception] patches for a few testing-related issues
by David Deakins 09 May '12

09 May '12

Hi Emil, I have opened two Trac tickets (6877 and 6878) related to what I believe is a bug in exception_ptr_test.cpp and also for a minor change to the testing jamfile that will allow some of the thread-dependent tests to run on platforms that do not have automatic thread-specific-storage cleanup implemented (WinCE falls in this category). Are you ok with me applying these patches? Thanks, -Dave

2 1

enable_if question
by John Maddock 08 May '12

08 May '12

Folks I'm having some difficulties understanding the subtleties of enable_if, consider: using namespace boost; template <unsigned B> struct dummy {}; template <unsigned B, class Integer> typename boost::enable_if<mpl::and_<is_signed<Integer>, mpl::bool_<(sizeof(Integer) <= sizeof(long))> > >::type bar(dummy<B>&, const Integer&) { } template <unsigned B, class Integer> typename boost::enable_if<mpl::and_<is_unsigned<Integer>, mpl::bool_<(sizeof(Integer) <= sizeof(long))> > >::type bar(dummy<B>&, const Integer&) { } Then calling: dummy<2> d; bar(d, 2); Leads to an ambiguity between the two overloads (both gcc and VC++10), how can that be? However, changing the condition to: template <unsigned B, class Integer> typename boost::enable_if<mpl::and_<is_signed<Integer>, mpl::bool_<(B || !B) && (sizeof(Integer) <= sizeof(long))> > >::type bar(dummy<B>&, const Integer&) { } template <unsigned B, class Integer> typename boost::enable_if<mpl::and_<is_unsigned<Integer>, mpl::bool_<(B || !B) && (sizeof(Integer) <= sizeof(long))> > >::type bar(dummy<B>&, const Integer&) { } "fixes" things. But this fix isn't always possible. Thoughts? Thanks, John.

2 2

[preprocessor] Chaos: Auto macros incorrectly deduces the recursion state
by paul Fultz 08 May '12

08 May '12

Hello, I am not sure if this is the most appropriate place to post this, but I do know the author frequents this mailing list often. Well, when I run this code: #define FIXED(s, n, text) text #define TTP(s, n, id) \ template< \ CHAOS_PP_AUTO_ENUM( \ CHAOS_PP_INC(n), FIXED, class \ ) \ > class id ## n \ /**/ CHAOS_PP_AUTO_ENUM(3, TTP, T) // template<class> class T0, // template<class, class> class T1, // template<class, class, class> class T2 It expands to: template< CHAOS_IP_AUTO_ENUM_1( 1, FIXED, class ) > class T0 , template< CHAOS_IP_AUTO_ENUM_1( 2, FIXED, class ) > class T1 , template< CHAOS_IP_AUTO_ENUM_1( 3, FIXED, class ) > class T2 Showing CHAOS_IP_AUTO_ENUM_1 is incorrect, and its why it won't expand since its trying to be expanded recursively. It should be CHAOS_IP_AUTO_ENUM_2 instead. I'm not sure why it incorrectly deduces the recursion state. TTP is not a deferred expression. Any ideas? Thanks, Paul Fultz II

2 1

Aspen Meadows Resort suite available for up to 4 nights for C++Now Conference
by Pdruck 08 May '12

08 May '12

Hi. I reserved a suite at Aspen Meadows Resort for 4 nights, for the C++Now conference; Sunday night, May 13 – Wed night, May 16, leaving Thurs. May 17. But due to last minute pressing events in the office, I have to cancel my registration. Propose to switch my reservation to whomever might be attending. Win-win. I don’t lose a heft cancellation fee. You get a beautiful suite (having been there previously) and conveniently located to the conference at Physics Center. Regards. Phil

1 0

Iterator Range and operator==
by Olaf van der Spek 08 May '12

08 May '12

Hi, What do you expect this code to do? Is b true or false? And why? Is this expected behaviour? #include <boost/range/iterator_range.hpp> #include <string> int main() { std::string s = "Olaf"; boost::iterator_range<std::string::iterator> r(s); bool a = r == s; bool b = r == "Olaf"; assert(a); assert(b); return 0; } -- Olaf

9 17

[bind] variant arg list template functions could have a forward declaration as doc & coding suggeustion
by Huang Huan 08 May '12

08 May '12

Hi all, Before I do some change, no suggestion when I coding with Boost.Bind. This is a big disadvantage for learning & using. Variant arg list template functions as follow are there in so many boost code file. // template<class F, class A1, ... class An> // X foo(F f, A1 a1, ... An an); template<class F> X foo(F f) { ... } template<class F, class A1> X foo(F f, A1 a1) { ... } template<class F, class A1, class A2> X foo(F f, A1 a1, A2 a1) { ... } ... Some code like the comment, the forward declaration could be good doc & coding suggestion, such as following: template<class F /*, class A1, ... class An */> X foo(F f /*, A1 a1, ... An an */); OR template<class F, class A1, class A2 /*, ... */> X foo(F f, A1 a1, A2 a2, ... ); OR template<class F /*... */> // may no cxx11 X foo(F f , ... ); This may like BOOST_CONTAINERS_PERFECT_FORWARDING Becase of the template grammar, this forward declaration has no implementation. The code is ONLY for coding suggestion & doc. As an example [boost][bind] When I write the code boost::bind( _ ) I want the suggestions as follow ______________________________________________ | [1 of 3] _bi::bind_t<_bi::unspecified, F, L> bind(F f, ...) | |_____________________________________________| A more difficulty is boost bind has a BOOST_BIND for redefine the name. my patch as follow: =================================================================== --- bind.hpp (revision 77278) +++ bind.hpp (working copy) @@ -1289,6 +1289,17 @@ #ifndef BOOST_BIND #define BOOST_BIND bind + +template<class R, class F, class L> + _bi::bind_t<R, F, L> + bind(F f, ...); +template<class R, class F, class L> + _bi::bind_t<R, F, L> + bind(boost::type<R>, F f, ...); +template<class F, class L> + _bi::bind_t<_bi::unspecified, F, L> + bind(F f, ...); + #endif // generic function objects

1 0

Boost Threads - x86 Platforms / 64 bits compilation in Managed/Unmanaged Code / Visual Studio 2010 / Windows SDK 7.1 /clr
by Guillaume Rembert 07 May '12

07 May '12

As I had lots of issues to include boost thread libraries in a windows 64 bits code generated under Visual Studio 2010, here are the different steps to follow in order to get it compiling and executing quickly (mix of lots of the different specific posts). I could not find an easy, up to date procedure for this. This has been tested with Boost 1_49_0 release, Visual Studio 2010, Windows SDK 7.1 and Microsoft .NET 4. - Download 64 bits libraries, as binaries: http://boost.teeks99.com/ + unzip in a dedicated folder (for the example C:\boost\lib64) - Download boost headers and source code: http://sourceforge.net/projects/boost/files/boost/1.49.0/ + unzip in a dedicate folder (for the example C:\boost) - Set the project not to use precompiled headers + compilation with /clr to mix managed and unmanaged code - Add the headers path to the project additional include directories (in the example C:\boost) - Add the compiled libraries path to the linker additional library directories (in the example C:\boost\lib64) - Add to your project the following lines (force dynamic linking): #define BOOST_ALL_DYN_LINK #define BOOST_THREAD_USE_DLL #define BOOST_LIB_DIAGNOSTIC #include <boost/thread.hpp> --> Just compile and execute, it should not give any problems. The first line (#define BOOST_ALL_DYN_LINK) solves the following error I had: An unhandled exception of type 'System.TypeInitializationException' occurred in Unknown Module. Additional information: The type initializer for '<Module>' threw an exception.

2 1

[generic] status?
by lcaminiti 06 May '12

06 May '12

Hello all, What's the status of Matt Calabrese's Boost.Generic library? I was looking at the similarities between Boost.Generic and Boost.Contract syntax, and I think the following syntax can be implemented to define concepts, concepts_maps, axioms, etc CONTRACT_CONCEPT( concept (Iterator) ( typename X ) extends( Semiregular<X> ) ( typename(MoveConstructible) reference, as typename X::reference , typename(MoveConstructible) postinc_result , requires HasDereference<postinc_result> , (reference) operator(*)(deref) ( X& ) , (reference) operator(*)(deref) ( X&& ) , (X&) operator(++)(preinc) ( X& ) , (postinc_result) operator(++)(postinc) ( X&, int ) ) ) More examples here (auto concepts, concept maps, axioms, etc): http://contractpp.svn.sourceforge.net/viewvc/contractpp/trunk/doc/html/cont… If there was real interest using this syntax to define concepts, either the syntax could replace the on of Boost.Generic or Boost.Contract could provide the syntax and then use Boost.Generic behind the scene to actually define the concepts (same as Boost.Contract now does for Boost.Parameter). What do you think? Thanks. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-generic-status-tp4611363.html Sent from the Boost - Dev mailing list archive at Nabble.com.

2 2

[concept] typenames vs. typedefs
by lcaminiti 06 May '12

06 May '12

Hello all, I have questions about concepts (it's related to Boost.ConceptCheckign and Boost.Generic, but it's really just about the concept syntax that was proposed and never adopted for C++11). What's the difference between typename new_type = old_type and typedef old_type new_type? Why are they both allowed? For example, what's the difference between this: auto concept HasFind < typename T > { typename key_type = typename T::key_type; // use typename typename mapped_type; std::pair<key_type, mapped_type> find ( T const&, key_type const& ); } And this: auto concept HasFind < typename T > { typedef typename T::key_type key_type; // use typedef typename mapped_type; std::pair<key_type, mapped_type> find ( T const&, key_type const& ); } Thanks a lot. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-concept-typenames-vs-typedefs-tp46… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 2

question about C++11 guidelines
by Eric Niebler 06 May '12

06 May '12

Say I'm rewriting an existing Boost library and targeting C++11 users. I plan to ship C++03 and C++11 versions of my library side-by-side, so back-compat isn't an issue for the new code. Is there a reason to prefer using Boost's versions of utilities like enable_if, type traits, integral constant wrappers (e.g. mpl::int_), tuples, etc., over the now-standard ones? I'm leaning toward using std:: where I can, and falling back on Boost's versions only when there is a compelling reason. -- Eric Niebler BoostPro Computing http://www.boostpro.com

16 30

Latest version and status of lockfree
by Julien Nitard 06 May '12

06 May '12

Hi All, Where can I find the latest version of boost.lockfree ? There's nothing in the sandbox or the vault (it seems). The latest commit on Tim's public git repo was done more than 6 month ago. Now that atomic has been accepted, are there any roadblocks to have boost.lockfree released ? Many thanks, Julien

4 9

trac spam (was: [Boost C++ Libraries] #6866: affiliate revolution)
by Eric Niebler 06 May '12

06 May '12

Who maintains trac these days? Can we get this spammy ticket deleted? Thanks, Eric -------- Original Message -------- Subject: [Boost C++ Libraries] #6866: affiliate revolution Date: Fri, 04 May 2012 20:08:29 -0000 From: Boost C++ Libraries <noreply(a)lists.boost.org> CC: boost-bugs(a)lists.boost.org #6866: affiliate revolution ----------------------------------+----------------------------------------- Reporter: anonymous | Owner: eric_niebler Type: Tasks | Status: new Milestone: To Be Determined | Component: proto Version: Boost 1.37.0 | Severity: Cosmetic Keywords: affiliate revolution | ----------------------------------+----------------------------------------- [<link deleted> affiliate revolution] -- Ticket URL: <https://svn.boost.org/trac/boost/ticket/6866> Boost C++ Libraries <http://www.boost.org/> Boost provides free peer-reviewed portable C++ source libraries.

3 3

[polygon] Trunk write access
by Andrii Sydorchuk 05 May '12

05 May '12

I sent a message recently to the Boost owners list to get write access to the Boost trunk, but haven't got any response yet. I am going to merge lately discussed Voronoi library and some updates to the Boost.Polygon. Those are approved by the library owner: Simonson, Lucanus J. Sorry for the rush. Regards, Andrii

2 2

Red Hat Enterprise Linux Test Page
by Olaf van der Spek 05 May '12

05 May '12

Hi, This does not look right. ;) https://www.boost.org/ -- Olaf

3 2

[dynamic_bitset] Endianess and Adaption Vs Copying
by Joel 04 May '12

04 May '12

I've noticed that the dynamic_bitset seems to have endian issues. For masking out the ith bit in a block, it uses 1 shifted left by i. As a result, the bits are not consecutive. For example if the block_type is uint8_t, and we have 16 bits in the bitset, then bits are numbered: 00 01 02 03 04 05 06 07 15 14 13 12 11 10 09 08 in memory. That doesn't seem right---7th and 8th bits should be adjacent. Does anyone have suggestions for controlling this? Second, has anyone adapted dynamic_bitset to be an adaptor for an existing memory range to avoid copying? Thanks! Joel

4 9

[contract] syntax redesign
by Lorenzo Caminiti 04 May '12

04 May '12

Hello all, After a long time of inactivity for Boost.Contract, I am considering how to re-design its macro syntax to make it simpler. I can eliminate a large number of extra parenthesis based on a few pp tricks I've learned in processing Boost.Local's `const bind(type)& var`. Plus, I can provide (optional) support for variadics macros so to use comma-separated pp tuplets instead of parenthesized pp sequences on preprocessors with variadics. For example, I _think_ (but I've not implemented this yet) that I can simplify the syntax like this: #include <contract.hpp> #include <vector> #include "myvector/pushable.hpp" // Wrapper class that adds contracts to std::vector. CONTRACT_CLASS( template( typename T ) class (myvector) extends( public pushable<T> ) // Subcontracting. ) { CONTRACT_CLASS_INVARIANT( empty() == (size() == 0) // More invariants here (comma separated)... ) CONTRACT_FUNCTION( public void (push_back)( (const T&) element ) precondition( size() < max_size() // More preconditions here (comma separated)... ) postcondition( auto old_size = CONTRACT_OLDOF(size()), // Old value. size() == old_size + 1 // More postconditions here (comma separated)... ) ) { vector_.push_back(element); // Implementation. } // Rest of the class here (with more contracts if needed)... public: typedef typename std::vector<T>::size_type size_type; size_type size(void) const { return vector_.size(); } size_type max_size(void) const { return vector_.max_size(); } bool empty(void) const { return vector_.empty(); } const T& back(void) const { return vector_.back(); } private: std::vector<T> vector_; }; For a side-by-side comparison with N1962 syntax: http://svn.boost.org/svn/boost/sandbox/contract/libs/contract/doc/html/inde… For a comparison of the entire std::vector (plus Boost.ConceptCheck concepts): http://svn.boost.org/svn/boost/sandbox/contract/libs/contract/doc/html/cont… For a comparison for all Boost.Contract features (plus Boost.ConceptCheck concepts and Boost.Parameter named parameters): http://svn.boost.org/svn/boost/sandbox/contract/libs/contract/doc/html/cont… (Don't pay attention to the rest of the docs that are way out of date.) A few notes: * Extra parenthesis are still needed around class and function names. * Extra parenthesis are still needed around types (like for the parameter `(T) element`) but only if the type is not a C++ keyword (no parenthesis needed aournd int, double, void, etc) or it contains a symbol (parenthesis needed if & or * are used `(int&) x`, etc). * In postconditions, the `auto old_size = CONTRACT_OLDOF(size())` only copies the vector size (and not the entire vector :)) ). Similarly, `auto result = return` can be used to access the return value for non-void functions. (The `auto ...` is parsed by the pp and it's implemented using Boost.Typeof so no C++0x is required.) * Template declaration (but not instantiation) angular parenthesis <> are replaced by round parenthesis (). All of this _should_ be implementable in pure ISO C++. What do you think? Based on the discontent that the previous "parenthesized" syntax generated among Boosters, the key question is: Would you consider this new syntax usable?? Thanks, --Lorenzo

5 45

[Countertree + Suballocator] New Version
by Francisco José Tapia 03 May '12

03 May '12

Hi this message is to announce the new version of the [countertree + suballocator] library. You can find the zip file with the code and the documentation in https://docs.google.com/file/d/0B9lWJ1Nhb_RhRXVHSS14aGxUZjJjWFdRVC0xZ2czZw/… or if you want a quick look , you can see in my web page http://fjtapia.webs.com/works/countertree/index.html *COUNTERTREE * This library is an implementation of a binary red-black counter tree. This tree have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators . With this tree we have vectors (cntree::vector_tree) with identical interface than std::vector. The vector_tree have the same speed inserting and deleting in any position (all the operations are O(log N)).It is slower than std:vector inserting and deleting at end, but much faster for to insert and delete in any other position. With ordered information, we have in the cntree namespace the classes set, multiset, map and multimap, with identical interface than the STL classes, with the plus of access to the elements by position, like in a vector. The iterators are random access , and you can subtract two iterators in a O(log N) time for to know the number of nodes between them (even with the end( ) and rend( ) iterators) For to show the utility of this, imagine a large unordered file with the information about the employees of a big company. You have indexes implemented with multimaps, with pairs [value, position], and use the upper_bound and lower_bound functions. You need to select the employees in a range of age and weight. With the boost:multimap you can know the number of elements of the selection. In the weight query we found 100 elements and in the age query 10000 elements. To travel the elements of the weight query asking for the age, is faster than the opposite. *SUBALLOCATOR * A very hard test for the allocators are the data structures which need a very high number (several millions) of elements of the same size, like the STL list, set, multiset, map or multimap. When the number of elements grow, many allocators begin to have speed problems. The solution proposed for this problem are the custom allocators. These allocators are very fast, but many of them present additional problems related with the memory consumption. And they don't work well when they must manage many types of data. When the allocators receive the request from the program, they request memory to the Operating System, and the memory consumed by the program grows up. When the program return to the allocators the request, many allocators have problems for to return the memory freed to the Operating System (The std::allocator of GCC 4.6 don't return well the memory, and the std::allocator of Visual C++, return, but it is slower than the GCC allocator) If you use only one allocator, you have a bad management or in the speed of equal size elements, or with a wide variety of elements. If you use two allocators, the memory freed by an allocator can't be used by the other, and the memory consumption is very high, and when decrease the number of elements to manage, the memory don't decrease. These problems are specially important in two environments : a) When you have a limited resources, as occurs in the mobile phones, pads ... b) When the programs must run continuously in a multitask environment The solution is the suballocator. It is a mechanism for to manage in a fast way a greater number (hundred millions) of elements with the same size. The suballocator is a layer over the allocator (any allocator with the STL interface). The suballocator receives an allocator as template parameter. When the suballocator needs memory, request memory from the allocator, and when the memory is not used, is returned to the allocator. The suballocator present the same interface than the STL allocator. Form the view point of the data structures, the suballocator is other allocator The suballocator always return the first element free. This improve the cache performance and the speed of the data structures. This simple memory schema permit to the allocators return memory to the Operating System and decrease the memory used by the program, as demonstrate the programs in the benchmarks, and you can see in the benchmark point. With the suballocator a) We have a very *fast allocation* (3 times faster than GCC 4.6 std::allocator, 3.5 times faster than Visual Studio 10 std::allocator ) b) Return memory to the allocator, for to be used by others types of data. Many allocators, return this memory to the Operating System, and *decrease the memory used by the program * c) You *can use with any allocator* if according with the STL definition. The suballocator provides speed and memory management to any allocator. d) In the insertion in a std::set<uint64_t> , the time spent by the allocator is around 1%, but the suballocator save around 35% of time . The suballocator always provide the first position free, This provide us a very compact data are, which *improve the cache performance* All the information showed here is explained and detailed in the point Suballocator. All the information is extracted from the programs in the benchmarks folder. *COUNTERTREE + SUBALLOCATOR* The join of the two ideas provide us data structures with a suballocator built-in. They are, in the namespace cntree, the vector_tree_pool, set_pool, multiset_pool,map_pool and multimap_pool, with identical interface than the STL classes but better performance. Tray it. It fast, useful and easy to understand and use,. They are the STL classes with a few additional functions. I had checked this code with GCC 4.6 (32 and 64) , CLANG/LLVM 3.0 and Visual Studio 1010 (32 and 64). If you find any error or problem in the code , the documentation or in any other part ( as friendly do Mr Rene Rivera in the first version). Please mail me ( fjtapia(a)gmail.com) or if you mail Boost, please insert [countertree] in the head of the message. Some days I have not time to read all messages arrived to my mail, but if I see that I detect and respond first. If you have some idea, or have any comment, please mail me, always two legs run more than only one in the pursuit of the goal, to be useful to the community of programmers in the same way than our predecessors had been useful to us. Sincerely yours Francisco Tapia fjtapia(a)gmail.com

7 19

[release] scope_exit, local_function, utility/identity_type, and functional/overloaded_function
by lcaminiti 02 May '12

02 May '12

Hello release managers, I've been working in the trunk on a few libraries which are almost ready to be released: a) When is the release date? b) What do I have to do to merge into release? (This will be my 1st release merge :) ). 1) ScopeExit (improved) I'm waiting on MVSC 9 and 10 tests to cycle to make sure they all pass. Other compilers OK. 2) Utility/IdentityType (new) Should be ready to be merged into release. 3) Functional/OverloadedFunction (new) Should be ready to be merged into release. 4) LocalFunction (new) I'm making final fixes for some tests on some of compilers. Hopefully, I'll be done in 2 weeks max. For all of those, I've followed the checklist so I've run the code inspection tool, updated all docs, librariers.htm, and maintainers.txt. Thanks a lot. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-release-scope-exit-local-function-… Sent from the Boost - Dev mailing list archive at Nabble.com.

4 9

Trac Default Version
by Olaf van der Spek 02 May '12

02 May '12

Hi, Why's the default version when submitting a ticket still 1.48? -- Olaf

2 1

[uuids] On boost::uuids::uuid operator == performance.
by Michael Kochetkov 02 May '12

02 May '12

Hello. I would like to discuss a performance issue with boost::uuids::uuid operator ==. Let us consider the following program: --------------------------------------------------- #include <boost/uuid/uuid.hpp> #include <boost/uuid/uuid_generators.hpp> int main() { boost::uuids::uuid id1((boost::uuids::random_generator()())), id2((boost::uuids::random_generator()())); return id1 == id2; // we will consider this line } --------------------------------------------------- That is compiled with maximum optimizations the following way with Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 16.00.40219.01 for 80x86: cl -EHsc -Ox -GL -Ob2 -Oi -Fa -I..\3dparty\boost_1_48_0 m051.cpp boost uses the following comparison operator: inline bool operator==(uuid const& lhs, uuid const& rhs) /* throw() */ { return std::equal(lhs.begin(), lhs.end(), rhs.begin()); } which end up with the following code: lea edx, DWORD PTR _id2$[esp+92] lea ecx, DWORD PTR _id1$[esp+108] lea eax, DWORD PTR _id1$[esp+92] call ?_Equal@std@@YA_NPBE00@Z ; std::_Equal The whole story looks the following way (the code above plus std::_Equal call expansion): 0117C6AB lea edx,[esp+24h] 0117C6AF lea ecx,[esp+48h] 0117C6B3 lea eax,[esp+38h] 0117C6B7 call 01171000 01171000 push esi 01171001 mov esi,eax 01171003 sub ecx,esi 01171005 push edi 01171006 cmp ecx,4 01171009 jb 01171024 0117100B jmp 01171010 0117100D lea ecx,[ecx] 01171010 mov eax,dword ptr [esi] 01171012 cmp eax,dword ptr [edx] 01171014 jne 01171028 01171016 sub ecx,4 01171019 add edx,4 0117101C add esi,4 0117101F cmp ecx,4 01171022 jae 01171010 01171024 test ecx,ecx 01171026 je 01171073 01171028 movzx eax,byte ptr [esi] 0117102B movzx edi,byte ptr [edx] 0117102E sub eax,edi 01171030 jne 01171063 01171032 cmp ecx,1 01171035 jbe 01171073 01171037 movzx eax,byte ptr [esi+1] 0117103B movzx edi,byte ptr [edx+1] 0117103F sub eax,edi 01171041 jne 01171063 01171043 cmp ecx,2 01171046 jbe 01171073 01171048 movzx eax,byte ptr [esi+2] 0117104C movzx edi,byte ptr [edx+2] 01171050 sub eax,edi 01171052 jne 01171063 01171054 cmp ecx,3 01171057 jbe 01171073 01171059 movzx eax,byte ptr [esi+3] 0117105D movzx ecx,byte ptr [edx+3] 01171061 sub eax,ecx 01171063 sar eax,1Fh 01171066 or eax,1 01171069 xor edx,edx 0117106B test eax,eax 0117106D pop edi 0117106E sete al 01171071 pop esi 01171072 ret 01171073 xor eax,eax 01171075 xor edx,edx 01171077 test eax,eax 01171079 pop edi 0117107A sete al 0117107D pop esi 0117107E ret I do understand that the boost::uuids::uuid implementation is conceptually correct and inoculate the best programming practices. But the following equivalent is too much faster (you may probably want to ensure a proper alignment for some processor architectures or even get even faster 64-bit version): inline bool comp(const boost::uuids::uuid& l, const boost::uuids::uuid& r) { return *reinterpret_cast<const uint32_t*>(l.data) == *reinterpret_cast<const uint32_t*>(r.data) && *reinterpret_cast<const uint32_t*>(l.data+4) == *reinterpret_cast<const uint32_t*>(r.data+4) && *reinterpret_cast<const uint32_t*>(l.data+8) == *reinterpret_cast<const uint32_t*>(r.data+8) && *reinterpret_cast<const uint32_t*>(l.data+12) == *reinterpret_cast<const uint32_t*>(r.data+12); } the assembler output is: mov ecx, DWORD PTR _id1$[esp+92] cmp ecx, DWORD PTR _id2$[esp+92] jne SHORT $LN37@main mov edx, DWORD PTR _id1$[esp+96] cmp edx, DWORD PTR _id2$[esp+96] jne SHORT $LN37@main mov eax, DWORD PTR _id1$[esp+100] cmp eax, DWORD PTR _id2$[esp+100] jne SHORT $LN37@main mov ecx, DWORD PTR _id1$[esp+104] cmp ecx, DWORD PTR _id2$[esp+104] jne SHORT $LN37@main mov eax, 1 jmp SHORT $LN40@main $LN37@main: xor eax, eax $LN40@main: movzx eax, al that the question comes: is boost supposed to be used in commercial applications or it is just a testing area for some concepts? You have probably never thought of the fact that Debug (unoptimized configurations) are sometimes just unusable with such approach on real (big) data. If you are interested you may want to compile the program above this way and see the resulting code: cl -EHsc -Zi -Fa -I..\3dparty\boost_1_48_0 m051.cpp Thank you in advance for your considerations. -- Michael Kochetkov

7 27

[uuid] Unused variable warnings
by Andrey Semashev 02 May '12

02 May '12

Hi, With recent versions of boost I get lots of warnings like the following: /.../boost/uuid/seed_rng.hpp: In member function ‘void boost::uuids::detail::seed_rng::sha1_random_digest_()’: /.../boost/uuid/seed_rng.hpp:157:24: warning: variable ‘not_used’ set but not used [-Wunused-but-set-variable] I'm using GCC 4.6 with -Wall. It's trivial to mask this warning out by attaching __attribute__((unused)) to the variable, which I've done locally. Ok to commit?

2 2

Recommended way of dealing with windows.h in headers?
by Mathias Gaunard 02 May '12

02 May '12

What's the recommended way to deal with windows.h in Boost? I see a lot of libraries doing stuff like #if defined( BOOST_USE_WINDOWS_H ) # include <windows.h> #endif namespace boost { namespace detail { #if !defined( BOOST_USE_WINDOWS_H ) extern "C" void __stdcall Sleep( unsigned long ms ); #endif So should libraries just declare all symbols themselves? But here the declaration is wrong, it misses __declspec(dllimport) for example when the runtime CRT is used, unnecessarily requiring import libraries. WINBASEAPI/WINADVAPI macros could be used to fix that. There is also the file <boost/detail/win/basic_types.hpp> that contains a few of the types, but it doesn't seem to be used that much except by other files in detail/win, and then again they don't re-use WINAPI and other macros. It also seems to be lacking the WINBASEAPI/WINADVAPI macros. Also, why couldn't headers simply include <windef.h> then <winbase.h>? Does that cause problems too?

3 2

[Smart Ptr] make_shared slower than shared_ptr(new) on VC++9 (and 10) with fix
by Ivan Erceg 02 May '12

02 May '12

Hi all, Before I switch to using boost::make_shared<> I wanted to test its purported performance advantage. I created a simple benchmark for measuing raw allocation throughput for 3 classes of different sizes with a common base class (constructors and destructors trivial). The number of allocations was set to 40,000,000 as it was roughly giving me 10 seconds running time per test. Unfortunatelly it turns out that on VC++9 (release target with default optimizations) boost::make_shared is significantly slower than simply doing boost::shared_ptr(new). Here's the benchmark output: TestBoostMakeShared 10.577s 3.78179e+006 allocs/s TestBoostSharedPtrNew 8.907s 4.49085e+006 allocs/s As you can see boost::make_shared is over 15% slower than boost::shared_ptr(new) idiom. Having available VC++10 compiler as well I then compared these results with std::shared_ptr and std::make_shared implementations that come with that compiler (but not VC++9). Here are the results: TestBoostMakeShared 9.688s 4.12882e+006 allocs/s TestBoostSharedPtrNew 8.252s 4.84731e+006 allocs/s TestStdMakeShared 5.07s 7.88955e+006 allocs/s TestStdSharedPtrNew 8.159s 4.90256e+006 allocs/s While std::shared_ptr(new) performs about the same as boost::shared_ptr(new), std::make_shared really blows away boost::make_shared and both shared_ptr(new) tests, being almost twice as fast as boost::make_shared. I then profiled the boost::make_shared test to see what's the biggest performance bottleneck when compared to boost::shared_ptr(new) profiler run. The culprit was immediately obvious: boost::make_shared test was spending above 25% of its time in "type_info::operator==(class type_info const &) const" function. This function was being called indirectly from boost::make_shared through boost::get_deleter. After digging some more through the implementation I came to the conclusion that, in this particular case, we are guaranteed to always be requesting deleter for the right class (namely T from boost::make_shared<T>). Since boost::shared_ptr doesn't have a way to retrieve the deleter without using RTTI I decided to add one and use it from an alternative boost::make_shared. So I did the following: 1. I added a virtual function to detail::sp_counted_base (detail\sp_counted_base_w32.hpp): virtual void * get_raw_deleter( ) = 0; 2. I implemented get_raw_deleter() function in sp_counted_impl_p (detail\sp_counted_impl.hpp): virtual void * get_raw_deleter( ) { return 0; } 3. I implemented get_raw_deleter() function in sp_counted_impl_pd (detail\sp_counted_impl.hpp): virtual void * get_raw_deleter( ) { return &reinterpret_cast<char&>( del ); } 4. I implemented get_raw_deleter() function in sp_counted_impl_pda (detail\sp_counted_impl.hpp): virtual void * get_raw_deleter( ) { return &reinterpret_cast<char&>( d_ ); } 5. I added the following function to detail::shared_count: void * get_raw_deleter( ) const { return pi_? pi_->get_raw_deleter( ): 0; } 6. I added the following function to shared_ptr<>: void * _internal_get_raw_deleter( ) const { return pn.get_raw_deleter( ); } 7. I made a separate copy of boost::make_shared function and replaced a single line from: boost::detail::sp_ms_deleter< T > * pd = boost::get_deleter< boost::detail::sp_ms_deleter< T > >( pt ); to: boost::detail::sp_ms_deleter< T > * pd = static_cast<boost::detail::sp_ms_deleter< T > *>(pt._internal_get_raw_deleter()); Benchmarking the results afterwards gave me the following results on VC++9: TestBoostSharedPtrNew 9.204s 4.34594e+006 allocs/s TestBoostMakeShared 10.499s 3.80989e+006 allocs/s TestBoostMakeSharedAlt 7.831s 5.1079e+006 allocs/s My changes translated into almost 35% improvement in allocation speed over the current implementation of boost::make_shared. Or to put it differently, they amount to 25+% decrease in running time as we could have supposed from the profiling results. Results on VC++10 are similar: TestBoostSharedPtrNew 8.487s 4.71309e+006 allocs/s TestBoostMakeShared 9.609s 4.16276e+006 allocs/s TestStdSharedPtrNew 8.283s 4.82917e+006 allocs/s TestStdMakeShared 5.039s 7.93808e+006 allocs/s TestBoostMakeSharedAlt 6.802s 5.88062e+006 allocs/s VC++10's std::make_shared is still much faster (almost 35% faster than boost::shared_ptr) and we will be switching to it once we switch to VC++10. But in the meantime it seems to me that boost::make_shared should be fixed to improve the performance. Again, this is only one compiler and other compilers might not have such a severe RTTI performance issue but I still think it would be well worth avoiding unnecessary calls to RTTI during performance-relevant operations such as heap allocations. The testing and changes were done on Boost 1.48.0 but I compared Smart Ptr library sources with Boost 1.49.0 and the above changes should work there equally well. Thanks, Ivan

15 40

[ANN] ODB C++ ORM 2.0.0 released, adds support for C++11, polymorphism
by Boris Kolpackov 02 May '12

02 May '12

I am pleased to announce the release of ODB 2.0.0. ODB is an open source object-relational mapping (ORM) system for C++. It allows you to persist C++ objects to a relational database without having to deal with tables, columns, or SQL and without manually writing any of the mapping code. ODB provides a Boost profile which allows you to seamlessly use value types (date_time), containers (optional, unordered), and smart pointers (shared_ptr, weak_ptr) from Boost in your persistent classes. Major new features in this release: * Support for C++11 which adds integration with the new C++11 standard library components, including smart pointers and containers. Now you can use std::unique_ptr and std::shared_ptr as object pointers (their lazy versions are also provided). For containers, support was added for std::array, std::forward_list, and the unordered containers. * Support for polymorphism which allows you to persist, load, update, erase, and query objects of derived classes using their base class interfaces. Persistent class hierarchies are mapped to the relational database model using the table-per-difference mapping. * Support for composite object ids which are translated to composite primary keys in the relational database. * Support for the NULL semantics for composite values. This release has also been tested with GCC 4.7 and Clang 3.0 with the ODB compiler now supporting the GCC 4.7 series plugin interface. A more detailed discussion of these features can be found in the following blog post: http://www.codesynthesis.com/~boris/blog/2012/05/02/odb-2-0-0-released/ For the complete list of new features in this version see the official release announcement: http://www.codesynthesis.com/pipermail/odb-announcements/2012/000013.html ODB is written in portable C++ and you should be able to use it with any modern C++ compiler. In particular, we have tested this release on GNU/Linux (x86/x86-64), Windows (x86/x86-64), Mac OS X, and Solaris (x86/x86-64/SPARC) with GNU g++ 4.2.x-4.7.x, MS Visual C++ 2008 and 2010, Sun Studio 12, and Clang 3.0. The currently supported database systems are MySQL, SQLite, PostgreSQL, Oracle, and SQL Server. More information, documentation, source code, and pre-compiled binaries are available from: http://www.codesynthesis.com/products/odb/ Enjoy, Boris

1 0

Re: [boost] [preprocessor] Sequences vs. All Other Data Structures
by Brian Wood 02 May '12

02 May '12

Paul Mensonides: > As some sort of technological preview? It is not portable enough to be > used within Boost, though perhaps a slew of regression failures will cause > that to change (unlikely). <rant>MS, in particular, is too busy taking it > upon themselves to "ensure C++ is relevant" to prioritize implementing the > language.</rant> Also, one of the principles of Chaos is to have > absolutely zero compiler workarounds, and that would have to stay if it > was ever part of Boost. Given your desire to avoid compiler workarounds, an on line code generator may be helpful. One of the happy results of going on line is kissing compiler workarounds good-bye. I've worked on the distribution of code generated by an on line code generator -- http://webEbenezer.net/build_integration.html . You're welcome to use that as a starting point if you like. Shalom, Brian Wood Ebenezer Enterprises http://webEbenezer.net

4 4

Review request: extended complex number library
by Matthieu Schaller 02 May '12

02 May '12

Dear all, Following the comments from V. Escriba, I formally propose my complex number library for review. The library is an extension of the std::complex class addressing two issues: - The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. - Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Performance tests show some non-negligible speed-ups compared to std::complex for calculations where pure imaginary numbers are involved. A speed-up of 25% has been observed when solving the Schroedinger equation explicitly on a regular mesh and some comparable figures can be observed when computing the Mandelbrot set (the two examples snippets provided in the archive). Furthermore, the functions (sin(), exp(), log(),...) involving boost::imaginary numbers are more precise than their equivalent using a std::complex with the real part set to 0. The code and (doxygen) documentation is available in the repository http://code.google.com/p/cpp-imaginary-numbers/ A comprehensive zip archive can be found in the "download" and the code can also be checked-out via the SVN repository. The archive contains the class header, two examples, a comprehensive precision test, a brute-force performance test and the documentation. I'd be happy to answer any question from your side and to provide more detailed information if required. Regards, Matthieu -- Matthieu Schaller PhD student - Durham University

8 23

[assign] map_list_of with hash_map?
by Robert Dailey 01 May '12

01 May '12

Will map_list_of work with std::hash_map?

1 0

Array in Unordered Map
by Olaf van der Spek 01 May '12

01 May '12

Hi, What's the right way to get an array into an unordered map? This one works on VC10, but GCC appears to look for the hash_value function in namespace std. What's the right way to do this? Olaf #include <array> #include <boost/unordered_map.hpp> namespace boost { template<class T, size_t N> size_t hash_value(const std::array<T, N>& v) { return boost::hash_range(v.begin(), v.end()); } } int main() { boost::unordered_map<std::array<char, 20>, int> c; c[std::array<char, 20>()] = 0; return 0; } -- Olaf

3 6

Re: [boost] [Boost-commit] svn:boost r78273 - in trunk: boost/filesystem libs/filesystem/test libs/filesystem/test/msvc10 libs/filesystem/test/msvc10/macro_default_test
by Steven Watanabe 01 May '12

01 May '12

AMDG This broke the regression tests: error: Unable to find file or target named error: 'macro_default_test.cpp' error: referred from project at error: '../libs/filesystem/test' In Christ, Steven Watanabe On 04/30/2012 08:00 AM, bdawes(a)acm.org wrote: > Author: bemandawes > Date: 2012-04-30 11:00:21 EDT (Mon, 30 Apr 2012) > New Revision: 78273 > URL: http://svn.boost.org/trac/boost/changeset/78273 > > Log: > Revert to BOOST_FILESYSTEM_STATIC_LINK as the default if no linkage macros supplied. See http://www.boost.org/doc/libs/1_49_0/libs/config/doc/html/boost_config/boos… > Add test to verify correct default. > Added: > trunk/libs/filesystem/test/msvc10/macro_default_test/ > trunk/libs/filesystem/test/msvc10/macro_default_test/macro_default_test.vcxproj (contents, props changed) > Text files modified: > trunk/boost/filesystem/config.hpp | 2 +- > trunk/libs/filesystem/test/Jamfile.v2 | 1 + > trunk/libs/filesystem/test/msvc10/filesystem-v3.sln | 10 ++++++++++ > 3 files changed, 12 insertions(+), 1 deletions(-) > > Modified: trunk/boost/filesystem/config.hpp > ============================================================================== > --- trunk/boost/filesystem/config.hpp (original) > +++ trunk/boost/filesystem/config.hpp 2012-04-30 11:00:21 EDT (Mon, 30 Apr 2012) > @@ -56,7 +56,7 @@ > > #if !defined(BOOST_FILESYSTEM_DYN_LINK) && !defined(BOOST_FILESYSTEM_STATIC_LINK) \ > && !defined(BOOST_ALL_DYN_LINK) && !defined(BOOST_ALL_STATIC_LINK) > -# define BOOST_FILESYSTEM_DYN_LINK > +# define BOOST_FILESYSTEM_STATIC_LINK > #endif > > #if defined(BOOST_ALL_DYN_LINK) && !defined(BOOST_FILESYSTEM_DYN_LINK) > > Modified: trunk/libs/filesystem/test/Jamfile.v2 > ============================================================================== > --- trunk/libs/filesystem/test/Jamfile.v2 (original) > +++ trunk/libs/filesystem/test/Jamfile.v2 2012-04-30 11:00:21 EDT (Mon, 30 Apr 2012) > @@ -17,6 +17,7 @@ > > test-suite "filesystem" : > [ run convenience_test.cpp ] > + [ compile macro_default_test.cpp ] > [ run deprecated_test.cpp ] > [ run fstream_test.cpp ] > [ run large_file_support_test.cpp ] > > Modified: trunk/libs/filesystem/test/msvc10/filesystem-v3.sln > ============================================================================== > --- trunk/libs/filesystem/test/msvc10/filesystem-v3.sln (original) > +++ trunk/libs/filesystem/test/msvc10/filesystem-v3.sln 2012-04-30 11:00:21 EDT (Mon, 30 Apr 2012) > @@ -106,6 +106,12 @@ > EndProject > Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "exec_monitor_lib", "exec_monitor_lib\exec_monitor_lib.vcxproj", "{272DFC15-6292-49DF-B457-6784A183EAC3}" > EndProject > +Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "macro_default_test", "macro_default_test\macro_default_test.vcxproj", "{36E2032D-F9E6-4FBA-9630-3D4AC518DC6C}" > + ProjectSection(ProjectDependencies) = postProject > + {3640605D-6F82-493D-879F-8F30762DA554} = {3640605D-6F82-493D-879F-8F30762DA554} > + {2C1770A4-4AC3-4102-9D36-E652DBB686D8} = {2C1770A4-4AC3-4102-9D36-E652DBB686D8} > + EndProjectSection > +EndProject > Global > GlobalSection(SolutionConfigurationPlatforms) = preSolution > Debug|Win32 = Debug|Win32 > @@ -228,6 +234,10 @@ > {272DFC15-6292-49DF-B457-6784A183EAC3}.Debug|Win32.Build.0 = Debug|Win32 > {272DFC15-6292-49DF-B457-6784A183EAC3}.Release|Win32.ActiveCfg = Release|Win32 > {272DFC15-6292-49DF-B457-6784A183EAC3}.Release|Win32.Build.0 = Release|Win32 > + {36E2032D-F9E6-4FBA-9630-3D4AC518DC6C}.Debug|Win32.ActiveCfg = Debug|Win32 > + {36E2032D-F9E6-4FBA-9630-3D4AC518DC6C}.Debug|Win32.Build.0 = Debug|Win32 > + {36E2032D-F9E6-4FBA-9630-3D4AC518DC6C}.Release|Win32.ActiveCfg = Release|Win32 > + {36E2032D-F9E6-4FBA-9630-3D4AC518DC6C}.Release|Win32.Build.0 = Release|Win32 > EndGlobalSection > GlobalSection(SolutionProperties) = preSolution > HideSolutionNode = FALSE > > Added: trunk/libs/filesystem/test/msvc10/macro_default_test/macro_default_test.vcxproj > ============================================================================== > --- (empty file) > +++ trunk/libs/filesystem/test/msvc10/macro_default_test/macro_default_test.vcxproj 2012-04-30 11:00:21 EDT (Mon, 30 Apr 2012) > @@ -0,0 +1,91 @@ > +<?xml version="1.0" encoding="utf-8"?> > +<Project DefaultTargets="Build" ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003"> > + <ItemGroup Label="ProjectConfigurations"> > + <ProjectConfiguration Include="Debug|Win32"> > + <Configuration>Debug</Configuration> > + <Platform>Win32</Platform> > + </ProjectConfiguration> > + <ProjectConfiguration Include="Release|Win32"> > + <Configuration>Release</Configuration> > + <Platform>Win32</Platform> > + </ProjectConfiguration> > + </ItemGroup> > + <PropertyGroup Label="Globals"> > + <ProjectGuid>{36E2032D-F9E6-4FBA-9630-3D4AC518DC6C}</ProjectGuid> > + <Keyword>Win32Proj</Keyword> > + <RootNamespace>macro_default_test</RootNamespace> > + </PropertyGroup> > + <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" /> > + <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration"> > + <ConfigurationType>Application</ConfigurationType> > + <UseDebugLibraries>true</UseDebugLibraries> > + <CharacterSet>Unicode</CharacterSet> > + </PropertyGroup> > + <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration"> > + <ConfigurationType>Application</ConfigurationType> > + <UseDebugLibraries>false</UseDebugLibraries> > + <WholeProgramOptimization>true</WholeProgramOptimization> > + <CharacterSet>Unicode</CharacterSet> > + </PropertyGroup> > + <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" /> > + <ImportGroup Label="ExtensionSettings"> > + </ImportGroup> > + <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'"> > + <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" /> > + </ImportGroup> > + <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'"> > + <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" /> > + </ImportGroup> > + <PropertyGroup Label="UserMacros" /> > + <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'"> > + <LinkIncremental>true</LinkIncremental> > + </PropertyGroup> > + <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'"> > + <LinkIncremental>false</LinkIncremental> > + </PropertyGroup> > + <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'"> > + <ClCompile> > + <PrecompiledHeader> > + </PrecompiledHeader> > + <WarningLevel>Level3</WarningLevel> > + <Optimization>Disabled</Optimization> > + <PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions> > + <AdditionalIncludeDirectories>../../../../..</AdditionalIncludeDirectories> > + </ClCompile> > + <Link> > + <SubSystem>Console</SubSystem> > + <GenerateDebugInformation>true</GenerateDebugInformation> > + </Link> > + </ItemDefinitionGroup> > + <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'"> > + <ClCompile> > + <WarningLevel>Level3</WarningLevel> > + <PrecompiledHeader> > + </PrecompiledHeader> > + <Optimization>MaxSpeed</Optimization> > + <FunctionLevelLinking>true</FunctionLevelLinking> > + <IntrinsicFunctions>true</IntrinsicFunctions> > + <PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions> > + </ClCompile> > + <Link> > + <SubSystem>Console</SubSystem> > + <GenerateDebugInformation>true</GenerateDebugInformation> > + <EnableCOMDATFolding>true</EnableCOMDATFolding> > + <OptimizeReferences>true</OptimizeReferences> > + </Link> > + </ItemDefinitionGroup> > + <ItemGroup> > + <ClCompile Include="..\..\macro_default_test.cpp" /> > + </ItemGroup> > + <ItemGroup> > + <ProjectReference Include="..\filesystem_lib\filesystem_lib.vcxproj"> > + <Project>{2c1770a4-4ac3-4102-9d36-e652dbb686d8}</Project> > + </ProjectReference> > + <ProjectReference Include="..\system_lib\system_lib.vcxproj"> > + <Project>{3640605d-6f82-493d-879f-8f30762da554}</Project> > + </ProjectReference> > + </ItemGroup> > + <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" /> > + <ImportGroup Label="ExtensionTargets"> > + </ImportGroup> > +</Project> > \ No newline at end of file > _______________________________________________ > Boost-commit mailing list > Boost-commit(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-commit

2 1

Re: [boost] [exception] warning about non-virtual destructor - resolution?
by Hite, Christopher 30 Apr '12

30 Apr '12

This is annoying me too: boost_1_49_0/boost/checked_delete.hpp:34:5: warning: deleting object of polymorphic class type 'boost::error_info<boost::tag_original_exception_type, const std::type_info*>' which has non-virtual destructor might cause undefined behaviour [-Wdelete-non-virtual-dtor] A) easy solution /boost_1_49_0/boost/exception/detail/error_info_impl.hpp It's probably easiest to just make ~error_info_base() virtual. It doesn't cost much since there's already a virtual table. B) harder solution The other cooler C++11 alternative is declare error_info final. I tried it on gcc-4.7.0 and it works wonderfully. Since the compiler knows you can not derive a class from that type it knows a that deconstructor is complete. struct base{ virtual void foo(); }; struct derived final : base { }; //struct illegal : derived {}; // error: cannot derive from 'final' base 'derived' in derived type 'illegal' void kill(derived* d){ delete d; // no complaint } I vote for A, because you'd anyway have to detect support for final. Chris

12 48

Re: [boost] [type_traits] has_equal_to< std::vector<T> > always true_
by Frédéric Bron 30 Apr '12

30 Apr '12

> We could use <boost/detail/container_fwd.hpp> here (rather like Boost.Hash > does, which has a similar issue) and get the best of both worlds? My > concern about making it a separate header, is that it runs the risk of ADL > errors if the #includes are inconsistent across translation units. I assume > that only forward declarations are needed for the containers? This looks a very good idea. It is a pity that the standard does not provide such header as it does for iostreams (iosfwd). However, I see that <boost/detail/container_fwd.hpp> has some troubles with many compilers, in particular with g++. // GNU libstdc++ 3 // Disable forwarding for all recent versions, as the library has a // versioned namespace mode, and I don't know how to detect it. This is a major drawback but maybe we can do something for it. I see also that with the new standard, this header is now not exhaustive; we have to include all of these: * <array> - <deque> * <forward_list> - <list> - <vector> - <map> - <set> * <unordered_map> * <unordered_set> - <queue> - <stack> - <string> - <bitset> *: missing headers in <boost/detail/container_fwd.hpp> Frédéric

2 1

Exception visibility and non-GCC compilers
by Mathias Gaunard 30 Apr '12

30 Apr '12

Exceptions types need to be exported so that shared libraries work correctly. Currently, the only code I see that does this is in Boost.Exception : #if defined(__GNUC__) # if (__GNUC__ == 4 && __GNUC_MINOR__ >= 1) || (__GNUC__ > 4) # pragma GCC visibility push (default) # endif #endif ... some exception type being declared or defined #if defined(__GNUC__) # if (__GNUC__ == 4 && __GNUC_MINOR__ >= 1) || (__GNUC__ > 4) # pragma GCC visibility pop # endif #endif But shouldn't we have macros to make this work with other compilers too? I'm not sure all unix-like compilers pretend to be GCC 4.1+.

2 3

[pool] Definition of a static_pool ?
by DUPUIS Etienne 30 Apr '12

30 Apr '12

Greetings, The Boost.Pool class describes a pool of buffer, pool whose size grows as needed. This is very convenient but there usage cases where the pool should not perform any dynamic memory allocation, i.e. the maximum number of simultaneously required buffers is known at initialization. I have hence defined a simple class 'static_pool' (see below), which (i) allocate all requested buffers at initialization; (ii) fails (returns null) if more buffers are being asked for at runtime. Does such a class has its place within the Boost Pool library ? Regards, Étienne #ifndef BOOST_STATIC_POOL_HPP #define BOOST_STATIC_POOL_HPP #include <boost/pool/pool.hpp> namespace boost { template<typename UserAllocator> class static_pool : protected pool<UserAllocator> { public : // Overridden functions explicit static_pool(const size_type nrequested_size) : pool<UserAllocator>(nrequested_size, nrequested_size) { free(malloc()); } void * malloc() { return store().empty() ? NULL : store().malloc(); } public : // Inherited functions void free(void * const chunk) { return pool<UserAllocator>::free(chunk); } size_type get_requested_size() const { return pool<UserAllocator>::get_requestedSize(); } bool is_from(void * const chunk) const { return pool<UserAllocator>::is_from(chunk); } }; } #endif Ce message et toutes les pièces jointes sont confidentiels et établis à l'intention exclusive de ses destinataires. Toute modification, édition, utilisation ou diffusion non autorisée est interdite. Si vous avez reçu ce message par erreur, merci de nous en avertir immédiatement. ATEME décline toute responsabilité au titre de ce message s'il a été altéré, déformé, falsifié ou encore édité ou diffusé sans autorisation. This message and any attachments are confidential and intended solely for the addressees. Any unauthorized modification, edition, use or dissemination is prohibited. If you have received this message by mistake, please notify us immediately. ATEME decline all responsibility for this message if it has been altered, deformed, falsified or even edited or disseminated without authorization. Note: To protect against computer viruses, e-mail programs may prevent sending or receiving certain types of file attachments.

7 18

[filesystem] [system] Suddenly, dynamic linking by default
by Lars Viklund 30 Apr '12

30 Apr '12

Hello list. I have a habit of tracking trunk to find out if there's any strangeness or mistakes done on the platforms I target. A while ago I encountered some strange linking errors on some of my projects, which in the end turned out to be because for some reason, Boost.Filesystem and Boost.System now attempt to be dynamically linked by default, both symbol-decoration-wise and auto-link filename-wise. I happened to have some older shared libraries from an older trunk version lying around, so they were suddenly and unexpectedly picked up instead of my fresh static libraries. Even without my library hygiene deficiencies, the decision (which I have yet to see a rationale or announcement about) will cause a lot of problems. Why is it that System/Filesystem suddenly default to dynamic linking? Are there problems about linking statically? Why are there then static libraries built at all? Is this just some personal preference of the author that goes contrary to the general approach of Boost? Such choices have _massive_ impacts on consumers of the code, they should not be made lightly and if there is a really concrete need to do so, why is it not documented and thoroughly explained? Linking dynamically requires you to deploy the Boost DLLs to the end user, which prevents any plugin-like deployment, as they tend to require a single self-contained shared library with no dependencies, which implies linking to a static language runtime of choice. Dynamic linking of Boost means that you need to share a CRT between the project and Boost, which implies that the only CRT choice is the dynamic one, which prevents many deployment scenarios, as you have to deploy _that_ as well to the end user, either as a redistributable install or as a private deployment. This also has an impact on code size, as there is no dead-code elimination possible when the code resides in a DLL, you have to ship _all_ of the library even if you use a few convenience functions. For one of my projects (an extension to a popular music player), this would inflate its size many times for each and every download, as the software is deployed as a single ZIP archive through automatic update services. Additionally, the autolink macros to force symbol decoration and linking for a static link are undocumented in the Boost.Config table [1], which explicitly states that all libraries that can be statically linked will be statically linked. There is no mention of libraries that arbitrarily decide to go dynamic, just that some libraries are only available in dynamic form. For future reference for anyone finding this in archives, the undocumented, and in this case required, macros to force a static link and symbol decoration are: BOOST_<WHATEVER>_STATIC_LINK or BOOST_ALL_STATIC_LINK [1] http://www.boost.org/doc/libs/1_49_0/libs/config/doc/html/index.html#boost_… -- Lars Viklund | zao(a)acc.umu.se

5 6

[iostream] tests broken due to dependency on removed filesystem internals
by Jürgen Hunold 30 Apr '12

30 Apr '12

Hi, almost all Boost.Iostreams test fail with: bin.v2/libs/iostreams/test/array_test.test/gcc-4.6/debug/array_test.o In file included from ../array_test.cpp:14:0: ../detail/temp_file.hpp:16:46: fatal error: boost/filesystem/v3/operations.hpp: No such file or directory compilation terminated. The v3/ was removed recently as v2 was finally dropped. Patch to fix this attached. This gets a lot of the tests running. Okay to commit? There are some remaining failures. Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu !

3 4

[multiprecision] Looking for a review manager
by John Maddock 29 Apr '12

29 Apr '12

Just a quick line to remind/hassle you all that I'm still looking for a review manager for the multiprecision library: http://svn.boost.org/svn/boost/sandbox/big_number/libs/multiprecision/doc/h… All volunteers/victims gratefully accepted ;-) Many thanks in advance, John.

1 0

Re: [boost] Slow Bugs Tracker
by Olaf van der Spek 29 Apr '12

29 Apr '12

Hi, A few months ago there seemed to be plans to improve Trac. What's the status of those plans? Trac is still slow as hell. http://lists.boost.org/Archives/boost/2011/12/188639.php http://lists.boost.org/Archives/boost/2011/12/188937.php -- Olaf

7 44

[utility] convention inconsistencies
by lcaminiti 29 Apr '12

29 Apr '12

Hello all, I'm adding IdentityType to Boost.Utility and I have a couple of question about conventions: 1) Is there a reason why utility.hpp does not include all headers in boost/utility/? 2) Is there a reason why in the Documentation the utility sub-libraries are not named Boost.Utility/EnableIf bust just Boost.EnableIf? http://www.boost.org/doc/libs/1_49_0/ In boost/utility/ directory: addressof.hpp base_from_member.hpp binary.hpp compare_pointees.hpp declval.hpp enable_if.hpp identity_type.hpp in_place_factory.hpp result_of.hpp swap.hpp typed_in_place_factory.hpp value_init.hpp But boost/utility.hpp includes only some of those: #ifndef BOOST_UTILITY_HPP #define BOOST_UTILITY_HPP #include <boost/utility/addressof.hpp> #include <boost/utility/base_from_member.hpp> #include <boost/utility/binary.hpp> #include <boost/utility/enable_if.hpp> #include <boost/checked_delete.hpp> #include <boost/next_prior.hpp> #include <boost/noncopyable.hpp> #endif // BOOST_UTILITY_HPP Thanks. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-utility-convention-inconsistencies… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

[function] The cost of boost::function
by Michael Kochetkov 28 Apr '12

28 Apr '12

Hello, as far as I subscribed to boost mail list for a reason I have decided to share an interesting (at least for me) observation of boost::function facility I have encountered several years ago. The observation is about the cost of the solution and you probably may be interested if you use boost in your production. Let us consider the following code: #include <boost/bind.hpp> #include <boost/function.hpp> inline int g(int i) { return ++i; } int main() { // AAAAA boost::function< int (int) > f1 = boost::bind(&g, _1 ); f1(1); // BBBB boost::_bi::bind_t<int,int (*)(int),boost::_bi::list1<boost::arg<1> > > f2 = boost::bind(&g, _1 ); f2(1); // CCCC auto f3 = boost::bind(&g, _1 ); f3(1); } I have compiled it with Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 16.00.40219.01 for 80x86 the following way (maximal optimization): cl -EHsc -Ox -GL -Ob2 -Oi -Fa -IE:\Work\3dparty\boost_1_48_0 m054.cpp The resulting code for AAAA is: ; Line 10 mov eax, OFFSET ?g@@YAHH@Z ; g mov DWORD PTR $T109940[esp+60], eax mov eax, DWORD PTR $T109845[esp+64] lea ecx, DWORD PTR $T109940[esp+60] push ecx mov DWORD PTR $T109940[esp+68], eax call ?has_empty_target@function@detail@boost@@YA_NZZ ; boost::detail::function::has_empty_target add esp, 4 test al, al jne SHORT $LN20@main mov edx, DWORD PTR $T109940[esp+60] mov eax, DWORD PTR $T109940[esp+64] mov ecx, OFFSET ?stored_vtable@?1???$assign_to@V?$bind_t@HP6AHH@ZV?$list1@U?$arg@$00@boost@@ @_bi@boost@@@_bi@boost@@@?$function1@HH@boost@@AAEXV?$bind_t@HP6AHH@ZV?$list 1@U?$arg@$00@boost@@@_bi@boost@@@_bi@2@@Z@4U?$basic_vtable1@HH@function@deta il@2@B ; `boost::function1<int,int>::assign_to<boost::_bi::bind_t<int,int (__cdecl*)(int),boost::_bi::list1<boost::arg<1> > > >'::`2'::stored_vtable or ecx, 1 mov DWORD PTR _f1$[esp+68], edx mov DWORD PTR _f1$[esp+72], eax mov DWORD PTR _f1$[esp+60], ecx jmp SHORT $LN18@main $LN20@main: mov DWORD PTR _f1$[esp+60], 0 $LN18@main: ; Line 11 lea ecx, DWORD PTR _f1$[esp+60] mov DWORD PTR __$EHRec$[esp+68], 0 call ??R?$function1@HH@boost@@QBEHH@Z ; boost::function1<int,int>::operator() The resulting code for BBBB is: ; Line 15 push 1 call ?g@@YAHH@Z ; g add esp, 4 The resulting code for CCCC is: ; Line 19 push 1 call ?g@@YAHH@Z ; g add esp, 4 I have learned that personally I shall never use boost::function. You probably may want to investigate such a code bloat. Though it is probably the known and expected behavior. And I do agree that CCCC is not quite relevant here. Just for information. -- Michael Kochetkov P.S. The traditional full story for AAAA, that includes intermediate calls. Though it is not really full -- I have given up for three more calls inside the boost::function1<int,int>::operator() function. ; // AAAAA ; boost::function< int (int) > f1 = boost::bind(&g, _1 ); ; f1(1); 002661B9 mov eax,261170h 002661BE mov dword ptr [esp+4],eax 002661C2 mov eax,dword ptr [esp+8] 002661C6 lea ecx,[esp+4] 002661CA push ecx 002661CB mov dword ptr [esp+0Ch],eax 002661CF call 00261160 002661D4 add esp,4 002661D7 test al,al 002661D9 jne 002661F9 002661DB mov edx,dword ptr [esp+4] 002661DF mov eax,dword ptr [esp+8] 002661E3 mov ecx,26A028h 002661E8 or ecx,1 002661EB mov dword ptr [esp+14h],edx 002661EF mov dword ptr [esp+18h],eax 002661F3 mov dword ptr [esp+0Ch],ecx 002661F7 jmp 00266201 002661F9 mov dword ptr [esp+0Ch],0 00266201 lea ecx,[esp+0Ch] 00266205 mov dword ptr [esp+38h],0 0026620D call 002611D0 ; ?has_empty_target@function@detail@boost@@YA_NZZ ; boost::detail::function::has_empty_target 00DD1160 xor al,al 00DD1162 ret ; ??R?$function1@HH@boost@@QBEHH@Z ; boost::function1<int,int>::operator() 00DD11D0 push 0FFFFFFFFh 00DD11D2 push 0DD7810h 00DD11D7 mov eax,dword ptr fs:[00000000h] 00DD11DD push eax 00DD11DE sub esp,58h 00DD11E1 push esi 00DD11E2 mov eax,dword ptr ds:[00DDB038h] 00DD11E7 xor eax,esp 00DD11E9 push eax 00DD11EA lea eax,[esp+60h] 00DD11EE mov dword ptr fs:[00000000h],eax 00DD11F4 mov eax,dword ptr [ecx] 00DD11F6 test eax,eax 00DD11F8 jne 00DD1248 00DD11FA lea eax,[esp+0Ch] 00DD11FE push eax 00DD11FF lea ecx,[esp+14h] 00DD1203 mov dword ptr [esp+10h],0DDA008h 00DD120B call 00DD187F 00DD1210 mov dword ptr [esp+10h],0DDA058h 00DD1218 lea eax,[esp+10h] 00DD121C lea esi,[esp+1Ch] 00DD1220 mov dword ptr [esp+68h],0 00DD1228 call 00DD1600 00DD122D lea esi,[esp+3Ch] 00DD1231 mov byte ptr [esp+68h],1 00DD1236 call 00DD1640 00DD123B push 0DDA7A8h 00DD1240 mov ecx,esi 00DD1242 push ecx 00DD1243 call 00DD23CA 00DD1248 and eax,0FFFFFFFEh 00DD124B mov edx,dword ptr [eax+4] 00DD124E add ecx,8 00DD1251 push 1 00DD1253 push ecx 00DD1254 call edx 00DD1256 add esp,8 00DD1259 mov ecx,dword ptr [esp+60h] 00DD125D mov dword ptr fs:[0],ecx 00DD1264 pop ecx 00DD1265 pop esi 00DD1266 add esp,64h 00DD1269 ret

6 8

[1.50] Is there a schedule?
by John Maddock 27 Apr '12

27 Apr '12

OK, so it's too soon at present anyway, but should there be some sort of schedule on the calendar so we all know where we are? Cheers, John.

2 1

Boost.Variant known_get
by David Sankel 27 Apr '12

27 Apr '12

I noticed the detail::known_get function in boost variant. Is there any reason this function, which would be useful in high performance scenarios, is not exposed as part of the rest of the interface? David -- David Sankel Sankel Software www.sankelsoftware.com 585 617 4748 (Office)

1 0

Boost.units autoscaling doesn't seem to work with the measurement type.
by Paul A. Bristow 27 Apr '12

27 Apr '12

I have previously used Boost.Units and autoscaled using << engineering_prefix nicely, and this works as expected for quantity of type double. but it seems that code that I believe worked previously does not autoscale when using a *user-defined type*, like the measurement example in kitchen_sink.cpp. To confirm this, I have added after //[kitchen_sink_snippet_8 in kitchen_sink.cpp at line 445 a measurement quantity where the length is long enough to trigger conversion to km, thus quantity<length,measurement<double> > biglen(measurement<double>(12345.0,123.0)*meters); std::cout << "Biglen autoscaled "<< engineering_prefix << biglen << std::endl; but I get a *unscaled* value :-( Biglen autoscaled 12345(+/-123) m rather than the expected conversion to kilometers 12.345(+/- 0.123) km Am I doing something wrong, or has something changed? Thanks Paul PS Using Microsoft Visual Studio 2010 Version 10.0.40219.1 SP1Rel Microsoft .NET Framework Version 4.0.30319 SP1Rel Boost-trunk (Boost.1.49) --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 1

Re: [boost] [decimal] Proposed portable implementation of std::decimal
by Josh Quigley 27 Apr '12

27 Apr '12

As previously mentioned, the plan is to wire up existing (C interface) packages to a C++ std::decimal, raising licensing issues around the 3rd party code. I don't believe there is an issue, the licences are very short and read like plain English to me. Also, gcc includes both of these in it's implementation, and distributes under an open licence. I've copy-pasted below the relevant bits out of the EULAs. If anyone thinks there might be an issue, please let me know. INTEL EULA Copyright (c) 2011, Intel Corp. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, his list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Intel Corporation nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. IBM Licence Copyright (c) 1995-2012 International Business Machines Corporation and others All rights reserved. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, provided that the above copyright notice(s) and this permission notice appear in all copies of the Software and that both the above copyright notice(s) and this permission notice appear in supporting documentation.

3 3

Variadic to Head/Tail TMP List
by Fernando Pelliccioni 27 Apr '12

27 Apr '12

Hi, Is this piece of code useful ? http://pastebin.com/tRrqVHTw The purpose is to tranform code like the following: typedef cons<int, cons<float, cons<char, cons<string>>>> t0; // fusion::cons or similar data structures in typedef chain_generator<cons, nil> cons_gen; typedef cons_gen::gen<int, float, char, std::string>::type t1; I don't know if there is something similar in a library. I think it could be useful. Compiler tests: GCC 4.7 -> Compiler Error GCC 4.7.1 & Trunk -> OK http://gcc.gnu.org/bugzilla/show_bug.cgi?id=53108 Clang Trunk -> OK MSVC 11 beta -> has no Variadic Templates Regards, FP.

2 2

Boost.ntree_container (bi_tree, quad_tree, oct_tree, etc ptr containers) Is there any interest in this?
by Dan Walters 27 Apr '12

27 Apr '12

Hi all, I am proposing adding spacial containers for efficiently storing and accessing data of a spacial nature in fixed size trees. n-tree data structures would be useful where data relates to a 1D, 2D or 3D location, providing n-array searching of an n-array volume. N-tree data structures are commonly used in 3d applications, and are rarely particularly specialized. Their use is fundamental however they are frequently written by application programmers, due to a lack of free open source implementations (to the limit of my research). Their sophistication, like any container, is slim but easy to get wrong and beyond the ability and time contraints that should be assumed of the application programmer. It is a flexible and standard enough concept that a single implementation can be expected to meet a majority of requirements. I think there is the opportunity to create a solid implementation of templated n-tree pointer containers. The ntree container would be a tree representing an narray of elements with all dimensions being the same and being a power of two. The tree is memory efficient where areas within the volume are not occupied, and so "branches" and "leaves" are not created. The tree is well suited to geometrical operations such as ray picking or plane culling of the volume. An n-tree structure could be used in the place of any sparely populated n dimensional array where memory saving is the objective. The existing libraries I have found are licensed under GNU licenses. A ntree container should implement: get reset overloaded (array style) operators Optional implementations: views - a subset object representing an area or volume within the tree for accelerated access to a group of leaves that are positioned near to each other raycasting plane culling (getting leaves within a set of planes) etc. Is there interest in such a library? Many thanks, Dan

7 7

[interprocess] ppc compile error
by Tim Blechmann 27 Apr '12

27 Apr '12

hi all, one of my users reported the following compile error when building my application for ppc/osx(10.5): /var/folders/+D/+DUo7PxAEgCfHTatXKIeMU+++TI/-Tmp-//ccPubDFs.s:5566:Unknown pseudo-op: .subsection /var/folders/+D/+DUo7PxAEgCfHTatXKIeMU+++TI/-Tmp-//ccPubDFs.s:5566:Rest of line ignored. 1st junk character valued 50 (2). /var/folders/+D/+DUo7PxAEgCfHTatXKIeMU+++TI/-Tmp-//ccPubDFs.s:5569:Unknown pseudo-op: .previous the specific part of the assembly is: -- 4010 L686: 4011 sync 4012 lwarx r8,0,r11 4013 cmpw r8, r3 4014 bne- 2f 4015 stwcx. r9,0,r11 4016 bne- 2f 4017 addi r2,0,1 4018 1:.subsection 2 4019 2: addi r2,0,0 4020 b 1b 4021 .previous 4022 4023 cmpwi cr7,r2,0 4024 mr r3,r8 4025 beq cr7,L686 4026 stw r8,20(r10) 4027 mulli r3,r8,12 4028 add r3,r3,r10 4029 addi r3,r3,28 4030 bl L__ZNK5boost12interprocess10offset_ptrIfimLm0EE14to_raw_pointerEv$stub 4031 addi r1,r1,96 4032 stw r3,4(r30) 4033 lwz r0,8(r1) 4034 nop 4035 lmw r30,-8(r1) 4036 mtlr r0 4037 blr -- this error occurs with boost-1.49.0 ... is this a known issue or some workaround? thanks, tim

2 2

[OT][RFC] standardized compile-time reflection
by Matus Chochlik 27 Apr '12

27 Apr '12

Dear members of the Boost community, (Sorry for being slightly off-topic here) In the last couple or years I've been working on the design and implementation of portable reflection in C++. I've written several reflection libraries (that are hopefuly gradually improving). For the latest incarnation see the Mirror reflection utilities written in C++11: http://kifri.fri.uniza.sk/~chochlik/mirror-lib/html/ Recently I've learned that the Standardization Committee has issued a call for proposals for additions to the standard to the wider community, so I've decided to write down my own ideas on how compile-time reflection should look like in C++. Afterwards I discussed it with several people including Dean Michael Berris, who is the co-author of n3340 "Rich pointers" and is also interested in adding run-time (and static) reflection to C++. We've decided that we merge the ideas from my paper into his proposal (which has not happened yet and will probably take a while). However, n3340 deals with more than just static reflection, so I would like to start a discussion and ask the members of the Boost community for their opinions about the compile-time-specific parts that are described in the following paper, before writing the final proposal: http://kifri.fri.uniza.sk/~chochlik/jtc1_sc22_wg21/std_cpp_refl.pdf It is a bit lengthy so you can skip sections 1., 2. and probably also section 3., if you are knowledgeable about the domain. The most important parts are: the whole section 4. "Technical specification" and also 5., 6. and 7. Section 7. "Unresolved issues" lists several important things that need to be worked out and 3. has some rationale for the design decisions. Note that the paper has the basic structure of a standard proposal, but is not written in standardese nor is it "polished" (since it will be merged into another paper and probably re-worded). It is my first attempt at a standard proposal and I'm not a member of the Committee so please bear with me :-). Dean and I have also independently decided to write proof-of-concept implementations - compiler extensions for clang and gcc respectivelly. The sources for the gcc plugin are hosted here: https://github.com/matus-chochlik/std_cpp_refl It's in a very early stage, but if someone has some tips or hints they'll be welcome. Thanks in advance for any (negative or positive) feedback. Best regards, Matus Chochlik

6 19

[assign] How to create a container wrapper for tuple_list_of
by Robert Dailey 26 Apr '12

26 Apr '12

I have a vector of boost::tuple objects that is a member variable in a class of mine. I want to be able to create an instance of my wrapper class and construct it off of a tuple_list_of(), and essentially forward those values to the container itself. I haven't seen a way to do this yet. An example is below. Note that my constructor in the class was my attempt to get this working, but instead it will not compile. For some reason boost.assign thinks that the EnumErrorInfo class is the container. template<class T> class EnumErrorInfo { public: typedef boost::tuple<T, char const*, char const*> Tuple; typedef std::vector<Tuple> TupleVector; EnumErrorInfo( TupleVector const& assignment ) : m_errorInfo( assignment ) {} Tuple const& getErrorInfo( T error_code ) { TupleVector::const_iterator it = std::find_if( m_errorInfo.begin(), m_errorInfo.end(), MatchErrorCodePred( error_code ) ); if( it != m_errorInfo.end() ) { return *it; } static Tuple const unknown_info( error_code, "????", "No error info available for this code" ); return unknown_info; } private: class MatchErrorCodePred { public: MatchErrorCodePred( T error_code ) : m_errorCode( error_code ) {} bool operator() ( Tuple const& t ) { return t.get<0>() == m_errorCode; } private: DomInterfaceErrors m_errorCode; }; TupleVector m_errorInfo; }; And here is how I'd like to initialize the class: EnumErrorInfo<DomInterfaceErrors> g_errorInfo = tuple_list_of ( GDE_OK, "GDE_OK", "DBL: Opeartion successfully completed" ) ( GDE_GDD_DIRUSERS, "GDE_GDD_DIRUSERS", "AQX: Unable to get directory users." ) ;

2 1

[interprocess] Sharing shared_memory_object across processes?
by Joseph Van Riper 26 Apr '12

26 Apr '12

I either do not understand what I am seeing, or I may have stumbled upon a bug, at least in a Windows environment. Or, of course, my expectations may be unrealistic. The short of this is that when I create a boost::interprocess::shared_memory_object that isn't removed for the duration of the program's run, the reading program's run can't seem to open the shared_memory_object, despite creating a boost::interprocess::permissions object and calling 'set_unrestricted()'. I get an exception indicating that access is denied. If nothing else, the code I've provided is an interprocess version of the classic read-writer's problem, second version (writers preferred). It may be of use to someone with a little cleaning. Environment: Compiler: MSVC++ 10 OS: Win 7 Pro, 64-bit. Steps to reproduce: 1. In VC++ 10, create an empty command-line project. 2. Replace contents of your .cpp with the code in this e-mail. 3. Compile. 4. Run the executable twice, first with an argument, next without. Expected results: The executable run without arguments indicates how much data was transferred on the same line. Actual results: The executable run without arguments complains that access is denied. NOTE: If you #define BOLD_NEW_TEST and recompile, this program runs according to expectations. This causes the objects to be compiled in a way where the shared_memory_objects only last for as long as it takes to write or read the data. I suspect this shouldn't be necessary, but perhaps I'm wrong. The error is especially peculiar to me, as I can open the file itself with a text editor. It doesn't seem like it should be denied. - Trey

2 3

[result_of] Make `cpp0x_result_of_impl` public
by Michel Morin 26 Apr '12

26 Apr '12

There are two implementations of boost::result_of: a TR1-style implementation and a decltype-based implementation. While the TR1-style implementation has a public interface `boost::tr1_result_of`, decltype-based one doesn't have a public interface. By defining BOOST_RESULT_OF_USE_DECLTYPE, boost::result_of use decltype-based implementation. But this is not always a viable solution, since this breaks some Boost libraries. So how about adding `boost::cxx11_result_of` as public interface of the decltype-based implementation? Attached a patch to add `boost::cxx11_result_of`. (This patch also changes the name of `cpp0x_result_of_impl` to `cxx11_result_of_impl` to reflect the recent discussion on the cpp/cxx naming.) P.S. Is it worth trying to use this `boost::cxx11_result_of` in `boost::transform_iterator` code on trunk? Regards, Michel

7 40

[result_of] Regression: compilation errors on C++03 compilers when defining BOOST_RESULT_OF_USE_DECLTYPE
by Michel Morin 25 Apr '12

25 Apr '12

If we define BOOST_RESULT_OF_USE_DECLTYPE, boost::result_of tries to use decltype-based implementation even on C++03 compilers. This causes compilation errors and it is a regression on C++03 compilers. Is it intentional change? Regards, Michel

5 6

[utility][assert]
by Yechezkel Mett 25 Apr '12

25 Apr '12

I noticed that when BOOST_ENABLE_ASSERT_HANDLER is defined, BOOST_ASSERT calls boost::assertion_failed whether or not NDEBUG is defined, but BOOST_ASSERT_MSG calls boost::assertion_failed_msg only if NDEBUG is not defined. Is there a reason for this difference?

1 0

[exception] applying patch for issue #6349
by David Deakins 24 Apr '12

24 Apr '12

Hi Emil, Since the issue in item #6349 is disrupting the Windows CE test results for many libraries, do you mind if I go ahead and apply the patch attached to that item? Thanks, -Dave

2 1

[Iterator] Fixing the default reference type of transform_iterator (#5127)
by Michel Morin 24 Apr '12

24 Apr '12

The default reference type of transform_iterator should be boost::result_of<const UnaryFunction(Iterator::reference)> rather than boost::result_of<UnaryFunction(Iterator::reference)> since the dereference operator of transform_iterator is a const member function. Ticket #5127 describes this bug https://svn.boost.org/trac/boost/ticket/5127 and the ticket has a patch. Jeff, could you apply the patch, if it looks OK? Regards, Michel

3 7

[contract] assertion requirements as meta-functions or not?
by lcaminiti 24 Apr '12

24 Apr '12

Hello all, Boost.Contract allows to specify "assertion requirements": /assertion-condition/, requires /assertion-requirement/ If the requirement is not met then the assertion condition is neither compiled nor checked at run-time. Question: Shall the assertion-requirement be a nullary boolean meta-function or just a static boolean value? For example: CONTRACT_FUNCTION( template( typename T ) requires( boost::LessThanComparable<T> ) (T const&) (min) ( (T const&) x, (T const&) y ) postcondition( auto result = return, x < y ? result == x : result == y, requires boost::has_equal_to<T>::value // static boolean ) ) { return x < y ? x : y; // OK: T is less than comparable `<`. } For now, the assertion requirement is a static boolean value so it can be more easily manipulated (using !, &&, ||, etc instead of mpl::not, mpl::and, mpl::or, etc). However, is there any strong reason for marking the assertion requirement a nullary boolean meta-function instead like the following code? x < y ? result == x : result == y, requires boost::has_equal_to<T> // meta-function Thanks. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-contract-assertion-requirements-as… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 5

[Fusion] Patch: fixing some test failures on clang
by Michel Morin 24 Apr '12

24 Apr '12

The following tests of Boost.Fusion fail on clang trunk in a C++11 mode with libc++. * io.test * deque_construction.test * deque_misc.test * std_tuple_iterator.test * invoke.test Attached a patch for fixing two failures (io.test and std_tuple_iterator.test) of them. Regards, Michel

2 1

Search a vector of tuples?
by Robert Dailey 23 Apr '12

23 Apr '12

Is there a method in the boost library to iterate a vector of boost::tuple objects, comparing the 1st element in the tuple of each tuple to a value that I specify? My tuple is setup like so: typedef boost::tuple<int, int, char const*> Tuple; typedef std::vector<Tuple> ErrorStringMap; ErrorStringMap mystrings = tuple_list_of (10, "10", "ten") (20, "20", "twenty") (30, "30", "thirty") (10, "10", "ten"); I want to search the vector of tuples and do something with every tuple that has the number 10 as the first element in the tuple.

7 15

[concept_check] addable
by lcaminiti 23 Apr '12

23 Apr '12

Hello all, Does this Addable concept definition make sense to you? Is there any error? #include <boost/concept_check.hpp> template<typename T> struct Addable { // User-defined concept. BOOST_CONCEPT_USAGE(Addable) { return_type(x + y); // Check addition `T operator+(T x, T y)`. } private: T x; T y; void return_type(T const&); // Used to check addition returns type `T`. }; It's not making Sun's linker happy: "/opt/sunstudio12.1/bin/CC" -g -library=stlport4 -features=tmplife -features=tmplrefstatic -library=stlport4 -m64 -KPIC -o "/scratch2/kbelco/boost/results/boost/bin.v2/libs/local_function/test/typeof_seq.test/sun-5.10/debug/address-model-64/stdlib-sun-stlport/typeof_seq" "/scratch2/kbelco/boost/results/boost/bin.v2/libs/local_function/test/typeof_seq.test/sun-5.10/debug/address-model-64/stdlib-sun-stlport/typeof_seq.o" -Bdynamic -lrt -Bstatic -Bdynamic Undefined???first referenced symbol ??? in file void Addable<int>::return_type(const int&) /scratch2/kbelco/boost/results/boost/bin.v2/libs/local_function/test/typeof_seq.test/sun-5.10/debug/address-model-64/stdlib-sun-stlport/typeof_seq.o ld: fatal: Symbol referencing errors. No output written to /scratch2/kbelco/boost/results/boost/bin.v2/libs/local_function/test/typeof_seq.test/sun-5.10/debug/address-model-64/stdlib-sun-stlport/typeof_seq But the error might also be somewhere else in the program that checks the concept, I'm still debugging... Thanks a lot. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-concept-check-addable-tp4572138p45… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 5

[filesystem] #6521 Directory listing using C++11 range-based for loops
by Beman Dawes 23 Apr '12

23 Apr '12

Ticket #6521 requests adding: class directory{ path p_; public: inline directory(path p):p_(p){} directory_iterator begin(){ return directory_iterator(p_); } directory_iterator end(){ return directory_iterator(); } }; so that that a range-based for loop can be used: for (auto itr : directory(".")) { cout << itr.path() << endl; } The above works as expected on GCC 4.6 and VC++ 11 beta. Is that the best way for filesystem directory iteration to support range-based for? Provide a class directory_tree for recursive iteration? --Beman

4 13

1.50 release calendar
by Vicente J. Botet Escriba 23 Apr '12

23 Apr '12

Hi, I would like to know the 1.50 release calendar so that I can plan with Anthony Williams the merge to release of Boost.Thread of version 3. Which is the last day to merge to release a big change? Thanks for all, Vicente

3 3

[range] Question about adapted range safety given C++11 auto
by Beman Dawes 22 Apr '12

22 Apr '12

http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3350.html claims: "Boost's range library focuses on defining a set of Range concepts that allow Containers to be Ranges. Because Containers are heavy-weight, this forces Boost to use references for all of their uses of Ranges, including Ranges that are captured by Range Adapters. This worked fine in C++98, where users couldn't name the types of the Range Adapters in order to declare local variables, but with C++11's auto keyword, users can now save adapted ranges. Since Boost's adapted ranges capture references to their arguments, which can be temporaries, this is no longer a safe design." Is this claim correct? If so, what's the real-world impact? --Beman

4 3

[context] [windows] Intel C++ and GCC Support?
by Joshua Boyce 22 Apr '12

22 Apr '12

I notice that Boost.Context only seems to support MSVC under Windows, and attempts to compile it under GCC or Intel C++ will fail because it's not correctly assembling fcontext_i386_ms_pe_masm/fcontext_x86_64_ms_pe_masm. e.g. Under Intel I get: intel-win.compile.asm > C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\intel-win\debug\address-model-64\architecture-x86\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.obj '-c' is not recognized as an internal or external command, operable program or batch file. > -c -Zp4 -Cp -Cx -DBOOST_ALL_NO_LIB=1 -DWINVER=_WIN32_WINNT_VISTA > -D_WIN32_WINNT=_WIN32_WINNT_VISTA -DBOOST_ALL_NO_LIB=1 > -DWINVER=_WIN32_WINNT_VISTA -D_WIN32_WINNT=_WIN32_WINNT_VISTA /Zi /Zd /W3 > -Fo > "C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\intel-win\debug\address-model-64\architecture-x86\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.obj" > "C:\Users\Josh\Documents\code\boost-trunk\libs\context\src\asm\fcontext_x86_64_ms_pe_masm.asm" > ...failed intel-win.compile.asm > C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\intel-win\debug\address-model-64\architecture-x86\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.obj... Whilst under GCC (via MinGW-w64) I get: Jamfile</C:/Users/Josh/Documents/code/boost-trunk/libs/context/build>.masm64 C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\gcc-mingw-4.7.0\release\address-model-64\architecture-x86\debug-symbols-on\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.o 'ml64' is not recognized as an internal or external command, operable program or batch file. ml64 /c /Fo"C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\gcc-mingw-4.7.0\release\address-model-64\architecture-x86\debug-symbols-on\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.o" "C:\Users\Josh\Documents\code\boost-trunk\libs\context\src\asm\fcontext_x86_64_ms_pe_masm.asm" ...failed Jamfile</C:/Users/Josh/Documents/code/boost-trunk/libs/context/build>.masm64 C:\Users\Josh\Documents\code\boost-trunk\bin.v2\libs\context\build\gcc-mingw-4.7.0\release\address-model-64\architecture-x86\debug-symbols-on\link-static\runtime-link-static\threading-multi\asm\fcontext_x86_64_ms_pe_masm.o... This occurs for both 64-bit and 32-bit compilation. Is this a known issue with a planned fix? Or is MSVC the only compiler supported under Windows? (I know it's a pain because GCC afaik uses a different assembly syntax... Not sure about Intel.) As an aside, Boost.Context does not yet seem to have an entry in Trac. Thanks.

3 9

[Proto] Errors due to narrowing conversions in matches.hpp
by Michel Morin 22 Apr '12

22 Apr '12

Some tests of Boost.Phoenix fail on clang trunk in a C++11 mode due to narrowing conversions of non-type template arguments, which are prohibited in C++11. Specifically, the narrowing conversions occur at Line 354 and 363 in boost/proto/matches.hpp. They can be simply resolved using `static_cast<bool>(...)`. Regards, Michel

2 3

[thread] Do we need thread_group now?
by Vicente J. Botet Escriba 21 Apr '12

21 Apr '12

Hi, now that we have Boost.Container and Boost.Thread (trunk) uses Boost.Move, boost::thread_group has less sense. I was thinking on replacing it by some generic algorithms as join_all, interrupt_all that work with generic containers so that the user can use the best containers adapted to her own needs. typedef boost::container::vector<boost::thread> thread_vector; { thread_vector threads; for (int i = 0; i < 10; ++i) { threads.push_back(boost::thread(&increment_count)); } join_all(threads); } { thread_vector threads; for (int i = 0; i < 10; ++i) { threads.push_back(boost::thread(&increment_count)); } interrupt_all(threads); } Could boost::thread_group be deprecated once these generic algorithm are released? Or, is there something really useful on the thread_group class that needs to be preserved or even improved? Best, Vicente

7 13

[iterator] iterator-category logic
by Jeffrey Lee Hellrung, Jr. 21 Apr '12

21 Apr '12

I'd like to ask Boosters' opinions on this. boost::iterator_facade determines the iterator_category via the logic outlined in http://www.boost.org/doc/libs/1_49_0/libs/iterator/doc/iterator_facade.html… In particular, if (a) CategoryOrTraversal is a Boost traversal tag; and (b) Reference is not a "real" C++ reference (i.e., a proxy reference); then iterator_category is at best convertible to std::input_iterator_tag. This ends up being surprising to users who use boost::iterator_adaptor (note that, by default, iterator_adaptor passes the Boost traversal tag of the adapted iterator down to iterator_facade) to adapt, say, a pointer, define their adapted iterator to return a proxy reference, and find out that their standard library functions don't recognize their adapted iterator as a random access iterator. The usual workaround tends to be to just override the iterator_facade logic yourself to use a more refined iterator_category and hope your standard library functions don't barf. For better or for worse, the present logic in iterator_facade is strictly (more or less) correct given the C++03 iterator requirements, but I just looked up the N3290 draft of C++11 and it appears that any requirements that *i return a real reference have been dropped, thus allowing for proxy references in all iterator categories. (a) Am I interpreting the C++11 iterator requirements correctly? (b) If so, should iterator_facade's iterator-category logic be reworked to account for the new requirements? (c) If so, how should it be determined when to use the C++03 requirements and when to use the C++11 requirements? Thanks, - Jeff

3 3

[review schedule] Broken link to Coroutine documentation
by Mateusz Loskot 21 Apr '12

21 Apr '12

Hi, There is Coroutine library by Oliver Kowalke proposed for review. The link to Documentation points to...the review schedule at http://www.boost.org/community/review_schedule.html Is there any chance to have it fixed? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

2 2

Boost.Variant swap performance
by David Sankel 21 Apr '12

21 Apr '12

It seems as though Boost.Variant doesn't take advantage of pointer swaps when it comes to use of recursive variants. In the attached file I declare a simple int list type and include two implementations of a function that adds an int to the front of a list. The first implementation, I would expect to be O(N) on the size of the list and the second implementation to be O(1) on the size of the list. Unfortunately, the output I get is: unoptimized ilPushFront: 129 unoptimized ilPushFront w/ larger list: 363 optimized ilPushFront: 211 optimized ilPushFront w/ larger list: 653 Any ideas why this might be happening? David -- David Sankel Sankel Software www.sankelsoftware.com 585 617 4748 (Office)

2 3

[shared_ptr] [intel] Compile Errors with '#include <atomic>'
by Joshua Boyce 20 Apr '12

20 Apr '12

Intel's standard library headers are disgusting and are committing the cardinal sin of defining macros which may interfere with user code (which in this case they have). The problem is simple to repro: #include <atomic> #include <boost/shared_ptr> int main() { } The problem has been reported previously, but even in the latest version of the compiler (created and released well after the bug report) the problem seems to remain: http://software.intel.com/en-us/forums/showpost.php?p=160114 Here is a patch which I have used locally to successfully work around the problem, but I get the feeling that there is a better solution I'm overlooking... http://dl.dropbox.com/u/74751/cpp/boost/patches/boost-shared_ptr-intel-fix-… Has anyone else run into this problem who has come up with a better solution? Alternatively, if this is as good as it's going to get (maybe using a BOOST_WORKAROUND would be better so it can be disabled when/if the issue is fixed), would anybody be able to apply this to trunk? Thanks.

1 1

Re: [boost] [decimal] Proposed portable implementation of std::decimal
by Josh Quigley 20 Apr '12

20 Apr '12

> >> I believe that a portable implementation of the proposed std::decimal > >> (eg Decimal Types for C++ would be useful. > Of course this is definitely something Boost needs in its tool chest. > But to 'sell' it to Boost, I think it is important to relate to commercial offerings and > previous proposals to WG21 C++ Standards. > > So say how and why you have done it differently? > > Paul I do not intend to create an implementation - I am simply wiring up the existing DecNumber, Intel Decimal Float implementations (both IEEE compliant) to the std::decimal interface. I believe the associated licences are compatible with boost being able to distribute this, but that would be the first thing to be checked. I have no idea how this differs from any other offering (apart from saying I hope it gives identical results to gcc's standard decimal) apart from pointing out I haven't found any C++ wrappers for the decimal floats that I would use 'off the shelf' in the same way I use boost libraries. I'm working on a somewhat blind assumption that if gcc is implementing this interface, it is probably the closest thing to what will eventually end up in the standard. If there are other implementations that do roughly the same thing, I'd be really interested to take a look, as I've no desire to reinvent the wheel!

2 1

Release branch merge
by Dave Abrahams 20 Apr '12

20 Apr '12

Since we're within the 7-week window, I'm asking permission to patch the release branch per the enclosed: -- Dave Abrahams BoostPro Computing http://www.boostpro.com

3 2

[coroutine][context] coroutine_specific_ptr proposal
by Taylor Goodhart 19 Apr '12

19 Apr '12

With the context/coroutine library making great progress, in my mind it is only natural to wonder whether something analogous to thread local storage could be implemented for coroutines. I would propose using the existing thread_specific_ptr as a starting point. As for an initial design proposal, it seems to me like one could have a single static atomic integer in the constructor of coroutine_specific_ptr that is incremented for each new instance. This will allow each instance to know their index, and to also know the total number of pointers. Then when a new coroutine is created, a block of pointers of this size would be created and placed before stack memory. If a coroutine were to try to dereference a coroutine_specific_ptr then the index into this block would be looked up and if NULL, create a new instance on the heap. If not NULL, it would simply return the previously created value. Comments and feedback would be appreciated. If this seems like something people might use I'd be willing to take a crack at implementing it, provided Oliver's blessing. -Taylor Goodhart

1 0

[decimal] Proposed portable implementation of std::decimal
by Josh Quigley 19 Apr '12

19 Apr '12

Hi, I believe that a portable implementation of the proposed std::decimal (eg Decimal Types for C++ <http://tiny.cc/63ovcw> for older draft) would be useful. Since the standard specifies a class, a library should be able to achieve close to full compliance. At the moment I believe only gcc supports this. I'm currently working on this for my own purposes, and if there is sufficient interest (and guidance!) might try to expand it into a draft submission. Roadmap: 1. Implement std::decimal (see gcc version, for example) using Intel FP Decimal, DecNumber, native gcc, (maybe .NET Decimal depending on how close it is to complying with interface) 2. Some preprocessor trickery to make it easy to compile all implementation as separate classes (eg extension::decimal::Intel::decimal64), or a given implementation as the 'one true' class (extension::decimal::decimal64). This means unit tests and performance tests can be written using one implementation against another, and for production code, a given implementation can be used under the hood depending on the architecture. 3. Create performance and standards-compliance benchmarks for implementations. 4. Choose default implementation for each supported architecture, based on benchmarks. The above is a personal roadmap, of which a subset may be of interest to the boost community. Please let me know if you think this would be of value, and in particular if you would like to be involved in creating / testing / using this. Regards, Josh.

4 3

Google Groups
by Mark Snelling 19 Apr '12

19 Apr '12

Hi, Has anyone noticed that the Google Groups feeds of both boost-users and boost-devel have stopped updating? There was this posting to the Boost devel archive on the 18th regarding message bounces https://groups.google.com/forum/?fromgroups#!topic/boost-devel-archive/Ip24… Mark.

1 0

Re: [boost] [decimal] Proposed portable implementation of std::decimal
by Josh Quigley 19 Apr '12

19 Apr '12

Thanks for link to more recent draft. I've finished a rough implementation using the Intel lib, and am currently working on unit tests to at least cover the std::decimal interface. What is the preferred way to share this (when ready)? Josh.

1 0

[Serialization] How to force an archive to store true_type even if it is this_type?
by nico 18 Apr '12

18 Apr '12

Hello. When we serialize a polymorphic object, an archive stores the information about true_type (i.e. the concrete type of an object) only if it is not equal to this_type (i.e. the type of the serialized object). I.e. : the type of the serialized object is stored only if it is serialized from a base class. How can I force the archive to always store the type? Let's illustrate with a sample, I'm not sure the above text is so obvious...: Let's have 2 classes serializable: class Base { ... }; class Leaf : public Base { ... }; If I do : std::stringstream ios(std::ios_base::binary | std::ios_base::out | std::ios_base::in); * Base** b = new *Leaf*(); boost::archive::text_oarchive ar(ios); ar & b; Then the archive contains: 22 serialization::archive 9 0 4 *Leaf* 1 0 0 0 0 0 0 0 0 It contains the Leaf concrete type information. However if I do : * Leaf** b = new *Leaf*(); boost::archive::text_oarchive ar(ios); ar & b; Then the archive contains: 22 serialization::archive 9 0 1 0 0 0 0 0 0 0 0 It doesn't contain Lef type info. How can I produce an archive WITH the true_type all the type? I search 2 ways: - calling a method of archive type (register_type, save_pointer, ...) unsuccessfully - directly change the boost/archive/detail/oserializer.hpp file: in struct polymorphic, in function template<class T> static void save(Archive &ar, T & t) I comment out if(*this_type == *true_type){ const basic_pointer_oserializer * bpos = register_type(ar, t); ar.save_pointer(vp, bpos); return; } unsuccessfully. Thank you for help. Nicolas. PS : a word about why I'm trying to do that. When the true_type is "registered" (I'm not sure register is the right word), we can deserialize the object to any base class. Exemple: SERIALIZATION: Leaf* leaf = new Leaf(); ar & leaf; SERIALIZATION: Base* b = 0; ar & b; // would work only if Leaf has been saved in the archive as true_type For tools in a multi-team project, it' powerfull : data for tests has been serialized by a team, and the other team can deserialize, let's say an image, to the interface class IImage without asking: what was the true_tyep : an Image3D, an AImage2D, an Image2DRGB, an Image2DRAW, and so on.

2 1

[disjoint_sets] 1.49.0 docs out-of-date? pending?
by Jeffrey Lee Hellrung, Jr. 18 Apr '12

18 Apr '12

I noticed that http://www.boost.org/doc/libs/1_49_0/libs/disjoint_sets/disjoint_sets.html references boost/disjoint_sets.hpp but, AFAICS, no such file exists; however, clicking on the file nonetheless redirects to boost/pending/disjoint_sets.hpp which presumably is the intended reference. So, aside from what looks like a slight error in the present disjoint_sets docs, what is the purpose of this pending directory? I had never noticed it before and I don't remember stumbling upon a reference to it until now. Looks like it contains a hodgepodge of miscellaneous headers... Thanks, - Jeff

4 4

[test] Am I supposed to be able to use std::wstring in BOOST_CHECK_EQUAL?
by Michael Kochetkov 18 Apr '12

18 Apr '12

Hello, Am I supposed to be able to use std::wstring in BOOST_CHECK_EQUAL? I.e. std::wstring s1,s2; BOOST_CHECK_EQUAL(s1,s2); -- Michael Kochetkov

6 7

regression test link broken?
by lcaminiti 18 Apr '12

18 Apr '12

Hello all, Are the regression tests broken? When I go to: http://www.boost.org/development/tests/trunk/developer/summary.html I get: Error extracting file: The specified zipfile was not found. Same for both trunk and release tests. I hope it wasn't me ;) --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-regression-test-link-broken-tp4565… Sent from the Boost - Dev mailing list archive at Nabble.com.

5 6

[type_traits][exception][interlocked][smart_ptr] Intel XE 2011 SP1 compiler warnings
by Beman Dawes 18 Apr '12

18 Apr '12

Compiling libs/test/src/execution_monitor.cpp is producing a lot of warnings from the Intel XE 2011 SP1 compiler for Windows: [type_traits] ..\..\..\boost/type_traits/detail/is_mem_fun_pointer_tester.hpp(74-2608): remark #693: calling convention specified here is ignored yes_type is_mem_fun_pointer_tester(R (__stdcall T::*const volatile*)( ...)); with the error marker under the start of __stdcall. There are about a gazillion lines with the same error. [exception] ..\..\..\boost/exception/exception.hpp(258-260): remark #367: duplicate friend declaration friend struct exception_detail::get_info<throw_function>; [interlocked] ..\..\..\boost/detail/interlocked.hpp(79-83): warning #1879: unimplemented pragma ignored # pragma intrinsic( _InterlockedIncrement ) [smart_ptr] ..\..\..\boost/smart_ptr/detail/yield_k.hpp(33): warning #1879: unimplemented pragma ignored #pragma intrinsic( _mm_pause ) It would be nice to clear these warnings. Thanks, --Beman

1 0

[math] Numeric constants docs out of date?
by Beman Dawes 17 Apr '12

17 Apr '12

The docs for Numeric Constants seems out-of-date compared to the <boost/math/constants/constants.hpp> header. See http://www.boost.org/doc/libs/1_49_0/libs/math/doc/sf_and_dist/html/math_to… For example, the docs list 15 constants, but the header supplies 65 or so constants. Beyond simply missing some functions, the description is so scanty it looks like it may be for a much less capable older version of the header. Am I missing something? --Beman

5 8

Re: [boost] [Boost-commit] svn:boost r78033 - trunk/libs/context/src
by Joshua Boyce 17 Apr '12

17 Apr '12

On Tue, Apr 17, 2012 at 5:31 PM, <oliver.kowalke(a)gmx.de> wrote: > Author: olli > Date: 2012-04-17 03:31:34 EDT (Tue, 17 Apr 2012) > New Revision: 78033 > URL: http://svn.boost.org/trac/boost/changeset/78033 > > Log: > icontext: use snprintf in seh handler > > Text files modified: > trunk/libs/context/src/seh.cpp | 5 ++--- > 1 files changed, 2 insertions(+), 3 deletions(-) > > Modified: trunk/libs/context/src/seh.cpp > > ============================================================================== > --- trunk/libs/context/src/seh.cpp (original) > +++ trunk/libs/context/src/seh.cpp 2012-04-17 03:31:34 EDT (Tue, 17 > Apr 2012) > @@ -26,7 +26,7 @@ > { > const char * accessType = ( info[0]) ? "writing" : "reading"; > const ULONG_PTR address = info[1]; > - _snprintf_s( description, len, _TRUNCATE, "Access violation %s > 0x%08X", accessType, address); > + snprintf( description, len, "Access violation %s 0x%08X", > accessType, address); > return description; > } > case EXCEPTION_DATATYPE_MISALIGNMENT: return "Datatype > misalignment"; > @@ -52,8 +52,7 @@ > case EXCEPTION_INVALID_HANDLE: return "Invalid handle"; > } > > - _snprintf_s( description, len, _TRUNCATE, "Unknown (0x%08X)", code); > - > + snprintf( description, len, "Unknown (0x%08X)", code); > return description; > } > > _______________________________________________ > Boost-commit mailing list > Boost-commit(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-commit This breaks building under MSVC which does not have 'snprintf', only '_snprintf'. http://msdn.microsoft.com/en-us/library/2ts7cx93.aspx

1 0

Range to boost::array / make_array?
by Olaf van der Spek 16 Apr '12

16 Apr '12

Hi, Is there a convenient function to make an array from a range? I got a map with string keys which I'd like to replace with array<char, 32> keys, but I'm missing said function. -- Olaf

2 2

[Serialization] Is there a way to "stop" a polymorphic serialization at a given class level
by nico 16 Apr '12

16 Apr '12

Hello. I admit the subject is not really understandable, but you'll see it's not so obvious to summarize the question... I use the boost serialization system and its polymorphic base serialization feature. For that, and for serialization code instantiation, I use the registration macros BOOST_CLASS_EXPORT_KEY and BOOST_CLASS_EXPORT_IMPLEMENT. If I have a concrete class A in a inheritance tree like that : C is base of B is base of A ( C <|---B <|---A ) C is not instanciable (it has pure virtual functions) B is instanciable Is there a way to "stop" the serialization of a A object to B level? I mean: If I have this code: C* obj = new A(); // declare boost archive ar to serialize obj ar & obj; Is there a way to tell to boost serialization to serialize only until B. Why ? This obj serialized is deserialized in another application, where only C and B are known and used. A only defines technical stuff, but nothing with data (and serialization), so it will never be used as A*. I try with something like that : template<class Archive> void A::serialize(Archive & ar, const unsigned int version) { B* b = new B(static_cast<B*>(this)); ar & b; delete b; } but is there a more "boost-serialization-system" way ? (I expect no...) What do you recommend ? Thanks for help. Nicolas.

2 1

[thread] Move semantics and deprecation
by Vicente J. Botet Escriba 15 Apr '12

15 Apr '12

Hi, I have updated Boost.Thread to make use of Boost.Move with some significant improvements. Up to now the boost/thread/config.hpp file made use of Boost.Move by default. #if ! defined BOOST_THREAD_DONT_USE_MOVE #define BOOST_THREAD_USES_MOVE #endif After the discussion about deprecated features I think that it would be more convenient to don't change the default for the next release and let the users define this macro. There are some tests that need BOOST_THREAD_USES_MOVE. I will either add it explicitly on the test source code or define it when BOOST_THREAD_VERSION==2. What do you think? BTW, unfortunatly I've considered that the preceding Boost.Thread version was 1, while it was 2 (the first been the original one by William Kempf). Should the breaking changes be included using version BOOST_THREAD_VERSION==3? Anthony? Best, Vicente

1 0

[graph] Disjoint Sets - the secret library
by Daniel James 14 Apr '12

14 Apr '12

I was just comparing the library list on the website to the one in the repo, and I noticed 'disjoint sets' is listed on the website but not in 'libs/libraries.htm'. I think it either needs to added to 'libs/libraries.htm', or removed from the site. The header is in the 'pending' directory, and it doesn't seem to have been reviewed, so it looks like it should be removed from the site. It seems to be mainly used by the graph library, so maybe it could be subsumed by that? Also, the documentation isn't quite right as it says the header is at 'boost/disjoint_sets.hpp': http://www.boost.org/libs/disjoint_sets/ Does anyone have an opinion? (btw. I'm not suggesting removing the header, as that would break things) Daniel

2 2

Support for Boost.Hash in Boost.Array
by Marshall Clow 14 Apr '12

14 Apr '12

(In [77976]) I added support for Boost.Hash to Boost.Array I also added a basic set of tests. Please let me know if you see any problems. -- 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

2 1

[context/coroutine] split into two libs in trunk?!
by Oliver Kowalke 14 Apr '12

14 Apr '12

Hi, unfortunetly Giovanni decided to discontinue its boost.coroutine library and I was ask be several members of the boost community to provide a coroutine implementation using boost.context. I've refactored class context from lib boost.context so that I can provide coroutine<> and generator<> (following Giovannis interface proposal) based on context now. I'd like to split it into two libraries: - boost.context provides only context jumping facility (a.g. struct fcontext_t, start_fcontext()/jump_fcontext()/make_fcontext() and stack helper) - boost.coroutine contains coroutine<> and generator<> Might this be appropriate? regards, Oliver -- NEU: FreePhone 3-fach-Flat mit kostenlosem Smartphone! Jetzt informieren: http://mobile.1und1.de/?ac=OM.PW.PW003K20328T7073a

6 19

[quickbook] controlling table of contents
by lcaminiti 14 Apr '12

14 Apr '12

Hello all, Is there a way for more fine control of QuickBook table of contents (toc)? Specifically, I'd like to: 1) Have a toc in the first page with only the sections (no subsections) listed. 2) Then, have a full toc on the second documentation page with all sections and subsections listed. I can use any rev of QuickBook for this. Thanks a lot. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-quickbook-controlling-table-of-con… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 6

[typeof] registration question
by Cromwell Enage 14 Apr '12

14 Apr '12

Hi, folks! In emulation mode, given the following definition: template <typename Container> struct some_metafunction { typedef BOOST_TYPEOF_TPL( Container().insert( typename Container::iterator() , typename Container::value_type() ) ) type; }; Which of the following types need to be registered? 1. The argument passed as `Container` 2. The result of `typename Container::iterator` 3. The result of `typename Container::value_type`

3 7

[preprocessor] badly formed constant expression on Sun
by lcaminiti 13 Apr '12

13 Apr '12

Hello all, A Boost.Functional/OverloadedFunction regression test gives the errors below on a Boost.Preprocessor line: # if (BOOST_PP_VALUE) / 1000000000UL == 0 # define BOOST_PP_SLOT_TEMP_10 0 # elif (BOOST_PP_VALUE) / 1000000000UL == 1 # define BOOST_PP_SLOT_TEMP_10 1 # elif (BOOST_PP_VALUE) / 1000000000UL == 2 # define BOOST_PP_SLOT_TEMP_10 2 # elif (BOOST_PP_VALUE) / 1000000000UL == 3 ... "/opt/sunstudio12.1/bin/CC" +d -library=stlport4 -features=tmplife -features=tmplrefstatic -library=stlport4 -g -erroff=%none -m64 -KPIC -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/scratch2/kbelco/boost/results/boost/bin.v2/libs/functional/overloaded_function/test/functor.test/sun-5.10/debug/address-model-64/stdlib-sun-stlport/functor.o" "../libs/functional/overloaded_function/test/functor.cpp" "../boost/preprocessor/slot/detail/shared.hpp", line 27: Error: Badly formed constant expression. "../boost/preprocessor/slot/detail/shared.hpp", line 29: Error: Badly formed constant expression. "../boost/preprocessor/slot/detail/shared.hpp", line 31: Error: Badly formed constant expression. ... http://www.boost.org/development/tests/trunk/developer/output/Sandia-sun-bo… Is (BOOST_PP_VALUE) / 1000000000UL not a valid constant expression on Sun 64-bits machines? I can't reproduce this error on my Sun C++ compiler installed on 32-bit Ubuntu Linux... so maybe this is about the actual Sun machine and not the Sun compiler... However, all Boost.Preprocessor tests pass on Sun... http://www.boost.org/development/tests/trunk/developer/preprocessor.html Any suggestion? Thanks a lot. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-preprocessor-badly-formed-constant… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 3

review request for boost.coroutine
by Oliver Kowalke 13 Apr '12

13 Apr '12

Hello John, hello Ronald, could you add boost.coroutine to the review queue please. boost.coroutine is a implementation of coroutines and generators using boost.context and providing an interface similiar to Giovannis coroutine library (unfortunately discontinued). code is available from gitorious : http://gitorious.org/boost-dev/boost-dev (branch coroutine) zip : http://gitorious.org/boost-dev/boost-dev/archive-tarball/coroutine documentation : <updated later - I'm searching for webspace > thanks an best regards, Oliver

2 1

[test] Fixtures from file
by Alexander Arhipenko 13 Apr '12

13 Apr '12

Hi, I need to open fixture file (e.g. the one that contains initial data for testing) in a BOOST_AUTO_TEST_CASE. Could you please tell: * Whether it's possible? * If possible, than what is the most preferable way to do it? JFYI: We need to have something like python django fixtures. Some details: https://docs.djangoproject.com/en/dev/topics/testing/?from=olddocs#django.t… Regards

2 2

[lexical_cast] char types and UDTs
by Eric Niebler 13 Apr '12

13 Apr '12

Say I have a wide-character, user-defined, streamable type like boost::wssub_match from the regex library (or now std::wssub_match). It's basically a pair of wstring iterators. It's stream insertion operator is defined like this: template <class charT, class ST, class BiIter> basic_ostream<charT, ST>& operator<<(basic_ostream<charT, ST>& os, const sub_match<BiIter>& m) { return (os << m.str()); } If it's not obvious, it requires that the stream's character type is the same as the BiIter's value_type. If I were to try to use boost::lexical_cast to cast this to something, it won't work. That's because lexical_cast doesn't know about wssub_match, and so doesn't know that its character type should be wchar_t. Instead, it defaults to char for any unknown types, and doesn't give a way to override this. There is an internal trait, boost::detail::stream_char, that lexical_cast uses to determine what the character type of the source is (if any). It's specialized on only a fixed number of types. Since it's an implementation detail, it can't be used to extend the set of types. Also, I tried specializing it. In past versions of Boost that just worked, but it doesn't anymore. I think being able to extend lexical_cast to support types like (std|boost)::wssub_match is an essential feature. Thoughts on how to get there from here? -- Eric Niebler BoostPro Computing http://www.boostpro.com

5 14

[lockfree] tagged_ptr as a separate library
by Philipp Moeller 12 Apr '12

12 Apr '12

In the review of lockfree it has been suggested that tagged_ptr should make it into the public API of lockfree. Wouldn't it make sense to move it into a separate library entirely? It would possibly get more exposure and cross-platform ports. The technique itself also requires some extra documentation. And it might find it's way into a release earlier than lock-free itself. Philipp Moeller

5 7

Refactoring a library for header-only or linked library?
by Paul A. Bristow 12 Apr '12

12 Apr '12

I am considering refactoring a (potential Boost) library separating declarations and definitions into two sets of files with the objective of reducing compilation times and allow it to be used as header-only or linking with a pre-built library. Is there is best/Boost way of doing this? Is there a Boost library that I should use as a model? ASIO? Should I call the definition files .cpp or .ipp? Should definition files go in libs/src or in boost/? How should I control the header-only/library switch? View and suggestions? Thanks Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

2 3

[test] Ticket #6624 (Add a BOOST_<level>_NE_COLLECTIONS testing tool)
by Daniel Trebbien 12 Apr '12

12 Apr '12

Hello, I have been unable to reach the current maintainer of Boost.Test regarding Ticket #6624: https://svn.boost.org/trac/boost/ticket/6624 Would someone like to review my patch for this small enhancement and commit it? Daniel Trebbien

3 4

[svn/git/hg] Support for modularization of Boost?
by Beman Dawes 11 Apr '12

11 Apr '12

As far as I can see, scaling Boost up to a much larger number of libraries implies decentralization and decoupling, probably in the form of per-library modules or something similar. Modularization seems to have been missed in the discussions of Subversion, Git, and Mercurial. Do distributed version control systems in general and Git in particular have any important advantages/disadvantages over svn for highly modularized projects? Please, let's not waste everyone's time with a rehash of general DCVS vs CCVS pros and cons. We have beat that to death. Let's focus this thread on modularization support, particularly as it applies to Boost. Thanks, --Beman

13 20

boost::filesystem3::path::wchar_t_codecvt_facet()
by Renato Tegon Forti 11 Apr '12

11 Apr '12

Hi All, Anyone can help me to understand, and fix this error: gcc.link bin/gcc-4.6/release/threading-multi/doksafe_process_engine /usr/bin/ld: bin/gcc-4.6/release/threading-multi/main.o: undefined reference to symbol 'boost::filesystem3::path::wchar_t_codecvt_facet()' /usr/bin/ld: note: 'boost::filesystem3::path::wchar_t_codecvt_facet()' is defined in DSO /3rdparty/Boost/1.46.1/lib/libboost_filesystem.so.1.46.1 so try adding it to the linker command line /3rdparty/Boost/1.46.1/lib/libboost_filesystem.so.1.46.1: could not read symbols: Invalid operation collect2: ld returned 1 exit status Thanks

1 0

Two days left to save on BoostCon / C++Now! 2012
by Dave Abrahams 11 Apr '12

11 Apr '12

Just a quick reminder to everyone that early-bird registration closes at the end of this week. After Friday, the price goes up by $100. Spots are limited and registrations have been coming in faster than in past years. http://cppnow.org Cheers! -- Dave Abrahams BoostPro Computing http://www.boostpro.com

1 0

[range] adaptors vs. rvalue to lvalue& binding
by Arno Schödl 11 Apr '12

11 Apr '12

Hello, ideally I would like to use range-adapted lvalue ranges like any other lvalue ranges. Writing it down naively, as below, does not compile because LoadRefRange takes (and should take?) the range it modifies by lvalue&, while adaptor expressions are rvalues. template<typename Range> void modifies_range( Range& rng ); A a[5]; main() { // modifies all elements of a modifies_range ( a ); // modifies all elements (except for one) of a // adaptor is rvalue, does not compile: modifies_range ( boost::range::join( boost::adaptors::slice( a, 0, 1 ), boost::adaptors::slice( a, 2, countof(a) ) ) ); // compiles, but ugly: auto rng=boost::range::join( boost::adaptors::slice( a, 0, 1 ), boost::adaptors::slice( a, 2, countof(a) ) ); modifies_range(rng); } Any thoughts? Should adaptors receiving lvalues offer an operator adaptor&() &&; // overload on rvalue-ness so they are passing through the lvalue or their argument? A suitable baseclass a la boost::additive could do that. Regards, Arno -- Dr. Arno Schödl | aschoedl(a)think-cell.com Technical Director think-cell Software GmbH | Chausseestr. 8/E | 10115 Berlin | Germany http://www.think-cell.com | phone +49 30 666473-10 | US phone +1 800 891 8091 Amtsgericht Berlin-Charlottenburg, HRB 85229 | European Union VAT Id DE813474306 Directors: Dr. Markus Hannebauer, Dr. Arno Schoedl

8 21

[function] why do I function1 for type-of emulation?
by lcaminiti 10 Apr '12

10 Apr '12

Hello all, I was trying to use Boost.Function together with Boost.Typeof. It seems that if I run in type-of emulation mode I have to register boost::functionN instead of boost::function even if I only use boost::function... do you know why? For example: #include <boost/function.hpp> #include <boost/typeof/typeof.hpp> #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP() //BOOST_TYPEOF_REGISTER_TEMPLATE(boost::function, 1) // (1) BOOST_TYPEOF_REGISTER_TEMPLATE(boost::function1, 2) // (2) int main() { typedef BOOST_TYPEOF(&boost::function<int (int)>::operator()) f; return 0; } In order to compile this (on MSVC 8.0 and GCC 4.5.3) with BOOST_TYPEOF_EMULATION #defined, I have to register boost::function1 as in line (2) but I'd expect it to work with the registration of boost::function of line (1) instead. Why do I have to register boost::function1 (2) instead of boost::function (1) for type-of emulation? Thanks a lot. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-function-why-do-I-function1-for-ty… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 2

[Review Request] Multiprecision Arithmetic Library
by John Maddock 10 Apr '12

10 Apr '12

Folks, I'd like to ask for a formal review of the Multiprecision Arithmetic Library, currently in the sandbox. Features: * Expression template enabled front end. * Support for Integer, Rational and Floating Point types. Supported Integer backends: * GMP. * Libtommath. * cpp_int. cpp_int is an all C++ Boost licensed backend, supports both arbitrary precision types (with Allocator support), and signed and unsigned fixed precision types (with no memory allocation). There are also some integer specific functions - for Miller Rabin testing, bit fiddling, random numbers. Plus interoperability with Boost.Rational (though that loses the expression template frontend). Supported Rational Backends: * GMP * libtommath * cpp_int (as above) Supported Floating point backends: * GMP * MPFR * cpp_dec_float cpp_dec_float is an all C++ Boost licensed type, adapted from Christopher Kormanyos' e_float code (published in TOMS last year). All the floating point types, have full std lib support (cos sin exp, pow etc), as well as full interoperability with Boost.Math. There's nothing in principal to prevent extension to complex numbers and interval arithmetic types (plus any other number types I've forgotten!), but I've run out of energy for now ;-) Code is in the sandbox under /big_number/. Docs can be viewed online here: http://svn.boost.org/svn/boost/sandbox/big_number/libs/multiprecision/doc/h… And of course, I'm looking for a review manager ;-) Many thanks, John.

14 76

[config] unexpected explicit operators conversion on some compilers.
by Vicente J. Botet Escriba 10 Apr '12

10 Apr '12

Hi, Given the following explicit bool conversion template<typename Mutex> class unique_lock { public: explicit operator bool() const BOOST_NOEXCEPT I was expecting the following code to compile fail (note the int cast) boost::unique_lock<boost::mutex> lk0; int i = int(lk0); It fails with gcc-4.7.0, but compile with gcc-4.6.2 and clang-3.0 (I have not tested yet with msvc). When BOOST_NO_EXPLICIT_CONVERSION_OPERATORS is defined I use the bool safe idiom to emulate the conversion #if defined(BOOST_NO_EXPLICIT_CONVERSION_OPERATORS) typedef void (unique_lock::*bool_type)(); operator bool_type() const BOOST_NOEXCEPT; bool operator!() const BOOST_NOEXCEPT; #else explicit operator bool() const BOOST_NOEXCEPT; #endif and in this case the compile fail as desired. Do we need a new macro to state that even if explicit operators are provide, there are some unexpected conversions that could be introduced? Best, Vicente

1 1

Release branch open for new libraries?
by Marshall Clow 10 Apr '12

10 Apr '12

When will the release branch be open for new libraries (for 1.50)? The calendar on Boost.org shows no dates for 1.50 at all. Thanks! -- 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

3 8

[test] SIGSEGV on simple test when -ansi is set with gcc-4.7.0 on Darwin
by Vicente J. Botet Escriba 10 Apr '12

10 Apr '12

Hi, The following simple test signals SIGSEGV when line ***1 is uncommented. When I recompile Boost.Test and the tests with same project requirements (see below) everything is OK. Is this the correct behavior? Should -ansi be set in a coherent way? Note. I have no issue mixing -ansi with clang-3.0. Thanks, Vicente P.S. I could attach the complete logs if needed (not so big) ============================= #include <boost/test/unit_test.hpp> void test_1() { BOOST_CHECK(true); } boost::unit_test::test_suite* init_unit_test_suite(int, char*[]) { boost::unit_test::test_suite* test = BOOST_TEST_SUITE("test suite"); test->add(BOOST_TEST_CASE(test_1)); test->add(BOOST_TEST_CASE(test_1)); test->add(BOOST_TEST_CASE(test_1)); test->add(BOOST_TEST_CASE(test_1)); test->add(BOOST_TEST_CASE(test_1)); //test->add(BOOST_TEST_CASE(test_1)); // *** 1 return test; } ============================= Here it is the log ============================= darwin.link ../../../bin.v2/libs/thread/test/test_ansi.test/darwin-4.7.0x/debug/test_ansi "/usr/local/gcc-4-7-svn/bin/g++" -o "../../../bin.v2/libs/thread/test/test_ansi.test/darwin-4.7.0x/debug/test_ansi" "../../../bin.v2/libs/thread/test/test_ansi.test/darwin-4.7.0x/debug/test_ansi.o" "../../../bin.v2/libs/test/build/darwin-4.7.0x/debug/link-static/libboost_unit_test_framework.a" -g testing.capture-output ../../../bin.v2/libs/thread/test/test_ansi.test/darwin-4.7.0x/debug/test_ansi.run "../../../bin.v2/libs/thread/test/test_ansi.test/darwin-4.7.0x/debug/test_ansi" > "../../../bin.v2/libs/thread/test/test_ansi.test/darwin-4.7.0x/debug/test_ansi.output" 2>&1 status=$? echo >> "../../../bin.v2/libs/thread/test/test_ansi.test/darwin-4.7.0x/debug/test_ansi.output" echo EXIT STATUS: $status >> "../../../bin.v2/libs/thread/test/test_ansi.test/darwin-4.7.0x/debug/test_ansi.output" if test $status -eq 0 ; then cp "../../../bin.v2/libs/thread/test/test_ansi.test/darwin-4.7.0x/debug/test_ansi.output" "../../../bin.v2/libs/thread/test/test_ansi.test/darwin-4.7.0x/debug/test_ansi.run" fi verbose=0 if test $status -ne 0 ; then verbose=1 fi if test $verbose -eq 1 ; then echo ====== BEGIN OUTPUT ====== cat "../../../bin.v2/libs/thread/test/test_ansi.test/darwin-4.7.0x/debug/test_ansi.output" echo ====== END OUTPUT ====== fi exit $status ====== BEGIN OUTPUT ====== Running 6 test cases... unknown location:0: fatal error in "test_1": signal: SIGSEGV, si_code: 0 (memory access violation at address: 0x00000000) test_ansi.cpp:5: last checkpoint *** 1 failure detected in test suite "Master Test Suite" ============================= Here there are the client project requirements ============================= project : requirements <warnings>all <toolset>darwin:<cxxflags>-ansi ;

1 0

forgot svn password
by Jeffrey Lee Hellrung, Jr. 10 Apr '12

10 Apr '12

Okay, given that my boost SVN account is relatively new, and I hadn't logged in for a while, hopefully it's not too unbelievable that I've forgotten my password. Embarrassing, yes. What to do? I could not find any password recovery or reset options from svn.boost.org. username = jeffrey.hellrung Thanks, and sorry for the noise, - Jeff

2 1

[scope_exit] trunk tests fail on sun compiler
by lcaminiti 09 Apr '12

09 Apr '12

Hello all, I'm trying to get ScopeExit to work on Sun. 1) First it looked like all tests fail on this compiler: http://www.boost.org/development/tests/trunk/developer/scope_exit.html 2) However, I installed Solaris Studio 12.3 on my Ubuntu 10 and it seems that I can compile ScopeExit just fine with the following" $ CC -I /usr/include/i386-linux-gnu/ -I ../../.. -DBOOST_TYPEOF_EMULATION world_seq.cpp Note that: a) Sun does not support variadic macros so only ScopeExit sequence syntax will work. b) Sun does not support native type-of so BOOST_TYPEOF_EMULATION needs to be defined. Therefore, all original ScopeExit type-of emulation tests named `emulation_...` should compile (because they use the sequence syntax and define BOOST_TYPEOF_EMULATION). However, they fail... why? 3) Why when I click on the "fail" link for these tests I get no information on the Sun compiler's output? For example: http://www.boost.org/development/tests/trunk/developer/output/Sandia-sun-bo… If I follow this link I get "Error extracting file: No matching files were found.". What does this mean? Thanks a lot! --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-scope-exit-trunk-tests-fail-on-sun… Sent from the Boost - Dev mailing list archive at Nabble.com.

6 34

Metaprogram benchmarks
by Dave Abrahams 09 Apr '12

09 Apr '12

In order to measure the compile-time efficiency of various C++11 metaprogramming techniques, I'd like to put together a set of benchmarks, and I wanted to discuss here what kinds of tests might be appropriate. Aleksey and I came up with some benchmarks for an appendix to http://boostpro.com/mplbook/, but some of those are lost and they're all getting a bit crusty. Certainly, I have no confidence that they are realistic or useful. If anyone has ideas about this, I'd be very glad to hear them. Thanks in advance, -- Dave Abrahams BoostPro Computing http://www.boostpro.com

7 9

[string_algo] ilexicographical_compare()/is_iless() bug?
by Dmitry Vinogradov 08 Apr '12

08 Apr '12

I want to share a problem using ilexicographical_compare(). I think that ilexicographical_compare() must compare two strings in "alphabetical" order, the order letters appear in alphabet. But ilexicographical_compare() uses is_iless() to compare letters. And such comparison looks like: std::toupper<T1>(Arg1,m_Loc)<std::toupper<T2>(Arg2,m_Loc); So, in fact, letters are compared depending on their position in a charset. It's not always match the alphabet order. Examples are Cyrillic letters "Io" and "i" (Unicode 0451 and 0456). I think the right solution is to compare like this: T1 Ch1 = std::toupper<T1>(Arg1,m_Loc); T2 Ch2 = std::toupper<T2>(Arg2,m_Loc); return std::use_facet< std::collate<typename CharType> > (m_Loc).compare(&Ch1, &Ch1 + 1, &Ch2, &Ch2 + 1);

3 2

[SVN] Spurious changes to lots of files....
by John Maddock 08 Apr '12

08 Apr '12

I'm not picking on anyone in particular here, just noticing that some stuff that really shouldn't have changed is quite often getting "touched" due to changes to svn:mergeinfo. For example, if I look at the revision log for boost/config.hpp in the release branch I see: Revision: 77591 Author: eric_niebler Date: 27 March 2012 20:28:30 Message: merge [77416] from trunk, fixes #6131, fixes #6455 Revision: 77589 Author: eric_niebler Date: 27 March 2012 19:53:50 Message: merge [77417],[77437],[77422],[77587] from trunk ---- Revision: 77447 Author: eric_niebler Date: 21 March 2012 04:22:38 Message: merge [77446] from trunk ---- Revision: 77420 Author: eric_niebler Date: 19 March 2012 21:33:14 Message: merge [77419] from trunk ---- Revision: 77413 Author: eric_niebler Date: 19 March 2012 20:26:44 Message: merge [77412] from trunk, fixes #6702 ---- Revision: 77411 Author: eric_niebler Date: 19 March 2012 20:07:11 Message: merge [77320] from trunk ---- Revision: 76784 Author: eric_niebler Date: 29 January 2012 21:58:13 Message: merge [76637] from trunk ---- Revision: 76536 Author: jewillco Date: 15 January 2012 23:52:45 Message: Merged r75066, r75067, r75124, r75140, r75165, r75861, r75862, r75863, r75878, r75906, r75970, r75973, r75974, and r76394 from trunk ---- Revision: 76535 Author: jewillco Date: 15 January 2012 23:32:09 Message: Merged r76050, r75547, r75891, r76049, r76083, and r76439 from trunk (reverse_graph bug fixes and fix for #6293); refs #6293 ---- Revision: 76480 Author: eric_niebler Date: 14 January 2012 05:21:11 Message: merge [76479] from trunk ---- Before finally we get to a "real" change: Revision: 76339 Author: johnmaddock Date: 07 January 2012 17:29:04 Message: Merge config changes from Trunk. ---- If we pick out the latest of the changes above we see that a huge number of files have been "touched" in this way: Revision: 77591 Author: eric_niebler Date: 27 March 2012 20:28:30 Message: merge [77416] from trunk, fixes #6131, fixes #6455 ---- Modified : /branches/release Modified : /branches/release/INSTALL Modified : /branches/release/Jamroot Modified : /branches/release/LICENSE_1_0.txt Modified : /branches/release/boost Modified : /branches/release/boost/algorithm/string Modified : /branches/release/boost/algorithm/string/detail/case_conv.hpp Modified : /branches/release/boost/algorithm/string/detail/classification.hpp Modified : /branches/release/boost/array.hpp Modified : /branches/release/boost/bimap Modified : /branches/release/boost/concept_check.hpp Modified : /branches/release/boost/config Modified : /branches/release/boost/config.hpp Modified : /branches/release/boost/cregex.hpp Modified : /branches/release/boost/cstdint.hpp Modified : /branches/release/boost/current_function.hpp Modified : /branches/release/boost/date_time/c_time.hpp Modified : /branches/release/boost/date_time/date_formatting.hpp Modified : /branches/release/boost/date_time/filetime_functions.hpp Modified : /branches/release/boost/date_time/gregorian_calendar.ipp Modified : /branches/release/boost/date_time/posix_time/time_serialize.hpp Modified : /branches/release/boost/date_time/strings_from_facet.hpp Modified : /branches/release/boost/date_time/time_facet.hpp Modified : /branches/release/boost/date_time/tz_db_base.hpp Modified : /branches/release/boost/detail Modified : /branches/release/boost/detail/fenv.hpp Modified : /branches/release/boost/detail/interlocked.hpp Modified : /branches/release/boost/dynamic_bitset/dynamic_bitset.hpp Modified : /branches/release/boost/filesystem Modified : /branches/release/boost/filesystem.hpp Modified : /branches/release/boost/foreach.hpp Modified : /branches/release/boost/foreach_fwd.hpp Modified : /branches/release/boost/function Modified : /branches/release/boost/function/function_template.hpp Modified : /branches/release/boost/functional Modified : /branches/release/boost/fusion Modified : /branches/release/boost/geometry Modified : /branches/release/boost/geometry/algorithms Modified : /branches/release/boost/geometry/arithmetic Modified : /branches/release/boost/geometry/core Modified : /branches/release/boost/geometry/domains Modified : /branches/release/boost/geometry/geometries Modified : /branches/release/boost/geometry/geometry.hpp Modified : /branches/release/boost/geometry/io Modified : /branches/release/boost/geometry/io/dsv Modified : /branches/release/boost/geometry/iterators Modified : /branches/release/boost/geometry/multi Modified : /branches/release/boost/geometry/policies Modified : /branches/release/boost/geometry/strategies Modified : /branches/release/boost/geometry/util Modified : /branches/release/boost/geometry/views Modified : /branches/release/boost/gil Modified : /branches/release/boost/graph Modified : /branches/release/boost/heap Modified : /branches/release/boost/icl Modified : /branches/release/boost/integer Modified : /branches/release/boost/integer.hpp Modified : /branches/release/boost/integer_fwd.hpp Modified : /branches/release/boost/integer_traits.hpp Modified : /branches/release/boost/interprocess Modified : /branches/release/boost/intrusive Modified : /branches/release/boost/io Modified : /branches/release/boost/iostreams Modified : /branches/release/boost/iterator Modified : /branches/release/boost/iterator/iterator_facade.hpp Modified : /branches/release/boost/locale Modified : /branches/release/boost/locale.hpp Modified : /branches/release/boost/math Modified : /branches/release/boost/math_fwd.hpp Modified : /branches/release/boost/msm Modified : /branches/release/boost/msm/active_state_switching_policies.hpp Modified : /branches/release/boost/msm/back Modified : /branches/release/boost/msm/back/args.hpp Modified : /branches/release/boost/msm/back/bind_helpers.hpp Modified : /branches/release/boost/msm/back/common_types.hpp Modified : /branches/release/boost/msm/back/copy_policies.hpp Modified : /branches/release/boost/msm/back/default_compile_policy.hpp Modified : /branches/release/boost/msm/back/dispatch_table.hpp Modified : /branches/release/boost/msm/back/favor_compile_time.hpp Modified : /branches/release/boost/msm/back/fold_to_list.hpp Modified : /branches/release/boost/msm/back/history_policies.hpp Modified : /branches/release/boost/msm/back/metafunctions.hpp Modified : /branches/release/boost/msm/back/mpl_graph_fsm_check.hpp Modified : /branches/release/boost/msm/back/no_fsm_check.hpp Modified : /branches/release/boost/msm/back/queue_container_circular.hpp Modified : /branches/release/boost/msm/back/queue_container_deque.hpp Modified : /branches/release/boost/msm/back/state_machine.hpp Modified : /branches/release/boost/msm/back/tools.hpp Modified : /branches/release/boost/msm/common.hpp Modified : /branches/release/boost/msm/front Modified : /branches/release/boost/msm/front/common_states.hpp Modified : /branches/release/boost/msm/front/completion_event.hpp Modified : /branches/release/boost/msm/front/detail Modified : /branches/release/boost/msm/front/detail/common_states.hpp Modified : /branches/release/boost/msm/front/detail/row2_helper.hpp Modified : /branches/release/boost/msm/front/euml Modified : /branches/release/boost/msm/front/euml/algorithm.hpp Modified : /branches/release/boost/msm/front/euml/common.hpp Modified : /branches/release/boost/msm/front/euml/container.hpp Modified : /branches/release/boost/msm/front/euml/euml.hpp Modified : /branches/release/boost/msm/front/euml/euml_typeof.hpp Modified : /branches/release/boost/msm/front/euml/guard_grammar.hpp Modified : /branches/release/boost/msm/front/euml/iteration.hpp Modified : /branches/release/boost/msm/front/euml/operator.hpp Modified : /branches/release/boost/msm/front/euml/phoenix_placeholders.hpp Modified : /branches/release/boost/msm/front/euml/querying.hpp Modified : /branches/release/boost/msm/front/euml/state_grammar.hpp Modified : /branches/release/boost/msm/front/euml/stl.hpp Modified : /branches/release/boost/msm/front/euml/stt_grammar.hpp Modified : /branches/release/boost/msm/front/euml/transformation.hpp Modified : /branches/release/boost/msm/front/functor_row.hpp Modified : /branches/release/boost/msm/front/internal_row.hpp Modified : /branches/release/boost/msm/front/row2.hpp Modified : /branches/release/boost/msm/front/state_machine_def.hpp Modified : /branches/release/boost/msm/front/states.hpp Modified : /branches/release/boost/msm/mpl_graph Modified : /branches/release/boost/msm/msm_grammar.hpp Modified : /branches/release/boost/msm/proto_config.hpp Modified : /branches/release/boost/msm/row_tags.hpp Modified : /branches/release/boost/numeric/ublas Modified : /branches/release/boost/numeric/ublas/functional.hpp Modified : /branches/release/boost/pool Modified : /branches/release/boost/preprocessor Modified : /branches/release/boost/program_options Modified : /branches/release/boost/program_options/detail/parsers.hpp Modified : /branches/release/boost/program_options/parsers.hpp Modified : /branches/release/boost/property_tree Modified : /branches/release/boost/python Modified : /branches/release/boost/range Modified : /branches/release/boost/regex Modified : /branches/release/boost/regex.h Modified : /branches/release/boost/regex.hpp Modified : /branches/release/boost/regex_fwd.hpp Modified : /branches/release/boost/signals Modified : /branches/release/boost/signals2 Modified : /branches/release/boost/signals2.hpp Modified : /branches/release/boost/spirit Modified : /branches/release/boost/spirit/home Modified : /branches/release/boost/spirit/home/karma Modified : /branches/release/boost/spirit/home/support/attributes.hpp Modified : /branches/release/boost/statechart Modified : /branches/release/boost/static_assert.hpp Modified : /branches/release/boost/system Modified : /branches/release/boost/thread Modified : /branches/release/boost/thread.hpp Modified : /branches/release/boost/timer.hpp Modified : /branches/release/boost/token_functions.hpp Modified : /branches/release/boost/tr1 Modified : /branches/release/boost/type_traits Modified : /branches/release/boost/type_traits.hpp Modified : /branches/release/boost/typeof/message.hpp Modified : /branches/release/boost/typeof/register_functions.hpp Modified : /branches/release/boost/typeof/register_functions_iterate.hpp Modified : /branches/release/boost/typeof/typeof.hpp Modified : /branches/release/boost/typeof/unsupported.hpp Modified : /branches/release/boost/unordered Modified : /branches/release/boost/utility Modified : /branches/release/boost/utility/value_init.hpp Modified : /branches/release/boost/uuid Modified : /branches/release/boost/variant Modified : /branches/release/boost/version.hpp Modified : /branches/release/boost/wave Modified : /branches/release/boost/xpressive Modified : /branches/release/boost-build.jam Modified : /branches/release/boost.css Modified : /branches/release/boost.png Modified : /branches/release/boostcpp.jam Modified : /branches/release/bootstrap.bat Modified : /branches/release/bootstrap.sh Modified : /branches/release/doc Modified : /branches/release/index.htm Modified : /branches/release/index.html Modified : /branches/release/libs Modified : /branches/release/libs/algorithm/minmax/index.html Modified : /branches/release/libs/algorithm/string Modified : /branches/release/libs/algorithm/string/doc/Jamfile.v2 Modified : /branches/release/libs/array Modified : /branches/release/libs/array/test/array0.cpp Modified : /branches/release/libs/array/test/array2.cpp Modified : /branches/release/libs/array/test/array6.cpp Modified : /branches/release/libs/bimap Modified : /branches/release/libs/config Modified : /branches/release/libs/date_time Modified : /branches/release/libs/date_time/data/date_time_zonespec.csv Modified : /branches/release/libs/date_time/example/gregorian/days_between_new_years.cpp Modified : /branches/release/libs/date_time/example/gregorian/days_since_year_start.cpp Modified : /branches/release/libs/date_time/example/gregorian/days_till_new_year.cpp Modified : /branches/release/libs/date_time/example/gregorian/month_add.cpp Modified : /branches/release/libs/date_time/example/local_time/flight.cpp Modified : /branches/release/libs/date_time/example/local_time/local_date_time.cpp Modified : /branches/release/libs/date_time/example/posix_time/print_hours.cpp Modified : /branches/release/libs/date_time/example/posix_time/time_math.cpp Modified : /branches/release/libs/date_time/example/tutorial/io_tutorial.cpp Modified : /branches/release/libs/date_time/test/posix_time/testtime_facet.cpp Modified : /branches/release/libs/date_time/test/posix_time/testtime_input_facet.cpp Modified : /branches/release/libs/date_time/xmldoc/date_class.xml Modified : /branches/release/libs/date_time/xmldoc/usage_examples.xml Modified : /branches/release/libs/detail Modified : /branches/release/libs/filesystem Modified : /branches/release/libs/function Modified : /branches/release/libs/functional Modified : /branches/release/libs/fusion Modified : /branches/release/libs/geometry Modified : /branches/release/libs/geometry/doc Modified : /branches/release/libs/geometry/doc/Jamfile.v2 Modified : /branches/release/libs/geometry/doc/about_documentation.qbk Modified : /branches/release/libs/geometry/doc/acknowledgments.qbk Modified : /branches/release/libs/geometry/doc/compiling.qbk Modified : /branches/release/libs/geometry/doc/concept Modified : /branches/release/libs/geometry/doc/copyright_note_policy.txt Modified : /branches/release/libs/geometry/doc/design_rationale.qbk Modified : /branches/release/libs/geometry/doc/doxy Modified : /branches/release/libs/geometry/doc/generated Modified : /branches/release/libs/geometry/doc/geometry.qbk Modified : /branches/release/libs/geometry/doc/html Modified : /branches/release/libs/geometry/doc/imports.qbk Modified : /branches/release/libs/geometry/doc/introduction.qbk Modified : /branches/release/libs/geometry/doc/make_qbk.py Modified : /branches/release/libs/geometry/doc/matrix.qbk Modified : /branches/release/libs/geometry/doc/quickref.xml Modified : /branches/release/libs/geometry/doc/quickstart.qbk Modified : /branches/release/libs/geometry/doc/readme.txt Modified : /branches/release/libs/geometry/doc/reference Modified : /branches/release/libs/geometry/doc/reference.qbk Modified : /branches/release/libs/geometry/doc/release_notes.qbk Modified : /branches/release/libs/geometry/doc/src Modified : /branches/release/libs/geometry/example Modified : /branches/release/libs/geometry/index.html Modified : /branches/release/libs/geometry/test Modified : /branches/release/libs/graph/doc Modified : /branches/release/libs/graph_parallel Modified : /branches/release/libs/heap Modified : /branches/release/libs/icl Modified : /branches/release/libs/icl/doc Modified : /branches/release/libs/icl/doc/html Modified : /branches/release/libs/icl/doc/html/header/boost/icl Modified : /branches/release/libs/icl/test Modified : /branches/release/libs/icl/test/test_doc_code_ Modified : /branches/release/libs/integer Modified : /branches/release/libs/interprocess Modified : /branches/release/libs/intrusive Modified : /branches/release/libs/io Modified : /branches/release/libs/io/doc Modified : /branches/release/libs/iostreams Modified : /branches/release/libs/iterator Modified : /branches/release/libs/libraries.htm Modified : /branches/release/libs/locale Modified : /branches/release/libs/locale/src Modified : /branches/release/libs/maintainers.txt Modified : /branches/release/libs/math Modified : /branches/release/libs/math/doc/sf_and_dist/faq.qbk Modified : /branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/faq.html Modified : /branches/release/libs/math/test/s_.ipp Modified : /branches/release/libs/mpi/build Modified : /branches/release/libs/mpl/doc/refmanual/broken-compiler-workarounds.html Modified : /branches/release/libs/mpl/doc/refmanual/categorized-index-concepts.html Modified : /branches/release/libs/mpl/doc/refmanual/cfg-no-preprocessed-headers.html Modified : /branches/release/libs/mpl/doc/refmanual/composition-and-argument-binding.html Modified : /branches/release/libs/mpl/doc/refmanual/data-types-concepts.html Modified : /branches/release/libs/mpl/doc/refmanual/data-types-miscellaneous.html Modified : /branches/release/libs/mpl/doc/refmanual/extensible-associative-sequence.html Modified : /branches/release/libs/mpl/doc/refmanual/inserter-class.html Modified : /branches/release/libs/mpl/doc/refmanual/tag-dispatched-metafunction.html Modified : /branches/release/libs/mpl/doc/refmanual/trivial-metafunctions-summary.html Modified : /branches/release/libs/mpl/doc/src/refmanual/Iterators-Iterator.rst Modified : /branches/release/libs/msm Modified : /branches/release/libs/numeric/ublas Modified : /branches/release/libs/numeric/ublas/doc Modified : /branches/release/libs/parameter/doc/html/index.html Modified : /branches/release/libs/phoenix/doc/basics.qbk Modified : /branches/release/libs/phoenix/doc/examples/extending_actors.qbk Modified : /branches/release/libs/phoenix/doc/organisation.qbk Modified : /branches/release/libs/pool Modified : /branches/release/libs/preprocessor Modified : /branches/release/libs/program_options Modified : /branches/release/libs/program_options/test/parsers_test.cpp Modified : /branches/release/libs/property_tree Modified : /branches/release/libs/python Modified : /branches/release/libs/range Modified : /branches/release/libs/regex Modified : /branches/release/libs/signals Modified : /branches/release/libs/signals2 Modified : /branches/release/libs/signals2/doc Modified : /branches/release/libs/spirit Modified : /branches/release/libs/spirit/classic/example Modified : /branches/release/libs/spirit/doc Modified : /branches/release/libs/spirit/example Modified : /branches/release/libs/spirit/phoenix Modified : /branches/release/libs/spirit/test Modified : /branches/release/libs/spirit/test/qi/optional.cpp Modified : /branches/release/libs/statechart Modified : /branches/release/libs/static_assert Modified : /branches/release/libs/system Modified : /branches/release/libs/thread Modified : /branches/release/libs/thread/test Modified : /branches/release/libs/timer Modified : /branches/release/libs/tr1 Modified : /branches/release/libs/type_traits Modified : /branches/release/libs/typeof/doc/typeof.qbk Modified : /branches/release/libs/unordered Modified : /branches/release/libs/utility Modified : /branches/release/libs/utility/assert.html Modified : /branches/release/libs/utility/assert_test.cpp Modified : /branches/release/libs/utility/swap/test/std_bitset.cpp Modified : /branches/release/libs/utility/swap.html Modified : /branches/release/libs/utility/value_init.htm Modified : /branches/release/libs/utility/value_init_test.cpp Modified : /branches/release/libs/uuid Modified : /branches/release/libs/wave Modified : /branches/release/more Modified : /branches/release/rst.css Modified : /branches/release/status Modified : /branches/release/status/Jamfile.v2 Modified : /branches/release/status/expected_results.xml Modified : /branches/release/status/explicit-failures-markup.xml Modified : /branches/release/status/explicit-failures.xsd Modified : /branches/release/tools Modified : /branches/release/tools/bcp Modified : /branches/release/tools/boostbook Modified : /branches/release/tools/build/v2 Modified : /branches/release/tools/build/v2/tools/mpi.jam Modified : /branches/release/tools/inspect Modified : /branches/release/tools/quickbook Modified : /branches/release/tools/regression Modified : /branches/release/tools/regression/src/library_status.cpp Modified : /branches/release/tools/release Modified : /branches/release/tools/wave As well as cluttering up the revision logs, this often leads to property and/or tree conflicts when merging your own stuff, and I can't tell you how annoying that is to figure out! :-( BTW, my sincere apologies to Eric here - he just happened to be the latest culprit - can some SVN guru suggest how to prevent this sort of spurious changing going on? BTW2, lest this turn into "my extra advanced version control system doesn't do messy stuff like this" conversation - I'm sure you're correct - some other version control system probably doesn't have this trap - but I sure bet it has other traps just as annoying for the unwary. Just saying.... Thanks, John.

4 6

C++ Now! Early Bird Registration Ending Soon
by Jon Kalb 08 Apr '12

08 Apr '12

The fifteenth of this month is the end of Early Bird registration. Register by the end of next week to reserve your place and save on registration. Featuring 3 keynote speakers headlining 3 tracks of 50+ session brought to by 35+ presenters, this year¹s conference is our largest and most ambitious. What isn¹t bigger is the registration fee. If you beat the April 15th deadline you can enjoy the conference offering the most complete C++11 tutorial coverage of the year and save money too. See you in Aspen! Registration: http://cppnow.eventbrite.com/?ref=ecount Jon

1 0

Nightly testing broken due to missing file
by Belcourt, K. Noel 07 Apr '12

07 Apr '12

error: Unable to find file or target named error: './sync/mutual_exclusion/locks/upgrade_lock/cons/ move_ctor_shared_lock_until_pass.cpp' error: referred from project at error: '../libs/thread/test'

3 2

C++11 Metaprogramming
by Dave Abrahams 07 Apr '12

07 Apr '12

Hi All, I am on the C++Now 2012 schedule giving a talk on metaprogramming in C++11, which is really just supposed to be an overview of the state of the art. I am just at the beginnings of my research for this presentation, having learned a few things and done a few experiments, and it seemed to me foolish not to ask the Boost community for its insights. I'm sure y'all have come up with many neat tricks and techniques. If you'd care to share them here, that would be much appreciated. TIA, -- Dave Abrahams BoostPro Computing http://www.boostpro.com

13 38

Re: [boost] C++11 Metaprogramming
by Andrzej Krzemienski 07 Apr '12

07 Apr '12

> On 06/04/12 09:04, Andrzej Krzemienski wrote: >>> And this is the worst part: I forgot the >> "typename". Having to type this "typename" is really terrible and just >> scares off many people. If you do not mind it, it only means that you got >> used to it; but people should not be forced to get used to too many >> gotchas. > > The language requires to specify whenever dependent names in template > contexts are anything else than values (i.e. types or templates). > > There is no substitute for learning the basics of the language. This is > not a gotcha, just normal usage of templates. Clearly, if you do not find requiring of the programmers to type this "typename" in these places even slightly wrong, you will not appreciate alias templates as a useful addition to meta-programming. Also, if you did a lot of advanced meta-programming, you have probably mastered the rules of template syntax, and find it difficult to sympathize with those that did not master the subject. But looking at it from the fresh programmer's perspective, the fact that the language requires "to specify whenever dependent names in template contexts are anything else than values" means that the language is not friendly to the fresh programmers (I understand that there are good reasons for requiring this, but still...). Based on the Wkipedia's definition of "gotcha" I interpret this typename as one. "In programming, a gotcha is a feature of a system, a program or a programming language that works in the way it is documented but is counter-intuitive and almost invites mistakes because it is both enticingly easy to invoke and completely unexpected and/or unreasonable in its outcome." It (the usage of typename) only appears as "normal usage" after you are past the stage of surprise. The context of your reply seems to imply that whoever finds this behavior surprising is guilty of not having acquired the basics of the language. Unless I misunderstood you, I think this position is a bit unfair. Regards, &rzej

6 5

boost.asio and boost.bind question
by Philip Bennefall 07 Apr '12

07 Apr '12

Hi all, I have been using Asio and Bind for a server with great success, however I just thought of something that I wanted to clarify. If I have a class method and construct a string within this method, and then call post on the IO service with a bind generated function object that takes this local std::string as one of its arguments, is the string then copied? Naturally it will be destroyed after the asynchronous invokation when the method returns, so is it just by chance that this has worked so far? Is it undefined behavior? Example: void dummy() { string final_message="some_data"; the_client->partner_sync.post( boost::bind( &deliver_message, the_client, the_client->partner, final_message) ); } deliver_message is a global function. the_client and the_client->partner are both smart pointers to instances of the client class, and partner_sync is a strand that belongs to the client class. Is this legal usage, or am I messing things up? Do I need to keep the string around until the completion handler is invoked? Or does bind take care of this? I keep the buffer around whenever I use the asynchronous sending methods in Boost Asio as this is explicitly stated in the documentation, but is this case the same? Thanks in advance for any clarifications. Kind regards, Philip Bennefall

3 2

[config] BOOST_STL_SUPPORTS_NEW_UNICODE_LOCALES macro?
by Antony Polukhin 07 Apr '12

07 Apr '12

Hi, I'm interested in preprocessor macro, that provides info about std::locale() usability with char16_t and char32_t character types. Currently, some compilers provide new Unicode character types, but calls to std::locale() generate runtime error. I'd like to use that macro to: * provide compile time errors instead of runtime errors * enable/disable some Boost.Lexical_cast tests. Another useful macro would be BOOST_UNICODE_FULL_SUPPORT. It can be defined like this: #if !defined(BOOST_NO_CHAR32_T) \ && !defined(BOOST_NO_CHAR16_T) \ && !defined(BOOST_NO_UNICODE_LITERALS) \ && defined(BOOST_STL_SUPPORTS_NEW_UNICODE_LOCALES) #define BOOST_UNICODE_FULL_SUPPORT #endif -- Best regards, Antony Polukhin

1 0

Re: [boost] C++11 Metaprogramming
by Andrzej Krzemienski 06 Apr '12

06 Apr '12

> on Thu Apr 05 2012, Andrzej Krzemienski <akrzemi1-AT-gmail.com> wrote: > >> For the end users of meta-programming library (at least those interested in >> type transformations), I believe that alias templates offer a significant >> improvement to the interface: >> http://akrzemi1.wordpress.com/2012/03/19/meta-functions-in-c11/ > > Yeah... I started doing a bunch of that, but I am not yet convinced it's > an overall improvement. One thing you emphatically *don't* get with > that formulation is lazy evaluation. remove_pointer<int> is valid until > you instantiate it but RemovePointer<int> is not, and the former is > often quite useful. Also, you can't use metafunction forwarding—which > also eliminates vast amounts of typing—with RemovePointer. Also, you > end up needing to define more names than you otherwise would (e.g. both > remove_pointer and RemovePointer). My standard approach when doing this > has been to name them remove_pointer_ and remove_pointer, so at least > they have an obvious and mechanical relationship. I guess my understanding of the name "meta-programming" might be a bit different, and term "end user" might have been too much a mental shortcut, but let me share my view of someone that doesn't want to go to deep into the meta-programming but still needs to use the simple forms thereof (like type traits). This is a somewhat simplified version of what I was facing recently. I need a function that perfect-forwards the argument but returns by value: template <class T> T fun(T&& v); The above is incorrect, because T may be deduced to be an lvalue reference. But be sympathetic, perfect-forwarding is already hard enough to acquire. I need type trait std::decay: template <class T> std::decay<T> fun(T&& v); But this does not work! I forgot "::type". Let's try again: template <class T> std::decay<T>::type fun(T&& v); No. It still doesn't work. And this is the worst part: I forgot the "typename". Having to type this "typename" is really terrible and just scares off many people. If you do not mind it, it only means that you got used to it; but people should not be forced to get used to too many gotchas. Alias templates offer a simplification that can improve the "teachability" of type traits. You may not consider type traits a proper meta-programming, and all I say might be a bit off topic. But if we had these alias templates for type traits, it looks to me, it would make a soft introduction to meta-programming for the newbies. Regards, &rzej

3 2

Re: [boost] C++11 Metaprogramming
by Andrzej Krzemienski 05 Apr '12

05 Apr '12

> I am on the C++Now 2012 schedule giving a talk on metaprogramming in > C++11, which is really just supposed to be an overview of the state of > the art. I am just at the beginnings of my research for this > presentation, having learned a few things and done a few experiments, > and it seemed to me foolish not to ask the Boost community for its > insights. I'm sure y'all have come up with many neat tricks and > techniques. If you'd care to share them here, that would be much > appreciated. For the end users of meta-programming library (at least those interested in type transformations), I believe that alias templates offer a significant improvement to the interface: http://akrzemi1.wordpress.com/2012/03/19/meta-functions-in-c11/ Regards, &rzej

4 5

Belgium C++ Users Group
by Francisco Almeida 05 Apr '12

05 Apr '12

Hello to all, I just subscribed to this mailing list to ask the Boost developer community for anyone actively working on new libraries/library refactoring if they would be interested in presenting to us a lecture about the major changes Boost will undergo, now that the new C++ standard has been published and that support for it is quickly being implemented by the most popular compilers. Of course, assuming any generous Boost developer who happens to live/work in Benelux would be willing to visit us and share his/her experiences/ambitions with us. Best regards, Francisco Almeida

1 0

[type_traits] is_scalar - fit into register?
by Oliver Kowalke 05 Apr '12

05 Apr '12

Hi, is it a correct assumtion that all types which evaluate 'is_scalar<T>::value' to 'true' will fit into a processor register? Oliver

2 1

[math] Explicit message for configure checks
by Steven Watanabe 05 Apr '12

05 Apr '12

AMDG The attached patch just makes the output a little nicer. Okay to commit? In Christ, Steven Watanabe

2 1

boost::indeterminate and std::vector::emplace_back()
by Arno Schödl 04 Apr '12

04 Apr '12

Hi, there is a problem when using boost::indeterminate in conjunction with std::vector::emplace_back: std::vector<boost::tribool> v; v.emplace_back(boost::indeterminate); In VS2010, this code causes error C2383: '_Valty' : default-arguments are not allowed on this symbol The error occurs becasue emplace_back's _Valty template parameter is deduced as the type of boost::indeterminate which is a function with a default argument. What is the recommended way to explicitly create an "indeterminate" tribool value in cases like this? Regards, Arno -- Dr. Arno Schödl | aschoedl(a)think-cell.com Technical Director think-cell Software GmbH | Chausseestr. 8/E | 10115 Berlin | Germany http://www.think-cell.com | phone +49 30 666473-10 | US phone +1 800 891 8091 Amtsgericht Berlin-Charlottenburg, HRB 85229 | European Union VAT Id DE813474306 Directors: Dr. Markus Hannebauer, Dr. Arno Schoedl

2 1

[signals] [vc11] Compile Error (Ticket #1499)
by Joshua Boyce 04 Apr '12

04 Apr '12

The problem causing ticket #1499 is happening again under VC11. https://svn.boost.org/trac/boost/ticket/1499 Build scripts and logs: http://dl.dropbox.com/u/74751/cpp/boost/logs/msvc32-20120319-1118.bat http://dl.dropbox.com/u/74751/cpp/boost/logs/msvc64-20120319-1118.bat http://dl.dropbox.com/u/74751/cpp/boost/logs/msvc32-20120319-1118.txt http://dl.dropbox.com/u/74751/cpp/boost/logs/msvc64-20120319-1118.txt Bumping to check for _MSC_VER <= 1700 does the trick (tested locally). Patch: http://dl.dropbox.com/u/74751/cpp/boost/patches/signals-vc11-fix-20120319-1… Once this is applied the trunk compiles cleanly (well, no errors, there are still lots of warnings) using the VC11 beta. Thanks.

2 3

[propertymap] boost::function as map
by Frank Birbacher 03 Apr '12

03 Apr '12

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi! I've started working on supporting functors as property maps. I've just seen the commit r77506, with msg "Added function_property_map based on code from Philipp Moeller." So I guess I can stop working on that feature? Maybe regarding a boost::function as a property map all by itself (without make_function_property_map) is a good idea? My work is in ^/boost/sandbox-branches/birbacher/propertymap-functormap, BTW. Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG/MacGPG2 v2.0.17 (Darwin) Comment: GPGTools - http://gpgtools.org Comment: keyserver x-hkp://pool.sks-keyservers.net iEYEARECAAYFAk97a0oACgkQhAOUmAZhnmo/qgCcDv19D3TfjW0nLb0hiykSwrzL yfQAnjvTSJv3MZMgBCFS1mGJQKFfDBYO =HCjT -----END PGP SIGNATURE-----

2 1

[preprocessor] PUSH_BACK/_FRONT on empty array broken in 1.49
by Jan Boehme 03 Apr '12

03 Apr '12

Hi! BOOST_PP_ARRAY_PUSH_BACK & BOOST_PP_ARRAY_PUSH_FRONT on empty array leads to invalid code if Boost 1.49 is used. In 1.48 and older it works as expected. An incident was already filed and a sample attached: https://svn.boost.org/trac/boost/ticket/6760 Thanks for solving. Let me know if I can be of further assist. Jan

2 2

Mailing list moderation, (how) does it work?
by Lars Viklund 03 Apr '12

03 Apr '12

Hi list. There's a bloke over in the IRC channel that posted a message to the list last wednesday titled '[Endian] library proposal' which seems to be stuck somewhere as it hasn't showed up yet. Is this list still moderated-on-first-post or might there be another root cause for it not appearing? -- Lars Viklund | zao(a)acc.umu.se

4 4

[Endian] library proposal
by David Stone 03 Apr '12

03 Apr '12

https://bitbucket.org/davidstone/endian A while back, I had the somewhat common problem of networking in C++. Libraries like Boost.Bind and Boost.Asio proved immensely helpful, but there wasn't anything in Boost that would take care of the byte ordering. Fortunately, I could use the hton family of functions (htonl, htons, ntohl, ntohs) because all of my networking code was 4 bytes or smaller. Later on, I was writing some code that created hashes (specifically MD5 and SHA-2). In the quest for more performance, I tried to maximize the amount of memory I accessed at once (grabbing 4, 8, or even sizeof (uintmax_t) bytes at a time, instead of 1). This also meant that I had to make sure I manipulated those bytes in the proper order, so I went to my networking code and tried to reuse that. However, I quickly ran into some problems, the largest of which is that there is no htonll or similar for 8-byte integers. So I did what any self- respecting programmer would do: I wrote my own using bit shifting. My work paid off, and I was rewarded with a few % increase in performance in my library. I naturally wondered if I could do better, and I found out that yes, I could do better than dynamic endian determination and manual bit shifting. This led me to make a complete library, with the goal of submitting it to Boost. Imagine my surprise to find out that just a few months ago, Beman Dawes submitted his own version of such a library! However, I feel my version offers a few improvements over parts of Dawes's library. My library does not provide any extra integer types. All mine does is convert the representation. For this reason, I feel it would probably be best for the final Boost.Endian library to combine my library with Dawes's. Here is an overview of the features of my library, with emphasis given on the relative strengths of what I have written (in no particular order) * My library uses compiler intrinsics where they exist. Currently, it uses intrinsics with GCC, Clang, MSVC, and (according to the documentation, I haven't tested) ICC. On GCC, where I have done most of my testing, using intrinsics gave a small (but measurable) performance boost. I believe my timings suggested about a 3.5% increase in speed using the intrinsic version vs. using a manual bit- shifting version with compiler options: -Ofast -march=native -funsafe-loop-optimizations which I believe is close to the strongest set of optimizations gcc supports. * My library uses static determination of endianness where possible (as defined in boost/detail/endian.hpp), and dynamic determination of endianness only when that fails. Static determination gave me about a 1.25% increase in speed over dynamic determination (and has slightly smaller memory requirements, but they are probably on the order of one word or two). * My library uses templates to determine which byte reordering function to call. This genericity was essential to support my SHA-2 solution, for instance, because the SHA-2 hashing algorithm is actually a family of 4 functions, half of which use a 32-bit word size, and half of which use a 64-bit word size. I had already minimized code duplication by use of templates, and a template-based solution works much better with generic code (while not inconveniencing non- template code) than functions like htonl / htons. * My library returns results via return value, rather than by reference. This is more natural and likely leads to greater performance (due to not having to reference / dereference built-in types). It also allows const-correct programming. * My library includes thorough unit testing that doubles as a performance test. Compiling the .cpp file and calling it normally is a simple unit test that fully exercises its capabilities (it calls multiple versions of conversion functions and verifies dynamic byte order determination is working as expected). It also accepts an optional command-line argument as an integer that states how many iterations of the unit tests to run. The program then reports how long each test took. * Like Dawes's library, my library does not (yet) include support for floating point numbers. The reason for this is that floating point endianness is not well documented or as consistent. It's possible for there to be little endian floating point numbers and big endian integers on the same machine. Rather than suggest that the problem is solved by adding in support for floating point numbers, attempting to use them will result in a compile-time error. However, thanks to my library's use of type traits, changing around most of the functions is as simple as changing is_integral with is_numeric. I'm not even sure if traditional endianness can describe floating point numbers as a whole, or if (for example) the mantissa and the exponent are each stored in a particular (hopefully identical) endianness. This could lead to numbers with byte ordering like DCBA HGEF (where the first part represents the mantissa and the second the exponent, or perhaps it's the other way around). Basic byte-swapping functions will not cope with this, and as such, I'll need to do more research. * My library supports big-endian, little-endian, and PDP-endian. * I have tested the library with gcc 4.6.2 on Fedora 16 64-bit and Fedora 16 32-bit. I have tested with clang 3.0 on Fedora 16 64-bit. I have tested with MSVC 9 and 11 (I believe those were the versions I used) on Windows 7 64-bit. My code compiles with no warnings in GCC, even when set to the paranoid warning levels described in this post: http://stackoverflow.com/a/9862800 . It nearly compiles cleanly in Visual Studio at /W4, except that it complains about a conditional expression being constant in a template (it's always true for some instantiations, and always false for others). Even with /Wall, it compiled cleanly (other than library code), with the exception of the above mentioned warning about constant conditional expressions, and a few confusing signed / unsigned mismatch warnings. Unfortunately, I do not have a big-endian or pdp- endian machine to test on. However, my MD5 and SHA-2 tests still validate (which they would fail to do if my big-endian routines were wrong). * I'm a little uncertain about my dynamic byte ordering. I currently determine it once and save the result to a global const bool. I'm not sure if that's the best way (but it did give a few % increase in performance over computing it every time). For these reasons, I hope you consider my library for inclusion in Boost. https://bitbucket.org/davidstone/endian

1 1

[scope_exit] C++11 freely uses typename (on MSVC10?)
by lcaminiti 03 Apr '12

03 Apr '12

Hi all, Isn't it C++11 supposed to allow to use typename freely even outside type-dependent context? Does MSVC10 support this? For example, is the following supposed to compile on MSVC10? #include <boost/mpl/identity.hpp> int main() { typedef typename boost::mpl::identity<int>::type t; t i = 0; return i; } Note: Using typename freely will allow me to not introduce SCOPE_EXIT_ALL_TPL and still support this_ (not just this). Thanks. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-scope-exit-C-11-freely-uses-typena… Sent from the Boost - Dev mailing list archive at Nabble.com.

4 5

[git] Mercurial?
by Daryle Walker 02 Apr '12

02 Apr '12

Git has a competitor called Mercurial? If we're moving to a Distributed-VCS, should we go to Mercurial instead of Git? They're kind-of like CVS vs. Subversion, except I think they came up in parallel. (While Subversion was designed as an updated CVS.) I think Git was made up of a bunch of script hacks, while Mercurial was a regimented single program. I don't have a preference, but I want to make sure we consider the rival options. Daryle W.

48 236

[test] Use of namespace qualifier before floating point functions in boost/test/impl/execution_monitor.hpp
by Jeremiah Willcock 02 Apr '12

02 Apr '12

According to http://pubs.opengroup.org/onlinepubs/009604599/basedefs/fenv.h.html, operations such as feclearexcept can be defined as macros, and at least some versions of Glibc do that by default. The use of explicit :: qualifiers before calls to those in Boost.Test fails to compile. Is there a workaround for that (other than __NO_MATH_INLINES)? -- Jeremiah Willcock

1 1

[asio] ip::tcp::socket thread safety
by Gaetano Mendola 02 Apr '12

02 Apr '12

Hi all, reading the manual I see that ip::tcp::socket thread safety on shared object is not safe. In my application I'm using: ip::tcp::socket::async_connect boost::asio::async_read( ip::tcp::socket , ...) the application queue an async_read or an async_connect inside the receiving handler (in case of error it retry the connection). >From an external thread (to stop the reception) I perform a: ip::tcp::socket::shutdown ip::tcp::socket::close do I have realy to synchronize the async_connect/async_read with shutdown/close ? Using a mutex to protect those calls seems an overkill, may be shutdown and close can be called in concurrency with async_connect/async_read and the documentation is just conservative? Regards Gaetano Mendola

2 1

[quickbook] coloring code syntax
by lcaminiti 02 Apr '12

02 Apr '12

Hello all, Is there a way to tell QuickBook code fragments to color words that are not C++ keyword for example in blue or in other colors? For example, in `int i = 0;` "int" is colored in blue. I'd like that in `requires Copyable<T>` "requires" is colored in blue (or some other color that I can specify). Thanks a lot! --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-quickbook-coloring-code-syntax-tp4… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 2

[result_of] Test fails on clang trunk and gcc-4.7 due to changes in FDIS
by Michel Morin 01 Apr '12

01 Apr '12

In the code below, const int f(); decltype(f()) i = 0; `i` has type `int` (not `const int`) in C++11. This is because `f()` is a prvalue of a non-class type (i.e. `const int`) and so its cv qualifiers are ignored. C++0x drafts (before FDIS) had a special rule for function calls in decltype: if e is a function call or an invocation of an overloaded operator (parentheses around e are ignored), decltype(e) is the return type of the statically chosen function; but this was removed in FDIS. Clang-3.1 (which will be clang-3.1) and gcc-4.7 seem to have implemented this change, and this change breaks the test case (libs/utility/test/result_of_test.cpp) on those compilers in a C++11 mode. The following are the errors messages: [1] result_of_test.cpp:210:3: error: static assertion failed: (is_same<result_of<const result_of_member_function_template(double)>::type, const double>::value) [2] result_of_test.cpp:211:3: error: static assertion failed: (is_same<result_of<volatile result_of_member_function_template(double)>::type, volatile double>::value) [3] result_of_test.cpp:212:3: error: static assertion failed: (is_same<result_of<const volatile result_of_member_function_template(double)>::type, const volatile double>::value) [4] result_of_test.cpp:239:3: error: static assertion failed: (is_same<result_of<const volatile no_result_type_or_result_of(void)>::type, const unsigned short>::value) [5] result_of_test.cpp:244:3: error: static assertion failed: (is_same<result_of<const volatile no_result_type_or_result_of_template<void>(void)>::type, const unsigned short>::value) Regards, Michel

3 10

Status of proposed boost.overload?
by niXman 01 Apr '12

01 Apr '12

Hello list! boost.overload: http://svn.boost.org/svn/boost/sandbox/overload/ The library will be accepted into the boost libraries ? -- Regards, niXman

5 11

[container][memory] Request to move allocator_arg_t and uses_allocator to a memory related file.
by Vicente J. Botet Escriba 31 Mar '12

31 Mar '12

Hi, I want to add Allocators to the packaged_task and promise class of Boost.Thread template <class Allocator> promise(allocator_arg_t, const Allocator& a); template <class F, class Allocator> explicit packaged_task(allocator_arg_t, const Allocator& a, F&& f); I see that Boost.Container has already defined in namespace boost::container and in file boost/container/scoped_allocator.hpp the following struct allocator_arg_t { }; constexpr allocator_arg_t allocator_arg = allocator_arg_t(); template <class T, class Alloc> struct uses_allocator; I would like to shared these to all the Boost libraries. I don't think it is a good idea to make Boost.Thread depend on Boost.Container just for this. Could these declarations be included in a specific file? These declaration are included in <memory> in the C++11. What would be the best library to contain these declarations? What about a new boost/memory.hpp file? What about moving them to the boost or boost::memory namespace? Best, Vicente

2 5

[offtopic] C++Now! Room Reservation at Aspen Meadows
by Hartmut Kaiser 31 Mar '12

31 Mar '12

Hey all, If somebody needs a room reservation at the Aspen Meadows for C++Now in May, please get in contact with me offline. I have to cancel my trip and would like to avoid the cancellation penalty for my booked room. Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

1 0

[guideline] 31 character filenames?
by Eric Niebler 30 Mar '12

30 Mar '12

Our current guidelines[1] say filenames should not exceed 31 characters. This was recently brought to my attention by a bug[2] from someone who actually cares because he uses the ODS-2 filesystem on OpenVMS. On a lark, I hacked the inspect tool to check for too-long filenames and lo! found a bazillion. Most (but not all) violations are from doc files auto-generated by doxygen and docbook, but which nevertheless go out with the boost distribution and so should conform. (Right?) So, should we care? Considering that we have little control(?) over how doxygen and docbook generate their files? I have fixed the bug in question, but it feels like a token effort. Should we just drop support for niche filesystems like ODS-2, and close all future bugs "won't fix"? [1] http://www.boost.org/development/requirements.html [2] https://svn.boost.org/trac/boost/ticket/6196 -- Eric Niebler BoostPro Computing http://www.boostpro.com

10 14

[Assign][GIL] Boost Assign and GIL incompatibility in gcc 4.3.2
by Andrew Hundt 29 Mar '12

29 Mar '12

The following source code compiles under clang 3.1, but fails under gcc 4.3.2 with boost version 1.46. It doesn't look like there are updates to either library in the boost news list since then. #include <vector> #include <boost/assign/std/vector.hpp> // for 'operator+=()' #include <boost/gil/gil_all.hpp> int main(int argc, char** argv){ using namespace boost::assign; std::vector<int> values; values += 1, 2, 3, 4; typedef boost::gil::rgb8_pixel_t pt; std::vector<pt> pixValues; pixValues += pt(1,2,3),pt(2,3,4); } ------------------------------------- Compiler versions: FAILED: gcc (SUSE Linux) 4.3.2 [gcc-4_3-branch revision 141291] Copyright (C) 2008 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. SUCCEEDED: Apple clang version 3.1 (tags/Apple/clang-318.0.54) (based on LLVM 3.1svn) Target: x86_64-apple-darwin11.3.0 Thread model: posix Cheers! Andrew Hundt

3 3

Arena/Linear allocators
by Olaf van der Spek 29 Mar '12

29 Mar '12

Hi, I'm looking for arena/linear allocators, for use with multi_index, unordered_map and others. Does Boost provide anything like this? There's Boost Pool, but it only provides a singleton pool allocator. -- Olaf

2 2

[contract] nothing special about nested classes
by lcaminiti 29 Mar '12

29 Mar '12

Hello all, In the _many_ Contract Programming references that I have read (including N1962): http://contractpp.svn.sourceforge.net/viewvc/contractpp/trunk/doc/html/cont… I didn't find anything special about contracts for nested classes. I think that is because nested classes are executed at run-time "orthogonally" with respect to their enclosing classes. In other words, nesting a class only nests it's name (and changes some visibility rules) but it does not effect the run-time execution of the class and therefore it does not affect the contracts checked for the nested class. For example, the execution of a nested class y should only check y's invariants and not also the invariants of its enclosing class x: #include <contract.hpp> #include <iostream> CONTRACT_CLASS( struct (x) // enclosing class ) { CONTRACT_CLASS_INVARIANT( std::cout << "x's invariant" << std::endl ) CONTRACT_CLASS( public struct (y) // nested class ) { CONTRACT_CLASS_INVARIANT( std::cout << "y's invariant" << std::endl ) CONTRACT_FUNCTION( public void (f) ( void ) ) {} }; }; int main ( void ) { x::y yy; yy.f(); // checks y's invariant but not x's invariant return 0; } In fact in this example an object of x is not even created. Of course, if y was to create or get an object of x and invoke x's member functions then x's contracts will be checked as usual. This makes sense to me but I thought to share it with the ML. Thanks. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-contract-nothing-special-about-nes… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Boost Optional
by Rafael Justo 29 Mar '12

29 Mar '12

Hello! This is my first post in this list. =) I was looking today at Boost Optional (great work!). And I was wondering how could I do something like the bellow code. -------------------------------- #include <boost/optional.hpp> class Test {}; boost::optional<Test> get() { return boost::optional<Test>(); } int main() { if (get() == true) { // OK } else if (get() == false) { // ERROR } return 0; } -------------------------------- But there's no "operator==" with bool in optional.hpp, so the above code don't compile (i have checked version 1.49). Is it possible to add the patch described bellow in optional.hpp to solve this problem? -------------------------------- --- boost_1_49_0/boost/optional/optional.hpp 2010-12-18 19:29:39.000000000 -0200 +++ boost_1_49_0_new/boost/optional/optional.hpp 2012-03-28 16:03:53.417578997 -0300 @@ -616,6 +616,11 @@ return *this ; } + bool operator== (const bool condition) + { + return ((*this && condition) || (!*this && !condition)); + } + void swap( optional & arg ) { // allow for Koenig lookup -------------------------------- Best regards, Rafael Justo

4 4

using of circular_buffer
by news.gmane.org 28 Mar '12

28 Mar '12

Hello there, i am new here and i just want to say "hi". so, i'm using boost almost a year now, usually i just used the array component. latley i wanted to implement the circular_buffer. i've defined it in a class after the private-modifier like this: boost::circular_buffer<std::string> textBuffer(10); (as take from the documentation) but my compiler on minGW will throw an error. so, i guess i got something wrong in declaring a string-textbuffer with the lenght of 10?! in the boost-docs there is following example: boost::circular_buffer<int> cb(3); help is appreciated, best would be a working example and a little hint which information is may have missed. greetings tony

3 4

Fwd: [Boost-bugs] [Boost C++ Libraries] #380: Support for bundled properties in graph adaptors
by Marshall Clow 28 Mar '12

28 Mar '12

I just wanted everyone to notice that Jeremiah just closed a _seven year old_ bug in boost. -- Marshall Begin forwarded message: > From: "Boost C++ Libraries" <noreply(a)lists.boost.org> > Subject: Re: [Boost-bugs] [Boost C++ Libraries] #380: Support for bundled properties in graph adaptors > Date: March 28, 2012 1:47:03 PM PDT > Cc: boost-bugs(a)lists.boost.org > Reply-To: boost(a)lists.boost.org > > #380: Support for bundled properties in graph adaptors > -----------------------------------+---------------------------------------- > Reporter: dgregor | Owner: dgregor > Type: Bugs | Status: closed > Milestone: To Be Determined | Component: graph > Version: Boost Release Branch | Severity: Problem > Resolution: wontfix | Keywords: > -----------------------------------+---------------------------------------- > Changes (by jewillco): > > * status: reopened => closed > * resolution: => wontfix > > > Old description: > >> {{{ >> The graph adaptors (such as subgraph) do not support bundled >> properties, but they should. >> }}} > > New description: > > {{{ > The graph adaptors (such as subgraph) do not support bundled > properties, but they should. > }}} > > -- > > Comment: > > This is likely to work now, so closing as wontfix. Please reopen if the > problem still exists in the trunk version of Boost. > > -- > Ticket URL: <https://svn.boost.org/trac/boost/ticket/380#comment:7> > Boost C++ Libraries <http://www.boost.org/> > Boost provides free peer-reviewed portable C++ source libraries. > _______________________________________________ > Boost-bugs mailing list > Boost-bugs(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-bugs -- 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

2 1

DCVS vs CVS: call for constructivism
by Philippe Vaucher 28 Mar '12

28 Mar '12

Hello, I think we all know understood that there are people from both camps, some with emotional arguments, some with constructive arguments, but it's not really moving anywhere. We need to start listing what would have to be done and once we have such a map see if it's worth it before discussing pointless things. Just so we can redirect people saying things like "Nobody told me a real advantage yet" to this post, here's a recapitulation of what I think the advantages/disadvantages of a DCVS is ( http://www.ericsink.com/vcbe/html/dvcs_advantages.html, http://www.ericsink.com/vcbe/html/dvcs_weaknesses.html) Pro: - Offline work (you can use diffs, you can commit) - Speed of operations compared to svn - No need to setup a server to work locally (encourages participation (focus on working first, then sharing later)) Cons: - Cannot check out subpaths - Cannot lock files - Would require people to change their habits and learn new tools I think most people in the svn-camp will tell that with the 1.8 checkpoints feature you can now also commit while offline and thus the only advantages for DCVS seems to be speed and the ability to check all the data while offline. I think the people that are opposed to the change unfortunately won't be convinced by those arguments, even tho pretty much every who switched to DCVS will tell you that the advantages are worth it and it's more than simply speed or freedom, it's a philosophy etc. So I think the best thing to do now is first to make a map of what would have to be done if we decided to switch, to see if it's an option at all. Here's a simple draft, please participate into making it better: - Import current history - Migrate the existing hooks - Migrate the existing scripts around. - Migrate the test runners - Trac / Website integration (redmine with git extensions?) - Rights management (gitolite?) - Update release procedures Maybe we'd start a page on the wiki, but the idea is to find out if there are more steps to be done and if there's any showstopper in those steps. I think the best solution would be to offer the repository with several protocols, namely git/hg/svn so everyone could use the tool they want (e.g github offers svn/git, I know other hosts do it too). Philippe

10 19

[Lockfree] Small compilation error with gcc -Wall
by Julien Nitard 28 Mar '12

28 Mar '12

Hi all, The following code seems to generate an "unused variable" variable warning with g++ -Wall. I am working on the latest version available from git, though I am not sure if this version is relevant. #include <boost/lockfree/fifo.hpp> typedef boost::lockfree::fifo<ReplicateData, boost::lockfree::static_freelist_t> Queue; Queue _buffer(4096); It occurs in fifo.hpp at line 263. Replacing tagged_node_ptr head2 = head_.load(memory_order_relaxed); By head_.load(memory_order_relaxed); Seems to do the job. Many thanks, Julien

2 1

Boost Fusion suggestion
by Pavel Bažant 28 Mar '12

28 Mar '12

I am not actually a Boost developer, but have the following suggestion regarding boost.fusion: I find the macro BOOST_FUSION_DEFINE_STRUCT potentially very useful, but it does not provide means to influence the initialization list of the default constructor. Alternatively, means to emulate c++11 default initialization (the struct Foo {int x=10;} syntax) could be emulated. Such feature would be very useful, as it would minimize repetition and make it easier to ensure that uninitialized variables are nowhere used. I already generate my structs from BOOST_PP sequences in a similar way to BOOST_FUSION_DEFINE_STRUCT to avoid having to write json serialization boilerplate, but a variant of BOOST_FUSION_DEFINE_STRUCT i am suggesting would make this task even simpler. Pavel Bazant

2 1

[functional] [overloaded_function] polymorphic functions?
by Lorenzo Caminiti 27 Mar '12

27 Mar '12

Hello all, I spent some time trying to make overloaded_function support polymorphic functions but I had little success :( 1) I was able to do this (see code below): overloaded_function< void (int) , functor<poly, void (generic)> > o(f, p); o(321); o(3.21); o("cba"); But I don't like it because I explicitly have to pass the functor type poly. I wanted instead to only use generic to tag the template parameters in the signature: overloaded_function< void (int) , void (generic) > o(f, p); o(321); o(3.21); o("cba"); I'd consider this acceptable but I wasn't able to program this because I loose p's type (poly) in base so base cannot hold a reference to the functor p... Is there a way around this? (Some type-erasure magic maybe??) 2) I don't think this can work with function templates because in order to get a pointer to a function template you have to instantiate it: g<char*> Now I can get the function pointer but it's not polymorphic anymore... 3) I don't think there is any way to implement make_overloaded_function with polymorphic types because I can't re-construct the function signature from the functor given that its operator contains template parameters... I have no idea on how to work around this... If you have suggestions for 1, 2, or 3), they are welcome. Otherwise, it seems that supporting polymorphic functions in overloaded_function is not really feasible... The little I got so far: #include <boost/function.hpp> #include <boost/type_traits/function_traits.hpp> #include <iostream> void f(int x) { std::cout << x << std::endl; } template<typename T> void g(T x) { std::cout << x << std::endl; } struct poly { template<typename T> void operator()(T x) { std::cout << x << std::endl; } }; template<typename F> struct base { template<typename G> base(G g) : f_(g) {} typename boost::function_traits<F>::result_type operator()( typename boost::function_traits<F>::arg1_type arg1 ) { return f_(arg1); } private: boost::function<F> f_; }; struct generic; template<typename Ftor, typename F> struct functor; template<typename Ftor, typename R> struct base< functor<Ftor, R (generic)> > { base(Ftor& ftor) : ftor_(ftor) {} template<typename Arg1> R operator()(Arg1 arg1) { return ftor_(arg1); } private: Ftor& ftor_; }; template<typename F1, typename F2> struct overloaded_function : base<F1>, base<F2> { template<typename G1, typename G2> overloaded_function(G1 g1, G2 g2) : base<F1>(g1), base<F2>(g2) {} using base<F1>::operator(); using base<F2>::operator(); }; int main() { f(123); g("xyz"); boost::function<void (char*)> gg = g<char*>; poly p; p(1.23); p("abc"); overloaded_function< void (int) , functor<poly, void (generic)> > o(f, p); o(321); o(3.21); o("cba"); return 0; } Thanks a lot. --Lorenzo

4 5

[git] What's the IDE picture like?
by Rene Rivera 27 Mar '12

27 Mar '12

All this talk about switching to git brings up one important question for me, and I suspect others.. Given all the various git-flow, git-this, git-that, git-whatever, tools that are getting mentioned.. What is the process for a user that wants to do their development, including version control, like? Specifically what does an: * Eclipse user do? * Xcode user do? * VIsualStudio user do? I ask because I'm really tired of learning yet more command lines tools at this stage in my life. And even though all GUI tools have drawbacks they do have the advantage that they condense the workflow usages to something understandable. And I would be really hard pressed to use any new version control system that I can't use a GUI. And preferably an integrated GUI. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

9 12

[move] explicit moving from a rvalue
by Vicente J. Botet Escriba 27 Mar '12

27 Mar '12

Hi Ion, With the current emulation of move semantics of Boost.Thread using Boost.move, I have a case that I would like to make working in a portable way boost::thread t = boost::thread( MoveOnly()); The library declares the template move constructor from a movable callable as as follows template <class F> explicit thread(boost::rv<F>& f); and MoveOnly is declared as defined below. The problem is a know limitation as the compiler is unable to deduce F as been MoveOnly even if MoveOnly is convertible to boost::rv<MoveOnly>& Jeffrey Lee Hellrung, Jr. made a proposal to try to solve the issue, but his proposal has a performance penality. Here it is a less elegant but efficient enough alternative. The addition of a explicit move conversion as ::boost::rv<MoveOnly>& move() { return *static_cast< ::boost::rv<MoveOnly>* >(this); } allows to the following to work as expected boost::thread t = boost::thread( MoveOnly().move()); While this workaround works when we are using the emulation it doesn't works when rvalue references are supported. I have defined a macro BOOST_EXPLICIT_MOVE that allows to write portable code #if ! defined BOOST_NO_RVALUE_REFERENCES #define BOOST_MOVE(RVALUE) RVALUE #else #define BOOST_MOVE(RVALUE) RVALUE.move() #endif that can be used as boost::thread t = boost::thread( BOOST_MOVE(MoveOnly())); The move() function is not really needed as the macro can hide the needed conversion, but could be preferred by users that don't need to make portable programs. The evident liability is of course the use of the macro. Is there something wrong on this design, something to to improve? The same design can be used on compilers, such as as SunStudio (see https://svn.boost.org/trac/boost/ticket/6222) that prefer the overload of a private copy constructor to an public move constructor. On these kind of compilers the following overload private: MoveOnly(MoveOnly&); public MoveOnly(boost::rv<MoveOnly>&) makes the following to fail at compile time MoveOnly MakeMoveOnly() { return MoveOnly(); } but MoveOnly( MakeMoveOnly(() { return BOOST_MOVE(MoveOnly()); } will work. Do you think that member functions as the explicit move() and a macro as BOOST_MOVE can be added to Boost.Move emulation? Best, Vicente ///////////////////////////// class MoveOnly { #ifndef BOOST_NO_DELETED_FUNCTIONS public: MoveOnly(const MoveOnly&)=delete; MoveOnly& operator=(MoveOnly const&); #else private: MoveOnly(MoveOnly&); MoveOnly& operator=(MoveOnly&); public: #endif MoveOnly() { } #ifndef BOOST_NO_RVALUE_REFERENCES MoveOnly(MoveOnly&&) {} #else #if defined BOOST_THREAD_USES_MOVE MoveOnly(boost::rv<MoveOnly>&) {} MoveOnly& operator=(boost::rv<MoveOnly>&) { return *this; } operator ::boost::rv<MoveOnly>&() { return *static_cast< ::boost::rv<MoveOnly>* >(this); } operator const ::boost::rv<MoveOnly>&() const { return *static_cast<const ::boost::rv<MoveOnly>* >(this); } ::boost::rv<MoveOnly>& move() { return *static_cast< ::boost::rv<MoveOnly>* >(this); } const ::boost::rv<MoveOnly>& move() const { return *static_cast<const ::boost::rv<MoveOnly>* >(this); } #else #error #endif #endif void operator()() { } };

3 5

[quickbook] Controling the layout of table columns in docbook/fo output
by Andreas Pokorny 27 Mar '12

27 Mar '12

Hi, In an earlier thread I mentioned that I am using quickbook to write software design specification/documentation. The whole document grows nicely now. Since more people are contributing, I added howto chapters to the end of the document, including some kind of guided quickbook skeleton for new chapters and the quickbook documentation itself. The quickbook documentation creates warnings with fop: Mar 12, 2012 8:11:46 PM org.apache.fop.events.LoggingEventListener processEvent WARNING: table-layout="fixed" and column-width unspecified => falling back to proportional-column-width(1) (See position 1686:869) Mar 12, 2012 8:11:46 PM org.apache.fop.events.LoggingEventListener processEvent WARNING: table-layout="fixed" and column-width unspecified => falling back to proportional-column-width(1) (See position 1686:905) Mar 12, 2012 8:11:46 PM org.apache.fop.events.LoggingEventListener processEvent WARNING: table-layout="fixed" and column-width unspecified => falling back to proportional-column-width(1) (See position 1896:796) and more. That happens for every table. Inside the documentation about tables there one containing hello world source. There the proportional column width makes the source code leave the table and text area of the page. Is there a yet undocumented way to control column sizes? regards Andreas

2 4

Re: [boost] [utility] Adding noexcept to boost::declval
by Michel Morin 27 Mar '12

27 Mar '12

Vicente J. Botet Escriba wrote >> Summary: >> Defining declval<T>() as add_lvalue_reference<T>::type is wrong; >> add_lvalue_reference should be removed! >> >> > There is something that disturb me by returning just T, doesn't this forces > the type T to CopyConstructible? Nope. T needs not to be CopyConstructible (Note that declval can be used only in unevaluated contexts.) > The idea to use T& instead was to avoid > this. You shouldn't do this, because this transforms rvalues to lvalues. > I have rolled back at revision 77562. Thanks, Vicente! Minor issue: `#include <boost/type_traits/add_lvalue_reference.hpp>` is not removed yet. Regards, Michel

2 1

[filesystem] Heads up; filesystem in trunk unstable while V2 removed
by Beman Dawes 26 Mar '12

26 Mar '12

To ensure that history is preserved, the removal of version 2 will be done as three commits. Filesystem in trunk will be unstable during until all three commits are completed. Hopefully this will take less than an hour. I'll post a notice when complete. --Beman

3 7

[gsoc]
by Andrew Sutton 26 Mar '12

26 Mar '12

It looks like there will be no summer of Code for Boost this year. For whatever reason, Google has decided not to accept Boost as a mentoring organization. Andrew

10 18

Re: [boost] [utility] Adding noexcept to boost::declval
by Michel Morin 26 Mar '12

26 Mar '12

(Forgot to send to the list; now back to the list again.) Vicente J. Botet Escriba wrote: > OK, I will rollback it and analyze the breaking change. The important thing is that declval<T>() should preserve the constness/non-constness and the rvalueness/lvalueness of T. Essentially, it's OK to define declval<T>() as simply T. Then, why declval<T>() is defined as add_rvalue_reference<T>::type? This is because * When declval<T>() is defined as T, we cannot use abstract types as T. * When declval<T>() is defined as T&&, we cannot use void as T. The definition with add_rvalue_reference<T>::type also allows to use incomplete types as T. In C++03, it is not possible to construct rvalues of abstract types or incomplete types. So, the correct way to define declval<T>() in C++03 is to just use T. And this is the definition of declval<T>() in the previous version of boost::declval when BOOST_NO_RVALUE_REFERENCES is defined. Summary: Defining declval<T>() as add_lvalue_reference<T>::type is wrong; add_lvalue_reference should be removed! Regards, Michel

1 0

Re: [boost] [gsoc]
by Andrzej Krzemienski 26 Mar '12

26 Mar '12

> From an outside point of view, i do agree. I don't see a lot of Boost GSOC > projects completed. And that's really disapointing. > In my fileds of interests, i would love to see some libraries integrated > that deals with : > - large integer / large fixed point computation > - json parser/ writer > - xml parser/ writer like pugiwml > - crossplatform async file io for boost asio (not only for windows) > - xmpp/sip stack Boost does provide parsers and writers for JSON and XML files. See http://www.boost.org/doc/libs/1_49_0/doc/html/property_tree.html. Regards, &rzej

2 1

how to mark a test "fail*"
by lcaminiti 25 Mar '12

25 Mar '12

Hello all, Expected regression test failures are marked with "fail*" and give an explanation for why the failure is expected: http://www.boost.org/development/tests/trunk/developer/output/Sandia-intel-… How do I add an explanation for a new expected failure? Is there some documentation on this process? For example, emulation_this and emulation_this_tpl are expected to fail on MSVC8 and the user should use native type-of for those-- how do I add a link with such explanation the regression test table? http://www.boost.org/development/tests/trunk/developer/output/VC8%20jc-bell… http://www.boost.org/development/tests/trunk/developer/output/VC8%20jc-bell… Thanks a lot! --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-how-to-mark-a-test-fail-tp4503985p… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

[mpi] all_reduce and MPI_IN_PLACE like feature
by Alain O Miniussi 25 Mar '12

25 Mar '12

Hi, MPI_Allreduce offers the possibility to use the same buffer for the send and recv data: http://www.open-mpi.org/doc/v1.4/man3/MPI_Allreduce.3.php#toc8 It seems that boost's all_reduce does not allow such a feature. First, I would like to know if the previous statement is correct and, if yes, if it was just overlooked or if there was a reason for that? Just in case, I filed a ticket regarding that issue, along with a tentative patch, in https://svn.boost.org/trac/boost/ticket/6704 Regards, Alain

1 0

Using C++11 lambdas to replace Phoenix in MPL expressions
by Augustus Saunders 25 Mar '12

25 Mar '12

I use Phoenix to essentially turn code into types which can then be manipulated through MPL. I mostly use this to conditionally select algorithms or to include/exclude code at compile time, based on some logic written with MPL. I was interested in writing the code fragments using the new C++11 lambda expressions as it gives a more natural way to write code. While you can get the type of a lambda expression with decltype, the problem I've run into is instantiating the resultant type in order to actually get the function to execute. Lambdas have no default constructor, which makes sense, as there would be no way to deal with the capture variables. So I'm wondering if anybody can shed some light on manually instantiating lambdas. I would think there is a way (possibly shady) to do this, at least for lambdas with no capture. Then passing around lambda types as template parameters would be useful, which I think would lead to many interesting results. I only get the digest, so it I would appreciate it if you CC me on any response. Thanks- Augustus

3 6

[lexical_cast][random] ADL problem with gcc c++11
by Joel de Guzman 25 Mar '12

25 Mar '12

Hi, I can't get this to compile on gcc-4.6.1 with -std=c++0x flag: #include <boost/random.hpp> int main() { return 0; } I'm getting an error in lexical_cast: C:\dev\boost/boost/lexical_cast.hpp:1323:120: error: there are no arguments to 'swprintf' that depend on a template parameter, so a declaration of 'swprintf' must be available [-fpermissive] Obviously, I can compile with -fpermissive, but I'd like to report this anyway. Regards, -- Joel de Guzman http://www.boostpro.com http://boost-spirit.com

5 7

Re: [boost] [git] Mercurial?
by David Greene 25 Mar '12

25 Mar '12

Edward Diener <eldiener(a)tropicsoft.com> writes: >> Also back to the point - DVCS are written to provide best possible >> support for merging. This makes 1) or 2) you propose above very >> efficient. In SVN or other centralized systems it is not so, just look >> up the bit I left from Joel's message above. > > I do not believe for even a second that any product can do merging of > the same source file automatically and flawlessly. This strawman keeps resurfacing. No one has claimed than any VCS can avoid manual merging at times. A centralized VCS needs to operate as you outlined: >> Bu how is this different from: >> >> 1) Creating a local SVN repository and importing some branches from >> another SVN repository. >> >> and/or >> >> 2) Having one's own branch of an SVN repository as one's own. #1 is a horribly manual operation. I don't know if you quite grasp how complicated it is. I've been doing it for years. Getting the history preserved correctly is not trivial. #2 has almost no support in SVN. Now that SVN has merge tracking it is marginally better but there are problems with this model. Foremost, the branch has to be in a centralized repository and everyone owkring on the project has to deal with it in some fashion. It's not private in any sense of the word. You can't work on it if you don't have 'net access. You can't back out changes that you realized later were bad and ensure no one else ever sees those changes. The difference with a DVCS is both #1 and #2 are natively supported in the tool. There is no difference between a private local branch, a remote branch in a _de_facto_ central repository and a remote branch in some other random repository. They all look and act the same. I admit it is a tough concept to grasp for someone not used to it. It took me some time to grok it. But now it is second-nature to me and there's no way I'm going back. -Dave

3 4

[config] Why does BOOST_NO_STD_LOCALE imply BOOST_NO_STD_WSTREAMBUF?
by Yechezkel Mett 25 Mar '12

25 Mar '12

I have found the following in config/suffix.hpp: // // We can't have a working std::wstreambuf if there is no std::locale: // # if defined(BOOST_NO_STD_LOCALE) && !defined(BOOST_NO_STD_WSTREAMBUF) # define BOOST_NO_STD_WSTREAMBUF # endif What is the reasoning behind this? My problem is that I am using Windows CE 6.0 with the supplied standard library, and it has no <locale>, yet still seems to provide a working wstreambuf. The effect is that I can't get boost::wformat, which is annoying, considering that the WinCE API uses only wide characters. I have checked that removing this line works. Is there any way to undefine BOOST_NO_STD_WSTREAMBUF without modifying the source? Yechezkel Mett

1 0

Re: [boost] [Boost-commit] svn:boost r77506 - in trunk: boost/property_map libs/property_map/doc libs/property_map/test
by Michel Morin 25 Mar '12

25 Mar '12

> Author: jewillco > Date: 2012-03-23 15:35:52 EDT (Fri, 23 Mar 2012) > New Revision: 77506 > URL: http://svn.boost.org/trac/boost/changeset/77506 […] > --- (empty file) > +++ trunk/boost/property_map/function_property_map.hpp 2012-03-23 […] > +#ifndef BOOST_PROPERTY_MAP_FUNCTION_PROPERTY_MAP_H > +#define BOOST_PROPERTY_MAP_FUNCTION_PROPERTY_MAP_H […] > +#endif /* BOOST_PROPERTY_MAP_FUNCTION_PROPERTY_MAP_H */ s/H/HPP > +template<typename Func, typename Key, typename Ret = typename boost::result_of<Func(Key)>::type> > +class function_property_map: public put_get_helper<Ret, function_property_map<Func, Key, Ret> > { […] > + typedef Ret reference; […] > + reference operator[](const Key& k) const { > + return f(k); > + } > + > + reference operator[](const Key& k) { > + return f(k); > + } […] > + private: > + Func f; > +}; In const version of the subscript operator, `f` is treated as `const Func`. So `reference` might not be appropriate for its return type. You can avoid this issue by making `f` mutable. Or, how about defining the default template argument of `Ret` as `boost::result_of<const Func(Key)>::type` and removing non-const version of the subscript operator? (Since property maps are often passed around by values, it makes less sense to allow stateful functors in `function_property_map`, IMHO.) Regards, Michel

2 2

Re: [boost] Please advise: Boost with LLVM Clang and 0x11 dialect ?
by Steve Ramsey 24 Mar '12

24 Mar '12

On Mar 21, 2012, at 1:35 AM, "John M. Dlugosz" <mpbecey7gu(a)snkmail.com> wrote: > Can someone please advise on how to get Boost headers to work when compiling using Clang (as found on Apple OSX/iOS development) when the 0x11 dialect is enabled? > > We're stuck at Boost 1.47 because 1.48 doesn't even work with the current settings (C++03 dialect). The Mac developers don't want to fiddle with 1.49 without knowing what the deal is. > > Is there someone who has used Boost on the Apple with Clang who can relate some tales of how it works and offer suggestions? I've had no luck on the Boost.Users mailing list, or a previous post here on Boost.Devel. Is there anyplace else I might ask? At this point, any scrap of wisdom would be appreciated. It's not an automatic process, but once the initial effort is spent, it works beautifully. I should point out that I use both C++11 and libc++, and I ended up making a number of changes to boost build files to get various features working. The biggest problem is the lack of support in tools/build/v2/tools/clang-darwin.jam for specifying the SDK/platform for cross-compiling. My solution since boost 1.47 has been to replace it with a modified copy of tools/build/v2/tools/darwin.jam; if I thought this was going to be an issue for anywhere near as long as it has, I would've sent in a patch half a year ago (aside: do any of the maintainers actually use boost on OS X?). An additional complication is that as of Xcode 4.3, variant toolchains are stored in a different location and use a slightly different directory structure; a nice solution would be to support a build feature to indicate this and respond accordingly; I just hardcode for Xcode 4.3+. I'm happy to send you diffs off-list if you're interested, but it's frankenhacks all the way down until I get around to making a clean patch file for clang-darwin.jam. Steve P.S. The only source/header file with a problem is libs/signals/src/named_slot_map.cpp, which is trivially fixable.

2 1

[filesystem] [svn] How to remove V2 files without loss of V3 history?
by Beman Dawes 24 Mar '12

24 Mar '12

The boost/filesystem directory currently looks like this: v2 config.hpp // actual header convenience.hpp exception.hpp fstream.hpp operations.hpp path.hpp v3 config.hpp // actual header convenience.hpp exception.hpp fstream.hpp operations.hpp path.hpp config.hpp // forwards to v2/config.hpp or v3/config.hpp convenience.hpp exception.hpp fstream.hpp operations.hpp path.hpp It is time to remove the dual version support. What I'd like to do is: * create a branch, * switch to it, * delete the top level forwarding headers, * move the v3 headers up to boost/filesystem, * delete the v2 and v3 directories, * modify the headers as needed, * merge back to trunk. At the completion of the merge, the history for the boost/filesystem headers should include the full history of what were the boost/filesystem/v3 headers. What are the svn commands to accomplish that? Thanks, --Beman

6 15

[utility] Adding noexcept to boost::declval
by Michel Morin 24 Mar '12

24 Mar '12

Now that we have BOOST_NOEXCEPT macro, it is reasonable to add noexcept to boost::declval (by means of BOOST_NOEXCEPT). As a note, std::declval is marked as noexcept. I made a ticket with a patch here: https://svn.boost.org/trac/boost/ticket/6570 If it looks sensible, could someone apply the patch? Regards, Michel

1 1

interprocess with unordered_map
by Joel Young 23 Mar '12

23 Mar '12

>> Folks, I've built a unordered_map in a memory mapped file. The map goes from: typedef boost::interprocess::allocator< char, boost::interprocess::managed_mapped_file::segment_manager > char_allocator_t; typedef boost::interprocess::basic_string< char, std::char_traits<char>, char_allocator_t > typedef std::pair< key_type, pay_type> val_type; typedef boost::interprocess::allocator< val_type, boost::interprocess::managed_mapped_file::segment_manager> allocator_t; typedef boost::unordered_map< key_type, pay_type, boost::hash<key_type>, std::equal_to<key_type>, allocator_t> map_type; Everything works fine on creation. But when I later go to read from the map in a different program where the mapped file is opened read only, I have to do gymcrackery like: // A temporary string that allocates from the mapped file struct shm_clean { // cleanup shared memory on stack-unwind shm_clean() { boost::interprocess::shared_memory_object::remove("StupidSharedMemory"); } ~shm_clean() { boost::interprocess::shared_memory_object::remove("StupidSharedMemory"); } } cleaner; boost::interprocess::managed_shared_memory stupid(boost::interprocess::create_only ,"StupidSharedMemory" ,500); key_type key_val(stupid.get_segment_manager()); to create a temporary to allow me to search since the maps find() method will only take a key_type and interprocess::basic_string WILL NOT implicitly construct from a std::string, nor will it implicitly construct from a char* to itself. Can the interprocess::basic_string be modified to allow these conversions? I hate having to do: key_val = "fruitcake"; db.find(key_val); Suggestions? Thanks! Joel

4 18

[config] PGI config file doesn't defines BOOST_HAS_THREADS
by Vicente J. Botet Escriba 23 Mar '12

23 Mar '12

There is an issue on Boost.Thread regression test for PGI compiler. See https://svn.boost.org/trac/boost/ticket/6354. "pgCC" -INLINE:none -Kieee -fpic -fPIC -gopt -Minform=warn -DBOOST_ALL_NO_LIB=1 -DBOOST_TEST_NO_AUTO_LINK=1 -DBOOST_THREAD_POSIX -DBOOST_THREAD_USE_DLL=1 -D__need_IOV_MAX -I".." -c -o "/scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/pgi-11.9/debug/threading-multi/test_barrier.o" "../libs/thread/test/test_barrier.cpp" "../boost/config/requires_threads.hpp", line 86: catastrophic error: #error directive: "Compiler threading support is not turned on. Please consult your compiler's documentation for the appropriate options to use" # error "Compiler threading support is not turned on. Please consult your compiler's documentation for the appropriate options to use" boost/config/compiler/pgi.hpp defines BOOST_HAS_PTHREADS but not BOOST_HAS_THREADS, resulting in failure in the requires_threads.hpp header. It seems that adding #define BOOST_HAS_THREADS inboost/config/compiler/pgi.hpp solves the issue. John, what do you think? Could I add it? Best, Vicente

3 5