April 2014 - Boost - lists.preview.boost.org

Can't compile valarray.cpp - any ideas why?
by Chris Cooper 23 Apr '14

23 Apr '14

On my Mac (OSX 10.9.2, running clang++ "Apple LLVM version 5.1 (clang-503.0.38) (based on LLVM 3.4svn)”), I can’t get the libs/accumulators/test/valarray.cpp regression test to compile. The error it gives is of course lengthy, but goes something like this: In file included from valarray.cpp:18: ../../../boost/accumulators/statistics/weighted_mean.hpp:73:13: error: no matching constructor for initialization of 'result_type' (aka 'valarray<typename divides<left_value_type, const double>::result_type>') : mean( ../../../boost/accumulators/framework/depends_on.hpp:319:17: note: in instantiation of function template specialization 'boost::accumulators::impl::immediate_weighted_mean_impl<SNIP>' requested here : Accumulator(args) ../../../boost/accumulators/framework/depends_on.hpp:252:29: note: in instantiation of function template specialization 'boost::accumulators::detail::accumulator_wrapper<SNIP>' requested here return type(args, next_build_acc_list::call(args, fusion::next(f), l)); ../../../boost/accumulators/framework/depends_on.hpp:252:56: note: in instantiation of function template specialization 'boost::accumulators::detail::build_acc_list<SNIP>' requested here return type(args, next_build_acc_list::call(args, fusion::next(f), l)); ../../../boost/accumulators/framework/depends_on.hpp:271:51: note: in instantiation of function template specialization 'boost::accumulators::detail::build_acc_list<SNIP>' requested here return meta::make_acc_list<Sequence>::call(args, fusion::begin(seq), fusion::end(seq)); ../../../boost/accumulators/framework/accumulator_set.hpp:159:21: note: in instantiation of function template specialization 'boost::accumulators::detail::make_acc_list<SNIP>' requested here detail::make_acc_list( valarray.cpp:150:78: note: in instantiation of function template specialization 'boost::accumulators::accumulator_set<SNIP>' requested here /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/../lib/c++/v1/valarray:806:5: note: candidate constructor not viable: no known conversion from 'typename result<SNIP>' to 'const std::__1::valarray<double>' for 1st argument valarray(const valarray& __v); That last little bit makes it look like “result_type mean” is of type valarray<double> and boost is trying to pass a valarray<int> into its copy constructor and not succeeding. I’ve narrowed down the offending code (in valarray.cpp) and this is the code that won’t compile: typedef std::valarray<int> sample_t; typedef boost::accumulators::stats<boost::accumulators::tag::weighted_mean(boost::accumulators::immediate)> mystats; boost::accumulators::accumulator_set<sample_t, mystats, int> acc2; Which is basically the same as: sample_t s; typedef boost::numeric::functional::multiplies<sample_t, int>::result_type weighted_sample; typedef boost::numeric::functional::fdiv<weighted_sample, int>::result_type result_type; result_type mean(s); which also doesn’t compile and gives a pretty-much-identical error message. I’m completely unfamiliar with the boost accumulators code, any suggestions on why this is failing, and what I can do to patch valarray.cpp so the regression test will compile? Thanks, Chris

1 0

[Git] Are past releases tagged somehow?
by John Maddock 23 Apr '14

23 Apr '14

Is there a way to identify and checkout past releases from Git? I couldn't find anything on the Wiki? Thanks, John.

4 3

[container] pull request for fixing propagate_on_container_move_assignment (add ::value)
by Ben Pope 23 Apr '14

23 Apr '14

I noticed that this was only just changed, but hey ho. https://github.com/boostorg/container/pull/1 Ben

1 0

[GSoC] A C++11 enabled TMP library (accepted)
by Louis Dionne 23 Apr '14

23 Apr '14

Dear community, I am pleased to announce that my proposal named "A C++11 template metaprogramming library"[1] was accepted for GSoC 2014. I want to thank the community for putting trust in the proposal, and I am committed to do everything I can to make this project succeed. As explained in my proposal, the goal of the project is to build a high quality template metaprogramming library using modern techniques to achieve both higher expressiveness and lower compilation times. Since the ultimate goal is to make such a library part of the Boost distribution, I will try to involve the community and maintain a tight feedback loop. With your support, I am confident that we can achieve a lot in the direction of better template metaprogramming. This is also a good time to mention (advertise?) that I will be presenting the project at the upcoming C++Now conference. :-) I am knee-deep in my finals right now, but updates should come shortly. Stay tuned! Louis Dionne [1]: http://goo.gl/ZlYeFi

4 5

[assign] [tokenizer] Please pull two trivial patches
by Gregor Jasny 23 Apr '14

23 Apr '14

Hello, since four months two trivial patches to replace a plain throw with BOOST_THROW_EXCEPTION sit in the trac and github (as pull requests). Could anyone please review and submit them? I'd like to see them in the next release or the one after. #9504 - https://github.com/boostorg/assign/pull/1 #9505 - https://github.com/boostorg/tokenizer/pull/1 Thanks, Gregor

1 0

[utility] Pull request: Use an unsigned type as an intermediate result instead of left shifting a negative integral constant
by Ben Pope 22 Apr '14

22 Apr '14

https://github.com/boostorg/utility/pull/4 No maintainer listed in maintainers.txt so cross posting this one. Ben

4 5

[gsoc2014] This year's students announced
by Niall Douglas 22 Apr '14

22 Apr '14

