August 2012 - Boost - lists.preview.boost.org

A GUI Library
by jinhao 09 Nov '17

09 Nov '17

Hi, all I am developing a GUI library, it takes aim at easy-to-use and portable library for modern C++ methods. The project at http://stdex.sourceforge.net A git repository at http://nanapro.codeplex.com A brief at http://nanaproject.wordpress.com/2011/12/16/preliminary-study-of-nana-c-lib… Is there any interest in this library? Regards Jinhao

8 8

bad include guards
by Steven Watanabe 26 Jan '17

26 Jan '17

AMDG The following pairs of files have identical include guards ./boost/concept_check/general.hpp ./boost/concept/detail/msvc.hpp ./boost/concept_check/msvc.hpp ./boost/concept/detail/msvc.hpp ./boost/filesystem/cerrno.hpp ./boost/cerrno.hpp ./boost/interprocess/containers/tree.hpp ./boost/interprocess/containers/detail/tree.hpp ./boost/mpl/min_max.hpp ./boost/mpl/max.hpp ./boost/mpl/vector/aux_/front.hpp ./boost/mpl/list/aux_/front.hpp ./boost/multi_index/identity_fwd.hpp ./boost/multi_index/identity.hpp ./boost/python/pointee.hpp ./boost/python/detail/pointee.hpp ./boost/spirit/phoenix/closures.hpp ./boost/lambda/closures.hpp ./boost/xpressive/proto/v1_/proto_typeof.hpp ./boost/xpressive/proto/proto_typeof.hpp ./libs/config/test/boost_no_dep_nested_class.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/config/test/boost_no_mem_templates.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/config/test/boost_no_std_allocator.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/conversion/test.hpp ./libs/any/test.hpp ./libs/interprocess/example/print_container.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/interprocess/test/expand_bwd_test_template.hpp ./libs/interprocess/test/allocation_test_template.hpp ./libs/interprocess/test/printcontainer.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/interprocess/test/print_container.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/iostreams/test/detail/utf8_codecvt_facet.hpp ./boost/detail/utf8_codecvt_facet.hpp ./libs/regex/test/regress/test_regex_search.hpp ./libs/regex/test/regress/test_partial_match.hpp ./libs/serialization/test/C.hpp ./libs/serialization/test/A.hpp ./libs/xpressive/perf/regex_comparison.hpp ./libs/regex/performance/regex_comparison.hpp ./tools/inspect/time_string.hpp ./tools/common/time_string.hpp In Christ, Steven Watanabe

5 8

Arguing about names in Boost libraries
by Edward Diener 06 May '15

06 May '15

What is wrong with the people commenting on libraries for Boost who are so concerned about the names being used ? We are talking only about C++ identifiers and yet there are now endless discussions where people disagree on names or argue that some name is not what they want or that they like some other name, with a list of names that they find adequate. This is irrelevant. There is something mentally wrong about all those peoples spending endless amounts of time around this issue. I notice this does not happen nowadays for just one library but for ever single library, or proposed library, which is mentioned on this mailing list. Is this the way all of you people actually work in your daily jobs, or on your own projects, spending hours and days arguing with others about C++ identifiers for every little thing ? Are you not aware of the absurdity of your endless remarks ? Grow up ! Surely there are better things to do than carry on endlessly about some name, that is should be x or y or z or some other inane preferable list. It's time for somebody to say this, so I will do it. A C++ identifier name, as long as it is vaguely about what the functionality entails, is perfectly adequate. It does not have to satisfy everyone in the universe. Period !

9 10

Why no non-null smart pointers?
by Ross MacGregor 29 Apr '14

29 Apr '14

I just created a very small smart pointer libary for our project. It will contain two types of shared pointers: SharedHandle and NullableSharedHandle. SharedHandle will be a shared pointer that cannot be null by ensuring a non-null construction while NullableSharedHandle will basically be a typedef for boost::shared_ptr. I firmly believe that code can be made more reliable by minimizing the use of nullable pointers. To this end, I think it is important that we start using non-null pointer types. Ideally the compiler would be able to understand a non-null pointer and catch bugs at compile time, but I think we can still improve things with a few runtime checks. If we make sure that a shared pointer is constructed with a non-null pointer and ban any reset() type methods, we guarentee that it points to something. This can be beneficial for the following reasons: 1. Any function that uses this type will no longer be burdened with precondition checks to make sure variables of this type are not null. 2. It's type is simply more explicit and better explains its function. 3. Moving the non-null check to the creation phase will reduce the possibility of encountering null pointer exceptions at runtime (assuming there are many more pointer references than constructor calls). So my little pointer library seems to make a lot of sense, but if so why hasn't this simple smart pointer variation made it into boost yet? Has this been discussed somewhere already? My search on non-null smart pointers is not revealing much discussion on the topic. Regards, Ross

9 16

Interest in Base2/16/32/64 Encoding Library?
by Thomas Kemmer 27 Jan '14

27 Jan '14

Dear Boost Developers, I would like to know if there is interest in incorporating a generic Base2/16/32/64 encoding library into Boost. I am the author of such a libray, hosted at http://code.google.com/p/stlencoders/ and would be willing to contribute and make the effort of "Boostifying" it, if the Boost community is interested in such a thing. There have been several suggestions for a Base64 encoding library on this mailing list in the past. Most of them have been dismissed, since Boost already provides a Base64 implementation with Boost.Serialization's "Dataflow Iterators". Though I appreciate the dataflow iterator's design, from personal experience I think that for the basic task of encoding/decoding, a higher-level interface, e.g. one that takes padding and intermittent whitespace (MIME) into account, would benefit many developers. Currently, the stlencoders library - implements the Base16, Base32 and Base64 encoding schemes as defined in RFC 4648. Base2, i.e. binary encoding, is also supported. - implements encoding and decoding operations as generic algorithms that operate on STL-style iterators - supports different encoding alphabets using custom traits classes - supports different character types - lets the user define if/which non-alphabet characters should be ignored via predicates - provides reasonable performance that matches most "plain C" implementations stlencoders is currently designed as a stand-alone library with no dependencies on Boost (or anything but C++03); it would therefore take some effort and guidance from the community to properly integrate it with the rest of Boost. I would therefore appreciate any feedback regarding your interest in this. Kind Regards, Thomas

7 11

[mpl] integral_c [type_traits] integral_constant limits
by vicente.botet 21 Oct '13

21 Oct '13

Hi, I was testing Boost.Ratio with gcc-4.6 c++0x and I get some compile errors when instantiating std::cout << boost::mpl::integral_c< boost::intmax_t, boost::integer_traits<boost::intmax_t>::const_max >::value ; ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp: In instantiation of 'mpl_::integral_c<long long int, 0x7fffffffffffffffll>': ratio_io\ratio_io.pass.cpp:24:6: instantiated from here ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp:72:96: warning: integer overflow in expression [-Woverflow] ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp:72:96: error: '-0x8000000000000000ll' is not a valid template argument for type 'long long int' because it is a non-constant expression ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp:72:96: error: '-0x8000000000000000ll' is not a constant expression integral_wrapper.hpp:72 contains typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (value + 1)) ) next; The same line pass with gcc-4.6, gcc-4.5 and gcc-4.5 c++0x with just a warning. ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp: In instantiation of 'mpl_::integral_c<long long int, 0x7fffffffffffffffll>': ratio_io\ratio_io.pass.cpp:23:6: instantiated from here ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp:72:96: warning: integer overflow in expression [-Woverflow] integral_c is by integral_constant, but integral_constant doesn't needs next a prior types. This means that with the current implementation we can not use integral_constant with the max value of the type. Do you think this is a bug in integral_constant? Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

4 6

[asio] Randomly having problems reading from the socket
by Torben Wiggerich 29 Jul '13

29 Jul '13

Hi all, I have some problems using the boost.asio.read for a TCP-socket. So far it works fine, but it randomly stops the transfer for at least 5 seconds. To resolve the error I used a simple synchronous server and client from the boost examples and modified it too send a larger amount of data. (307400 Bytes; this size comes from the program I'm trying to get run). On the client side I also changed the reading from the socket to read the complete data with boost.asio.read and transfer_all as argument. Both, server and client, measure the time for sending and reading to the socket and will give an error if it needs more than 1 second. Here is the sourcecode for the server: #include <iostream> #include <string> #include <boost/asio.hpp> #include <boost/date_time/posix_time/posix_time.hpp> using boost::asio::ip::tcp; using namespace boost::posix_time; int main() { try { boost::asio::io_service io_service; tcp::acceptor acceptor(io_service, tcp::endpoint(tcp::v4(), 8002)); tcp::socket socket(io_service); acceptor.accept(socket); unsigned char * array = new unsigned char[307400]; for (;;) { boost::system::error_code ignored_error; ptime startTime = microsec_clock::universal_time(); boost::asio::write(socket, boost::asio::buffer( array, 307400 ), boost::asio::transfer_all(), ignored_error); time_duration neededTime = microsec_clock::universal_time() - startTime; if ( neededTime.total_milliseconds() > 1000 ) { std::cout << "ERROR needed too much time: " << neededTime.total_milliseconds() << "ms" << std::endl; } } } catch (std::exception& e) { std::cerr << e.what() << std::endl; } return 0; } My client sourcecode: #include <iostream> #include <boost/array.hpp> #include <boost/asio.hpp> #include <boost/date_time/posix_time/posix_time.hpp> using boost::asio::ip::tcp; using namespace boost::posix_time; int main(int argc, char* argv[]) { try { if (argc != 2) { std::cerr << "Usage: client <host>" << std::endl; return 1; } boost::asio::io_service io_service; boost::asio::ip::tcp::endpoint endpoint( boost::asio::ip::address::from_string( argv[1] ), 8002 ); tcp::socket socket(io_service); boost::system::error_code error = boost::asio::error::host_not_found; socket.connect( endpoint, error ); if (error) throw boost::system::system_error(error); int counter = 0; unsigned char* array = new unsigned char[307400]; for (;;) { boost::system::error_code error; ptime startTime = microsec_clock::universal_time(); size_t len = boost::asio::read( socket, boost::asio::buffer( array, 307400 ), boost::asio::transfer_all(), error ); time_duration neededTime = microsec_clock::universal_time() - startTime; if ( error ) { printf( "body read error %s\n", error.message().c_str() ); } if ( counter % 5000 == 0 ) { std::cout << "passed: " << counter << "\r"; } ++counter; if ( neededTime.total_milliseconds() > 1000 ) { std::cout << "ERROR needed too much time: " << neededTime.total_milliseconds() << "ms" << std::endl; } } } catch (std::exception& e) { std::cerr << e.what() << std::endl; } return 0; } To reproduce the error just let it run for a while. It can take up to 30 minutes or even more... After a while it will produce the line: "ERROR needed too much time: 5007ms". Maybe with slightly different times, but all around 5 seconds. I tested it on different machines with Windows Vista and Seven. So am I'm doing sth. wrong? Is the reading from the socket correct? I'm using boost version 1.44. Kind regards Torben Wiggerich

6 11

A more convenient Variant visitation syntax
by Kevin Wu Won 19 Jul '13

19 Jul '13

While Boost Variant is a wonderful library that fills a genuine hole in the C++ language, it is not as nice to use as it could be. The "correct" way to unwrap a variant is to apply a static visitor, but this method carries a high syntactic burden because it needs the user to define a class (probably somewhere far away) just so they can "switch" on the type of the object stored in the variant. I came up with a solution where the handler functions can be specified inline with C++11 lambdas. Here's an example: boost::variant< int, std::string > u("hello world"); int result = match(u, [](int i) -> int { return i; }, [](const std::string & str) -> int { return str.length(); }); The `match` function accepts the variant followed by the handler functions. The functions can be specified in any order. It will fail to compile if the functions do not match the types of the variant, if the return types are not all the same, or if a non-unary function is supplied. This is C++11 only because it's quite pointless without lambda functions. I've tested it with gcc 4.7. It doesn't work on gcc 4.6, which can't handle the variadic templates. Here's the code: https://github.com/exclipy/inline_variant_visitor What do you think? This started out for me as an exercise to learn template metaprogramming and C++11, but hopefully, it can actually evolve into something useful.

7 8

De Bruijn Bind (alternate bind syntax) Interest?
by David Sankel 24 Jun '13

24 Jun '13

Hello all, I've been working on an alternate bind syntax based on De Bruijn indices[1]. The syntax is very simple, yet the terms are very powerful. Here is an example of a function const that takes in an argument c and returns another function that, for all input, returns c: //λx.λy.x = λλ1 with De Bruijn indices. auto const_ = abs<1>( abs<1>( var<1,0>() ) ); More examples, further explanation, and an implementation are available here[2]. I'm thinking that this library could also be useful as a core for more syntax heavy bind variations. David [1] http://en.wikipedia.org/wiki/De_Bruijn_index [2] http://bitbucket.org/camior/de-bruijn-bind/ -- David Sankel Sankel Software www.sankelsoftware.com 585 617 4748 (Office)

11 73

[TypeErasure] references
by Chapman, Alec 10 May '13

10 May '13

Hi Steven, I have a somewhat-generic type erasure class that I would like to switch to yours. The main difficulty I can see is in the way capturing by reference is handled. The approach I take in my class is to pass a boost::reference_wrapper to the constructor: typedef mpl::vector<copy_constructible<>, type_id_<>, incrementable<> > requirements; int i = 0; any<requirements> x(boost::ref(i)); // capture i by reference ++x; // i == 1 any<requirements> y(x); // makes a copy of i ++y; // i == 1, any_cast<int>(y) == 2 My motivation is that I have a bunch of template functions already written that I often call directly, but in other cases I need to compile them separately by instantiating them with any<...>: ---------------------- module 1 ------------------------- // some long algorithm that I don't want to modify to be aware of any<...> template<class T> void f(T& t) { ++t; T t2 = t; ++t2; // do something with t2 } // make a type-erased version for separate compilation void any_f(any<requirements>& x) { return f(x); } -------------------- module 2 ---------------------------- // provide a thin wrapper that applies type erasure before calling any_f template<class T> void f_fwd(T& t) { any<requirements> x(boost::ref(t)); any_f(x); } // some function that needs to call f void g(int& i) { // do something with i... // then pass it to f f_fwd(i); } Is something like this possible with your method? Are there advantages that I'm not seeing to having the type signature contain information about whether the object is held by reference? Thanks, Alec

3 6

[config] consexpr workaround
by vicente.botet 21 Mar '13

21 Mar '13

Hi, in order to make easier the introduction of constexpr in a portable way I would like we add a Boost Config workarround. We can define some macros depending on whether BOOST_NO_CONSTEXPR is defined or not. #if defined(BOOST_NO_CONSTEXPR) #define BOOST_CONSTEXPR #define BOOST_CONSTEXPR_OR_CONST const #else #define BOOST_CONSTEXPR constexpr #define BOOST_CONSTEXPR_OR_CONST constexpr #endif For most of the constexpr functions or constructors BOOST_CONSTEXPR will work. constexpr tuple(); =versus= BOOST_CONSTEXPR tuple(); When used for static constants BOOST_CONSTEXPR_OR_CONST is needed as we need to preserv the const keyword when consexpr is not available. static constexpr UIntType xor_mask = a; =versus= static BOOST_CONSTEXPR_OR_CONST UIntType xor_mask = a; We could also add a STATIC_CONSTEXPR macro #define BOOST_STATIC_CONSTEXPR static BOOST_CONSTEXPR_OR_CONST static constexpr UIntType xor_mask = a; =versus= BOOST_STATIC_CONSTEXPR UIntType xor_mask = a; For this case the existing macro BOOST_STATIC_CONSTANT could be modified to use BOOST_CONSTEXPR_OR_CONST when static const was used. static constexpr UIntType xor_mask = a; =versus= BOOST_STATIC_CONSTANT(UIntType, xor_mask = a); Can we introduce this workaround? Best regards, Vicente _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

6 17

Fwd: [Thread] Solution to conflict with MFC?
by Thorsten Ottosen 28 Feb '13

28 Feb '13

Hi Thread maintainers, Anthony speaks about a patch to make this work. Does anyone know where it is? And could it be applied? Thanks -Thorsten -------- Original Meddelelse -------- Subject: [Thread] Solution to conflict with MFC? Date: Tue, 26 Apr 2011 13:28:56 +0200 From: Christian Larsen <contact(a)dword.dk> Reply-To: boost-users(a)lists.boost.org To: boost-users(a)lists.boost.org Newsgroups: gmane.comp.lib.boost.user Hello, I know this has been asked before, but I could not find a good solution. I'm experiencing problems with an application using both MFC and Boost.Thread. Specifically the assertion ASSERT(AfxGetModuleState() != AfxGetAppModuleState()); in AfxCoreInitModule() fails. I link Boost.Thread statically into a DLL in my project. From previous posts to this list and elsewhere, e.g. http://lists.boost.org/boost-users/2009/04/46929.php, I see that the issue is caused by setting _pRawDllMain in tss_pe.cpp. Commenting this line does "solve" the problem, but I would rather not have to hack the Boost source code this way. It seems there is a patch somewhere for this problem (referred to in http://lists.boost.org/boost-users/2009/04/47015.php) but it appears it never made it into the source. Is there any chance of this issue being solved in a better way? Best regards, Christian Larsen

5 9

[Config] N3276 decltype support on VC++ 11
by Michel Morin 28 Feb '13

28 Feb '13

IIRC, Stephan said that VC++ 11 supports N3276 decltype. Shall we "undef" BOOST_NO_CXX11_DECLTYPE_N3276 for VC++ 11? This enables automatic use of decltype-based `boost::result_of`. Trivial patch attached. Regards, Michel

11 79

[multi_index] Move Semantics
by Mark Snelling 27 Feb '13

27 Feb '13

Hi, I've been a user of Boost.MultiIndex for a number of years and think it's a great library. Is there any firm plan to add move semantics? It's been noted under "Future Work" in the docs since Boost 1.32. Regards, Mark

6 10

[Lockfree] ringbuffer
by Rich E 17 Feb '13

17 Feb '13

First off, all Boost.Lockfree tests in trunk are passing for me on clang 4.0 on OS X, hurrah! Thank you Tim for working on this for so long... I'm running through the examples now, only with the outdated documentation as a guide (more than a couple years old). I cannot find the ringbuffer container - was it renamed or removed altogether during the review period? I notice spsc_queue acts awefully like a ringbuffer, and it's implementation contains many

2 6

[fixed_point] Request for interest in a binary fixed point library
by Vicente J. Botet Escriba 02 Feb '13

02 Feb '13

Hi, the recent discussion on the MultiplePrecission Arithmetic library has show that some people has its ow fixed point library. Is there an interest in a Boost library having as base http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3352.html? I have started a prototype http://svn.boost.org/svn/boost/sandbox/fixed_point (there is no doc yet but the basic goal is quite close to the N3352 C++ proposal). This prototype should allow you to play a little bit with. If yes, what would you like to be changed, added or improved in n3352? Next follows some design decisions that IMO need to be decided before hand. * Should integers and reals be represented by separated classes? * Should signed and unsigned be represented by separated classes? * Should the library use a specific representation for signed numbers (separated sign, 2-complement? Let the user choose? * Should the library provide arbitrary range and resolution and allocators? * Should the library be open to overflow and rounding or just implement some of the possible policies? and in this case which ones? * Should fixed_point be convertible to/from integer/float/double? * Could the result of an arithmetic operation have more range and resolution than his arguments? * Is there a need for a specific I/O? * is there a need for radix other than 2 (binary)? * Should the library implement the basic functions, or should it imperatively implement the C++11 math functions? Could a first version just forward to the c++11 math functions? * Should the library support just one of the know ways to name a fixed-point, a U(a,b), nQm, ...? Provide some ways to move from one to another? * Could expect the same/better performances respect to hand written code? * What should be the size used by a fixed_point instance? _fast? _least? Should the user be able to decide which approach is better for his needs? * Which should be the namespace? boost? boost/fixed_point? boost/binary_fixed_point? boost/bfp? ... * others you can think of. Please, replay if you are interested, have some experience in the domain, good ideas, .. Best regards, Vicente

6 44

[parameter] std proposal
by Lorenzo Caminiti 07 Jan '13

07 Jan '13

Hello all, Is there a C++ standard proposal for named parameter addition? I am looking for an "N-paper" for named parameters similar to N2081 for concepts, or N1962 for contracts. Thank you. -- Sent from my mobile device Lorenzo

6 8

[config] Proposed BOOST_NOEXCEPT_NOTHROW macro
by Beman Dawes 03 Jan '13

03 Jan '13

The three current BOOST_NOEXCEPT* macro variants miss the case where C++03 code has a "throw()" throw-specifier. Classes that derive from standard library exceptions need this to avoid breaking code on C++03 compilers. I'm not enamored with the BOOST_NOEXCEPT_NOTHROW name, so feel free to offer suggestions for alternate names. Here is the full set of macros: #ifdef BOOST_NO_NOEXCEPT # define BOOST_NOEXCEPT # define BOOST_NOEXCEPT_NOTHROW throw() <---- new macro # define BOOST_NOEXCEPT_IF(Predicate) # define BOOST_NOEXCEPT_EXPR(Expression) false #else # define BOOST_NOEXCEPT noexcept # define BOOST_NOEXCEPT_NOTHROW noexcept <---- new macro # define BOOST_NOEXCEPT_IF(Predicate) noexcept((Predicate)) # define BOOST_NOEXCEPT_EXPR(Expression) noexcept((Expression)) #endif Unless there are objections, I'll commit the changes Wednesday afternoon Eastern US time. --Beman

7 11

Using c++11 features in clang
by Marshall Clow 10 Dec '12

10 Dec '12

In response to a some questions on the boost-users list (and boost bug reports), I wrote up this: http://marshall.calepin.co/llvmclang-and-standard-libraries-on-mac-os-x.html I don't know if this should be a FAQ entry for Boost, or for clang. Suggestions/comments/edits welcome. -- 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 3

[#pragma once]
by Sid Sacek 18 Nov '12

18 Nov '12

I've worked with the MSVC, Sun and GCC compilers. Each one of them supports #pragma once. Is there any reason to wrap this pragma within #ifdefs? Are there any compilers out there today that don't support this #pragma? #if defined( _MSC_VER ) && ( _MSC_VER >= 1020 ) # pragma once #endif Could we change this coding pattern so that it no longer looks like MSVC is being selfish? -Sid Sacek

17 20

[build] Boost Build v2 documentation refer to "bjam"
by Klaim - Joël Lamotte 11 Oct '12

11 Oct '12

Hi, http://www.boost.org/boost-build2/doc/html/bbv2/overview/invocation.html I suppose this doc have not been updated in a long time? It still use "bjam" instead of "b2". Joel Lamotte

3 3

[config] explicit call of operator templates / msvc bug workaround
by Stefan Strasser 10 Oct '12

10 Oct '12

Hi, is there already a macro in Boost.Config that allows you to insert the "template" keyword in the following code for those compilers that require it? struct functor{ template<class T> void operator()(); }; template<class F> void g(F f){ f.template operator()<int>(); //(1) works with GCC and comeau f.operator()<int>(); //(2) works with MSVC } this apparently only applies to operator calls. MSVC accepts both (1) and (2) for regular functions. (instantiating the operator template with an object of type T as argument, like mpl::for_each does, is not an option. I can't construct T.) thanks, Stefan

6 10

Who maintains boost MPI?
by Ralf Grosse-Kunstleve 04 Oct '12

04 Oct '12

Hi, we're looking for someone to merge a simple patch: https://svn.boost.org/trac/boost/ticket/6123 Ralf

4 4

Inspection tool run
by Paul A. Bristow 30 Sep '12

30 Sep '12

I've been trying to get Boost.Math off the Sinners List on the Inspection Report at http://boost.cowic.de/rc/inspect-trunk.html#math. It last ran 25 July 12, so I can't see if I have succeeded yet. When can I expect it to run again? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

8 12

[test] Trunk broken: What happened to test_exec_monitor?
by John Maddock 21 Sep '12

21 Sep '12

Testing on Trunk is apparently broken as the test_exec_monitor target has been removed from Boost.Test Trunk as of revision #74642. A quick grep shows 22 Jamfiles and over 200 targets dependent upon this. Whats happened? John.

14 68

[type_erasure] Difficulties with const
by Christophe Henry 19 Sep '12

19 Sep '12

Hi Steven, I have a const problem. Consider the following classes: struct Something { Something(const char* n): myName(n){} std::string const& getName()const { return myName; } std::string myName; }; struct Container { typedef std::vector< AnyNameable > PublicData; Container() { Something s1("bla"); Something s2("blabla"); myData.push_back(s1); myData.push_back(s2); } PublicData getData()const { PublicData res; for (Data::const_iterator it = myData.begin(); it != myData.end() ; ++it) { res.push_back(AnyNameable(*it)); } return res; } private: typedef std::vector< Something > Data; Data myData; }; Container is simply a class returning its "Something", hidden behind AnyNameable (nice way to realize C++ Coding Standards Item 42 BTW). I have a simple test function: void test() { Container c; Container::PublicData data = c.getData(); for (Container::PublicData::const_iterator it = data.begin(); it != data.end() ;++it) { AnyNameable a(*it); std::cout << "data: " << a.getName() << std::endl; // auxiliary question: why does this not work if I use const _self&? //std::cout << "data: " << (*it).getName() << std::endl; } } int main() { test(); return 0; } Now comes the interesting part. If I define AnyNameable using the concept interface, all goes (almost) well: template<class C, class T> struct getName { static T apply(C const& cont) { return cont.getName(); } }; namespace boost { namespace type_erasure { template<class C, class T, class Base> struct concept_interface< ::getName<C, T>, Base, C> : Base { T getName() { return call(::getName<C, T>(), *this); } }; } } typedef any< mpl::vector< getName<_self,std::string const&>, relaxed_match, copy_constructible<>, typeid_<> >, const _self& > AnyNameable; This compiles and outputs as expected. Problem 1: This will not compile std::cout << "data: " << (*it).getName() << std::endl; Hmmm ok not so bad. I'll gladly pay the extra line. (interestingly, it would compile and work without const) Problem 2: if I use the MEMBER macro: BOOST_TYPE_ERASURE_MEMBER((has_getName), getName, 0); typedef any< mpl::vector< has_getName<std::string const&()>, relaxed_match, copy_constructible<>, typeid_<> >, const _self& > AnyNameable; Then the code does not compile, unless I accept to give up all of my consts. On one hand, I will find it a easier job to sell type_erasure with the macro, OTOH, I will not give up my consts ;-) Would it be possible to have the macro AND const-correctness? Attached, a small test with the complete code. Thanks, Christophe

2 3

[contract] static_assert in contracts or not?
by Lorenzo Caminiti 18 Sep '12

18 Sep '12

Hello all, If static assertions make sense within contracts (preconditions, postconditions, and class invariants) is a questions that has been raised by both Vicente and Andrzej. I don't have a definitive answer so I'd like to discuss with the ML. On Wed, Aug 29, 2012 at 2:48 PM, Andrzej Krzemienski <akrzemi1(a)gmail.com> wrote: > (6) > Static assertions: is there any value in providing them, given that we > already have this ability in Boost? I see that N1962 decided to abandon > them; I am pretty sure the reason was that static_assert was already there. > They somehow do not fit conceptually into the model of preconditions, > postconditions and invariants. Precondition, for instance tries to detect a > run-time condition occurring immediately before a function is called this > time. Static assertion is not even executed then. What point is there in > putting such assertion into the precondition? Documentation says " static > assertions can be selectively disabled depending on where they are > specified [...] so it is still important to logically associate them with > preconditions, postconditions, etc." -- technically this sentence makes > logical sense, but can you think of a single example where this selective > disabling of assertions would be useful? What is the point in disabling > such assertions at all, if they cost you nothing in run-time? I propose to > remove them and give a sort of recommendation that software quality is > assured by using a number of fairly independent tools: DbC, concepts, > static assertions. I think we can break down the question in two parts. Let's assume N1962 is accepted into C++1x so we have both contracts and static_assert. 1) Would you expect to be able to use static_assert within contract assertions (preconditions, postconditions, and class invariants)? Note that only boolean conditions are allowed by N1962 within contracts, general code is not allowed, therefore this is not a trivial question. For example, would you expect to be able to do the following option A: template< typename To, typename From > To* memcopy ( To* to, From* from ) precondition{ static_assert(sizeof(To) >= sizeof(From), "destination too small"); static_assert(boost::is_convertible<From, To>::value, "incompatible types"); to; // pointer not null from; // pointer not null } { // ... } In this case, would it ever make sense to use static_assert in postcondition and/or class invariants even if that were allowed? Or would you just use static_assert in the body, option B: template< typename To, typename From > To* memcopy ( To* to, From* from ) precondition{ to; // pointer not null from; // pointer not null } { static_assert(sizeof(To) >= sizeof(From), "destination too small"); static_assert(boost::is_convertible<From, To>::value, "incompatible types"); // ... } I don't like this because the assertions are about the specifications (they assert a requirement of the interface) so they should go in the declaration and not in the implementation. Or maybe the assertions should be represented as concept requirements on To and From, option C: template< typename To, typename From > requires SizeofGreaterEqual<To, From>, Convertible<From, To> To* memcopy ( To* to, From* from ) precondition{ to; // pointer not null from; // pointer not null } { // ... } (Only we don't have concepts...) 2) Let's assume, we answered option A to question 1): template< typename To, typename From > To* memcopy ( To* to, From* from ) precondition{ static_assert(sizeof(To) >= sizeof(From), "destination too small"); static_assert(boost::is_convertible<From, To>::value, "incompatible types"); to; // pointer not null from; // pointer not null } { // ... } Would you expect these static_asserts to be disabled when precondition compilation and checking is turned off at compilation time? I'd think so. Thanks. --Lorenzo

4 11

[build] 1.49 unable to bootstrap boost
by yuri kilochek 12 Sep '12

12 Sep '12

Not sure if this goes here. On Windows 7, when I try to do bootstrap on a freshly unzipped boost 1.49 at the root directory, I get the following output: Building Boost.Build engine But that is as far as it gets before os terminates whatever it is doing with this (roughly translated from russian): **** STACK SIZE EXCEEDED **** **** WHILE PERFORMING RECURSION IN BATCH MODE **** Recursion depth=654, Stack usage=90 percent. **** BATCH PROCESSING ABORTED **** Is there a way to build boost bypassing this?

4 3

[Variant] C++11 variadic template implementation
by Florian Goujeon 11 Sep '12

11 Sep '12

Hi Boosters, I'd like to know if anybody were working on a C++11 version (using variadic templates) of Boost.Variant. I currently use the 'classic' version in my project, but since I need more-than-20-type variants, the compilation take a lot of time (extending the number of types that variant can support forces you to disable the use of precompiled headers). Plus, I'll need to use 70 type variants (MPL lists are physically limited to 50 types). If nobody has started to implement such a version yet, I'd be pleased to contribute. I've written an implementation. It's incomplete and far from perfect, but it could (hopefully) be a viable working basis.

6 16

[intrusive] patch to resolve compiler error for WinCE
by David Deakins 09 Sep '12

09 Sep '12

Hi Ion, I had a little bit of time to look into the compile error mentioned in ticket 6841 and determine a patch from detail/mpl.hpp that I think should resolve it. The patch is attached to that Trac ticket, although I could also just go ahead and apply it if you like. Thanks, -Dave

2 1

[Review:Contract] Andrzej's review
by Andrzej Krzemienski 06 Sep '12

06 Sep '12

Hi, First, my vote is "YES": Contract should be accepted into Boost. Now for some details... === MOST IMPORTANT THINGS === (1) Let me start from the most important arguments. "Contract" enables us to use DbC design and tools in C++. This is the only library in C++ that I am aware of that takes DbC seriously, in every detail. In particular, unlike any "simple contract library," it observes that: (a) function pre- and post-conditions need to be part of declaration rather than function implementation, (b) a precondition is something different than a postcondition, (c) It is the execution of destructors of automatic objects that may (re)establish invariants or satisfy postconditions (thus, they need to be checked after destructors have been executed). "Contract" deals with things more detailed than my above list; but even this list is not always addressed in "simple contract libraries". This already gives me the confidence that Lorenzo has a very good understanding of the domain. I believe the community needs BbC framework: it is necessary in order to be able to program consciously. If the responsibilities and expectations are expressed clearly not only is it faster to track bugs, but also programmers would not plant (I think) some bugs from the outset. Of course, contract framework should ideally be provided as language extension; but in the absence of such support we are left with the attempts to implement it via a (possibly too clever) library. "Contract" may also enable and/or speed up the adoption of DbC as language feature in C++, as it will be possible to have a real-world implementation of the framework that people can play with, experiment and assess its usability. (2) An obvious and serious issue with the library is the burdensome syntax you have to use. Given the ambitious task of wrapping each function call with with tests executed before and after, and still leaving the bodies intact, I realize this is not avoidable. In fact I believe Lorenzo made the impossible to make the EDSL as close to normal declaration syntax as possible. Yet, all this may not be enough to call the interface "acceptable". There is a number of issues with it: you have to learn yet another language; compile times increase; if you mis-spell something you have horrible error messages; you cannot use some C++ constructs that you would otherwise use; your IDE and the debugger may be confused (if your contract fails, the bug may be either in your code or in the testing code). I cannot imagine telling my coworkers "from today on we are using Boost.Contract; start learning the new EDSL". I believe that it is not possible to significantly improve the current interface; its limitation is the natural consequence of the nature of the problem. The cost cannot be reduced any more, so the library can only offer even more value. And this is what it does, by (for instance) simplifying the integration with Boost.Concept or adding virtual specifiers. (3) I see it as a useful tool for personal projects, experimentation, learning, validation of usefulness of DbC, a proof of concept for proposal N1962. But the question is, should "Concept" be included into Boost. "Contract" needs inclusion into Boost to gain visibility and some sort of "attestation" and "certification". Only proposing "Contract" for addition to Boost brought attention to DbC: at least it prompted me to learn more. But does Boost need "Contract"? Similar questions have been asked during the review of Boost.LocalFunction. I am not aware of any objective criteria that would help decide in this case. Is this library of "high quality"? Can library with such interface be called "high quality"? But there is no other way to implement DbC in C++ (I believe)? But is it strong enough the argument? Perhaps we should treat some problems as "not implementable" and not include libraries only because there is no cleaner way to implement the tool. The decision to vote "yes" is not easily made. This is a subjective weighing between the offered value and the imposed cost. Personally, I would like to have this library available whenever I download Boost. === GENERAL OBSERVATIONS === (4) The library has very vast and very thorough documentation. It contains tutorials that teach you step by step how to use the library, the introduction into DbC, very detailed rationale, good reference, lots of examples. It is a good "reference documentation". (5) In order to define concept the library defines EDSL for declaring (and defining) classes and functions. This framework as the potential to do other useful things: enable support for concept definition and checking, base class aliases (see N2881), override control, named parameters, noexcept, simplified enable_if (or static if), etc... In fact, perhaps it could be used as a more general EDSL for declarations. This is my loose suggestion to change macro names from BOOST_CONCEPT_CLASS to BOOST_DECL_CLASS, etc, in case someone wants to use the framework for purposes other than contract enforcements. === ISSUES === Here I list a couple of random issues. I do not consider them critical for decision whether to adopt "Contract" to Boost or not. (6) Static assertions: is there any value in providing them, given that we already have this ability in Boost? I see that N1962 decided to abandon them; I am pretty sure the reason was that static_assert was already there. They somehow do not fit conceptually into the model of preconditions, postconditions and invariants. Precondition, for instance tries to detect a run-time condition occurring immediately before a function is called this time. Static assertion is not even executed then. What point is there in putting such assertion into the precondition? Documentation says " static assertions can be selectively disabled depending on where they are specified [...] so it is still important to logically associate them with preconditions, postconditions, etc." -- technically this sentence makes logical sense, but can you think of a single example where this selective disabling of assertions would be useful? What is the point in disabling such assertions at all, if they cost you nothing in run-time? I propose to remove them and give a sort of recommendation that software quality is assured by using a number of fairly independent tools: DbC, concepts, static assertions. (7) Loop variants: They are definitely a good thing to have (and I started using them immediately I learned about them in your documentation!). But they seem to have little to do with "contracts". A contract is (by definition -- I think) something that involves two parties. For instance, precondition implies two parties: one ensures something, the other expects something. Invariants are harder to explain this way, but to me they are like "automated postconditions" (I explain this later on). However with loop variants the situation is different: they are put inside the the code, so no-one expect function author knows about them. The programmer guarantees something only to himself. It is more like assertion (in the sense of C macro assert()), perhaps with better configuration. I only want to make an observation here that this could be proposed irrespectively of contracts (pre-, post-conditions, invariants and subcontracting) -- but I am not proposing this. (8) Block invariants: Same remark as above: they appear to be separate from contracts. Another question is, what is the difference between block invariant and an assertion (like C-style macro assert())? I know, I know: conditional assertion, requirements, selectively disabling them, customizing run-time behavior... But if this is superior to BOOST_ASSERT, would it be correct to say that with Boost.Contract BOOST_ASSERT is no longer needed (except for backward compatibility)? (9) Class invariants: I have an observation, not about yuor library but the way invariants are handled in DbC methodology. As a "contract" (involving two parties) they make sense when checked after any (public) function call: they are a sort of postcondition that is the same for every function: class implementer "ensures" and class user "expects". But when checked before any function execution they are more like a C-assert: the function "expects", but who is supposed to "ensure"? Only any other public function of that class -- but this is already verified by checking postconditions. Somehow checking invariants before function execution is checking the same thing twice. If you find my reasoning even a bit convincing, perhaps it is worth considering adding another config macro: CONTRACT_CONFIG_NO_CLASS_INVARIANTS_ON_FUNCTION_ENTRY, that would disable invariant checking before function or destructor call, but still check them after function or constructor call? (10) It looks that when I include header <contract/class.hpp>, I also include <boost/concept/requires.hpp> even if I do not intend to use concepts. Would it be possible to avoid this somehow? (An additional header that also allows me to use macros: like CONTRACT_FUNCTION, but does not include <contract/class.hpp>, and if I use keyword "requires" the compilation fails). (11) The library supports almost all of C++03's declaration syntax, but I suppose it may not support some essential declarations from C++11, e.g.: noexcept(condition) or trailing return types. I hope it is doable in the future? (12) In the documentation (Introduction) we read that "This library is implemented for the C++03 <http://en.wikipedia.org/wiki/C%2B%2B> standard and it does not require C++11 <http://en.wikipedia.org/wiki/C%2B%2B11>." I think it is a bit imprecise, because many examples in the docs silently assume that variadic macros, which are not part of C++03, are available. I believe something like this would be more accurate "This library is designed to work on C++03 compilers that support variadic macros; no other C++11 support is necessary. Additionally, if variadic macros are not supported, this library works in >>strict C++03<< mode with slightly different syntax." (13) The documentation says that you can use protected and private members in contracts because "C++ provides programmers ways around access level restrictions (e.g., friend and function pointers)". Next, we read that "only public member functions shall check class invariants. Private and protected member functions are allowed to brake class invariants because private and protected member are part of the class implementation and not of its specification". To me, these two statements appear incompatible: either we say that only public members constitute class'es interface, or even protected and private members constitute class interface, e.g. for befriended functions. And either we both contract-check only public functions and allow only public members in contracts, or we both contract-check all functions and allow all members in contract. I prefer the former. Or am I missing something? If there are some technical obstacles in checking member access in assertions, then I accept such library limitation, but the current argumentation in the docs appears inconsistent. (14) The docs say that in order to make disabling of nested assertions thread-safe in multi-threaded programs, the library needs to use a global lock. Sorry if I am talking nonsense now (I have no intuition of using DbC in multi-threaded apps), but is it not possible to use thread_local storage for this purpose? Is it possible that executing an assertion in one thread would cause the execution of another (nested) assertion in another thread? (15) Unfortunately, I will not have time to check it, so I will only ask you: are any special considerations required in contract-checking classes that inherit virtually (e.g. class hierarchies with diamond inheritance structure). Order of object layout and construction is very particular in those classes, perhaps the order of contract verification and subcontracting should be special a well? (16) Functions like set_precondition_broken() are defined with dynamic exception specification: throw(). Is this necessary? throw() is known to be causing problems, adds little value, and some compilers do not support it; some other issue warnings on dynamic exception specifications; and they are deprecated. (17) According to docs, the framework checks invariants on destructor throw. This is already tracked: https://sourceforge.net/apps/trac/contractpp/ticket/66 (18) "Duplicated globals" problem may cause failure to register custom contract failure handler. This is already tracked: https://sourceforge.net/apps/trac/contractpp/ticket/60 (19) Documentation sometimes uses name "Contract Programming" as though it was a framework. For instance, "This library implements Contract Programming" or "Contract Programing checks them". I think it is incorrect. I understand that "Contract Programming" is a philosophy or a paradigm, whereas what you mean should be called "Contract Programming Framework" or similar. (20) In "Contract Programming Overview" -> "Benefits", in the note we read, "However, the probability that programmers make a mistake twice (in both the body *and* the contract) is lower than the probability that the mistake is made just once (in either the body or the contract)". This implies that we write contracts in order that the code be duplicated because this reduces the probability of the bug. I believe that the mechanism of testing in general is somewhat different (contract-checking is similar to unit testing in this respect, I think): you want the tests to be much simpler then the code they test. Therefore when some test fails you know (although not for sure) that it is the code that is broken rather than the test. For instance: double sqrt(double v) postcondition{ close(return * return = v); }; Testing almost the same thing as function body makes sense because multiplication is conceptually much simpler than the logic to find the square root. Conversely, writing this: bool invert(bool b) postcondition{ b == !return; }; Would be of little practical value, and I believe if there is a chance I will implement such function incorrectly, duplicating the logic in the precondition does not in practice reduce by half the probability of leaving the bug in the code. (21) Contract failure handlers will likely be customized inside function main(). This means that it will be difficult (although not impossible) to customize these actions for contracts of constructors of global objects. This is a very small problem and N1962 also seems to suffer from it and in fact even C++ suffers from it, when it comes to installing terminate handler with set_terminate. (22) Some random type-os in the docs. (apologies that I bluntly paste my notes without editing them, but I am too tired to do it): * " In addition, the library implements" -- don't mention it in the first sentence. * " and increasing overall software quality" -- no meaning * "trailing column symbol :" -> "trailing colon symbol :" * "First, the class invariants and the function preconditions are checked." -> "First, the class invariants are checked, then the function preconditions are checked. "(split it) * "Differences with C++ Syntax" -> "differences from"?<http://contractpp.svn.sourceforge.net/viewvc/contractpp/releases/contractpp…> * "postconditions and class invariants cannot be weaken. " -> weakened * "This library implement this feature however" -> "This library implements this feature, however" * "A *free function* [8<http://contractpp.svn.sourceforge.net/viewvc/contractpp/releases/contractpp…> ] call executes the following steps: " -- mention throw * "Preconditions cannot access the object" -- "you shouldn't" or "it is not possible"? * "to ontract" in destructor tutorial === STANDARD REVIEW QUESTIONS === * What is your evaluation of the design? * What is your evaluation of the implementation? Unfortunately, the macro tricks are beyond my mental powers, so I am unable to evaluate the design and implementation. I could only try to break it or test if it behaves as documented on examples. I can see that the framework is customizable (broken contract handlers, disabling the compilation of handlers). One design flaw I can see is that it is a header-only library while it requires some globals to store the handlers. But this is already recorded as a confirmed bug: http://sourceforge.net/apps/trac/contractpp/ticket/60 * What is your evaluation of the documentation? Very, very good: easy intro for the beginners, very detailed, describes not only the library but also the problem domain, lots of examples. * What is your evaluation of the potential usefulness of the library? It may be disqualified from production code by many parties due to the unusual syntax. But it is definitely useful for learning DbC, experiments, personal projects (where you need not convince others to use the interface they do not like) * Did you try to use the library? With what compiler? Did you have any problems? * How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? I played with the library for three evenings, running basic tests and trying to break it. I read the documentation. I also had some conversations with Lorenzo as he was developing the library, and reviewed previous versions of the docs. I am using VisualStudio 2010. * Are you knowledgeable about the problem domain? I know Contract Programming from Meyer's book and ISO C++ proposals (N1613, N1669, N1773, N1866, N1962) and Lorenzo's documentation. I haven't used it in practice on a dig scale. === FINALLY === The work Lorenzo did for this library is incredible. He already contributed to the knowledge of the limits and the power of the preprocessor. Supporting contracts in C++ without language extensions appeared (at least to me) impossible. It is a great piece of work. Regards, &rzej

3 9

[coroutine] new location
by Oliver Kowalke 05 Sep '12

05 Sep '12

Hi, because some of the community members have had some problems to access the archive I've uploaded the library to a new location. docu: http://ok73.ok.funpic.de/boost/libs/coroutine/doc/html/ src: http://ok73.ok.funpic.de/boost.coroutine.zip I'd like to remember that the review starts at September 3, 2012. The library contains one example using boost.asio together with a stream reading from a socket (without blocking the application if newline was not received). regards, Oliver

7 15

[Contract] noexcept and custom contract violation handlers
by Andrzej Krzemienski 04 Sep '12

04 Sep '12

Hi, I have just realized that there is an interesting interaction between "noexcept" and Contract Programming framework. Not only Lorenzo's library, but even if contracts were a language feature. N3248 ("noexcept prevents library validation", http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/n3248.pdf) recommends that functions with any preconditions should not be declared noexcept(true) in case someone wants to report precondition failures via exceptions. If preconditions become part of declaration syntax, declaring both precondition and noexcept(true) could (and should?) be recognized as compile-time error. But now also invariants and postconditions come into play: if a function declares a postcondition, or our class defines an invariant, should we be allowed to declare our function noexcept? What if someone wants to report an invariant or postcondition failure via special exception? (I do not have a good answer for it.) Regards, &rzej

4 5

[contract] invariant checking after destructor throw
by Andrzej Krzemienski 04 Sep '12

04 Sep '12

I have found a potential issue while reading the documentation. (The documentation is very good BTW). It says that the non-static invariant is still checked if object's destructor throws an exception. Am I reading it right? If so, I believe this is not correct. I have two problems with it: 1. According to the standard, an object is considered destroyed (its life-time has ended) when its destructor *starts*. Even if it throws an exception, it is considered destroyed, so accessing its members (in order to check for the invariant) may be illegal (an undefined behavior). 2. Why such an object (that threw on destruction) would need to preserve the invariant? You cannot access it or use it or even destroy it the second time, because it has already been destroyed. No-one will notice it anyway. Or am I missing something? Regards, &rzej

3 4

[Review:Contract] Some questions
by Vicente J. Botet Escriba 02 Sep '12

02 Sep '12

Hi, First of all, thanks Lorenzo for your work on pre-processor programming. With this library, you have showed to me how far the pre-processing can go in terms of expressiveness. I have some questions before doing a complete the review: = C++11 compatibility = * Does the library use c++11 features when available? I was thinking e.g. on the emulated virtual specifiers. BTW, I think the "new" virtual specifier was removed from the standard, but maybe I'm wrong. * I think the library don't allow to declare C++11 specific classes/function. E.g * variadic templates * noexcept functions * constexpr functions * class/function attributes BTW, I have not see any example using exception specifications using 'throws'. Does the library support them? Could you confirm? and if not, could you tell us if you have a plan to support them? = Postconditions result = "Postconditions can access the function return value by declaring a variable of type |auto| and assigning it to the |return| keyword (the variable name is arbitrary but |result| is often used)." What prevent the library to the use of return instead of an auto variable postcondition( // Postconditions. auto old_value = CONTRACT_OLDOF value, // Old value(s). value == old_value + 1, // Assertion(s)... return == old_value ) instead of postcondition( // Postconditions. auto result = return, // Result value. auto old_value = CONTRACT_OLDOF value, // Old value(s). value == old_value + 1, // Assertion(s)... result == old_value ) =Constant assertions = I would expect that the old are always const so the following postcondition( auto old_even = CONTRACT_OLDOF even, auto old_odd = CONTRACT_OLDOF odd, // `[old_]even` and `[old_]odd` all `const&` within assertions. const( even, old_even ) even == old_even + 2, const( odd, old_odd ) odd == old_odd + 2 ) should be rewritten without loss of semantics as postcondition( auto old_even = CONTRACT_OLDOF even, auto old_odd = CONTRACT_OLDOF odd, // `[old_]even` and `[old_]odd` all `const&` within assertions. const( even ) even == old_even + 2, const( odd ) odd == old_odd + 2 ) = Oldof = As the old of value must be declared using a variable, using a specif oldof keyword that will replace auto old_size = CONTRACT_OLDOF size(), by oldofold_size = size(), could simplify the syntax. What do you think? Some minor points: * Why do you use( void ) instead of () in the functions without parameters? e.g. public: bool empty ( void ) const { return vector_.empty(); } Some suggestions: * Use 2 spaces indentation instead of 4 could reduce the width of the page, in particular when you use several columns. * The use of'int const' as return type is verbose and could be replaced by just int. Best, Vicente

2 21

[test] Boost.Test unreleased since November 2009 ?
by Mathieu Champlon 02 Sep '12

02 Sep '12

Hi, I've noticed that no merge has been made from trunk to the release branch for Boost.Test since November 2009, meaning that a lot of bug fixes and features have remained unreleased. Is it on purpose ? Thanks, MAT.

2 1

[test] Where should I put replacement functions for WinCE?
by Jan Hudec 02 Sep '12

02 Sep '12

Hello Folks, Windows CE don't have time and clock functions, getenv function and errno.h (though they seem to have _errno function). I needed to define these things to get Boost.Test to build for WinCE. Now it would be nice to have this work by default. I can provide the definitions (they are quite simple), but I am not sure where would be correct place for them. Should I add them to config/platform/win32.hpp, create config/platform/wince.hpp or put them just in test? Thanks, Jan -- Jan 'Bulb' Hudec <bulb(a)ucw.cz>

2 1

[test] sigaltstack does not work on older Android
by Jan Hudec 02 Sep '12

02 Sep '12

Hello Folks, Android NDK contains several "platforms", depending on which release one desires to be compatible with. Boost test compiles fine with android-8 and newer, but the older versions have incomplete definition of sigaltstack (they define the structure, but not the function), causing compilation error in boost/test/detail/impl/execution_monitor.ipp. I have fixed it locally by adjusting the condition for defining BOOST_TEST_USE_ALT_STACK, but I am not sure which level of fix would be best suited for integrating in boost. I see 3 options: 1. Leaving it as is and simply saying android is only supported from API level 8 (that's 2.2; we are still compiling for 2.1 (which has no changes in native since 2.0)) 2. Simply disabling BOOST_TEST_USE_ALT_STACK in Android; it's not necessary after all. 3. Being really precise and reading the API version, but that requires including extra header. It would be nice, but I am not sure what is the correct place to include it. Here is a simple patch that just disables sigaltstack for Android: --- a/boost/test/impl/execution_monitor.ipp +++ b/boost/test/impl/execution_monitor.ipp @@ -173,7 +173,7 @@ namespace { void _set_se_translator( void* ) {} } # endif # endif -# if !defined(__CYGWIN__) && !defined(__QNXNTO__) +# if !defined(__CYGWIN__) && !defined(__QNXNTO__) && !defined(__ANDROID__) # define BOOST_TEST_USE_ALT_STACK # endif And here is a more complex patch that on android (the __ANDROID__ macro is predefined by the compiler in Android NDK) reads the api-level and uses it to decide: --- a/boost/test/impl/execution_monitor.ipp +++ b/boost/test/impl/execution_monitor.ipp @@ -173,7 +173,11 @@ namespace { void _set_se_translator( void* ) {} } # endif # endif -# if !defined(__CYGWIN__) && !defined(__QNXNTO__) +# if defined(__ANDROID__) +# include <android/api-level.h> +# endif + +# if !defined(__CYGWIN__) && !defined(__QNXNTO__) && (!defined(__ANDROID__) || __ANDROID_API__ >= 8) # define BOOST_TEST_USE_ALT_STACK # endif -- Jan 'Bulb' Hudec <bulb(a)ucw.cz>

2 1

[test] Fix WinCE workaround
by Jan Hudec 02 Sep '12

02 Sep '12

Hello Folks, boost/test/impl/execution_monitor.ipp has workaround for older MSVC++ and assumes WinCE version need it too. However the WinCE compiler caught up in next version. Here is a proposed patch: --- a/boost/test/impl/execution_monitor.ipp +++ b/boost/test/impl/execution_monitor.ipp @@ -84,7 +84,7 @@ using std::va_list; typedef unsigned uintptr_t; # endif -# if BOOST_WORKAROUND(_MSC_VER, < 1300 ) || defined(UNDER_CE) +# if BOOST_WORKAROUND(_MSC_VER, < 1300 ) || (defined(UNDER_CE) && BOOST_WORKAROUND(_MSC_VER, < 1500 )) typedef void* uintptr_t; # endif -- Jan 'Bulb' Hudec <bulb(a)ucw.cz>

2 1

[test] Interest in gtest-like output?
by Jared Grubb 02 Sep '12

02 Sep '12

I really like the Boost.Test framework, however, I cant help but have a bit of envy over how great the output from googletest looks. I've been playing around with writing a formatter/outputter that emulates the output style of googletest, and I am willing to spend some time to pretty it up and generate a patch if there's interest. Does anyone think this would be a worthy submission to boost? For an example of what the output looks like, this site has some great examples: http://www.ibm.com/developerworks/aix/library/au-googletestingframework.html (just to clarify: I'm not suggesting changing any BOOST_TEST syntax, just adding a new optional way to format the test progress and results to stdout) Jared

3 2

[type_eraseure]Why not make default concept_interface a metafunction returning Base?
by Larry Evans 31 Aug '12

31 Aug '12

Since the unspecialized concept_iterface definition: template<class Concept, class Base, class ID, class Enable = void> struct concept_interface : Base {}; does nothing, and it's used to compose the any base class heirarchy in: template<class Derived, class Concept, class T> struct compute_bases { typedef typename ::boost::mpl::fold< typename ::boost::type_erasure::detail::collect_concepts< Concept >::type, ::boost::type_erasure::any_base<Derived>, ::boost::type_erasure::concept_interface< ::boost::mpl::_2, ::boost::mpl::_1, T > >::type type; }; why not eliminate the empty concept_interfaces by redefining the unspecialized concept_interface to: template<class Concept, class Base, class ID, class Enable = void> struct concept_interface : Base { //The following enables mpl::fold, when using //this as the binary operator, to skip this //empty interface. typedef Base type; }; I believe that would work since mpl::fold uses the nested type if it's available, IIUC. Although it would not change the behaviour of any code, it would make the intent of the code clearer. Also, while trying to understand what the code is doing by using a type name demangler, I found all those empty concept_interfaces are just noise. -regards, Larry

1 0

[Review:Contract] Contract Broken Handlers , BOOST_NO_EXCEPT and noexcept
by Vicente J. Botet Escriba 31 Aug '12

31 Aug '12

Hi, I would like to know if Boost.Contract could work when BOOST_NO_EXCEPT is defined. I suspect that it can not at present, as the user needs to re-throw the exception to know the broken nature. Maybe the handler could have the an exception/error object as parameter instead. In order to be able to use contracts in C++11 functions declared noexcept I would need that the contract handler are declared noexcept also, in particular when the contract is broken from a destructor, which is often declared noexcept in C++11. Maybe the library can provide some specific set handlers that expect a noexcept handler for the destructor context. BTW, could the ALL CAPITAL |FROM_CONSTRUCTOR, ... enumeration literal|s be renamed to lower case from_constructor, ...? Best, Vicente

2 3

Question about release branches
by Pedro Larroy 30 Aug '12

30 Aug '12

Hi I'm not able to find some fixes such as (78513) in tags/release/Boost_1_51_0/ nor tags/release/Boost_1_50_0/ Why some fixes that are in trunk didn't made it to the release branches? Thanks. Pedro.

2 1

[range] Missing include in boost/range/algorithm/for_each.hpp
by Sergiu Dotenco 30 Aug '12

30 Aug '12

There is an issue with boost/range/algorithm/for_each.hpp which is missing an include. The problem seems to have been fixed in trunk two months ago (https://svn.boost.org/trac/boost/changeset/79180) but the changeset hasn't been applied to the release branch yet. Could this be done for the 1.52 release?

2 1

[fusion] undocumented sequence requirement: convert
by Eric Niebler 30 Aug '12

30 Aug '12

Say I have a valid fusion sequence. I want to use an mpl algorithm on it. I include boost/fusion/mpl.hpp and put a nested tag type in my sequence that is an alias for fusion::fusion_sequence_tag. So far, so good. Then I try to call mpl::pop_back on this sequence, and I find that, despite fulfilling all the documented requirements for Fusion ForwardSequence, the code fails to compile. That's because of this in boost/fusion/mpl/pop_back.hpp: template <> struct pop_back_impl<fusion::fusion_sequence_tag> { template <typename Sequence> struct apply { typedef typename fusion::result_of::pop_back<Sequence>::type result; typedef typename fusion::result_of::convert< typename fusion::detail::tag_of<Sequence>::type, result>::type type; }; }; My code doesn't compile because I haven't implemented the fusion::convert customization point. Where is that documented and what does it do? -- Eric Niebler BoostPro Computing http://www.boostpro.com

4 12

[type_erasure]bug in computed_bases?
by Larry Evans 29 Aug '12

29 Aug '12

Based on the output of the test code(compute_bases.cpp) in the 1st attachment, the compute_bases metafunction defined in any.hpp is producing something like: concept_interface < concepts , concept_interface < mpl::at_c<concepts,1>::type , concept_interface < mpl::at_c<concepts,2>::type , ID , Enable > , ID , Enable > , ID , Enable > where concepts is the Concept argument to any. When the test code is run with: //#define OVERLOAD_SIMPLE the output is what should be expected with a_any.simple(); calling the simple<.>::apply static method. The output for this case is shown in the compute_bases.not_overload_simple.out. OTOH, when the test code is run with: #define OVERLOAD_SIMPLE the code in the concept_interface<typename requirements<C>::type,...>::simple is run. The output for this case is shown in the compute_bases.yes_overload_simple.out. This output shows that the concept_interface<C,...> CTOR is called where C == mpl::vector<...>. Is this the intended behaviour? If so, where is this spelled out in the documentation? The documentation here: http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure… certainly doesn't suggest anything of that sort, and the doc here: http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure… says: 1. typename Concept The concept that we're specializing concept_interface for. which uses the singular Concept instead of the plural Concepts, suggesting the Concept is not an mpl::vector<> of any sort. -regards, Larry

2 4

Review Request: odeint
by Mario Mulansky 29 Aug '12

29 Aug '12

Hi, after getting some good amount of positive feedback on our talk at boostcon we are now asking for a formal review process of the odeint library, currently hosted on github: https://github.com/headmyshoulder/odeint-v2 odeint provides routines for numerically solving Ordinary Differential Equations, a task heavily required when approaching scientific problems numerically. In odeint we have implemented the most common algorithms in a modern, generic way which provides several advantages over existing implementations. The main focus of odeint is to separate algorithms from the underlying basic computation unit. This allows for example to easily use the power of modern GPUs via CUDA or OpenCL to speed up computational heavy simulations. Features: - provides most of the standard algorithms, including step size control, dense ouput and extrapolation routines - symplectic routines for Hamiltonian systems - implicit routines based on boost::ublas (MTL4 in progress) - high level integrate functions - interchangeable computation backend with existing bindings to CUDA and OpenCL - native support of ODEs defined for complex values - support of Boost.Units in most of the algorithms - support of arbitrary precision types The code is hosted on github: https://github.com/headmyshoulder/odeint-v2 Documentation/Tutorial: http://headmyshoulder.github.com/odeint-v2/doc/index.html We are, of course, looking for a review manager as well. Thanks! Karsten and Mario

4 3

[type_erasure][docs]conceptdef.html terms
by Larry Evans 29 Aug '12

29 Aug '12

The doc: http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure… states: When a concept is instantiated with a specific set of type bindings, each placeholder is bound to a cv-unqualified non-reference type. After replacing each placeholder in the template argument list with the type that it binds to, the following must hold. * The number of arguments of apply in the bound concept must be the same as the number of arguments in the unbound concept. * The arguments and return type of apply in the bound concept can be derived from the corresponding arguments and the return type in the unbound concept as follows: If the argument in the unbound concept is a placeholder with optional cv and reference qualifiers, then the argument in the bound concept can be found by replacing the placeholder. Otherwise, the argument in the unbound concept must be the same as the argument in the bound concept. However, there is no apply in the builtin concept's: same_type (in same_type.hpp) null_construct (in constructible.hpp) destructible (in builtin.hpp) so, shouldn't the paragraph qualify the word concept with the word primitive, to make clear it's talking about item 3 in the list: There are three kinds of concepts. 1. The library defines a number of predefined concepts. 2. Any MPL Forward Sequence whose elements are concepts is also a concept. 3. Users can define their own primitive concepts. from the 2nd paragraph of conceptdef.html? IOW, rephrase the 1st sentence to: When a *primitive* concept is instantiated with a specific set of type bindings, I guess one could infer from the sentence 2 paragraphs up: Each primitive concept defines a single operation. that the word concept in subsequent paragraphs means primitive concept, but not every reader (in particular, this reader) would make that inference unless he'd actually looked at the definition of some of the predefined concepts. BTW, the same_type doc uses the term 'built in concept'; however, the conceptdef.html doc uses the term 'predefined concept'. It would be helpful if the same term were used everywhere. HTH. -regards, Larry

1 0

Re: [boost] a (useful?) crtp trick
by Gottlob Frege 29 Aug '12

29 Aug '12

declaration is crystal clean (read: self documenting), no need to use enable_if, etc. -- Pavel P.S. if you notice a grammar mistake or weird phrasing in my message please point it out Crystal clear, not crystal clean. Tony

1 0

[type_erasure]tests fail_any_cast_pointer_to_val fails compile
by Larry Evans 29 Aug '12

29 Aug '12

When running bjam, I get: compilation; default-directory: "~/prog_dev/boost-svn/ro/boost_1_49_0/sandbox/ro/type_erasure/type_erasure/libs/type_erasure/test/" -*- Compilation started at Tue Aug 28 21:33:51 bjam sh: icpc: not found ...patience... ...patience... ...found 2363 targets... ...updating 171 targets... gcc.compile.c++ bin/test_binding.test/gcc-4.8n/debug/test_binding.o gcc.link bin/test_binding.test/gcc-4.8n/debug/test_binding . . . gcc.compile.c++ bin/test_null.test/gcc-4.8n/debug/test_null.o gcc.link bin/test_null.test/gcc-4.8n/debug/test_null testing.capture-output bin/test_null.test/gcc-4.8n/debug/test_null.run **passed** bin/test_null.test/gcc-4.8n/debug/test_null.test gcc.compile.c++ bin/fail_default_construct.test/gcc-4.8n/debug/fail_default_construct.o In file included from fail_default_construct.cpp:11:0: ../../../boost/type_erasure/any.hpp: In instantiation of 'boost::type_erasure::any<Concept, T>::any() [with Concept = boost::type_erasure::copy_constructible<>; T = boost::type_erasure::_self]': fail_default_construct.cpp:18:32: required from here ../../../boost/type_erasure/any.hpp:157:9: error: no matching function for call to 'assertion_failed(mpl_::failed************ boost::type_erasure::is_relaxed<boost::type_erasure::copy_constructible<> >::************)' BOOST_MPL_ASSERT((::boost::type_erasure::is_relaxed<Concept>)); ^ ../../../boost/type_erasure/any.hpp:157:9: note: candidate is: BOOST_MPL_ASSERT((::boost::type_erasure::is_relaxed<Concept>)); ^ svn update shows: ~/prog_dev/boost-svn/ro/boost_1_49_0/sandbox/ro/type_erasure/type_erasure $ svn update At revision 80297. svn diff shows: ~/prog_dev/boost-svn/ro/boost_1_49_0/sandbox/ro/type_erasure/type_erasure $ svn diff|filterdiff --exclude=\*bjam.normal\* Index: boost/type_erasure/detail/normalize.hpp =================================================================== --- boost/type_erasure/detail/normalize.hpp (revision 80297) +++ boost/type_erasure/detail/normalize.hpp (working copy) @@ -353,7 +353,14 @@ struct collect_concepts ::boost::type_erasure::detail::substitution_map<Map> >::type transformed; typedef typename ::boost::mpl::eval_if< + #if 0 + ::boost::mpl::or_ + < ::boost::is_same<transformed, void> + , ::boost::mpl::is_sequence<Concept> + >, + #else ::boost::is_same<transformed, void>, + #endif ::boost::mpl::identity<Out>, ::boost::mpl::insert< Out, Index: libs/type_erasure/test/bjam.normalize_no_is_seq.out =================================================================== ~/prog_dev/boost-svn/ro/boost_1_49_0/sandbox/ro/type_erasure/type_erasure $ Anyone else seeing this? -regards, Larry

2 1

[thread] Memory usage of threads on 64bit linux
by Conrad Mercer 29 Aug '12

29 Aug '12

Hey, I have been using boost threads on 32bit linux for some time and am very happy with their performance so far. Recently the project was moved to a 64bit platform and we saw a huge increase in memory usage (from about 2.5gb to 16-17gb). I have done profiling and found that the boost threads are the source of the huge allocation. Each thread is allocating about 10x what it was doing on 32bit. I profiled using valgrind's massif and have confirmed the issue using only boost threads in a separate test application. I also tried using std::threads instead and these do not exhibit the large memory allocation issue. I am wondering if anyone else has seen this behaviour and knows what the problem is? Thanks --

4 4

[system] Viral C++11 change would break dependent libraries:-(
by Beman Dawes 28 Aug '12

28 Aug '12

Ticket #7278 asks that Boost.System add C++11 noexcept support. A reasonable request, and I implemented it this morning by adding BOOST_NOEXCEPT at the appropriate places specified in the standard. But there is a problem. noexcept is viral, so any classes that inherit from a class that uses noexcept must be changed to also use no except. An example: Boost.Filesystem has this class: class codecvt_error_cat : public boost::system::error_category { public: codecvt_error_cat(){} const char* name() const {return "codecvt";} std::string message(int ev) const; }; Compiling with GCC 4.7 -std=c++0x results in this error: ..\..\../boost/system/error_code.hpp:187:32: error: overriding 'virtual const char* boost::system::error_category::name() const noexcept (true)' To fix it, the filesystem class has to be changed: class codecvt_error_cat : public boost::system::error_category { public: codecvt_error_cat(){} const char* name() const BOOST_NOEXCEPT {return "codecvt";} std::string message(int ev) const; }; I've held off committing the Boost.System changes to trunk until we've had a chance to discuss how to approach this potential break to an unknown number of Boost and user libraries. Ideas? --Beman

5 7

[contract] Broken postconditions on throw
by Andrzej Krzemienski 28 Aug '12

28 Aug '12

Hi Lorenzo, I am now now playing with Contract library and trying to break it. I checked that the framework checks the class invariant even when member function exits via an exception. This is an expected behavior and the framework is working fine. However, I note that the precondition of a (non-member) function is not checked when the function exits via throwing an exception. See the following program: # include <contract.hpp> double get_random_weight() { return -1.0; // erroneous implementation } CONTRACT_FUNCTION ( void (set_weight)( (double&) w ) postcondition(w >= 0.0) ) { w = get_random_weight(); if (w < 0.0) throw 1; // (*) } int main() try { double w = 0.0; set_weight(w); } catch (...) { std::cerr << "CAUGHT EXCEPTION" << std::endl; } Function set_weight() is intended to assign its (output) argument with a value representing weight (in the physical sense). We guarantee that the value we set is always non-negative. The function clumsily attempts to verify the condition itself (the line with *). It signals the failure with an exception, but unfortunately fails to satisfy the postcondition. I expect that this situation should be reported as a postcondition violation. But no violation is reported, and the program successfully outputs "CAUGHT EXCEPTION". Regards, &rzej

4 11

[1.52.0] Open for merging
by Marshall Clow 28 Aug '12

28 Aug '12

The release branch (https://svn.boost.org/svn/boost/branches/release) is open for merging all stable changes from trunk, including bug fixes and major upgrades to existing libraries. Breaking changes should be coordinated via the mailing list with the developers of the other libraries affected. New libraries may be added, but require permission of a release manager. In other words, merging *does not* require permission from a release manager, except for new libraries. Boost Calendar with the release schedule: http://www.boost.org/development/index.html Release schedule explanation: http://svn.boost.org/trac/boost/wiki/ReleaseSchedule Release practices for developers: http://svn.boost.org/trac/boost/wiki/ImprovingPractices -- The Release Managers, Beman Dawes Daniel James Eric Niebler Marshall Clow Rene Rivera Vladimir Prus

3 2

[contract] a possible future extension
by Andrzej Krzemienski 28 Aug '12

28 Aug '12

Hi Lorenzo, This is definitely outside the scope of the review, but I was wondering whether it would be feasible for the macros in Boost.Contract to handle base class aliases, as described in this proposal: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2881.html The positive "side effect" of your framework is that it has the potential to add various missing language features. I am wondering if these aliases proposed in N2881 are worth the effort. Regards, &rzej

2 1

a (useful?) crtp trick
by pavel 28 Aug '12

28 Aug '12

hi all i post this in the hope someone finds this technique useful to make long story short, here is a snippet: template<typename t> //tag deducing util struct base_tag { typedef decltype(get_tag((t*)42)) type; }; template<typename type, typename tag = typename base_tag<type>::type> struct Base //crtp base class { friend tag get_tag(type*); //helper declaration, never defined }; template<typename type> //no mention of tag void f(const Base<type>&) //tag is deduced automatically {} struct Foo : Base<Foo, void> //derived type {}; int main() { Foo foo; f(foo); } the idea is that if we have an associated type (or types) along with the "real" type in the crtp pattern we can make that associated type deduced automatically and even pretend there is no such tag leaving it e.g. for advanced usage more on this here: http://programmizm.sourceforge.net/blog/2012/because-we-can -- Pavel P.S. if you notice a grammar mistake or weird phrasing in my message please point it out

3 7

release manager for 1.52?
by Oliver Kowalke 28 Aug '12

28 Aug '12

Who is the release manager for 1.52?

2 1

[atomic] lockfree failure on msvc 64-bit
by Christoph Macheiner 27 Aug '12

27 Aug '12

As indicated by http://www.boost.org/development/tests/trunk/developer/output/cm_x64-boost-…. In boost/atomic/detail/interlocked.hpp, BOOST_ATOMIC_LLONG_LOCK_FREE must be defined to 2 if _WIN64 is defined (cas64strong.hpp is included afterwards). Because the library has not yet been released, I didn't bother to create a ticket and because the change is so trivial I didn't create a patch as well (if either or both is required or wanted, please let me know). Question: If I recall correctly, long long can be made lockfree also in 32-bit. If I am right, is there a reason why it hasn't been done? Thanks. --Christoph.

1 0

memory corruption in async_read_until using asio::ssl
by Jim Page 27 Aug '12

27 Aug '12

Afternoon All I am seeing an occasional memory corruption bug, using valgrind, in our web server application that is using boost::asio::ssl, and it seems to be related to calls to async_read_until, where several chunks of data are required before the terminating regex is found. What appears to be happening is that engine::perform() causes a write (via ssl3_read_bytes()) on a deleted memory region, the buffer into which decrypted data is written. This region was delete'd via invocation of the detail::io_op::handler, and in turn via read_until_delim_op::operator(), due to prepare() being called on the streambuf, and a std::vector<char> is delete'd in order to create a larger one. It seems like one of the chain of handlers is using a pointer which is becomes invalid when the streambuff is expanded after failing to find the regex terminator after one or more reads, and prepare() is called before the next async_read_some() on the underlying stream. I have included the valgrind output at the end - sorry for the large size. I am pretty certain that I have ruled out the obvious (multiple simultaneous attempts to read using the same streambuf), and I am only using one thread for the io_service. This seems a pretty common potential failure mode, so perhaps I am barking up the wrong tree - I'd appreciate anyone's opinion before I start a potentially tricky debug effort requiring modification to the boost libraries on our production servers. I'm using boost 1.49. There's a lot of optimization on the application which is why some calls are optimized out of the valgrind dump. The machines are running Centos 5.8, x86_64. Compiler is gcc 4.4.6. Thanks for looking Jim Page ==29870== Thread 22: ==29870== Invalid write of size 1 ==29870== at 0x4A088F8: memcpy (mc_replace_strmem.c:587) ==29870== by 0x3400821EDE: ssl3_read_bytes (in /lib64/libssl.so.0.9.8e) ==29870== by 0x340081E750: ??? (in /lib64/libssl.so.0.9.8e) ==29870== by 0x66A75B: boost::asio::ssl::detail::engine::perform(int (boost::asio::ssl::detail::engine::*)(void*, unsigned long), void*, unsigned long, boost::system::error_code&, unsigned long*) (engine.ipp:219) ==29870== by 0x7E3326: boost::asio::ssl::detail::io_op<boost::asio::basic_stream_socket<boost::asio ::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> >, boost::asio::ssl::detail::read_op<boost::asio::mutable_buffers_1>, boost::asio::detail::rea d_until_expr_op<boost::asio::ssl::stream<boost::asio::basic_stream_socket<bo ost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> > >, std::allocator<char>, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >, boost::_bi::bind_t<void, boost::_mfi::mf2<void, HttpConnection, boost::system::error_code const&, char const*>, boost::_bi::list3<boost::_bi::value<boost::shared_ptr<HttpConnection> >, boost::arg<1> (*)(), boost::_bi::value<char const*> > > > >::operator()(boost::system::error_code, unsigned long, int) (engine.ipp:151) ==29870== by 0x7E45C2: boost::asio::detail::wait_handler<boost::asio::ssl::detail::io_op<boost::asi o::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> >, boost::asio::ssl::detail::read_op<boost::asio::mutable_buffers_1>, boost::asio::detail::read_until_expr_op<boost::asio::ssl::stream<boost::asio ::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> > >, std::allocator<char>, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >, boost::_bi::bind_t<void, boost::_mfi::mf2<void, HttpConnection, boost::system::error_code const&, char const*>, boost::_bi::list3<boost::_bi::value<boost::shared_ptr<HttpConnection> >, boost::arg<1> (*)(), boost::_bi::value<char const*> > > > > >::do_complete(boost::asio::detail::task_io_service*, boost::asio::detail::task_io_service_operation*, boost::system::error_code const&, unsigned long) (bind_handler.hpp:46) ==29870== by 0x619783: boost::asio::detail::task_io_service::run(boost::system::error_code&) (task_io_service_operation.hpp:37) ==29870== by 0x79F4FE: BayeuxServer::run() (io_service.ipp:59) ==29870== by 0x364800DB8E: ??? (in /usr/lib64/libboost_thread.so.1.49.0) ==29870== by 0x3AE300677C: start_thread (in /lib64/libpthread-2.5.so) ==29870== by 0x3AE20D325C: clone (in /lib64/libc-2.5.so) ==29870== Address 0x1b508610 is 0 bytes inside a block of size 1,024 free'd ==29870== at 0x4A05A33: operator delete(void*) (vg_replace_malloc.c:346) ==29870== by 0x658E54: std::vector<char, std::allocator<char> >::_M_fill_insert(__gnu_cxx::__normal_iterator<char*, std::vector<char, std::allocator<char> > >, unsigned long, char const&) (new_allocator.h:95) ==29870== by 0x68B805: boost::asio::basic_streambuf<std::allocator<char> >::reserve(unsigned long) (stl_vector.h:851) ==29870== by 0x7E2EF2: boost::asio::detail::read_until_expr_op<boost::asio::ssl::stream<boost::asio ::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> > >, std::allocator<char>, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >, boost::_bi::bind_t<void, boost::_mfi::mf2<void, HttpConnection, boost::system::error_code const&, char const*>, boost::_bi::list3<boost::_bi::value<boost::shared_ptr<HttpConnection> >, boost::arg<1> (*)(), boost::_bi::value<char const*> > > >::operator()(boost::system::error_code const&, unsigned long, int) (basic_streambuf.hpp:207) ==29870== by 0x7E32DE: boost::asio::ssl::detail::io_op<boost::asio::basic_stream_socket<boost::asio ::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> >, boost::asio::ssl::detail::read_op<boost::asio::mutable_buffers_1>, boost::asio::detail::read_until_expr_op<boost::asio::ssl::stream<boost::asio ::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> > >, std::allocator<char>, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >, boost::_bi::bind_t<void, boost::_mfi::mf2<void, HttpConnection, boost::system::error_code const&, char const*>, boost::_bi::list3<boost::_bi::value<boost::shared_ptr<HttpConnection> >, boost::arg<1> (*)(), boost::_bi::value<char const*> > > > >::operator()(boost::system::error_code, unsigned long, int) (read_op.hpp:59) ==29870== by 0x7E493C: boost::asio::detail::reactive_socket_recv_op<boost::asio::mutable_buffers_1, boost::asio::ssl::detail::io_op<boost::asio::basic_stream_socket<boost::asio ::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> >, boost::asio::ssl::detail::read_op<boost::asio::mutable_buffers_1>, boost::asio::detail::read_until_expr_op<boost::asio::ssl::stream<boost::asio ::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> > >, std::allocator<char>, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >, boost::_bi::bind_t<void, boost::_mfi::mf2<void, HttpConnection, boost::system::error_code const&, char const*>, boost::_bi::list3<boost::_bi::value<boost::shared_ptr<HttpConnection> >, boost::arg<1> (*)(), boost::_bi::value<char const*> > > > > >::do_complete(boost::asio::detail::task_io_service*, boost::asio::detail::task_io_service_operation*, boost::system::error_code const&, unsigned long) (bind_handler.hpp:118) ==29870== by 0x613778: boost::asio::detail::epoll_reactor::descriptor_state::do_complete(boost::asi o::detail::task_io_service*, boost::asio::detail::task_io_service_operation*, boost::system::error_code const&, unsigned long) (task_io_service_operation.hpp:37) ==29870== by 0x619783: boost::asio::detail::task_io_service::run(boost::system::error_code&) (task_io_service_operation.hpp:37) ==29870== by 0x79F4FE: BayeuxServer::run() (io_service.ipp:59) ==29870== by 0x364800DB8E: ??? (in /usr/lib64/libboost_thread.so.1.49.0) ==29870== by 0x3AE300677C: start_thread (in /lib64/libpthread-2.5.so) ==29870== by 0x3AE20D325C: clone (in /lib64/libc-2.5.so)

1 0

Boost.Process 0.5 released
by Boris Schaeling 27 Aug '12

27 Aug '12

Boost.Process 0.5 has been released! Documentation and library can be found at: <http://www.highscore.de/boost/process0.5/> Why version 0.5? We have no official process management library in Boost yet. But we had countless drafts since 2006. In order not to get completely lost between all those drafts I gave them version numbers. For example, 0.1 was the very first draft in 2006. 0.31 is the draft documented at <http://www.highscore.de/cpp/process/>. And 0.4 was the draft which was rejected in a formal review in spring 2011. Version 0.5 is the latest attempt to create a process management library. What's new? Version 0.5 has a very different design than all other drafts before. The design was proposed by Jeff Flinn who introduced it briefly at BoostCon 2011 when we gave a presentation on Boost.Process. The goals of this new version are: * A lightweight implementation (no overly complicated code anymore). * A fully extensible library (no need for arbitrary "extension points"). * Support for system-level cross-platform concepts only (no Java-like constructs). Other goals like making the library easy to use were of course also targeted. But these were goals before. The goals above are important as those things have been criticized in earlier drafts and were as far as I see the main reasons why version 0.4 had been rejected. What now? Please have a look at the documentation and think about whether this library could fit into Boost. If you have more time, please download and play around with the new version. Concentrate on the bigger picture: Does the design make sense? Is it easy to understand? Can you do what you want to do? Does it look and feel like modern C++? This is not a formal review. But it would help to get some feedback to see a tendency. After six years, two Google Summer of Code projects, countless drafts and still a lot of interest from many people in a process management library in Boost, we might be able to get somewhere this time. (If you are on Windows: There is a bug in Boost.Iostreams which has been fixed in the release candidate 1 of Boost 1.51.0. See the documentation if you run into a problem when closing pipes.) Anything missing? We had a closed beta test in the previous two weeks with about ten people who had contacted me because of their interest in Boost.Process. I got already some good feedback and have to change a few details. These are only details though and shouldn't stop anyone from using this new version now. If everyone is happy with the overall design and architecture and it's only details we have to discuss, it's already a huge step forward. Last but not least: Boost.Process 0.5 wouldn't exist without the help of Intra2net AG (<http://www.intra2net.com/>). Intra2net AG sponsored a project to support the development of Boost.Process. It was this sponsorship which made it possible to create this new version. Thanks to them! Boris

9 46

[rational] Over/underflow checked update ready for comments
by Dan Searles 26 Aug '12

26 Aug '12

>> Quick overview of the update: the original usage and >> code of the template class remains mostly as before, ie >> boost::rational<int> RationalVar; should work as >> in the original version. Adding 'true' as a second >> template parameter, however, allows an exception to >> be raised if an operation with a class variable results >> in a value that can't accurately be represented >I haven't looked at anything else, but I dislike using true/false as the template argument. I'd prefer meaningful names. _____ >Rob Stewart robert.stewart(a)sig.com >Software Engineer using std::disclaimer; >Dev Tools & Components >Susquehanna International Group, LLP http://www.sig.com Replaced the bool template parameter with an enum: enum RationalChecktype {RationalNoChecking, RationalCheckforOverflow};

1 0

[contract] "Duplicated globals" problem
by Andrzej Krzemienski 26 Aug '12

26 Aug '12

Hi Lorenzo, I think that installing broken contract handlers will not work correctly when a program is linking with DLLs on Windows. I do not know how dynamic linking works on Linux. Here is a sketch of a sample program that fails to work as expected. The program consists of two projects: one builds a DLL, the other builds an executable that links with the DLL: DLL: ==================================== # include <contract.hpp> # include "testdll.h" CONTRACT_FUNCTION ( int (give1) () postcondition(auto result = return, result == 1) ) { return 2; // obviously wrong } DLL_MODE void test_contracts() { int i = give1(); } ==================================== EXE: ==================================== # include <contract.hpp> # include "../testdll/testdll.h" void PostconditionHandler( contract::from const& context ) { std::cerr << "ERROR!!!" << std::endl; } int main() { contract::set_postcondition_broken(&PostconditionHandler); test_contracts(); } ==================================== I expect that the program would use the broken postcondition handler I installed, but it still uses the default one. The cause is that Contract is using some global object to store the installed handler, but when a program is linked with a DLL both the program and the DLL store their own copy of the global. The global is duplicated. THe one in the EXE registers my callback, but the global in the DLL still keeps the default handler. The only way to solve this issue is to -- at least in the cases when users' programs link with DLLs -- ship Contract with a small DLL that stores the unique copy of the globals. This is how Boost.Log handles this problem. Quoting the documentation ( http://boost-log.sourceforge.net/libs/log/doc/html/log/installation.html) *"If your application consists of more than one module (e.g. an exe and one or several dll's) that use Boost.Log, the library must be built as a shared object. If you have a single executable, you may build the library as a static library." * Regards, &rzej* *

2 1

complex acos and atanh
by Stephen Montgomery-Smith 26 Aug '12

26 Aug '12

Hey people, I was trying out your complex arc-trig functions, to compare them with some that I have written: http://people.freebsd.org/~stephen/catrig.c. I am finding that your acos function is getting some of them wrong. For example, your program evaluates acos(1.00000002785941 + I*5.72464869028403e-200) as 0 - I*0.000236048349018331 whereas it should be 2.42520172707401e-196 - I*0.000236048349018331. Also your complex atanh function does quite badly in some edge cases. I presume it is because Hull, Fairgrieve and Tang did not write a paper on that function. If you email Fairgrieve, he may give you a copy of the paper that was never published. He sent me a copy, but doesn't want it widely distributed. I devised my own algorithm at http://people.freebsd.org/~stephen/catrig.c, which actually turns out to be very similar to the unpublished algorithm of Hull, Fairgrieve and Tang. Anyway, I would be happy to work with whomever is currently working on these algorithms. I think someone must be, because I see that someone fixed a bug in asin since 1.48.0. Best regards, Stephen

2 2

[locale] Custom Gettext paths.
by Jookia 26 Aug '12

26 Aug '12

Hello! I'm extremely happy about Boost.Locale, but I've found a few things lacking. So at first I wrote a some wrappers to get around a few flaws with my usage of Boost.Locale. One of these flaws was how it's hardcoded to use the Gettext directory hierarchy. I'd rather store my stuff in 'lang/en_US.mo' rather than 'lang/en_US/LC_MESSAGES/my_app.mo'. The patch adds a 'path format' feature, which allows you to format the directory structure when finding Gettext catalogs, to achieve the effect above. All you really have to do is run: gen.add_path_format("{1}/{2}.mo"); // Use a smaller hierarchy. to achieve the result that I prefer, or gen.add_path_format("{1}/{2}/{3}/{4}.mo"); // Use a Gettext hierarchy. to achieve the result that Boost.Locale uses right now. Ripped straight from Doxygen comments: {1} A path to search for catalogs in. {2} The locale's name. {3} The locale's category. {4} The Gettext domain. I'm new to submitting patches and things, and I'm not sure how I could make this feature better or even acceptable if it isn't already, but I'm sure it'd help others out there. There are a few drawbacks I've found with my code: - To be backwards compatible I've had to add some hackery to add the Gettext format if the path formats vector is empty. - Without consulting documentation, the format is unreadable. - I haven't tested it on the Win32 backend. I'm 90% sure the code would work, it's only 4 lines of code added and it's identical to the code added in the other backends, but it's still untested code. - It's not tested properly. By properly, I mean the tests past with adding a format, and falling back to the default format, but I haven't tried having a 'compact' format. I'm not sure if this would indicate a fault in the formatting code though, as that'd be the only difference code-wise, unless there's more code that has the Gettext hierarchy hardcoded, that didn't fail when I didn't fix the tests. The patch itself is based off of SVN r80097, and despite the diff being for r80104 I haven't tested it in that.. I did the work internally in Git but I made the patch using SVN, in case that matters. I've attached the patch, but I'm not sure how well that's going to go over considering I'm new to mailing lists, and I'm using.. Thunderbird.. Yeah. In case the attachment fails, it's available at http://sprunge.us/VSiX . I'd also like to know if it's appropriate to put '[patch]' in the title for any future patches, and if it should go after '[locale]' or at the end of the title. Thanks, Jookia.

2 13

boost::filesystem -- using non-POSIX locale crashes on Solaris
by JonathonS 26 Aug '12

26 Aug '12

Hi, I am currently using boost::filesystem::path on Solaris, and I noticed that if I set the locale to anything except "C" or "POSIX" such as "en_US.UTF-8", that it crashes i.e. a run-time error gets thrown. I found a link describing the issue here: https://svn.boost.org/trac/boost/ticket/5928 My question is though, whether it is possible to use boost::filesystem without locales? Meaning, if I know my string is a UTF-8 string, is it possible to avoid the locale processing within the boost filesystem? Thanks, J

3 2

[Review] Boost.Contract Review Starts Today(*)
by Dave Abrahams 26 Aug '12

26 Aug '12

The review period for Lorenzo Caminiti's Boost.Contract library runs from today through August 31st. I'm pleased to serve as review manager. ,----[ Important Notes ] | - Please begin your review's subject line with "[Review:Algorithms]" | - Please do not post your review or discussion as a reply to this | message. | - Please feel free to note any individual issues in the issue | tracker at https://sourceforge.net/apps/trac/contractpp/report/3 | (you'll need to log in at Sourceforge to add a ticket) and make | reference to them from your review. | - Please see below for *further* important notes `---- THE LIBRARY Boost.Contract implements Contract Programming (a.k.a., Design by Contracts) for C++. In addition, the library implements virtual specifiers, concept checking, and named parameters. Documentation: http://contractpp.sourceforge.net Source: http://sourceforge.net/projects/contractpp/files/latest/download All N1962 requirements and Eiffel features are supported by the library, among others: 1) Support for preconditions, postconditions, class invariants, block invariants, and loop variants. 2) Subcontract derived classes (with support for pure virtual functions and multiple inheritance). 3) Access expression old values and function return value in postconditions. 4) Optional compilation and checking of preconditions, postconditions, class invariants, block invariants, and loop variants. 5) Customizable actions on contract assertion failure (terminate by default but it can throw, exit, etc). This library is implemented for C++03 and it does not require C++11. Obviously, if the library is accepted, all macros will be prefixed by BOOST_... and other symbols will go under the boost::... namespace. Potential Interactions with Existing Boost Libraries ==================================================== This submission potentially interacts with the following existing Boost libraries: * parameter - http://boost.org/libs/parameter * static_assert - http://www.boost.org/libs/static_assert * MPL - http://www.boost.org/libs/mpl * Concept - http://www.boost.org/libs/concept_check Reviewers should consider these potential interactions. What to include in Review Comments ================================== - Keep your criticism constructive. Constructive criticism usually comes with specific suggestions for improvement. - If you identify problems along the way, please note if they are minor, serious, or showstoppers. - Please *do* vote on whether the library should be accepted. Everyone who takes the time to look at the library is qualified to vote, and every vote is valuable. - Other questions you might want to answer in your review: * What is your evaluation of the design? * What is your evaluation of the implementation? * What is your evaluation of the documentation? * What is your evaluation of the potential usefulness of the library? * Did you try to use the library? With what compiler? Did you have any problems? * How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? * Are you knowledgeable about the problem domain? (*) Well, OK, the review period officially started yesterday. Sorry for the delayed announcement -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

2 2

[iterator] transform_iterator and move-only types
by Nathan Ridge 25 Aug '12

25 Aug '12

Hi, The following code fails to compile for me: #include <memory> #include <boost/iterator/transform_iterator.hpp> std::unique_ptr<int> foo(int i) { return std::unique_ptr<int>(new int(i)); } int main() { int a[5] = {1, 2, 3, 4, 5}; auto it = boost::make_transform_iterator(a, foo); } The error message I get with GCC 4.8 is pasted below. I think this should work because returning a move-only type from a function by value is a perfectly valid thing to do. Do you agree? Should I file a bug? Thanks, Nate In file included from boost/iterator/iterator_categories.hpp:20:0, from boost/iterator/iterator_adaptor.hpp:14, from boost/iterator/transform_iterator.hpp:12, from test.cpp:2: boost/type_traits/is_convertible.hpp: In instantiation of 'const bool boost::detail::is_convertible_basic_impl<std::unique_ptr<int>&, std::unique_ptr<int> >::value': boost/type_traits/is_convertible.hpp:296:5: required from 'const bool boost::detail::is_convertible_impl<std::unique_ptr<int>, std::unique_ptr<int> >::value' boost/type_traits/is_convertible.hpp:419:1: required from 'struct boost::is_convertible<std::unique_ptr<int>, std::unique_ptr<int> >' boost/mpl/aux_/nested_type_wknd.hpp:26:31: required from 'struct boost::mpl::aux::nested_type_wknd<boost::is_convertible<std::unique_ptr<int>, std::unique_ptr<int> > >' boost/mpl/aux_/preprocessed/gcc/and.hpp:23:8: required from 'struct boost::mpl::aux::and_impl<true, boost::is_convertible<std::unique_ptr<int>, std::unique_ptr<int> >, mpl_::bool_<true>, mpl_::bool_<true>, mpl_::bool_<true> >' boost/mpl/aux_/preprocessed/gcc/and.hpp:48:8: required from 'struct boost::mpl::and_<boost::is_convertible<boost::random_access_traversal_tag, boost::single_pass_traversal_tag>, boost::is_convertible<std::unique_ptr<int>, std::unique_ptr<int> >, mpl_::bool_<true>, mpl_::bool_<true>, mpl_::bool_<true> >' boost/mpl/if.hpp:67:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] boost/iterator/detail/facade_iterator_category.hpp:187:8: required from 'struct boost::detail::facade_iterator_category<boost::random_access_traversal_tag, std::unique_ptr<int>, std::unique_ptr<int> >' boost/iterator/iterator_facade.hpp:104:17: required from 'struct boost::detail::iterator_facade_types<std::unique_ptr<int>, boost::random_access_traversal_tag, std::unique_ptr<int>, long int>' boost/iterator/iterator_facade.hpp:621:9: required from 'class boost::iterator_facade<boost::transform_iterator<std::unique_ptr<int> (*)(int), int*, boost::use_default, boost::use_default>, std::unique_ptr<int>, boost::random_access_traversal_tag, std::unique_ptr<int>, long int>' boost/iterator/iterator_adaptor.hpp:261:9: required from 'class boost::iterator_adaptor<boost::transform_iterator<std::unique_ptr<int> (*)(int), int*, boost::use_default, boost::use_default>, int*, std::unique_ptr<int>, boost::use_default, std::unique_ptr<int>, boost::use_default>' boost/iterator/transform_iterator.hpp:74:9: required from 'class boost::transform_iterator<std::unique_ptr<int> (*)(int), int*, boost::use_default, boost::use_default>' test.cpp:12:52: required from here boost/type_traits/is_convertible.hpp:136:23: error: use of deleted function 'std::unique_ptr<_Tp, _Dp>::unique_ptr(const std::unique_ptr<_Tp, _Dp>&) [with _Tp = int; _Dp = std::default_delete<int>]' static bool const value = sizeof( boost::detail::checker<To>::_m_check(_m_from, 0) ) ^ In file included from c++/4.8.0/memory:81:0, from test.cpp:1: c++/4.8.0/bits/unique_ptr.h:259:7: error: declared here unique_ptr(const unique_ptr&) = delete; ^ In file included from boost/iterator/iterator_categories.hpp:20:0, from boost/iterator/iterator_adaptor.hpp:14, from boost/iterator/transform_iterator.hpp:12, from test.cpp:2: boost/type_traits/is_convertible.hpp:129:41: error: initializing argument 1 of 'static boost::type_traits::yes_type boost::detail::checker<T>::_m_check(T, int) [with T = std::unique_ptr<int>; boost::type_traits::yes_type = char]' static boost::type_traits::yes_type _m_check(T, int); ^

2 2

[tools/regression + filesystem] compiler error
by Jeffrey Lee Hellrung, Jr. 25 Aug '12

25 Aug '12

I was trying to build the boost tools (v1.51.0) and ran into the error pasted below. Should this be concerning? - Jeff Performing configuration checks - has_icu builds : no ...patience... ...patience... ...found 2720 targets... ...updating 3 targets... compile-c-c++ ..\build\boost\regression\msvc-9.0\release\link-static\threading-multi\library_status.obj library_status.cpp regression\src\library_status.cpp(633) : error C2440: 'initializing' : cannot convert from 'const boost::filesystem::path::string_type' to 'std::basic_string<_Elem,_Traits,_Ax>' with [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] No constructor could take the source type, or constructor overload resolution was ambiguous regression\src\library_status.cpp(761) : error C2664: 'std::basic_string<_Elem,_Traits,_Ax> &std::basic_string<_Elem,_Traits,_Ax>::append(const std::basic_string<_Elem,_Traits,_Ax> &)' : cannot convert parameter 1 from 'const boost::filesystem::path::string_type' to 'const std::basic_string<_Elem,_Traits,_Ax> &' with [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] Reason: cannot convert from 'const boost::filesystem::path::string_type' to 'const std::basic_string<_Elem,_Traits,_Ax>' with [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called ..\boost/test/impl/execution_monitor.ipp(948) : warning C4535: calling _set_se_translator() requires /EHa regression\src\library_status.cpp(899) : error C2679: binary '=' : no operator found which takes a right-hand operand of type 'const boost::filesystem::path::string_type' (or there is no acceptable conversion) c:\Program Files (x86)\Microsoft Visual Studio 9.0\VC\INCLUDE\xstring(914): could be 'std::basic_string<_Elem,_Traits,_Ax> &std::basic_string<_Elem,_Traits,_Ax>::operator =(const std::basic_string<_Elem,_Traits,_Ax> &)' with [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] c:\Program Files (x86)\Microsoft Visual Studio 9.0\VC\INCLUDE\xstring(919): or 'std::basic_string<_Elem,_Traits,_Ax> &std::basic_string<_Elem,_Traits,_Ax>::operator =(const _Elem *)' with [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] c:\Program Files (x86)\Microsoft Visual Studio 9.0\VC\INCLUDE\xstring(924): or 'std::basic_string<_Elem,_Traits,_Ax> &std::basic_string<_Elem,_Traits,_Ax>::operator =(_Elem)' with [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] while trying to match the argument list '(std::string, const boost::filesystem::path::string_type)' call "C:\Program Files (x86)\Microsoft Visual Studio 9.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"..\build\boost\regression\msvc-9.0\release\link-static\threading-multi\library_status.obj.rsp" ...failed compile-c-c++ ..\build\boost\regression\msvc-9.0\release\link-static\threading-multi\library_status.obj... ...skipped <p..\build\boost\regression\msvc-9.0\release\link-static\threading-multi>library_status.exe for lack of <p..\build\boost\regression\msvc-9.0\release\link-static\threading-multi>library_status.obj... ...skipped <p..\dist\bin>library_status.exe for lack of <p..\build\boost\regression\msvc-9.0\release\link-static\threading-multi>library_status.exe... ...failed updating 1 target... ...skipped 2 targets...

1 0

[phoenix] Help needed with a custom terminal
by Andrey Semashev 25 Aug '12

25 Aug '12

Hi, I'm trying to define a custom terminal that acts as a replacement of operator<< in expressions when the right argument of the operator is of my special type. The terminal aggregates its left subexpression which results in reference to a stream, and result type of the terminal is the same reference. In short, it looks like this: namespace my { struct argument { std::string m_value; explicit argument(std::string const& value); }; template< typename LeftT > class output_terminal { public: typedef void _is_my_terminal; //! Self type typedef output_terminal this_type; //! Result type definition template< typename > struct result; template< typename ContextT > struct result< this_type(ContextT) > { typedef typename remove_cv< typename remove_reference< ContextT >::type >::type context_type; typedef typename phoenix::evaluator::impl< typename LeftT::proto_base_expr&, context_type, phoenix::unused >::result_type type; }; template< typename ContextT > struct result< const this_type(ContextT) > { typedef typename remove_cv< typename remove_reference< ContextT >::type >::type context_type; typedef typename phoenix::evaluator::impl< typename LeftT::proto_base_expr const&, context_type, phoenix::unused >::result_type type; }; private: //! Left argument actor LeftT m_left; //! Right argument std::string m_right; public: //! Initializing constructor output_terminal(LeftT const& left, std::string const& right); //! Invokation operator template< typename ContextT > typename result< const this_type(ContextT) >::type operator() (ContextT const& ctx) const { typedef typename result< const this_type(ContextT) >::type result_type; result_type strm = phoenix::eval(m_left, ctx); strm << m_right; return strm; } }; template< typename LeftExprT > inline phoenix::actor< output_terminal< phoenix::actor< LeftExprT > > > operator<< (phoenix::actor< LeftExprT > const& left, argument const& right) { phoenix::actor< output_terminal< phoenix::actor< LeftExprT > > > res = { output_terminal< phoenix::actor< LeftExprT > >(left, right.m_value) }; return res; } typedef phoenix::expression::argument< 1 >::type stream_type; const stream_type stream = {}; } // namespace my int main(int, char*[]) { function< void (std::ostream&) > func; func = my::operator<< (my::stream, my::argument("Hello, world!")); func(std::cout); return 0; } I also have specialized phoenix::result_of::is_nullary, phoenix::is_custom_terminal and phoenix::custom_terminal based on the _is_my_terminal tag. The problem is that the code doesn't compile. The compiler output is quite lengthy and it ends in this: ./boost/fusion/adapted/struct/detail/at_impl.hpp:24:16: error: invalid use of incomplete type ‘struct boost::fusion::extension::access::struct_member<boost::phoenix::vector1<const boost::phoenix::actor<boost::proto::exprns_::expr<boost::proto::tagns_::tag::terminal, boost::proto::argsns_::term<my::output_terminal<boost::phoenix::actor<boost::proto::exprns_::basic_expr<boost::proto::tagns_::tag::terminal, boost::proto::argsns_::term<boost::phoenix::argument<1> >, 0l> > > >, 0l> >*>, 1>’ It is not clear where the problem is but I think for some reason Boost.Phoenix thinks that output_terminal is a nullary terminal, despite the fact that I specialized is_nullary to return false. Is there something wrong with my code or is it a problem with Boost.Phoenix? I have posted the complete code here: http://pastebin.com/Vniq1b5Y and here is the compiler output: http://pastebin.com/8Beg4LiY I'm using release SVN branch and GCC 4.6. Thanks in advance.

1 1

[rational] Over/underflow checked update ready for comments
by Dan Searles 25 Aug '12

25 Aug '12

For those interested in rational, there is an updated version in https://svn.boost.org/svn/boost/sandbox/rational ready for comments. Quick overview of the update: the original usage and code of the template class remains mostly as before, ie boost::rational<int> RationalVar; should work as in the original version. Adding 'true' as a second template parameter, however, allows an exception to be raised if an operation with a class variable results in a value that can't accurately be represented, ie boost::rational<int,true> RationalVarChecked. Checking is only needed on limited precision integer types, and it has been tested with signed char, short, int and long long. Thank you for your constructive comments. Dan Searles

2 1

attempting sandbox svg_plot templates
by Roger Martin 25 Aug '12

25 Aug '12

Hi, Thought svg_plot (https://svn.boost.org/svn/boost/sandbox/SOC/2007/visualization/) is an interesting approach. Trying to stand it up and test it's implementation status. Using gcc 4.7 on Windows 7, Ubuntu 12.04 and CentOS 5. all 64 bit. Run into many template and friend issues. Anybody getting this lib to work? Much coming from https://svn.boost.org/svn/boost/sandbox/SOC/2007/visualization/boost/svg_pl…. First two: .............. In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:32:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:241:11: required from here ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:97:24: error: template-id ‘operator<< <>’ for ‘std::ostream& boost::svg::operator<<(std::ostream&, const boost::svg::unc<false>&)’ does not match any template declaration ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:102:24: error: template-id ‘operator<< <>’ for ‘std::ostream& boost::svg::operator<<(std::ostream&, const std::pair<boost::svg::unc<false>, boost::svg::unc<false> >&)’ does not match any template declaration .............. for the code: .............. friend std::ostream& operator<< <> (std::ostream& os, const unc<correlated>& u); /*! Output a pair of (X and Y) values with (if defined) uncertainty and degrees of freedom. \details For example: "1.23 +/- 0.01 (13), 3.45 +/- 0.06 (78)". */ friend std::ostream& operator<< <> (std::ostream& os, const std::pair<unc, unc>& u); ............... Seems to be where std::ostream is being extended or derived from. But I'm not discerning the template error or good at interpreting them. How to learn? Been looking for examples and where the gcc version makes a difference but get too many hits with google. Headers in unit test leading up to the svg_plot headers are: ------------------------ #include <cmath> #include <map> #include <stdio.h> #include <stdlib.h> #include <vector> #include <iostream> #include <ostream> #include "CUnit/Basic.h" #include "boost/array.hpp" #include "boost/svg_plot/svg.hpp" #include "boost/svg_plot/svg_2d_plot.hpp" #include "boost/svg_plot/show_2d_settings.hpp" .............................. -------------- All the errors and warnings: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp: In instantiation of ‘class boost::svg::unc<false>’: In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:32:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:241:11: required from here ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:97:24: error: template-id ‘operator<< <>’ for ‘std::ostream& boost::svg::operator<<(std::ostream&, const boost::svg::unc<false>&)’ does not match any template declaration ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:102:24: error: template-id ‘operator<< <>’ for ‘std::ostream& boost::svg::operator<<(std::ostream&, const std::pair<boost::svg::unc<false>, boost::svg::unc<false> >&)’ does not match any template declaration ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp: In instantiation of ‘class boost::svg::unc<true>’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:293:28: required from here ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:97:24: error: template-id ‘operator<< <>’ for ‘std::ostream& boost::svg::operator<<(std::ostream&, const boost::svg::unc<true>&)’ does not match any template declaration ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:102:24: error: template-id ‘operator<< <>’ for ‘std::ostream& boost::svg::operator<<(std::ostream&, const std::pair<boost::svg::unc<true>, boost::svg::unc<true> >&)’ does not match any template declaration In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:36:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:87:57: error: ‘result_type’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:87:57: note: suggested alternative: In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/functional/hash/detail/hash_float.hpp:16:0, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/functional/hash/hash.hpp:15, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/functional/hash.hpp:6, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/unordered/unordered_map.hpp:21, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/unordered_map.hpp:16, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/ptr_container/ptr_unordered_map.hpp:19, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/ptr_container/ptr_container.hpp:25, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/svg_tag.hpp:22, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg.hpp:184, from tests/plotting_tests.cpp:20: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/integer/static_log2.hpp:45:45: note: ‘boost::detail::static_log2_impl::result_type’ In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:36:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:87:57: error: template argument 1 is invalid ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:87:40: error: template argument 2 is invalid ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:87:18: warning: ‘typedef’ was ignored in this declaration [enabled by default] ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp: In member function ‘std::pair<boost::svg::unc<correlated>, boost::svg::unc<correlated> > boost::svg::detail::pair_unc_2d_convert<correlated>::operator()(T)’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:105:26: error: ‘un’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:105:39: error: wrong number of template arguments (1, should be 2) In file included from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h:65:0, from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h:63, from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/map:60, from tests/plotting_tests.cpp:10: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h:88:12: error: provided for ‘template<class _T1, class _T2> struct std::pair’ In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:36:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:105:40: error: expected ‘;’ before ‘c’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:105:40: error: ‘c’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:105:59: error: expected primary-expression before ‘>’ token ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/FP_compare.hpp: At global scope: In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:30:0, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:37, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/FP_compare.hpp:112:12: error: declaration of ‘class FPT’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/FP_compare.hpp:106:10: error: shadows template parm ‘class FPT’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/FP_compare.hpp:187:12: error: declaration of ‘class FPT’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/FP_compare.hpp:172:10: error: shadows template parm ‘class FPT’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/FP_compare.hpp:207:12: error: declaration of ‘class FPT’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/FP_compare.hpp:172:10: error: shadows template parm ‘class FPT’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/FP_compare.hpp:219:12: error: declaration of ‘class FPT’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/FP_compare.hpp:172:10: error: shadows template parm ‘class FPT’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp: In function ‘void boost::svg::scale_axis(const T&, double*, double*, double*, int*, double*, double*, double*, int*, bool, double, bool, double, int, int, bool, double, int, int)’: In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:37:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:350:51: error: to refer to a type member of a template parameter, use ‘typename T:: const_iterator’ [-fpermissive] ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:350:51: error: to refer to a type member of a template parameter, use ‘typename T:: const_iterator’ [-fpermissive] ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:359:5: error: need ‘typename’ before ‘T:: const_iterator’ because ‘T’ is a dependent scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:359:23: error: expected ‘;’ before ‘pos’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:360:9: error: ‘pos’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:364:25: error: ‘pos’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:395:5: error: need ‘typename’ before ‘T:: const_iterator’ because ‘T’ is a dependent scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:395:23: error: expected ‘;’ before ‘pos’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:396:11: error: ‘pos’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:401:9: error: ‘pos’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:456:7: error: ‘cout’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:456:7: note: suggested alternatives: In file included from tests/plotting_tests.cpp:14:0: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:37:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:456:186: error: ‘endl’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:456:186: note: suggested alternatives: In file included from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:40:0, from tests/plotting_tests.cpp:14: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp: In function ‘size_t boost::svg::show(const T&)’: In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:37:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:666:3: error: ‘cout’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:666:3: note: suggested alternatives: In file included from tests/plotting_tests.cpp:14:0: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:37:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:667:8: error: need ‘typename’ before ‘T:: const_iterator’ because ‘T’ is a dependent scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:667:26: error: expected ‘;’ before ‘it’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:667:50: error: ‘it’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:671:11: error: ‘endl’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:671:11: note: suggested alternatives: In file included from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:40:0, from tests/plotting_tests.cpp:14: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp: In function ‘size_t boost::svg::show(iter, iter)’: In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:37:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:684:5: error: ‘cout’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:684:5: note: suggested alternatives: In file included from tests/plotting_tests.cpp:14:0: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:37:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:687:3: error: ‘cout’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:687:3: note: suggested alternatives: In file included from tests/plotting_tests.cpp:14:0: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:62:18: note: ‘std::cout’ In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:37:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:688:11: error: ‘endl’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:688:11: note: suggested alternatives: In file included from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:40:0, from tests/plotting_tests.cpp:14: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:562:5: note: ‘std::endl’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp: In function ‘std::pair<double, double> boost::svg::range(const T&)’: In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:37:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:708:49: error: to refer to a type member of a template parameter, use ‘typename T:: const_iterator’ [-fpermissive] ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:708:49: error: to refer to a type member of a template parameter, use ‘typename T:: const_iterator’ [-fpermissive] ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp: In function ‘std::pair<double, double> boost::svg::range_all(const T&)’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:720:37: error: ‘numeric_limits’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:720:37: note: suggested alternatives: In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/limits.hpp:19:0, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/iterator/iterator_concepts.hpp:26, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/range/concepts.hpp:20, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/range/algorithm/equal.hpp:14, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/range/iterator_range_core.hpp:29, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/range/iterator_range.hpp:13, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/ptr_container/ptr_map_adapter.hpp:23, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/ptr_container/ptr_map.hpp:20, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/ptr_container/ptr_container.hpp:22, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/svg_tag.hpp:22, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg.hpp:184, from tests/plotting_tests.cpp:20: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/limits:304:12: note: ‘std::numeric_limits’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/limits:304:12: note: ‘std::numeric_limits’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/limits:304:12: note: ‘std::numeric_limits’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/limits:304:12: note: ‘std::numeric_limits’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/limits:304:12: note: ‘std::numeric_limits’ In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:37:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:720:52: error: expected primary-expression before ‘double’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:720:52: error: expected ‘)’ before ‘double’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:721:8: error: need ‘typename’ before ‘T:: const_iterator’ because ‘T’ is a dependent scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:721:26: error: expected ‘;’ before ‘it’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:721:51: error: ‘it’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:723:5: error: ‘pair’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:723:5: note: suggested alternatives: In file included from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h:65:0, from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h:63, from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/map:60, from tests/plotting_tests.cpp:10: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h:88:12: note: ‘std::pair’ In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/mpl/iter_fold_if.hpp:23:0, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/mpl/find_if.hpp:19, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/mpl/find.hpp:17, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/mpl/aux_/contains_impl.hpp:20, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/mpl/contains.hpp:20, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/math/policies/policy.hpp:10, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/math/special_functions/math_fwd.hpp:28, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/math/special_functions/fpclassify.hpp:19, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/numeric_limits_handling.hpp:22, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/axis_plot_frame.hpp:22, from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:34, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/mpl/pair.hpp:28:8: note: ‘boost::mpl::pair’ In file included from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_algobase.h:65:0, from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_tree.h:63, from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/map:60, from tests/plotting_tests.cpp:10: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h:88:12: note: ‘std::pair’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h:88:12: note: ‘std::pair’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h:88:12: note: ‘std::pair’ /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/stl_pair.h:88:12: note: ‘std::pair’ In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:37:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:723:10: error: expected primary-expression before ‘double’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:723:10: error: expected ‘;’ before ‘double’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/auto_axes.hpp:724:31: error: ‘mm’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: At global scope: In file included from tests/plotting_tests.cpp:21:0: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:73:12: warning: class ‘boost::svg::svg_2d_plot_series’ is implicitly friends with itself [enabled by default] ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:78:45: error: ‘series_’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:78:45: error: template argument 1 is invalid ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:78:33: error: template argument 2 is invalid ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:78:33: error: template argument 4 is invalid ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: In constructor ‘boost::svg::svg_2d_plot_series::svg_2d_plot_series(T, T, std::string)’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:153:41: error: ‘temp’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:153:49: error: an assignment cannot appear in a constant-expression ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:153:49: error: template argument 1 is invalid ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:153:29: error: template argument 2 is invalid ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:163:9: error: ‘series_’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: In member function ‘int boost::svg::svg_2d_plot_series::values_count()’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:319:12: error: ‘series_’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: At global scope: In file included from tests/plotting_tests.cpp:21:0: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:2266:95: error: ‘pair_double_2d_convert’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:2266:95: note: suggested alternative: In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:36:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:52:7: note: ‘boost::svg::detail::pair_double_2d_convert’ In file included from tests/plotting_tests.cpp:21:0: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:2270:105: error: ‘pair_double_2d_convert’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:2270:105: note: suggested alternative: In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:36:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/detail/functors.hpp:52:7: note: ‘boost::svg::detail::pair_double_2d_convert’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: In member function ‘void boost::svg::svg_2d_plot::draw_straight_lines(const boost::svg::svg_2d_plot_series&)’: In file included from tests/plotting_tests.cpp:21:0: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1621:19: error: ‘const class boost::svg::svg_2d_plot_series’ has no member named ‘series_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1623:48: error: ‘::const_iterator’ has not been declared ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1623:90: error: template argument 1 is invalid ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1623:37: error: template argument 2 is invalid ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1623:37: error: template argument 4 is invalid ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1629:34: error: ‘j’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1655:29: error: ‘const class boost::svg::svg_2d_plot_series’ has no member named ‘series_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: In member function ‘void boost::svg::svg_2d_plot::draw_bezier_lines(const boost::svg::svg_2d_plot_series&)’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1700:19: error: ‘const class boost::svg::svg_2d_plot_series’ has no member named ‘series_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1702:80: error: ‘const class boost::svg::svg_2d_plot_series’ has no member named ‘series_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1723:32: error: ‘const class boost::svg::svg_2d_plot_series’ has no member named ‘series_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: In member function ‘void boost::svg::svg_2d_plot::draw_plot_points()’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1788:87: error: ‘class boost::svg::svg_2d_plot_series’ has no member named ‘series_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1789:31: error: ‘class boost::svg::svg_2d_plot_series’ has no member named ‘series_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: In member function ‘void boost::svg::svg_2d_plot::draw_bars()’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1929:87: error: ‘class boost::svg::svg_2d_plot_series’ has no member named ‘series_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:1930:31: error: ‘class boost::svg::svg_2d_plot_series’ has no member named ‘series_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: In member function ‘void boost::svg::svg_2d_plot::draw_histogram()’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:2020:86: error: ‘class boost::svg::svg_2d_plot_series’ has no member named ‘series_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:2028:87: error: ‘class boost::svg::svg_2d_plot_series’ has no member named ‘series_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: In member function ‘boost::svg::svg_2d_plot& boost::svg::svg_2d_plot::y_autoscale(const T&, const T&)’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:2709:9: error: expected ‘)’ before ‘y_include_zero_’ ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: In member function ‘boost::svg::svg_2d_plot_series& boost::svg::svg_2d_plot::plot(const T&, const string&, U)’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:3183:22: error: ‘series_’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: In member function ‘boost::svg::svg_2d_plot_series& boost::svg::svg_2d_plot::plot(const T&, const T&, const string&)’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:3199:25: error: expected primary-expression before ‘(’ token ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:3200:67: error: missing template arguments before ‘(’ token ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:3201:65: error: missing template arguments before ‘(’ token ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:3204:22: error: ‘series_’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp: In member function ‘boost::svg::svg_2d_plot_series& boost::svg::svg_2d_plot::plot(const T&, const T&, const string&, U)’: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:3215:38: error: ‘container’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:3219:22: error: ‘series_’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/show_2d_settings.hpp: In function ‘void boost::svg::outFmtFlags(std::ios_base::fmtflags, std::ostream&, const char*)’: In file included from tests/plotting_tests.cpp:22:0: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/show_2d_settings.hpp:71:15: error: invalid conversion from ‘int’ to ‘std::ios_base::fmtflags {aka std::_Ios_Fmtflags}’ [-fpermissive] ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/show_2d_settings.hpp:94:17: error: invalid conversion from ‘int’ to ‘std::ios_base::fmtflags {aka std::_Ios_Fmtflags}’ [-fpermissive] In file included from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ios:43:0, from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:40, from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:40, from tests/plotting_tests.cpp:14: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h:564:5: error: initializing argument 1 of ‘std::ios_base::fmtflags std::ios_base::flags(std::ios_base::fmtflags)’ [-fpermissive] ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/show_2d_settings.hpp: In function ‘void boost::svg::show_2d_plot_settings(boost::svg::svg_2d_plot&)’: In file included from tests/plotting_tests.cpp:22:0: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/show_2d_settings.hpp:195:51: error: invalid conversion from ‘int’ to ‘std::ios_base::fmtflags {aka std::_Ios_Fmtflags}’ [-fpermissive] ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/show_2d_settings.hpp:61:6: error: initializing argument 1 of ‘void boost::svg::outFmtFlags(std::ios_base::fmtflags, std::ostream&, const char*)’ [-fpermissive] ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/show_2d_settings.hpp:307:20: error: invalid conversion from ‘int’ to ‘std::ios_base::fmtflags {aka std::_Ios_Fmtflags}’ [-fpermissive] In file included from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ios:43:0, from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/ostream:40, from /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/iostream:40, from tests/plotting_tests.cpp:14: /home/roger/Software/gcc-4.7/bin/../lib/gcc/x86_64-unknown-linux-gnu/4.7.0/../../../../include/c++/4.7.0/bits/ios_base.h:564:5: error: initializing argument 1 of ‘std::ios_base::fmtflags std::ios_base::flags(std::ios_base::fmtflags)’ [-fpermissive] tests/plotting_tests.cpp: In function ‘void test1()’: tests/plotting_tests.cpp:168:16: error: ‘data1’ was not declared in this scope tests/plotting_tests.cpp:169:16: error: ‘data2’ was not declared in this scope ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp: In instantiation of ‘std::ostream& boost::svg::operator<<(std::ostream&, const boost::svg::unc<correlated>&) [with bool correlated = false; std::ostream = std::basic_ostream<char>]’: In file included from ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/svg_2d_plot.hpp:32:0, from tests/plotting_tests.cpp:21: ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:267:73: required from here ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:123:10: error: ‘double boost::svg::unc<false>::value_’ is private ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:237:3: error: within this context ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:124:9: error: ‘float boost::svg::unc<false>::uncertainty_’ is private ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:238:3: error: within this context ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:124:9: error: ‘float boost::svg::unc<false>::uncertainty_’ is private ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:241:5: error: within this context ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:127:18: error: ‘short unsigned int boost::svg::unc<false>::deg_free_’ is private ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:254:3: error: within this context ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:127:18: error: ‘short unsigned int boost::svg::unc<false>::deg_free_’ is private ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:256:5: error: within this context ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:135:18: error: ‘short unsigned int boost::svg::unc<false>::types_’ is private ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:259:3: error: within this context ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:135:18: error: ‘short unsigned int boost::svg::unc<false>::types_’ is private ../../testing-grounds/divcon-support_libs/local/r.linux-x86_64.gcc-shared/include/boost/svg_plot/uncertain.hpp:261:5: error: within this context gmake[1]: *** [build/Release/GNU-4.7-Linux-x86/tests/tests/plotting_tests.o] Error 1 gmake[1]: Leaving directory `/home/roger/NetBeansProjects/JPRoothaan' gmake: *** [.build-tests-impl] Error 2

4 4

Re: [boost] What to do with platform defining 'null' as preprocessor symbol?
by Stewart, Robert 24 Aug '12

24 Aug '12

Jan Hudec wrote: > > At work we develop, among others, for Bada. The system > library provided is unfortunately somewhat flaky. A tell-tale > sign is, that it's native API headers define lowercase 'null' > as preprocessor symbol expanding to 0. Another one, huh? Did they learn that trick from Microsoft? > Unfortunately boost uses identifier 'null'. [snip] > Would it make sense to rename those identifiers and avoid > that name like boost avoids 'min' and 'max'? Boost doesn't avoid "min" and "max" but encloses them in parentheses to prevent preprocessor expansion. "null" could be treated similarly, though some may prefer to choose a different identifier. (At least there isn't an algorithm named "null"!) You'll need to find all the places where "null" occurs and file Trac tickets to get things fixed. If you supply patches against trunk, they are more likely to be applied. If you can apply the patches and run the tests yourself against several compilers on different platforms, you could send a summary reply to this thread with the Trac issues and the results of your testing. Then, someone might even submit all of your patches in one go. _____ Rob Stewart robert.stewart(a)sig.com Software Engineer using std::disclaimer; Dev Tools & Components Susquehanna International Group, LLP http://www.sig.com ________________________________ IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

11 17

Announce: Boost 1.51 installer for 32/64-bit Windows now available
by John Wiegley 24 Aug '12

24 Aug '12

BoostPro is happy to announce that we now have free 32-bit and 64-bit installers for Windows available for download: http://www.boostpro.com/download This version libraries and/or DLLs for the following compilers: Visual C++ 7.1 (Visual Studio 2003) [32-bit only] Visual C++ 8.0 (Visual Studio 2005 SP1) Visual C++ 9.0 (Visual Studio 2008 SP1) Visual C++ 10.0 (Visual Studio 2010 SP1) -- John Wiegley BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

2 2

Sequence Printer (usually part or all of a container) using type_erasure
by Paul A. Bristow 24 Aug '12

24 Aug '12

With the recent acceptance of type erasure as a Boost library, I have continued experiments with the sequence printer provided as an example by Steven Watanbe. This seems to me to have very general usefulness, providing a way of safely, neatly and painlessly printing the contents of a container of any type. To give a flavour of what can be done, given some items in a container, one can print the whole container: double da[] = {1., 2., 3., 4., 5., 6., 7., 8., 9., 10., 11., 12. }; decor_printer line_printer; // Using all decor_printer defaults. line_printer.print(da, std::cout); // "1 2 3 4 5 6 7 8 9 10 11 12" // Prints all on one line, space separator and newline at the end. Instead of providing several printer types (as Steven did), I have concentrated just one printer class decor_printer derived from his abstract printer. But I have added to it several constructor parameters to control the number of columns, the width of the columns, and string to prefix, separate, suffix and final terminator. // Construct a printer for 3 ragged columns, and comma as separator. decor_printer plain_printer(3, 0, "\n", ", ", "\n", "\n"); plain_printer.print(da, std::cout); which outputs: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 We can also apply this to std::vector (and all the other STL container types) and a more complex type like quantity<length, measurement<double> > (where there is a measurement value and estimate of its uncertainty (+/-). // Array of Boost.Units quantity with an uncertain type. quantity<length, measurement<double> > q[] = { measurement<double>(45210.0, 1234.0) * meters, measurement<double>(765.3, 2.5) * meters, measurement<double>(12.34, 12.5) * meters, measurement<double>(5.67, 2.5) * meters, measurement<double>(0.789, 2.7e-2) * meters, measurement<double>(7890, 2.5e-2) * meters, measurement<double>(5.78e-4, 2.5e-4) * meters, measurement<double>(765.3, 2.5) * meters, measurement<double>(0.0789, 2.7e-4) * meters, measurement<double>(7890, 2.5e-1) * meters, measurement<double>(5.78e-7, 2.5e-8) * meters, measurement<double>(76.3, 2.5) * meters, measurement<double>(53.8e6, 2.34e5) * meters }; To list this neatly we may need a column width of 25. decor_ printer fancy_printer(4, 25, "\n", ", ", "\n"); // 4 columns, 25 char wide fancy_printer.print(q, std::cout); which outputs: 45.21(+/-1.234) km, 765.3(+/-2.5) m, 12.34(+/-12.5) m, 5.67(+/-2.5) m, 789(+/-27) mm, 7.89(+/-2.5e-005) km, 578(+/-250) um, 765.3(+/-2.5) m, 78.9(+/-0.27) mm, 7.89(+/-0.00025) km, 578(+/-25) nm, 76.3(+/-2.5) m, 53.8(+/-0.234) Mm (Unless the email destroys the layout L ) Note the cool autoprefixing of quantities so the units change from m to km, mm, Mm as appropriate. Finally, the parameter to the printer is a *range*, so *part* of any container can nearly as easily be printed. Does anyone share my enthusiasm for this? Paul PS I have also re-ordered the abstract_printer parameters in the hope of providing std::cout as default, so one can write just line_printer.print(da); // "1 2 3 4 5 6" But so far I can't get it to find the charT and traits parameters, despite providing defaults. Two files attached (and need the sandbox version of type erase library. Can anyone more expert get this to work? --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

[config] NO_USER_DEFINED_LITERALS ?
by Matus Chochlik 24 Aug '12

24 Aug '12

Hello, does Boost.Config provide some macro for the detection of (un)availability of user-defined literals (N2765) ? I could not find any in the docs for 1.51.0 nor by grepping in the boost/config/* files. If not, would there be a big problem adding it (called for example BOOST_NO_USER_DEFINED_LITERALS), please ? Thanks in advance, Best regards, Matus

2 2

Equivalent of "bootstrap.sh --without-libraries" for Modularized and CMake-ified boost
by Julien Woillez 24 Aug '12

24 Aug '12

Dear boost(a)lists.boost.org, I'm trying to use CMake to build boost, using its Modularized and CMake-ified version at: https://github.com/ryppl/boost-zero I need to do the equivalent of --without-libraries=mpi with bootstrap.sh. Any idea if this is possible, and if so how to do it? Regards, -Julien

2 1

[type_erasure]bug:any(, binding<Concept>) can store wrong type
by Larry Evans 23 Aug '12

23 Aug '12

The attached runs OK without any compile or runtime errors. It seems to create a type_uns<1> from a type_uns<0> although there's no type_uns<1> CTOR for that. This sounds like another instance of the bug reported here: http://article.gmane.org/gmane.comp.lib.boost.devel/233101 Is it? -regards, Larry

2 6

[exception] is static only?
by Neal Becker 23 Aug '12

23 Aug '12

Is it necessary that exception builds only static libs? On many architectures, this would limit it's usefulness.

3 5

Boost 1.51.0 released!
by Marshall Clow 22 Aug '12

22 Aug '12

Release 1.51.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains 1 new library (Boost.Context, by Oliver Kowalke) and numerous enhancements and bug fixes for existing libraries. For details, including download links, see http://www.boost.org/users/news/version_1_51_0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.51.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Beman Dawes Daniel James Eric Niebler Marshall Clow Rene Rivera Vladimir Prus

8 18

[1.51] PDF documentation build available
by John Maddock 22 Aug '12

22 Aug '12

The PDF build of the docs for 1.51 is now available from: https://sourceforge.net/projects/boost/files/boost-docs/1.51.0/ John.

1 0

[type_erasure] Review report -- ACCEPTED
by Lorenzo Caminiti 21 Aug '12

21 Aug '12

Hello all, Steven Watanabe's library Boost.TypeErasure is ACCEPTED into Boost. SUMMARY The library was reviewed from July 18 to August 3, 2012. There were 11 votes to accept the library and 2 votes to accept the library under the condition of some modifications (at the end, these 2 votes were essentially considered as "no" because there was no agreement on implementing all the required modifications). It was noted how the library offers non-intrusive and powerful programming techniques that can be used in place of usual Object Oriented (pure) virtual function interfaces (and with support for some from of virtual "template" functions). The library can also be seen as a generalization of existing Boost libraries like Any, Function, and AnyIterator. The library is accepted "as is", however most reviewers suggested to: 1) Dramatically ease the learning curve of the documentation by providing a motivation section, step-by-step tutorial(s) to introduce the basic features of the library, advanced topics section(s) to introduced the additional features, an example section with non-trivial use cases for the library, and additional examples to the reference section. 2) Support down-casting. While these changes are not a condition for the library acceptance, it would be best if they were made part of the very first release of the library. A few reviewers found the name Type Erasure confusing, however others did not. Alternative name were: Staged Typing, Deferred Typing, Type Interface, Interface, Static Interface, Value Interface, Structural Typing, Duck Typing, and Run-Time Concepts. There was some discussion on the meaning of Type Erasure in Java and on its definition on wiki (these should probably be both referenced in the documentation). The current library name is considered acceptable and the final decision on the library name is left entirely up to Steven. DETAILS "Yes" reviews: [1] http://lists.boost.org/Archives/boost/2012/07/195288.php [2] http://lists.boost.org/Archives/boost/2012/07/195297.php [3] http://lists.boost.org/Archives/boost/2012/07/195299.php [4] http://lists.boost.org/Archives/boost/2012/07/195308.php [5] http://lists.boost.org/Archives/boost/2012/07/195323.php [6] http://www.mentby.com/hossein-haeri/boost-typeerasure-review-ends-today-jul… [7] http://lists.boost.org/Archives/boost/2012/07/195327.php [8] http://lists.boost.org/Archives/boost/2012/07/195329.php [9] http://lists.boost.org/Archives/boost/2012/07/195334.php [10] http://lists.boost.org/Archives/boost/2012/07/195364.php [11] http://lists.boost.org/Archives/boost/2012/08/195420.php "Conditional-yes" reviews (essentially considered as "no"): [12] http://lists.boost.org/Archives/boost/2012/08/195455.php [13] http://lists.boost.org/Archives/boost/2012/08/195561.php Notable comments and discussions (not reviews): (1) http://lists.boost.org/Archives/boost/2012/07/195162.php (2) http://lists.boost.org/Archives/boost/2012/07/195130.php (3) http://lists.boost.org/Archives/boost/2012/07/195149.php (4) http://lists.boost.org/Archives/boost/2012/07/195167.php (5) http://lists.boost.org/Archives/boost/2012/07/195199.php (6) http://lists.boost.org/Archives/boost/2012/07/195200.php (7) http://lists.boost.org/Archives/boost/2012/07/195232.php (8) http://lists.boost.org/Archives/boost/2012/07/195234.php (9) http://lists.boost.org/Archives/boost/2012/07/195408.php (10) http://permalink.gmane.org/gmane.comp.lib.boost.user/75081 (11) http://lists.boost.org/Archives/boost/2012/08/195590.php (12) http://lists.boost.org/Archives/boost/2012/08/195663.php (13) http://lists.boost.org/Archives/boost/2012/07/195342.php (14) http://lists.boost.org/Archives/boost/2012/08/195543.php Note that Steven might have already implemented some of the changes listed below. Features: * Support down-casting. See [1], [10], and (4). * Add macros for defining concepts. These macros could be added in later revisions (they just provide a different syntax, no additional functionality). ** From [10]: BOOST_CREATE_CONCEPT(container_concept, typename T, (void (push_back, T), void (size)) ) ** From Steven: BOOST_TYPE_ERASURE_MEMBERS((push_back)(size)...) template<class V, class T = _self> struct container_concept : mpl::vector< has_push_back<void(const V&), T>, has_size<std::size_t(), const T>, ...> {}; * Add empty() to check if any holds a value or not. See [3] and [11]. * Add a built-in concept for unary plus +x (just pick a name for it). See (11). Implementation: * Can assertion enforce that same bindings are required for the placeholders? See [13] and (3). * Add assertion to check that in functions with multiple arguments the underlining any types must match. See (7). * Add in-code comments to the implementation (at least to normalize.hpp). See [8] and [13]. * Can static assertions be used to improve error messages (see [8])? Concept mismatch spew errors with internal implementation details, see [10]. * Fix bugs: ** http://lists.boost.org/Archives/boost/2012/07/195367.php ** http://lists.boost.org/Archives/boost/2012/07/195396.php ** http://lists.boost.org/Archives/boost/2012/08/195662.php Documentation: * A few typos listed in [9]. * A draft on a proposed way to restructure the docs was offered in [8]. * Sean Parent's BoostCon 2012 "Value Semantics" could be used to write a motivation section. See [9]. * Offer a comparison with usual OO (pure) virtual function interfaces. See [1], [7], [8], and [9]. * Make sure all important elements document in the reference section are also documented in a tutorial section (e.g., how the any constructor binds placeholders, conversions, BOOST_TYPE_ERASURE_MEMBER, concept_of, etc). See (1), (4), (6), and [1]. * Clarify that references can be assigned but they cannot be rebound to a different object. See (2). * Clarify the rationale for using _a, _b, ... instead of _1, _2, ... as soon as _a, _b, ... are first used (most users miss the "named vs. positional parameter" rationale from the design decision section and _1, _2, ... are such common constructs that many users will naturally question the _a, _b, ... choice). See (5). * Add an example section with non-trivial use cases of the library. Consider to add the following examples: ** How to implement visitation, see (8). ** Model view controller, see [1]. ** Run-time expression system (adding Concept = void specialization), see [3]. ** Multi-function, see [4]. ** Printing, see (11) (note that Steven needed to answer too many questions for Paul to be able to program this, ideally the docs would have been clear enough for Paul to program this example without Steven's help). ** Reference related work Adobe::Poly, see (13). * Document all built-in concepts (possibly with a usage example for each) and indicate which ones can be specialized. See [5], and [9]. * Add an example at the bottom of each reference page. See [11]. * Document that any(any<Concpet2, T2>, binding<Concept>) allows to convert the vtable once and re-use it for all anys reducing run-time cost. See [12]. * Consider a number of docs improvements as suggested in [13]. * Document the undefined behaviour pointed out in (12). * Document limitations that some algorithms might encounter if they need to access references and provide rationale of why references cannot be handled differently (i.e., constructor flag and/or overhead of managing vtable in dispatcher layer). See [12], and (14). Many thanks to everyone that participated in the review!! I believe Boost users will find this library useful. The review manager, --Lorenzo On Sat, Aug 4, 2012 at 12:32 PM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: > Hello all, > > The review of Boost.TypeErasure ended on Aug 3, 2012. Stay tuned for > my decision on the library. > > Thank you very much to Steven, everyone that submitted a review, and > everyone that participated in the discussions. > > The review manager, > --Lorenzo > > On Fri, Aug 3, 2012 at 11:00 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: >> Hello all, >> >> *** The review of Boost.TypeErasure ends today Aug 3, 2012. If you are >> planning to submit a review, please do so by the end of today. *** >> >> Thank you to all that have participated to the review so far. >> >> The review manager, >> --Lorenzo >> >> On Jul 27, 2012 1:41 PM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> wrote: >>> >>> Hello all, >>> >>> After consulting the review wizards and Steven, I am extending >>> Boost.TypeErasure review of one week, until August 3, 2012. >>> >>> Thank you to all that have submitted a review already and I am looking >>> forward to receiving additional submissions. >>> >>> The review manager, >>> --Lorenzo >>> >>> On Jul 27, 2012 3:22 AM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> wrote: >>>> >>>> Hello all, >>>> >>>> On Mon, Jul 23, 2012 at 9:09 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> >>>> wrote: >>>> > On Wed, Jul 18, 2012 at 1:13 AM, Lorenzo Caminiti >>>> > <lorcaminiti(a)gmail.com> wrote: >>>> >> *** The review of Steven Watanabe's proposed Boost.TypeErasure library >>>> >> begins on July 18, 2012 and ends on July 27, 2012. *** >>>> > >>>> > *** Boost.TypeErasure review ends in 5 days. Please submit your reviews >>>> > :D *** >>>> >>>> *** Boost.TypeErasure review ends today July 27, 2012. If you are >>>> planning to submit a review, please do so as soon as possible. *** >>>> >>>> Thank you to everyone who has commented on the library and submitted a >>>> review so far! >>>> >>>> The review manager, >>>> --Lorenzo >>>> P.S. I am considering extending the review until end of day Sunday >>>> July 29, 2012... I will keep you posted. >>>> >>>> > There have been interesting discussions on the library on the ML but I >>>> > have not received any official review yet :( Especially if you are a >>>> > user of Boost Any, Function, and Any Iterator, you definitely want to >>>> > take a look at Type Erasure as it generalizes solutions provided by >>>> > those other libraries. >>>> > >>>> > Thank you. >>>> > >>>> > The review manager. >>>> > --Lorenzo >>>> > >>>> >> THE LIBRARY >>>> >> >>>> >> C++ provides runtime polymorphism through virtual functions. They are >>>> >> a very useful feature, but they do have some limitations. >>>> >> * They are intrusive. In generic programming, we can design an >>>> >> interface which allows third-party types to be adapted to it. >>>> >> * They require dynamic memory management. Of course, most of the >>>> >> problems can be avoided by using an appropriate smart pointer type. >>>> >> Even so, it still acts like a pointer rather than a value. >>>> >> * Virtual functions' ability to apply multiple independent concepts to >>>> >> a single object is limited. >>>> >> The Boost.TypeErasure library solves these problems allowing us to >>>> >> mirror static generic programming at runtime. >>>> >> >>>> >> Library source: >>>> >> http://svn.boost.org/svn/boost/sandbox/type_erasure/ >>>> >> >>>> >> Pre-built documentation: >>>> >> >>>> >> http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ >>>> >> >>>> >> You can also download archives with pre-built documentation from: >>>> >> http://sourceforge.net/projects/steven-watanabe.u/files/ >>>> >> >>>> >> YOUR REVIEW >>>> >> >>>> >> Please submit a review to the mailing-list by replying to this email >>>> >> ("[boost] [type_erasure] Review ..." should be in the subject). >>>> >> >>>> >> Please state clearly whether you think this library should be accepted >>>> >> as a Boost library. >>>> >> >>>> >> Other questions you may want to consider: >>>> >> 1. What is your evaluation of the design? >>>> >> 2. What is your evaluation of the implementation? >>>> >> 3. What is your evaluation of the documentation? >>>> >> 4. What is your evaluation of the potential usefulness of the library? >>>> >> 5. Did you try to use the library? With what compiler? Did you have >>>> >> any problems? >>>> >> 6. How much effort did you put into your evaluation? A glance? A >>>> >> quick reading? In-depth study? >>>> >> 7. Are you knowledgeable about the problem domain? >>>> >> >>>> >> Thanks in advance to all who participate in the review discussion -- >>>> >> I'm looking forward to it!

3 2

[fusion] move-enabled containers?
by Gabriel Redner 21 Aug '12

21 Aug '12

Hi folks, I have been starting to ease into C++11, and am currently looking to add move-awareness to some classes which have members of boost::fusion container types. However, it seems that fusion containers are not move-aware. For a minimal example, take the code below: ========== #include <boost/fusion/include/vector.hpp> #include <iostream> class noisy { public: noisy() { std::cout << "noisy()\n"; } noisy(const noisy&) { std::cout << "noisy(const noisy&)\n"; } noisy(noisy&&) { std::cout << "noisy(noisy&&)\n"; } }; int main() { typedef boost::fusion::vector<noisy, noisy> noisyVector; noisyVector n; std::cout << '\n'; noisyVector n2(n); std::cout << '\n'; noisyVector n3(std::move(n)); } ========== I was hoping that the output would be: ========== noisy() noisy() noisy(const noisy&) noisy(const noisy&) noisy(noisy&&) noisy(noisy&&) ========== But instead I get: ========== noisy() noisy() noisy(const noisy&) noisy(const noisy&) noisy(const noisy&) noisy(const noisy&) ========== It is a simple matter to add move-awareness to fusion containers, or is there some technical reason why it cannot been done? Or (perhaps more likely), am I misunderstanding something about the situation? Thanks, -Gabe

4 5

Some library dependency and auto liker issues
by Vicente J. Botet Escriba 20 Aug '12

20 Aug '12

Hi, there is an issue https://svn.boost.org/trac/boost/ticket/7045 that I don't know how to fix. The problem is related to library dependencies and auto-linker. * 1st issue: Boost.Threads depends on Boost.DateTime but only for the header only part. Anyway, it includes a DateTime file that includes the boost/config/auto_link.hpp, and this makes the tools using the auto linker to create a dependency on Boost.DateTime. As the Boost.Threads build Jamfile doesn't link with Boost.DateTime, the command bjam toolset=msvc-11.0 --build-type=complete --with-thread doesn't build the library Boost.DateTime and so when a tool such as Visual studio uses the auto linker information, it tries to link with Boost.DateTime and not finds it, as not build (even if it is not needed). What is the best way to fix this? Should Boost.Thread link with Boost.DateTime, even if it don't needs it? Or just document that the user relaying on auto-linker needs to build explicitly the boost_date_time library with the command: bjam toolset=msvc-11.0 --build-type=complete --with-thread --with-date_time * 2nd issue: Boost.Threads depends on Boost.Chrono and the library is linked with boost_chrono. When a user includes for example <boost/thread/tss.hpp> the autolinker doesn't detects the chrono dependency as this file don't depends on any file in boost/chrono. But as boost_thread depends on boost_chrono, the linker find some unresolved symbols. What is the best way to fix this? Should Boost.Thread include boost/chrono.hpp in all their public files even if not needed other than by auto linker tools? Or just document that the user relaying on auto-linker needs to include only the top level file <boost/thread.hpp> so that all the dependencies are covered? Any suggestions are welcome, Vicente

2 5

Re: [boost] [type_erasure] Review started (July 18-27, 2012)
by Steven Watanabe 20 Aug '12

20 Aug '12

AMDG On 08/02/2012 12:29 PM, Larry Evans wrote: > On 07/18/12 00:13, Lorenzo Caminiti wrote: >> Hello all, >> >> *** The review of Steven Watanabe's proposed Boost.TypeErasure library >> begins on July 18, 2012 and ends on July 27, 2012. *** > [snip] > Should type_erasure be accepted into Boost? > > Answer: > No, not yet. > Why(in order of importance): > > 1) any<C,T>::any(U&, static_binding<Map>&) bug > > The bug reported here: > http://article.gmane.org/gmane.comp.lib.boost.devel/233101 > should be resolved. > > The bug is just too dangerous for the resolution to be delayed. > I added a static assert. > <snip> > > My review: > > 1. What is your evaluation of the design? > > Good, except for: > > [need variadic static_binding ctor]: > > The any CTOR: > > template<class U, class Map> > any(U & arg, const static_binding< Map > & binding); > > documented here: > > > http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure… > > allows only a single argument to the constructor to the > underlying type. I'd suggest adding another CTOR with > interface: > > template<class Map, class... U> > explicit any(const static_binding< Map > & binding, U &&... arg); > > which is similar to: > > explicit any(const binding< Concept > & binding, U &&... arg); > > Then any constructor of the underlying could be used. > I think something like this is reasonable. I have to consider whether this is best approach, though. I don't consider this high priority, however, since the copy constructor should work most of the time. The STL got by just fine for years without emplace. > [too many any ctors]: > > According to `grep -e ' any('`, there are more than 45 any > constructors. That many makes it hard for the novice to know > which one to use. The Design notes: > The solution is simple. Don't use the source. Use the documentation page for any, which only shows 9 distinct constructors. > > http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure… > > are some help, but those notes also mention ambiguities and > user rules, which sound like indications of usability problems > to me. > > Why wouldn't the following ctors be sufficent to do all the > current any constructors do (except for maybe requiring more > typing and maybe more constructor calls)? > > template > < class... U > > > any > ( static_binding<Map>const& > , U&&... > );//kind=binding constructor > > template > < class... U > > > any > ( binding<Concept>const& > , U&&... > );//kind=dispatching constructor > > template > < class Concept2 > , class Tag2 > > > any > ( any<Concept2,Tag2>U&& > , static_binding<Map>const& > );//kind=converting constructor > > template > < class Concept2 > , class Tag2 > > > any > ( any<Concept2,Tag2>U&& u > , binding<Concept2>const&b=binding_of(u) > );//kind=converting constructor > > Providing just these 4 constructors would improve the usabilty. Why? > Of course, I'm probably missing something, and if so, > explaining why the above would not work in the Design notes > would be helpful. > I think it should be obvious what's missing: a) any(const any&); The copy constructor is not a template. b) template<class U> any(const U&); This is the most commonly used constructor besides the copy constructor. It would be very inconvenient if it didn't exist. c) any(); The default constructor creates an empty any. d) A default argument can't refer to a prior argument. Your fourth constructor has to be two separate constructors. > 2. What is your evaluation of the implementation? > > [in-source comments]: > Very few in-source comments, as for example, the in the code: > > > http://steven_watanabe.users.sourceforge.net/type_erasure/boost/type_erasur… > > there are no in-source comments. This lack of in-source comments > made it very hard to understand the implementation. There is also > no tests in the directory: > > > > http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure… > > which contain any string with 'normalize' in it; hence, I assume > there are no unit tests for any class or function with normalize > as part of its name. Such unit tests, hopefully, would have > provided more information of the purpose of the code in > */detail/normalize.hpp; hence, I'd recommend providing such tests > in addition to more in-source comments. > The tests only cover the public interface. I'm not going to add specific tests of the implementation details. > > 3. What is your evaluation of the documentation? > > Mostly good, but some documentation needs improvement. > For example: > > [vague:rebinding_any.html]: > > This doc: > > > http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure… > > Claims rebind_any<Any,T>::type: > > returns any type corresponding to a placeholder. > > However, it doesn't say what the Any in rebind_any<Any,T> may be, > and if one assumes Any is a type_erasure::any<C,S> for some > concept, C, and placeholder, S, then that description makes no > sense because C does not contain any information about which > actual type is matched to which placeholder. Huh? As the documentation you quoted says, rebind_any returns a specialization of /any/. rebind_any<any<C, S>, T>::type is any<C, T>. > <snip> > > from Steven, in the reply: > > http://article.gmane.org/gmane.comp.lib.boost.devel/233067 > > did I finally conclude: > > The placeholders in concepts do *not* stand for the bound types > but instead for the any's containing those bound types. > That depends on the context. boost::type_erasure::call "unwraps" these any's. > Which is similar to the conclusion which I posted here: > > http://article.gmane.org/gmane.comp.lib.boost.devel/233078 > > Since the 233078 post got no replies, I assume that conclusion is > right. If so, then that should be made clear in the > documentation (including tutorials). In addition, the following > example code (and especially the comments), should reduce future > confusion on this topic: > > /* {***any_ctor_kinds.cpp*** */ > <snip> > I find this code almost completely unreadable. > If that conclusion is wrong, then the docs need to be modified > (I've no idea how) to clearly define "matching" as used in the > any.html#id2445089-bb reference. > > [incomplete:tuple.html]: > > The doc: > > > http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure… > > makes no mention of how the binding produced by this call are > generated. > Already fixed. In Christ, Steven Watanabe

10 24

[multiprecision] Some rvalue reference experiments (performance inhancements #1)
by John Maddock 20 Aug '12

20 Aug '12

Folks, I've started to work through some of the points that came up in the multiprecision review, starting with further rvalue reference support. The idea (due to Marc Glisse) was to add operator overloads that look something like: Number&& operator+(Number&&a, const Number& b) { return static_cast<Number&&>(a += b); } Using my Polynomial Horner evaluation scheme as an example the number of temporaries dropped as follows: Type # temporaries No expression templates, no rvalue refs 24 No expression templates, rvalue refs 1 Expression template 0 Which is pretty impressive, but not necessarily typical usage, so by way of "real world" tests, I compared the times taken to evaluate Boost.Math's Bessel function test cases to 50 decimal places: Library Time/s # Allocations MPFR/mpreal (no ET's or rvalue refs) 9.4 13226029 MPFR/mpfr_class (ET's) 6.3 3948316 MPFR/mp_number(ET's) 6.0 2683646 GMP/mp_number(no ET's) 5.2 4186977 GMP/mp_number(ET's) 5.0 2594441 As you can see the number of allocations required when using mp_number with ET's turned off is almost double that without, I guess this is because many statements are similar to: a = b op c; Where a temporary is still required when relying on rvalue refs, but not for expression templates. Having said that the times are getting much closer now.... John.

8 25

Is there any interest in getting pseudo random number generation using preprocessor at compile time into the Preprocessor library?
by Alexander Stoyan 20 Aug '12

20 Aug '12

The complete code, approach and efficiency proofs I described in my blog: http://alexander-stoyan.blogspot.com/2012/07/getting-pseudo-random-numbers-a t.html Need your opinion regarding the relevance and the approach correctness of the feature. Thank you in advance.

4 7

[1.51.0] release candidates available
by Marshall Clow 19 Aug '12

19 Aug '12

Release candidate files for 1.51.0 are available at http://boost.cowic.de/rc/ At this point, the release branch is closed for changes without explicit permission from the release managers. As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: 6a1f32d902203ac70fbec78af95b3cf8 *boost_1_51_0_rc1.tar.gz 4b6bd483b692fd138aef84ed2c8eb679 *boost_1_51_0_rc1.tar.bz2 ee8112e48088b05c248d68329cd5d908 *boost_1_51_0_rc1.zip e87d3747966ab7e0c9487884326d7d17 *boost_1_51_0_rc1.7z Thanks, --The release managers

5 6

Modularized Boost: How the files in libs/libXX must be included?
by Vicente J. Botet Escriba 19 Aug '12

19 Aug '12

Hi, the following ticket https://svn.boost.org/trac/boost/ticket/7200 report an issue while building Boost.Thread using the modularized cmake. What is the correct way to include the files in lib/libXXX? Best, Vicente

2 1

[type_traits][parameter] Inconsistent boost::is_convertible between gcc and clang
by John Bytheway 19 Aug '12

19 Aug '12

I have been tracking down an issue with some of my code which compiles fine with gcc but not clang. It manifested as a failure in Boost.Parameter but I eventually pinned it down to an inconsistency in the behaviour of boost::is_convertible. The following program demonstrates the issue: ============== #include <boost/type_traits/is_convertible.hpp> #include <boost/static_assert.hpp> class A {}; int main() { BOOST_STATIC_ASSERT((boost::is_convertible<A, A&>::value)); } ============== This compiles fine under g++ (4.7.1), but the assertion fires under clang++ (r160940). This is not too surprising because is_convertible is implemented in completely different ways on the two compilers: - on clang it is in terms of the __is_convertible intrinsic, which behaves like std::is_convertible and fails because rvalue references don't convert to lvalue references. - on gcc it has a complex custom implementation which at some point performs add_reference<> on the first argument and thus determines that the conversion is OK. Reading the docs for boost::is_convertible I think the clang interpretation is closer to the intention, in which case the gcc implementation is wrong, and so is Boost.Parameter (which relies on this behaviour). On the other hand, I suspect there's probably other code out there that depends on this in a similar way to Boost.Parameter, so perhaps it would be safer to tweak the clang implementation instead, and deviate from std::is_convertible. Any thoughts? John Bytheway

5 13

[odeint] Iterator semantics
by Karsten Ahnert 19 Aug '12

19 Aug '12

Hi, we have posted a review request for odeint (a library for solving ordinary differential equations) on this list some days ago. An ODE is dx/dt = f(x(t)) and one is looking for the solution x(t) which is a function of t. Solving ODEs is usually an iterative task, so one starts with x(0) and iteratively applies a solver to obtain a discretized (and approximated) representation of the solution: x(0) -> x(dt) -> x(2*dt) -> x(3*dt) -> ... I played around with an iterator which is doing exactly this iterative procedure. For example, it can be used via odeint::runge_kutta4< state_type > stepper; // ode solver std::array< double , 3 > x = {{ 10.0 , 10.0 , 10.0 }}; // initial state double res = std::accumulate( // parameters : solver , ode , state , time , time_step make_const_step_iterator_begin(stepper, lorenz(), x, 0.0, 0.01) , make_const_step_iterator_end( stepper, lorenz(), x, 1.0, 0.01) , 0.0 , []( double sum, const state_type &x) { return sum + x[0]; } ); The first iterator increments the time until the time of the second iterator is rearched t=0.0 -> t=0.01 -> t=0.02 -> .. t=1.0 and the first component of the solution is accumulated. In principle, this approach works quite well, but there are some problems at least semantically. Maybe someone here has some comments or ideas on this: The defintion of this iterator is: template< class Stepper , class System , class StepperTag > class const_step_iterator : public boost::iterator_facade < const_step_iterator< Stepper , System , StepperTag > , typename Stepper::state_type const , boost::single_pass_traversal_tag > { ... }; It is a single pass iterator, so it can only check for equality of two iterators. This is problematic since equality here means that the time (t) of the begin iterator is smaller then the time of the end iterator. To ensure commutativity of the != or == operation I needed to flag the begin and end iterator explicitly. This is the reason for the two factory functions make_const_step_iterator_begin and make_const_step_iterator_end, which are doing this flagging. The second semantically problem is that the end iterator in principle does not need to know the stepper as well as the system (lorenz() in the above example). But all algorithms from the standard library and Boost.Range assume that the begin and end iterator are of same type. Therefore you have to put the stepper and the system into the end iterator too. Of course, there are techniques like type erasure which might solve this problem, but they introduce some run-time overhead which we want to avoid here. Any ideas or comments about this? P.S. The code can be found in the iterator branch in odeint: boost/numeric/odeint/iterator/const_step_iterator.hpp and some examples libs/numeric/odeint/examples/const_step_iterator.cpp git clone -b iterator git@github.com:headmyshoulder/odeint-v2.git

5 19

Request for a typedef for the larger integer type that supports atomic loads and stores.
by Vicente J. Botet Escriba 18 Aug '12

18 Aug '12

Hi, I'm locking for a portable integer type that is the larger integer type that supports atomic loads and stores. The sig_atomic_t type defined in <csignal> supports atomic loads and stores but I'm not sure is the larger one. Does boost define such a typedef? If not, could such typedef be included in boost and where? Best, Vicente

2 1

What to do with platform defining 'null' as preprocessor symbol?
by Jan Hudec 17 Aug '12

17 Aug '12

Hello Folks, At work we develop, among others, for Bada. The system library provided is unfortunately somewhat flaky. A tell-tale sign is, that it's native API headers define lowercase 'null' as preprocessor symbol expanding to 0. Unfortunately boost uses identifier 'null'. So far we only hit the two cases in boost/test/utils/basic_cstring/basic_cstring.hpp, where I fixed it by renaming the symbols in our local copy of that header, but I noticed there are many more instances in other modules. Would it make sense to rename those identifiers and avoid that name like boost avoids 'min' and 'max'? Or perhaps I could try simply undefining it in config/platform somewhere and see whether Bada headers would break? Unfortunately I don't think gcc has ability to redefine macros temporarily to reinstate the original definition at the end of boost. Generally speaking, Bada provides it's own native API, which is different from anything else. It's object-oriented and looks nice at first sight, but sometimes is inflexible in surprising places. It looks like they wrote whatever they needed to implement applications that ship with the phones and stopped there. The platform also provides ANSI C library and some parts of POSIX, but many functions don't really work. Fortunately the platform is going to be merged with Titzen, so it should at least get working POSIX kernel (Linux) and standard libraries. That makes supporting this obscure platform even less worth big trouble. -- Jan 'Bulb' Hudec <bulb(a)ucw.cz>

1 0

[general] Endianity detection for ARM
by Jan Hudec 17 Aug '12

17 Aug '12

Hello All, Something in Boost.Test started using detail/endian.hpp internally between 1.43 and 1.50. Since at work I build Boost.Test-based tests for several mobile platforms, all of which use ARM, I needed to fix it. It is easy for all platforms built with either gcc or clang (Android, iOS and Bada). Gcc defines __ARMEB__ for big-endian ARM and __ARMEL__ for little-endian ARM. Windows CE is however another issue. Microsoft usually defines rather characteristic _M_<arch> macros, but _M_ARM is *not* defined in Windows CE, though it appears to be defined for Windows 8 ARM (I don't work with those yet). The WinCE projects define ARM and _ARM_, but those may appear on big-endian ARM platforms too. However since there are no big-endian Win32 platforms and they are unlikely to be created, I suggest just hardcoding little endian for anything that defines _WIN32 (the _M_* macros could then possibly be removed, but they don't cause any problems there). I therefore propose this patch: --- a/boost/detail/endian.hpp +++ b/boost/detail/endian.hpp @@ -57,7 +57,7 @@ || defined(_POWER) || defined(__powerpc__) \ || defined(__ppc__) || defined(__hpux) || defined(__hppa) \ || defined(_MIPSEB) || defined(_POWER) \ - || defined(__s390__) + || defined(__s390__) || defined(__ARMEB__) # define BOOST_BIG_ENDIAN # define BOOST_BYTE_ORDER 4321 #elif defined(__i386__) || defined(__alpha__) \ @@ -66,7 +66,9 @@ || defined(_M_ALPHA) || defined(__amd64) \ || defined(__amd64__) || defined(_M_AMD64) \ || defined(__x86_64) || defined(__x86_64__) \ - || defined(_M_X64) || defined(__bfin__) + || defined(_M_X64) || defined(__bfin__) \ + || defined(__ARMEL__) \ + || defined(_WIN32) // ARM Windows CE don't define __ARMEL__ nor _M_ARM, but there are no big-endian Windows versions # define BOOST_LITTLE_ENDIAN # define BOOST_BYTE_ORDER 1234 -- Jan 'Bulb' Hudec <bulb(a)ucw.cz>

1 0

Boost.Units does not honor setw width?
by Paul A. Bristow 17 Aug '12

17 Aug '12

> -----Original Message----- > From: Paul A. Bristow [mailto:pbristow@hetp.u-net.com] > Sent: Thursday, August 09, 2012 4:44 PM > To: 'boost(a)lists.boost.org' > Subject: RE: [boost] [type_erasure] Review started (July 18-27, 2012) Flushed with success using Steven Watanabe's type_erase for printing columns, I have enjoyed extending it to use a fixed column width. But I have stumbled on a feature of Boost.Units output where Boost.Units does not honor the iostream width fully. This can be seen in this minimal example: std::cout << std::setw(20) << 'm' << std::endl; outputs 19 spaces and 'm', total 20 as expected. quantity<length> ql = 2345.6 * meters; std::cout << std::setw(20) << ql << std::endl; outputs 2345.6 m but the m does not line up with the previous 'm'. There are 14 leading spaces and 5 digits, 1 period and a space and letter m for the unit, a total of 22. The reason is that the first item value() is output using the ios width setting, but the second unit() 'm' (and separating space) is not, as in this line in io.hpp . os << q.value() << ' ' << Unit() I have 'cured' this 'bug' (I suspect it is a feature really) thus in boost/units/io.hpp template<class Char, class Traits, class Unit, class T> inline std::basic_ostream<Char, Traits>& operator<<(std::basic_ostream<Char, Traits>& os, const quantity<Unit, T>& q) { if (units::get_autoprefix(os) == autoprefix_none) { std::streamsize w = os.width(); if (w > 0) { // Need to build a single string with the width specified // (or outputting severally would not honour the width). std::ostringstream oss; oss << q.value() << ' ' << Unit(); os << oss.str(); } else { // No os.width set (so save the time needed to construct an ostringstream?) os << q.value() << ' ' << Unit(); } } This works for no_prefix, giving the expected number of leading spaces. But not for autoprefix - when a similar trick looks to get much more complicated (and when I start to get that 'angels fear to tread' feeling ;-) Of course the jaggedness of the layout becomes clearer both as the units get longer and get auto-prefixes (eg engineering). And there is a similar problem using a User defined Type like the measurement.hpp example in std::ostream& operator<< os << val.value() << "(+/-" << val.uncertainty() << ")"; where the second item is additional to the width, not included in it. 1 But I am not sure if this is wise. Is this a 'feature'? 2 Is this the best way of solving it? 3 Can/how should this be applied to autoprefix? 4 Should submit a ticket for this? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

Review Wizard Status Report for August 2012
by Ronald Garcia 16 Aug '12

16 Aug '12

============================================== Review Wizard Status Report for August 2012 ============================================== News ==== 1. Multiprecision Arithmetic Reviewed 2. Type Erasure Reviewed 3. Boost 1.50.0 Released. New Libraries: 1) Algorithm 2) Functional/OverloadedFunction 3) LocalFunction 4) Utility/IdentityType Open Issues =========== The following libraries have been reviewed and await reports from their review managers: * Predef - reviewed February 2012; review manager: Joel Falcou. * Multiprecision - reviewed June 2012; review manager: Jeffrey Hellrung The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Constrained Value - accepted September 2010; author: Robert Kawulak. * GIL.IO - accepted January 2011; author: Christian Henning. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Atomic - accepted July 2011; author Helge Bahmann. * Type Traits Introspection - accepted August 2011; author: Edward Diener. * Lockfree - accepted August 2011; author: Tim Blechmann. * Context - accepted January 2012; author: Oliver Kowalke. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Endian - accepted provisionally November 2011; author: Beman Dawes. * Log - accepted provisionally March 2010; author: Andrey Semashev. General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot cmu dot edu" and "phillips at pacific dot mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Pimpl (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Variadic Macro Data (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Polygon: Voronoi Extensions * Coroutine * Range Extensions * Contract * Nowide (M) * ODEint * Array (M) * TypeIndex (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: https://github.com/boost-vault/Miscellaneous/blob/master/Pimpl.zip :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: This library adds support and functionality for variadic macros to Boost as well as integrating variadic macros with the Boost PP library without changing the latter library in any way. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. 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) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Polygon: Voronoi Extensions --------------------------- :Author: Andril Sydorchuk :Review Manager: Lucanus Simonson :Download: http://svn.boost.org/svn/boost/sandbox/gtl/ :Description: This library extends Boost.Polygon with the following features: - Robust and efficient implementation of the sweepline algorithm that allows to construct Voronoi diagram, Delaunay triangulation and medial axis of a set of points and line segments. - Coordinates of the output geometries are computed within the 64 machine epsilon relative error (6 mantissa bits). - Voronoi diagram data structure that allows efficient traversal and data association with the output Voronoi graph. - No 3rd party dependencies (e.g. GMP, MPFR), all the required multiple precision types are implemented as part of the library. - The input and output coordinate type domains are configurable via coordinate type traits, thus allowing to compute coordinates of the Voronoi vertices within any required precision. - The full construction of the Voronoi diagram of 100 000 points takes only 0.27 seconds (see benchmarks). Coroutine --------- :Author: Oliver Kowalke :Review Manager: Hartmut Kaiser :Download: http://gitorious.org/boost-dev/boost-dev/archive-tarball/coroutine :Description: This library is an implementation of coroutines and generators using Boost.Context. Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Contract -------- :Author: Lorenzo Caminiti :Review Manager: Dave Abrahams :Download: http://sourceforge.net/projects/contractpp/files/latest/download :Description: This library implements Contract Programming for the C++ programming language (see the end of this email). In addition, the library implements virtual specifiers (final, override, and new, see C++11), concept checking, and named parameters. This library is implemented for the C++03 standard and it does not require C++11. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. ODEint ------ :Author: Karsten Ahnert and Mario Mulansky :Review Manager: Steven Watanabe :Download: https://github.com/headmyshoulder/odeint-v2 :Description: odeint provides routines for numerically solving Ordinary Differential Equations, a task heavily required when approaching scientific problems numerically. In odeint we have implemented the most common algorithms in a modern, generic way which provides several advantages over existing implementations. The main focus of odeint is to separate algorithms from the underlying basic computation unit. This allows for example to easily use the power of modern GPUs via CUDA or OpenCL to speed up computational heavy simulations. Array ----- :Author: Brian Smith :Review Manager: Needed :Download: https://github.com/BrianJSmith/Array :Description: The array class is a C++11 compatible implementation of static multidimensional arrays. TypeIndex --------- :Author: Antony Polukhin :Review Manager: Needed :Download: https://github.com/apolukhin/type_index :Description: TypeIndex is an extended C++11 type_index library, that * works with disabled RTTI * can store const-volatile-reference info about types (if user requested it) * has all the functionality of std::type_index * has portable across compilers and platforms functionality for getting demangled type names * works across modules/shared libraries * does not require C++11 to work Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

2 2

dramatically improved template error messages (was: C++11 decltype/SFINAE puzzler)
by Eric Niebler 16 Aug '12

16 Aug '12

(Andrew, a specific question for you below...) (Moderators: can you see why this msg from Andrew never reached the list (which he cc'ed))? On 8/14/2012 8:39 AM, Andrew Sutton wrote: >> GCC-4.7 gives a similarly terse error message. This, I think, is what >> I've been looking for. > > That's neat. Bravo! I've refined this idea. It now avoids cascading errors by detecting when a sfinae_error is passed as an argument to another function. (For the Haskell-ers out there, that makes it like the Either monad.) You can also get the full backtrace by uncommenting one line of code. IMO, this is now approaching something of real value. My personal experience using this with Proto-11 is that it dramatically improves error messages. I can also easily imagine how this can be used to implement a very nice concept-checking library for C++11 that approximates auto-concepts. Andrew, any thoughts on this? You've done far more work in this space than I have. I'd also like to know *why* this works, and indeed if it's guaranteed to. In particular, is it guaranteed that the virtual what() member of the sfinae_error class is instantiated at the outermost call site and not elsewhere (thereby eliminating the deep template back-trace)? I really just stumbled on this technique by accident, and I don't know how thin the ice is here. Both clang-trunk and gcc-4.7 think it's ok. (I'd also like to apologize to Paul Fultz for spelling his name wrong in an earlier message.) -- Eric Niebler BoostPro Computing http://www.boostpro.com

3 8

boost::asio and resolve_async
by david.hagood＠gmail.com 16 Aug '12

16 Aug '12

I was looking at needing to do a large number of reverse DNS lookups for a log analysis program I am writing, and wanted to use some form of async lookup to speed the program up (vs. doing each look up in series, at a couple of seconds per lookup). boost::asio and the async_resolve functions looked to be just what I wanted, BUT: I can find no good examples of a simple lookup. By "simple" I mean "given an address, give me the host name(s) associated with that address". All the examples were for a lookup by host name/transport type/port, e.g. host name/tcp/80. In my case I neither need a port # nor even have one - I just want the RDNS for the address. It seems to me the documentation in the boost::asio is a bit light on the various types for resolver queries, endpoint types, and such - and seems to be more focused on TCP and UDP than generic IP. Are there any better examples out there of RDNS using boost::asio?

2 1

[Interest] Value Dispatch
by *smgreened＠obbligato.org 16 Aug '12

16 Aug '12

Hi all, This might be old hat to verteran boosters but I found it nifty. Maybe it could make a small addition to Boost. Inspired by Sean Parent's C++Now! talk and the various articles on cpp-next, I've been playing around with value semantics and C++11. I found an interesting use of pack expansion at stackoverflow and expanded on it in a local project to convert from a traditional inheritance/virtual function model to a more value-centered approach. It turns out that with pack expansion one can implement "virtual functions" without needing inheritance or pointer/reference semantics. One can consider a vrtual function as "just" a compiler-generated switch statement. With that in mind, here's an example: ----------- #include <iostream> /// This is a collection of node kinds. We use it to categorize /// various kinds of objects and dispatch to the correct routine. template<typename T, typename T::kind ...I> class kind_tuple {}; /// This is the "virtual function" dispatch mechanism. It /// statically generates a lookup table of routines, one for each /// kind. template<typename R, typename D, typename T> class dispatcher {}; /// This is the actual dispatch implementation. template<typename R, typename D, typename O, typename O::kind ...I> class dispatcher<R, D, kind_tuple<O, I...>> { private: // Call the "virtual function override" via the provided class-level // dispatcher. template<typename P, typename O::kind K, typename ...Args> static R dispatch_handler(P payload, Args ...args) { return D::template dispatch<K>(payload, args...); } public: // dispatcher is an object that knows which routine in N to call. template<typename P, typename ...Args> static R dispatch(P payload, typename O::kind kind, Args ...args) { using F = R(P, Args...); F *table[] = { dispatch_handler<P, I, Args...> ... }; return table[kind](payload, args...); } }; class vehicle { public: enum kind { Car, Bus, Boat, Train, Airplane }; typedef kind_tuple<vehicle, kind::Car, kind::Bus, kind::Boat, kind::Train, kind::Airplane> kinds; private: class drive_dispatcher { public: template<kind K> static void dispatch(vehicle v) { v.drive_impl<K>(); } }; class turn_dispatcher { public: template<kind K> static bool dispatch(vehicle v, std::string direction) { return v.turn_impl<K>(direction); } }; template<kind K> void drive_impl(void) {} template<kind K> bool turn_impl(std::string direction) { return false; } kind the_kind; public: vehicle(kind k) : the_kind(k) {} void drive(void) { dispatcher<void, drive_dispatcher, kinds>::dispatch(*this, this->the_kind); } // Return whether the turn was successfully completed. bool turn(std::string direction) { return dispatcher<bool, turn_dispatcher, kinds>:: dispatch(*this, this->the_kind, direction); } }; template<> void vehicle::drive_impl<vehicle::Car>(void) { std::cout << "Driving a car!\n"; } template<> void vehicle::drive_impl<vehicle::Bus>(void) { std::cout << "Driving a bus!\n"; } template<> void vehicle::drive_impl<vehicle::Boat>(void) { std::cout << "Driving a boat!\n"; } template<> void vehicle::drive_impl<vehicle::Train>(void) { std::cout << "Driving a train!\n"; } template<> void vehicle::drive_impl<vehicle::Airplane>(void) { std::cout << "Flying an airplane!\n"; } template<> bool vehicle::turn_impl<vehicle::Car>(std::string direction) { std::cout << "Turning a car " << direction << "!\n"; return true; } template<> bool vehicle::turn_impl<vehicle::Bus>(std::string direction) { std::cout << "Turning a bus " << direction << "!\n"; return true; } template<> bool vehicle::turn_impl<vehicle::Boat>(std::string direction) { std::cout << "Turning a boat " << direction << "!\n"; return true; } template<> bool vehicle::turn_impl<vehicle::Train>(std::string direction) { std::cout << "Turning a train " << direction << "?!?\n"; return false; } template<> bool vehicle::turn_impl<vehicle::Airplane>(std::string direction) { std::cout << "Turning an airplane " << direction << "!\n"; return true; } template<typename Iterator> void drive(Iterator start, Iterator end) { for (auto i = start; i != end; ++i) i->drive(); } template<typename Iterator> void turn(Iterator start, Iterator end, std::string direction) { for (auto i = start; i != end; ++i) if (i->turn(direction)) { std::cout << "Successfully turned " << direction << "\n"; } else { std::cout << "Could not turn " << direction << "\n"; } } int main(void) { vehicle rides[] = { vehicle(vehicle::kind::Car), vehicle(vehicle::kind::Bus), vehicle(vehicle::kind::Boat), vehicle(vehicle::kind::Train), vehicle(vehicle::kind::Airplane) }; drive(rides, rides + 5); std::cout << "\n"; turn(rides, rides + 5, "left"); return 0; } ----------- The central idea is the creating of a "virtual function table" via pack expansion. Not only can we keep value semantics and avoid coupling via inheritance, we also get virtual function-like behavior for template functions. Expanding the idea allows us to implement a completely generic GoF visitor without using inheritance at all: ----------- #include <iostream> #include <tuple> /// This is a collection of node kinds. We use it to categorize /// various kinds of objects and dispatch to the correct routine. template<typename T, typename T::kind ...I> class kind_tuple {}; /// This is the "virtual function" dispatch mechanism. It /// statically generates a lookup table of routines, one for each /// kind. template<typename R, typename D, typename T> class dispatcher {}; /// This is the actual dispatch implementation. template<typename R, typename D, typename O, typename O::kind ...I> class dispatcher<R, D, kind_tuple<O, I...>> { private: // Call the "virtual function override" via the provided class-level // dispatcher. template<typename P, typename O::kind K, typename ...Args> static R dispatch_handler(P payload, Args ...args) { return D::template dispatch<K>(payload, args...); } public: // dispatcher is an object that knows which routine in N to call. template<typename P, typename ...Args> static R dispatch(P payload, typename O::kind kind, Args ...args) { using F = R(P, Args...); F *table[] = { dispatch_handler<P, I, Args...> ... }; return table[kind](payload, args...); } }; class vehicle { public: enum kind { Car, Bus, Boat, Train, Airplane }; typedef kind_tuple<vehicle, kind::Car, kind::Bus, kind::Boat, kind::Train, kind::Airplane> kinds; private: kind the_kind; public: vehicle(kind k) : the_kind(k) {} kind get_kind(void) const { return the_kind; } }; // U is to distinguish among different kinds of visitors for the same // object type. template<typename O, typename U, typename R, typename ...Args> class visitor { private: typedef visitor<O, U, R, Args...> This; // This dispatcher expects a single object so wrap the visitor and // the visited object together. typedef std::tuple<This *, O> payload; class visit_dispatcher { public: template<typename O::kind K> static R dispatch(payload object, Args ...args) { return std::get<0>(object)-> template visit_impl<K>(std::get<1>(object), args...); } }; template<typename O::kind K> R visit_impl(O object, Args ...args) {} public: R visit(O object, Args ...args) { return dispatcher<R, visit_dispatcher, typename O::kinds>:: dispatch(std::make_tuple(this, object), object.get_kind(), args...); } }; // Visitor types class Driving {}; class Turning {}; template<> template<> void visitor<vehicle, Driving, void>::visit_impl<vehicle::Car>(vehicle v) { std::cout << "Driving a car!\n"; } template<> template<> void visitor<vehicle, Driving, void>::visit_impl<vehicle::Bus>(vehicle v) { std::cout << "Driving a bus!\n"; } template<> template<> void visitor<vehicle, Driving, void>::visit_impl<vehicle::Boat>(vehicle v) { std::cout << "Driving a boat!\n"; } template<> template<> void visitor<vehicle, Driving, void>::visit_impl<vehicle::Train>(vehicle v) { std::cout << "Driving a train!\n"; } template<> template<> void visitor<vehicle, Driving, void>::visit_impl<vehicle::Airplane>(vehicle v) { std::cout << "Flying an airplane!\n"; } template<> template<> bool visitor<vehicle, Turning, bool, std::string>:: visit_impl<vehicle::Car>(vehicle v, std::string direction) { std::cout << "Turning a car " << direction << "!\n"; return true; } template<> template<> bool visitor<vehicle, Turning, bool, std::string>:: visit_impl<vehicle::Bus>(vehicle v, std::string direction) { std::cout << "Turning a bus " << direction << "!\n"; return true; } template<> template<> bool visitor<vehicle, Turning, bool, std::string>:: visit_impl<vehicle::Boat>(vehicle v, std::string direction) { std::cout << "Turning a boat " << direction << "!\n"; return true; } template<> template<> bool visitor<vehicle, Turning, bool, std::string>:: visit_impl<vehicle::Train>(vehicle v, std::string direction) { std::cout << "Turning a train " << direction << "?!?\n"; return false; } template<> template<> bool visitor<vehicle, Turning, bool, std::string>:: visit_impl<vehicle::Airplane>(vehicle v, std::string direction) { std::cout << "Turning an airplane " << direction << "!\n"; return true; } template<typename Iterator> void drive(Iterator start, Iterator end) { visitor<vehicle, Driving, void> driver; for (auto i = start; i != end; ++i) driver.visit(*i); } template<typename Iterator> void turn(Iterator start, Iterator end, std::string direction) { visitor<vehicle, Turning, bool, std::string> turer; for (auto i = start; i != end; ++i) if (turer.visit(*i, direction)) { std::cout << "Successfully turned " << direction << "\n"; } else { std::cout << "Could not turn " << direction << "\n"; } } int main(void) { vehicle rides[] = { vehicle(vehicle::kind::Car), vehicle(vehicle::kind::Bus), vehicle(vehicle::kind::Boat), vehicle(vehicle::kind::Train), vehicle(vehicle::kind::Airplane) }; drive(rides, rides + 5); std::cout << "\n"; turn(rides, rides + 5, "left"); return 0; } ----------- Not only is inheritance not required, we only need single dispatch to implement the visitor. Because we don't use inheritance at all for these "virtual functions" and the above visitor we can maintain value semantics throughout any code that uses the above techniques. Of course the code above can be cleaned up and beautified. It's just a quick proof-of-concept. I'm sure someone has already posted about this technique somewhere. Is there any interest in expanding it into a Boost library? -Dave

4 6

[1.51, heap] permission to merge r80039
by Tim Blechmann 16 Aug '12

16 Aug '12

request for release manager: i'd like to merge r80039 to release, as it fixes bug #7233. ok or too late? thanks, tim

4 6

[1.51][hash] Permission to merge.
by Daniel James 15 Aug '12

15 Aug '12

Hello release managers, Please can I merge changeset 80038: https://svn.boost.org/trac/boost/changeset/80038/ The tests have cycled for most major compilers and libraries. I think the only missing one is Visual Age C++ which isn't affected since it doesn't have support for C++11 headers. This fixes a bug when compiled with Intel on windows. thanks, Daniel

3 3

[interprocess, 1.51] basic_managed_shared_memory::flush removed?
by Tim Blechmann 15 Aug '12

15 Aug '12

testing 1.51 beta, i figured out, that basic_managed_shared_memory::flush has been removed. this currently breaks compilation of some of my code. wouldn't it be cleaner to deprecate it for some time and maybe post a warning? also a comment in the release notes, how to port code to 1.51 would be very nice. thanks, tim

2 2

[date_time] warning removal
by Vicente J. Botet Escriba 15 Aug '12

15 Aug '12

Hi, Attached a patch to remove most of the warnings below. Could I commit it? There are 4 warnings I want to check ../../../boost/date_time/period_formatter.hpp:117:47: warning: unused parameter 'separator' [-Wunused-parameter] ../../../boost/date_time/period_formatter.hpp:118:47: warning: unused parameter 'start_delim' [-Wunused-parameter] ../../../boost/date_time/period_formatter.hpp:119:47: warning: unused parameter 'open_end_delim' [-Wunused-parameter] ../../../boost/date_time/period_formatter.hpp:120:47: warning: unused parameter 'closed_end_delim' [-Wunused-parameter] where void delimiter_strings(const string_type& separator, const string_type& start_delim, const string_type& open_end_delim, const string_type& closed_end_delim) { m_period_separator; m_period_start_delimeter; m_open_range_end_delimeter; m_closed_range_end_delimeter; } and private: range_display_options m_range_option; string_type m_period_separator; string_type m_period_start_delimeter; string_type m_open_range_end_delimeter; string_type m_closed_range_end_delimeter; }; Is an assignment missing or it was a typo while trying to avoid the warning? Best, Vicente ../../../boost/date_time/date.hpp:194:55: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/date.hpp:195:67: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/date_duration.hpp:128:57: warning: extra ';' inside a struct [-pedantic] ../../../boost/date_time/date_duration.hpp:138:69: warning: extra ';' inside a struct [-pedantic] ../../../boost/date_time/date_duration.hpp:35:73: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/date_generators.hpp:37:30: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/date_generators.hpp:38:39: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/date_iterator.hpp:43:32: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/date_iterator.hpp:56:45: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/date_iterator.hpp:57:48: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/date_names_put.hpp:233:8: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/date_names_put.hpp:45:26: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/dst_transition_generators.hpp:21:38: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/local_time/custom_time_zone.hpp:46:7: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/local_time/custom_time_zone.hpp:47:40: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/local_time/local_date_time.hpp:211:31: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/local_time/posix_time_zone.hpp:118:39: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/period_formatter.hpp:117:47: warning: unused parameter 'separator' [-Wunused-parameter] ../../../boost/date_time/period_formatter.hpp:118:47: warning: unused parameter 'start_delim' [-Wunused-parameter] ../../../boost/date_time/period_formatter.hpp:119:47: warning: unused parameter 'open_end_delim' [-Wunused-parameter] ../../../boost/date_time/period_formatter.hpp:120:47: warning: unused parameter 'closed_end_delim' [-Wunused-parameter] ../../../boost/date_time/time_duration.hpp:254:57: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/time_iterator.hpp:22:77: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/time_iterator.hpp:33:45: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/time_iterator.hpp:34:48: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/time_iterator.hpp:35:64: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/time_iterator.hpp:36:65: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/time_iterator.hpp:37:66: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/time_iterator.hpp:38:65: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/time_iterator.hpp:39:64: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/time_iterator.hpp:40:65: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/time_zone_base.hpp:42:24: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/time_zone_base.hpp:43:33: warning: extra ';' inside a class [-pedantic] ../../../boost/date_time/wrapping_int.hpp:37:42: warning: extra ';' inside a class [-pedantic]

2 3

Trac ticket spam.
by Vicente J. Botet Escriba 15 Aug '12

15 Aug '12

Hi, could some one see what can be done with this spam https://svn.boost.org/trac/boost/ticket/7108? Best, Vicente

1 0

Announce: Boost 1.50 installer for 64-bit Windows now available
by John Wiegley 15 Aug '12

15 Aug '12

BoostPro is happy to announce that we now have a free 64-bit installer for Windows available for download: http://www.boostpro.com/download This version (which is only for 1.50 and onward) installs 64-bit libraries and/or DLLs for the following compilers: Visual C++ 8.0 (Visual Studio 2005 SP1) Visual C++ 9.0 (Visual Studio 2008 SP1) Visual C++ 10.0 (Visual Studio 2010 SP1) There will be no support for Visual C++ 7.1 for 64-bit, at any time. It continues to be supported for the 32-bit installer, however. Enjoy! -- John Wiegley BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

1 0

[asio] C++11 conformance problem: tie(this)
by Howard Hinnant 14 Aug '12

14 Aug '12

In three places asio/basic_socket_iostream.hpp does this: tie(this); In C++11 tie(this) has become undefined behavior, due to 27.5.5.3 [basic.ios.members]/p2: basic_ostream<charT,traits>* tie(basic_ostream<charT,traits>* tiestr); Requires: If tiestr is not null, tiestr must not be reachable by traversing the linked list of tied stream objects starting from tiestr->tie(). In libc++ it causes an infinite recursion as the ostream::sentry constructor calls flush on the tied buffer, and flush subsequently constructs a local ostream::sentry object (this is all C++11 required behavior). I could detect tie(this) in libc++ and ignore it (as a conforming extension). However I can not detect cyclic ties in general. My gut feeling is that a noisy error is better than ignoring it because whatever tie(this) is supposed to be accomplishing in asio, it isn't, at least not with C++11-conforming std::libs (ignore or crash seem to be std::lib's two obvious options). I believe the best course of action is to remove the three instances of tie(this) from asio. I do not know if this same issue occurs in other parts of boost. I scanned but didn't catch anything. Howard

1 0

[type_erasure][docs]uniform term for underlying
by Larry Evans 14 Aug '12

14 Aug '12

The doc: http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure… uses 3 terms: underlying actual contained to designate, essentially, the same thing, the actual type stored in the any. The docs would be clearer if a uniform term were used, with possibly a link to some glossary where the term was defined. -regards, Larry

1 0

[icl] HTML doc consumes more than 50 MB
by Michel Morin 14 Aug '12

14 Aug '12

The HTML doc in `libs/icl/doc/html/boost/icl` consumes more than 50 MB on my system. This directory contains about 2000 docs and there are many duplicate docs. Joachim, could you improve the situation? Thanks, Michel

3 4

C++11 decltype/SFINAE puzzler
by Eric Niebler 13 Aug '12

13 Aug '12

I'm running into a usability problem with the extended SFINAE rules that could effect best practice for all new C++ libraries. I'm hoping some clever person in the Boost community can help me. I find that in highly generic code, using decltype to define the return type of functions is very handy. Dave A. suggested a RETURNS macro to simplify this idiom: <https://groups.google.com/d/msg/boost-devel-archive/OzJ5Ft3pSnU/b_Ter9bgNqAJ> It's used like this: template<typename T> auto foo( T && t ) RETURNS( some-expression-using-t ); This is great and I use it a lot. Now, imagine you have a library of such functions calling other such functions: function A calls B calls ... calls Y, calls Z, all of which use decltype to declare their return types. Now, the user calls A passing a variable t for which the expression in Z's return type calculation makes no sense. Extended SFINAE kicks in, and Z simply disappears. Since Z has disappeared, the expression in Y's return type makes no sense, so Y disappears, too. And so on up the chain. The end result is that the user is presented with an error like: "no viable function A, template substitution failed." The user is given no information about which function in the chain failed to compile, or why. This is a serious usability problem! So, my question is: what can be done about this? Can we get the benefit of automatic type deduction in return types without causing SFINAE to drop functions from the overload set? Is there another trick we can use to report errors meaningfully when APIs are misused? The only solution I can think of is turn all the free functions in the chain into function objects and then using std::result_of to compute return types for them instead of using decltype directly. That means Dave's (very convenient!) RETURNS macro shouldn't be used, which is a bummer. (I think it also means that we need a noexcept_of template that computes the noexcept of an expression without causing the expression to appear in the function declaration, but that depends on how <http://llvm.org/bugs/show_bug.cgi?id=13286> gets resolved.) All suggestions welcome, -- Eric Niebler BoostPro Computing http://www.boostpro.com

9 19

[hash] test failure with current Intel compiler
by Beman Dawes 13 Aug '12

13 Aug '12

Release branch, using the current Intel compiler on Windows, a couple of filesystem tests are failing on my machine with the message: ..\..\..\boost/functional/hash/detail/container_fwd_0x.hpp(49): error: class template "std::tr1::shared_ptr" may not be redeclared in the current scope template <class> class shared_ptr; These tests are passing for GCC and VC++, but the Intel compiler uses the well regarded EDG front end. --Beman

2 1

[graph] interest in resumable dijkstra?
by Alex Hagen-Zanker 13 Aug '12

13 Aug '12

Dear boost-list, I placed the BGL algorithm of the dijkstra_shortest_path in a class, with the creation and initialization part separate from the main algorithm. This allows interrupting, resetting and resuming the algorithm. Would this be of interest to anybody? The following function call: dijkstra_shortest_path(graph, orig, parameter_pack); is separated into: auto dijkstra = make_dijkstra(graph, parameter_pack); dijkstra.init_from_origin(orig /*, optional_visitor*/); dijkstra.expand(/*optional_visitor*/); The make_dijkstra() function reads all parameters from the parameter_pack including color_map and priority_queue Visitors interrupt the calculation using a do_intterrupt() callback instead of throwing an exception. The function expand() can be called repeatedly, each time with another visitor. The implementation requires C++11, because of auto and lambda's, it also relies on the following patch: https://svn.boost.org/trac/boost/ticket/7130. To see for yourself: http://people.pwf.cam.ac.uk/ahh34/dijkstra_test.zip I am interested to hear your opinion. With kind regards, Alex

5 24

[type_erasure][doc]static_binding doc: no mention of PH to PH use.
by Larry Evans 13 Aug '12

13 Aug '12

The static_binding doc: http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure… contains: Description Represents a mapping from placeholders to the actual types that they bind to. However, the doc for: template < typename Concept2 , typename Tag2 , typename Map > any ( const any< Concept2, Tag2 > & other , const static_binding< Map > & binding ); here: http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure… contains: Requires: [snip] Map must be an MPL map with keys for all the placeholders used by Concept and values for the corresponding placeholders in Concept2. So the static_binding doc should contain something like: Represents a mapping from placeholders to the actual types that they bind to or a mapping from placeholders to placeholders, depending on where static_binding is used. HTH. -regards, Larry

1 0

[1.51.0] Beta 1 release candidates available
by Marshall Clow 12 Aug '12

12 Aug '12

Release candidate files for 1.51.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: 543e3498c4ce520bfa635607971be4fc boost_1_51_0_beta1_rc1.tar.gz 3f9beb290dad223c21822e9ef601fd80 boost_1_51_0_beta1_rc1.tar.bz2 0401b9c40aac37b7dd9ef7e33190270c boost_1_51_0_beta1_rc1.zip e5aa1cd82e71173197ee6794c2c035d2 boost_1_51_0_beta1_rc1.7z Thanks, --The release managers

10 15

[MPI] Jamfile tweak
by Daniel James 12 Aug '12

12 Aug '12

Hi, I've made a change to the MPI documentation Jamfile. The documentation build was failing on trunk because the same project name was used in 'libs/mpi/build/Jamfile.v2' and 'libs/mpi/doc/Jamfile.v2', so I gave the documentation project a more appropriate name: https://svn.boost.org/trac/boost/changeset/79974/ I'll merge to release once 1.51 is finished. Daniel

1 0

[1.51] Beta build of the PDF docs available
by John Maddock 12 Aug '12

12 Aug '12

A PDF build of the docs for 1.51 beta is now available from https://sourceforge.net/projects/boost/files/boost-docs/1.51.0/ John.

2 4

[fusion] 1.50.0 release broken on c++11
by Steve Lorimer 11 Aug '12

11 Aug '12

Hi folks I know it's been reported before, and has been fixed in trunk, but is there any plan to fix the released version? Reported here: http://boost.2283326.n4.nabble.com/fusion-g-4-6-deque-and-c-0x-compile-erro… Thanks Steve

4 4

[1.51] Context docs contains third party materials?
by John Maddock 11 Aug '12

11 Aug '12

Just noticed that the docs for the new context lib contains a "pdf" folder with a bunch of third-party PDF files, including the complete ISO C standard. Can we really re-distribute these? I would have thought not? Plus they occupy a few Mb of space when they could just be linked to elsewhere? Cheers, John.

2 2

[atomic] boost.atomic library/win32
by Tim Blechmann 10 Aug '12

10 Aug '12

hello helge, the shared library of boost.atomic on msvc is currently not really usable, as it does not export the pool_. atm, all boost.lockfree tests of msvc fail for this reason. also according to Zao on irc, it will need some specific treatment to avoid the compilation of a static library. tim [1] http://www.boost.org/development/tests/trunk/developer/lockfree.html

3 4

Cygwin svn client broken. Boost scripts failing as a result
by Beman Dawes 10 Aug '12

10 Aug '12

Failures in the inspection script have been tracked back to a cygwin problem. See http://stackoverflow.com/questions/11007024/cygwin-svn-e200030-sqlite-disk-… I did get a run of the trunk inspect script off this morning, but it may be erratic until this gets straightened out. If you are a cygwin svn user, and svn is working OK, you might want to avoid updating your cygwin installation until cygwin fixes this. --Beman

1 0

Meeting C++ - Full Program + Early Bird
by Jens Weller 10 Aug '12

10 Aug '12

Hi C++ & boost Community, just a short note to those who are interested in C++ conferences: The Schedule of Meeting C++ is online: http://meetingcpp.com/index.php/schedule.html The Keynote "Good C++11 Coding Style" is held by Michael Wong, the focus is on C++11 and boost. Early Bird Tickets are still available for one week until next wednesday! regards, Jens Weller

2 2

[intrusive_ptr] Why are comparison operators not friends?
by Carsten Fuchs 10 Aug '12

10 Aug '12

Hi all, I was just (re-)reading item 46, "Define non-member functions inside templates when type conversions are desired", in Scott Meyers "Effective C++, 3rd edition", and was wondering how and why the comparison operators for intrusive_ptr work when used with NULL, even though they're not friend functions as described in Scott Meyer's item 46. That is, the example program below compiles and links fine both with GCC 4.6 as well as with Visual C++ 2010 -- but how does do the compilers match the == operator, whose right operand is NULL, an int value? If I try to use the exact same templated binary operators like this in my own classes, and want NULL matched to one of the T* or U* operands, then I have to do it with friend functions or else the compilers don't find a match. Why does it work here? Best regards, Carsten #include <boost/intrusive_ptr.hpp> #include <iostream> class CRefCounted { public: CRefCounted() : RefCount(0) {} long RefCount; }; void intrusive_ptr_add_ref(CRefCounted* p) { ++(p->RefCount); } void intrusive_ptr_release(CRefCounted* p) { if (--(p->RefCount) == 0) delete p; } int main() { using namespace boost; intrusive_ptr<CRefCounted> p(new CRefCounted()); // I'd expect the next line of code to fail compilation, because the compiler // cannot find a match for operator == with left operand of type // intrusive_ptr<CRefCounted> and right operand of type int, but they do! if (p == NULL) std::cout << "p == NULL\n"; else std::cout << "p != NULL\n"; }

2 2

Re: [boost] Code question on fusion tag_of.hpp
by Dave Steffen 10 Aug '12

10 Aug '12

Mathias Gaunard wrote: > On 08/08/2012 23:39, Dave Steffen wrote: > > Hi Folks > > > > During a recent bug hunt, we came across the following (Boost 1.49, > > fusion/adapted/std_tuple/tag_of.hpp): > > > > #include <tuple> > > > > namespace std > > { > > template <typename... Elements> > > class tuple; > > } > > > > We find this rather puzzling -- why is this here? As far as we can > > tell, this doesn't do anything. > > It forward declares std::tuple so that it can specialize its traits > for it. > > But it really shouldn't do that, since there is no guarantee this > declaration is compatible with the standard one. Well, first of all, it's not a forward declaration, right? std::tuple is declared in whatever gets included with #include<tuple>, right? So it's not a forward declaration, it's a... what? A backwards declaration? :-) It's redundant at any rate. (Or I'm completely wrong, in which case I'm missing something.) And then, yes, this may or may not be compatible with the real std::tuple (which is what we were looking in to when we found this). -- Dave Steffen Software Engineer NUMERICA CORPORATION www.numerica.us (970) 461-2000 main (970) 612-2327 direct

3 3

boost 1.50.0 - function_input_iterator issue
by hans ewetz 09 Aug '12

09 Aug '12

In boost v1.50.0 the function_input_iterator constructor performs dereferencing which may prevent creation of an 'end' iterator. Should it not instead dereference in the dereference() function and possibly keep a dirty flag indicating if the current value is valid? Apologies if I have missed any similar posting related to this problem. Hans

2 1

[review] Multiprecision review results
by Jeffrey Lee Hellrung, Jr. 09 Aug '12

09 Aug '12

Summary -------- John Maddock and Christopher Kormanyos' Multiprecision library is ACCEPTED for inclusion into Boost, with 8 YES votes, 1 NO vote, and 1 CONDITIONAL vote. Details -------- Most reviewers noted that this was a sufficiently good first step toward extended precision arithmetic for inclusion into Boost. I think John and Chris will agree that there remains quite a bit of work left to do, but as one reviewer noted, John has an excellent track record regarding Boost development and Chris has been extremely dedicated during the pre-review development, review process, and post-review development, so I think this bodes well for the library's future. I'm going to highlight what I perceive to be some of the bigger issues raised by various individuals involved with in discussion, but I will share all my notes via Google Docs [1], and of course even further details are available in the mailing list archive. I note that many of the issues raised during the review have already been addressed by John and Chris. Mixed-Type Arithmetic -------- This has come up over and over again, especially in the context of allowing extended precision types within the same "family" to interoperate, which I think is tractable. Removing my review manager hat for a moment, perhaps a tag dispatching system similar to Boost.MPL or Boost.Fusion could be used, where all arithmetic types within the same family have the same tag, and hence only allow mixing types with the same tag. Most types will have a unique tag (which, I don't know, could default precisely to the arithmetic type?), but, e.g., Vicente's family of fixed-precision (and maybe even fixed-point) types would all be identifiable as being in the same family, and a traits class would determine the result types of the various arithmetic operations. Mixed-type arithmetic outside the above scope seems more tricky, but some users seem to still desire this in some form. Actual desired use cases will undoubtedly help here. Naming -------- Several commented on the redundancy of "mp_" prefix for identifiers already residing the boost::mp namespace. Narrowing Conversions -------- cpp_dec_float should round rather than truncate on narrowing conversions. Review manager hat off: I wonder if a radix-2 implementation of an arbitrary precision float should ultimately be prioritized and recommended over the present radix-10 implementation? It sounds like conversions in general should be reviewed, but I'm entirely sure myself where they all stand. If possible, narrowing conversions should be explicit while others (that would guarantee no loss of precision) may be implicit. This would be a departure from C++ builtin types. Performance -------- Phil, the lone NO vote, lamented that the scope of the library was evidently beyond simple fixed-precision (e.g., 128-bit or 256-bit) integral types, which is his desired use case. Indeed, at least in an earlier version of MP, expression templates seemed to give a performance penalty relative to using the raw back-end types; in theory, expression templates should give no performance hit, but compilers just may not be there yet. In any case, several reviewers requested that the scope of the library be clarified up front in the documentation. Regularization/Normalization of Back-End Behavior via Front-End -------- As Edward pointed out, different back-ends generally have different behavior on some "exceptional" cases, making use of the corresponding front-ends in generic contexts at times cumbersome (specifically when the generic context needs to handle said exceptional cases). A couple examples given were division-by-zero and conversion from a string with invalid characters. It is by no means *necessary* to regularize/normalize *all* such differences, but as many as possible and practical should be identified, considered, and documented. Separation of Data Structures and Algorithms -------- Though requested, John and Steven have maintained that this simply isn't very practical. I've gathered that there are too many special cases that (1) would make implementations a nightmare; and (2) would have be addressed very carefully (i.e., in a likely not-very-readable way) to avoid any performance hits. Since this has come up a few times, maybe something could be said in the documentation about this. Thanks to everyone who submitted reviews and participated in the discussion. Let me know if I left out anything you feel is particularly significant or inaccurate. - Jeff [1] https://docs.google.com/document/d/19YgtWBQt0lpjJoJDOtAlScZAZyOwzbHimiYTi-g…

7 6

Code question on fusion tag_of.hpp
by Dave Steffen 09 Aug '12

09 Aug '12

Hi Folks During a recent bug hunt, we came across the following (Boost 1.49, fusion/adapted/std_tuple/tag_of.hpp): #include <tuple> namespace std { template <typename... Elements> class tuple; } We find this rather puzzling -- why is this here? As far as we can tell, this doesn't do anything. (Well, it did participate in a long, ugly compiler error about variadic templates, which is why we found it.) What are we missing? Thanks for any insight. -- Dave Steffen Software Engineer NUMERICA CORPORATION www.numerica.us (970) 461-2000 main (970) 612-2327 direct

2 1

Re: [boost] [review] Multiprecision and uBlas
by John Maddock 09 Aug '12

09 Aug '12

>> Also running the tests for UBLAS with mp_number put in place of >> floats/doubles would be interesting. > > I've added modified versions of uBlas tests 1-7 to the multiprecision lib, > most of the tests pass, but there are two outstanding issues: > > * Test1: I had to disable a couple of tests because they trigger debug > assertons inside the STL. I get the same errors when testing with type > double, so I conclude it's a uBlas issue, not sure why they aren't > triggered in the regular regression tests though... > * Test3: I can't get this to compile, and the error are so inscrutable I > don't know what the issue is, I'd need some help from a uBlas expert to > figure those out. Hold on that was a mistake, test1 does pass, tests 3 and 7 don't compile for reasons I don't understand. I'd need some help from a uBlas expert to figure those out. John.

2 1

[Algorithm] [Range] `is_sorted` is duplicate
by Michel Morin 08 Aug '12

08 Aug '12

Both Boost.Algorithm and Boost.Range have `is_sorted` function. Would it be better to deprecate Boost.Range's `is_sorted`? Also, Both Boost.Algorithm and Boost.Range have `iota` function. (In this case, Boost.Algorithm's `iota` returns void, but Boost.Range's `iota` returns the range.) Regards, Michel

1 0

[context] doesn't build on 32-bit osx
by Luke Elliott 08 Aug '12

08 Aug '12

Hello Oliver There's actually already a ticket on this (https://svn.boost.org/trac/boost/ticket/7110 not from me) but since it's unassigned I thought I'd post here with a few more details. bjam address-model=32 -d+2 Performing configuration checks - x86 : yes Jamfile</Users/macpro/dev/checkouts/boost-trunk/libs/context/build>.gas ../../../bin.v2/libs/context/build/darwin-4.2.1/debug/address-model-32/architecture-x86/asm/fcontext_i386_sysv_macho_gas.o as -o "../../../bin.v2/libs/context/build/darwin-4.2.1/debug/address-model-32/architecture-x86/asm/fcontext_i386_sysv_macho_gas.o" "../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S" ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:82:suffix or operands invalid for `push' ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:83:suffix or operands invalid for `push' ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:84:suffix or operands invalid for `push' ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:86:suffix or operands invalid for `pop' ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:87:Missing operand value assumed absolute 0. ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:87:junk `[.-1b]' after expression ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:90:suffix or operands invalid for `pop' ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:91:suffix or operands invalid for `pop' ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:92:suffix or operands invalid for `pop' ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:101:suffix or operands invalid for `pop' ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:112:suffix or operands invalid for `pop' ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:113:Missing operand value assumed absolute 0. ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:113:junk `[.-3b]' after expression ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:116:suffix or operands invalid for `push' darwin.compile.c++ ../../../bin.v2/libs/context/build/darwin-4.2.1/debug/address-model-32/fcontext.o Applying the 64-bit change from Daniel Larimer on 13th May and adding -arch=i386 to the as flags gets things further: as -o "../../../bin.v2/libs/context/build/darwin-4.2.1/debug/address-model-32/architecture-x86/asm/fcontext_i386_sysv_macho_gas.o" "../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S" -arch i386 ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:87:Missing operand value assumed absolute 0. ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:87:junk `[.-1b]' after expression ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:113:Missing operand value assumed absolute 0. ../../../libs/context/src/asm/fcontext_i386_sysv_macho_gas.S:113:junk `[.-3b]' after expression From a quick google, it sounds like _GLOBAL_OFFSET_TABLE is an ELF only thing. I'm now way out of my depth and probably can't really help any further (though happy to try out any fixes). Probably not of much relevance but: sw_vers ProductName: Mac OS X ProductVersion: 10.7.4 BuildVersion: 11E53 as -version Apple Inc version cctools-822, GNU assembler version 1.38 I hope that is of some use! ucontext throws up a deprecated warning so it would be nice to switch to boost.context one day. I've not tried Mountain Lion yet so don't know if they've actually removed ucontext support or if it's still deprecated. Best regards Luke Elliott.

2 3

[1.51][Wave] Last minute commit
by Hartmut Kaiser 07 Aug '12

07 Aug '12

Hey, I would like to ask for permission to commit rev 79783 to the release branch (see attached patch). This fixes a bug introduced only recently and will fix the current regressions (see here: http://tinyurl.com/c44ql68, for instance). The patch is for Wave only and does not touch any of the other Boost libraries. Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

2 4

[review] Multiprecision review (June 8th - 17th, 2012)
by Jeffrey Lee Hellrung, Jr. 07 Aug '12

07 Aug '12

Okay, it's that time. Apologies for not sending a reminder, but there had been a lot of pre-review comments over the last week or so, so I think this has been on at least some people's radar. The original review announcement is given below. On Tue, May 29, 2012 at 2:08 PM, Jeffrey Lee Hellrung, Jr. < jeffrey.hellrung(a)gmail.com> wrote: > Hi all, > > The review of the proposed Boost.Multiprecision library authored by John > Maddock and Christopher Kormanyos has been scheduled for > > June 8th - June 17th, 2012 > > and will be managed by myself. > > From the Introduction: > > -------- > "The Multiprecision Library provides *User-defined* integer, rational and > floating-point C++ types which try to emulate as closely as practicable the > C++ built-in types, but provide for more range and precision. Depending > upon the number type, precision may be arbitrarily large (limited only by > available memory), fixed at compile time values, for example 50 decimal > digits, or a variable controlled at run-time by member functions. The types > are expression-template-enabled for better performance than naive > user-defined types." > -------- > > And from the original formal review request from John: > > -------- > 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… > -------- > Any review discussion should take place on the developers' list ( boost(a)lists.boost.org) and anyone may submit a formal review, either publicly to the entire list or privately to just myself. As usual, please consider the following questions in your formal review: What is your evaluation of the design? What is your evaluation of the implementation? What is your evaluation of the documentation? What is your evaluation of the potential usefulness of the library? Did you try to use the library? With what compiler? Did you have any problems? How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? Are you knowledgeable about the problem domain? And, most importantly, please explicitly answer the following question: Do you think the library should be accepted as a Boost library? Lastly, please consider that John and Christopher have compiled a TODO list [1] based on pre-review comments. Feel free to comment on the priority and necessity of such TODO items, and whether any might be show-stoppers or warrant conditional acceptance of the library. Thanks in advance; looking forward to the discussion! - Jeff (& John & Christopher) [1] http://svn.boost.org/svn/boost/sandbox/big_number/libs/multiprecision/doc/h…

16 67

[type_erasure] Review started (July 18-27, 2012)
by Lorenzo Caminiti 06 Aug '12

06 Aug '12

Hello all, *** The review of Steven Watanabe's proposed Boost.TypeErasure library begins on July 18, 2012 and ends on July 27, 2012. *** THE LIBRARY C++ provides runtime polymorphism through virtual functions. They are a very useful feature, but they do have some limitations. * They are intrusive. In generic programming, we can design an interface which allows third-party types to be adapted to it. * They require dynamic memory management. Of course, most of the problems can be avoided by using an appropriate smart pointer type. Even so, it still acts like a pointer rather than a value. * Virtual functions' ability to apply multiple independent concepts to a single object is limited. The Boost.TypeErasure library solves these problems allowing us to mirror static generic programming at runtime. Library source: http://svn.boost.org/svn/boost/sandbox/type_erasure/ Pre-built documentation: http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ You can also download archives with pre-built documentation from: http://sourceforge.net/projects/steven-watanabe.u/files/ YOUR REVIEW Please submit a review to the mailing-list by replying to this email ("[boost] [type_erasure] Review ..." should be in the subject). Please state clearly whether you think this library should be accepted as a Boost library. Other questions you may want to consider: 1. What is your evaluation of the design? 2. What is your evaluation of the implementation? 3. What is your evaluation of the documentation? 4. What is your evaluation of the potential usefulness of the library? 5. Did you try to use the library? With what compiler? Did you have any problems? 6. How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? 7. Are you knowledgeable about the problem domain? Thanks in advance to all who participate in the review discussion -- I'm looking forward to it! The review manager. --Lorenzo

12 56

interest in generic cyclic visitor?
by Jan Herrmann 06 Aug '12

06 Aug '12

Hello, I have an implementation of generic cyclic visitor. It is available at https://github.com/janherrmann/visitor . With my implementation it is possible to create non-member, non-friend templates which behave like virtual functions. Additionally it can be used as a base for multimethod implementation. Moreover it can be used to build a extensible type information system. All test cases compile with msvc-10.0 and gcc-mingw-4.6.2. Is there need for such a library? Jan Herrmann

3 5

[multiprecision] Some Performance gains
by John Maddock 05 Aug '12

05 Aug '12

Following the review of the multiprecision lib, I've been experimenting with some of the issues raised, currently focusing on performance improvements. Anyhow, I now have some results for improved *front end* performance, I haven't tried to seriously optimize the cpp_int backend yet (which was one of the criticisms), but for more on that see below. So... by way of measuring front end performance - the "abstraction penalty" if you like I've used a special backend type "arithmetic_backend<A>" where A can be any builtin arithmetic type. For tests I've used Boost.Math's special function test data for floating point types, and Phil Endecott's Delaunay code for integer performance. Win32 VC10 first: Delaunay test: int64_t : 9.45241 mp_number<arithmetic_backend<int64_t>, false> : 9.66815 Bessel Functions Test: Time for Bessel Functions - double = 0.015859 seconds Time for Bessel Functions - arithmetic_backend<double> - no expression templates = 0.0225565 seconds Time for Bessel Functions - arithmetic_backend<double> = 0.0376449 seconds Non Central T: Time for Non-central T - double = 0.456739 seconds Time for Non-central T - arithmetic_backend<double> - no expression templates = 0.459957 seconds Time for Non-central T - arithmetic_backend<double> = 1.08256 seconds Ubutunu Linux x64, GCC-4.6.1: Delaunay Test: int64_t 2.3969 mp_number<arithmetic_backend<int64_t>, false> 2.38334 Bessel Functions Test: Time for Bessel Functions - double = 0.0224617 seconds Time for Bessel Functions - arithmetic_backend<double> - no expression templates = 0.020384 seconds Time for Bessel Functions - arithmetic_backend<double> = 0.0220476 seconds Non central T: Time for Non-central T - double = 0.622985 seconds Time for Non-central T - arithmetic_backend<double> - no expression templates = 0.554527 seconds Time for Non-central T - arithmetic_backend<double> = 0.800129 seconds So to all intents and purposes there's now no abstraction penalty at all, except when using expression templates (which should be reserved for heavyweight backends anyway). Notice how the mp_number code is sometimes slightly faster, and sometimes slightly slower than the native type - I've observed that completely trivial changes to the test/measuring code can change this around - I suspect, but can't prove that the abstraction layer changes the decisions made by the compiler's optimizer resulting in somewhat capricious differences between results. With regard to the cpp_int backend, I still have work to do, however things do actually look pretty good on Linux x64 for the Delaunay test: Running calculations for: int64_t, int128_t (this is Phil's 128-bit special-case code) Number of flips = 23892000 Total execution time = 3.28337 Running calculations for: int64_t, mp_int128_t Number of flips = 23892000 Total execution time = 3.05434 Running calculations for: int64_t, mp_int128_t (ET) Number of flips = 23892000 Time per calculation = 3.02904e-08 Running calculations for: int64_t, cpp_int Number of flips = 23892000 Total execution time = 5.41737 On Win32, I'm still a touch behind Phil's code, however, I haven't written a dedicated NxN->2N multiplication routine (yet): Running calculations for: int64_t, int128_t Number of flips = 23892000 Total execution time = 14.2189 Running calculations for: int64_t, mp_int128_t Number of flips = 23892000 Total execution time = 24.5114 Running calculations for: int64_t, mp_int128_t (ET) Number of flips = 23892000 Total execution time = 19.741 Running calculations for: int64_t, cpp_int Number of flips = 23892000 Total execution time = 33.5 All the new code is in the sandbox, but I haven't documented any of the changes yet... Regards, John.

3 4

[typeof][implementation]why not use decltype or conditional expr?
by Larry Evans 05 Aug '12

05 Aug '12

Why couldn't the BOOST_TYPEOF macro be defined to simply use the new keyword, decltype, if it's available? I assume the macro, BOOST_HAS_DECLTYPE, indicates whether it is available. And if decltype not available, why couldn't it use the conditional expression method described here: http://www.artima.com/cppsource/foreach2.html I would think that would be simpler and more portable. -regards Larry

5 6

Formal review request: TypeIndex library
by Antony Polukhin 05 Aug '12

05 Aug '12

Hi, I'd like to ask to add Boost.TypeIndex to review queue. Introduction TypeIndex is an extended C++11 type_index library, that * works with disabled RTTI * can store const-volatile-reference info about types (if user requested it) * has all the functionality of std::type_index * has portable across compilers and platforms functionality for getting demangled type names * works across modules/shared libraries * does not require C++11 to work Docs: http://apolukhin.github.com/type_index/index.html Git: https://github.com/apolukhin/type_index Sources (zipped): https://github.com/apolukhin/type_index/zipball/master Git contains `patched` folder with TypeIndex'ed (and untested) versions of some existing boost libraries (Boost.Any, Boost.Graph, Boost.Math, Boost.MSM, Boost.PropertyMap, Boost.PropertyTree). Those libraries now do not require RTTI to compile. More libraries could be added to this list. Previous threads (checking interest): * Is there interest in typeid(TYPE).name() like function that does not require RTTI http://lists.boost.org/Archives/boost/2012/05/193491.php * [boost] Is there interest in copyable type_info that does not require RTTI (was: Is there interest in typeid(TYPE).name() like function that does not require RTTI) http://lists.boost.org/Archives/boost/2012/05/193519.php * [boost] [type_index] C++03 implementation in boost? http://lists.boost.org/Archives/boost/2012/07/194627.php P.S.: Additional thanks to Agustín K-ballo Bergé for pointing out and fixing some bugs. P.P.S.: It would be great to schedule review to the end of September. -- Best regards, Antony Polukhin

2 3

[1.51.0] Beta1 release available; release branch open for bug fixes and doc fixes
by Marshall Clow 05 Aug '12

05 Aug '12

The beta releases are available at: http://boost.cowic.de/rc/ They are identical to the rc2 releases. The files (and associated md5s) are: e3a51b82894a67ac438eaa08192929eb *boost_1_51_0_beta1.tar.gz 1c541236f98dcaa706e7f8eabb11ebfc *boost_1_51_0_beta1.tar.bz2 964f150ce9d7bcaba74255aba73d338a *boost_1_51_0_beta1.zip e23467c3369a53189300c76e8c848aa1 *boost_1_51_0_beta1.7z The final release is scheduled for Monday, August 20th. The release candidate is scheduled to to be built Thursday, August 16th. That gives us less than two weeks to apply post-beta bug fixes and doc updates. Until August 13th permission is not required to merge bug fixes and documentation updates. Starting August 13th permission of a release manager is required for all merges. As always, New libraries and new features are not allowed during a post-beta period. Thanks, -- The Release Managers

2 1

[type_erasure] Review ended
by Lorenzo Caminiti 04 Aug '12

04 Aug '12

Hello all, The review of Boost.TypeErasure ended on Aug 3, 2012. Stay tuned for my decision on the library. Thank you very much to Steven, everyone that submitted a review, and everyone that participated in the discussions. The review manager, --Lorenzo On Fri, Aug 3, 2012 at 11:00 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: > Hello all, > > *** The review of Boost.TypeErasure ends today Aug 3, 2012. If you are > planning to submit a review, please do so by the end of today. *** > > Thank you to all that have participated to the review so far. > > The review manager, > --Lorenzo > > On Jul 27, 2012 1:41 PM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> wrote: >> >> Hello all, >> >> After consulting the review wizards and Steven, I am extending >> Boost.TypeErasure review of one week, until August 3, 2012. >> >> Thank you to all that have submitted a review already and I am looking >> forward to receiving additional submissions. >> >> The review manager, >> --Lorenzo >> >> On Jul 27, 2012 3:22 AM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> wrote: >>> >>> Hello all, >>> >>> On Mon, Jul 23, 2012 at 9:09 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> >>> wrote: >>> > On Wed, Jul 18, 2012 at 1:13 AM, Lorenzo Caminiti >>> > <lorcaminiti(a)gmail.com> wrote: >>> >> *** The review of Steven Watanabe's proposed Boost.TypeErasure library >>> >> begins on July 18, 2012 and ends on July 27, 2012. *** >>> > >>> > *** Boost.TypeErasure review ends in 5 days. Please submit your reviews >>> > :D *** >>> >>> *** Boost.TypeErasure review ends today July 27, 2012. If you are >>> planning to submit a review, please do so as soon as possible. *** >>> >>> Thank you to everyone who has commented on the library and submitted a >>> review so far! >>> >>> The review manager, >>> --Lorenzo >>> P.S. I am considering extending the review until end of day Sunday >>> July 29, 2012... I will keep you posted. >>> >>> > There have been interesting discussions on the library on the ML but I >>> > have not received any official review yet :( Especially if you are a >>> > user of Boost Any, Function, and Any Iterator, you definitely want to >>> > take a look at Type Erasure as it generalizes solutions provided by >>> > those other libraries. >>> > >>> > Thank you. >>> > >>> > The review manager. >>> > --Lorenzo >>> > >>> >> THE LIBRARY >>> >> >>> >> C++ provides runtime polymorphism through virtual functions. They are >>> >> a very useful feature, but they do have some limitations. >>> >> * They are intrusive. In generic programming, we can design an >>> >> interface which allows third-party types to be adapted to it. >>> >> * They require dynamic memory management. Of course, most of the >>> >> problems can be avoided by using an appropriate smart pointer type. >>> >> Even so, it still acts like a pointer rather than a value. >>> >> * Virtual functions' ability to apply multiple independent concepts to >>> >> a single object is limited. >>> >> The Boost.TypeErasure library solves these problems allowing us to >>> >> mirror static generic programming at runtime. >>> >> >>> >> Library source: >>> >> http://svn.boost.org/svn/boost/sandbox/type_erasure/ >>> >> >>> >> Pre-built documentation: >>> >> >>> >> http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ >>> >> >>> >> You can also download archives with pre-built documentation from: >>> >> http://sourceforge.net/projects/steven-watanabe.u/files/ >>> >> >>> >> YOUR REVIEW >>> >> >>> >> Please submit a review to the mailing-list by replying to this email >>> >> ("[boost] [type_erasure] Review ..." should be in the subject). >>> >> >>> >> Please state clearly whether you think this library should be accepted >>> >> as a Boost library. >>> >> >>> >> Other questions you may want to consider: >>> >> 1. What is your evaluation of the design? >>> >> 2. What is your evaluation of the implementation? >>> >> 3. What is your evaluation of the documentation? >>> >> 4. What is your evaluation of the potential usefulness of the library? >>> >> 5. Did you try to use the library? With what compiler? Did you have >>> >> any problems? >>> >> 6. How much effort did you put into your evaluation? A glance? A >>> >> quick reading? In-depth study? >>> >> 7. Are you knowledgeable about the problem domain? >>> >> >>> >> Thanks in advance to all who participate in the review discussion -- >>> >> I'm looking forward to it!

1 0

[build] guru needed: static vs dynamic lib conundrum for serialization/filesystem library
by Robert Ramey 04 Aug '12

04 Aug '12

The serialiation library uses the boost.filesystem component in it's tests. On tests which test dlls on windows I'm getting an error: test_dll_exported.cpp ..\..\..\boost\filesystem\config.hpp(69) : fatal error C1189: #error : Must not define both BOOST_FILESYSTEM_DYN_LINK and BOOST_FILESYSTEM_STATIC_LINK call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul cl /Zm800 -nologo @"..\..\..\bin.v2\libs\serialization\test\test_dll_exported.test\msvc-7.1\debug\link-static\threading-multi\test_dll_exported.obj.rsp" Which I've traced to the command line "test_dll_exported.cpp" -Fo"..\..\..\bin.v2\libs\serialization\test\test_dll_exported.test\msvc-7.1\debug\link-static\threading-multi\test_dll_exported.obj" -TP /Z7 /Od /Ob0 /W4 /GR /MDd /Zc:forScope /Zc:wchar_t /Wp64 /GB /Op /wd4675 /EHs -Gy -wd4996 -c -DBOOST_ALL_NO_LIB=1 -DBOOST_FILESYSTEM_DYN_LINK=1 -DBOOST_FILESYSTEM_STATIC_LINK=1 -DBOOST_LIB_DIAGNOSTIC=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_SYSTEM_STATIC_LINK=1 -D_CRT_SECURE_NO_DEPRECATE -D_CRT_SECURE_NO_WARNINGS -D_SCL_SECURE_NO_DEPRECATE -D_SCL_SECURE_NO_WARNINGS "-I..\..\.." which is produced by BJAM. The test application creates a DLL which is part of the test. BUT the dll created, as well as the serialization library used have been created with static linking. I'm assuming that the file system library is also created this way. I "think" this should be OK even though some C++ runtime code will be repeated between the DLL and the mainline test components and that this might create a problem so it's probably not the best practice. Never the less, users do this and I want to test it. I believe that the problem resides in some thing in the BJAM files related to filesystem libraries or test but I've been unable to track it down further than the above. Any help would be appreciated. Robert Ramey

3 3

[rational] with optional over/underflow checking
by Dan Searles 04 Aug '12

04 Aug '12

Hello, Would there be any interest in a modified "rational" class template/header that optionally allows for an exception be generated if there is under/overflow during any of the operations? I have been developing such a template, where the new defaulted bool template parameter would generate the class exactly as before to preserve the original stable implementation, and to support unlimited-precision integer where over/underflow would not be possible. Setting the new template parameter to true, however would generate code that adds the over/underflow checking. I have also generated new test driver code (BTW test code referenced by the documentation does not appear to exist, or at least the link is broken). rational.hpp has been around and stable for quite some time, so there may be a desire to keep it unchanged, but its original function (and indeed its original source code) can be maintained through the template system. If such a class were to be included in boost, what would be the best submission method?

3 4

Boost.Atomic on Windows, patch
by Václav Zeman 04 Aug '12

04 Aug '12

Hi. I have noticed that boost/atomic/detail/generic-cas.hpp is directly including Windows.h header. I consider this problematic for WinSock using applications as Windows.h automatically pulls in Winsock.h, the WinSock 1 header. This is problematic because it requires users that want to use WinSock 2 to order their include of WinSock2.h before inclusion of Boost.Atomic. At this point in time anybody serious about sockets on Windows really do not want to use WinSock 1 but version 2 instead. So I suggest the attached patch. -- VZ

4 6

[iterator] Error in documentation
by Gabriel Redner 04 Aug '12

04 Aug '12

In the boost::iterator documentation [1], the synopsis for make_function_input_iterator is missing the second 'state' argument. Specifically, this: template <class Function, class State> typename function_input_iterator<Function, State> make_function_input_iterator(Function & f); should be replaced by: template <class Function, class State> typename function_input_iterator<Function, State> make_function_input_iterator(Function & f, State state); Thanks, -Gabe [1] http://www.boost.org/doc/libs/1_50_0/libs/iterator/doc/function_input_itera…

2 2

[type_erasure] Review ends today Aug 3, 2012
by Lorenzo Caminiti 03 Aug '12

03 Aug '12

Hello all, *** The review of Boost.TypeErasure ends today Aug 3, 2012. If you are planning to submit a review, please do so by the end of today. *** Thank you to all that have participated to the review so far. The review manager, --Lorenzo On Jul 27, 2012 1:41 PM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> wrote: > Hello all, > > After consulting the review wizards and Steven, I am extending > Boost.TypeErasure review of one week, until August 3, 2012. > > Thank you to all that have submitted a review already and I am looking > forward to receiving additional submissions. > > The review manager, > --Lorenzo > On Jul 27, 2012 3:22 AM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> > wrote: > >> Hello all, >> >> On Mon, Jul 23, 2012 at 9:09 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> >> wrote: >> > On Wed, Jul 18, 2012 at 1:13 AM, Lorenzo Caminiti < >> lorcaminiti(a)gmail.com> wrote: >> >> *** The review of Steven Watanabe's proposed Boost.TypeErasure library >> >> begins on July 18, 2012 and ends on July 27, 2012. *** >> > >> > *** Boost.TypeErasure review ends in 5 days. Please submit your reviews >> :D *** >> >> *** Boost.TypeErasure review ends today July 27, 2012. If you are >> planning to submit a review, please do so as soon as possible. *** >> >> Thank you to everyone who has commented on the library and submitted a >> review so far! >> >> The review manager, >> --Lorenzo >> P.S. I am considering extending the review until end of day Sunday >> July 29, 2012... I will keep you posted. >> >> > There have been interesting discussions on the library on the ML but I >> > have not received any official review yet :( Especially if you are a >> > user of Boost Any, Function, and Any Iterator, you definitely want to >> > take a look at Type Erasure as it generalizes solutions provided by >> > those other libraries. >> > >> > Thank you. >> > >> > The review manager. >> > --Lorenzo >> > >> >> THE LIBRARY >> >> >> >> C++ provides runtime polymorphism through virtual functions. They are >> >> a very useful feature, but they do have some limitations. >> >> * They are intrusive. In generic programming, we can design an >> >> interface which allows third-party types to be adapted to it. >> >> * They require dynamic memory management. Of course, most of the >> >> problems can be avoided by using an appropriate smart pointer type. >> >> Even so, it still acts like a pointer rather than a value. >> >> * Virtual functions' ability to apply multiple independent concepts to >> >> a single object is limited. >> >> The Boost.TypeErasure library solves these problems allowing us to >> >> mirror static generic programming at runtime. >> >> >> >> Library source: >> >> http://svn.boost.org/svn/boost/sandbox/type_erasure/ >> >> >> >> Pre-built documentation: >> >> >> http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ >> >> >> >> You can also download archives with pre-built documentation from: >> >> http://sourceforge.net/projects/steven-watanabe.u/files/ >> >> >> >> YOUR REVIEW >> >> >> >> Please submit a review to the mailing-list by replying to this email >> >> ("[boost] [type_erasure] Review ..." should be in the subject). >> >> >> >> Please state clearly whether you think this library should be accepted >> >> as a Boost library. >> >> >> >> Other questions you may want to consider: >> >> 1. What is your evaluation of the design? >> >> 2. What is your evaluation of the implementation? >> >> 3. What is your evaluation of the documentation? >> >> 4. What is your evaluation of the potential usefulness of the library? >> >> 5. Did you try to use the library? With what compiler? Did you have >> >> any problems? >> >> 6. How much effort did you put into your evaluation? A glance? A >> >> quick reading? In-depth study? >> >> 7. Are you knowledgeable about the problem domain? >> >> >> >> Thanks in advance to all who participate in the review discussion -- >> >> I'm looking forward to it! >> >

1 0

1.51.0] Beta 1 release candidate 2 available
by Marshall Clow 03 Aug '12

03 Aug '12

Release candidate files for 1.51.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: e3a51b82894a67ac438eaa08192929eb *boost_1_51_0_beta1_rc2.tar.gz 1c541236f98dcaa706e7f8eabb11ebfc *boost_1_51_0_beta1_rc2.tar.bz2 964f150ce9d7bcaba74255aba73d338a *boost_1_51_0_beta1_rc2.zip e23467c3369a53189300c76e8c848aa1 *boost_1_51_0_beta1_rc2.7z Thanks to everyone who tried out rc1, and especially Neal Becker, who helped me track down a permissions error in the build process --The release managers

3 4

[forward_declare] Interest Inquiry toward Faster Compile Times
by Daniel Larimer 02 Aug '12

02 Aug '12

I have been increasingly frustrated with how long it takes to compile c++ code. After spending some time in Java and C# I can feel the pain of compile times much sharper than I use to. After seeing that Java and C# were able to achieve some level of generics without requiring 'everything in the header' and knowing that C compiles an order of magnitude faster than c++ I set about to find a way to increase my compile times. One of the common recommendations is to 'forward declare' everything and to use the PIMPL (private implementation pattern). Unfortunately, PIMPL usually implies heap allocation and if you ever want to return-by-value you are stuck including the entire header for the types you use in your header. I started inspecting some of my code and running it through the pre-processor and noticed that almost every source file was in the 50K+ lines of code post-preprocessor and that some files were north of 250K lines of code. This was ridiculously inefficient, especially because I was already using PIMPL everywhere I could and most of these lines were stl + boost. After a little bit of work I was able to abstract vector, boost::exception, iostream, string, threading, and many of the other types that I had been including that resulted in 'code-bloat'. The resultant library was able to reduce my post-preprocessor output to just one or two thousand lines of code (assuming the .cpp itself was 500+ lines). My compile times dropped to sub-second per object file from 10+ seconds (some up to 40 seconds). There are some side effects from doing this, performance in some cases was slightly slower due to one level of indirection, but with with link-time optimization this performance loss was minimized. And any loss of performance was clearly acceptable trade for the gain in development efficiency. In situations were performance really is critical I can choose to include the raw header in individual cpp files, but in most cases that level of 'optimization' is overkill. One of the things I realized doing this work was that often the only reason you need to include a header is because the compiler needs to know the SIZE of the type that you wish to forward declare and nothing else. So our development is slowed entirely due to the lack of a SINGLE NUMBER. So I created a utility that allowed me to 'forward declare' the size of the variable. This allowed me to use return by value and member variables via forward declaration WITHOUT having to resort to heap allocation. It occurred to me that a library that allowed developers to choose a little drop in runtime performance for a dramatic improvement in compile times would be generally useful to the C++ community. I have included an example of the 'technique' and general purpose utility that would allow others to quickly and easily integrate forward declaration of 'value types'. A full up boost submission would probably include pre-wrapped versions of most of the STL and Boost types.

9 24

bjam bug? Strange permission
by Neal Becker 02 Aug '12

02 Aug '12

While tracking down strange directory permissions, I noticed this: find . -name .hg -prune -o -type d $ \! -perm 755 -and \! -perm 775 $ -ls 17315044 4 drwxrw-r-- 3 nbecker nbecker 4096 Aug 2 08:41 ./bin.v2 I assume that dir was created by bjam during the test build, for some reason with strange mode.

3 4

Announce: Boost 1.50 installer for 32-bit Windows now available
by John Wiegley 01 Aug '12

01 Aug '12

With apologies to the community for not finding the time to release Windows installers for 1.48 and 1.49, we now have an installer for 1.50 available for immediate download: http://www.boostpro.com/download The version installs 32-bit libraries and/or DLLs for the following compilers: Visual C++ 8.0 (Visual Studio 2005) Visual C++ 9.0 (Visual Studio 2008) Visual C++ 10.0 (Visual Studio 2010) We are dropping support for Visual C++ 7.1 as of this time, unless someone wishes to contract us to bring it back. Also, although I have prepared a 64-bit installer, I have not yet found a solution for integrating it with the existing installer. If anyone with NSIS scripting experience would be willing to assist me, we'd be happy to provide a free installer which installs both 32-bit and 64-bit Boost libraries for applicable Windows platforms. Enjoy! -- John Wiegley BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

2 4

Re: [boost] [Boost-commit] svn:boost r79832 - trunk/tools/build/v2
by Vladimir Prus 01 Aug '12

01 Aug '12

On 01.08.2012 19:26, jurko.gospodnetic(a)docte.hr wrote: > Author: jurko > Date: 2012-08-01 11:26:26 EDT (Wed, 01 Aug 2012) > New Revision: 79832 > URL: http://svn.boost.org/trac/boost/changeset/79832 > > Log: > Boost Build cleanup - minor stylistic comment changes + better commented the project-config.jam configuration file usage. Jurko, are these reformatting changes really necessary? It sounds like it will just make it harder to update Python port when we get back to it when semester starts in September. Thanks,

1 1

Re: [boost] [Boost-commit] svn:boost r79779 - trunk/tools/build/v2/engine
by Steven Watanabe 01 Aug '12

01 Aug '12

AMDG On 07/28/2012 02:04 AM, jurko.gospodnetic(a)docte.hr wrote: > Author: jurko > Date: 2012-07-28 05:04:41 EDT (Sat, 28 Jul 2012) > New Revision: 79779 > URL: http://svn.boost.org/trac/boost/changeset/79779 > > Log: > Boost Jam version information output cleaned up a bit to make it easier to update it with additional information. /Really/? If you want some kind of key/value feature testing, it doesn't belong under the regular version flag. Please revert this. I just find it ugly. > Text files modified: > trunk/tools/build/v2/engine/jam.c | 2 ++ > 1 files changed, 2 insertions(+), 0 deletions(-) > > Modified: trunk/tools/build/v2/engine/jam.c > ============================================================================== > --- trunk/tools/build/v2/engine/jam.c (original) > +++ trunk/tools/build/v2/engine/jam.c 2012-07-28 05:04:41 EDT (Sat, 28 Jul 2012) > @@ -263,6 +263,8 @@ > { > printf( "Boost.Jam " ); > printf( "Version %s. %s.\n", VERSION, OSMINOR ); > + printf( "\n" ); > + printf( "Copyright information:\n" ); > printf( " Copyright 1993-2002 Christopher Seiwald and Perforce " > "Software, Inc.\n" ); > printf( " Copyright 2001 David Turner.\n" ); > In Christ, Steven Watanabe

1 0

[type_erasure] Review ends today July 27, 2012
by Lorenzo Caminiti 01 Aug '12

01 Aug '12

Hello all, On Mon, Jul 23, 2012 at 9:09 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: > On Wed, Jul 18, 2012 at 1:13 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: >> *** The review of Steven Watanabe's proposed Boost.TypeErasure library >> begins on July 18, 2012 and ends on July 27, 2012. *** > > *** Boost.TypeErasure review ends in 5 days. Please submit your reviews :D *** *** Boost.TypeErasure review ends today July 27, 2012. If you are planning to submit a review, please do so as soon as possible. *** Thank you to everyone who has commented on the library and submitted a review so far! The review manager, --Lorenzo P.S. I am considering extending the review until end of day Sunday July 29, 2012... I will keep you posted. > There have been interesting discussions on the library on the ML but I > have not received any official review yet :( Especially if you are a > user of Boost Any, Function, and Any Iterator, you definitely want to > take a look at Type Erasure as it generalizes solutions provided by > those other libraries. > > Thank you. > > The review manager. > --Lorenzo > >> THE LIBRARY >> >> C++ provides runtime polymorphism through virtual functions. They are >> a very useful feature, but they do have some limitations. >> * They are intrusive. In generic programming, we can design an >> interface which allows third-party types to be adapted to it. >> * They require dynamic memory management. Of course, most of the >> problems can be avoided by using an appropriate smart pointer type. >> Even so, it still acts like a pointer rather than a value. >> * Virtual functions' ability to apply multiple independent concepts to >> a single object is limited. >> The Boost.TypeErasure library solves these problems allowing us to >> mirror static generic programming at runtime. >> >> Library source: >> http://svn.boost.org/svn/boost/sandbox/type_erasure/ >> >> Pre-built documentation: >> http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ >> >> You can also download archives with pre-built documentation from: >> http://sourceforge.net/projects/steven-watanabe.u/files/ >> >> YOUR REVIEW >> >> Please submit a review to the mailing-list by replying to this email >> ("[boost] [type_erasure] Review ..." should be in the subject). >> >> Please state clearly whether you think this library should be accepted >> as a Boost library. >> >> Other questions you may want to consider: >> 1. What is your evaluation of the design? >> 2. What is your evaluation of the implementation? >> 3. What is your evaluation of the documentation? >> 4. What is your evaluation of the potential usefulness of the library? >> 5. Did you try to use the library? With what compiler? Did you have >> any problems? >> 6. How much effort did you put into your evaluation? A glance? A >> quick reading? In-depth study? >> 7. Are you knowledgeable about the problem domain? >> >> Thanks in advance to all who participate in the review discussion -- >> I'm looking forward to it!

6 7

interest in generic cyclic visitor
by Jan Herrmann 01 Aug '12

01 Aug '12

Hello, I have an implementation of generic cyclic visitor. It is available at https://github.com/janherrmann/visitor . With my implementation it is possible to create non-member, non-friend templates which behave like virtual functions. Additionally it can be used as a base for multimethod implementation. Moreover it can be used to build a extensible type information system. All test cases compile with msvc-10.0 and gcc-mingw-4.6.2. Is there need for such a library? Jan Herrmann

1 0

Review Request: Endian
by David Stone 01 Aug '12

01 Aug '12

A few months back I posted a proposal for an endian conversion library: http://lists.boost.org/Archives/boost/2012/04/191931.php I believe my library is now in a finished state, and I would like to have it considered for inclusion into Boost. A zip file containing everything can be found here: https://bitbucket.org/davidstone/endian/get/tip.zip or you can just browse the repository here: https://bitbucket.org/davidstone/endian/ The only file that users need to be concerned with is endian.hpp. endian.cpp contains performance + correctness tests, and example.cpp is a very short example program on how to use the library that opens up a file, reads in a number that was written in big-endian format, and prints it to the user's screen in host format. There is no special compiling / linking instructions (people who wish to test the program can simply compile endian.cpp). Included is a SCons script that allows easy compilation with gcc or clang with many warnings + optimizations turned on. My programs all compile cleanly at very high warning levels in these compilers because I know many users compile their own projects at such a setting, and I don't want a library file causing noise. I included the documentation in index.html, but I'm not quite sure on how to correctly format things.

3 2