Dear Boost, We are pleased to announce that the following eight students will be this year's Google Summer of Code for 2014: 1. Anton Bikineev Mentor: Christopher Kormanyos Topic:Boost.Math Generalized Hypergeometric Functions 2. Ian Forbes Mentor: Tim Blechmann Topic: Boost.Thread Scheduled Executors 3. Louis Dionne Mentor: Joel Falcou Topic: A C++11 template metaprogramming library 4. Mark Lingle Mentor: David Bellot Topic: Boost.uBlas: Optimization via Smart Templating and a Tree Optimizer class 5. Roshan Mentor: Kyle Lutz Topic: Expand and Improve Boost.Compute 6. Saksham Maheshwari Mentor: Stefan Seefeld Topic: Boost.XML - A Standard XML Library 7. Thaler Benedek Mentor: Vicente J. Botet Escriba Topic: Boost.Pipeline 8. Vinícius dos Santos Oliveira Mentor: Bjorn Reese Topic: HTTP server on Boost At US$5,000 funding per student, this represents an investment of US$40,000 into Boost by Google this year, for which we are extremely grateful. Our thanks to everyone in Google who makes this happen every year. With so few slots available from Google some very good candidates and proposals could not be selected, so if you were not selected this year, better luck next year (remember to come early!). Congratulations to the students who did make it, and our collective thanks go to the primary mentors above for taking the time this summer, as well to the secondary mentors not listed above as well as everyone who helped out with the proposal review and the ranking and voting this year. Niall & Boris --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

8 7

Strange use of random values in regression test ...
by Chris Cooper 21 Apr '14

21 Apr '14

The test_main() of libs/utility/operators_test.cpp loops 1000 times, running a variety of tests on random values. However, since the randomizer (boost::minstd_rand) is instantiated inside the loop, it appears that the randomizer is re-seeded for each loop, meaning it runs the test 1000x with the exact same values each time. I’m not 100% familiar with the boost random value generators, am I missing something? Or should the boost::minstd_rand be instantiated outside the loop? I’m happy to add this as a boost bug if my understanding is correct … Thanks, Chris

2 1

[type traits] has_complement, enum class, and gcc 4.9
by Nevin Liber 21 Apr '14

21 Apr '14

We are seeing build problems with gcc 4.9 RC1 and Boost 1.55. Given the following test program: #include <boost/type_traits.hpp> #include <iostream> enum class E {}; int main() { std::cout << boost::has_complement<E>() << std::endl; } Using g++ -std=c++11, we get: In file included from */opt/local/include/boost/config.hpp:57:0*, from */opt/local/include/boost/type_traits/add_const.hpp:13*, from */opt/local/include/boost/type_traits.hpp:13*, from *a.cpp:1*: /opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp: In instantiation of '*const bool boost::detail::has_complement_impl::operator_exists<E>::value*': */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:173:4:* required from '*const bool boost::detail::has_complement_impl::trait_impl1<E, boost::detail::has_complement_impl::dont_care, false>::value*' */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:195:4:* required from '*const bool boost::detail::has_complement_impl::trait_impl<E, boost::detail::has_complement_impl::dont_care>::value*' */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:202:1:* required from '*struct boost::has_complement<E>*' *a.cpp:7:41:* required from here */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:152:56:* *error: *no match for '*operator~*' (operand type is '*E*') BOOST_STATIC_CONSTANT(bool, value = (sizeof(check(((BOOST_TT_TRAIT_OP make<Rhs>()),make<has_operator>())))==sizeof(::boost::type_traits::yes_type))); * ^* /opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp: In instantiation of '*const bool boost::detail::has_complement_impl::operator_returns_void<E>::value*': */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:173:4:* required from '*const bool boost::detail::has_complement_impl::trait_impl1<E, boost::detail::has_complement_impl::dont_care, false>::value*' */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:195:4:* required from '*const bool boost::detail::has_complement_impl::trait_impl<E, boost::detail::has_complement_impl::dont_care>::value*' */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:202:1:* required from '*struct boost::has_complement<E>*' *a.cpp:7:41:* required from here */opt/local/include/boost/type_traits/detail/has_prefix_operator.hpp:89:102:* *error: *no match for '*operator~*' (operand type is '*E*') BOOST_STATIC_CONSTANT(bool, value = (sizeof(::boost::type_traits::yes_type)==sizeof(returns_void((BOOST_TT_TRAIT_OP make<Rhs>(),returns_void_t()))))); * ^* *a.cpp:* In function '*int main()*': *a.cpp:7:41:* *error: *cannot bind '*std::ostream {aka std::basic_ostream<char>}*' lvalue to '*std::basic_ostream<char>&&*' { std::cout << boost::has_complement<E>() << std::endl; } * ^* In file included from */opt/local/include/gcc49/c++/istream:39:0*, from */opt/local/include/gcc49/c++/sstream:38*, from */opt/local/include/gcc49/c++/complex:45*, from */opt/local/include/boost/type_traits/is_complex.hpp:12*, from */opt/local/include/boost/type_traits.hpp:49*, from *a.cpp:1*: */opt/local/include/gcc49/c++/ostream:602:5:* *note: *initializing argument 1 of '*std::basic_ostream<_CharT, _Traits>& std::operator<<(std::basic_ostream<_CharT, _Traits>&&, const _Tp&) [with _CharT = char; _Traits = std::char_traits<char>; _Tp = boost::has_complement<E>]*' operator<<(basic_ostream<_CharT, _Traits>&& __os, const _Tp& __x) * ^* It compiles fine under gcc 4.7.2 and clang 3.4. It also compiles fine for plain enums. Any ideas? -- Nevin ":-)" Liber <mailto:nevin@eviloverlord.com> (847) 691-1404

2 2

Corruption in container::string when used with boost::interprocess
by Lars Hagström 21 Apr '14

21 Apr '14

Found this bug recently, but since theres been no activity on it on Trac I'm double-posting here. https://svn.boost.org/trac/boost/ticket/9855 Cheers Lars

2 1

Boost.Align review begins today
by Ahmed Charles 21 Apr '14

21 Apr '14

Hi all, The review of Boost.Align by Glen Fernandes commences today, Friday, 11 April, and concludes Sunday, 20 April. Boost.Align provides: 1. Function align() to align a pointer, for implementations which do not provide C++11's std::align(). 2. Functions aligned_alloc() and aligned_free() for dynamic allocation with specified alignment. { For use in place of ::operator new() and ::operator delete(). } 3. Class template aligned_allocator as an alignment-aware allocator that also allows specifying a minimum alignment. { For use in place of std::allocator. } 4. Class template aligned_allocator_adaptor to turn any existing allocator into an alignment-aware allocator that also allows specifying a minimum alignment. { For use in place of any existing allocator type. } 5. Function is_aligned() to test the alignment of a pointer. Rationale: C++11 added the ability to specify increased alignment (over-alignment) for class types. Unfortunately, ::operator new allocation functions, new expressions, and the default allocator, std::allocator, do not support dynamic memory allocation of over-aligned data. Notes: This library also meets needs in existing Boost libraries. - Boost.Smart_Ptr has its own implementation of align(). - Boost.Interprocess and Boost.Log each have their own implementation of aligned_alloc() and aligned_free(). Source: doc: http://glenfe.github.io/align git: http://github.com/glenfe/align zip: http://github.com/glenfe/align/archive/master.zip Please always state in your review whether you think the library should be accepted as a Boost library. Additionally, please consider giving feedback on the following general topics: - 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? Ahmed Charles Review Manager

10 26

Boost.Align review results
by Ahmed Charles 21 Apr '14

21 Apr '14

The review of the proposed Boost.Align library ended on April 20, 2014. The result is: Accepted with conditions. Glen and I would like to thank everyone for contributing to the review for Boost.Align. either with a review or comments in the discussions. The summary of formal votes is as follows (alphabetical order): Andrey Semashev - Yes (conditional) Antony Polukhin - Yes (conditional) Bjorn Reese - Yes Lars Viklund - Yes Michael Spencer - Yes For a total of 5 votes for acceptance and 0 votes for rejection. The conditional acceptance is based on the quality of documentation, as the feedback given on code and design has already been addressed. The conditions below are agreeable to the author: 1. QuickBook documentation should be used, following typical Boost documentation structure. 2. Additional examples should be used to make the understanding/use of the library easier. 3. Additional minor comments from the reviews should be addressed. I would like to thank Glen for making this an easy first review manager experience and I look forward to reviewing other libraries in the future.

2 1

Application need a Review Manager. Anyone is interested?
by Renato Forti 21 Apr '14

21 Apr '14

>> So do a ton of other libraries waiting in the review queue. >> One trend I've noticed in recent reviews is that the libraries which find review managers are small, sometimes very small. It might be worth breaking up Application into smaller libraries if you want a faster review. I think that I can split it. >> Equally, AFIO has 1000 active lines of code, and I very much doubt it'll see a review manager any time soon. I'm thinking maybe next year it might >> (I will speak at C++ Now introducing the session on the Future of Boost, which will mention AFIO :) ). Nice! I will check! >> FYI, I'd just love if Application's design rationale told me why and how it's similar or different to Boost.Process. Process is one of the most popular non-official Boost libraries out there. Well, I think that are totally different. Quick, Boost.Process is used to start a new process, Boost.Application is the process in fact. Boost.Application provides a model/environment to build any application, not start an application. Some features are: With it you can deploy your application as server (service on windows, and daemon on unix). It provides a plug-in system tool and other facilities (like aspects) that will help developer on application development. It provides a way to create other applications modes, e.g. Apache http server module. Some references: http://www.codeproject.com/Articles/756866/Build-a-Server-Application-using… http://www.codeproject.com/Articles/695937/Creating-a-New-Application-Mode Thanks alot for your comments.

4 4

GSoC 2014 - Functional - Monad
by Ding Xiangfei 19 Apr '14

19 Apr '14

Hello, Boost. This is Xiangfei, a first year CS student from National University of Sinagpore. I am familiar with C++ template programming and have learnt a little functional programming language by myself. Therefore I find the monad project in boost will be very interesting and useful. This is my first time applying for GSoC. I have past boost use experience, but it is my first time also to contribute in Boost library. I have a question for the implementation of monad. What is the degree of integration of this module with other Boost utilities other than sequences and containers? Thank you. Regards, Xiangfei

2 10

Re: [boost] [serialization] proposed improvements: forward-compatibility of serialization
by Brian Wood 18 Apr '14

18 Apr '14

On Fri, Apr 18, 2014 at 10:52 AM, Robert Ramey < robertmacleranramey(a)gmail.com> wrote: > > > On Friday, April 18, 2014 6:40:32 AM UTC-7, Brian Wood wrote: >> >> niXman writes: >> >> > Hi, >> > >> > YAS(https://github.com/niXman/yas) ? >> >> The test results on your page are impressive, but there's >> not much info on what or how you tested. Please give >> some more info on that. >> > > Looks like the YAS version uses a special mem_ostream/mem_istream classes > rather than std::strstream. Since the largest part of any of these > benchmarks is spent on the i/o part this would account for a huge > difference. > > >> >> Also it looks to me like the results you list for text >> serialization are off by a factor of ten. >> > > This is common when the benchmark is compiled in debug mode. The boost > serialization library has a huge amount of extra checking in debug mode > which generally slows things down by a factor of 10. I don't know if > that's the case here though. > > He has this table: | boost | YAS | +------+---------+---------+---------+ | save | 8090 ms | 277 ms | +28000% | +------+---------+---------+---------+ | load | 8794 ms | 265 ms | +33000% | +------------------------------------+ I think the last column is off. It should be +2800% and +3300%. Personally I wouldn't use the percents and would use 28 and 33. -- Brian Ebenezer Enterprises - Heavenly code. http://webEbenezer.net

1 0

Re: [boost] [serialization] proposed improvements: forward-compatibility of serialization
by Brian Wood 18 Apr '14

18 Apr '14

niXman writes: > Hi, > > YAS(https://github.com/niXman/yas) ? The test results on your page are impressive, but there's not much info on what or how you tested. Please give some more info on that. Also it looks to me like the results you list for text serialization are off by a factor of ten. -- Brian Ebenezer Enterprises - So far G-d has helped us. http://webEbenezer.net

1 0

[phoenix] Test failures on clang
by Andrey Semashev 18 Apr '14

18 Apr '14

Hi, I'm seeing Boost.Log test failures on clang. The errors come from Boost.Phoenix/Boost.Proto: http://www.boost.org/development/tests/develop/developer/output/marshall-ma… It seems like actor assignment operator got broken recently.

2 1

Benchmarks comparing JSON libraries - including JSon Spirit
by Klaim - Joël Lamotte 17 Apr '14

17 Apr '14

http://blog.thousandeyes.com/efficiency-comparison-c-json-libraries/ I think this benchmark (with sources) might interest people who were recently planning to make an official Boost library for JSON parsing. In particular, this benchmark include JSon Spirit which is based on Boost Spirit. These benchmark might be useful for future tests.

4 5

Help with a shared_ptr problem on Android (ARM)
by Peter Dimov 17 Apr '14

17 Apr '14

https://svn.boost.org/trac/boost/ticket/9912 reports that spinlock_gcc_arm.hpp segfaults on a Nexus 7. Unfortunately, I know next to nothing about ARM or Android, so I wonder if someone can help with that.

3 4

Application : Question about Review/Review Manager
by Renato Forti 17 Apr '14

17 Apr '14

Hi All, The proposed Boost.Application is on review schedule. http://www.boost.org/community/review_schedule.html I have one question! How get a Review Manager? Anyone can help in this process? How this work? Thanks

2 1

[algorithm] Split that appends
by Sebastian Karlsson 17 Apr '14

17 Apr '14

First of all I think it's a bit unintuitive that boost::algorithm::split swaps with target, I would've assumed it appended. The fact that it in effect clears target makes it cumbersome to incrementally split into a destination, as you need a new temporary for every call to split, and then explicitly transfer everything over to your final destination. The docs do mention the behavior as a note ( which I presume is precisely because it's a bit unintuitive ). My question then naturally becomes why does split behave like this? As changing the behavior would be a breaking change, do you think it would be unreasonable to have a split_append? Kind regards, Sebastian Karlsson

5 5

[property_tree] xml_parser::read_xml() and write_xml() are limited to std::string keys
by Alexander Bogdashevsky 17 Apr '14

17 Apr '14

boost::property_tree::xml_parser and json_parser are hardcoded to work only with keys of std::string type. The following code will fail to compile: boost::property_tree::basic_ptree<boost::container::string, boost::container::string> pt; std::string filename("123.xml"); boost::property_tree:xml_parser::read_xml(filename, pt); I have prepared a patch that removes this limitation. Please consider pulling https://github.com/sanderbog/property_tree/commit/8af8b6bf3b65fa59792d849b5… Kind Regards, Alexander Bogdashevsky

1 0

[math] & [random] distribution object compatibility
by Thijs van den Berg 16 Apr '14

16 Apr '14

Boost [random] has probability distribution objects for drawing random samples of those distributions. Boost [math] also has probability distributions, those provide free functions for computing properties of the distributions, like mean, pdf etc. I like the free function design of math variant e.g. it uses pdf(distribution,x) and I was wondering why this hasn’t been adopt in C++11 for <random>? To me a free function syntax like random(distribution,engine) would make sense. It would align with the fact that C++11 has added begin(container) and end(container) free functions. I think it’s a bit inconvenient to have two libs that both contain probability distributions. Especially since I’m hoping that boost/math would some day en up in the standard? One way we could integrate the two libs is by adding a random(distribution,engine) free function to the math lib which would accept both distribution objects from the random lib and the math lib. This however could stimulate users in writing less C++11 portable code. My questions are: * Why wasn’t the free function syntax adopted in C++11? Perhaps because of performance options? * Is there an effort to integrate the distributions in math and random within boost? * Are there concrete plans to add elements of math to the C++ standard? We already have <random> now, I would love more.

3 5

clang++ isn't getting the BOOST_NO_CXX11_HDR_FUNCTIONAL flag that it needs
by Chris Cooper 16 Apr '14

16 Apr '14

Trying to build & run the regression tests for boost 1.55 on my Mac using the clang++ that comes with Xcode 5.1 ("Apple LLVM version 5.1 (clang-503.0.38) (based on LLVM 3.4svn)”), it can’t build config_test.cpp because BOOST_NO_CXX11_HDR_FUNCTIONAL isn’t set, and libs/config/test/boost_no_ccx_hdr_functional.ipp definitely doesn’t build (after renaming it to .cpp of course). If I set CXXFLAGS to "-std=c++11 -stdlib=libc++” everything is fine, but I also need a build of boost that _doesn’t_ use c++11, and it’s the non-c++-11 version that is failing. I can get around this by manually setting CXXFLAGS to “-DBOOST_NO_CXX11_HDR_FUNCTIONAL” but it seems like the correct way to do this is to add a test to boost/config/compiler/clang.hpp that tests … something… and then sets BOOST_NO_CXX11_HDR_FUNCTIONAL if appropriate. 1. Would you agree that’s the right place to set BOOST_NO_CXX11_HDR_FUNCTIONAL (when appropriate)? 2. Any suggestions on the correct test to determine whether BOOST_NO_CXX11_HDR_FUNCTIONAL is needed? It looks like the _has_feature() macro is the preferred method, but I can’t figure out which feature to check for … Thanks, Chris p.s. The text of the 3 errors (when trying to compile boost_no_cxx_hdr_functional) is exceedingly lengthy, but to summarize: usr/bin/../lib/c++/v1/__functional_base_03:962:22: error: no matching function for call to '__invoke' typedef decltype(__invoke(_VSTD::declval<_Fp>())) type; usr/bin/../lib/c++/v1/__config:496:32: note: expanded from macro 'decltype' #define decltype(x) __typeof__(x) usr/bin/../lib/c++/v1/__functional_base_03:1019:14: note: in instantiation of template class 'std::__1::__invoke_return<int &, false>' requested here typename __invoke_return<type&>::type ./boost_no_cxx_hdr_functional.ipp:22:4: note: in instantiation of template class 'std::__1::reference_wrapper<int>' requested here std::ref(i); usr/bin/../lib/c++/v1/__functional_base_03:962:22: error: no matching function for call to '__invoke' typedef decltype(__invoke(_VSTD::declval<_Fp>())) type; usr/bin/../lib/c++/v1/__config:496:32: note: expanded from macro 'decltype' #define decltype(x) __typeof__(x) usr/bin/../lib/c++/v1/__functional_base_03:1019:14: note: in instantiation of template class 'std::__1::__invoke_return<const int &, false>' requested here typename __invoke_return<type&>::type ./boost_no_cxx_hdr_functional.ipp:23:4: note: in instantiation of template class 'std::__1::reference_wrapper<const int>' requested here std::cref(i); ./boost_no_cxx_hdr_functional.ipp:36:9: error: no member named 'bind' in namespace 'std'; did you mean 'find'? std::bind(f, std::placeholders::_1, 0.0f);

3 2

[GIT] Access
by Artyom Beilis 16 Apr '14

16 Apr '14

I hadn't committed changes for a while. >From what I've read in the mailing list there was a move to GIT and svn was closed. However I can't find information on the GIT at the boost site. Are we still using SVN? Artyom Beilis -------------- CppCMS - C++ Web Framework: http://cppcms.com/ CppDB - C++ SQL Connectivity: http://cppcms.com/sql/cppdb/

3 2

Re: [boost] -serialization- segfault on startup
by Biddiscombe, John A. 16 Apr '14

16 Apr '14

Andrey Thanks for the info. I purged every stray lib I could find - double checked all ld_library_path entries and discovered there was a shared lib from a previous build on my path which was almost certainly the culprit in this case. However, now the filesystem error has gone and I'm left with a very similar one which previously was bothering me from boost.serialization. This one I can't make disappear by cleaning paths because there's nothing bad left that might be a problem. I tried this time with boost_1.54 just to see if anything changed. does this stack trace look familiar to anyone? thanks JB #0 0x00000080a0b272f4 in ._dl_fixup () from /lib64/ld64.so.1 #1 0x00000080a0b2fd78 in ._dl_runtime_resolve () from /lib64/ld64.so.1 #2 0x00000fffb689869c in ._ZN5boost13serialization9singletonINS_7archive6detail22archive_serializer_mapIN3hpx4util24portable_binary_oarchiveEEEE12get_instanceEv () at /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_54_0/include/boost-1_54/boost/serialization/singleton.hpp:128 #3 0x00000fffb3a93008 in ._Z41__static_initialization_and_destruction_0ii () at /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_54_0/include/boost-1_54/boost/serialization/singleton.hpp:149 #4 0x00000fffb3a93064 in ._GLOBAL__sub_I_portable_binary_oarchive.cpp () at /gpfs/bbp.cscs.ch/home/biddisco/src/hpx/src/util/portable_binary_oarchive.cpp:207 #5 0x00000fffb3a969f8 in .__do_global_ctors_aux () from /gpfs/bbp.cscs.ch/home/biddisco/bgas/gcc/build/hpx/lib/hpx/libhpx_serializationd.so.0 #6 0x00000fffb3a89ae4 in ._init () from /gpfs/bbp.cscs.ch/home/biddisco/bgas/gcc/build/hpx/lib/hpx/libhpx_serializationd.so.0 #7 0x00000080a0b27bf0 in ._dl_init_internal () from /lib64/ld64.so.1 #8 0x00000080a0b154dc in ._dl_start_user () from /lib64/ld64.so.1

1 0

filesystem segfault on startup
by Biddiscombe, John A. 16 Apr '14

16 Apr '14

I’m using a BGQ machine and have compiled boost 1_55 using gcc4.8.2, the application I am testing does not use filesystem itself, but the libraries it pulls in do. On startup I have segfaults with a stack trace like this (below) Can anyone tell what is going wrong (lots of locale related problems on this machine it seems). I have no knowledge of boost.filesystem internals and I would like to work around this if possible. Thanks JB #0 0x00000080a0b272f4 in ._dl_fixup () from /lib64/ld64.so.1 #1 0x00000080a0b2fd78 in ._dl_runtime_resolve () from /lib64/ld64.so.1 #2 0x00000fffb6ef9384 in ._ZN5boost10filesystem18directory_iteratorC1Ev () at /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/include/boost/filesystem/operations.hpp:676 #3 0x00000fffb3aace44 in ._Z41__static_initialization_and_destruction_0ii () at libs/filesystem/src/operations.cpp:248 #4 0x00000fffb3aacf2c in ._GLOBAL__sub_I_operations.cpp () at libs/filesystem/src/operations.cpp:2230 #5 0x00000fffb3ab8a78 in .__do_global_ctors_aux () from /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/lib/libboost_filesystem.so.1.55.0 #6 0x00000fffb3aa32e4 in ._init () from /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/lib/libboost_filesystem.so.1.55.0 #7 0x00000080a0b27bf0 in ._dl_init_internal () from /lib64/ld64.so.1 #8 0x00000080a0b154dc in ._dl_start_user () from /lib64/ld64.so.1

2 1

filesystem segfault on startup
by Biddiscombe, John A. 16 Apr '14

16 Apr '14

I'm using a BGQ machine and have compiled boost 1_55 using gcc4.8.2, the application I am testing does not use filesystem itself, but the libraries it pulls in do. On startup I have segfaults with a stack trace like this (below) Can anyone tell what is going wrong (lots of locale related problems on this machine it seems). I have no knowledge of boost.filesystem internals and I would like to work around this if possible. Thanks JB #0 0x00000080a0b272f4 in ._dl_fixup () from /lib64/ld64.so.1 #1 0x00000080a0b2fd78 in ._dl_runtime_resolve () from /lib64/ld64.so.1 #2 0x00000fffb6ef9384 in ._ZN5boost10filesystem18directory_iteratorC1Ev () at /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/include/boost/filesystem/operations.hpp:676 #3 0x00000fffb3aace44 in ._Z41__static_initialization_and_destruction_0ii () at libs/filesystem/src/operations.cpp:248 #4 0x00000fffb3aacf2c in ._GLOBAL__sub_I_operations.cpp () at libs/filesystem/src/operations.cpp:2230 #5 0x00000fffb3ab8a78 in .__do_global_ctors_aux () from /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/lib/libboost_filesystem.so.1.55.0 #6 0x00000fffb3aa32e4 in ._init () from /gpfs/bbp.cscs.ch/home/biddisco/apps/gcc-4.8.2/boost_1_55_0/lib/libboost_filesystem.so.1.55.0 #7 0x00000080a0b27bf0 in ._dl_init_internal () from /lib64/ld64.so.1 #8 0x00000080a0b154dc in ._dl_start_user () from /lib64/ld64.so.1 -- John Biddiscombe, email:biddisco @.at.@ cscs.ch http://www.cscs.ch/ CSCS, Swiss National Supercomputing Centre | Tel: +41 (91) 610.82.07 Via Trevano 131, 6900 Lugano, Switzerland | Fax: +41 (91) 610.82.82

1 0

[align] Review.
by Mostafa 15 Apr '14

15 Apr '14

For easier tracking by the Review Manager I am going to break up my review into multiple parts which will be top-level responses to this post.

3 10

[algorithm] any_of does not call std::find - bad performance
by Albert Yiamakis 15 Apr '14

15 Apr '14

Hello, Is there a particular reason why Boost.Algorithm's any_of does not call std::find? I have devised a simple benchmark that shows it to perform much worse (compiling with gcc): http://pastebin.com/nrgtTfPX boost::find is almost as fast as std::find - no surprises, as it calls it. any_of is considerably slower, whatever the optimization level. I have not dug in the implementation of std::find to determine why; perhaps the compiler recognizes this is a sorted range, perhaps it's even capable of doing the calculation at compile time. Whatever the case however, surely any_of should also call std::find to reap the same benefits? Albert

1 2

Re: [boost] [serialization] proposed improvements: forward-compatibility of serialization
by Andrzej Horoszczak 15 Apr '14

15 Apr '14

-------- Original Message -------- > From: Sohail Somani <sohail(a)taggedtype.net> > > This was a problem that interested me a few years ago so I made a > solution that worked with any archive and I presented it at BoostCon > (now CppNow). It was inefficient, hacky and required no modifications to > existing archives but forward compatibility did work so I know it is > completely possible. Do you have a specific link handy ? or do you perhaps remember project name so I could google it? > >My immediate question would be whether you already have released code >for the products in question which complicates things a bit. Fortunately we still have about 4-6 weeks before general release (-; > The proposal itself doesn't seem impossible, at a > glance. Thanks - that's promising (-; I believe that this approach should be more efficient and more elegant that Google's Protocol Buffers. And for us minimizing network traffic is of paramount importance. Andrew _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

[serialization] proposed improvements: forward-compatibility of serialization
by Andrzej Horoszczak 15 Apr '14

15 Apr '14

Hello Everybody, (it seems that my previous post had contained only title - so I repeat the full posting below) We've started (again) using boost::serialization in our multi-platform distributed application about one year ago. However, we have arrived at a road block with forward-compatibility of serialization - which of major importance to us since we cannot force users to upgrade to the same/newer version of application all at the same time. Firstly, question is: perhaps you or someone that you know of - would be interested in such improvement work? We are small company rushed against some die-or-prosper deadlines - and simply do not have enough resources to do it on our own in time avialable - but we could sponsor such work. Secondly, the problem is: To avoid ambiguity I have put together the following description and our own suggestion for solution: The project requirement is centred on improving multi-version class compatibility in binary archives e.g. more flexibility in a situation when we are reading or transferring modified class in C++ code. We need to go beyond what current version of object versioning in boost offers: http://www.boost.org/doc/libs/1_55_0/libs/serialization/doc/tutorial.html#v… Specifically we need to add ability to skip reading unknown or unexpected fields in a non-XML archives we are parsing. Specific example: Version of the application (newer one) that saved the archive has the following code: struct extensionClass { std::string moreInfo; time_t date; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & moreInfo; ar & date; } } class gps_position { public: template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & degrees; ar & minutes; ar & seconds; ar & new_field } int degrees; int minutes; float seconds; extensionClass new_field; gps_position(){}; }; And now the version of the software that needs to read the archive is an older application that has the code that implements the gps_position class in the following way: class gps_position { public: template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & degrees; ar & minutes; ar & seconds; } int degrees; int minutes; float seconds; gps_position(){}; }; The purpose of the project is to gracefully allow for serialization in older version of application to continue reading the archive, by simply omitting information related to extensionClass new_field; e.g. to properly advance the read position to the beginning of next class in the archive. It is desirable to add to programming interface information that there was incompatibility detected, for further escalation to either to user interface, or higher level code logic that might decide, for instance, to change communication protocol. It is critically important for us to optimize archive size while adding this capability. We prefer to use eos::portable_iarchive which provides varinteger support for multi-OS compatibility (size of int, little vs big endian), therefore we prefer solution which would accept any archive, however, we will be ok with standard boost binary archive solution. Thirdly, the proposal is: The most promising solution that we envisage is to add recursive size information associated with the number identifying class (already placed in front of every data object). By recursive size information I mean size not in terms of bytes for raw data, but in terms of number of fields/objects in the class. The size information would than be expanded until it can be expressed in terms of C++11 standard predefined POD sizes. For instance for simple class example: class SimplePODs { uint32_t firstField, uint64_t int secondField; float thirdField; } The associated (leading) size information for the SimplePODs class is 3. Than within the class itself we already have identifiers of each field types. Since they are POD we can maintain global (and for the archive) dictionary of sizes for each identifier in this case: 4 than 8 and 4 And than it follows: class AggregateClass { SimplePODs first_field; char second_field; } In this case the size information (in the global dictionary) for identifier associated with AggregateClass is 2. Than within the class itself sizes for first_field would be 3 and for second_field it is of course 1. I believe this can be done as part of the version and object tracking process so the performance would still be high and most importantly, the incremental size overhead both in memory and in the archive will be relatively small (only one size information per each type of object contained in the archive - and no size overhead for POD fields). By the way this approach would also increase multi-OS compatibility for instance class on the source computer might be 32-bit compilation of : class CrossPlatform { int idont_care_about_size; } And during saving that field: idont_care_about_size would actually be saved and identified as uint32_t The same CrossPlatform class on destination machine would be compiled as 64-bit application - but since target int would be larger that source we can do silent promotion. Of course the other way around, we can throw exception if the actual value contained within idont_care_about_size exceeds the targets' compilation POD size. OK - I hope that my explanation is clear and I would appreciate any feedback that you might have. And finally let me state that we do greatly appreciate (and use) a lot of boost work and in particular, we consider boost.serialization approach to be probably the best possible under the current constrains of the language. Best regards, Andrew Horoszczak

6 5

[algorithm] LSD radix sort
by Jeremy Murphy 15 Apr '14

15 Apr '14

Dear community, I humbly offer you for perusal and review, LSD radix sort (and counting sort): https://github.com/jeremy-murphy/algorithm/tree/radix_sort The tests and docs are unfinished but the library code is as complete as I can manage without comment from others. The new files of interest are in include/boost/algorithm/integer_sort. I have more code with a speed test and CMake files in a separate repository: https://github.com/jeremy-murphy/integer-sort But perhaps I should move all those files into a branch off my Boost.Algorithm fork? Probably. Anyway, thanks in advance for any feedback and comments. Cheers. Jeremy

2 6

Amusing git pseudo-documentation
by Nat Goodspeed 15 Apr '14

15 Apr '14

Warning: this is not real. It just tickles me. http://git-man-page-generator.lokaltog.net/#72a7d7ff89dc3b268c857e3b2ddabff6 Apologies for the noise...

3 2

Application 0.4.6 with global_context.
by Renato Forti 15 Apr '14

15 Apr '14

Hi, thanks for your comments. >> If the main usage is likely to be 'daemonic', then Boost.Daemon would still be a good name. About the name 'application'. I chose this name because the library can support many kinds of application, see: http://www.dokfile.com/appbeta4/docs/libs/application/doc/html/boost_applic… >> From the current name, one would be unlikely to guess that it could do daemon work? The name 'Daemon' is usual in POSIX world. In Windows world the usual is 'Service'. I could call it as 'server', but it would also be wrong due to support for common application. In future the library can support other kinds of application (e.g. apache httpd modules) Thus I think that the name 'application' is more suitable. Let me know your thoughts. Thanks for help ReTF

1 0

[git] github cheat sheet
by Philippe Vaucher 15 Apr '14

15 Apr '14

Hello, I think this might be useful for many people: a list of overall tips n' tricks about github and git. https://github.com/tiimgreen/github-cheat-sheet Hope it helps, Philippe

1 0

[algorithm] Review Request: edit_distance
by Erik Erlandson 15 Apr '14

15 Apr '14

I would like to request a formal review for inclusion of the edit_distance() function. Description: The edit distance is the length of the shortest (or least-cost) edit script from one sequence to another, where an edit script is defined as a sequence of insertion, deletion and (optionally) substitution operations. The function implementing the edit distance is named edit_distance. This function will return the edit distance between two sequences, where sequences may be any valid range object supporting forward iteration. The edit_distance function will also, if requested, return the edit script. http://en.wikipedia.org/wiki/Edit_distance Documentation: http://erikerlandson.github.io/algorithm/libs/algorithm/doc/html/algorithm/… Code resides on a branch of my fork of Boost.Algorithm: https://github.com/erikerlandson/algorithm/tree/edit_distance The feature branch above includes the doc, unit tests and examples that are integrated via Jamfiles. The new dev resides specifically in this subdir: https://github.com/erikerlandson/algorithm/tree/edit_distance/sequence I have built the tests and examples on gcc and clang, with and without c++11 mode. I don't have access to a windows/MSVC build env, so I am definitely curious if it compiles properly in that env. My concept is that boost::algorithm::sequence can eventually serve as a home to additional related algorithms, for example other sequence comparison algorithms or perhaps other categories of sequence-related algorithms.

9 31

[graph] Are you interested in the Route Inspection Problems and Vehicle Routing Problems?
by Ciro Santilli 14 Apr '14

14 Apr '14

Are you interested in implementations for the following problems: - Route Inspection Problems: http://en.wikipedia.org/wiki/Route_inspection_problem - classic: find shortest path for undirected graph possibly repeating edges. O(n^3). If Eulerian path exists, it is the min. - mixed graphs. NP-complete. AKA Chinese postman problem. - k-Chinese postman problem. N postmen. - Vehicle routing problem: http://en.wikipedia.org/wiki/Vehicle_routing_problem Generalization of Route Inspection. NP-complete. Many variants: edges have one ore more weights, and multiple constraints are possible: - carrying capacity of each truck - time to travel an edge and delivery windows for each edge All of those problems have extensive literature, and obvious practical applications. Why don't you use GitHub's Issue tracker instead of the mailing list? It integrates better with the code tracking and merge requests, and is much easier to search. That would greatly reduce contribution barriers to new devs.

3 2

[variant] Why no move emulation with Boost.Move for C++03?
by Andrzej Krzemienski 14 Apr '14

14 Apr '14

Hi, I am trying to figure out what the best way to enable move semantics in Boost.Optional. I tried to pick at how Boost.Variant does it. If I understand correctly, move operations are only defined if compiler supports rvalue references. I wonder why it doesn't use Boost.Move, which would enable move semantics even for compilers w/o rvalue references. Is there any reason for this (that I should also take into account for Boost.Optional)? Regards, &rzej

7 7

Application 0.4.6 with global_context.
by Renato Forti 14 Apr '14

14 Apr '14

Hi All, I'd like to share this simple article on CP about 'Application 0.4.6'. http://www.codeproject.com/Articles/756866/Build-a-Server-Application-using… This version removes Boost.Singularity dependence and add a global context. Let me know your comments. Source: https://github.com/retf/Boost.Application ReTF

4 3

Call for Papers for Meeting C++ 2014 - one more week
by Jens Weller 13 Apr '14

13 Apr '14

Hello boost community, there is one week left to submit your talk to Meeting C++ 2014: http://meetingcpp.com/index.php/submit-your-talk.html Newsentry at Meeting C++ http://meetingcpp.com/index.php/newsreader/items/call-for-papers-one-more-w… So far 20 talks are submitted, a few of them also cover boost, most C++11/Modern C++. I also could announce the keynotes yesterday: Opening Keynote - Scott Meyers Closing Keynote - Hartmut Kaiser thanks, Jens

1 0

[BoostDocs] Need help with getting started with BoostDocs
by Andrzej Krzemienski 12 Apr '14

12 Apr '14

Hi Everyone, Perhaps someone in this list can help me generate html documentation from qbk sources. I am using MinGW on Windows and try to build the docs. I use the instructions form the following links. https://svn.boost.org/trac/boost/wiki/BoostDocs/GettingStarted http://www.boost.org/doc/libs/1_55_0/doc/html/quickbook/install.html#quickb… I am not sure if they are up to date. I downloaded all the necessary components, and when I try to run b2 on my doc folder, I get the following error messages: runtime error: file > file:///C:/_data/cpp/optional/boptional/quickbook/docbook-xsl/html/chunkfast.xsl > line 23 element variable > Recursive definition of chunks > runtime error: file > file:///C:/_data/cpp/optional/boptional/quickbook/docbook-xsl/html/chunkfast.xsl > line 32 element variable > Variable 'chunks' has not been declared. > xmlXPathCompiledEval: evaluation failed > runtime error: file > file:///C:/_data/cpp/optional/boptional/quickbook/docbook-xsl/html/chunkfast.xsl > line 32 element variable > Failed to evaluate the expression of variable 'div'. > I am not sure exactly where they are coming from. But they look like an error from the tool, rather than my qbk sources. Perhaps anyone here experienced a similar problem and knows a solution? Or perhaps there is a newer version of the instructions? Regards, &rzej

4 15

Application 0.4.6 with global_context
by Renato Forti 12 Apr '14

12 Apr '14

>> It actually provide a way to make a non-daemon application (mentionned in the part about launching the app). Yes, this is true! Officially the lib supports 2 kind (modes) of application. But user can define a new type, for sample this article, show how create a new application mode. In this case the mode is a apache httpd server module extension. http://www.codeproject.com/Articles/695937/Creating-a-New-Application-Mode

1 0

Application 0.4.6 with global_context.
by Renato Forti 12 Apr '14

12 Apr '14

>> I find the idea, to have a cross-platform way of creating daemons/services, worthwhile. >> I would like to suggest that the name be changed from Application, which is far too generic for just creating a computer program, to something more appropriate, maybe 'daemon'. Thanks for your sugestion, i will think in that. >> I have never used the Mac, but does this extend to that OS ? Yes, on mac (OSX) a daemons is generated. Thanks

1 0

Status of Boost.Test library maintenance
by Kamil Witecki 11 Apr '14

11 Apr '14

Hello, I would like to ask what is current status of Boost.Test library. Looking at Trac there is number of open issues that are pending and not much is being done about these, even patches were proposed. Is the library not maintained anymore, what would be sad, or I just got false impression? In case of former what is the process of handing over maintenance of library so that it won't become abandoned? Pozdrawiam, Kamil Witecki.

1 0

Compile-time string comparing
by Anton Bikineev 11 Apr '14

11 Apr '14

Hi all. I think it's frequently asked question. If so, I'm sorry. Is there anything feature in Boost that allows to compare strings at compile-time? I know that it is easy-implemented with generalized constant expressions, but I'm primarily interested in compatibility of compilers. Thanks.

3 3

[align] Are you rewriting history with every push?
by Mostafa 11 Apr '14

11 Apr '14

Glen, Are you rewriting history or force pushing commits to "https://github.com/glenfe/align". I have a local repo set to track your remote and every time I pull to update to your new commits I get merge conflicts. In fact a new clone shows that the history for master has only one commit, the most recent one, when it should show at least three. Can you avoid doing this in the future? Thanks, Mostafa

2 1

boost::optional -- updates for C++11 move semantics
by Diggory Hardy 10 Apr '14

10 Apr '14

Dear list, I wanted something like boost::optional, but with support for move- construction/assignment, so I went ahead and had a go at patching it. Attached is based on boost 1.49 (Ubuntu package). Could someone please review? I've not contributed to boost before. The changes at least aren't too complicated, but: 1) I'm not entirely sure if the move constructor (line 636) and swap function (line 1046) are implemented in the best way (also see line 279), 2) and I have no idea how is_[not_]reference_tag (line 486) works. 3) There should maybe also be a unit test. Of course, I am happy for my contributions to be published under the boost licence. Regards, Diggory

6 8

[Range] contains() for unsorted ranges?
by Albert Yiamakis 10 Apr '14

10 Apr '14

Hello, Wouldn't the library be well served by providing a contains() algorithm - with the same overloads/versions as find - for unsorted ranges? Surely, having to test against the range's end ruins the otherwise expressive syntax offered; especially when adaptors are involved and one has to test against the adapted range's end. Perhaps I am missing an obvious reason why not? Albert -- kojirion.github.io

4 4

[FWD: [serialization] anybody interested in freelancing? - forward-compatibility improvement needed
by Andrzej Horoszczak 10 Apr '14

10 Apr '14

1 0