- Boost - lists.preview.boost.org

[release 1.64] - BOOST_NO_CXX17_STD_APPLY missing in documentation
by Oliver Kowalke 14 Apr '17

14 Apr '17

I checkted the documentation of boost-1.64 beta2 and it seams that the documentation lost the description of BOOST_NO_CXX17_STD_APPLY. May I provide a patch that gets merged into the 1.64 release? Oliver

3 3

[config] defect macro for chrono literals
by Oliver Kowalke 14 Apr '17

14 Apr '17

boost.config defines BOOST_NO_CXX11_USER_DEFINED_LITERALS but I believe this defect macro could not be used for detecting chrono literals support. Should the new BOOST_NO_CXX14_CHRONO_LITERALS depend on the compiler or stdlib version? AFAIK chrono literals are available since gcc-4.9.3 (clang?, intel?, msvc?). Oliver

2 2

[CallableTraits] Closing the review period
by Louis Dionne 13 Apr '17

13 Apr '17

Dear Boost, The review period for CallableTraits is about to conclude (in about one hour, PST). So far, I have counted 5 formal reviews, alongside with other valuable feedback. All 5 formal reviews recommend acceptance (along with improvement suggestions, but I read none of them as being conditional). I will weight the different comments received through formal and informal reviews and come back with a decision regarding CallableTrait's inclusion in Boost by the end of next week. Thanks for everyone's involvement in the review. Louis P.S.: If you have a late review, submit it ASAP and I will consider it!

1 0

[release] 1.64.0 closed for all changes.
by Rene Rivera 13 Apr '17

13 Apr '17

The Boost 1.64.0 master branch is now closed for all changes. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

1 0

[CallableTraits] The formal review begins today
by Louis Dionne 13 Apr '17

13 Apr '17

Dear Boost community, The formal review of Barrett Adair's CallableTraits library begins today, April 3rd, and ends on April 12th. CallableTraits is a C++11 library for the inspection, synthesis, and decomposition of callable types. CallableTraits aims to be the "complete type manipulation facility for function types" mentioned in the final paragraph of C++17 proposal P0172, and removes the need for template specializations for different function signatures. You can find the documentation of the library here: http://badair.github.io/callable_traits/doc/html/index.html and the GitHub repository here: https://github.com/badair/callable_traits We encourage your participation in this review. At a minimum, kindly state: - Whether you believe the library should be accepted into Boost, and conditions for acceptance if any - Your name - Your knowledge of the problem domain You are strongly encouraged to also provide additional information: - What is your evaluation of the library's: * Design * Implementation * Documentation * Tests * Usefulness - Did you attempt to use the library? If so: * Which compiler(s)? * What was the experience? Any problems? - How much effort did you put into your evaluation of the review? We await your feedback! Regards, Louis

12 28

Formale Review: Callable Traits
by Peter Dimov 13 Apr '17

13 Apr '17

I think that the Callable Traits library should be ACCEPTED. The design of the library is sound, although I'm not fond of the ad-hoc metaprogramming part in "parameter list features". This is no fault of the author though, as without a modern type-metaprogramming library in Boost, everyone has to solve this problem in some way. Still, I think that most of these should be removed. Getting the arguments as a tuple that includes the class type as a first parameter raises the obvious question of void(foo::*)(float, char, int) -> tuple<foo&, float, char, int> void(foo::*)(float, char, int) & -> tuple<foo&, float, char, int> I understand why that is, but it still makes args lossy and the original can't be recreated from the tuple. Trailing varargs also have the same problem, as (float) and (float, ...) map to the same tuple. The obvious theoretically consistent approach here is void(foo::*)(float, char, int) -> tuple<foo, float, char, int> and void(float, ...) -> tuple<float, ct::varargs_t> which would be fully reversible but could possibly be less convenient in practice. I've a feeling that it might also be useful to provide an extractor that, for member pointers, returns just the arguments without the class. In "member qualifier features", I'm missing remove_member_cv_ref (obvious semantics) and copy_member_cv_ref (copies cv+ref from one member pointer to another.) In "member pointer features" we have the same problem in qualified_parent_class_of as in args, void(foo::*)() -> foo& void(foo::*)() & -> foo& It makes more sense for the first to yield 'foo', although this again may make the trait less convenient in practice. It would also _probably_ make sense to provide apply_qualified_member_pointer, which, given void(float) and foo const&, would yield void (foo::*)(float) const&. I did not look at the implementation. I ran the test suite on Windows under Cygwin g++ 5 in 11/14/1z, Cygwin clang 3.9 11/14/1z, msvc-14.0, msvc-14.1. The tests passed. Took a look at the tests themselves, the coverage looks excellent. The reference documentation is very good, although as already noted, it uses the terms of art "implementation defined" and "undefined behavior" incorrectly, this must be fixed. The non-reference portion is a bit thin. It would be improved considerably by presenting a few real-world use cases. All in all, a solid library that solves a real problem, even though the problem remains somewhat of a mystery for the uninitiated. :-)

4 4

Libraries and C++ compliance
by Edward Diener 12 Apr '17

12 Apr '17

I would like to ask people who present new libraries to Boost, in whatever stages they are, to please specify in the documentation to the library and/or in messages regarding the library, what level of C++ compliance is needed to use the functionality of that library. This plea is not being directed at any particular current library being mentioned by anyone on the mailing list, but is a general plea regarding developers and their efforts. I realize it is a real pain that C++ as a language, and as it continues to evolve, has a number of popular levels of C++ compliance. This is largely because C++ is offered by a number of different vendors in a number of different supported releases, each particular implementation supporting a number of levels of C++ compliance and sometimes only partially supporting a particular level of C++ compliance. But given this sometimes difficult situation I do not see it as enough for library docs/information to simply say "this library supports some-vendor/some-release" because this is actually fairly meaningless to me when I know that "some-vendor/some-release" supports a number of levels of C++ compliance through some compiler parameter ( often -std=something ). Therefore docs/information of "the library supports "some-implementation" or "the library is compliant with "more than one level of C++ compliance" tells me as much as if some one told me that the moon is yellow. So I am begging, pleading, entreating library authors to be specific about the C++ features or the C++ level of compliance needed to use their library, even if it is just a one-liner that succinctly explains what the end-user needs to know. Furthermore, for any given library could we please have specific information about what will happen if I use the library, or some feature of the library, without the desired minimum level of C++ compliance. While I would assume compile-time compiler errors as the norm another possibility, especially given the excellent support in Boost Config to compiler conformance, are more readable preprocessor errors. Finally a library might offer some level of advanced C++ compliance but fall back to a lower level if possible. Please, please library authors this is important. No end-user or tester of your library wants to spend extended time trying to figure out why some compile fails when the answer turns out simply to be one of inadequate C++ conformance level for a particular compiler implementation being used with a particular level of conformance.

13 29

Re: [boost] [proposed][histogram]
by Bjorn Reese 12 Apr '17

12 Apr '17

On 04/12/2017 11:37 AM, Hans Dembinski via Boost wrote: > The library implements a histogram class (a highly configurable policy-based template) for C++ and Python in C++11 code. Histograms are a standard tool to explore Big Data. They allow one to visualise and analyse distributions of random variables. A histogram provides a lossy compression of input data. GBytes of input can be put in a compact form which requires only a small fraction of the original memory. This makes histograms convenient for interactive data analysis and further processing. Given that the compression is lossy, I am wondering how it compares with a distribution estimator like: https://arxiv.org/abs/1507.05073v2 A common use-case when collecting numerical data is to determine the quantiles. Boost.Accumulators contains an estimator (extended_p_square) for that. The advantage of such estimators are that they execute in constant time and with constant memory usage, where the constant depends only on the required precision. PS: I am aware that this is a non-trivial question, so I do not expect an answer.

3 4

[proposed][histogram]
by Hans Dembinski 12 Apr '17

12 Apr '17

Dear Boost community, after another year of work, I hope to raise your interest once again in a much improved version of "histogram", a library proposed for inclusion in Boost. https://github.com/HDembinski/histogram http://blincubator.com/bi_library/histogram-2/?gform_post_id=1582 The library can be build either with b2 or cmake. It compiles successfully with several versions of clang and gcc and has 99 % test coverage (the remaining 1 % are basically un-hittable branches). Boost-style documentation is available. The library implements a histogram class (a highly configurable policy-based template) for C++ and Python in C++11 code. Histograms are a standard tool to explore Big Data. They allow one to visualise and analyse distributions of random variables. A histogram provides a lossy compression of input data. GBytes of input can be put in a compact form which requires only a small fraction of the original memory. This makes histograms convenient for interactive data analysis and further processing. A histogram implements a quantisation of a space of input values. The space is divided into non-overlapping cells. Instead of remembering the exact values of a tuple in that space, one just increases a counter in the corresponding cell. This is the lossy compression, you only remember the count in the cell and not the original values. There are subtleties related to the counting if you want it to be safe and efficient. The library handles this for you. The standard policy implements intelligent counters which are fast, conserve memory, and are guaranteed to not overflow or get capped (capping happens when you use floating point numbers to count, like some implementations do). This is one of the two main feature of the library. The other main feature is that the library allows you to seamlessly create one or multi-dimensional histograms using various schemes to divide the input space. A so-called axis class handles the division into cells along each dimension. There are several ways how you might want to define the cells that divide the input space, and library offers you interesting options. For example, if one of your inputs is an angle, the library provides a special axis class for periodic input values. What's new: - Static polymorphism: The original version of the library solely used dynamic polymorphism to support different axis classes. This variant still exists, but the current version also allows you to use static polymorphism, implemented internally with boost::mpl and boost::fusion. This provides a speed-boost, which makes this library faster than the open-source competitors I tested (CERN's ROOT framework, the GSL, and numpy.histogram), in addition to the enhanced flexibility. - Arbitrary-precision counters: Counter overflow is now completely avoided by switching automatically to boost::multiprecision::cpp_int when the capacity of standard integer types is exhausted. - Extensibility: The library is now much more extensible and configurable. All relevant behaviour can be exchanged by using another (possibly user-defined) policy. The library provides default trade-offs that should work for almost everybody, but you can chose your own trade-offs. The new features were inspired by comments I got from the community. Now I am again at a point where I see the library in a very solid state. Best regards, Hans

1 0

[gsoc17] Help review Google Summer of Code proposals
by Niall Douglas 11 Apr '17

11 Apr '17

Dear Boost, Student proposals for Google Summer of Code are submitted, please help us decide which have the most merit. I have reduced the fifty something proposals submitted down to twenty seven which have some chance. To be able to view and rank the student proposals, please do the following: 1. Send to gsoc-admin(a)boost.org your Google login. We will invite you to view the student proposals on the Boost Google Drive. Until you receive the invitation email, you won't be able to view the proposals. 2. Go to https://goo.gl/forms/EVppdHsHMnjkcUoD3 which is a Google form where you can score the proposals. We have linked each proposal there to the Google Drive item and there you can rank a proposal between 1 and 5. Make sure you use the same email as your Google login in the form, otherwise we will ignore any forms submitted to prevent gaming the results. 3. Even if you can't rank all twenty seven proposals, try to do as many as you can and then PRESS SUBMIT at the end of the form (forgetting to press SUBMIT means we never get your rankings). The proposals are presented in random order per person so any work you do will be useful. 4. Please try to have your rankings done by Monday 10th. You may find reviewing the page at https://svn.boost.org/trac/boost/wiki/SoC2017 useful. 5. Finally, if you'd like to mentor any of the proposals, send to gsoc-admin(a)boost.org your Google login so we may invite you onto the Google website as a mentor. Many thanks in advance. Niall & Bryce

4 5

[Review Queue] SIMD Review on Hold -- Attn: wizards
by Michael Caisse 11 Apr '17

11 Apr '17

Hello Wizards - We need to postpone the review for Boost.SIMD while I compile answers to questions raised about the IP. I will report on my findings as soon as possible and either reschedule the review date or ask for the library to be removed from the queue. I apologize for the inconvenience and disruption of the queue. Take care - michael -- Michael Caisse Ciere Consulting ciere.com

1 0

[release] 1.64.0 post-beta merges
by Rene Rivera 11 Apr '17

11 Apr '17

The master branch is is now open for post-beta merges, but only as described in the Post-Beta Merge Policy. See < https://github.com/boostorg/boost/wiki/Release-Beta-Merge-Policy> -- The Boost Release Team

13 56

[simd] Hardware support
by Bjorn Reese 10 Apr '17

10 Apr '17

Boost.SIMD only supports x86. Are there plans for ARM NEON and/or MIPS SIMD? What does Boost.SIMD currently do on unsupported platforms? Revert back to SISD?

13 41

[flat_set] When to sort?
by Vladimir Batov 10 Apr '17

10 Apr '17

I've been using boost::container::flat_set with quite a success until recently when I profiled my app to see that 30-50% of the run-time was spent in insert() for a container of around 50,000 in size. So, I had to replace boost::container::flat_set with a vector variation which inserts as a vector (no sorting). However, when it is the time to call begin(), end(), find(), it sorts once. That shaved the mentioned overhead off. Say, one run is down from 17s to 10s and the likes. I wonder if that should be the boost::container::flat_set default behavior rather than sorting the underlying container with every insert(). After all, as a user I do not care if the underlying container is sorted... until I start using/traversing it, right? Or maybe I am missing something in boost::container::flat_set which already allows me to do something of that sort?

11 37

Announcing CallableTraits' formal review next week (April 3rd)
by Louis Dionne 09 Apr '17

09 Apr '17

Dear Boost community, The formal review of Barrett Adair's CallableTraits library starts Monday, April 3rd and ends on April 12th. CallableTraits is a C++11 library for the inspection, synthesis, and decomposition of callable types. CallableTraits aims to be the "complete type manipulation facility for function types" mentioned in the final paragraph of C++17 proposal P0172, and removes the need for template specializations for different function signatures. You can find the documentation of the library here: http://badair.github.io/callable_traits/doc/html/index.html and the GitHub repository here: https://github.com/badair/callable_traits We encourage your participation in this review. At a minimum, kindly state: - Whether you believe the library should be accepted into Boost - Your name - Your knowledge of the problem domain You are strongly encouraged to also provide additional information: - What is your evaluation of the library's: * Design * Implementation * Documentation * Tests * Usefulness - Did you attempt to use the library? If so: * Which compiler(s)? * What was the experience? Any problems? - How much effort did you put into your evaluation of the review? Regards, Louis

4 4

Mathias Gaunard / NumScale relationship
by Joel FALCOU 08 Apr '17

08 Apr '17

Hi Niall, hi Andrey, I'm taking on to send you an email in private w/r to your questions on the list regarding Boost.SIMD, Mathias Gaunard and its relationship with NumScale. I'm adding Michael in CC: as he knows about the whole ordeal already and will corroborate my claims. Mathias has been one of the engineer I hired and then associate with to fund MetaScale, the company that will later become NumScale. He let the company after being ousted by one of our early investor for basically running the company into the wall and generally not knowing how to do business. He left for Bloomberg and started actually speaking about Boost.SIMD *as if* the internal information he gathered from within NumScale could be released to the public without our consent inclding internal benchmark report and road-map information. I imagine you understand why the cease&desist letter was then send. We have a bunch of other people using Boost.SIMD and they're doing fine (including other company and a bunch of OS project). I dont see why we'll be suing people using our open source software, which is different from using piece of the software he should not have. Since being laid off, Mathias kept trying to make our company and effort within open source fails by playing the victim and basically retelling history as he see fit. Also note that Mathias verbally threaten me that he will make this review a failure for us. This is the factual story of the whole thing: - 2003-2006 I worked in my PhD on something called E.V.E which was a EDSL in C++ able to supp0rot SIMD operations on PPC Altivec. - 2008 I'm now an assistant professor and work on a project called NT2 (that has been spoken about on the list a bunch of time) in collaboration with Jean-Thierry Lapresté which works on a huge amount of libm vectorisation code. Inside NT2, a remnant of E.V.E lingers and get worked on to support x86. - 2010 or some such, We start isolating the SIMD layer from NT2. At the same time, the university authorizes the release and open exploitation of NT2 as a whole in open source. NT2 and its internal soon-to-be Boost.SIMD is released under a Boost Licence. - around 2011, *I hire* Mathias to work on some part of NT2 and related project that culminates in 2012 at the creation of MetaScale. - We start speaking of NT2 and Boost.SIMD separately and it's probably around this time I raise the idea to make an actual submission to Boost. - 2014 for reasons that has no value being exposed here, Mathias leaves MetaScale and NumScale is funded to replace it. - 2015 The amount of people actively working on NT2 plummets and NumScale's team decide to reuse parts of Boost.SIMD into what bSIMD will become. - 2016 the rewrite is complete and the lack of support on NT2 make me pull the plug on the project. NumScale decide to open source back some parts of bSIMD, leaving this new Boost.SIMD made out of bSIMD be the sole remnant of this. And as your concerns goes Andrey about NumScale blocking PR or w/e coming into Boost.SIMD, The key point here is that Mathias is no longer affiliated with NumScale and has no information nor actual reason to speak on our behalf. NumScale has no plan to at short term release ITS OWN support for some architectures. This does not preclude anybody trying to undertake the effort to support an other architecture as long as yes, it is not Mathias pulling up the files we own he scavenged before leaving. We had had someone from ETH Zurich starting a port on QPX, something we also started but never finished due to other constraints. If this ever completes then, yeah it'll probably go inside the Open Source version if it's of enough good quality. We have various plan and discussion going on with different vendor and open sourcing more is planned at later date and depending on things I can not legally speak of because NDA. I'm planning to write or have Michael answer those issues publicly in a way I don't spread too much information that has nothing to do in public. I would appreciate if this line of discussion stay private for now until we address this properly in public. Meanwhile, I'm open to answer your other question. Best regards Joel

3 3

Re: [boost] [release] 1.64.0 post-beta merges
by Oliver Kowalke 08 Apr '17

08 Apr '17

Am 08.04.2017 1:44 nachm. schrieb "Daniel James via Boost" < boost(a)lists.boost.org>: On 8 April 2017 at 10:47, Oliver Kowalke via Boost <boost(a)lists.boost.org> wrote: > > I'd like to update > > - boost.context: updating documentation regarding to property > context-switch, apply property context-switch to Jamfiles in sub-directory > example I don't know enough about boost build for this one, but the change to 'include/boost/context/execution_context.hpp' seems unnecessary. It doesn't look like it will fix anything. The patch applies property 'context-switch' to the example code Jamfiles - no need to specify it at the cmd line. The definition of property context-switch was adapted to the public APIs of boost.context.

1 1

[gsoc17] GSoC next steps (was: Re: [gsoc2017]Satyam Pandey Copy GSoC 2017 Proposal writen by Ruoyun Jing)
by Niall Douglas 07 Apr '17

07 Apr '17

> Sorry for disturbing you at this time, I experienced a very bad thing > that Satyam Pandey, a student who sent proposal yesterday copied too > many sections of my proposal. I marked the sections red in the given > PDF.*I think the same pattern of GSoC proposal is common, and it does > not matter, but his proposal has too many same description as me. * Thank you for reporting this issue. It is unavoidable in Google Summer of Code that students copy one another and indeed sometimes pay another to write their competency test for them. We actually encourage students to study one another's applications and submit an even better application, this happened several times this year with the static map proposal. But we frown on failure to attribute sources, including failure to mention when the community or stackoverflow gave them help. And students who are later prove to be incapable of programming code at the level they advertised in their proposal are lifetime banned not just by us, but by Google. Last night I read every application and pre-eliminated half of them as I do every year so the Boost community doesn't waste their time with them. The calibre at the top this year is even higher than in past years, we have at least three truly superb candidates per project. It will be very hard to choose between them, and we will have to reject two superb candidates for no good reason other than only one student can do one project. You should see an announcement regarding community ranking soon. Watch this space. Niall

2 3

[gsoc2017] Please review my code for Proficiency test.
by Satyam.Pandey 06 Apr '17

06 Apr '17

I have completed my Proficiency Test. Please review the code and suggest anything that you think should be improved. Here is the link to my git repository : https://github.com/sa91/ProficiencyTest I will be really glad to have your suggestions. It would be great help, if someone can suggest me some good testdata for testing my code. Thanks Satyam Pandey -- View this message in context: http://boost.2283326.n4.nabble.com/gsoc2017-Please-review-my-code-for-Profi… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

[VS2017][release] vswhere.exe
by Mateusz Loskot 06 Apr '17

06 Apr '17

Hi, This is regarding issues with locating VS 2017 toolset(s). >From CMake ml, I learned about vswhere utility being developed by Microsoft https://github.com/Microsoft/vswhere vswhere.exe (390 KB) is downloadable from https://github.com/Microsoft/vswhere/releases I'm not sure how exactly, but perhaps it would solve some of the Boost.Build's headache (eg. particular PowerShell version required). For example, it can find all VS versions I've got installed (10.0, 11.0, 12.0, 14.0, 15.0): vswhere.exe -legacy find a particular version: vswhere -legacy -version [11.0,12.0) Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

15 38

program options - adding new functionality
by Sutera Systems 06 Apr '17

06 Apr '17

Hi all, I have just started using boost.program_options for my windows apps. I have a need to add a new functionality. I would appreciate some guidance as to how to do so. Cheers, Larry

2 1

[mailing list] No Reply-To in messages?
by Andrey Semashev 05 Apr '17

05 Apr '17

Hi, Sometimes I can see messages from the mailing list that have no Reply-To header. For example, this is the headers from a recent email from the ML: Delivered-To: andrey.semashev(a)gmail.com Received: by 10.223.171.174 with SMTP id s43csp1184445wrc; Tue, 21 Mar 2017 04:54:11 -0700 (PDT) X-Received: by 10.233.239.75 with SMTP id d72mr28079608qkg.313.1490097251746; Tue, 21 Mar 2017 04:54:11 -0700 (PDT) Return-Path: <andrey.a.davydov(a)gmail.com> Received: from mail-qk0-x233.google.com (mail-qk0-x233.google.com. [2607:f8b0:400d:c09::233]) by mx.google.com with ESMTPS id 5si5329794qty.259.2017.03.21.04.54.11 for <andrey.semashev(a)gmail.com> (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Tue, 21 Mar 2017 04:54:11 -0700 (PDT) Received-SPF: pass (google.com: domain of andrey.a.davydov(a)gmail.com designates 2607:f8b0:400d:c09::233 as permitted sender) client-ip=2607:f8b0:400d:c09::233; Authentication-Results: mx.google.com; dkim=pass header.i=(a)gmail.com; spf=pass (google.com: domain of andrey.a.davydov(a)gmail.com designates 2607:f8b0:400d:c09::233 as permitted sender) smtp.mailfrom=andrey.a.davydov(a)gmail.com; dmarc=pass (p=NONE sp=NONE dis=NONE) header.from=gmail.com Received: by mail-qk0-x233.google.com with SMTP id y76so54702989qkb.0 for <andrey.semashev(a)gmail.com>; Tue, 21 Mar 2017 04:54:11 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025; h=mime-version:in-reply-to:references:from:date:message-id:subject:to :cc; bh=Az1Qy0ABDDY/isZXuI8r58lTLTG+E/wp0e0IliVZOAk=; b=oPSYU2baFZEWMUKF/s2hay278FTdFBfitQp4TNz5piq0zMWNqePuZaXbUD5SPP0Cnp He9gQzhynjuN/Lf4fpUtqjOWyntF2BSSrdpYbCSmaWnnSQjTz5s53EkOSVgojqHCfmVr A3CSJNK5QdAwkNAm+JQRIShSRO/YpWtK90Lhoa9lKlWF+JtIMwCgFG3h5vN1vw+W1xAB pNoHymY5rZ7Uh0WUHMlpEF/tmkD/tZzDss++3j/lKZNgX66VefCpi510BjKKkFfU2xdy zBba1I5hOOohBUzhlkYf5fSxZ1BkC6FSOizONZr1Mlx8AXLhl2MvmfW6KtR9nt9rjmSa Sfhw== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:in-reply-to:references:from:date :message-id:subject:to:cc; bh=Az1Qy0ABDDY/isZXuI8r58lTLTG+E/wp0e0IliVZOAk=; b=OAFamTGJr76H6gmaG7LGcCRyHIp+Kj1SEs188yLqxEQGCvhYYdB8wMs6GsOYL0wYSY 9M1gYeXwexivqs+WF5Reg9CCh2mnkCUWTM6nSu9/B05sXFBUL/sVyEr7OuSXJpzVqOxl cZorectxLhbWqIqClTxYjSDNDKPJB9n+3OntHKp5l2gJY3mMPaILXbXRh6XXCMHxpYIy w1um18ndeJ0Ed7/nkhGKlzD2HvyPpkVPhjM+hhWmb+lxnVNhbpBFsoor28Yx5arAnVWb 0JndOFeqB3tfjv9DA5x/kuSStkSuG2Q439Fvd/2UuWKsqaR4JhaBejrE7jEnJgrN69on 8wfQ== X-Gm-Message-State: AFeK/H24Tvn8HI3rOm/9DXmcPc8Hok/lT3XOC2lfnuuWDiN5TsbtV56nLqNTPypggKQsasFDZvOER50I+HaBMH84 X-Received: by 10.55.15.195 with SMTP id 64mr28730703qkp.131.1490097251370; Tue, 21 Mar 2017 04:54:11 -0700 (PDT) MIME-Version: 1.0 Received: by 10.12.157.129 with HTTP; Tue, 21 Mar 2017 04:54:10 -0700 (PDT) In-Reply-To: <14065012-bde4-142d-eedf-b5fbf1f51d91(a)gmail.com> References: <CAN1iZb7pGGaFe9OKyDKxMB0Nryiqa3pxk5hLQY+1ybUCMNrZBQ(a)mail.gmail.com> <D5F339D7-3F03-4363-A2A5-F611FE8C76F0(a)gmail.com> <CAN1iZb54emhE_G9McfCmO2nN6D-qWqQSgSC-w1HdRqCAh08c8Q(a)mail.gmail.com> <14065012-bde4-142d-eedf-b5fbf1f51d91(a)gmail.com> From: Andrey Davydov <andrey.a.davydov(a)gmail.com> Date: Tue, 21 Mar 2017 14:54:10 +0300 Message-ID: <CAN1iZb6VHEUJvt9h8JN_1EubOcYponiEjdXWQGcGZ+VjU_hKJA(a)mail.gmail.com> Subject: Re: [boost] [smart_ptr] Is there any interest in unique_ptr with type erased deleter? To: boost(a)lists.boost.org Cc: Andrey Semashev <andrey.semashev(a)gmail.com> Content-Type: multipart/alternative; boundary=001a1146f4805976ff054b3c4d27 As a result, when I press Reply, the reply is addressed to the original email sender instead of the mailing list, which is really easy to miss before sending the message. Is it possible to ensure that every email from the ML contains boost(a)lists.boost.org in its Reply-To header? PS: I'm not a guru in email protocols, so if there is another more appropriate way of doing this then that would be fine with me.

13 35

Re: [boost] Official boost macro to determine endianess?
by Frédéric Bron 05 Apr '17

05 Apr '17

> You should check the macro values instead of testing if they are defined > (i.e. use #if instead of #ifdef). Oh thanks, I have to check if it is positive. Now I get the right BOOST_ENDIAN_LITTLE_BYTE (the only one positive). Frédéric

1 0

Re: [boost] Official boost macro to determine endianess?
by Andrey Semashev 05 Apr '17

05 Apr '17

Re-posting. On 04/05/17 16:51, Andrey Semashev wrote: > On 04/05/17 15:29, Frédéric Bron wrote: >> Sorry, I should not have used #elif, in fact ALL macros are defined! >> BOOST_ENDIAN_BIG_BYTE >> BOOST_ENDIAN_BIG_WORD >> BOOST_ENDIAN_LITTLE_BYTE >> BOOST_ENDIAN_LITTLE_WORD >> What does this mean? > > That's how Boost.Predef works: > > http://www.boost.org/doc/libs/1_63_0/doc/html/predef/using_the_predefs.html > > You should check the macro values instead of testing if they are defined > (i.e. use #if instead of #ifdef). > > Also, please, don't top-post. >

1 0

Official boost macro to determine endianess?
by Frédéric Bron 05 Apr '17

05 Apr '17

What is the official boost macro to determine endianess? And what is the header to include to get it? I cannot find any help in the documentation of boost.endian but I can find those macros by grepping in boost: BOOST_LITTLE_ENDIAN, BOOST_BIG_ENDIAN, BOOST_ENDIAN_BIG_BYTE, BOOST_ENDIAN_BIG_WORD, BOOST_ENDIAN_LITTLE_BYTE, BOOST_ENDIAN_LITTLE_WORD, BOOST_PDP_ENDIAN Thanks, Frédéric

4 9

Re: [boost] Official boost macro to determine endianess?
by Andrey Semashev 05 Apr '17

05 Apr '17

Sent this privately by accident. Again. On 04/05/17 13:14, Andrey Semashev wrote: > On 04/05/17 12:45, Frédéric Bron wrote: >>> I think the modern way to do this is to use Boost.Predef. >> >> Great, thanks! >> >> By the way, why does the predef library not follow the boost policy >> [1] on file names, i.e. saying that header files should have .hpp >> extension and not .h? > > Because it is also usable from C. >

1 0

fix in boost/gil/channel_algorithm.hpp for clang 3.9.1
by Frédéric Bron 04 Apr '17

04 Apr '17

Hi, When compiling with clang 3.9.1, I get an error: /softs/osx32-clang-3.9.1/release/boost/include/boost/gil/extension/io/../../channel_algorithm.hpp:54:85: error: non-type template argument evaluates to -1, which cannot be narrowed to type 'unsigned long long' [-Wc++11-narrowing] struct unsigned_integral_max_value : public mpl::integral_c<UnsignedIntegralChannel,-1> {}; Patch is attached. Frédéric

1 0

Re: [boost] [gsoc2017]Satyam Pandey Copy GSoC 2017 Proposal writen by Ruoyun Jing
by Ruoyun Jing 03 Apr '17

03 Apr '17

*NO ! I REJECT !* *Plagiarism is plagiarism!* 2017-04-03 19:04 GMT+08:00 Satyam Pandey <satyampandey0009(a)gmail.com>: > Sorry for using such harsh words earlier. I'm little frustrated now, I > really want to work in this project and I did not start earlier so , I have > to complete everything in a hurry. As yours and mine background was very > similar (professionally (i.e we do competitive and all)). I used your > proposal as a reference for preparing mine. I would have really thanked > you if you would have helped me to make my proposal better as anyhow we are > working on different projects, so it does not matter even if our proposal > have some similarity. We could have helped each other rather than making > all this mess. > > Thanks > Satyam Pandey > > > On Apr 3, 2017 3:37 PM, "Ruoyun Jing via Boost" <boost(a)lists.boost.org> > wrote: > > Hi Boost, Vissarion, Adam, Niall, David > > Sorry for disturbing you at this time, I experienced a very bad thing that > Satyam Pandey, a student who sent proposal yesterday copied too many > sections of my proposal. I marked the sections red in the given PDF.* I > think the same pattern of GSoC proposal is common, and it does not matter, > but his proposal has too many same description as me. * > > And I received two emails from google docs. I will transmit these two > emails in the following emailsThe meaning of one email is Satyam Pandey do > a replace:replace “Dev Environment Visual Studio for C# development Eclipse > for JAVA development Code Blocks, Sublime T…” to“`+” > > The meaning of another email is Satyam Pandey reject the comment of > "Proposal" from his own, replace “Dev Environment Visual Studio for C# > development Eclipse for JAVA development Code Blocks, Sublime T…” to“`+” > > I sent an email to him, but he did not think he did the copy work. But the > actually thing is* he forked the whole proposal and then change some words > to fix his condition.* > > 2017-04-03 7:42 GMT+08:00 Satyam Pandey <satyampandey0009(a)gmail.com>: > > > Hello Ruyong, > > I just wanted to explain my part here. I did not copy as per what I > > understand.I have tried answering your queries.I hope you will read it > > calmly and would try to understand. > > > > > > 1. As far as I could guess we share similar background of competitive > > programming and have no experience in contributing to any large orgs > . So I > > used your proposal as reference for writing my proposal. > > > > > > 1. Our Programming interest are same cause they are, I will end it > > here. This cannot be called a copy-case because thats-what I feel are > the > > things that I like. How can you question that? Every guy that loves > maths > > and programming would have written it in the same way and I'm not > faking my > > interest toward them as you can check by following the links that I > have > > given about different contest that I have participated in. Or do you > want > > to say no-one other than you can like both. > > 2. The Timeline was, one feature that I liked in your proposal, so I > > used it. How its copying ? Your exact timeline will not even make > sense for > > me,cause we are applying for different Projects. > > 3. And I did not understood "And you did not code for programming > > competency test, but have the same idea of implement of test" . What > > does this mean ? . Firstly I haven't read your proposal after you > start > > describing "*far enough*" . So ,I did not know what you were doing in > > your test. Even if I knew what you have done or written there, do you > > think, you have claimed that way of solving the problem by putting it > in > > your proposal ? And even after reading your proficiency test idea, the > > only thing that matches with my idea is the Basic-Distance function > which > > is the first result that we get after googling the problem ? So , > have we > > both copied from google ?? > > > > > > I do not think this means reference, he just use my discription directly > and change some similar words.* This means COPY. * > > > > And please before going public with this, you could have at-least talked > > to me personally. I don't think Boost-Developer mailing list is meant for > > such discussions. Mailing list are made for communication that concerns > the > > whole org not any individual. You could have directly mailed to me, > before > > creating this nuisance. > > Genuinely you should be happy that people are following your style and if > > not, at least think a little before calling someone cheat because > borrowing > > ideas are not equivalent to cheating , in anyway. > > > > I apologize to all for spamming their mail-boxes > > > > *I do not accept his apologize. I want to be given impartial judgement for > this disgusting COPY.* > > Thanks all for reading.:) > > Best regards. > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman > /listinfo.cgi/boost > > > -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

1 0

Re: [boost] [gsoc2017]Satyam Pandey Copy GSoC 2017 Proposal writen by Ruoyun Jing
by Ruoyun Jing 03 Apr '17

03 Apr '17

*plagiarism is plagiarism, regardless project, and stop acting like a 3 years old!* 2017-04-03 18:57 GMT+08:00 Satyam Pandey <satyampandey0009(a)gmail.com>: > Hello Ruoyun, > Sorry,I m not good with Chinese names So, I used he. I'm not acting as 3 > year old but I think you are, using your idea in writing proposal by taking > a reference is very popular and is always encouraged. If you believe the > ideas that you get are so unique that no one else can think it by > themselves. You could have send your proposal personally to them. > And you know you have given even the edit accesses on your doc, please > remove it else someone can mess up with your doc. I wrote my proposal by > myself according to me, so it will be better if you can leave it upto > mentors to decide whether I copied or not. > *reference implies quotation or citation of your original work, which in this topic, was neither. as the resemblance between two proposals is simple too obvious to consider anything other than full copy of the origin * > On Apr 3, 2017 4:16 PM, "Ruoyun Jing" <jingry0321(a)gmail.com> wrote: > >> plagiarism is plagiarism, regardless project, and stop acting like a 3 >> years old >> >> 2017-04-03 18:41 GMT+08:00 Ruoyun Jing <jingry0321(a)gmail.com>: >> >>> “She” please. >>> >>> 2017-04-03 18:33 GMT+08:00 Satyam Pandey <satyampandey0009(a)gmail.com>: >>> >>>> Hi all, >>>> >>>> I don't know why Ryoung is so fixated on the matter ? The comment that >>>> I made in his doc was an accident, so I removed it .That's why he got such >>>> mail later. >>>> * Secondly, We are applying for "different projects " . Copying his >>>> exact proposal will not even make sense for me.* >>>> What I used was his style of writing with some other older proposal . I >>>> am adding them as reference here too. >>>> I really feel this is too frustrating why this guy don't even >>>> understand that we are doing 2 different projects, so I can't copy him . >>>> And Sorry to tell you, I used used Moss on our proposal and there is less >>>> than 10% match is our proposal, if you claim that I have just changed a few >>>> words come with some proof as moss is telling something different. >>>> >>>> Please someone look into it. It is very irritating. >>>> >>>> Thanks >>>> Satyam Pandey >>>> >>>> >>>> >>>> On Apr 3, 2017 3:37 PM, "Ruoyun Jing via Boost" <boost(a)lists.boost.org> >>>> wrote: >>>> >>>> Hi Boost, Vissarion, Adam, Niall, David >>>> >>>> Sorry for disturbing you at this time, I experienced a very bad thing >>>> that >>>> Satyam Pandey, a student who sent proposal yesterday copied too many >>>> sections of my proposal. I marked the sections red in the given PDF.* I >>>> think the same pattern of GSoC proposal is common, and it does not >>>> matter, >>>> but his proposal has too many same description as me. * >>>> >>>> And I received two emails from google docs. I will transmit these two >>>> emails in the following emailsThe meaning of one email is Satyam Pandey >>>> do >>>> a replace:replace “Dev Environment Visual Studio for C# development >>>> Eclipse >>>> for JAVA development Code Blocks, Sublime T…” to“`+” >>>> >>>> The meaning of another email is Satyam Pandey reject the comment of >>>> "Proposal" from his own, replace “Dev Environment Visual Studio for C# >>>> development Eclipse for JAVA development Code Blocks, Sublime T…” >>>> to“`+” >>>> >>>> I sent an email to him, but he did not think he did the copy work. But >>>> the >>>> actually thing is* he forked the whole proposal and then change some >>>> words >>>> to fix his condition.* >>>> >>>> 2017-04-03 7:42 GMT+08:00 Satyam Pandey <satyampandey0009(a)gmail.com>: >>>> >>>> > Hello Ruyong, >>>> > I just wanted to explain my part here. I did not copy as per what I >>>> > understand.I have tried answering your queries.I hope you will read it >>>> > calmly and would try to understand. >>>> > >>>> > >>>> > 1. As far as I could guess we share similar background of >>>> competitive >>>> > programming and have no experience in contributing to any large >>>> orgs . So I >>>> > used your proposal as reference for writing my proposal. >>>> > >>>> > >>>> > 1. Our Programming interest are same cause they are, I will end it >>>> > here. This cannot be called a copy-case because thats-what I feel >>>> are the >>>> > things that I like. How can you question that? Every guy that >>>> loves maths >>>> > and programming would have written it in the same way and I'm not >>>> faking my >>>> > interest toward them as you can check by following the links that >>>> I have >>>> > given about different contest that I have participated in. Or do >>>> you want >>>> > to say no-one other than you can like both. >>>> > 2. The Timeline was, one feature that I liked in your proposal, so >>>> I >>>> > used it. How its copying ? Your exact timeline will not even make >>>> sense for >>>> > me,cause we are applying for different Projects. >>>> > 3. And I did not understood "And you did not code for programming >>>> > competency test, but have the same idea of implement of test" . >>>> What >>>> > does this mean ? . Firstly I haven't read your proposal after you >>>> start >>>> > describing "*far enough*" . So ,I did not know what you were doing >>>> in >>>> > your test. Even if I knew what you have done or written there, do >>>> you >>>> > think, you have claimed that way of solving the problem by putting >>>> it in >>>> > your proposal ? And even after reading your proficiency test idea, >>>> the >>>> > only thing that matches with my idea is the Basic-Distance >>>> function which >>>> > is the first result that we get after googling the problem ? So , >>>> have we >>>> > both copied from google ?? >>>> > >>>> > >>>> > I do not think this means reference, he just use my discription >>>> directly >>>> and change some similar words.* This means COPY. * >>>> >>>> >>>> > And please before going public with this, you could have at-least >>>> talked >>>> > to me personally. I don't think Boost-Developer mailing list is meant >>>> for >>>> > such discussions. Mailing list are made for communication that >>>> concerns the >>>> > whole org not any individual. You could have directly mailed to me, >>>> before >>>> > creating this nuisance. >>>> > Genuinely you should be happy that people are following your style >>>> and if >>>> > not, at least think a little before calling someone cheat because >>>> borrowing >>>> > ideas are not equivalent to cheating , in anyway. >>>> > >>>> > I apologize to all for spamming their mail-boxes >>>> > >>>> >>>> *I do not accept his apologize. I want to be given impartial judgement >>>> for >>>> this disgusting COPY.* >>>> >>>> Thanks all for reading.:) >>>> >>>> Best regards. >>>> >>>> _______________________________________________ >>>> Unsubscribe & other changes: http://lists.boost.org/mailman >>>> /listinfo.cgi/boost >>>> >>>> >>>> >>> >>> >>> -- >>> Northwest University of China >>> Software Engineering >>> jingry0321(a)gmail.com <jingry0321(a)163.com> >>> >> >> >> >> -- >> Northwest University of China >> Software Engineering >> jingry0321(a)gmail.com <jingry0321(a)163.com> >> > -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

1 0

Re: [boost] [gsoc2017]Satyam Pandey Copy GSoC 2017 Proposal writen by Ruoyun Jing
by Ruoyun Jing 03 Apr '17

03 Apr '17

Hi Boost, Here are two emails google docs sent to me.Sorry for my language The meaning of one email is Satyam Pandey do a replace:replace “Dev Environment Visual Studio for C# development Eclipse for JAVA development Code Blocks, Sublime T…” to“`+” ---------- Forwarded message ---------- From: Satyam Pandey (Google 文档) <d+MTA0OTYzMTEyNjU1MDQ4ODM2NjY 4-MTE2NjIwMzk2NDMwMjUwNDI3MDcx(a)docs.google.com> Date: 2017-04-02 21:03 GMT+08:00 Subject: Proposal - 替换：将“Dev Environment Visual Studio fo... To: jingry0321(a)gmail.com Satyam Pandey拒绝了“Proposal <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> ”中的建议 [image: Satyam Pandey] Satyam Pandey 替换：将“Dev Environment Visual Studio for C# development Eclipse for JAVA development Code Blocks, Sublime T…”替换为“`+” [image: Satyam Pandey] Satyam Pandey *已拒绝建议* 打开 <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> Google Inc. 1600 Amphitheatre Parkway, Mountain View, CA 94043, USA 您收到此邮件是因为您订阅了有关“Proposal <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> ”的所有讨论。更改 Google 文档向您发送的内容。 <https://docs.google.com/document/docos/notify?id=1wj9xPSmdehh9MzE-3MGHMu7cw…> 您可以通过回复此邮件来参与讨论。 The meaning of another email is Satyam Pandey reject the comment of "Proposal" from his own, replace “Dev Environment Visual Studio for C# development Eclipse for JAVA development Code Blocks, Sublime T…” to“`+” ---------- Forwarded message ---------- From: Satyam Pandey (Google 文档) < d+MTA0OTYzMTEyNjU1MDQ4ODM2NjY4-MTE2NjIwMzk2NDMwMjUwNDI3MDcx(a)docs.google.com> Date: 2017-04-02 21:03 GMT+08:00 Subject: Proposal - 替换：将“Dev Environment Visual Studio fo... To: jingry0321(a)gmail.com Satyam Pandey拒绝了“Proposal <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> ”中的建议 [image: Satyam Pandey] *Satyam Pandey* 替换：将“Dev Environment Visual Studio for C# development Eclipse for JAVA development Code Blocks, Sublime T…”替换为“`+” [image: Satyam Pandey] *Satyam Pandey* *已拒绝建议* 打开 <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> Google Inc. 1600 Amphitheatre Parkway, Mountain View, CA 94043, USA 您收到此邮件是因为您订阅了有关“Proposal <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> ”的所有讨论。更改 Google 文档向您发送的内容。 <https://docs.google.com/document/docos/notify?id=1wj9xPSmdehh9MzE-3MGHMu7cw…> 您可以通过回复此邮件来参与讨论。 -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

1 0

Fwd: Proposal - 替换：将“Dev Environment Visual Studio fo...
by Ruoyun Jing 03 Apr '17

03 Apr '17

Hi Boost, Here is the first email google docs sent to me. ---------- Forwarded message ---------- From: Satyam Pandey (Google 文档) < d+MTA0OTYzMTEyNjU1MDQ4ODM2NjY4-MTE2NjIwMzk2NDMwMjUwNDI3MDcx(a)docs.google.com> Date: 2017-04-02 20:06 GMT+08:00 Subject: Proposal - 替换：将“Dev Environment Visual Studio fo... To: jingry0321(a)gmail.com Satyam Pandey向“Proposal <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> ”添加了一条建议 [image: Satyam Pandey] *Satyam Pandey* 替换：将“Dev Environment Visual Studio for C# development Eclipse for JAVA development Code Blocks, Sublime T…”替换为“`+” 打开 <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> Google Inc. 1600 Amphitheatre Parkway, Mountain View, CA 94043, USA 您收到此邮件是因为您订阅了有关“Proposal <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> ”的所有讨论。更改 Google 文档向您发送的内容。 <https://docs.google.com/document/docos/notify?id=1wj9xPSmdehh9MzE-3MGHMu7cw…> 您可以通过回复此邮件来参与讨论。 -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

1 0

Re: [boost] [gsoc2017]Satyam Pandey Copy GSoC 2017 Proposal writen by Ruoyun Jing
by Ruoyun Jing 03 Apr '17

03 Apr '17

Hi Boost, Vissarion, Adam, Niall, David Sorry for disturbing you at this time, I experienced a very bad thing that Satyam Pandey, a student who sent proposal yesterday copied too many sections of my proposal. I marked the sections red in the given PDF.* I think the same pattern of GSoC proposal is common, and it does not matter, but his proposal has too many same description as me. * And I received two emails from google docs. I will transmit these two emails in the following emailsThe meaning of one email is Satyam Pandey do a replace:replace “Dev Environment Visual Studio for C# development Eclipse for JAVA development Code Blocks, Sublime T…” to“`+” The meaning of another email is Satyam Pandey reject the comment of "Proposal" from his own, replace “Dev Environment Visual Studio for C# development Eclipse for JAVA development Code Blocks, Sublime T…” to“`+” I sent an email to him, but he did not think he did the copy work. But the actually thing is* he forked the whole proposal and then change some words to fix his condition.* 2017-04-03 7:42 GMT+08:00 Satyam Pandey <satyampandey0009(a)gmail.com>: > Hello Ruyong, > I just wanted to explain my part here. I did not copy as per what I > understand.I have tried answering your queries.I hope you will read it > calmly and would try to understand. > > > 1. As far as I could guess we share similar background of competitive > programming and have no experience in contributing to any large orgs . So I > used your proposal as reference for writing my proposal. > > > 1. Our Programming interest are same cause they are, I will end it > here. This cannot be called a copy-case because thats-what I feel are the > things that I like. How can you question that? Every guy that loves maths > and programming would have written it in the same way and I'm not faking my > interest toward them as you can check by following the links that I have > given about different contest that I have participated in. Or do you want > to say no-one other than you can like both. > 2. The Timeline was, one feature that I liked in your proposal, so I > used it. How its copying ? Your exact timeline will not even make sense for > me,cause we are applying for different Projects. > 3. And I did not understood "And you did not code for programming > competency test, but have the same idea of implement of test" . What > does this mean ? . Firstly I haven't read your proposal after you start > describing "*far enough*" . So ,I did not know what you were doing in > your test. Even if I knew what you have done or written there, do you > think, you have claimed that way of solving the problem by putting it in > your proposal ? And even after reading your proficiency test idea, the > only thing that matches with my idea is the Basic-Distance function which > is the first result that we get after googling the problem ? So , have we > both copied from google ?? > > > I do not think this means reference, he just use my discription directly and change some similar words.* This means COPY. * > And please before going public with this, you could have at-least talked > to me personally. I don't think Boost-Developer mailing list is meant for > such discussions. Mailing list are made for communication that concerns the > whole org not any individual. You could have directly mailed to me, before > creating this nuisance. > Genuinely you should be happy that people are following your style and if > not, at least think a little before calling someone cheat because borrowing > ideas are not equivalent to cheating , in anyway. > > I apologize to all for spamming their mail-boxes > *I do not accept his apologize. I want to be given impartial judgement for this disgusting COPY.* Thanks all for reading.:) Best regards.

1 0

Re: [boost] [gsoc2017] Please review my proposal for project "Nearly antipodal points distance accuracy improvement. "
by Satyam Pandey 02 Apr '17

02 Apr '17

Hello Ruyong, I just wanted to explain my part here. I did not copy as per what I understand.I have tried answering your queries.I hope you will read it calmly and would try to understand. 1. As far as I could guess we share similar background of competitive programming and have no experience in contributing to any large orgs . So I used your proposal as reference for writing my proposal. 2. Our Programming interest are same cause they are, I will end it here. This cannot be called a copy-case because thats-what I feel are the things that I like. How can you question that? Every guy that loves maths and programming would have written it in the same way and I'm not faking my interest toward them as you can check by following the links that I have given about different contest that I have participated in. Or do you want to say no-one other than you can like both. 3. The Timeline was, one feature that I liked in your proposal, so I used it. How its copying ? Your exact timeline will not even make sense for me,cause we are applying for different Projects. 4. And I did not understood "And you did not code for programming competency test, but have the same idea of implement of test" . What does this mean ? . Firstly I haven't read your proposal after you start describing "*far enough*" . So ,I did not know what you were doing in your test. Even if I knew what you have done or written there, do you think, you have claimed that way of solving the problem by putting it in your proposal ? And even after reading your proficiency test idea, the only thing that matches with my idea is the Basic-Distance function which is the first result that we get after googling the problem ? So , have we both copied from google ?? And please before going public with this, you could have at-least talked to me personally. I don't think Boost-Developer mailing list is meant for such discussions. Mailing list are made for communication that concerns the whole org not any individual. You could have directly mailed to me, before creating this nuisance. Genuinely you should be happy that people are following your style and if not, at least think a little before calling someone cheat because borrowing ideas are not equivalent to cheating , in anyway. I apologize to all for spamming their mail-boxes Thanks Satyam Pandey On Mon, Apr 3, 2017 at 5:12 AM, Satyam Pandey <satyampandey0009(a)gmail.com> wrote: > Hello Ruyong, > I just wanted to explain my part here. I did not copy as per what I > understand.I have tried answering your queries.I hope you will read it > calmly and would try to understand. > > > 1. As far as I could guess we share similar background of competitive > programming and have no experience in contributing to any large orgs . So I > used your proposal as reference for writing my proposal. > 2. Our Programming interest are same cause they are, I will end it > here. This cannot be called a copy-case because thats-what I feel are the > things that I like. How can you question that? Every guy that loves maths > and programming would have written it in the same way and I'm not faking my > interest toward them as you can check by following the links that I have > given about different contest that I have participated in. Or do you want > to say no-one other than you can like both. > 3. The Timeline was, one feature that I liked in your proposal, so I > used it. How its copying ? Your exact timeline will not even make sense for > me,cause we are applying for different Projects. > 4. And I did not understood "And you did not code for programming > competency test, but have the same idea of implement of test" . What > does this mean ? . Firstly I haven't read your proposal after you start > describing "*far enough*" . So ,I did not know what you were doing in > your test. Even if I knew what you have done or written there, do you > think, you have claimed that way of solving the problem by putting it in > your proposal ? And even after reading your proficiency test idea, the > only thing that matches with my idea is the Basic-Distance function which > is the first result that we get after googling the problem ? So , have we > both copied from google ?? > > > And please before going public with this, you could have at-least talked > to me personally. I don't think Boost-Developer mailing list is meant for > such discussions. Mailing list are made for communication that concerns the > whole org not any individual. You could have directly mailed to me, before > creating this nuisance. > Genuinely you should be happy that people are following your style and if > not, at least think a little before calling someone cheat because borrowing > ideas are not equivalent to cheating , in anyway. > > I apologize to all for spamming their mail-boxes > > Thanks > Satyam Pandey. > > > > > On Mon, Apr 3, 2017 at 3:13 AM, Ruoyun Jing <jingry0321(a)gmail.com> wrote: > >> Hi Satyam, >> Your proposal is same as me especially on milestone and programming test. >> I received two emails from google docs. Sorry for my language is Chinese. >> The meaning of this email is Satyam Pandey do a replace:replace “Dev >> Environment Visual Studio for C# development Eclipse for JAVA development >> Code Blocks, Sublime T…” to“`+” >> >> On Sun, Apr 2, 2017 at 8:06 PM, Satyam Pandey (Google 文档) < >> d+MTA0OTYzMTEyNjU1MDQ4ODM2NjY4-MTE2NjIwMzk2NDMwMjUwNDI3 >> MDcx(a)docs.google.com> wrote: >> >>> Satyam Pandey向“Proposal >>> <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> >>> ”添加了一条建议 >>> [image: Satyam Pandey] >>> Satyam Pandey >>> >>> 替换：将“Dev Environment Visual Studio for C# development Eclipse for JAVA >>> development Code Blocks, Sublime T…”替换为“`+” >>> >>> 打开 >>> <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> >>> Google Inc. 1600 Amphitheatre Parkway, Mountain View, CA 94043, USA >>> >>> 您收到此邮件是因为您订阅了有关“Proposal >>> <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> >>> ”的所有讨论。更改 Google 文档向您发送的内容。 >>> <https://docs.google.com/document/docos/notify?id=1wj9xPSmdehh9MzE-3MGHMu7cw…> >>> 您可以通过回复此邮件来参与讨论。 >>> >> >> >> >> -- >> Northwest University of China >> Software Engineering >> jingry0321(a)gmail.com <jingry0321(a)163.com> >> >> The meaning of this email is Satyam Pandey reject the comment of >> "Proposal" from his own, replace “Dev Environment Visual Studio for C# >> development Eclipse for JAVA development Code Blocks, Sublime T…” to“`+” >> 2017-04-02 21:03 GMT+08:00 Satyam Pandey (Google 文档) < >> d+MTA0OTYzMTEyNjU1MDQ4ODM2NjY4-MTE2NjIwMzk2NDMwMjUwNDI3 >> MDcx(a)docs.google.com>: >> >>> Satyam Pandey拒绝了“Proposal >>> <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> >>> ”中的建议 >>> [image: Satyam Pandey] >>> Satyam Pandey >>> >>> 替换：将“Dev Environment Visual Studio for C# development Eclipse for JAVA >>> development Code Blocks, Sublime T…”替换为“`+” >>> >>> [image: Satyam Pandey] >>> Satyam Pandey >>> >>> *已拒绝建议* >>> 打开 >>> <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> >>> Google Inc. 1600 Amphitheatre Parkway, Mountain View, CA 94043, USA >>> >>> 您收到此邮件是因为您订阅了有关“Proposal >>> <https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb…> >>> ”的所有讨论。更改 Google 文档向您发送的内容。 >>> <https://docs.google.com/document/docos/notify?id=1wj9xPSmdehh9MzE-3MGHMu7cw…> >>> 您可以通过回复此邮件来参与讨论。 >>> >> >> I think I need you to give some explanation. >> >> -- >> Northwest University of China >> Software Engineering >> jingry0321(a)gmail.com <jingry0321(a)163.com> >> > >

1 0

[gsoc] Project Proposal Review Request for Static_Map Class
by Baber Khalid 02 Apr '17

02 Apr '17

Dear Niall Douglas, I am a third year B.Sc Computer Science student and I am planning to apply for the idea of developing a static_map in C++ which does not generate any code at runtime including the code for lookups. Here is my first proposal draft: https://docs.google.com/document/d/1rwiIsmsMWGz4mMwIIQ00k5uw3G71d6L0ofC8jPi… Any feedback would be appreciated! Regards, Baber Khalid

1 0

[gsoc2017] Please review my proposal for project "Nearly antipodal points distance accuracy improvement. "
by Satyam.Pandey 02 Apr '17

02 Apr '17

Hi all, I want to contribute to the project "Nearly antipodal points distance accuracy improvement." I have attached my proposal in the mail. I request the mentors to review my proposal. I know I'm pretty late to start. But it would be great help if you can review my proposal and suggest the changes if required. Proposal : https://docs.google.com/document/d/19WYR0RHINxqhtu0SIN0ZUxYMNKxAf1LOBPGl7j7… Thanks Satyam Pandey -- View this message in context: http://boost.2283326.n4.nabble.com/gsoc2017-Please-review-my-proposal-for-p… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 4

equivalent for 'pause' mnemonic on ARM - or boost.pref?
by Oliver Kowalke 02 Apr '17

02 Apr '17

Hi, does someone know an equivalent of x86 'pause' mnemonic for ARMv6? Raspbian (-march=armv6) and Debian armel (-march=armv4) seam no to accept The 'yield' mnemonic seams no to be right in both cases. Or does boost.predef's BOOST_ARCH_ARM give a hint for both cases? ty, Oliver

2 2

BOOST license & GPL
by Oliver Kowalke 02 Apr '17

02 Apr '17

Hi, I encountered a open source project that is released under GPL and uses Boost - that's OK, because GPL and Boost license should be compatible. But the developers of those project copied code from Boost into their own library. The question is, is this new library now GPL or Boost license? Additionally, because they copied the code from several Boost files into one, they mixed up copyright statements. As a result, some people get copyright on code they never wrote. Seams to me that's not correct. Oliver

4 15

[gsoc17] My proposal
by GuillermoReyes 01 Apr '17

01 Apr '17

Dear Vissarion and Adam, My name is Guillermo- a Computer science student at UCLA. I am excited at the possibility of contributing to such a useful library! My application is not yet complete, but I will post my draft on here to demonstrate my intent to participate in the program. For the competency test, I began to implement a representation of points on earth and used the great-circle formula to calculate the shortest distance between two points. I will have a more in-depth explanation of the code by the final iteration of the draft along with the complete proposal and application. Sincerely, Guillermo R. -- View this message in context: http://boost.2283326.n4.nabble.com/gsoc17-My-proposal-tp4693288.html Sent from the Boost - Dev mailing list archive at Nabble.com.

2 3

[Stacktrace] Review 2 Manager report
by Niall Douglas 31 Mar '17

31 Mar '17

Many thanks to all those who participated in the second review of proposed Boost.Stacktrace. I received the following formal reviews: 1. Peter Dimov (ACCEPT) 2. Vladimir Batov (ACCEPT) 3. Artyom Bellis (CONDITIONAL ACCEPT) 4. Bjorn Reese (ACCEPT) 5. Edward Diener (ACCEPT) Extensive comments without a formal recommendation were also made by: 1. Mark Bartosik 2. Florian Weimer Some of the more important conditions for acceptance as judged by the review manager are: * Problems on FreeBSD (and by inference OS X?). * Per frame execution of addr2line rather than calling it once. * Throw-with-trace was asked for by a lot of people. * One reviewer suggested that the addr2line backend was async signal unsafe. My reading of the code is that it is async signal unsafe to parse a stacktrace (and unavoidably so on any platform), but the capture of backtraces is now fully async signal safe. * Some disliked the bringing in of windows.h and the COM headers on Windows. For a header only library I consider this acceptable, Stacktrace when configured in non-header only mode does not inject windows.h into everything including stacktrace. Congratulations to Antony on getting yet another library of his into Boost! Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

3 2

[Beast] Redesigned HTTP algorithms and parser!
by Vinnie Falco 31 Mar '17

31 Mar '17

Background: Websocket connections start with an HTTP UPGRADE request/response sequence. Often people want to customize this handshake so I added code in Beast to read and write HTTP messages. Upon reviewing the HTTP RFC (rfc2616 and rfc7230) it seemed to be logical that the HTTP message could be modeled as a single class. And there could be free functions implementing the algorithms to serialize and deserialize these messages in th HTTP/1 format. I took this as far as I could and I was pretty happy with the result. You have functions like read, async_read, write, and async_write which take beast::http::message objects as parameters. Example: http://vinniefalco.github.io/beast/beast/ref/http__read/overload3.html The innovation here is the "Body" template type which controls not only the type of container used to represent the body but also the algorithms used to transfer bytes from the message body on the wire into and out of that container. The Body concept, and its nested Reader and Writer concepts, are documented here: http://vinniefalco.github.io/beast/beast/ref/Body.html http://vinniefalco.github.io/beast/beast/ref/Reader.html http://vinniefalco.github.io/beast/beast/ref/Writer.html Previous efforts and HTTP implementations focused heavily on the representation and parsing of the headers. To my knowledge Beast is the first implementation to provide caller flexibility in the body representation. Now the Beast websocket implementation has a reasonable set of primitives it could use to perform the handshake, and users could get control of that process. The Problem: Unfortunately, while treating the message as an object that can be read/written atomically works great for example programs and trivial use-cases, it fails in the real world. These are issues with it: * The caller must commit to a Body representation before receiving the HTTP Header * No way to properly read and respond to Expect: 100-continue * An efficient HTTP relay function (one that does not buffer the entire body up front) cannot be implemented by the caller * The caller cannot reasonably set a timeout, for example what if the body is 2 gigabytes received over a slow connection? * The parser interface forces algorithms to perform an unnecessary buffer copy for body containers that are entirely stored in memory (e.g std::string or boost::asio::streambuf). These issues sparked quite a bit of discussion on GitHub: https://github.com/vinniefalco/Beast/issues/154 https://github.com/vinniefalco/Beast/issues/265 In October of 2016 these problems became apparent. I tried a lot of different ideas to improve the design to solve it, but none of them worked. Some of my co-workers looked at it but we didn't really find anything great. One user in particular, on GitHub, had strong ideas involving the concept of "completion conditions" to augment the read/parse algorithms but it didn't feel right to me. The Solution: After suffering from writer's block for 5 months inspiration hit and I tried a combination of interface changes that got the design to where it needs to be to solve these problems. * The Reader concept is refined into two types: "indirect" readers, and "direct" readers. This is described here: http://vinniefalco.github.io/stage/beast/beast/ref/Reader.html * The parser exposes a small number of internal states, informing callers of where it is at and giving the caller control over if and when the parser advances to the next state: https://github.com/vinniefalco/Beast/blob/http/include/beast/http/basic_par… * The parser is rewritten to work only on linear buffers (allowing it to be optimized to become 20 times faster if SSE2 instructions are allowed). To facilitate this requirement, the flat_streambuf class is provided which works just like a basic_streambuf except it guarantees a single buffer. If the parser is given multiple buffers, it allocates memory to flatten it: https://github.com/vinniefalco/Beast/blob/http/include/beast/core/flat_stre… * New functions parse_some and async_parse_some allow the caller to perform incremental parsing. This allows for the implementation of relay functions, or reading just the header (for Expect: 100-continue): https://github.com/vinniefalco/Beast/blob/http/include/beast/http/parse.hpp… With these changes callers can get control of the inner loop that reads the body off the socket or stream, so they can do whatever custom steps are necessary if they want. They can set timeouts, and write their own loop that calls parse_some repeatedly. I think it solves all of these issues. I've written some test code which demonstrates how direct and indirect body readers are implemented, and what calling code looks like. I've also written a prototype "relay" function (read a message from one socket and efficiently write it to another socket). And there's an example of how Expect: 100-continue might be implemented. These prototypes are located here: https://github.com/vinniefalco/Beast/blob/http/test/http/design.cpp#L30 How to Help? These are some controversial changes and I think they could use some polish and vetting before I merge it to the master branch. Maybe there is something I haven't thought of, or a use-case it doesn't address. Perhaps there is a better way, or perhaps there are tweaks to make it even more usable and understandable. If some kind soul(s) would look through it and offer some feedback, positive or negative, that would be enormously helpful. The formal review for Beast is now scheduled for the first week of July and like an expectant father I am anxious and would like everything to go just right! My only objective is to polish up the library and its documentation so it is in the best possible shape for review. Thanks for listening!

1 1

[release] Boost 1.64.0 Beta 2
by Rene Rivera 31 Mar '17

31 Mar '17

Boost release 1.64.0 beta 2 is now available at: <https://dl.bintray.com/boostorg/beta/1.64.0.beta.2/source/> The SHA256 checksums are as follows: 49c9339b9d8e7b2610ef84c80cd10b2252c119ebcc3222450beb0e94c1da1522 boost_1_64_0_b2.7z 92ec7cbf1e77c5979e381dd8104f9e96c0471c276e566272751a981d806db94b boost_1_64_0_b2.tar.bz2 da5670892b7b572808491b13a7b9421c3c18e6f395d6a5ec822466db466eda01 boost_1_64_0_b2.tar.gz 61d6e29e8a1d7503fe13a9d916842f0ec2e625f733b98b29ce563f8cbdb482bf boost_1_64_0_b2.zip The notable difference from Beta 1 is the inclusion of the missing Boost Process library. For details of what's in the release, see < http://www.boost.org/users/history/version_1_64_0.html>. Note that the links to files on this web page are for the final release - use the link above to get the beta files. There are also pre-built libraries provided by Tom Kent here: <https://dl.bintray.com/boostorg/beta/1.64.0.beta.2/binaries/> Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

6 5

[gsoc17]Proposal draft shared of Boost.Geometry Project 1
by Ruoyun Jing 30 Mar '17

30 Mar '17

Hi Adam, Vissarion, boost all: I have finished my proposal of Boost.Geometry Project 1, I am very pleasure you to give me more advice of my proposal! :) Any aspect of the proposal is OK! I would like to get feed back from you! Looking forward from you! :) Thanks all and Best Regards. Google docs: https://docs.google.com/document/d/1wj9xPSmdehh9MzE-3MGHMu7cwMhDPASUEvU9pJb… Ruoyun Jing -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

1 0

Boost.SIMD review
by serge guelton 30 Mar '17

30 Mar '17

Hi Boost Dev, I'm the core maintainer of Pythran[0], a python-to-native-code compiler focused on numeric computations. For more than 3 years, we've been using Boost.SIMD [1] as a generic backend for SIMD code generation, without much worries. Basically our compiler generates C++ code that includes Boost.simd calls. The big plus to us are: + Performances. The generated code runs at the same speed as the one written with intrinsics; + Target abstraction, esp. concerning the vector size and the various arithmetic operations; + Complete libm API, vectorized, which is a big plus when porting existing code (or when matching an existing API as we do); + Header only, which actually makes it easier for us to ship; + Low requirements (it does not require us to ship a large part of boost).? The compilation time is sometimes a worry, but it has decreased over the year. We don't use complex data movement like shuffle or pack, so I don't have any feedback on that. All in one, if that ever matters, I would be happy to have it integrated in Boost! ++ Serge [0] https://pythonhosted.org/pythran/ [1] https://github.com/NumScale/boost.simd

1 0

NuDB: A fast key/value insert-only database for SSD drives in C++11
by Vinnie Falco 30 Mar '17

30 Mar '17

I just released version 1.0.0 of my header-only C++11 library NuDB. Its quite a mature library, haven't had to make any changes in a while. Its been running on production servers for 2 years or so with no problems, managing ever-growing databases of 2TB. I'm wondering what the level of interest, if any, there would be for making this a part of Boost. You can check it out here: https://github.com/vinniefalco/NuDB

11 91

Problem creating mapping from string to vector_expression
by SHIVAM MITTAL 30 Mar '17

30 Mar '17

Hi, I have been trying to create a mapping from string to ublas::vector_expression. template <class T> boost::unordered_map<std::string, vector_expression <T> > c; vector<int> v (10); for (unsigned i = 0; i < v.size (); ++ i) v (i) = i; c <int>["first"] = v; I have been getting this error : error: no match for ‘operator=’ (operand types are ‘boost::unordered::unordered_map<std::__cxx11::basic_string<char>, boost::numeric::ublas::vector_expression<int>, boost::hash<std::__cxx11::basic_string<char> >, std::equal_to<std::__cxx11::basic_string<char> >, std::allocator<std::pair<const std::__cxx11::basic_string<char>, boost::numeric::ublas::vector_expression<int> > > >::mapped_type {aka boost::numeric::ublas::vector_expression<int>}’ and ‘boost::numeric::ublas::vector<int>’) columns <int>["first"] = v; Please help.

1 0

[build][geometry][regression] Geometry develop regression tests are blank
by Adam Wulkiewicz 29 Mar '17

29 Mar '17

Hi, Boost.Geometry develop tests (http://www.boost.org/development/tests/develop/developer/geometry.html) stopped showing around 22.03. The first blank run (teeks99-03-dc3.9-1z-Docker-64on64) is from Wed, 22 Mar 2017 01:20:13. Do you have an idea what may be the cause? I see that many changes in Build and Regression was done around 22.03. Geometry was also modified that day but the first commit is from 12:40+1 so later than the first blank run. I checked the XML of one of them (teeks99-09-n-win2012R2-64on64) and it seems that the revision attribute of <test-log> tag is not set for the most of the tests. I'm currently running the regression.py myself in hope of finding the cause. I see that in bjam.log the only tests that are dumped are: boost-test(RUN_PYD) "geometry/__boost_check_library__" : "status/boost_check_library.py" boost-test(RUN_PYD) "geometry/extensions/__boost_check_library__" : "status/boost_check_library.py" boost-test(RUN) "geometry/index/varray_old" : "libs/geometry/index/test/varray_old.cpp" boost-test(RUN) "geometry/index/varray" : "libs/geometry/index/test/varray.cpp" boost-test(RUN_PYD) "geometry/index/__boost_check_library__" : "status/boost_check_library.py" varray tests are the only ones that are run at the most top level of Geometry Jamfiles (of sublib geometry/index in this case) with test-suite: https://github.com/boostorg/geometry/blob/develop/index/test/Jamfile.v2#L24 The rest of the tests is run with build-project, also for the main part of the library: https://github.com/boostorg/geometry/blob/develop/test/Jamfile.v2#L26 The varray tests results are shown on the regression page and can be found in bjam.log and in XML file with revision set. The rest of the tests is neither dumped nor has the revision set, however they are run during regression testing so can be found in bjam.log and also in XML file but with empty revision. Adam

2 5

Broken link to conversion library
by Antony Polukhin 29 Mar '17

29 Mar '17

Hello, There is a broken link to Conversion library on the changelog page: http://www.boost.org/users/history/version_1_64_0.html Can not figure out what's the problem. Could someone take a look? -- Best regards, Antony Polukhin

3 3

[Boost.Test] Custom DataSet compiler error with no match for »operator^
by Olaf Peter 29 Mar '17

29 Mar '17

Hello, I run into a compile problem with [Boost.Test] DataSet. I can reduce it by re-using the example provided by the docs: http://www.boost.org/doc/libs/1_62_0/libs/test/doc/html/boost_test/tests_or… #define BOOST_TEST_MODULE dataset_example68 #include <boost/test/included/unit_test.hpp> #include <boost/test/data/test_case.hpp> #include <boost/test/data/monomorphic.hpp> #include <sstream> namespace bdata = boost::unit_test::data; // Dataset generating a Fibonacci sequence class fibonacci_dataset { public: // Samples type is int using sample=int; enum { arity = 1 }; struct iterator { iterator() : a(1), b(1) {} int operator*() const { return b; } void operator++() { a = a + b; std::swap(a, b); } private: int a; int b; // b is the output }; fibonacci_dataset() {} // size is infinite bdata::size_t size() const { return bdata::BOOST_TEST_DS_INFINITE_SIZE; } // iterator iterator begin() const { return iterator(); } }; namespace boost { namespace unit_test { namespace data { namespace monomorphic { // registering fibonacci_dataset as a proper dataset template <> struct is_dataset<fibonacci_dataset> : boost::mpl::true_ {}; }}}} // Creating a test-driven dataset BOOST_DATA_TEST_CASE( test1, fibonacci_dataset() ^ fibonacci_dataset(), fib_sample, exp) { BOOST_TEST(fib_sample == exp); } error: no match for 'operator^' (operand types are 'boost::unit_test::data::result_of::make<fibonacci_dataset>::type {aka fibonacci_dataset}' and 'fibonacci_dataset') fibonacci_dataset() ^ fibonacci_dataset(), My use case has to load input and expect files provides by two datasets. How to fix it? Thanks, Olaf

3 3

Re: [boost] [Boost-users] Going insane trying to build boost for android
by Robert Dailey 29 Mar '17

29 Mar '17

On Mon, Mar 27, 2017 at 11:54 AM, John Maddock <jz.maddock(a)googlemail.com> wrote: > >> That won't do me any good because I'm already using this toolchain >> perfectly fine via CMake and ndk-build. bjam isn't working, maybe >> because I haven't set up the config.jam file properly. I'm not sure at >> this point. Boost is the only thing not working here. > > > Then if you compare the compilation command line generated when building > under b2 and when building under cmake the error should be obvious? I took your advice and compared a real build that worked using CMake (using a simple test cpp file) and what I got from b2. Here is the command line used to build the sample app using CMake. Note that the compilation succeeded: C:\android\ndk\toolchains\arm-linux-androideabi-4.9\prebuilt\windows-x86_64\bin\arm-linux-androideabi-g++.exe --sysroot=C:/android/ndk/platforms/android-15/arch-arm -Dndk_test_EXPORTS -isystem C:/android/ndk/sources/cxx-stl/llvm-libc++/include -isystem C:/android/ndk/sources/android/support/include -isystem C:/android/ndk/sources/cxx-stl/llvm-libc++abi/include -isystem C:/android/ndk/platforms/android-15/arch-arm/usr/include -march=armv7-a -mthumb -mfpu=vfpv3-d16 -mfloat-abi=softfp -funwind-tables -no-canonical-prefixes -fexceptions -frtti -g -fPIC -std=gnu++14 -MD -MT CMakeFiles/ndk_test.dir/main.cpp.o -MF CMakeFiles\ndk_test.dir\main.cpp.o.d -o CMakeFiles/ndk_test.dir/main.cpp.o -c ../main.cpp And here is the command line from b2: "C:/android/ndk/toolchains/llvm/prebuilt/windows-x86_64/bin/clang++" -c -x c++ -O3 -Wno-inline -Wall --sysroot=C:/android/ndk/platforms/android-15/arch-arm -isystem C:/android/ndk/sources/cxx-stl/llvm-libc++/include -isystem C:/android/ndk/sources/android/support/include -isystem C:/android/ndk/sources/cxx-stl/llvm-libc++abi/include -isystem C:/android/ndk/platforms/android-15/arch-arm/usr/include -std=c++14 -fno-strict-aliasing -D__GLIBC__ -DANDROID -D__ANDROID__ -D_GLIBCXX__PTHREADS -D__arm__ -D_REENTRANT -O2 -DNDEBUG -H -DBOOST_ALL_NO_LIB=1 -DBOOST_ATOMIC_SOURCE -DBOOST_ATOMIC_STATIC_LINK=1 -DNDEBUG -I"." -o "bin.v2\libs\atomic\build\clang-linux-android\release\link-static\target-os-android\threadapi-pthread\threading-multi\lockpool.o" "libs\atomic\src\lockpool.cpp" The build for boost still fails. Note I also passed the -H option, so I could see the include searches performed by clang as it was building boost. The output is long, but I've included it below. Can anyone help me identify why boost still won't build? clang-linux.compile.c++.without-pth bin.v2\libs\atomic\build\clang-linux-android\release\link-static\target-os-android\threadapi-pthread\threading-multi\lockpool.o "C:/android/ndk/toolchains/llvm/prebuilt/windows-x86_64/bin/clang++" -c -x c++ -O3 -Wno-inline -Wall --sysroot=C:/android/ndk/platforms/android-15/arch-arm -isystem C:/android/ndk/sources/cxx-stl/llvm-libc++/include -isystem C:/android/ndk/sources/android/support/include -isystem C:/android/ndk/sources/cxx-stl/llvm-libc++abi/include -isystem C:/android/ndk/platforms/android-15/arch-arm/usr/include -std=c++14 -fno-strict-aliasing -D__GLIBC__ -DANDROID -D__ANDROID__ -D_GLIBCXX__PTHREADS -D__arm__ -D_REENTRANT -O2 -DNDEBUG -H -DBOOST_ALL_NO_LIB=1 -DBOOST_ATOMIC_SOURCE -DBOOST_ATOMIC_STATIC_LINK=1 -DNDEBUG -I"." -o "bin.v2\libs\atomic\build\clang-linux-android\release\link-static\target-os-android\threadapi-pthread\threading-multi\lockpool.o" "libs\atomic\src\lockpool.cpp" . C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\cstddef .. C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\__config .. C:\\android\\ndk\\toolchains\\llvm\\prebuilt\\windows-x86_64\\bin\\..\\lib64\\clang\\3.8.275480\\include\\stddef.h ... C:\\android\\ndk\\toolchains\\llvm\\prebuilt\\windows-x86_64\\bin\\..\\lib64\\clang\\3.8.275480\\include/__stddef_max_align_t.h .. C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\__nullptr . .\\boost/config.hpp .. .\\boost/config/user.hpp .. .\\boost/config/select_compiler_config.hpp .. .\\boost/config/compiler/clang.hpp .. .\\boost/config/select_stdlib_config.hpp .. .\\boost/config/stdlib/libcpp.hpp .. .\\boost/config/select_platform_config.hpp .. .\\boost/config/platform/linux.hpp ... C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\cstdlib .... C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\stdlib.h ..... C:/android/ndk/sources/android/support/include\\stdlib.h ...... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\stdlib.h ....... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\sys/cdefs.h ........ C:/android/ndk/platforms/android-15/arch-arm/usr/include\\sys/cdefs_elf.h ........ C:/android/ndk/platforms/android-15/arch-arm/usr/include\\android/api-level.h ....... C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\stddef.h ........ C:\\android\\ndk\\toolchains\\llvm\\prebuilt\\windows-x86_64\\bin\\..\\lib64\\clang\\3.8.275480\\include\\stddef.h ....... C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\stddef.h ........ C:\\android\\ndk\\toolchains\\llvm\\prebuilt\\windows-x86_64\\bin\\..\\lib64\\clang\\3.8.275480\\include\\stddef.h ....... C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\string.h ........ C:/android/ndk/sources/android/support/include\\string.h ......... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\string.h .......... C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\stddef.h .......... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\malloc.h ........... C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\stddef.h ....... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\alloca.h ....... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\strings.h ........ C:/android/ndk/platforms/android-15/arch-arm/usr/include\\sys/types.h ......... C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\stddef.h .......... C:\\android\\ndk\\toolchains\\llvm\\prebuilt\\windows-x86_64\\bin\\..\\lib64\\clang\\3.8.275480\\include\\stddef.h ......... C:/android/ndk/sources/android/support/include\\stdint.h .......... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\stdint.h ........... C:/android/ndk/sources/cxx-stl/llvm-libc++/include\\stddef.h ........... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\sys/_types.h ............ C:/android/ndk/platforms/android-15/arch-arm/usr/include\\machine/_types.h ......... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\linux/posix_types.h .......... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\linux/stddef.h ........... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\linux/compiler.h .......... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\asm/posix_types.h ......... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\asm/types.h ......... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\linux/types.h ......... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\machine/kernel.h ......... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\sys/sysmacros.h ....... C:/android/ndk/platforms/android-15/arch-arm/usr/include\\memory.h In file included from libs\atomic\src\lockpool.cpp:16: In file included from .\boost/config.hpp:57: In file included from .\boost/config/platform/linux.hpp:15: C:/android/ndk/sources/cxx-stl/llvm-libc++/include\cstdlib:108:9: error: no member named 'strtold' in the global namespace using ::strtold; ~~^ C:/android/ndk/sources/cxx-stl/llvm-libc++/include\cstdlib:126:9: error: no member named '_Exit' in the global namespace using ::_Exit; ~~^ C:/android/ndk/sources/cxx-stl/llvm-libc++/include\cstdlib:149:9: error: no member named 'at_quick_exit' in the global namespace using ::at_quick_exit; ~~^ C:/android/ndk/sources/cxx-stl/llvm-libc++/include\cstdlib:150:9: error: no member named 'quick_exit' in the global namespace using ::quick_exit; ~~^

2 1

[review queue] What to do about the library review queue?
by Niall Douglas 28 Mar '17

28 Mar '17

Dear Boost, I see that new candidate Boost libraries entering the review queue have exploded in recent years, with no less than *twenty-three* proposed libraries awaiting a review. As the ongoing strength and vitality of Boost is inextricably linked to new growth, I think that waiting around for years for someone to volunteer to manage a review is not healthy. If a library author has invested the very significant effort to develop a Boost-quality library, the least Boost can do is to try harder to provide timely reviews and that means persuading more people to volunteer to manage reviews. In the past people have argued that for every library you submit for review, you should manage a review in return. Myself, Antony and a few others have adhered to that rule, and if every library author did so there would be no outstanding review queue. However there are problems in that in itself in terms of moral hazard, and also because the review manager needs to usually be fairly expert in a library being reviewed, else it can be very hard to judge the worth and validity of reviews. A shortage of suitably expert review managers will always be a problem for some types of library. I therefore ask boost-dev what to do? Some options: 1. Pay US$1000 (one thousand) dollars to each person who manages a review. In case you're worried Boost doesn't have the money, it does in spades, that's not a problem. For $23,000 we could clear the current review queue assuming none of the problems mentioned yet. 2. Pay US$1000 dollars to the manager and 2x $500 dollar payments to those writing the top two most useful reviews as judged by the review manager. That makes the cost $2000 per library accepted or rejected, or $46,000 to clear the current review queue. 3. In my own opinion from reviewing the review queue, a good 25% of the libraries in the queue are not ready for review due to obvious glaring deficiencies in the documentation or code. Spending a grand on those libraries which will very obviously be rejected isn't worth the money. What should we do about those? One approach could simply be to trust review managers to not abuse the thousand dollar fee. Another could be that before each new review, the prospective manager needs to write a single line comment on why they did not choose the other libraries in the queue and publish that here before starting a review. That would quickly identify those libraries in the queue which a majority of managers think have serious problems and could never pass any review. If say a library in a queue accumulates three single line black marks, the author might be encouraged to withdraw it. 4. Finally there is the problem of libraries of high quality, but not a good fit for Boost because they are so esoteric and niche that nobody could provide a useful review, and without useful reviews the review manager can't really recommend acceptance. This will be an increasing problem with time anyway as more of the low hanging C++ library fruit is picked, but I suppose one could just kick that decision can down the road and see if 2x $500 payments might help scare up more high quality reviews. 5. We could try guilting more people into review managing, and redouble banging the drum to scare up more volunteers. I look forward to seeing what people think. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

29 104

[1.64] Can't configure msvc-14.1
by John Maddock 28 Mar '17

28 Mar '17

So... I have in my user-config.jam: using msvc : 14.1 : "M:/Compilers/VC2017/VC/Tools/MSVC/14.10.25017/bin/HostX64/x64/cl.exe" ; And this did work at one point, but both with latest develop and master I now get: M:/data/boost/boost/tools/build/src/tools\msvc.jam:1103: in configure-really *** argument error * rule generate-setup-cmd ( version : command : parent : options * : cpu : global-setup ? : default-global-setup-options : default-setup ) * called with: ( 14.10.25017 14.10.25017 : M:/Compilers/VC2017/VC/Tools/MSVC/14.10.25017/bin/HostX64/x64 : M:\Compilers\VC2017\VC\Tools\MSVC\14.10.25017\bin\HostX64 : <command>M:\Compilers\VC2017\VC\Tools\MSVC\14.10.25017\bin\HostX64\x64\cl.exe <command>M:/Compilers/VC2017/VC/Tools/MSVC/14.10.25017/bin/HostX64/x64/cl.exe : i386 : : x86 : vcvars32.bat ) * extra argument 14.10.25017 M:/data/boost/boost/tools/build/src/tools\msvc.jam:811:see definition of rule 'generate-setup-cmd' being called M:/data/boost/boost/tools/build/src/tools\msvc.jam:201: in configure M:/data/boost/boost/tools/build/src/tools\msvc.jam:153: in msvc.init M:/data/boost/boost/tools/build/src/build\toolset.jam:43: in toolset.using M:/data/boost/boost/tools/build/src/build\project.jam:1052: in using C:\cygwin64\home\John\user-config.jam:46: in modules.load M:/data/boost/boost/tools/build/src\build-system.jam:249: in load-config M:/data/boost/boost/tools/build/src\build-system.jam:389: in load-configuration-files M:/data/boost/boost/tools/build/src\build-system.jam:524: in load M:\data\boost\boost\tools\build\src/kernel\modules.jam:295: in import M:\data\boost\boost\tools\build\src/kernel/bootstrap.jam:139: in boost-build M:\data\boost\boost\boost-build.jam:17: in module scope Anyone any ideas? Thanks, John. --- This email has been checked for viruses by AVG. http://www.avg.com

1 0

Clang 4.0.0 MPL error in Boost next.hpp and prior.hpp
by Paul A. Bristow 28 Mar '17

28 Mar '17

I am trying to check code that works on VS2015 update 3 and GCC 6.3.0 using Clang 4.0.0 I am using the CodeBlocks IDE (though I don't think that is relevant). The code indirectly uses next.hpp and prior.hpp There are several warnings like this (after adding the -Wignored-attributes option) C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\include\immintrin.h|45|warning: __declspec attribute 'intrin_type' is not supported [-Wignored-attributes] I:\modular-boost\boost\mpl\next_prior.hpp|44|error: too many arguments provided to function-like macro invocation| Following suggestions in this thread, I have added -Wno-invalid-token-paste http://clang-developers.42468.n3.nabble.com/invalid-token-paste-td4025526.h… and also -DBOOST_PP_CONFIG_FLAGS=1, but I get a blizzard of errors - see below It would seem that this may be because of a misconfiguration in Boost mpl? If I understand right, the thread above suggests that this is MS pre-processor-specific MPL code because of code in boost/preprocessor/config/config.hpp that determines the MPL code? Is this correct? Target: x86_64-pc-windows-msvc -triple x86_64-pc-windows-msvc19.0.24123 Complete log attached in case this helps. Can anyone say what I am doing wrong and/or suggest a workaround for this? Thanks Paul Compile line is clang++.exe -Wall -fexceptions -Wignored_attributes -D"BOOST_PP_CONFIG_FLAGS()"=1 -m64 -v -Wignored-attributes -Wno-invalid-token-paste -II:\modular-boost -I"C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\include" -c J:\Cpp\Misc\lambert_w_single\lambert_w_single.cpp -o .objs\Misc\lambert_w_single\lambert_w_single.o clang version 4.0.0 (tags/RELEASE_400/final) Target: x86_64-pc-windows-msvc Thread model: posix InstalledDir: C:\LLVM\bin "C:\\LLVM\\bin\\clang++.exe" -cc1 -triple x86_64-pc-windows-msvc19.0.24123 In file included from I:\modular-boost\boost/mpl/next.hpp:17: I:\modular-boost\boost/mpl/next_prior.hpp:44:23: error: too many arguments provided to function-like macro invocation BOOST_MPL_AUX_NA_SPEC(1, next) ^ I:\modular-boost\boost/preprocessor/facilities/expand.hpp:26:10: note: macro 'BOOST_PP_EXPAND_I' defined here # define BOOST_PP_EXPAND_I(x) x ^ In file included from I:\modular-boost\boost/mpl/next.hpp:17: I:\modular-boost\boost/mpl/next_prior.hpp:44:1: error: expected a qualified name after 'typename' BOOST_MPL_AUX_NA_SPEC(1, next) ^ I:\modular-boost\boost/mpl/aux_/na_spec.hpp:161:40: note: expanded from macro 'BOOST_MPL_AUX_NA_SPEC' #define BOOST_MPL_AUX_NA_SPEC(i, name) \ ^ I:\modular-boost\boost/mpl/aux_/na_spec.hpp:154:47: note: expanded from macro '\ BOOST_MPL_AUX_NA_SPEC_NO_ETI' #define BOOST_MPL_AUX_NA_SPEC_NO_ETI(i, name) \ ^ I:\modular-boost\boost/mpl/aux_/na_spec.hpp:64:11: note: expanded from macro '\ BOOST_MPL_AUX_NA_SPEC_MAIN' BOOST_MPL_PP_PARAMS(i, typename T) \ ^ I:\modular-boost\boost/mpl/aux_/preprocessor/params.hpp:58:11: note: expanded from macro 'BOOST_MPL_PP_PARAMS' , BOOST_MPL_PP_AUX_PARAM_FUNC \ ^ ... I:\modular-boost\boost/mpl/void.hpp:71:1: error: expected ',' or '>' in template-parameter-list I:\modular-boost\boost/mpl/aux_/na_spec.hpp:161:40: note: expanded from macro 'BOOST_MPL_AUX_NA_SPEC' #define BOOST_MPL_AUX_NA_SPEC(i, name) \ ^ I:\modular-boost\boost/mpl/aux_/na_spec.hpp:154:47: note: expanded from macro '\ BOOST_MPL_AUX_NA_SPEC_NO_ETI' #define BOOST_MPL_AUX_NA_SPEC_NO_ETI(i, name) \ ^ I:\modular-boost\boost/mpl/aux_/na_spec.hpp:65:9: note: expanded from macro '\ BOOST_MPL_AUX_NA_SPEC_MAIN' BOOST_MPL_PP_NESTED_DEF_PARAMS_TAIL(i, typename T, na) \ ^ note: (skipping 6 expansions in backtrace; use -fmacro-backtrace-limit=0 to see all) I:\modular-boost\boost/preprocessor/repetition/repeat.hpp:38:37: note: expanded from macro 'BOOST_PP_REPEAT_1' # define BOOST_PP_REPEAT_1(c, m, d) BOOST_PP_REPEAT_1_I(c, m, d) ^ I:\modular-boost\boost/preprocessor/repetition/repeat.hpp:43:39: note: expanded from macro 'BOOST_PP_REPEAT_1_I' # define BOOST_PP_REPEAT_1_I(c, m, d) BOOST_PP_REPEAT_1_ ## c(m, d) ^ <scratch space>:64:1: note: expanded from here BOOST_PP_REPEAT_1_BOOST_PP_REM ^ fatal error: too many errors emitted, stopping now [-ferror-limit=] --- Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 (0) 1539 561830

4 53

Constructing string_ref from rvalue string
by Simon Sasburg 28 Mar '17

28 Mar '17

I've just tested our codebase with the 1.64.0 master snapshot, and i've encountered an issue which i've tracked down to this commit: https://github.com/boostorg/utility/commit/9960d9f395b79ee860e39064cd4696 1f76d2cb55 Basically this removes the constructor which allows constructing a boost::string_ref from an rvalue std::string. I am wondering if this is really that dangerous. In our codebase we almost exlusively use boost::string_ref as function parameters, with the understanding that passed string_refs parameters are only valid within the function body. (so you need to copy it into an std::string if you need to access it afterwards) With these constraints i think it is OK to construct a string_ref from an rvalue std::string because the temporary should live long enough. (but please correct me if i'm wrong here) Is the safety (?) added by this commit worth it if it breaks working code? Simon

11 20

Undefined refs when compiling trivial example
by Florian Lindner 28 Mar '17

28 Mar '17

Hello, I took the trivial example from http://www.boost.org/doc/libs/1_63_0/libs/log/example/doc/tutorial_trivial.… and try to compile it. boost 1.63 is compiled by myself without any special options, besides --prefix. % echo $LD_LIBRARY_PATH /home/lindnefn/software/boost/lib: % echo $LIBRARY_PATH /home/lindnefn/software/boost/lib: % echo $CPLUS_INCLUDE_PATH /home/lindnefn/software/boost/include: the LIBRARY_PATH contains all the *.so and *.a files, the INCLUDE_PATH/boost all the headers. but compiling fails: lindnefn@helium ~ % g++ -std=c++11 -DBOOST_ALL_DYN_LINK -pthread -lboost_log_setup -lboost_log -lboost_thread -lboost_filesystem boostlog_trivial.cpp /tmp/ccUc6CtH.o: In function `main': boostlog_trivial.cpp:(.text+0x48): undefined reference to `boost::log::v2_mt_posix::trivial::logger::get()' boostlog_trivial.cpp:(.text+0x76): undefined reference to `boost::log::v2_mt_posix::trivial::logger::get()' boostlog_trivial.cpp:(.text+0xe8): undefined reference to `boost::log::v2_mt_posix::trivial::logger::get()' boostlog_trivial.cpp:(.text+0x116): undefined reference to `boost::log::v2_mt_posix::trivial::logger::get()' boostlog_trivial.cpp:(.text+0x188): undefined reference to `boost::log::v2_mt_posix::trivial::logger::get()' /tmp/ccUc6CtH.o:boostlog_trivial.cpp:(.text+0x1b6): more undefined references to `boost::log::v2_mt_posix::trivial::logger::get()' follow /tmp/ccUc6CtH.o: In function `boost::log::v2_mt_posix::record::reset()': boostlog_trivial.cpp:(.text._ZN5boost3log11v2_mt_posix6record5resetEv[_ZN5boost3log11v2_mt_posix6record5resetEv]+0x23): undefined reference to `boost::log::v2_mt_posix::record_view::public_data::destroy(boost::log::v2_mt_posix::record_view::public_data const*)' /tmp/ccUc6CtH.o: In function `boost::log::v2_mt_posix::record boost::log::v2_mt_posix::sources::basic_composite_logger<char, boost::log::v2_mt_posix::sources::severity_logger_mt<boost::log::v2_mt_posix::trivial::severity_level>, boost::log::v2_mt_posix::sources::multi_thread_model<boost::log::v2_mt_posix::aux::light_rw_mutex>, boost::log::v2_mt_posix::sources::features<boost::log::v2_mt_posix::sources::severity<boost::log::v2_mt_posix::trivial::severity_level> > >::open_record<boost::parameter::aux::tagged_argument<boost::log::v2_mt_posix::keywords::tag::severity, boost::log::v2_mt_posix::trivial::severity_level const> >(boost::parameter::aux::tagged_argument<boost::log::v2_mt_posix::keywords::tag::severity, boost::log::v2_mt_posix::trivial::severity_level const> const&)': boostlog_trivial.cpp:(.text._ZN5boost3log11v2_mt_posix7sources22basic_composite_loggerIcNS2_18severity_logger_mtINS1_7trivial14severity_levelEEENS2_18multi_thread_modelINS1_3aux14light_rw_mutexEEENS2_8featuresIJNS2_8severityIS6_EEEEEE11open_recordINS_9parameter3aux15tagged_argumentINS1_8keywords3tag8severityEKS6_EEEENS1_6recordERKT_[_ZN5boost3log11v2_mt_posix7sources22basic_composite_loggerIcNS2_18severity_logger_mtINS1_7trivial14severity_levelEEENS2_18multi_thread_modelINS1_3aux14light_rw_mutexEEENS2_8featuresIJNS2_8severityIS6_EEEEEE11open_recordINS_9parameter3aux15tagged_argumentINS1_8keywords3tag8severityEKS6_EEEENS1_6recordERKT_]+0x3c): undefined reference to `boost::log::v2_mt_posix::core::get_logging_enabled() const' /tmp/ccUc6CtH.o: In function `boost::log::v2_mt_posix::aux::record_pump<boost::log::v2_mt_posix::sources::severity_logger_mt<boost::log::v2_mt_posix::trivial::severity_level> >::~record_pump()': boostlog_trivial.cpp:(.text._ZN5boost3log11v2_mt_posix3aux11record_pumpINS1_7sources18severity_logger_mtINS1_7trivial14severity_levelEEEED2Ev[_ZN5boost3log11v2_mt_posix3aux11record_pumpINS1_7sources18severity_logger_mtINS1_7trivial14severity_levelEEEED5Ev]+0x4b): undefined reference to `boost::log::v2_mt_posix::aux::unhandled_exception_count()' [...] I also tried to omit -DBOOST_ALL_DYN_LINK, add -static instead or use clang++ instead of g++. I also tried to shuffle the order of -l ... All gives the same error. Build machine is a Ubuntu 16.04.4 , g++ 5.4.0. What could be wrong? Thanks, Florian

2 1

Re: [boost] [gsoc17]The implement of Programming competency test From Ruoyun Jing
by Ruoyun Jing 28 Mar '17

28 Mar '17

Hi Adam and Vissarion, During these days I discussed the ideas of project 1 and begin to write my proposal. Here are what I learn about these project. 1.For the approach of compute the 3D cartesian distances first and if these numbers are not "far enough" then fall back to expensive geographic distance calculation otherwise return the result by comparing those numbers obtained by less expensive cartesian compuation. The main problems is declare the "far enough". To figure out this problem, I would implement the method, test the result between function compare_distance and this method, then adjust parameter to limit deviation in an acceptable range(maybe it would be 1e-6 correapongs, the accurate value should be discussed by specific condition) 2.For the approach of perform a local spheroid approximation and return the 2D distance. The main problem is to test the acceptable range of using spheroid approximation. The solution is same as answer above. 3.For the approach of getting 2 intersections of plane (which would be ellipse) with the help given points and compute the respective distances using those ellipses. In my understand of these approach, it means we need to get cross-section through the center of ellipsoid and the geodesic segments. But I am not sure that the geodesic segments of two points whether can get a cross-section through the center of ellipsoid, and whether the cross-section is ellipse that we can calculate the sectorial area easy to compare. After check out the geodesic knowledge from differential geometry for a long time. I got some prove, but I think it isn't very reliable. 4.I have an reliable approach is that we could use the algorithms in "map projection" just like Lambert Conformal Conic, Gauss–Krüger projection, Mercator projection...etc, Those projections make the point on 3D to 2D with reliable functions, although most of these projections use longitude and latitude, we could transform our cartisian coordinate into Spherical coordinate then transform them into longitude and latitude then use the projection to approximately calculate. All of above is what I discussed during these days, Could you please provide me some advise about them so I can strenthen my proposal?And if there has any problems about my poor English description please tell me, I will try my best to explain more clearly:) Thanks all for your reading! Looking forward from you.:) Ruoyun -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

2 3

My Proposal for GSoC
by Mukund Chandra 28 Mar '17

28 Mar '17

Dear Sir, I want you to review the draft of my proposal and suggest me what I should do so that I can work with this project. The project is Project 1 for Boost.Geometry about filtering of compare distance predicates. Here is the link for my Proposal Draft : https://github.com/MukundChandra/Programs-For-GSoC/blob/MukundChandra-patch…

2 1

[gsoc2017] Applying for Boost.Geometry Project 1
by NowhereMan 28 Mar '17

28 Mar '17

Hello, I wish to pursue a path in GSOC 2017 with boost, specifically Project 1 which involves optimization of compare distance predicates. My name is Cody Glassman, a first-year student at my local Community College in Southern California, on a path to obtaining my BS in Computer Science from the University of California system. I am currently working hard developing a concise, yet thorough competency test and am hoping to establish contact with a mentor. Thank you! Cody -- View this message in context: http://boost.2283326.n4.nabble.com/gsoc2017-Applying-for-Boost-Geometry-Pro… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

small_vector alignment
by Tobias Loew 28 Mar '17

28 Mar '17

Hi, I wanted to use a boost::container::small_vector for 64-bit aligned doubles (to be used with SSE): But it seems that the "small-buffer" has a fixed calculated alignment which only depends on the value-type and does not consider the alignment of the (dynamic) allocator. Is this intended or is it a bug in the implementation? best regards Tobias -- View this message in context: http://boost.2283326.n4.nabble.com/small-vector-alignment-tp4692694.html Sent from the Boost - Dev mailing list archive at Nabble.com.

4 5

[geometry] Documentation garbage (Re: [Boost-announce] [release] Boost 1.64.0 Beta 1)
by Mateusz Loskot 28 Mar '17

28 Mar '17

On 23 March 2017 at 15:11, Rene Rivera <boost(a)lists.boost.org> wrote: > Boost release 1.64.0 beta 1 is now available at: > [...] > Please download the beta, give it a try, and report any problems you > encounter. I noticed, the package consists of intermediate files from docs generation process of Boost.Geometry: /libs/geometry/doc/doxy/doxygen_output/html_by_doxygen /libs/geometry/doc/doxy/doxygen_output/xml May I ask how documentation of individual library makes it into the package? /libs/geometry/doc/Jamfile.v2 calls our custom make_qbk.py script which is known to not to do any post-generation clean-ups of intermediate files. Shall we add such cleanup to make_qbk.py or it is not relevant for release process? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

2 3

[gsoc17]Dynamic Shortest Path Computation
by A.I 28 Mar '17

28 Mar '17

Hi, everyone, I am Donghyuk Kim, a Ph.D. Student at KAIST(Korea Advanced Institute of Science and Technology) in South Korea. I've been studying motion/path planning algorithm and I'd like to contribute to a specific algorithm, "Dynamic Shortest Path Computation" in Boost graph library as a google summer code project. It is a tree-based data structure for maintaining single-source to all destination shortest path. It is also known that it outperforms the recomputation of Dijkstra or A* where insertion and deletion of vertex/edge can frequently happen. Here you can check my brief CV including educational/programming background and my interests. https://www.linkedin.com/in/donghyuk-kim-54223355/ Most of my source codes (research/project-purpose things) are in a private repository by our policy, for this reason, the only thing I can share is the below one: https://github.com/aidyk/SGMP The concept of "Dynamic Shortest Path Computation" was originally introduced in [Fully Dynamic Algorithms for Maintaining Shortest Paths Trees] by D. Frigioni, et al. (http://dl.acm.org/citation.cfm?id=338900) I've already implemented a prototype for my research, but testing, coding style unification and much more c++ style modification are required for general purpose. I hope someone find it interesting and be a mentor in this journey. Thanks in advance! Best Regards, Donghyuk Kim a.i(a)acm.org -- View this message in context: http://boost.2283326.n4.nabble.com/gsoc17-Dynamic-Shortest-Path-Computation… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

GSOC Project
by Umar Ali 28 Mar '17

28 Mar '17

I am a Computer Science student trying to apply with MariaDB in GSOC. I have a basic knowledge of SQL and a deeper understanding of C++, and was wondering whether I would have to come up with a project idea inorder to file a proposal or can i submit a proposal inorder to learn without any deeper understanding of programming languages

3 2

[review queue] Beast Review Date - Request
by Michael Caisse 28 Mar '17

28 Mar '17

Hello Wizards! We would like to schedule the Beast review (already in the queue) for the week of July 1 - July 8. Thanks! michhael -- Michael Caisse Ciere Consulting ciere.com

2 1

[release] Boost 1.64.0 Beta 1
by Rene Rivera 27 Mar '17

27 Mar '17

Boost release 1.64.0 beta 1 is now available at: <https://dl.bintray.com/boostorg/beta/1.64.0.beta.1/source/> The SHA256 checksums are as follows: 8f0ba6b73fad15115049f9b3e7e27eae43be10a94b51a57142f3a27e55ef4beb boost_1_64_0_b1.7z b5c5abf127a3f723dafcc7cf55876c1bda9f014fb1b117f6a7f769e3cc407c4f boost_1_64_0_b1.tar.bz2 a7fe98a9a9f615f6fa68d8ea09ce725d19e3a4fe4719c21c9db29dff88b3b6e3 boost_1_64_0_b1.tar.gz 593005661af8dfe132b2b16bc2cd41339e6acd58456913f353d765090d7868f7 boost_1_64_0_b1.zip For details of what's in the release, see < http://www.boost.org/users/history/version_1_64_0.html>. Note that the links to files on this web page are for the final release - use the link above to get the beta files. There are also pre-built libraries provided by Tom Kent here: <https://dl.bintray.com/boostorg/beta/1.64.0.beta.1/binaries/> Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

11 26

Going insane trying to build boost for android
by Robert Dailey 26 Mar '17

26 Mar '17

How many months has it been of lost google searching, trying to beat b2 into submission. I have no idea at this point how to build boost for Android. Really hoping I get some help here... So to start, here are the versions I'm using: - Android NDK r14b - Boost 1.63.0 I'm doing all of this on Windows 10, through command prompt. I want to use clang and libc++ to build boost for API 15. I figure the easiest way is to generate a standalone toolchain using the NDK, so I did that first: > %ANDROID_NDK%\build\tools\make_standalone_toolchain.py --arch arm --api 15 --stl libc++ "C:\android\_toolchains\arm-api-15" This generated the appropriate toolchain (I think). I then temporarily added this location to PATH: > set PATH=C:\android\_toolchains\arm-api-15\bin;%PATH% Then I ran bootstrap: > bootstrap.bat --with-toolset=clang Then I tried to build boost itself: > b2 --toolset=clang cxxflags="-stdlib=libc++ -std=c++14" threadapi=pthread --prefix=..\boost_android_arm --builddir=./ target-os=linux define=BOOST_FILESYSTEM_VERSION=3 --without-python link=static runtime-link=shared threading=multi variant=release install -j8 However I get failures when it tries to run the clang command: 'C:\code\_third_party\boost_1_63_0\\clang38++.exe' is not recognized as an internal or external command I'm not sure why it's appending that absolute path (that's where my current directory is set to, and where boost source is). It should just be trying to use "clang++" but doesn't look like it is. >From the output, it looks like it's trying to use clang correctly I think: "clang++" -c -x c++ -stdlib=libc++ -std=c++14 -O3 -Wno-inline -Wall -pthread -stdlib=libc++ -std=c++14 -DBOOST_ALL_NO_LIB=1 -DBOOST_FILESYSTEM_VERSION=3 -DBOOST_THREAD_USE_LIB=1 -DNDEBUG -I"." -o "bin.v2\libs\wave\build\clang-linux-android\release\link-static\target-os-linux\threadapi-pthread\threading-multi\cpplexer\re2clex\aq.o" "libs\wave\src\cpplexer\re2clex\aq.cpp" Am I going about this all wrong? How in the heck can I build boost for android using the settings I specified above?

2 4

[SIMD] Pre-review questions
by Artyom Beilis 26 Mar '17

26 Mar '17

Hello, I have several questions regarding Boost.SIMD (for pre-review) 1. What is boost::simd::pack::storage_type I can't find it in documentation. Is it the "native register" like __m128i for pack<int,4>? If the answer is no, how do I get access to underlying type? 2. I can't find in documentation how to performs casts between different types: I see in docs split_low (actually after I grepped for _mm_unpacklo) but I failed to find how to use one - there is no documentation regarding conversion/casting operation or at least I failed to find one. 3. Is there more convenient way to perform basic saturated operation for example if I want to calc abs diff of two bs::pack<unsigned char,16> values a,b I need to write bs::saturated_(be::minus)(a,b) + bs::saturated_(bs::minus)(b,a) It is quite inconvenient especially when most of operations you want to do are saturated. 4. Why Boost.SIMD is restricted to C++11? Most of the stuff is implementable withing C++2003, it severely limits the usability of the library for existing projects that can't trivially switch to new C++ standard (and there are too many in the "real world" industry) Thanks, Artyom

2 3

Boost Logo usage questions
by Antony Polukhin 26 Mar '17

26 Mar '17

Hello, What are the rules for the Boost logo usage? Can I use the Boost logo on a cover of the Boost related book ? What are the permissions for the library logos (for example https://github.com/boostorg/test/blob/develop/doc/html/images/boost.test.lo… )? -- Best regards, Antony Polukhin

1 0

[asio]ssl::detail::stream_core is accessed after destruction
by Takatoshi Kondo 26 Mar '17

26 Mar '17

Hello, I'm using Boost.Asio. I compiled some TLS client with clang address sanitizer. (I attached the result the last part of this mail.) It indicates that the following `expires_at` member function calling is bad: https://github.com/boostorg/asio/blob/boost-1.63.0/include/boost/asio/ssl/d… So I insert debug print "stream_core() address" to the constructor of ssl::detail::stream_core https://github.com/boostorg/asio/blob/boost-1.63.0/include/boost/asio/ssl/d… "~stream_core() address" to the destructor, https://github.com/boostorg/asio/blob/boost-1.63.0/include/boost/asio/ssl/d… and "io stream_core address of core_" to `expires_at` calling point: https://github.com/boostorg/asio/blob/boost-1.63.0/include/boost/asio/ssl/d… And then, I got the following result: stream_core() 0x6120012beb60 constructor ~stream_core() 0x6120012ca6e0 connected. previous session = false stream_core() 0x6120012ba060 ~stream_core() 0x6120012beb60 destructor io stream_core 0x6120012beb60 call Is seems that `expires_at` at https://github.com/boostorg/asio/blob/boost-1.63.0/include/boost/asio/ssl/d… is called after core_ 's destructor is called. The problem happens a part of big project. The client connects to the server as TLS-stream, then server shutdown the stream, then client connects again. The program does the sequence repeatedly. The error happens the client side. I'm trying to write a minimal and complete code that reproduces the problem, but not yet. So I report the result only as the first report. The result of clang address sanitizer ---------------------------------------------------------------------------------- SUMMARY: AddressSanitizer: heap-use-after-free /usr/include/boost/asio/basic_deadline_timer.hpp:344:27 in boost::asio::basic_deadline_timer<boost::posix_time::ptime, boost::asio::time_traits<boost::posix_time::ptime>, boost::asio::deadline_timer_service<boost::posix_time::ptime, boost::asio::time_traits<boost::posix_time::ptime> > >::expires_at(boost::posix_time::ptime const&) Shadow bytes around the buggy address: 0x0c248024fd20: fd fd fd fd fd fd fd fd fd fd fa fa fa fa fa fa 0x0c248024fd30: fa fa fa fa fa fa fa fa fd fd fd fd fd fd fd fd 0x0c248024fd40: fd fd fd fd fd fd fd fd fd fd fd fd fd fd fd fd 0x0c248024fd50: fd fd fd fd fd fd fd fd fd fd fa fa fa fa fa fa 0x0c248024fd60: fa fa fa fa fa fa fa fa fd fd fd fd fd fd fd fd =>0x0c248024fd70: fd fd fd fd fd fd[fd]fd fd fd fd fd fd fd fd fd 0x0c248024fd80: fd fd fd fd fd fd fd fd fd fd fd fa fa fa fa fa 0x0c248024fd90: fa fa fa fa fa fa fa fa fd fd fd fd fd fd fd fd 0x0c248024fda0: fd fd fd fd fd fd fd fd fd fd fd fd fd fd fd fd 0x0c248024fdb0: fd fd fd fd fd fd fd fd fd fd fd fd fa fa fa fa 0x0c248024fdc0: fa fa fa fa fa fa fa fa fd fd fd fd fd fd fd fd Shadow byte legend (one shadow byte represents 8 application bytes): Addressable: 00 Partially addressable: 01 02 03 04 05 06 07 Heap left redzone: fa Heap right redzone: fb Freed heap region: fd Stack left redzone: f1 Stack mid redzone: f2 Stack right redzone: f3 Stack partial redzone: f4 Stack after return: f5 Stack use after scope: f8 Global redzone: f9 Global init order: f6 Poisoned by user: f7 Container overflow: fc Array cookie: ac Intra object redzone: bb ASan internal: fe Left alloca redzone: ca Right alloca redzone: cb ==11437==ABORTING ---------------------------------------------------------------------------------- heap use after free occurs the following code: ---------------------------------------------------------------------------------- ==11437==ERROR: AddressSanitizer: heap-use-after-free on address 0x6120012bebb0 at pc 0x000000749b30 bp 0x7ffccc310470 sp 0x7ffccc310468 READ of size 8 at 0x6120012bebb0 thread T0 #0 0x749b2f in boost::asio::basic_deadline_timer<boost::posix_time::ptime, boost::asio::time_traits<boost::posix_time::ptime>, boost::asio::deadline_timer_service<boost::posix_time::ptime, boost::asio::time_traits<boost::posix_time::ptime> > >::expires_at(boost::posix_time::ptime const&) /usr/include/boost/asio/basic_deadline_timer.hpp:344:27 #1 0x748e21 in 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::write_op<boost::asio::mutable_buffers_1>, boost::asio::detail::write_op<boost::asio::ssl::stream<boost::asio::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> > >, boost::asio::mutable_buffers_1, boost::asio::detail::transfer_all_t, boost::asio::detail::wrapped_handler<boost::asio::io_service::strand, mqtt::endpoint<boost::asio::ssl::stream<boost::asio::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> > >, boost::asio::io_service::strand, std::mutex, std::lock_guard>::write_completion_handler, boost::asio::detail::is_continuation_if_running> > >::operator()(boost::system::error_code, unsigned long, int) /usr/include/boost/asio/ssl/detail/io.hpp:260:32 #2 0x7590e7 in boost::asio::detail::write_op<boost::asio::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> >, boost::asio::mutable_buffers_1, boost::asio::detail::transfer_all_t, 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::write_op<boost::asio::mutable_buffers_1>, boost::asio::detail::write_op<boost::asio::ssl::stream<boost::asio::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> > >, boost::asio::mutable_buffers_1, boost::asio::detail::transfer_all_t, boost::asio::detail::wrapped_handler<boost::asio::io_service::strand, mqtt::endpoint<boost::asio::ssl::stream<boost::asio::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> > >, boost::asio::io_service::strand, std::mutex, std::lock_guard>::write_completion_handler, boost::asio::detail::is_continuation_if_running> > > >::operator()(boost::system::error_code const&, unsigned long, int) /usr/include/boost/asio/impl/write.hpp:269:9 Thanks, Takatoshi Kondo

1 0

Re: [boost] Formal Review Request: mp11
by Bjorn Reese 25 Mar '17

25 Mar '17

On 03/17/2017 03:06 PM, Peter Dimov via Boost wrote: > https://github.com/pdimov/mp11/ A few comments... Most algorithms take the typelist as the first argument, but others do not, e.g. mp_transform<F, L...>. If possible, I would like to see all algorithms take typelist as the first argument. It looks like the current order is dictated by the requirements of mp_tranform_impl. Would it be possible to swap the types where the algorithm is declared? For example: template<class L, template<class...> class F> using mp_transform = typename detail::mp_transform_impl<F, L>::type; Apropos mp_transform, would it be possible to extend it such that we can pass a type-trait directly to it? For example: using const_list = mp_transform<std::add_const, typelist>; instead of using std::add_const_t. The reason I ask is that I have lots of my own domain-specific type-traits that does not come with a _t version, so this is mainly for convenience. The reference documentation is a bit terse and obscure. For example, the documentation for mp_find tells us in a convoluted way that it returns the index of a type in a typelist. It could also mention that it is the dual algorithm to mp_at, which returns a type at an index in a typelist.

3 9

I want to hire you to write some docs!
by Vinnie Falco 25 Mar '17

25 Mar '17

I'm interested in hiring someone for a contract to finish up the NuDB documentation (repository is here: https://github.com/vinniefalco/NuDB) Its not a tremendous amount of work but I don't want to shift gears from Beast, and this could be a launching point for future doc work. Feel free to reach out to my email, its listed on my GitHub page (https://github.com/vinniefalco) Thanks!!!

1 0

[stacktrace] Review
by Bjorn Reese 25 Mar '17

25 Mar '17

I vote for the unconditional acceptance of Boost.Stacktrace. The design is sound. The separation of stacktrace and frame is just right, and safe_dump_to is an elegant solution to handle async-safety (much better than the fork-exec alternative.) The implementation (I did not look at the Windows parts) looks solid. There are details that looks platform-specific -- e.g. "/proc/self/exe" in detail/addr2line_impls.hpp is not Posix -- but I did not notice anything that cannot be ported if needed. The documentation is well-structured. I appreciate that the reference documentation contains both complexity and async-handler-safety comments. This library is very useful to developers. I spent a couple of hours going through the documentation and source for the review. Prior to that I have followed the development of this library, and used an earlier version in a commercial product. I have in-depth knowledge of the Posix side (having once implemented an async-safe stacktrace.) Wishlist: Make throw_with_trace of the API. Put it in a separate header so there is no dependency on Boost.Exception unless this header is included. In order to be consistent with Boost.Exception I suggest that the throwing function is called stacktrace::throw_exception(). Add an example with basic_stacktrace that uses a custom allocator. Add a simpler example that uses std::terminate(). The current one is rather overwhelming. Notice that I am not asking for the current example to be removed. Minor comments: Add a note to Getting Started that the stored backtrace.dump only is valid if the program has not be re-compiled between runs, as this is what developers do all the time. I have no opinion about windows.h.

1 0

[stacktrace] library review
by Artyom Beilis 25 Mar '17

25 Mar '17

Hello, There is my review. Note: I reviewed the library in previous round and voted no. So the current review was mostly review of the problems I found. - What is your evaluation of the design? The design is solid and minimalist as it suppose to be for such a library. Good separation for different backends. I still lack the out of the box "throw exception with stacktrace"/catch and print trace as I written in previous review but I don't think it is show stopper. i.e. "throw_with_trace" as shown in examples should be part of the library as it is one of most useful features. - What is your evaluation of the implementation? The implementation is OK but there are several issues (mostly in backend) I need to point out: I used this trivial program for run time testing #include <boost/stacktrace.hpp> #include <iostream> void foo() { std::cout << boost::stacktrace::stacktrace() << std::endl; } void bar() { foo(); } int main() { bar(); } Addr2Line Backend: --------------------------- In order to get the stacktrace the addr2line is called for each frame - i.e. stack of 4 functions results in 4(!!!) forks need to be fixed This is sample of stace output for trivial example, it can be reduced to 2 fork/exec at most [pid 7985] execve("/usr/bin/addr2line", ["addr2line", "-Cpe", "./a.out", "0x000000000040AFC2"], [/* 75 vars */]) = 0 [pid 7986] execve("/usr/bin/addr2line", ["addr2line", "-Cpe", "./a.out", "0x000000000040B02D"], [/* 75 vars */]) = 0 [pid 7987] execve("/usr/bin/addr2line", ["addr2line", "-Cpe", "./a.out", "0x000000000040B039"], [/* 75 vars */]) = 0 [pid 7988] execve("/usr/bin/addr2line", ["addr2line", "-Cpe", "/lib/x86_64-linux-gnu/libc.so.6", "0x00007EFD582A6830"], [/* 75 vars */]) = 0 [pid 7989] execve("/usr/bin/addr2line", ["addr2line", "-Cpe", "./a.out", "0x000000000040AEB9"], [/* 75 vars */]) = 0 This is something easy to fix and I expect it to be fixed before library is delivered to the official release. Libbacktrace Backend: ------------------------------ Linux: using libbacktrace without debug information results core dump - seems, the dump happens in ::backtrace_pcinfo happens for both g++ 4.8 and 5.4 Please make sure you can workaround this problem. This MUST be fixed. Windows/MinGW I build libbacktrace for mingw (tested it to make sure I can get traces using its API) However when I used boost.stacktrace with libbacktrace the program crashed every time in any configuration I used (with or without debug information) it worked with default build (without) but its usability is limited. This MUST be fixed (or if impossible mark as libbacktrace unusable for MINGW32) OS Support FreeBSD ------------------------------- FreeBSD - 100% unusable at this point - also I must say for FreeBSD it may be tricky due to : I needed to do some changes in CppCMS's backtrace library recently due to shift of latest freebsd to clang Take a look: https://github.com/artyom-beilis/cppcms/commit/18c3f05bfa9e4008aeac39322e8a… https://github.com/artyom-beilis/cppcms/blob/master/booster/lib/backtrace/s… It also may say that you WILL have problems with Mac OS X. $ c++ -v FreeBSD clang version 3.8.0 (tags/RELEASE_380/final 262564) (based on LLVM 3.8.0) Target: x86_64-unknown-freebsd11.0 Thread model: posix InstalledDir: /usr/bin $ uname -a FreeBSD freebsd11 11.0-RELEASE-p1 FreeBSD 11.0-RELEASE-p1 #0 r306420: Thu Sep 29 01:43:23 UTC 2016 root@releng2.nyi.freebsd.org:/usr/obj/usr/src/sys/GENERIC amd64 $ c++ -I ../boost_stacktrace/include/ -I ../boost_1_63_0/ -Wall -O0 -g st.cpp In file included from st.cpp:1: In file included from ../boost_stacktrace/include/boost/stacktrace.hpp:15: In file included from ../boost_stacktrace/include/boost/stacktrace/frame.hpp:205: In file included from ../boost_stacktrace/include/boost/stacktrace/detail/frame_unwind.ipp:36: ../boost_stacktrace/include/boost/stacktrace/detail/safe_dump_posix.ipp:36:63: error: use of undeclared identifier 'S_IFREG' const int fd = ::open(file, O_CREAT | O_WRONLY | O_TRUNC, S_IFREG | S_IWUSR | S_IRUSR); ^ ../boost_stacktrace/include/boost/stacktrace/detail/safe_dump_posix.ipp:36:73: error: use of undeclared identifier 'S_IWUSR' const int fd = ::open(file, O_CREAT | O_WRONLY | O_TRUNC, S_IFREG | S_IWUSR | S_IRUSR); ^ ../boost_stacktrace/include/boost/stacktrace/detail/safe_dump_posix.ipp:36:83: error: use of undeclared identifier 'S_IRUSR' const int fd = ::open(file, O_CREAT | O_WRONLY | O_TRUNC, S_IFREG | S_IWUSR | S_IRUSR); ^ In file included from st.cpp:1: In file included from ../boost_stacktrace/include/boost/stacktrace.hpp:15: In file included from ../boost_stacktrace/include/boost/stacktrace/frame.hpp:205: ../boost_stacktrace/include/boost/stacktrace/detail/frame_unwind.ipp:75:7: error: no member named '_Unwind_Backtrace' in the global namespace ::_Unwind_Backtrace(&boost::stacktrace::detail::unwind_callback, &state); ~~^ st.cpp:3:14: warning: treating Unicode character as whitespace [-Wunicode-whitespace] void foo() { std::cout << boost::stacktrace::stacktrace() << std::endl; } ^ st.cpp:3:17: warning: treating Unicode character as whitespace [-Wunicode-whitespace] void foo() { std::cout << boost::stacktrace::stacktrace() << std::endl; } ^ st.cpp:4:14: warning: treating Unicode character as whitespace [-Wunicode-whitespace] void bar() { foo(); } ^ 3 warnings and 4 errors generated. I have another suggestion regarding testing. I didn't run them but since you didn't catch crash with libbacktrace without debug mode you probably have all compiled with debug information I suggest to modify the set of tests that you run on entire matrix: {backend}x{debug mode on/off/external PDB/debug information}x{rdynamic on/off} - What is your evaluation of the documentation? Documentation is fairly good - What is your evaluation of the potential usefulness of the library? VERY useful one the bugs are fixed. - Did you try to use the library? With what compiler? Yes: I tested on Linux gcc 5.4/4.8/clang++ Windows MinGW 5.x; FreeBSD clang 3.8 > Did you have any problems? Lots - see notes above. - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? Several hours running code reading backeds code. - Are you knowledgeable about the problem domain? Yes I had written one for CppCMS that runs on many platforms. And finally, every review should attempt to answer this question: - Do you think the library should be accepted as a Boost library? Yes, Subject to: - Fix of build/run issues on all major platforms including MINGW and FreeBSD - it was too easy to find issues I really concerns me - it is show stopper for the library to be released as part of boost. - FIx crashes with libbacktrace - Fix of addr2line performance - no need to fork/exec for each frame Note: I understand that it is hard for the author to fix all stuff on all platforms - but stacktrace by definition is doing something non portable in portable way. Best Regards, Artyom Beilis

1 0

Boost MSM parallel behavior with delayed self-transitions?
by Christophe Henry 24 Mar '17

24 Mar '17

Hi Danylo, >Hi Christophe, > >Thanks for your input. I'm going to use std::thread for the parallel >functionality, I think. it will work with synchronization. For simple cases it's manageable. >How stable/complete is Asynchronous? Can I rely on >it, or would I still have a moderate chance of running into bugs? It's very stable and used intensively in production code (in the industry) since 2 years. You might find some bug of course, but no stability problem has been found since a long time. > >Best, > >Danylo. > >PS. I love your documentation! What do you use for state machine diagrams - >MagicDraw? Enterprise Architect. Regards, Christophe

2 4

[Stacktrace] - review comments
by mbartosik 24 Mar '17

24 Mar '17

There are a few major uses of a stack trace library which have differing needs. 1) Fast signal-safe gathering of the stack frames the current thread (something that can run in either a Windows VectoredExceptionHandler or a unix Signal handler). 2) Gather of the stack frames for an exception in the current thread. 3) Gathering of stack frames for the current thread even if it means remote loading of symbol files. 4) Gathering of the stack frames for a paused thread (could even be in a different process). 5) Resolving symbols which is a VERY heavy weight task, potentially resolving symbols long after the target process for which the stack trace was made has exited. e.g. deserializing a stack trace from a log file and creating an annotated version with symbols added. In the case where I what to gather a stack trace for the current thread while handing a seg-fault or first-chance exception call I want to gather a code pointer for each stack frame efficiently (meaning no more than one pointer per frame, and no unnecessary calls or remote symbol loads) I believe that the library does address this, however, I am unsure of whether it can be requested to be more or less aggressive in what it does to walk the stack of highly optimized code, for example, in the most aggressive case it could cause symbols to be remotely downloaded from a webserver (e.g. http://msdl.microsoft.com/download/symbols) to download Microsoft .PDB files which contain information necessary to walk the stack of highly optimized code. I would like to see some control over how aggressive it is in walking the stack. On x86 the least aggressive would be walking the ESP / EBP+retaddr singly linked chain, the most aggressive would be to remote download .PDB files and use one of the Microsoft APIs to do the walking. I am unsure that it can gather a stack trace from a different thread. This is admittedly a less common case, and possibly not worth holding up the library for, although it would be good to hear how the author thinks such a library interface would look. Is there / should there be, any control over what is included in the frame to_string() e.g. should all arguments be included, should full path of source file be included? If so how is this to be controlled? If not then should what going in there be documented? Now for the major issue. I asked earlier at what point does symbol resolution happen, and I was told it is on-demand and that the storage per frame is a single pointer, implying that there is no caching. Since resolving symbols is very very expensive it is desirable to have caching of function/frame names. I can certainly image a developer streaming a frame to the a log file multiple times and then being surprised when his/her program slows down orders of magnitude. Caching of frame names is contrary to the idea of having just one pointer stored per frame. This makes me wonder if the underlying OS or library calls provide sufficient caching to avoid the cost of a second call to boost::stacktrace::frame::to_string being too great? Resolving of the symbols requires not just an absolute address, but if symbols are to be resolved 'after exit'/post mortem by another process it requires the RVA (relative virtual address) and the module for code (e.g. path to shared library / dll, etc.) This can be deduced from the absolute virtual address in the process, plus the module load address (which maybe different each time the module loads). What I would like to see is the ability to have an efficient stack trace object that requires only one pointer per frame. Plus something that is able to resolve symbols,* including post-mortem after a process has exited*. These two goals I think result in multiple classes. A light weight stacktrace class, in here to_string() would yield a pointer value. A symbolic_stacktrace class, in here to_string() would yield a human readable symbol resolved string. For the case of creating a symbolic_stacktrace from a serialized stacktrace post-mortem a module_list would also be required, in the case that the same process is used a symbolic_stacktrace would be creatable only from a stacktrace. Whether boost::stacktrace::frame stores a void * or a function pointer is a little interesting -- as technically the pointers are not function pointers but usually code pointers as they do not point to the beginning on a function. Having said all this, the current design does cover a simple case. Summary: * Control of how aggressive stack walking is. * Ability to walk stack of another thread including in another process. * boost::stacktrace::frame::to_string should be efficient for 2nd and 3rd and multiple calls, but not require more than a single pointer to be stored in the boost::stacktrace::frame. This implies either a different class for symbol resolution or external caching. * Control over what boost::stacktrace::frame::to_string includes (or define it). * Ability to work with post-mortem data. e.g. serialize a boost::stacktrace plus other information (a list of modules) and then deserialize and resolve symbols after the process has exited. * Work with boost serialization - Mark -- View this message in context: http://boost.2283326.n4.nabble.com/Stacktrace-review-comments-tp4692904.html Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Using clang 4.0.0 with b2/bjam fails missing cstddef in boost/config/select_stdlib_config.hpp
by Paul A. Bristow 24 Mar '17

24 Mar '17

I have installed the shiny new Clang at c:\llvm\ with MS Visual Studio 2015 update 3 I have added Clang to my user-config.jam thus using clang ; or in full detail: using clang : # version 4.0.0 : # location Clang compiler .exe location. # from http://llvm.org/releases/download.html dated 9Mar2017 c:\\LLVM\\bin\\clang++.exe : # options <warnings>on <cxxflags>-v ; and tried to invoke it thus I:\modular-boost\libs\hello_boost\example>b2 toolset=clang-4.0.0 -d2 --debug-configuration > clang40_24Mar17.log (.log file attached in case that helps). It starts well but comes to a terminal halt missing cstddef in boost/config/select_stdlib_config.hpp clang version 4.0.0 (tags/RELEASE_400/final) Target: x86_64-pc-windows-msvc Thread model: posix InstalledDir: c:\LLVM\bin "c:\\LLVM\\bin\\clang++.exe" -cc1 -triple x86_64-pc-windows-msvc19.0.24123 -emit-obj -mrelax-all -mincremental-linker-compatible -disable-free -main-file-name hello_boost.cpp -mrelocation-model pic -pic-level 2 -mthread-model posix -fmath-errno -masm-verbose -mconstructor-aliases -munwind-tables -target-cpu x86-64 -momit-leaf-frame-pointer -v -dwarf-column-info -debug-info-kind=limited -dwarf-version=4 -debugger-tuning=gdb -coverage-notes-file "I:\\modular-boost\\libs\\hello_boost\\example\\..\\..\\..\\bin.v2\\libs\\hello_boost\\example\\hello_boost.test\\clang-linux-4.0.0\ \debug\\hello_boost.gcno" -resource-dir "c:\\LLVM\\bin\\..\\lib\\clang\\4.0.0" -D BOOST_ALL_NO_LIB=1 -I "..\\..\\.." -internal-isystem "c:\\LLVM\\bin\\..\\lib\\clang\\4.0.0\\include" -internal-isystem "C:\\Program Files (x86)\\Windows Kits\\10\\Include\\10.0.10586.0\\ucrt" -O0 -Wno-unused-local-typedef -Wno-dll-attribute-on-redeclaration -Wall -fdeprecated-macro -fdebug-compilation-dir "I:\\modular-boost\\libs\\hello_boost\\example" -ferror-limit 19 -fmessage-length 0 -fms-extensions -fms-compatibility -fms-compatibility-version=19.0.24123 -std=c++14 -fdelayed-template-parsing -fno-inline -fobjc-runtime=gcc -fcxx-exceptions -fexceptions -fdiagnostics-show-option -o "..\\..\\..\\bin.v2\\libs\\hello_boost\\example\\hello_boost.test\\clang-linux-4.0.0\\debug\\hello_boost.obj" -x c++ hello_boost.cpp clang -cc1 version 4.0.0 based upon LLVM 4.0.0 default target x86_64-pc-windows-msvc #include "..." search starts here: #include <...> search starts here: ..\..\.. c:\LLVM\bin\..\lib\clang\4.0.0\include C:\Program Files (x86)\Windows Kits\10\Include\10.0.10586.0\ucrt End of search list. In file included from hello_boost.cpp:15: In file included from ..\..\..\boost/config.hpp:44: ..\..\..\boost/config/select_stdlib_config.hpp:18:12: fatal error: 'cstddef' file not found # include <cstddef> I have two versions of cstddef C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\include\cstddef exists and refers to other files. contains // cstddef standard header #pragma once #ifndef _CSTDDEF_ #define _CSTDDEF_ #include <yvals.h> and another at C:\programfiles\mingw-w64\x86_64-6.3.0-win32-seh-rt_v5-rev1\mingw64\lib\gcc\x86_64-w64-mingw32\6.3.0\include\c++; My PATH has (amongst other items) C:\Programfiles\mingw-w64\x86_64-6.3.0-win32-seh-rt_v5-rev1\mingw64\bin; C:\programfiles\mingw-w64\x86_64-6.3.0-win32-seh-rt_v5-rev1\mingw64\lib\gcc\x86_64-w64-mingw32\6.3.0\include; C:\programfiles\mingw-w64\x86_64-6.3.0-win32-seh-rt_v5-rev1\mingw64\lib\gcc\x86_64-w64-mingw32\6.3.0\include\c++; C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\include; Is this expected (rather than clang-msvc-14.0)? notice: will use 'clang++' for clang-linux, condition <toolset>clang-linux-4.0.0 Anyone can give a clue as to what I am doing wrong? Thanks Paul --- Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 (0) 1539 561830

1 0

[build] VC++ 2017 version number?
by Beman Dawes 24 Mar '17

24 Mar '17

Boost.build in develop is treating VC++2017 RTW (aka RTM) as msvc-14.1. Yet the Visual Studio 2017 RTW Help "About Microsoft Visual Studio" shows the version as "15.0.0-RTW+26228.4" Shouldn't boost.build follow Microsoft's numbering? Seems like calling 2017 RTW anything except 15.0 is a recipe for confusion. --Beman

12 15

Re: [boost] Constructing string_ref from rvalue string
by Mathias Gaunard 24 Mar '17

24 Mar '17

On 23 Mar 2017 7:02 am, "Jonathan Müller via Boost" <boost(a)lists.boost.org> wrote: I've just blogged about this topic: http://foonathan.net/blog/2017 /03/22/string_view-temporary.html (Planned that post before this thread) In my opinion I think `boost::string_ref` and `std::string_view` are two different things, They're not. They were always supposed to be the same thing. There is a lot of code out there that uses std::string_view and boost::string_ref interchangeably depending on which is available.

3 2

Re: [boost] [partly OT] Re: [review queue] What to do about the library review queue?
by Glen Fernandes 24 Mar '17

24 Mar '17

peterkochlarsen wrote: > Also an unmaintained library should be marked as such as should > libraries that are deprecated, replaced by standard C++ features > (shared_ptr comes to mind) shared_ptr (or Boost.SmartPointers in general) is not unmaintained, and is not deprecated. It actually has been evolving past the C++11 std::shared_ptr. For example, boost::shared_ptr supported array forms in 1.53 and this was eventually added to C++ in C++17. (Interesting aside: That functionality above was even, and still is used, in certain Microsoft projects, where boost::shared_ptr is used instead of std::shared_ptr). The same goes for other Boost libraries like Boost.Thread. They: - May have features not in the C++ standard library equivalent - May be evolving past the current C++ standard - Are in use by actual projects and shouldn't be removed Glen -- View this message in context: http://boost.2283326.n4.nabble.com/review-queue-What-to-do-about-the-librar… Sent from the Boost - Dev mailing list archive at Nabble.com.

15 51

Is there any interest in type-safe container of bool flags with noexcept guarantees?
by Роман Орлов 23 Mar '17

23 Mar '17

Hello Boost community, I'd like to determine interest in this kind of container. Motivation For managing sets of bool flags developers often use std::bitset or c-like manual bit manipulations. Each approach brings problems. Some disadvantages of using std::bitset: * unpredictable and greedy allocation of bit storage; * setters/getters can throw exceptions; * it operates in low-level terms like "a bit number"; * we can easily assign one instance of std::bitset to another with the same number of bits but semantically they may differ. Proposal Instead of managing bits via numbers let's manage them via types. So start by declaring some types class eats_meat; class eats_grass; class has_tail; Then bind these types to flag identifiers typedef typed_flags<eats_meat, eats_grass, has_tail> animal; Unlike std::bitset the 'animal' instance allocates a minimal possible storage (in this case sizeof(animal) == 1). Create flags from scratch animal wolf; wolf.set<eats_grass>(false); wolf.set<eats_meat, has_tail>(); wolf.set(flag<has_tail>{1}, flag<eats_meat>{1}); Create flags with a flexible human-readable constructor wolf = animal{flag<has_tail>{1}, flag<eats_meat>{1}, flag<eats_grass>{0}}; I have implemented a minimal working prototype in my github repo https://github.com/compmaniak/typed_flags If you're interested you can try it online here http://melpon.org/wandbox/permlink/55g1czUjwSFO8LS1 Expected benefits * delegating calculation of a bit position for a certain type to compiler gives us a strong type safety and prevents typos; * noexcept guarantee of setting and getting bit values; * we shouldn't take care of bits because we work in terms of typed properties; * great readability, taking a short glance on a type definition tells you what this type is about. Some people on reddit (https://redd.it/601upg) found this library useful. Any thoughts on the idea of the container would be much appreciated. -- Roman

8 13

[release] 1.64.0 please test master snapshot
by Rene Rivera 23 Mar '17

23 Mar '17

Looks like 14.1/141 won out the version hysterics. And I've merged in the PRs for that change. Please give the latest master snapshot archives a try. And report both failures and success: <https://dl.bintray.com/boostorg/master/> If nothing Earth shattering comes up this will become the beta on Wednesday 22 (before 24:00 CDT). -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

5 5

Re: [boost] [release] 1.64.0 please test master snapshot
by Rene Rivera 22 Mar '17

22 Mar '17

On Tue, Mar 21, 2017 at 12:36 PM, Tom Kent <lists(a)teeks99.com> wrote: > It looks like the boostorg/boost:master commit this snapshot was based off > doesn't have the latest boostorg/config:master submodule commit. I think > updating this is a manual process at this point in the release cycle? (Thus > the autolink file is still looking for vc150). > Grr.. Forgot to do that for config. I did it for build though :-) It's done now.. Just need to wait again for the new archives. > As an aside, I had a difficult time figuring out what the snapshot I > downloaded referred to. I was able to use the boost_1_64_0_snapshot.tar.bz2.json > file to determine that I had the correct boost_1_64_0_snapshot.tar.bz2, but > bintray doesn't make it super clear what git commit this snapshot download > refers to. > > Would it be possible to add a file to snapshots/releases that contains the > git commit hash? > Can't promise I'll do it right this second... But I'll add the commit hash to the json data for the archives. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

7 14

Boost MSM parallel behavior with delayed self-transitions?
by Christophe Henry 22 Mar '17

22 Mar '17

Hi Danylo, >Hi community, > > I am using Boost MSM (basic and functor front-ends) and am trying to >implement the following state machine (https://i.stack.imgur.com/K79qk.png ): Ok, State1 is itself a state machine (also called composite). See: http://www.boost.org/doc/libs/1_63_0/libs/msm/doc/HTML/ch02s02.html#d0e151 and: http://www.boost.org/doc/libs/1_63_0/libs/msm/doc/HTML/ch03s02.html#d0e529 Then you have 2 active states, which are called orthogonal regions. See: http://www.boost.org/doc/libs/1_63_0/libs/msm/doc/HTML/ch03s02.html#d0e577 >I am using Boost MSM (basic and functor front-ends) and am trying to >implement the following state machine: enter image description here > >In words: < snip > > >I would like to know the way to create this state machine in Boost MSM. The above link has an example. >There are two tricks here which I cannot figure out how to do: > > - Execution in parallel (i.e. running action_A does not stop running >action_B at the same time) It depends what you mean with "in parallel". Having 2 active states means that the actions execute only logically at the same time, meaning within the same process_event call. But as you have just one thread, they will execute after each other. If you mean in different threads, then no, the library does not support this. But my next library, Asynchronous does ( https://github.com/henry-ch/asynchronous) I have examples with state machines, timer, etc. >- Delayed transition (i.e. the transitions which happen after 2 >seconds for state A and after 5 seconds for state B). Neither delay >should be blocking! The transitions should just "fire" after this time. Sorry, this is out of scope of the library as it would involve threads. You can do one of the following: - use your own timer (Boost.Asio offers one) and handle thread safety yourself. - have a look at Asynchronous. Sorry if it looks like advertising, but the library was written for this kind of things. >Thank you very much for helping, > >Danylo. HTH, Christophe

3 4

Re: [boost] [gsoc17] Project1: Static map: Can I implement the competency test in g++-7?
by Vic Luo 22 Mar '17

22 Mar '17

Hi, In the last few days I finished a toy implementation with continuous integration at https://github.com/htfy96/gsoc-static-map, which has been tested on g++5/6 and clang++3.8/3.9. Current test failure is as expected due to g++-5's incomplete constexpr optimization. Besides, my proposal draft has been submitted which includes a very tiny benchmark with boost::hana on compile-time lookup performance on map<int, int> structure. Any kind of suggestion is welcomed at https://gist.github.com/htfy96/0bd9b3200d9a0e67f449edc40bfa43b5*. * Thanks,* * -- --------------------------------- Vic Luo Shanghai Jiaotong University Key fingerprint 0x98809ca08bf5662a

1 0

Re: [boost] [release] 1.64.0 please test master snapshot
by Olaf van der Spek 22 Mar '17

22 Mar '17

On Wed, Mar 22, 2017 at 12:45 PM, Andrey Semashev <andrey.semashev(a)gmail.com> wrote: >> Right, boostorg doesn't have tickets enabled though.. where should I >> open a ticket? > > > Probably, in Trac: I hate Trac. > https://svn.boost.org/trac/boost/newticket?component=algorithm;version=Boos… > > Although since it's fixed in develop and there is a PR for merge to master, > I'm not sure there's much point in a ticket. I meant in general. -- Olaf

1 0

Re: [boost] [release] 1.64.0 please test master snapshot
by Andrey Semashev 22 Mar '17

22 Mar '17

And once again, this went to Olaf directly instead of the list. Re-sending. On 03/22/17 14:45, Andrey Semashev wrote: > On 03/22/17 13:45, Olaf van der Spek wrote: >> On Wed, Mar 22, 2017 at 11:05 AM, Andrey Semashev via Boost >> <boost(a)lists.boost.org> wrote: >>> On 03/22/17 11:59, Olaf van der Spek via Boost wrote: >>>> >>>> VC2015 /std:c++latest: >>>> >>>> struct to_lowerF : public std::unary_function<CharT, CharT> >>>> >>>> boost\algorithm\string\detail\case_conv.hpp(33): error C2143: syntax >>>> error: missing ',' before '<' >>> >>> >>> This seems to be fixed in develop but not merged to master. I've >>> created a >>> PR to do the merge: >>> >>> https://github.com/boostorg/algorithm/pull/34 >>> >>>> https://github.com/mclow/String-Algo/issues/7 >>> >>> >>> That ticket is for a fork, not the boostorg repo. >> >> Right, boostorg doesn't have tickets enabled though.. where should I >> open a ticket? > > Probably, in Trac: > > https://svn.boost.org/trac/boost/newticket?component=algorithm;version=Boos… > > > Although since it's fixed in develop and there is a PR for merge to > master, I'm not sure there's much point in a ticket. >

1 0

Re: [boost] GSoC proposal
by Vissarion Fisikopoulos 22 Mar '17

22 Mar '17

Hi Rasul, thanks for your interest in Boost.Geometry. I guess you have already read this https://svn.boost.org/trac/boost/wiki/SoC2017 There are two possibilities: either you provide a library (with some standards described in the webpage) or you do the test. My opinion is that doing the test (even if not needed) will first strengthen your application and second will give you a good overview of the problem you are going to work on, if selected. >From your repo what is the library that you propose for your application and meets the requirements described in the webpage above (e.g. no coursework, more than 6 months old etc)? The tests are described here: https://svn.boost.org/trac/boost/wiki/SoC2017#a3.Boost.Geometry Depending on what (?) project you prefer to pursue there is a corresponding test. Best, Vissarion ps. I copy the message to boost list so the community can follow and provide feedback if needed On 22 March 2017 at 12:00, Rasul Kerimov <rkerimov(a)std.qu.edu.az> wrote: > Hey Mr. Fysikopoulos, > > I'm really interested in Boost GSoC 2017 project proposal, but I don't > know how to pass Programming competency Test. > > I have a github repo with all my codes that I wrote in C++, but I > don't know if it's enough to pass test. > > Github page: https://github.com/CoderINusE/ > Github repo: https://github.com/CoderINusE/Algorithms-data-structues > > I will be grateful for any response. Thank you!

1 0

[release] 1.64.0 Delayed because of Microsoft (version numbers)
by Rene Rivera 21 Mar '17

21 Mar '17

Sorry to say the beta release of 1.64.0 is hereby going to be delayed for at least another week. The confusion of VS2017 version numbers and the communities inability to address this issue after the beta is to blame. To address the situation the beta release will be published when one of the two tasks below are completed: (A) Boost Config changes to use 1410 as the autolink version to match what the currently working generated libs are taggeg with. Or: (B) The community decides what version number we should be using and the appropriate PRs are filed and applied and tested for all the repos involved. Which means: 1. The community has until 12:00 CDT US March 18 to decide on what the vc version number and tag should be. 2. The community must post PRs for the places where we reference VS2017 version numbers to the new number. Those are at least: <https://github.com/boostorg/config> <https://github.com/boostorg/build> <https://github.com/boostorg/boost> <https://github.com/boostorg/website> People have until 17:00 CDT Monday March 20 to submit those PRs. 3. The community can test the resulting master snapshot when available at the latest 24:00 Monday March 20. 4. If all goes well we can have a beta release on Wednesday March 22 (ie one week late). -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

17 26

[stacktrace] Review
by Peter Dimov 21 Mar '17

21 Mar '17

I think that the Stacktrace library should be ACCEPTED. The design is good. It's unfortunate that to get a stacktrace class that stores the capture internally in a fixed-size array, as the first iteration did, one has to write a special allocator, more so because such an allocator isn't readily available (we don't have one in Boost, for instance). This could easily be addressed by templating basic_stacktrace on a container (default std::vector<frame>) instead, which would allow boost::container::static_vector to be used. The implementation is good. The main problem here, as already discussed in detail, is that under Windows clients of the library that don't make use of the facilities that require windows.h and COM headers to be included still suffer the penalty of this inclusion. Fixing this will be a significant increase in usability. The documentation is adequate, although it could use some editing by a native speaker. The library is potentially very useful. Assert handlers, exceptions and termination handlers can (and should) all make use of it. Wide use under Windows is however hampered by the limitation described above. I tested the library under Windows with msvc-14.0, 14.1, Cygwin g++/clang++. Under Cygwin there is no libbacktrace, but defining BOOST_STACKTRACE_USE_ADDR2LINE worked. I invested a fair chunk of time into my evaluation of the library, and am reasonably knowledgeable about the problem domain.

1 0

Re: [boost] [smart_ptr] Is there any interest in unique_ptr with type erased deleter?
by Andrey Davydov 21 Mar '17

21 Mar '17

On Tue, Mar 21, 2017 at 4:11 PM, Andrey Semashev <andrey.semashev(a)gmail.com> wrote: > On 03/21/17 14:54, Andrey Davydov wrote: > >> On Tue, Mar 21, 2017 at 2:15 PM, Andrey Semashev via Boost >> <boost(a)lists.boost.org <mailto:boost@lists.boost.org>> wrote: >> >> On 03/21/17 12:54, Andrey Davydov via Boost wrote: >> >> On Tue, Mar 21, 2017 at 12:00 PM, Richard Hodges >> <hodges.r(a)gmail.com <mailto:hodges.r@gmail.com>> wrote: >> >> What is required, more than simply creating a type-erased >> deleter? >> >> >> Also deleter must capture pointer, because pointer which was >> passed to >> constructor can differ from the pointer which will be deleted. >> For example, >> >> struct Base { /* ... */ }; >> struct Derived : Base { /* ... */ }; >> >> ptr<Derived> p1(new Derived); >> void * raw_p1 = p1.get(); >> ptr<Base> p2 = std::move(p1); >> void * raw_p2 = p2.get(); >> assert(raw_p1 != raw_p2); >> >> >> The above piece of code strikes me as very unsafe and better be >> avoided in the first place. Designing new tools to handle this case >> is IMHO misguided. >> >> Why this code is very unsafe? If change `ptr` to `shared_ptr` this will >> become perfectly valid and widely used pattern. >> > > Because comparing the void pointers is not safe in general. The above code > in particular will probably work (although not sure if even that's > guaranteed, depending on whether Base and Derived qualify as standard > layout classes), but if the class hierarchy is different, that code will > silently break. I agree, I wrote this code just to demonstrate that deleter must capture pointer because it can be changed due to upcasting. > But, of course, nothing stops you from saving the state in the deleter. > > struct poly_deleter > { > template< typename T > > poly_deleter(T* p) : m_p(p), m_delete(&poly_deleter::do_delete< T >) > { > } > > void operator() (void*) const noexcept > { > m_delete(m_p); > } > > private: > template< typename T > > static void do_delete(void* p) noexcept > { > delete static_cast< T* >(p); > } > > void* m_p; > void (*m_delete)(void*); > }; > > This will work even if you form std::unique_ptr<void, poly_deleter> (i.e. > don't have a universal base class). > Your poly_deleter implementation is the same as I used inside my smart pointer implementation, but there is an issue with std::unique_ptr<T, poly_deleter>, namely it is not constructible from std::unique_ptr<T, std::default_delete<T>> because poly_deleter must capture pointer and so it is not constructible from std::default_delete. -- Andrey Davydov

4 5

[smart_ptr] Is there any interest in unique_ptr with type erased deleter?
by Andrey Davydov 21 Mar '17

21 Mar '17

It is widely known that deleter type is part of std::unique_ptr type. It is the most effective decision, but sometimes not very convenient. The most important use cases (for me) when std::unique_ptr<T, std::default_delete<T>> doesn't work are following: 1. unique_ptr to incomplete class struct MyClass; unique_ptr<MyClass> create(); auto ptr = create(); // compilation error 2. upcast to base without polymorphic destructor struct Base { // ... // no virtual ~Base() here }; struct Derived : Base { // ... }; unique_ptr<Base> ptr = make_unique<Derived>(); // compiles by leaks! 3. unique_ptr with non-default deleter unique_ptr<FILE, int (FILE *)> open_file(std::string const & path) // works but looks ugly, why should the fact that fclose returns `int` be visible from the signature of the function `open_path`? { return { std::fopen(path, "r"), &std::fclose }; } Of course, all this examples could be fixed if unique_ptr would be replaced by shared_ptr, but the semantic of the shared ownership is not desirable often. I have implemented smart pointer with semantics of unique ownership and type erased deleter (https://github.com/AndreyG/unnamed) It has size of 3 pointers and it doesn't require additional memory allocations for the case when deleter is empty class (for example, std::default_delete or non-capturing lambda) and for the case when deleter is known at compile time function (for instance, fclose). The are some simple examples of usage and tests in the repo. Why don't just use unique_ptr<T, function<void (void *>>? The main reason is that due to the small object optimization std::function has rather big size. For instance, sizeof(unique_ptr<T, function<void (void *>>) == 72 for MSVC x64! Results for the other platforms can be found in the repo README. Does it seem useful? -- Andrey Davydov

5 11

[GSOC17] Regarding project Boost.uBLAS
by SHIVAM MITTAL 21 Mar '17

21 Mar '17

Hi, I am *Shivam Mittal*, a sophomore student of *Computer Science & Engineering *discipline of *Indian Institute of Technology, Ropar, India.* I wish to contribute to *Boost.uBLAS*, and develop cool and useful things with the community in GSOC 17. While going through the ideas list, I found the project *Data.Frames in boost.uBlas *very interesting and suitable for me. I think I am well prepared for the task as described in the requirement section. I am very comfortable in C/C++ and fairly comfortable in MATLAB, Python, HTML, CSS, PHP, SQL. I have more than 6 years of experience coding in C++. I have been developing data structures, algorithms, hardware simulators, artificial intelligence programs, and miscellaneous things in C++. The coursework (relevant to this project) which I have completed is : 1. Introduction to computing (in C++) 2. Data structures (in C++) 3. Linear Algebra Some of my selected projects are uploaded on github: https://github.com/shivam5 Please have a look at them. Some projects which I have implemented in C++ are: 1. Simple_RISC plagiarism checker 2. Simple_RISC functional and pipeline simulator 3. Pattern matching system by implementing hash tables. 4. Implementing graphs 5. Implementing AVL and Red black trees 6. Solcvng combinatorial auctions 7. Room booking system 8. Sudoku Solver I have implemented the programming competency test and sent the mentor on personal mail. Can you guide me further on how should I proceed and increase my chances of getting selected. Thank You, Shivam Mittal B.Tech Computer Science & Engineering, IInd Year Indian Institute of Technology Ropar Phone: +91-9888927245, +91-9899461223

1 0

Boost MSM parallel behavior with delayed self-transitions?
by Danylo Malyuta 21 Mar '17

21 Mar '17

Hi community, This is my first post, so I'm sorry for any mistakes in style. I have also posted this question on StackOverflow: http://stackoverflow.com/questions/42920777/boost-msm-parallel-behavior-wit…. I am using Boost MSM (basic and functor front-ends) and am trying to implement the following state machine (https://i.stack.imgur.com/K79qk.png) enter image description here I am using Boost MSM (basic and functor front-ends) and am trying to implement the following state machine: enter image description here In words: 1. Enter state State1 2. Enter state A and execute action_A. After 2 seconds, print "Trying again..." and re-execute state A (i.e. call its entry action). This loops forever... 3. At the same time as 2 (i.e. "in parallel"), enter state B and execute action_B. After 5 seconds, print "Trying again..." and re-execute state B (i.e. call its entry action). This loops forever... I would like to know the way to create this state machine in Boost MSM. There are two tricks here which I cannot figure out how to do: - Execution in parallel (i.e. running action_A does not stop running action_B at the same time) - Delayed transition (i.e. the transitions which happen after 2 seconds for state A and after 5 seconds for state B). Neither delay should be blocking! The transitions should just "fire" after this time. Thank you very much for helping, Danylo.

2 1

Fwd: [gsoc17] Regarding Boost.Geometry
by Aditya Gupta 21 Mar '17

21 Mar '17

Hi I am Aditya Gupta, IInd Yr. B. Tech. Computer Science at IIT Ropar and I wish to work on Project 3 of Boost.Geometry (Nearly antipodal points distance accuracy improvement.) I have completed the competency test <https://github.com/adityagupta1089/earth-geometry>, but I think maybe it was too small or have I misinterpreted, anyways. I have an initial draft of my [GSoC proposal](https://gist.github. com/adityagupta1089/39863577e1716c55d86c98ff57623893) I have also attached my CV.

2 1

Re: [boost] [smart_ptr] Is there any interest in unique_ptr with type erased deleter?
by Andrey Semashev 21 Mar '17

21 Mar '17

For some reason my email went directly to Andrey instead of the mailing list. I'm re-sending the message below. PS: This has happened to me multiple times now after we moved the ML infrastructure. Is there a way to protect oneself from such mistakes? Am I the only one so inattentive to have this problem? On 03/21/17 16:11, Andrey Semashev wrote: > On 03/21/17 14:54, Andrey Davydov wrote: >> On Tue, Mar 21, 2017 at 2:15 PM, Andrey Semashev via Boost >> <boost(a)lists.boost.org <mailto:boost@lists.boost.org>> wrote: >> >> On 03/21/17 12:54, Andrey Davydov via Boost wrote: >> >> On Tue, Mar 21, 2017 at 12:00 PM, Richard Hodges >> <hodges.r(a)gmail.com <mailto:hodges.r@gmail.com>> wrote: >> >> What is required, more than simply creating a type-erased >> deleter? >> >> >> Also deleter must capture pointer, because pointer which was >> passed to >> constructor can differ from the pointer which will be deleted. >> For example, >> >> struct Base { /* ... */ }; >> struct Derived : Base { /* ... */ }; >> >> ptr<Derived> p1(new Derived); >> void * raw_p1 = p1.get(); >> ptr<Base> p2 = std::move(p1); >> void * raw_p2 = p2.get(); >> assert(raw_p1 != raw_p2); >> >> >> The above piece of code strikes me as very unsafe and better be >> avoided in the first place. Designing new tools to handle this case >> is IMHO misguided. >> >> Why this code is very unsafe? If change `ptr` to `shared_ptr` this will >> become perfectly valid and widely used pattern. > > Because comparing the void pointers is not safe in general. The above > code in particular will probably work (although not sure if even that's > guaranteed, depending on whether Base and Derived qualify as standard > layout classes), but if the class hierarchy is different, that code will > silently break. > >> Now, I can understand the need to perform casts on smart-pointers, >> but they should still provide some level of safety, at least the >> same level that is provided by pointer casts in the core language. >> But supporting casts should not require a new smart-pointer. And >> indeed it doesn't: >> >> template< typename U, typename T, typename D > >> std::unique_ptr< U, D > static_pointer_cast( >> std::unique_ptr< T, D >&& p) >> { >> D d = p.get_deleter(); >> return std::unique_ptr< U, D >( >> static_cast< U* >(p.release()), >> std::move(d)); >> } >> >> What is `D`? If it is std::default_delete<T> then function result type >> will be std::unique_ptr<U, std::default_delete<T>> and unlikely this >> type is very useful (even if it compiles). > > Ok, that won't work with std::default_delete<T>. But it will work with > this deleter: > > struct static_polymorphic_deleter > { > template< typename T > > void operator() (T* p) const noexcept > { > std::default_delete<T>()(p); > } > }; > > And it should work with a runtime polymorphic deleter that can be > written to implement your proposal (see below). > >> The other part of your proposal, which is polymorphic behavior with >> a deleter knowing the type to call the destructor on, can be solved >> by a custom deleter. I'm not sure a generalized version of such >> deleter would have a large demand, given that there is the >> alternative TONGARI J suggested, but I'm not opposed to a proposal. >> >> May be I doesn't understand what TONGARI J suggested, but >> how can `unique_ptr<T, void(*)(T*)>` hold stateful deleter? > > It doesn't, unless the required state is contained within the object > itself. But just to implement runtime polymorphism, no additional state > is required. > > struct base > { > protected: > ~base() = default; > }; > > struct derived : base > { > }; > > template< typename T > > void poly_deleter(base* p) noexcept > { > delete static_cast< T* >(p); > } > > template< typename T > > using poly_unique_ptr = std::unique_ptr< T, void(*)(base*) >; > > template< typename T > > poly_unique_ptr< T > make_poly_unique() > { > T* p = new T(); > return poly_unique_ptr< T >{ p, &poly_deleter< T > }; > } > > poly_unique_ptr< derived > pd1 = make_poly_unique< derived >(); > poly_unique_ptr< base > pb1 = std::move(pd1); > poly_unique_ptr< derived > pd2 = > static_pointer_cast< derived >(std::move(pb1)); > > But, of course, nothing stops you from saving the state in the deleter. > > struct poly_deleter > { > template< typename T > > poly_deleter(T* p) : m_p(p), m_delete(&poly_deleter::do_delete< T >) > { > } > > void operator() (void*) const noexcept > { > m_delete(m_p); > } > > private: > template< typename T > > static void do_delete(void* p) noexcept > { > delete static_cast< T* >(p); > } > > void* m_p; > void (*m_delete)(void*); > }; > > This will work even if you form std::unique_ptr<void, poly_deleter> > (i.e. don't have a universal base class). >

1 0

Problem with using matrix library with unit test library
by SHIVAM MITTAL 21 Mar '17

21 Mar '17

Hi everyone, I have been developing something, and basically it requires the two boost libraries - the matrix library and unit test library. I have a file test.cpp : #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/io.hpp> #include <boost/test/included/unit_test.hpp> #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MODULE test BOOST_AUTO_TEST_SUITE(Integer_matrices) BOOST_AUTO_TEST_CASE(Constructors) { BOOST_CHECK(2 == 2); } BOOST_AUTO_TEST_SUITE_END() I am compiling this with: g++ -I <path to boost_1_63_0> test.cpp I'm getting the following error: /tmp/ccnxRzsf.o: In function `main': test.cpp:(.text+0x18aa1): undefined reference to `init_unit_test_suite(int, char**)' collect2: error: ld returned 1 exit status Any help will be greatly appreciated. Thanks.

2 1

[Convert] std::isspace requires unsigned #28
by Olaf van der Spek 21 Mar '17

21 Mar '17

Hi, > boost\convert\base.hpp(112): warning C6330: 'const char' passed as _Param_(1) when 'unsigned char' is required in call to 'isspace'. > boost\convert\base.hpp(115): warning C6330: 'const char' passed as _Param_(1) when 'unsigned char' is required in call to 'isspace'. https://github.com/boostorg/convert/issues/28 IMO the code should be fixed and it's not a documentation issue. What do you think? -- Olaf

6 17

Re: [boost] [release] 1.64.0 Delayed because of Microsoft (version numbers)
by Tom Kent 20 Mar '17

20 Mar '17

Sorry all, I meant to send this to the list but only replied to Daniel. This adds an option 4 and 5. On Sun, Mar 19, 2017 at 3:58 PM, Tom Kent <lists(a)teeks99.com> wrote: > > > On Sun, Mar 19, 2017 at 10:17 AM, Daniel James <dnljms(a)gmail.com> wrote: > >> On 19 March 2017 at 13:10, Tom Kent via Boost <boost(a)lists.boost.org> >> wrote: >> > >> > Option 1 - 14.10 Use microsoft toolset version based on cl.exe version >> -5. >> > This is the official version of the c++ toolset that microsoft has been >> > pushing (somewhere). The new $(VCToolsVersion) macro is "14.10.25017", >> this >> > macro is not available in previous versions of visual studio. >> > >> > build bootstrap would use bootstrap.bat vc1410 >> >> [snip] >> >> > Option 2 - 14.1 Use the abbreviated toolset version that microsoft uses >> for >> > their toolset version. The $(PlatformToolsetVersion) macro is "141". In >> > VS2015 this was "140". >> >> [snip] >> >> > I *think* that is all the reasonable options. Let the consensus form! >> >> I disagree, I think we should limit ourselves to values that Microsoft >> actually uses. As far as I'm aware, they don't use 1410, and they >> don't use 14.1. There are already too many ways of writing the version >> number, adding more will just add to the confusion. >> > > So 2-a would meet these requirements. However, I did overlook the mixed > options: > > Option 4 (141 and 14.10) - > build bootstrap would use bootstrap.bat vc141 > build of source would use b2 toolset=msvc-14.10 > build would generat libraries of the format libboost_NAME_vc141-OPTIONS-1_ > 64.lib > config would auto-link libraries of the same format > (4-a is the same as 2-a) > > Option 5 (1410 and 14.1) - > build bootstrap would use bootstrap.bat vc1410 > build of source would use b2 toolset=msvc-14.1 > build would generat libraries of the format libboost_NAME_vc1410-OPTIONS- > 1_64.lib > config would auto-link libraries of the same format > (5-a is the same as 1-a) > > Tom > >

1 0

About all these metaprogramming libraries
by Louis Dionne 20 Mar '17

20 Mar '17

Dear Boost, We've seen two metaprogramming libraries ask for a formal review on the list recently. I expect a third (Brigand) might join the party soon, and maybe even a fourth (Eric Niebler's meta). I think it would be wise to have a plan for how we're going to deal with this. Before going further, I'd also like to clear something out. Some people have asked whether "classic" metaprogramming libraries still had their place given that we now have Hana. As the author of Hana, I think the answer is yes. While Hana is (IMHO) easier to use and more powerful, it also has an important shortcoming. Hana is too slow when dealing with very large inputs. This is due to the fact that it can also handle values, which is much heavier than dealing with types only. This can be alleviated to some extent, but the truth is that our execution model (the compiler) simply has to do more work when handling values. Hence, I think Boost does need a modern classic TMP library to handle these cases where a library writer needs to handle gigantic type lists. I think marketing such a library as an advanced tool for library writers would be a service to the overall C++ community, but that's an orthogonal concern. However, Boost needs one such library, not four. I think we can't just do 4 reviews and include all the libraries that pass in Boost; that would be a huge disservice to our users, who will be left with the burden of choosing. Heck, if we can't even make our mind, how can they? So, how do we pick? Have we ever been in a similar situation where we have multiple competing libraries solving _exactly_ the same problem? Louis -- View this message in context: http://boost.2283326.n4.nabble.com/About-all-these-metaprogramming-librarie… Sent from the Boost - Dev mailing list archive at Nabble.com.

16 39

Newcomer Contributor to Boost C++ Libraries
by Aman Gupta 20 Mar '17

20 Mar '17

Hello everyone, I am Aman Kumar Gupta, an undergraduate 1st year student from International Institute of Information Technology, Bhubaneswar, India. I'm a newcomer to Boost C++ community. I have ,what i think, medium to good C++ coding background as i've been coding in C++ since past 5-6 years and have won some coding competitions as well. I have a good C++ STL knowledge and am very keen and interested in contributing to Boost's STL libraries. But as i'm a newbie to this community, i'm little confused where and how to start. I would be very glad and thankful if anyone would please help me and guide me through.

2 1

Re: [boost] [gsoc17]The implement of Programming competency test From Ruoyun Jing
by Ruoyun Jing 20 Mar '17

20 Mar '17

Hi Vissarion, 2017-03-20 20:29 GMT+08:00 Vissarion Fisikopoulos <fisikop(a)gmail.com>: > Hi Ruoyun, > > > - The main work I should do during GSoC about project 1 is just to > improve > > the algorithms of compare two distances of two point pairs or try to > > consider different situations which used compare distance predicates to > > avoid calculation? > > the project is about algorithms that does not compute the actual distance > but an approximation (as rough as possible) that suffices to accurately > compare the lengths of two geodesic segments on the ellipsoid > > Thanks for your answer, I have the correct point of these project and will continue to write my proposal. > > - Do "In some algorithms there is the need to compare two distances of > two > > point pairs" this means compare two points distances on Earth? Or on > every > > ellipsoid model? > > the later (see answer above) > > > - Do I need to find the approaches of filter by myself? Could you please > > help me get more information about these? Like the implement detail about > > the predicate compare_distance function, mathematical calculation papers > > about compare distance on ellipsoid? > > Well we give one approach on the website (there is another proposal of > another > candidate on the list). My opinion is that if you understand these > approaches > (pos and cons, differences etc) that will help you towards a solid > application. > Having another idea for an approach will definitely strengthen you > application. > Thanks for your help. I can get the point of those approaches and will try to have new ideas. :) > > - In my view, just like compute the shortest distance between two given > > points on Earth, the background approach can be used. And I used > cartisian > > coordinate to avoid many trigonometric function calculation, but I can > not > > find more improve with my lacking knowledge, could you give me some > aspects > > to get more approaches? > > Please see answer above > > At this point I think it is better to jump to boost list because our > discussion > could interest more people. I will not copy anything of our private > conversation > there but feel free to do the jump and I will continue answering there. > > Btw, any news from you test and comparison with Boost.Geometry. > > I reply you and jump to boost with your advice. Hope this will help more people. :) Vissarion > > ps. you can send questions whenever you want, I will answer them a.s.a.p. > my zone is UTC+2 > > Thanks for your answer. Best regards. Ruoyun -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

1 0

Re: [boost] [geometry] [gsoc17] boost.geometry
by Vissarion Fisikopoulos 20 Mar '17

20 Mar '17

Hi Aman, thanks for your interest in Boost.Geometry and projects 1, 3 in particular. Do you have particular preference between 1 and 3? I think you should specify in your application. Regarding you idea, indeed that could be an option. Do you expect that would be faster or more accurate than the one proposed in the boost GSoC ideas webpage? How would you compare the two approaches? To be clear, I am not testing you but answering that questions could lead to a stronger application. Regarding application there are two options, either you do the competency test or you send a link of a project of you. Please read https://svn.boost.org/trac/boost/wiki/SoC2017 (and links therein) also for details on how to proceed, that is on how to write your proposal. Best, Vissarion. ps. I copy to the boost list for potential feedback from the community On 20 March 2017 at 13:07, Aman Gupta via Geometry <geometry(a)lists.boost.org > wrote: > Respected sir/ma'am > I, Aman Gupta, want to contribute in Boost.Geometry; mainly in Project 1(Filtering > of compare distance predicates) and Project 3( Nearly antipodal points > distance accuracy improvement) . > I have good knowledge in geometry and want to learn more . > > For the problem given in Project 1, another approach I can suggest is to > get 2 intersections of plane (which would be ellipse) with the help given > points and compute the respective distances using those ellipses. > > I hope to get selected for the project work. > > Thanking You. > AMAN GUPTA > resume: https://drive.google.com/open?id=0B9HCqOWnVVvDcm9PQkYtczFjVmM > > _______________________________________________ > Geometry mailing list > Geometry(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/geometry > >

1 0

[gsoc17] boost.geometry
by Aman Gupta 20 Mar '17

20 Mar '17

Respected sir/ma'am I, Aman Gupta, want to contribute in Boost.Geometry; mainly in Project 1(Filtering of compare distance predicates) and Project 3( Nearly antipodal points distance accuracy improvement) . I have good knowledge in geometry and want to learn more . For the problem given in Project 1, another approach I can suggest is to get 2 intersections of plane (which would be ellipse) with the help given points and compute the respective distances using those ellipses. I hope to get selected for the project work. Thanking You. AMAN GUPTA resume: https://drive.google.com/open?id=0B9HCqOWnVVvDcm9PQkYtczFjVmM

1 0

Formal Review Request: mp11
by Peter Dimov 19 Mar '17

19 Mar '17

I'd like to request a review for mp11, a simple C++11 metaprogramming library. The library implements the approach outlined in my two articles http://pdimov.com/cpp2/simple_cxx11_metaprogramming.html http://pdimov.com/cpp2/simple_cxx11_metaprogramming_2.html and is available at https://github.com/pdimov/mp11/ It supports g++ 4.9 and above, clang 3.6 and above, msvc-12.0, 14.0, 14.1. The library is in Boost format and is intended to be placed in libs/mp11 in a Git clone of Boost. There is documentation in doc/html/mp11.html, it can be viewed locally, or with https://htmlpreview.github.io/?https://github.com/pdimov/mp11/master/doc/ht… Please excuse the lack of .css in that link. Thanks in advance for any interest, comments or suggestions.

4 9

[safe_numerics] review results
by Andrzej Krzemienski 19 Mar '17

19 Mar '17

Hi Everyone, This is to inform you that safe_numerics library by Robert Ramey is *CONDITIONALLY ACCEPTED* to Boost. The list of conditions can be found down below. I would like to congratulate Robert for getting the library into Boost, and thank him for the effort to develop a useful library for the community. I also would like to thank everyone who participated in the review and shared their useful feedback. I recorded five reviews with a yes/no vote: - Paul A. Bristow (yes with conditions) - Steven Watanabe (yes with conditions) - John Maddock (yes with conditions) - Antony Polukhin (yes) - Barrett Adair (yes) And three without a vote: - Vicente J. Botet Escriba - John McFarlane - Peter Dimov We also got some feedback from an individual nicknamed "scatters" at Reddit (https://www.reddit.com/r/cpp/comments/5x1z67/boostsafe_ numerics_formal_review_starts_today/deew1kq/), and from Tomasz Kaminski in private conversation. There was a general consensus that the problem of surprises with C++ ints deserves a solution. Some people observed that there are other ways to approach the same problem, but it was agreed that the approach taken by safe_numerics is sound. The acceptance conditions mostly revolve around documenting micro-decisions made by the library, and fixing bugs. They apply to the reviewed GIT commit 3bcfabe1cafb8ef6edf08d3bd8730a1555b1c45d, but I know Robert is already working on fixing them, and has most of them fixed locally. *Acceptance conditions:* - Comply with Boost formal requirements: 1. index.html in root directory that redirects to doc/. 2. all headers in folder include/boost/numeric/. 3. Macro safe_literal: either remove it or let it follow Boost macro naming conventions: BOOST_NUMERIC_SAFE_LITERAL(). - Automatic promotion policy: either just remove it, or fix it so that: - it can see the range of safe_base in order to allow for slower increase in sizeof(), - it is clear from documentation how the promotion mechanism works. - in particular, what type gets selected for bit-wise operators &, | - The division bug (see below) is fixed. - Decide and document up front how the library addresses each of the following different situations: - overflow upon arithmetical operation, - unexpected promotion to unsigned when comparing signed with unsigned number, - arithmetic operation on unsigned int with negative value versus a signed value (-1 + 1u). - bit-wise operation on negative signed integers (unless they are removed), or that would produce one as the result. - division by zero, - operations upon default-constructed int type with indeterminate value, - conversion from float to int, when float contains non-integral value. - conversion from float to int, when float contains an integral value that would overflow upon native conversion - operator% where one operand is negative (for native ints it is implementaiton-defined) - leftshift by 32 bits (on 32-bit int) - Decide and document what safe's default constructor does. - Document upon which operations safe<> throws exceptions (or, signals arithmetic error at run-time). IOW, document in which cases safe<> never throws exceptions (signals run-time failure) because it is able to say that the operation will always succeed. - Document what happens when you invoke an operation on two instances of safe<> with different policies. - Resolve name conflict with interval, which already exists in namespace boost::numeric::interval. Either use a different namespace or a different name. - Remove anonymous namespaces from the header files. Use namespace detail and inline functions instead. - Improve test cases, so that they also check if numeric values of computations are correct (not only whether an operation throws or not). - Use enable_if (or similar) tricks to constrain the overload resolution for your arithmetical operations, so that they only work for numeric types rather than "any type T". - Fix the division bug: safe<signed, automatic> a {-1}; safe<unsigned, automatic> b {2}; auto c = a / b; // this returns 2147483647 <%28214%29%20748-3647> - Either document that safe<T> only works for scalar types (rather than any T that models concept Integer<T>), or provide alternate implementation of safe_base, as described in https://github.com/robertramey /safe_numerics/issues/44 - Fix linker errors when building a program from two cpp files that include safe_numerics headers. The error is caused by non-inline full specializations of operator<<. - Either entirely remove the support for bit-wise ops on signed types (make it a compiler error), or provide a consistent implementation that detects any UB or surprising results. - `++i` should return by reference; `i--` should return by value. *Other important issues* The following are *not *conditions for library acceptance, but I still recommend addressing them before the initial release. - Concepts: what do you need them for? Any other type except built-in scalars does not work anyway. Do you want to show how close safe<T> resembles T? In this case, they need to be changed. If you want to extend safe<T> to other T's, they need to be fixed: https://github.com/robertramey/safe_numerics/issues/46 <https://github.com/robertramey/safe_numerics/issues/46> - IOStreams interoperability needs fixes: - Move to a separate header, so that it does not affect compilation times when not needed (but provide forward declarations, so that implicit conversions to int do not make IOStreams work with unintended semantics) - Fix other problems as per https://github.com/robertramey /safe_numerics/pull/35 - safe<>'s interface is not documented - Make the library compile with -fno-exceptions: https://github.com/robertramey/safe_numerics/pull/31 <https://github.com/robertramey/safe_numerics/pull/31> - Some people fail to see how this library is better than just using rar ints but compiling with a UB-sanitizer. Address this in the documentation. - Prevent inadvertent ADL by putting safe into a nested namespace boost::numeric::save_types, and then in boost::numeric import: `using boost::numeric::save_types::safe`. This way boost::numeric::safe still works, but inadvertent ADL of everything inside namespace boost::numeric is prevented. - Does it make sense to apply bitwise operations on two different types? If so, document the semantics. - Fix header names and paths in documentation. - Consider adding support for saturation policy upon overflow. - Expression `safe<int>{4} ^ 1` does not compile due to overload resolution ambiguity. - Fix constexpr usages. - If possible, make workarounds in order to make the library work with MSVC. - Document that operations on safe<> do not thorw exceptions other than these thrown by exception policy. *Suggestions* The following summarizes other useful suggestions for improving the library in the future. - operation `safe<signed>{INT_MIN} + safe<unsigned>{UINT_MAX}` throws even though the mathematical result would fit in either signed or unsigned int. This is correct according to what policies describe, but is at the same time surprising, given that comparison `safe<signed>{INT_MIN} < safe<unsigned>{UINT_MAX}` just gives a mathematically correct answer rather than throwing an exception. Document this behavior explicitly. - Remove underflow_error from the policies: it sends the wrong message, that som form of an underflow is checked in this library. - Expose functions like add(), divide() in public interface, they might be useful on their own. - Expose the constructor with check disabled in the public interface, like `safe<int>{1, checks_sisabled{}}` this helps to locally disable the checks where the user knows that certain chain of operaitons will not overflow, and checks are redundant, but the library cannot see it. - Issues reported with bit-shift operators - unary operator- on unsigned type with pormotion policy `automatic` could return a signed type. - Use BOOST_NORETURN wherever possible, e.g. in throwing policies. - Use BOOST_LIKELY, BOOST_UNLIKELY for the policy tests. - Add support for statful policies. - Maybe drop the support for automatic type widening, to simplify the interface and the scope of the library, and let some other library handle the widening, maybe BigInt. Regards, Andrzej Krzemienski

3 3

[release] 1.64.0 Decision on VS2017 version number?
by Rene Rivera 19 Mar '17

19 Mar '17

> (B) The community decides what version number we should be using and the > appropriate PRs are filed and applied and tested for all the repos > involved. Which means: > 1. The community has until 12:00 CDT US March 18 to decide on what the vc > version number and tag should be. > It's now past that time.. Is there consensus on what version number Boost should use for identifying the VS2017 toolset? If there is.. People need to start submitting PRs for the changes ASAP.. > 2. The community must post PRs for the places where we reference VS2017 > version numbers to the new number. Those are at least: > <https://github.com/boostorg/config> > <https://github.com/boostorg/build> > <https://github.com/boostorg/boost> > <https://github.com/boostorg/website> > People have until 17:00 CDT Monday March 20 to submit those PRs. Thanks. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

4 4

Project R-tree Serialisation
by Kabir Sahni 19 Mar '17

19 Mar '17

Hi everyone, I am midway through my competency test.I wanted to know whether working of serialisatjon for n dimensional point is the only thing to be demonstrated in main.cpp file. Thanks

3 2

Re: [boost] Advanced find() for associative containers
by Bjorn Reese 19 Mar '17

19 Mar '17

On 03/16/2017 06:18 PM, Boris Rasin via Boost wrote: > 2. Where exactly should it fit in the boost? The most appropriate place would be Boost.Algorithm, so that is Marshall's domain. > Public interface consists of a single free function template: > > template <typename C> > auto find(C& c, const typename C::key_type& key); Your find() function deviates on several accounts from std::find() so it should probably be renamed, e.g. to find_key. Can you elaborate on why you have a specialization that uses lower_bound()? What is the minimal C++ version required? Looks like C++14 from the auto return type.

2 1

Visual Studio multi-toolset support (was: [release] 1.64.0 please test master snapshot)
by Mateusz Loskot 18 Mar '17

18 Mar '17

On 18 March 2017 at 14:27, Peter Dimov via Boost <boost(a)lists.boost.org> wrote: > Mateusz Loskot wrote: > >>> No, VS 2015 can build with v140, v120, v110, v100, v90, as long as you >>> have the earlier versions installed. (VS 2017 can build with v140 even if >>> you don't have VS 2015 installed.) >> >> >> I understood VS2017 is first version with multi-toolset support. > > > The first version with multi-toolset support is VS 2012, although the only > two toolsets supported are v110 and v110_xp, which share the same version. > VS 2013 supports v90 - v120. VS 2015 supports v90 - v140. I always used the 'default' toolset of particular VS version, hence fostered ignorance about that multi-toolset support. > Wait, no, VS 2010 supports v100 and v90. :-) :-) Thank you for the enlightenment. Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

1 0

[release] 1.64.0 please test master snapshot..
by Rene Rivera 18 Mar '17

18 Mar '17

After help from various sources to get the VS2017 building working the latest master snapshot should at least try and build with VS2017. Assuming nothing horrible shows up today we will release the first beta tonight. Hence, please smoke test the latest master snapshot found at: <https://dl.bintray.com/boostorg/master/> -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

10 34

[review process] candidate library maintenance disturbs the review
by Andrzej Krzemienski 17 Mar '17

17 Mar '17

Hi Everyone, In the context of the discussion around review process improvements, I wanted to report another problem that I do not know how to solve. But maybe you do. Extending the review period by allowing the review on the BLIncubator looks like a good idea, but it also comes with a problem. The review applies to a particular commit (if we use GItHub terms), that is, to the state of the library on a particular branch at a particular point in time. If I see a review on BLIncubator (not that I see many of them), how do I know what commit it applies to and if it is even irrelevant. It might be partially relevant, but it puts me in an uncomfortable situation, that I will be investing my time in something that is likely to turn out to be useless. Also, I might consider submitting a review into BLIncubator, but what chances I have that it will be considered in the formal review, given that the formal review may work on a different commit: possibly on a quite different library by now? Regards, &rzej;

3 3

[gsoc2017] Apply for static_map
by Dobra Gábor 17 Mar '17

17 Mar '17

Hi all, I'm planning to participate to Boost GSOC, about static_map proposal. I'm Gábor Dobra, third-year student of Budapest University of Technology, Hungary, software engineering BSc. I've contributed to a few open-source libraries, I'm working as a C++ developer at a finance company. I'd like to contact a mentor of static_map (possibly Niall Douglas?) about my competency test. Thanks, Gábor

2 1

[gsoc17] Apply for the ticket to Project static_map
by John Lee 17 Mar '17

17 Mar '17

Hello all, I’m John Lee from China, learning at BUPT, Beijing. I love coding, especially in C++. I am willing to contribute to Boost Community and applying for developing cool things with the community in GSOC 2017. As described in the requirement section, I suppose that I am well prepared :-) - I spent my 2016 in learning and practicing my Modern C++ (up to C++ 14, not 17 so far due to the poor support of compilers...) on both coursework and real products. - I’ve been contributing to some projects in C++ open-source communities in China, such as http://purecpp.org/ . - I’ve developed an open-source Header-Only, Strong-Typed, Compile-time Object Relation Mapping (ORM) in Modern C++, available at https://github.com/BOT-Man-JL/ORM-Lite (over-1000-line non-coursework library, first committed 5 months ago and iterated over time) (surprisingly meeting the requirements) lol - I also developed an toy Graphics Library on both Windows and X Window, but no longer maintain it. :-( It’s available at https://github.com/BOT-Man-JL/EggAche-GL/tree/x11 I’m a bit confused on some items on the main page of Boost GSOC 2017, and I will appreciate it very much if anyone could answer these questions: - I am very interested in generic/meta programming and willing to apply for Project static map. My question is should I still post a solution of the competency test of this project? - There are 3 suggested proposals on the main page. Are they the project we should do in GSOC 2017, or we can do other projects if applying for the ticket to a certain project of three? - How could I find a mentor if I have the ticket? Posting something like this or contact one on the email list? It’s my first year to attending GSOC, and the first time to work with the community internationally. Thanks for your help. ;-) Best Regards, John Lee Feel free to contact me :-) https://BOT-Man-JL.github.io/ -- View this message in context: http://boost.2283326.n4.nabble.com/gsoc17-Apply-for-the-ticket-to-Project-s… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

[release} 1.64.0 additional merge required
by Oliver Kowalke 17 Mar '17

17 Mar '17

Unforutnately I got an andditional pull reqeuest taht fixes an segmentation fault on ARM - https://github.com/boostorg/context/pull/47/files Do I get permission to merge to master? ty, Oliver

2 1

Feedback request for Invariant Library idea
by Attila Szenczi 17 Mar '17

17 Mar '17

Hello! I am asking for some feedback if my library idea is good enough to be part of boost if it will meet the requirements. When i started this small utility lib i had 3 goals in my mind: - Write cleaner interfaces - Be safer with pre and post conditions - Eliminate redundant checks whenever possible at compile time The goal is to solve this problem for primitive types. *Example "bad" code:* void set_red_color(int red) { //Why the precondition is not visible on the interface? assert(red >= 0 && red <= 255); } *Example "good" code:* void set_red_color(bounded_i<0, 255> red) {} *Example "bad" code:* void foo(int bar) { assert(bar >= 0); } *Example "good" code:* void foo(positive_i bar) {} or void foo(lower_bounded_i<0> bar) {} Basically the main idea is to have an invariant_host class, which is customizable via policies: -* Invariant policy:* Define a static check() function which ensure the invariant. - *Fail policy: *Define a static trigger_assert function which is called when the invariant policy::check is failed. If the fail policy is disabled (constexpr bool flag), then the checks doesn't happen. Defining your own class looks like this: template<typename PrimitiveType> using my_type = invariant_host<PrimitiveType, default_fail, my_invariant<PrimitiveType>>; *Optimizations:* bounded_i<0, 50> bi (30); //trigger check bounded_i<0, 100> bi2(bi); //range check happens at compile time bounded_i<51, 52> bi3(bi1); //should be compile error bounded_i<0, 50> bi4(integral_constant<int, 10>); //check should happen compile time Things like operator+,-,*,/, bitwise operators etc can trigger checks. Tho alot of times it can be optimized away. For example adding 2 positive number should stay positive. C++20(?) contracts will be great, it will allow us to write cleaner interfaces, but i don't feel like it solve every issue i would like to solve. Do you think it would be a good addition to boost? I appreciate any feedback! Thank you very much! Attila Szenczi

2 4

Advanced find() for associative containers
by Boris Rasin 16 Mar '17

16 Mar '17

I've written an improved version of find() for associative containers (in the form of a free function), and I need your help answering these two questions: 1. Will it be a useful addition to boost? 2. Where exactly should it fit in the boost? Public interface consists of a single free function template: template <typename C> auto find(C& c, const typename C::key_type& key); If element is found, return value evaluates to true and contains iterator to found element. If element is not found, return value evaluates to false and contains hint iterator for insert/emplace. Allowing one to do this: if (auto i = find(container, key)) { i->value_member(); container.erase(i); } And this: if (auto i = !find(container, key)) { container.insert(i, expensive_value_construction()); } The code is here: https://github.com/Boris-Rasin/find I've tested it with the following containers: std::map std::multimap std::unordered_map std::set std::multiset std::unordered_set boost::container::map boost::container::set boost::container::flat_map boost::container::flat_set boost::multi_index::ordered_unique boost::multi_index::ordered_non_unique boost::multi_index::hashed_unique boost::multi_index::hashed_non_unique boost::multi_index::ranked_unique boost::multi_index::ranked_non_unique Thanks for your comments and help.

2 1

Fwd: Google Summer of Code
by Georgios Samaras 16 Mar '17

16 Mar '17

Dear all, my name is Georgios Samaras, a Masters student from NKUA, Greece. I am interested in the distance predicates <https://svn.boost.org/trac/boost/wiki/SoC2017#PROJECT1.Filteringofcomparedi….> of Boost Geometry, but I am flexible. I am attaching my CV in case anyone is interested. Here is my GitHub <https://github.com/gsamaras>, which demonstrates that I have experience in C++. Good luck with all your projects, Georgios Samaras

2 1

Issue Tracker for Boost organization?
by Olaf van der Spek 16 Mar '17

16 Mar '17

Hi, Do we have an issue tracker for Boost 'organization' itself? I know we've got mailing lists and the steering committee but it's hard to track issues like that. -- Olaf

2 1

[gsoc17] boost.uBLAS
by Leandro Raffo 16 Mar '17

16 Mar '17

Hi My name is Leandro, I'm a CS student at the University of Buenos Aires, and I'm interested in the uBLAS projects. I've already done the competency test and I was wondering who I should talk/send it to and who could be a possible mentor. Thanks

3 2

Libc++ failures on linux
by Tom Kent 16 Mar '17

16 Mar '17

So I tried to add my first linux regression runner using libc++ with clang, and I'm seeing the following error saying it can't find <cstddef>: http://www.boost.org/development/tests/develop/developer/output/teeks99-02-… "clang++-3.9" -c -x c++ -Wno-c99-extensions -std=c++1z -stdlib=libc++ -O0 -g -fno-inline -Wall -g -m64 -DBOOST_ALL_NO_LIB=1 -DBOOST_CHRONO_STATIC_LINK=1 -DBOOST_CHRONO_THREAD_DISABLED -DBOOST_SYSTEM_NO_DEPRECATED -DBOOST_SYSTEM_STATIC_LINK=1 -DBOOST_TEST_NO_AUTO_LINK=1 -DBOOST_TIMER_STATIC_LINK=1 -I".." -o "/var/boost/run/results/boost/bin.v2/libs/accumulators/test/count.test/clang-linux-3.9~c++1z~lc/debug/link-static/count.o" "../libs/accumulators/test/count.cpp" In file included from ../libs/accumulators/test/count.cpp:6: In file included from ../boost/test/unit_test.hpp:18: In file included from ../boost/test/test_tools.hpp:17: In file included from ../boost/config.hpp:44: ../boost/config/select_stdlib_config.hpp:18:12: fatal error: 'cstddef' file not found # include <cstddef> ^ 1 error generated. However when I try to compile the following program on the same docker image (teeks99/boost-build:clang-3.9) // basic.cpp #include <cstddef> int main(int argc, char* argv[]) { size_t three = 3; return three; } with: $ clang++-3.9 -stdlib=libc++ -std=c++1z basic.cpp It works fine $ ./a.out $ echo $? 3 I can build this sample file fine with the whole command line shown above, so it doesn't seem to be one of the other options conflicting. Any thoughts on why boost code wouldn't be able to find this but some basic stuff would? One relevant detail, I'm building with clang 3.9, however the libc++ version that I'm using (ubuntu default) is the one that shipped with clang 3.7. That shouldn't preclude including a file! I also found a couple old threads with the same error, but never any good resolution. http://lists.boost.org/boost-testing/2012/07/7075.php http://lists.boost.org/boost-users/2012/11/76659.php Tom

4 7

Re: [boost] [release] 1.64.0 closed for Beta
by Rene Rivera 15 Mar '17

15 Mar '17

On Tue, Mar 14, 2017 at 9:50 PM, Tom Kent <lists(a)teeks99.com> wrote: > > > On Tue, Mar 14, 2017 at 9:23 PM, Rene Rivera <grafikrobot(a)gmail.com> > wrote: > >> On Tue, Mar 14, 2017 at 6:09 PM, Tom Kent via Boost < >> boost(a)lists.boost.org> wrote: >> >>> >>> I tried building the latest snapshot from bintray, but it doesn't find >>> any >>> compiler when running `bootstrap.bat`. However running `boootstrap.bat >>> vc14.0` works, so something in bootstrap's lookup logic? >>> >> >> Which VSs did you have installed when you tried that? >> > > Everything from VS 2005 to VS2017. > In my Win10 setup I have VS 11, 12, 14, and 14.10.. And it seems to work for me. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

2 1

[release] 1.64.0 closed for Beta
by Rene Rivera 15 Mar '17

15 Mar '17

The master branch is now closed for all changes except by permission for the Beta release. Also, remember to add your libraries' changes to the release notes at: < https://github.com/boostorg/website/blob/master/feed/history/boost_1_64_0.q… > Thanks, -- The Boost Release Team -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

7 17

[config] msvc-14.1 and C++14 constexpr
by John Maddock 13 Mar '17

13 Mar '17

So.... MSVC-14.1 (2017) sort of supports C++14 constexpr. However, it is also prone to internal compiler errors, and currently does not compile config_test.cpp unless we set BOOST_NO_CXX14_CONSTEXPR. Does anyone have a view on which way this macro should be set? Thanks, John. --- This email has been checked for viruses by AVG. http://www.avg.com

4 3

Re: [boost] [gsoc17] Project1: Static map: Can I implement the competency test in g++-7?
by Vic Luo 13 Mar '17

13 Mar '17

Hi, During the implementation of my static_map, I recently encountered a problem: how to deal with string types? For example: constexpr auto cmap_str = make_static_map({ {"abc", 1}, {"bcd", 2} }); static_assert(cmap_str["abc"] == 1, "test"); In my implementation, KeyType requires 1. constexpr operator==, which is not provided by const char * 2. constexpr hash(const KeyType&). Since there is no such thing in standard library, I have to implement some in this project. Currently I would like to use string_view, since it looks like a general solution for compile-time string with lots of constexpr functions, but I don't know which of the following designs looks better: Design A: template<typename KeyType, typename MappedType, typename EqualOp = StaticEqualOp<KeyType>, typename HashOp = StaticHashOp<KeyType>> class static_map; // StaticEqualOp: Specialize StaticEqualOp for those KeyTypes that // can construct string_view and use operator== of string_view, // otherwise we simply use operator== of KeyType // StaticHashOp: size_t operator()(const string_view&, const string_view&) // for types that can construct string_view Design B: We don't specialize any StaticEqualOp for const char*. Instead, make_static_map({{"abc", 1}}) returns static_map<string_view, int> instead of static_map<const char *, int>. Which one is better? Or is there any more feasible design? Thanks, -- --------------------------------- Vic Luo Shanghai Jiaotong University Key fingerprint 0x98809ca08bf5662a

3 6

[safe_numerics] The review is finished
by Andrzej Krzemienski 13 Mar '17

13 Mar '17

Hi Everyone, The review of safe_numerics library by Robert Ramey is now finished. Thanks to all participants for submitting their reviews, and sharing their insights. I will announce the result in the next couple of days. -- Andrzej Krzemienski, review manager

1 0

[gsoc17] Project Static map : Clarifications and Competency test
by Pasindu Kanchana 13 Mar '17

13 Mar '17

Hi I am Pasindu Kanchana from Sri Lanka, studying at the University of Moratuwa as a final year undergraduate(4th year).I have worked as a developer intern for past 6 months for an exchange related company focusing c++ and have used boost memory mapped_file , tokenizer and filesystem. It would be really helpful if i get answers for the following 3 questions. A)Although the requested key is not in range ,still the code should compile?(without any error throwing and halting compilation) B)The solution to the problem should prove that compile time initiation of the map is confirmed(constexpr should definitely compile at the compile time not remain to the run time).would it be enough to practically proving this for different compilers under c++14 to approve as a solution? C)Should I take the competency test? Thank you.

2 1

[outcome] Seeking review manager for Boost.Outcome
by Niall Douglas 13 Mar '17

13 Mar '17

It's only taken a month of work and writing my own C preprocessor, but I finally have a usable set of API reference docs for Outcome at https://ned14.github.io/boost.outcome/. Apart from a few docs glitches caused by the old version of doxygen on Travis, I'd say Outcome is ready for review. Would anybody be interested in review managing Outcome? Thanks, Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

1 0

[safe_numerics] Review
by Barrett Adair 12 Mar '17

12 Mar '17

Last minute review here. This will be short and sweet. > What is your evaluation of the design? I like it. The "drop-in replacement" approach is easy to understand. > What is your evaluation of the implementation? It's more complicated than I expected, but if it works, it works. I think the runtime checks in this library might be good candidates for BOOST_[UN]LIKELY. Are there test cases for post decrement? The implementation appears to return a reference to local: https://github.com/robertramey/safe_numerics/blob/master/include/safe_base.… safe_base & operator--(int){ // post decrement safe_base old_t = *this; --(*this); return old_t; } If I'm reading correctly, this is UB (and likely a segfault). > What is your evaluation of the documentation? The documentation is quite thorough. A "cheatsheet" page would be nice, because most of the documentation is rather in-depth. There are many bells and whistles documented that end users might not want to sift through. I'm not sure what this would look like, though. The FAQ appears to be formatted strangely. Notes about bitwise operators in the FAQ might be nice (signed right-shift especially). Very nice job overall. Much work and thought went into this. > What is your evaluation of the potential usefulness of the library? Useful. I'd consider using it in applications that are not latency-sensitive, perhaps if only in debug mode. Detecting accidental unsigned underflow is especially useful. I do think this library might be much more useful with floating point support, if it is eventually added. > Did you try to use the library? With what compiler? Did you have any problems? No. > How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? 3 hours reading documentation, source code, and previous reviews. > Are you knowledgeable about the problem domain? No more than any CS grad should be. > Do you think the library should be accepted as a Boost library? Yes. This library would be a good addition to Boost. I trust that Robert will address the issues raised in this review and others (especially Steven's) before this library would be shipped with a future Boost release, should it be accepted.

3 3

[container] moving a pre-built vector into a flat_set
by Sam Kellett 12 Mar '17

12 Mar '17

a common problem i encounter is that i have two stage's w/r/t to a large collection of data: building and querying. vector is obviously the king of building. flat_set is the king of querying. so what i often tend to do is build up a very large vector, sort it then create a flat_set using the flat_set(ordered_unique_t) constructor. however this still copies the entire vector into the flat_set, right? what i would like to be able to do is move the vector straight into the flat_set, something like: std::vector<T> data; flat_set data_set1(std::move(data)) // move vector in and sort it // or: std::sort(data.begin(), data.end()); // sort vector flat_set data_set2(ordered_unique_t, std::move(data)) // and move it in is this doable (am i just being blind?) or is there plans/interest for this?

8 19

[safe_numerics] review
by John McFarlane 12 Mar '17

12 Mar '17

I'm reviewing this library as someone who has tried to use it in the past, has made minor contributions to it and has a vested interest in improving numeric support for C++ developers. However, I have very little knowledge of the code and relatively little experience of Boost and the Boost community. I hope my comments are helpful nevertheless. tl;dr: make `safe<>` more like the type I describe in [ http://wg21.link/p0554#componentization-safety] or at least ensure that the API can evolve toward this without backward-breaking changes. ---- I do feel that a safe integer type should be available to as many people as possible and Robert's approach is on the right track. But given the choice, I would make some significant API changes. Any of these which can be added incrementally should not delay acceptance of safe_numerics into Boost. The goal of making `safe<int>` a drop-in replacement for int is essential. But further, `safe<Rep>` should be a drop-in replacement for `Rep` where `Rep` is any integer type which exhibits "surprising" results, e.g. through UB of overflow / divide-by-zero or indeterminate initial value. `Rep` should not just be any type for which `std::is_integral_v<Rep>` is true and ideally, `safe<safe<Rep>>`, while pointless, should compile and function like `safe<Rep>`. Unfortunately, `safe<int>` fails to be a drop-in replacement for fundamental integer types for a number of reasons. Firstly, conversion from floating-point types is not fully supported [ https://github.com/robertramey/safe_numerics/issues/13] This alludes to a wider issue with the API of this library: it tries to do too much. Conversion from integers to real numbers is not so much *unsafe* as *lossy*. Users intuitively understand that `int n = 0.5;` will not define a variable with value 0.5 and this is often exactly what they intend, e.g.: void sample(map<safe<int>, safe<int>>& histogram, double v) { ++ histogram[v]; } If implicit conversions to and from other numeric types is not supported, this prevents potential users from converting existing programs. Bear in mind that implicit conversions do not prevent `safe<>` from catching run-time errors. And if one wishes to catch risky narrowing conversions, they already have tools to do this, e.g. GCC's `-Wconversion`. In short, it's a separate concern. Another example of overreach of the API is in governing the results of arithmetic operations. Via policy choice, `safe<int>` can produce auto-widening functionality, e.g. returning a 16-bit result from a multiply operation with 8-bit operands. This behavior belongs in a whole different class. It achieves overlapping safety wins but it complicates the interface. I believe that the correct approach is to produce a type which is dedicated to performing run-time overflow checks and another type which performs automatic widening and to combine them, e.g.: // simplified for clarity, see: wg21.link/p0554#composition-safe_elastic_integer template<typename Rep> class auto_widening_integer; template<typename Rep> class safe_integer; template<typename Rep> using extra_safe_integer = safe_integer<auto_widening_integer<Rep>>; Of the two component classes, `auto_widening_integer` can be used to perform limited overflow-avoidance with zero run-time overhead. (The penalty is that if, say, you multiply two 32-bit integers together, you get back a 64-bit result.) Meanwhile, `safe_integer` provides iron-clad run-time safety checking and obeys the promotion rules of its `Rep` type. The combination of them reduces the number of run-time checks by reducing the chance of overflow. This solution is more complex, but the individual components are simpler and self-sufficient. Unfortunately, due to these kinds of design choices, I have not spent more time attempting to integrate Robert's library with my own. I would dearly like to include `safe<>` as part of a wider set of numeric components which users can then combine to their hearts content. Details of how I think that might come about can be found in (shamelessly plugged) paper, [wg21.link/p0554]. I accept that's a tall order. At the very least I would like developers of substantial projects to be able to replace build-in integers with the following: #if defined(NDEBUG) template<typename Rep> using Integer = Rep; #else template<typename Rep> using Integer = safe<Rep>; #endif Hope that helps, John

4 12

HELP Needed
by Poulomi Hore 11 Mar '17

11 Mar '17

Hi, I would like to work on project 1 under Boost.Geometry for GSoc 2017. Can you please suggest as to where should i start from ? Thank you. Regards, Poulomi Hore

2 1

[safe_numerics] One more review
by Antony Polukhin 11 Mar '17

11 Mar '17

- What is your evaluation of the design? Looks good, simple to use. I'd like to see an additional statefull ExceptionPolicy that remembers that an UB was triggered, but does not throw at all. Here's how it could be used: bool try_do_something(int& out) noexcept { using namespace boost::numeric; safe<int, native, lazy> x = INT_MAX; // remembers that error was triggered ++x; // ... other operations on `x` // ... if (!x.no_errors()) { // One of the operations triggered UB return false; } out = x; return true; } - What is your evaluation of the implementation? Checked a few border cases that I'm aware of. All of them were taken care of in the library. Nitpicks: Missing BOOST_NORETURN in multiple places, for example https://github.com/robertramey/safe_numerics/blob/master/include/exception_… . Adding that attribute may result in better code generation and in warnings suppression. std::is_literal_type type trait is deprecated since C++17 https://github.com/robertramey/safe_numerics/blob/master/include/interval.h… More generic streaming operators could be profitable (better to use basic_ostream<Char, Trait> instead of ostream) https://github.com/robertramey/safe_numerics/blob/master/include/interval.h… Many operations may be decorated with noexcept This macro seems broken https://github.com/robertramey/safe_numerics/blob/master/include/safe_liter… . Also looks like this class is not covered well with tests, because line https://github.com/robertramey/safe_numerics/blob/master/include/safe_liter… shall not compile There's a bunch of implicit conversions in the library https://github.com/robertramey/safe_numerics/blob/master/include/safe_base.… (BTW, have not found a body of this one). Would it be better to make them explicit? Those headers are very heavy https://github.com/robertramey/safe_numerics/blob/7ee656ecdf23f6f29f9333176… Try using <iosfwd> and making all the function below to use `basic_ostream<Char, Trait>&`. No need to define those in `namespace std` https://github.com/robertramey/safe_numerics/blob/7ee656ecdf23f6f29f9333176… . Defining those in `boost::numeric` namespace works fine (thanks to ADL!). I'd really like to see tests coverage for the library. This is pretty simple to add, just follow the instructions from here: https://svn.boost.org/trac/boost/wiki/TravisCoverals - What is your evaluation of the documentation? Good, very interesting examples. - What is your evaluation of the potential usefulness of the library? Useful. I was dealing with such problems in Boost.LexicalCast. - Did you try to use the library? With what compiler? Did you have any problems? Have not tried. - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? About two hours of reading source code and docs. - Are you knowledgeable about the problem domain? A little bit, not an expert. - Do you think the library should be accepted as a Boost library? Yes, the library should be accepted. -- Best regards, Antony Polukhin

5 10

[safe_numerics] Formal review starts today
by Andrzej Krzemienski 11 Mar '17

11 Mar '17

Hi Everyone, Today, on March 2nd (or tomorrow, depending on your timezone), is the start of the formal review of safe_numerics library by Robert Ramey. The review will run till March 11th. I will be serving as review manager. safe_numerics is a set of drop-in replacements for the built-in integer types, which make the guarantee that the results of operations are either correct according to the rules of integer arithmetic or report a diagnosable error (rather than offering modulo arithmetic results, or resulting in undefined behavior, or returning incorrect results as in the case of signed vs. unsigned comparisons). The library can be found on GitHub: https://github.com/robertramey/safe_numerics/ Online docs: http://htmlpreview.github.io/?https://github.com/robertramey/safe_numerics/ master/doc/html/index.html Formal Review comments can be posted publicly on the mailing list or Boost Library Incubator <http://blincubator.com>, or sent privately to the review manager, that is myself. Here are some 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? And most importantly: Do you think the library should be accepted as a Boost library? For more information about Boost Formal Review Process, see: http://www.boost.org/community/reviews.html Your review is needed! Regards, Andrzej Krzemieński, review manager.

5 19

[safe_numerics] Last three days
by Andrzej Krzemienski 11 Mar '17

11 Mar '17

Hi Everyone, We have three last days remaining for safe_numerics review (till March 11th). If you like working under time pressure, this is the perfect moment for doing your review. If you would like to submit your review, but feel you will not make it till March 11th, let me know, we can try to extend the review period. Currently, I recorder three reviews with a yes/no call, from Paul A. Bristow and Steven Watanabe, and one without a yes/no call from Vicente J. Botet Escriba. If you have submitted a review, but were not mentioned in my list, please let me know: it means I must have missed it. ----- safe_numerics is a set of drop-in replacements for the built-in integer types, which make the guarantee that the results of operations are either correct according to the rules of integer arithmetic or report a diagnosable error (rather than offering modulo arithmetic results, or resulting in undefined behavior, or returning incorrect results as in the case of signed vs. unsigned comparisons). The library can be found on GitHub: https://github.com/robertramey/safe_numerics/ Online docs: http://htmlpreview.github.io/?https://github.com/robertramey /safe_numerics/master/doc/html/index.html Formal Review comments can be posted publicly on the mailing list or Boost Library Incubator <http://blincubator.com>, or sent privately to the review manager, that is myself. Here are some 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? And most importantly: Do you think the library should be accepted as a Boost library? For more information about Boost Formal Review Process, see: http://www.boost.org/community/reviews.html Regards, &rzej;

7 17

how can I use ipv6 on boost::asio
by Kazuaki Okimoto 11 Mar '17

11 Mar '17

Hi I can connect through IPV4 when I open the socket by following method. _socket->open(boost::asio::ip::tcp::v4()); But , it can't use IPV6 network. I'd like to use my app on IPV6 network. How can I use IPV6 on boost:asio ? Dies anyone tell me the method of it ? best regards

2 1

IPC: compiler optimization related issues
by Robert 11 Mar '17

11 Mar '17

Hi! Before creating a bug in trac, would you accept issues related to compiler optimization (-O2 and -O3) flags? I have a very specific issue with an inter-process mutex (race condition), but it can be reproduced only when flag O2 or higher is being used during compilation. Thank you!

2 2

To contribute in Static map (boost::static_map<Key, T, ConstExprHash = boost::constexpr_hash<Key>, Pred = boost::constexpr_equal_to<Key>>)
by SUSHIL KHANCHI 11 Mar '17

11 Mar '17

Hello, I am an engineering student in Computer Science from SMVDU(India). I would like to contribute to your STATIC MAP project and take part in Gsoc.For getting familiar to your work, I would like to get my hands on your projects issues. Can you please guide me to your project where I can start with fixing small bugs.

1 0

[Endian] Reading/writing from/to byte buffers
by Olaf van der Spek 10 Mar '17

10 Mar '17

Hi, One often needs to read or write values from/to a buffer while having a pointer. Could you support this? I guess one could use *reinterpret_cast<big_int64_buf_t&>(*p) but I think functions would be more convenient. On second guess one probably has to use memcpy rather then reinterpret_cast. The functions are probably implemented already but aren't exposed. https://github.com/boostorg/endian/issues/17 -- Olaf

2 3

Fw: Build failed: smart_ptr 1.0.81-develop
by Peter Dimov 10 Mar '17

10 Mar '17

AppVeyor says that bootstrap.bat is broken: bootstrap Building Boost.Build engine ****** B A T C H R E C U R S I O N exceeds STACK limits ****** Recursion Count=509, Stack Usage=90 percent ****** B A T C H PROCESSING IS A B O R T E D ****** Command exited with code 255 -----Original Message----- From: AppVeyor Sent: Friday, March 10, 2017 17:22 To: pdimov(a)pdimov.com Subject: Build failed: smart_ptr 1.0.81-develop Build smart_ptr 1.0.81-develop failed Commit fac6fbe3cf by Glen Fernandes on 3/10/2017 3:21 PM: Update documentation in make_shared_array.html Configure your notification preferences

1 0

[regression dashboard] missing tests
by Raffi Enficiaud 10 Mar '17

10 Mar '17

Hi all, The regression dashboard is truncated, I should see many more tests here: http://www.boost.org/development/tests/develop/developer/test.html at least as many as for the master branch: http://www.boost.org/development/tests/master/developer/test.html Any idea? Raffi

1 0

[stacktrace] review
by Artyom Beilis 10 Mar '17

10 Mar '17

Hello, This is my review of stacktrace library: Note that I have experience with the subject as I developed a similar library for the CppCMS framework [1] > - What is your evaluation of the design? > The design is straight forward and I don't see any major issues with the API. Also I have several suggestions in handling backtrace with catch from } catch (const traced& e) { std::cerr << e.what() << '\n'; if (e.trace) { std::cerr << "Backtrace:\n" << e.trace << '\n'; } } catch (const std::exception& e) { std::cerr << e.what() << '\n'; } In my library I use much simpler approach in terms of API [2] catch(std::exception const &e) { std::cerr << e.what() << std::endl; std::cerr << booster::trace(e); } Where booster::trace is a manipulator that prints strack trace if "e" contains backtrace information - much shorted code without additional catch. I find it very easy to use. Just a suggestion. I also like with_trace templated class idea. > - What is your evaluation of the implementation? Most of my > personal concerns with this library are with the implementation and I > would hugely appreciate feedback from others with substantial > experience of using stacktracing "in anger" in non-trivial use case > scenarios. I mostly reviewed the backend. Linux: ========= 1st of all: I recommend mentioning in the documentation the option -rdynamic/-export-dynamic as otherwise dladdr would likely to fail - it is critical as many may miss one. Regarding use of add2line utility: 1. Failing to calling an external program in case of dladdr fails is bad idea. This behaviour is unexpected by the user. I understand the advantage of this as you can use debug information but should be done only per user specific request (i.e. compilation option) and not by default. 2. If you call add2line - use it for ALL addresses in backtrace at once and not for each single one! My recommendation is to provide alternative backed that uses other way to extract information not involving forking. Maybe try to analyze debug data or so - or require preparing initial map using nm tool and than loading it from file or something like that. Additionally calling the backed linux is bad - as same approach with slight modifications works on *BSD, Mac OS X and Solaris (RIP). Windows: ======== I have a question why you used COM instead of SymFromAddr functions? I understand thread safety issues but simple mutex can solve them. My concerns are regarding MinGW compilers. Have you tested it on MinGW compiler? It wouldn't work as it used MSVC debug information in general so maybe it is good idea to provide an alternative backend that extracts only address and DLL name so you can analyse the stacktrace later (using addr2line utility for example) Take a look on my code [1] regarding non-msvc windows compilers - it provides at least some useful information. > - What is your evaluation of the documentation? The documentation is ok in general and straight forward as the library itself. What I do lack is the documentation of underlying backends - how do they work. 1. use of -rdynamic/-export-dynamic should be noted in "bold face" regarding the use of the library. 2. please do not call it "POSIX backend" - as there none of the stuff you use is actually POSIX... Also you'll probably need different backends for MINGW and mention it. > - What is your evaluation of the potential usefulness of the > library? Very Very useful. > - Did you try to use the library? With what compiler? Did you have any problems? No I didn't - I mostly read the documentation and the backend code. > - How much effort did you put into your evaluation? A glance? A > quick reading? In-depth study? 3-4 hours > - Are you knowledgeable about the problem domain? Yes I am. I have written similar library for CppCMS project [1] - FINAL VOTE: Yes, Conditionally Conditions: Use of addr2line must not be enabled by default. [1] https://sourceforge.net/p/cppcms/code/HEAD/tree/framework/trunk/booster/boo… https://sourceforge.net/p/cppcms/code/HEAD/tree/framework/trunk/booster/lib… [2] https://sourceforge.net/p/cppcms/code/HEAD/tree/framework/trunk/booster/boo… Best Regards, Artyom Beilis

4 5

boost::asio::ssl::stream handshake hang up in reconnection
by jupiter 09 Mar '17

09 Mar '17

Hi, I am running boost socket communication on Debian 8, the following client code works fine when it connected to the server the first time. s.lowest_layer().connect(*endpoint_iterator++, error); s.handshake(boost::asio::ssl::stream_base::client, error); But when the server connection lost, the client would try to run above code repeatedly until the server connection was resumed, the it passed the first line of s.lowest_layer().connect without error, but the it stuck at s.handshake(boost::asio::ssl::stream_base::client, error), the handshake hang up. What I could be missing here? Thank you.

1 0

[preprocessing] Feedback requested on a C99 preprocessor written in pure universal Python
by Niall Douglas 09 Mar '17

09 Mar '17

Those of you who watch reddit/r/cpp will know I've been working for the past month on a pure Python implementation of a C99 conforming preprocessor. I am pleased to be able to ask for Boost feedback on a fairly high quality implementation: https://github.com/ned14/pcpp It passes the C11 standard's list of "tricky" preprocessor expansions and the mcpp test suite. It has no issue correctly handling the preprocessor metaprogramming I've thrown at it from my Boost libraries. I'm not going to claim it can handle Boost.Preprocessor or especially Boost.VMD and I've tried neither, but pull requests with source code fixes adding support for those (with accompanying unit tests) would be welcome. My main use case for writing this is to assemble my header only Boost libraries into a single "drop in and go" file. To that end it has a (still buggy) --passthru mode which passes through #define and #undef plus any #if logic which uses an undefined macro. I'm still working on pass through mode so expect showstopper bugs in that configuration, but as a straight highly standards conforming preprocessor it's ready for others to use and I welcome any feedback. There are a multitude of use cases, everything from running as a conforming preprocessor before invoking MSVC to compile right through to parsing, reflection and introspection of source code. (and yes it is also a Python library as well as a command line tool, you can find API reference docs at https://ned14.github.io/pcpp/) I look forward to any feedback and my thanks in advance for it. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

7 21

[regression runner] Preference libstdc++ vs. libc++
by Tom Kent 09 Mar '17

09 Mar '17

I have a bunch of linux regression runners that are executing clang runs of the boost regression suite (clang 3.0 - 4.0), currently these are all using the default, GCC libstdc++. Is there an interest from developers to see these runs with libc++? The basic options: 1) Convert all compatible clang builds to libc++, don't mess with libstdc++ & clang. 2) Duplicate all the clang builds to build each version with both (acknowledging that will add nearly 1/3 to the already large ~125 linux runs). 3) Change most of the runs, but keep a few token libstdc++ & clang runs, with the latest compiler version (what c++ standard c++14? c++1z?). 4) Just add a few token libc++ runs, with the latest compiler version (what c++ standard c++14? c++1z?). 5) Don't add libc++. For background (you can respond to one of the above preferences without reading on), there are two machines constantly running linux builds (in addition to the two windows ones) that I manage. One I consider the "full" suite of compilers. It runs clang 3.0 - 4.0 and gcc 4.4 - 6. For the oldest and latest releas (gcc 4.4, gcc 6, clang 3.0, clang 3.9), I run all the supported standard configs I could find (c++98, c++0x, gnu98, gnu0x -- c++03, c++11, c++14, c++1z and their gnu equivalents). I also do runs with optimization and warnings cranked, against the latest standard config e.g. "-std=c++1z -O2". For all the compiler versions that aren't on the endcaps, I just run a single config with whatever was the latest standard config for that compiler (e.g. gcc-4.8 with c++1y). This is all repeated for develop and master for a total of about 100 different configurations. The machine I consider the "fast results" machine is configured with only four runs, one each for the latest release of gcc and clang with the latest supported standard config (currently gcc-6 1z and clang-3.9 1z), for both master and develop. The goal here is that for any change checked in, the author will have feedback on its success against something modern and relevant within just a few hours. As a backup to the "fast results" machine, I also run those four regression modern runs, interspersed with the rest of the configs every dozen or so runs, bringing the total number of runs on the "full" machine up to around 125, which takes about a week for the machine to get through all the configurations. You can see more details about all of this on the github page where I keep my regression build scripts: https://github.com/teeks99/boost-build/tree/master/Regression The actual confgs run by the "full": https://github.com/teeks99/boost-build/blob/master/ Regression/teeks99-02/machine_vars.json The docker builds for all these machine configurations are kept at: https://github.com/teeks99/boost-build/tree/master/Docker And can be pulled from the docker hub with e.g. `docker pull teeks99/boost-build:clang-3.9` If you've read this far, I'd be happy for any other opinions from developers who use the test matrix. Is it worth keeping all those compilers in the middle? Do we need to test the latest compilers with all the different standard configs (03, 11, 14, 1z + gnu equivalents)? Thanks, Tom

12 27

[safe numerics] comment
by Robert Ramey 09 Mar '17

09 Mar '17

I'm re-posting Vicente's message which apparently got lost in a server issue so we can respond to it. Robert Ramey Hi, let me start with some comments and questions. I was wondering if the requirements of Numeric don't need some kind of conversions between other numeric types. https://htmlpreview.github.io/?https://raw.githubusercontent.com/robertrame… T(u) T{u} How can you implement the conversion from safe<U> to T if you can not convert from U to T? We have implicit conversion from T to Safe and from Safe to T template<class T> constexpr /*explicit*/ safe_base(const T & t); template< class R, typename std::enable_if< !boost::numeric::is_safe<R>::value, int >::type = 0 > constexpr operator R () const; constexpr operator Stored () const; I believed that the conversion from Safe to T needed to be explicit. Having implicit conversion in both directions is suspect. Why the explicit conversion between safe<T> and safe<U> are not allowed when T and U are not the same? IMO, safe_base<T> is either not trivial default constructible and we check the validity of 0, if we don't check it, we should declare it =default. The current definition doesn't adds nothing and makes the type a non-POD and non trivial_default_constructible, which forbids its use on binary messages. constexpr explicit safe_base() { // this permits creating of invalid instances. This is inline // with C++ built-in but violates the premises of the whole library // choice are: // do nothing - violates premise of he library that all safe objects // are valid // initialize to valid value - violates C++ behavior of types. // add "initialized" flag. Preserves fixes the above, but doubles // "overhead" // still pending on this. } I'll suggest to use constexpr safe_base() = default; BTW, why the default constructor is declared explicit? As you say, could we talk of safe<short> when we can have one uninitialized? I believe this needs to appear clearly on the documentation if not already in. Has safe<const T> a sense? Integer<T> are not traits as there is a compiler error when T is not an integer :( template <class T> class Integer : public Numeric<T> { // integer types must have the corresponding numeric trait. static_assert( std::numeric_limits<T>::is_integer, "Fails to fulfill requirements for an integer type" ); }; The same for Numeric. Have you considered to define traits (usable with SFINAE)? I don't see a concept SafeNumeric. Have you considerd it? BTW, these concept classes check only for a single requirement. Shouldn't you specialize numeric_limits lowest()? Have you considered to define basic algorithms managing with the valid conversion between Numeric with the different policies, as Lawrence Crowl is proposing for the standard? http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0103r1.html http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0105r1.html I find weird the way you are including the files #include "concept/integer.hpp" #include "concept/exception_policy.hpp" #include "concept/promotion_policy.hpp" #include "safe_common.hpp" #include "exception_policies.hpp" #include "boost/concept/assert.hpp" I believed we used to inlcude boost files using <> and the absolute path. Is this a good practice? Does it allows the compiler to perform better? Best, Vicente

2 5

Regarding Mentor
by Shaunak Dixit 08 Mar '17

08 Mar '17

Hi I have joined the Boost Developer's mailing list please help me how to find a mentor. thanks you

3 4

[gsoc17] Project1: Static map: Can I implement the competency test in g++-7?
by Vic Luo 07 Mar '17

07 Mar '17

Hi, I'm Zheng Luo, a third-year undergraduate from Shanghai Jiaotong University who have special interest in C++ programming(especially for templates). This is my second year of applying Google Summer of Code and I'm willing to contribute to Static Map project mentioned on SoC2017 page. Previously I worked for a company as a C++ intern for months on Chromium-related projects where I gained some experience about C++ in industry. And my question is, am I allowed to implement the competency test of static_map in g++-7? I have just implemented my own version of static_map which supports the following operations: constexpr StaticMap<int, const char *, 3> m(make_pair(2, "abc"), make_pair(4, "def"), make_pair(6, "ghi")); if (!m[4]) abort(); const char *foo = m[2]; return 0; which is compiled into assembly as: main: xorl %eax, %eax ret under g++-7 with -std=c++1z -O3 So I was wondering did I pass the test? Thanks, -- --------------------------------- Vic Luo Shanghai Jiaotong University Key fingerprint 0x98809ca08bf5662a

3 4

[gsoc17]Getting started with Project 2 in Boost.Geometry:R-tree serialization
by Ruoyun Jing 07 Mar '17

07 Mar '17

Hi Everyone: My name is Ruoyun Jing, I am an undergraduate student in Northwest University(China) of Software Engineering.Although i am a girl,i really love coding and algorithms!!! I've coded many algorithms problems with C++ and Python,and got Bronze Metal in ACMICPC Asia Shenyang Regional contest. GSoC is really a precious chance for me to get in touch with open source software. After reading all the organizations and their projects, I'm pretty interested in R-tree serialization in Boost.Geometry. Despite my lack of project experience,i will try my best to learn ,code and communicate with mentor!!! Looking forward from you.:) Thank. -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

3 10

[gsoc17] Regarding projects 1 & 3 of Boost.Geometry
by Vissarion Fisikopoulos 07 Mar '17

07 Mar '17

Hello, I proposed to mentor projects 1 & 3 of Boost.Geometry. As in Boost GSoC webpage you may choose to either provide links to existing library you developed or take a competency test. For the latter the test is the same for both projects 1 & 3, you can find it in https://svn.boost.org/trac/boost/wiki/SoC2017#Programmingcompetencytest2 Best, Vissarion ps. sorry for cross-posting, my previous reply inherited a weird subject title that most probably made it difficult to discover in most email clients > Date: Thu, 2 Mar 2017 15:41:39 +0530 > From: Shaunak Dixit <sdixit_be15(a)thapar.edu> > To: boost(a)lists.boost.org > Subject: Re: [boost] Regarding Mentor > Message-ID: > <CAAEsT1nYLwdmDnV5GNHuGAQH3DCejxx__AAtq+gak5EhKH1U3A(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > I would like to work on boost.geometry. > For given projects > > *PROJECT 1. Filtering of compare distance predicates.* > <https://svn.boost.org/trac/boost/wiki/SoC2017#PROJECT1.Filteringofcomparedi….> > > *PROJECT 3. Nearly antipodal points distance accuracy improvement.* > <https://svn.boost.org/trac/boost/wiki/SoC2017#PROJECT3.Nearlyantipodalpoint….> > > Please help me out how to start and in finding mentors for the above > projects. > > Thanks a lot > On 2 Mar 2017 15:18, "Shaunak Dixit" <sdixit_be15(a)thapar.edu> wrote: > >> Thanks a lot >> But I would like to work on geometry >> >> Thank you >> On 2 Mar 2017 14:49, "David Bellot via Boost" <boost(a)lists.boost.org> >> wrote: >> >>> you can find project with mentors and their email address on >>> https://svn.boost.org/trac/boost/wiki/SoC2017 >>> >>> I proposed to mentor for Boost.uBLAS (numerical computations). If you're >>> interested, please contact me. >>> >>> Cheers, >>> David >>> >>> On Wed, Mar 1, 2017 at 8:08 PM, Shaunak Dixit via Boost < >>> boost(a)lists.boost.org> wrote: >>> >>> > Hi I have joined the Boost Developer's mailing list >>> > please help me how to find a mentor. >>> > >>> > >>> > >>> > >>> > thanks you >>> > >>> > _______________________________________________ >>> > Unsubscribe & other changes: http://lists.boost.org/ >>> > mailman/listinfo.cgi/boost >>> > >>> >>> _______________________________________________ >>> Unsubscribe & other changes: http://lists.boost.org/mailman >>> /listinfo.cgi/boost >>>

1 0

Re: [boost] Boost Digest, Vol 5363, Issue 1
by Vissarion Fisikopoulos 06 Mar '17

06 Mar '17

Hello, I proposed to mentor projects 1 & 3 of Boost.Geometry. As in Boost GSoC webpage you may choose to either provide links to existing library you developed or take a competency test. For the latter the test is the same for both projects 1 & 3, you can find it in https://svn.boost.org/trac/boost/wiki/SoC2017#Programmingcompetencytest2 Best, Vissarion > Date: Thu, 2 Mar 2017 15:41:39 +0530 > From: Shaunak Dixit <sdixit_be15(a)thapar.edu> > To: boost(a)lists.boost.org > Subject: Re: [boost] Regarding Mentor > Message-ID: > <CAAEsT1nYLwdmDnV5GNHuGAQH3DCejxx__AAtq+gak5EhKH1U3A(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > I would like to work on boost.geometry. > For given projects > > *PROJECT 1. Filtering of compare distance predicates.* > <https://svn.boost.org/trac/boost/wiki/SoC2017#PROJECT1.Filteringofcomparedi….> > > *PROJECT 3. Nearly antipodal points distance accuracy improvement.* > <https://svn.boost.org/trac/boost/wiki/SoC2017#PROJECT3.Nearlyantipodalpoint….> > > Please help me out how to start and in finding mentors for the above > projects. > > Thanks a lot > On 2 Mar 2017 15:18, "Shaunak Dixit" <sdixit_be15(a)thapar.edu> wrote: > >> Thanks a lot >> But I would like to work on geometry >> >> Thank you >> On 2 Mar 2017 14:49, "David Bellot via Boost" <boost(a)lists.boost.org> >> wrote: >> >>> you can find project with mentors and their email address on >>> https://svn.boost.org/trac/boost/wiki/SoC2017 >>> >>> I proposed to mentor for Boost.uBLAS (numerical computations). If you're >>> interested, please contact me. >>> >>> Cheers, >>> David >>> >>> On Wed, Mar 1, 2017 at 8:08 PM, Shaunak Dixit via Boost < >>> boost(a)lists.boost.org> wrote: >>> >>> > Hi I have joined the Boost Developer's mailing list >>> > please help me how to find a mentor. >>> > >>> > >>> > >>> > >>> > thanks you >>> > >>> > _______________________________________________ >>> > Unsubscribe & other changes: http://lists.boost.org/ >>> > mailman/listinfo.cgi/boost >>> > >>> >>> _______________________________________________ >>> Unsubscribe & other changes: http://lists.boost.org/mailman >>> /listinfo.cgi/boost >>>

1 0

[trac] SSL certificate revoked?
by Andrey Semashev 06 Mar '17

06 Mar '17

Hi, I'm getting an error while trying to open an existing Trac ticket: https://svn.boost.org/trac/boost/ticket/11798 Secure Connection Failed An error occurred during a connection to svn.boost.org. Peer’s Certificate has been revoked. Error code: SEC_ERROR_REVOKED_CERTIFICATE Is this a known problem? Firefox 51.0.1.

2 3

Re: [boost] [builds] broken
by Tom Kent 06 Mar '17

06 Mar '17

On Sun, Mar 5, 2017 at 11:43 AM, Rene Rivera <grafikrobot(a)gmail.com> wrote: > > On Sun, Mar 5, 2017 at 11:34 AM, Tom Kent <lists(a)teeks99.com> wrote: > >> >> On Sun, Mar 5, 2017 at 9:03 AM, Rene Rivera <grafikrobot(a)gmail.com> >> wrote: >> >>> On Sun, Mar 5, 2017 at 6:49 AM, Tom Kent via Boost < >>> boost(a)lists.boost.org> wrote: >>> >>>> On Thu, Mar 2, 2017 at 9:59 PM, Rene Rivera via Boost < >>>> boost(a)lists.boost.org >>>> > wrote: >>>> >>>> > On Thu, Mar 2, 2017 at 9:52 AM, Raffi Enficiaud via Boost < >>>> > boost(a)lists.boost.org> wrote: >>>> > >>>> > > Le 02/03/2017 à 16:25, Rene Rivera via Boost a écrit : >>>> > > >>>> > >> On Thu, Mar 2, 2017 at 9:22 AM, Raffi Enficiaud via Boost < >>>> > >> boost(a)lists.boost.org> wrote: >>>> > >> >>>> > >> Le 02/03/2017 à 16:20, Rene Rivera via Boost a écrit : >>>> > >>> >>>> > >>> On Wed, Mar 1, 2017 at 5:23 PM, Raffi Enficiaud via Boost < >>>> > >>>> boost(a)lists.boost.org> wrote: >>>> > >>>> >>>> > >>>> Hi all, >>>> > >>>> >>>> > >>>>> >>>> > >>>>> On develop, I have the following error for gcc/linux and >>>> clang/osx: >>>> > >>>>> >>>> > >>>>> 01-Mar-2017 23:58:05 libs/python/build/Jamfile:155: in >>>> > >>>>> lib_boost_numpy >>>> > >>>>> 01-Mar-2017 23:58:05 *** argument error >>>> > >>>>> 01-Mar-2017 23:58:05 * rule lib ( names + : sources * : >>>> > >>>>> requirements * >>>> > >>>>> : default-build * : usage-requirements * ) >>>> > >>>>> 01-Mar-2017 23:58:05 * called with: ( : numpy/dtype.cpp >>>> > >>>>> numpy/matrix.cpp >>>> > >>>>> >>>> > >>>>> >>>> > >>>> >>>> > >>>> How are you configuring python in your user-config.jam? >>>> > >>>> >>>> > >>>> >>>> > >>> I am not touching anything about user-config.jam: the failure >>>> happens >>>> > on >>>> > >>> a >>>> > >>> build machine (specific build user, supposedly clean). If there >>>> is a >>>> > >>> user-config.jam, then I do not know how it landed there :) >>>> > >>> >>>> > >> >>>> > >> >>>> > >> OK.. Which means that the version number for whatever python it >>>> picks up >>>> > >> is >>>> > >> undetermined and blank. I'll have to figure out why that is. >>>> > >> >>>> > > >>>> > > FYI: the Linux/OSX machines have the apt/OS python installed, and >>>> > > python3.4. >>>> > >>>> > >>>> > OK.. It turns out to have been a simple forgetting of some parens. >>>> Note >>>> > that bootstrap generates a project-config.jam file. So you do have >>>> one. You >>>> > just don't see what it is :-) But it does print out in the CI logs >>>> what it >>>> > detects as far as Python is concerned. Anyway.. It's fixed. And will >>>> be >>>> > reflected whenever stuff updates to latest develop. >>>> >>>> >>>> I think this is related, but not sure...all the regression runs I start >>>> (Linux + Windows) are currently failing with: >>>> >>>> boost-test(COMPILE) "python/select_holder" : >>>> "libs/python/test/select_holder.cpp" >>>> boost-test(RUN) "python/select_from_python_test" : >>>> "libs/python/test/select_from_python_test.cpp" "libs/python/src/conve >>>> rter/type_id.cpp" >>>> boost-test(COMPILE) "python/select_arg_to_python_test" : >>>> "libs/python/test/select_arg_to_python_test.cpp" >>>> boost-test(COMPILE_FAIL) "python/raw_pyobject_fail1" : >>>> "libs/python/test/raw_pyobject_fail1.cpp" >>>> boost-test(COMPILE_FAIL) "python/raw_pyobject_fail2" : >>>> "libs/python/test/raw_pyobject_fail2.cpp" >>>> boost-test(COMPILE_FAIL) "python/as_to_python_function" : >>>> "libs/python/test/as_to_python_function.cpp" >>>> boost-test(COMPILE_FAIL) "python/object_fail1" : >>>> "libs/python/test/object_fail1.cpp" >>>> error: at /var/boost/run/boost_bb/src/kernel/modules.jam:107 >>>> error: Unable to find file or target named >>>> error: '/boost/python//boost_numpy' >>>> error: referred to from project at >>>> error: '../libs/python/test' >>>> >>>> at the end of the results/bjam.log file. This was causing develop to >>>> fail >>>> for awhile, and now appears to have migrated to master as well. >>>> >>> >>> OK, I'm almost certain I fixed both develop and master for this now. >>> Thanks for reporting it. >>> >> >> Hmm, doesn't seem to have fixed it, still seeing the same error. >> > > Hm.. Is python configured on the runners? > Yeah, the specific runner I'm looking at at the moment has python, both 2 (2.7.6) and 3 (3.4.3, despite what the summary page says under the python versions): http://www.boost.org/development/tests/develop/developer/summary.html If you want to try that config yourself, you can get it from docker hub: teeks99/boost-build:gcc-6 I verified that it was getting the latest commit from develop: 6abf48add87c66a7b118d0bc5e24ae045ba6fbb0 Also, I noticed that there are two errors. The end of the output looks like: warning: toolset gcc initialization: can not find tool windres warning: initialized from /home/boost/user-config.jam:11 notice: using rc compiler :: <toolset>gcc-6~c++1z~warn :: /usr/bin/as notice: [python-cfg] Configuring python... notice: [python-cfg] user-specified version: "2.7" notice: [python-cfg] user-specified includes: "/usr/include/python2.7" notice: [python-cfg] user-specified libraries: "/usr/lib/x86_64-linux-gnu" notice: [python-cfg] Checking interpreter command "python2.7"... notice: [python-cfg] running command 'python2.7 -c "from sys import *; print('version=%d.%d\nplatform=%s\nprefix=%s\nexe c_prefix=%s\nexecutable=%s' % (version_info[0],version_info[1],platform,prefix,exec_prefix,executable))" 2>&1' notice: [python-cfg] ...requested configuration matched! notice: [python-cfg] Details of this Python configuration: notice: [python-cfg] interpreter command: "python2.7" notice: [python-cfg] include path: "/usr/include/python2.7" notice: [python-cfg] library path: "/usr/lib/x86_64-linux-gnu" notice: [python-cfg] Checking for NumPy... notice: [python-cfg] running command 'python2.7 -c "import sys; sys.stderr = sys.stdout; import numpy; print(numpy.get_i nclude())"' notice: [python-cfg] NumPy disabled. Reason: notice: [python-cfg] python2.7 -c "import sys; sys.stderr = sys.stdout; import numpy; print(numpy.get_include())" abor ted with notice: [python-cfg] Traceback (most recent call last): File "<string>", line 1, in <module> ImportError: No module named numpy notice: [python-cfg] Configuring python... notice: [python-cfg] user-specified version: "3.4" notice: [python-cfg] user-specified includes: "/usr/include/python3.4" notice: [python-cfg] user-specified libraries: "/usr/lib/x86_64-linux-gnu" notice: [python-cfg] Checking interpreter command "python3.4"... notice: [python-cfg] running command 'python3.4 -c "from sys import *; print('version=%d.%d\nplatform=%s\nprefix=%s\nexe c_prefix=%s\nexecutable=%s' % (version_info[0],version_info[1],platform,prefix,exec_prefix,executable))" 2>&1' notice: [python-cfg] ...requested configuration matched! notice: [python-cfg] Details of this Python configuration: notice: [python-cfg] interpreter command: "python3.4" notice: [python-cfg] include path: "/usr/include/python3.4" notice: [python-cfg] library path: "/usr/lib/x86_64-linux-gnu" notice: [python-cfg] Checking for NumPy... notice: [python-cfg] running command 'python3.4 -c "import sys; sys.stderr = sys.stdout; import numpy; print(numpy.get_i nclude())"' notice: [python-cfg] ...requested configuration matched! notice: [python-cfg] Details of this Python configuration: notice: [python-cfg] interpreter command: "python3.4" notice: [python-cfg] include path: "/usr/include/python3.4" notice: [python-cfg] library path: "/usr/lib/x86_64-linux-gnu" notice: [python-cfg] Checking for NumPy... notice: [python-cfg] running command 'python3.4 -c "import sys; sys.stderr = sys.stdout; import numpy; print(numpy.get_i nclude())"' notice: [python-cfg] NumPy disabled. Reason: notice: [python-cfg] python3.4 -c "import sys; sys.stderr = sys.stdout; import numpy; print(numpy.get_include())" abor ted with notice: [python-cfg] Traceback (most recent call last): File "<string>", line 1, in <module> ImportError: No module named 'numpy' notice: [zlib] Using pre-installed library notice: [zlib] Condition notice: [bzip2] Using pre-installed library notice: [bzip2] Condition Performing configuration checks - 32-bit : no - 64-bit : yes - arm : no - mips1 : no - power : no - sparc : no - x86 : yes - symlinks supported : yes ...found 1067 targets... # Starting tests ("/var/boost/run/boost_bb/src/engine/bin.linuxx86_64/b2" "-sBOOST_BUILD_PATH=/var/boost/run:/var/boost/ run/boost_bb/src" "-sBOOST_ROOT=/var/boost/run/boost_root" "--boost=/var/boost/run/boost_root" "--boost-root=/var/boost/ run/boost_root" "--boost-build=/var/boost/run/boost_bb/src" "--debug-configuration" -l300 toolset=gcc-6~c++1z -d2 prese rve-test-targets=off --dump-tests -j8 address-model=64 --remove-test-targets -m64 "--build-dir=/var/boost/run/results" > >"/var/boost/run/results/bjam.log" 2>&1)... # Running Boost.Build tests Traceback (most recent call last): File "run.py", line 71, in <module> runner(root) File "/var/boost/run/boost_regression_src/regression.py", line 287, in __init__ self.main() File "/var/boost/run/boost_regression_src/regression.py", line 624, in main getattr(self,action_m)() File "/var/boost/run/boost_regression_src/regression.py", line 589, in command_regression self.command_test() File "/var/boost/run/boost_regression_src/regression.py", line 368, in command_test self.command_test_boost_build() File "/var/boost/run/boost_regression_src/regression.py", line 410, in command_test_boost_build "boost/bin.v2/libs/any/test/any_test.test")); OSError: [Errno 2] No such file or directory: '/var/boost/run/results/boost/bin.v2/libs/any/test/any_test.test' While the end of the results/bjam.log is: boost-test(RUN) "ptr_container/const_element_containers" : "libs/ptr_container/test/const_element_containers.cpp" boost-test(RUN_PYD) "ptr_container/__boost_check_library__" : "status/boost_check_library.py" boost-test(RUN) "python/exec" : "libs/python/test/exec.cpp" boost-test(RUN) "python/exec-dynamic" : "libs/python/test/exec.cpp" boost-test(RUN_PYD) "python/crossmod_exception" : "libs/python/test/crossmod_exception.py" "libs/python/test/crossmod_ex ception_a.cpp" "libs/python/test/crossmod_exception_b.cpp" boost-test(RUN_PYD) "python/injected" : "libs/python/test/injected.py" "libs/python/test/injected.cpp" boost-test(RUN_PYD) "python/properties" : "libs/python/test/properties.py" "libs/python/test/properties.cpp" boost-test(RUN_PYD) "python/return_arg" : "libs/python/test/return_arg.py" "libs/python/test/return_arg.cpp" boost-test(RUN_PYD) "python/staticmethod" : "libs/python/test/staticmethod.py" "libs/python/test/staticmethod.cpp" boost-test(RUN_PYD) "python/boost_shared_ptr" : "libs/python/test/boost_shared_ptr.py" "libs/python/test/boost_shared_pt r.cpp" boost-test(RUN_PYD) "python/shared_ptr" : "libs/python/test/shared_ptr.py" "libs/python/test/shared_ptr.cpp" boost-test(RUN_PYD) "python/enable_shared_from_this" : "libs/python/test/enable_shared_from_this.py" "libs/python/test/e nable_shared_from_this.cpp" boost-test(RUN_PYD) "python/andreas_beyer" : "libs/python/test/andreas_beyer.py" "libs/python/test/andreas_beyer.cpp" boost-test(RUN_PYD) "python/wrapper_held_type" : "libs/python/test/wrapper_held_type.py" "libs/python/test/wrapper_held_ type.cpp" boost-test(RUN_PYD) "python/polymorphism2_auto_ptr" : "libs/python/test/polymorphism2_auto_ptr.py" "libs/python/test/pol ymorphism2.py" "libs/python/test/polymorphism2_auto_ptr.cpp" boost-test(RUN_PYD) "python/polymorphism" : "libs/python/test/polymorphism.py" "libs/python/test/polymorphism.cpp" boost-test(RUN_PYD) "python/polymorphism2" : "libs/python/test/polymorphism2.py" "libs/python/test/polymorphism2.cpp" boost-test(RUN_PYD) "python/auto_ptr" : "libs/python/test/auto_ptr.py" "libs/python/test/auto_ptr.cpp" boost-test(RUN_PYD) "python/minimal" : "libs/python/test/minimal.py" "libs/python/test/minimal.cpp" boost-test(RUN_PYD) "python/args" : "libs/python/test/args.py" "libs/python/test/args.cpp" boost-test(RUN_PYD) "python/raw_ctor" : "libs/python/test/raw_ctor.py" "libs/python/test/raw_ctor.cpp" boost-test(RUN_PYD) "python/enum" : "libs/python/test/test_enum.py" "libs/python/test/enum_ext.cpp" boost-test(RUN_PYD) "python/exception_translator" : "libs/python/test/exception_translator.py" "libs/python/test/excepti on_translator.cpp" boost-test(RUN_PYD) "python/pearu1" : "libs/python/test/test_cltree.py" "libs/python/test/cltree.cpp" boost-test(RUN_PYD) "python/try" : "libs/python/test/newtest.py" "libs/python/test/m1.cpp" "libs/python/test/m2.cpp" boost-test(RUN_PYD) "python/const_argument" : "libs/python/test/const_argument.py" "libs/python/test/const_argument.cpp" boost-test(RUN_PYD) "python/keywords" : "libs/python/test/keywords.cpp" "libs/python/test/keywords_test.py" boost-test(RUN_PYD) "python/builtin_converters" : "libs/python/test/test_builtin_converters.py" boost-test(RUN_PYD) "python/test_pointer_adoption" : "libs/python/test/test_pointer_adoption.py" "libs/python/test/test_ pointer_adoption.cpp" boost-test(RUN_PYD) "python/operators" : "libs/python/test/operators.py" "libs/python/test/operators.cpp" boost-test(RUN_PYD) "python/operators_wrapper" : "libs/python/test/operators_wrapper.py" "libs/python/test/operators_wra pper.cpp" boost-test(RUN_PYD) "python/callbacks" : "libs/python/test/callbacks.py" "libs/python/test/callbacks.cpp" boost-test(RUN_PYD) "python/defaults" : "libs/python/test/defaults.py" "libs/python/test/defaults.cpp" boost-test(RUN_PYD) "python/object" : "libs/python/test/object.py" "libs/python/test/object.cpp" boost-test(RUN_PYD) "python/class" : "libs/python/test/class.py" "libs/python/test/class.cpp" boost-test(RUN_PYD) "python/list" : "libs/python/test/list.py" "libs/python/test/list.cpp" boost-test(RUN_PYD) "python/long" : "libs/python/test/long.py" "libs/python/test/long.cpp" boost-test(RUN_PYD) "python/dict" : "libs/python/test/dict.py" "libs/python/test/dict.cpp" boost-test(RUN_PYD) "python/tuple" : "libs/python/test/tuple.py" "libs/python/test/tuple.cpp" boost-test(RUN_PYD) "python/str" : "libs/python/test/str.py" "libs/python/test/str.cpp" boost-test(RUN_PYD) "python/slice" : "libs/python/test/slice.py" "libs/python/test/slice.cpp" boost-test(RUN_PYD) "python/virtual_functions" : "libs/python/test/virtual_functions.py" "libs/python/test/virtual_funct ions.cpp" boost-test(RUN_PYD) "python/back_reference" : "libs/python/test/back_reference.py" "libs/python/test/back_reference.cpp" boost-test(RUN_PYD) "python/implicit" : "libs/python/test/implicit.py" "libs/python/test/implicit.cpp" boost-test(RUN_PYD) "python/data_members" : "libs/python/test/data_members.py" "libs/python/test/data_members.cpp" boost-test(RUN_PYD) "python/ben_scott1" : "libs/python/test/ben_scott1.py" "libs/python/test/ben_scott1.cpp" boost-test(RUN_PYD) "python/bienstman1" : "libs/python/test/bienstman1.py" "libs/python/test/bienstman1.cpp" boost-test(RUN_PYD) "python/bienstman2" : "libs/python/test/bienstman2.py" "libs/python/test/bienstman2.cpp" boost-test(RUN_PYD) "python/bienstman3" : "libs/python/test/bienstman3.py" "libs/python/test/bienstman3.cpp" boost-test(RUN_PYD) "python/multi_arg_constructor" : "libs/python/test/multi_arg_constructor.py" "libs/python/test/multi _arg_constructor.cpp" oost-test(RUN_PYD) "python/iterator" : "libs/python/test/iterator.py" "libs/python/test/iterator.cpp" "libs/python/test /input_iterator.cpp" boost-test(RUN_PYD) "python/stl_iterator" : "libs/python/test/stl_iterator.py" "libs/python/test/stl_iterator.cpp" boost-test(RUN_PYD) "python/extract" : "libs/python/test/extract.py" "libs/python/test/extract.cpp" boost-test(RUN_PYD) "python/crossmod_opaque" : "libs/python/test/crossmod_opaque.py" "libs/python/test/crossmod_opaque_a .cpp" "libs/python/test/crossmod_opaque_b.cpp" boost-test(RUN_PYD) "python/opaque" : "libs/python/test/opaque.py" "libs/python/test/opaque.cpp" boost-test(RUN_PYD) "python/voidptr" : "libs/python/test/voidptr.py" "libs/python/test/voidptr.cpp" boost-test(RUN_PYD) "python/pickle1" : "libs/python/test/pickle1.py" "libs/python/test/pickle1.cpp" boost-test(RUN_PYD) "python/pickle2" : "libs/python/test/pickle2.py" "libs/python/test/pickle2.cpp" boost-test(RUN_PYD) "python/pickle3" : "libs/python/test/pickle3.py" "libs/python/test/pickle3.cpp" boost-test(RUN_PYD) "python/pickle4" : "libs/python/test/pickle4.py" "libs/python/test/pickle4.cpp" boost-test(RUN_PYD) "python/nested" : "libs/python/test/nested.py" "libs/python/test/nested.cpp" boost-test(RUN_PYD) "python/docstring" : "libs/python/test/docstring.py" "libs/python/test/docstring.cpp" boost-test(RUN_PYD) "python/pytype_function" : "libs/python/test/pytype_function.py" "libs/python/test/pytype_function.c pp" boost-test(RUN_PYD) "python/vector_indexing_suite" : "libs/python/test/vector_indexing_suite.py" "libs/python/test/vecto r_indexing_suite.cpp" boost-test(RUN_PYD) "python/pointer_vector" : "libs/python/test/pointer_vector.py" "libs/python/test/pointer_vector.cpp" boost-test(RUN_PYD) "python/map_indexing_suite" : "libs/python/test/map_indexing_suite.py" boost-test(RUN) "python/import_" : "libs/python/test/import_.cpp" boost-test(RUN_PYD) "python/calling_conventions" : "libs/python/test/calling_conventions.py" "libs/python/test/calling_c onventions.cpp" boost-test(RUN_PYD) "python/calling_conventions_mf" : "libs/python/test/calling_conventions_mf.py" "libs/python/test/cal ling_conventions_mf.cpp" boost-test(COMPILE) "python/indirect_traits_test" : "libs/python/test/indirect_traits_test.cpp" boost-test(RUN) "python/destroy_test" : "libs/python/test/destroy_test.cpp" boost-test(RUN) "python/pointer_type_id_test" : "libs/python/test/pointer_type_id_test.cpp" boost-test(RUN) "python/bases" : "libs/python/test/bases.cpp" boost-test(RUN) "python/if_else" : "libs/python/test/if_else.cpp" boost-test(RUN) "python/pointee" : "libs/python/test/pointee.cpp" boost-test(RUN) "python/result" : "libs/python/test/result.cpp" boost-test(COMPILE) "python/string_literal" : "libs/python/test/string_literal.cpp" boost-test(COMPILE) "python/borrowed" : "libs/python/test/borrowed.cpp" boost-test(COMPILE) "python/object_manager" : "libs/python/test/object_manager.cpp" boost-test(COMPILE) "python/copy_ctor_mutates_rhs" : "libs/python/test/copy_ctor_mutates_rhs.cpp" boost-test(RUN) "python/upcast" : "libs/python/test/upcast.cpp" boost-test(COMPILE) "python/select_holder" : "libs/python/test/select_holder.cpp" boost-test(RUN) "python/select_from_python_test" : "libs/python/test/select_from_python_test.cpp" "libs/python/src/conve rter/type_id.cpp" boost-test(COMPILE) "python/select_arg_to_python_test" : "libs/python/test/select_arg_to_python_test.cpp" boost-test(COMPILE_FAIL) "python/raw_pyobject_fail1" : "libs/python/test/raw_pyobject_fail1.cpp" boost-test(COMPILE_FAIL) "python/raw_pyobject_fail2" : "libs/python/test/raw_pyobject_fail2.cpp" boost-test(COMPILE_FAIL) "python/as_to_python_function" : "libs/python/test/as_to_python_function.cpp" boost-test(COMPILE_FAIL) "python/object_fail1" : "libs/python/test/object_fail1.cpp" error: at /var/boost/run/boost_bb/src/kernel/modules.jam:107 error: Unable to find file or target named error: '/boost/python//boost_numpy' error: referred to from project at error: '../libs/python/test' Hope that helps, Tom

4 8

[gsoc17]Getting interests in uBLAS
by Ruoyun Jing 06 Mar '17

06 Mar '17

Hi, I am Ruoyun, I'm back again.:) In these few days, I'm getting start with boost by [link](https://github.com/boostorg/boost/wiki/Getting-Started), and got something wrong with developing/checking out a particular branch that in Ubuntu, I can not find the file called"modular-boost",but when I tried to "cd libs/geometry",it went run. When I tried to contact the devs of geometry in gitter, IRC, and email, there is only a reply for me. So I'm pretty interested in math about any aspects, because during my life of algorithm competition, I was good at algorithms in geometry, number theory, linear algebra and etc. I am really want to contact with mentor more frequently to learn more knowledge and provide more contributions to boost. I'm also interested in uBLAS and willing to learn knowledge about that !!! Looking forward from you! Thanks. Ruoyun Jing -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

4 4

Insanely slow download speeds from SourceForge
by Louis Dionne 06 Mar '17

06 Mar '17

I've been getting very slow downloads of Boost from SourceForge during my Travis builds for the past week or so. It goes as low as 40K/s: Resolving downloads.sourceforge.net (downloads.sourceforge.net) 216.34.181.59 Connecting to downloads.sourceforge.net (downloads.sourceforge.net)|216.34.181.59|:443... connected. HTTP request sent, awaiting response... 302 Found Location: https://svwh.dl.sourceforge.net/project/boost/boost/1.63.0/boost_1_63_0.tar… [following] --2017-03-05 21:08:35-- https://svwh.dl.sourceforge.net/project/boost/boost/1.63.0/boost_1_63_0.tar… Resolving svwh.dl.sourceforge.net (svwh.dl.sourceforge.net) 72.5.72.15, 2606:c680:0:b:3830:34ff:fe66:6663 Connecting to svwh.dl.sourceforge.net (svwh.dl.sourceforge.net)|72.5.72.15|:443... connected. HTTP request sent, awaiting response... 200 OK Length: 81984414 (78M) [application/octet-stream] Saving to: `STDOUT' 33% [============> ] 27,795,206 40.4K/s eta 21m 34s Is anyone else having the same issue? It's causing many of my builds to time out. Louis -- View this message in context: http://boost.2283326.n4.nabble.com/Insanely-slow-download-speeds-from-Sourc… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 2

[safe_numerics] The review is ongoing
by Andrzej Krzemienski 06 Mar '17

06 Mar '17

Hi Everyone, This is to remind you about the ongoing review of safe_numerics library by Robert Ramey. The review will run till March 11th. Even if you find the format of the full review too demanding, a partial review, or simply your perception of whether the library should be given a place in Boost, will be of value, and may have an impact on the final decision. safe_numerics is a set of drop-in replacements for the built-in integer types, which make the guarantee that the results of operations are either correct according to the rules of integer arithmetic or report a diagnosable error (rather than offering modulo arithmetic results, or resulting in undefined behavior, or returning incorrect results as in the case of signed vs. unsigned comparisons). The library can be found on GitHub: https://github.com/robertramey/safe_numerics/ Online docs: http://htmlpreview.github.io/?https://github.com/robertramey /safe_numerics/master/doc/html/index.html Formal Review comments can be posted publicly on the mailing list or Boost Library Incubator <http://blincubator.com>, or sent privately to the review manager, that is myself. Here are some 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? And most importantly: Do you think the library should be accepted as a Boost library? For more information about Boost Formal Review Process, see: http://www.boost.org/community/reviews.html Your review is needed!

1 0

[metal] Feature Complete - Request for Feedback
by Bruno Dutra 05 Mar '17

05 Mar '17

Dear community, As some of you might be aware through sporadic discussions on this mailing list throughout the last couple of years, I've been working for quite a while on a modern template metaprogramming library called Metal, that I advocate as a direct replacement for the aging Boost.MPL. I believe my work is finally complete now and so I come to you to request for feedback and ask whether you think that Metal would be a valuable addition to the Boost distribution. My intention is to request a formal review in the next days / weeks, depending on your preliminary feedback. In a glimpse, Metal is a pure template metaprogramming that explores all modern features available to C++14 to overcome the limitations of Boost.MPL, most notably: * vastly improved performance [1]; * terser syntax [2]. Repository: https://github.com/brunocodutra/metal Documentation: http://brunocodutra.github.io/metal/ Boost Incubator: http://blincubator.com/bi_library/metal-2/?gform_post_id=1566 I appreciate your feedback and opinion on whether Metal is a good fit for Boost! - Previous discussions About a year ago I came to this list to discuss a proposal of merging Metal into MPL as a new API built from ground up, while at the same time serving as a backend for the previous API on modern compilers. At that time, Metal was lazy and very similar to MPL, but since then it underwent great simplification and embraced the all-eager design, so I don't think this would be a good idea anymore. Besides, it soon became clear that this would be a huge undertaking with potential to inadvertently breaking a lot of good code to little gain, so I decided instead to tackle the problem migration from MPL by providing a handy adaptor [3]. [1]: http://metaben.ch/ [2]: http://brunocodutra.github.io/metal/index.html#in_a_glimpse [3]: http://brunocodutra.github.io/metal/group__external.html#gaede6847ad3e0bb64… Regards, Bruno Dutra

13 35

[builds] broken
by Raffi Enficiaud 05 Mar '17

05 Mar '17

Hi all, On develop, I have the following error for gcc/linux and clang/osx: 01-Mar-2017 23:58:05 libs/python/build/Jamfile:155: in lib_boost_numpy 01-Mar-2017 23:58:05 *** argument error 01-Mar-2017 23:58:05 * rule lib ( names + : sources * : requirements * : default-build * : usage-requirements * ) 01-Mar-2017 23:58:05 * called with: ( : numpy/dtype.cpp numpy/matrix.cpp numpy/ndarray.cpp numpy/numpy.cpp numpy/scalars.cpp numpy/ufunc.cpp : <link>static:<define>BOOST_NUMPY_STATIC_LIB <define>BOOST_NUMPY_SOURCE <library>/python//python_for_extensions <include>/System/Library/Frameworks/Python.framework/Versions/2.7/Extras/lib/python/numpy/core/include <library>boost_python <python-debugging>on:<define>BOOST_DEBUG_PYTHON <python>2.7 -<tag>@Jamfile</Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library>%Jamfile</Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library>.tag <tag>@Jamfile</Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library>%Jamfile</Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library>.python-tag <conditional>@python.require-py : <link>shared : <link>static:<define>BOOST_NUMPY_STATIC_LIB <python-debugging>on:<define>BOOST_DEBUG_PYTHON ) 01-Mar-2017 23:58:05 * missing argument names 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/tools/builtin.jam:506:see definition of rule 'lib' being called 01-Mar-2017 23:58:05 libs/python/build/Jamfile:168: in modules.load 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build/project.jam:325: in load-jamfile 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build/project.jam:64: in load 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build/project.jam:89: in load-used-projects 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build/project.jam:75: in load 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build/project.jam:145: in project.find 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build-system.jam:535: in load 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/kernel/modules.jam:295: in import 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/kernel/bootstrap.jam:139: in boost-build 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/boost-build.jam:17: in module scope 01-Mar-2017 23:58:05 Failing task since return code of [/bin/sh /Users/bambooagent/bamboo-agent-home/temp/SW-BCB108-O1C-3-ScriptBuildTask-4580193904098485274.sh] was 1 while expected 0 Best, Raffi

5 9

[heap] tests failing
by Raffi Enficiaud 05 Mar '17

05 Mar '17

Hi, The latest commit (1c061c9) on boost.heap has failing tests. The previous commit (7aa8f90) works fine. Raffi PS: I am using boost.heap as one of the boost.test checks.

2 1

[outcome] Tutorial third rewrite finished (I hope)
by Niall Douglas 05 Mar '17

05 Mar '17

I know the Safe Numerics review is currently happening and almost straight thereafter comes the final Stacktrace review so people are probably a bit tired of reviewing stuff, however I believe the third rewrite of the Outcome tutorial is now finished at long last. Expected<T, E> in Context: https://ned14.github.io/boost.outcome/md_doc_md_02-tutorial_a.html Expected<T, E> in Practice: https://ned14.github.io/boost.outcome/md_doc_md_03-tutorial_b.html Refining Expected<T, E>: https://ned14.github.io/boost.outcome/md_doc_md_04-tutorial_c.html Feedback is once again very welcome, indeed this tutorial looks so very different from the previous two editions because of your feedback, so thank you. In case anyone is interested, the biggest showstopper remaining before this goes into the Boost review queue is the reference docs: doxygen chokes badly on the preprocessor metaprogramming Outcome uses and generate rubbish docs. I didn't find much success with Standardese or Doxypress either, so I'm currently working with my shiny new Python C99 conforming preprocessor (https://github.com/ned14/pcpp) to partially preprocess Outcome into a form doxygen can cope with. I expect a few weeks remain on that, it may pass most of the C11 preprocessor torture test suite but the partial preprocessor pass through implementation has bugs I'm still nailing down :) Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

1 1

[gsoc17]Getting started with Project 2 in Boost.Geometry : R-tree serialization
by Jing Rylynnn 05 Mar '17

05 Mar '17

Hi Everyone: My name is Ruoyun Jing, I am an undergraduate student in Northwest University(China) of Software Engineering.Although i am a girl,i really love coding and algorithms!!! I've coded many algorithms problems with C++ and Python,and got Bronze Metal in ACMICPC Asia Shenyang Regional contest. GSoC is really a precious chance for me to get in touch with open source software. After reading all the organizatuions and their projects, I'm pretty interested in R-tree serialization. Despite my lack of project experience,i will try my best to learn ,code and communicate with mentor!!! Looking forward from you.:) Thank. -- Northwest University of China Software Engineering jingry0321(a)gmail.com

1 0

Re: [boost] [MPL][vector] Is there interest in mpl::vector using variadic templates?
by Bruno Dutra 04 Mar '17

04 Mar '17

On Mar 3, 2017 17:58, "Peter Dimov via Boost" <boost(a)lists.boost.org> wrote: Bruno Dutra wrote: OTOH the void* trick requires that a pack of M void pointers be > instantiated when the element at position M is retrieved from a list, so, > for a list of N elements, the compiler must instantiate N *distinct* packs > of void pointers, because each of these packs have a different size and is > thus a distinct type. > Not just that, but the helper function that is required to obtain the Mth element is a template instantiation as well. Saying that we shouldn't use map_from_list because it consumes memory for the instantiation is misleading; the alternatives consume memory for instantiations as well. Except for __type_pack_element, of course. Right, the trick is usually to figure out what consumes less memory, i.e. what leads to the least amount of distinct template instantiations. Alias templates help a lot with that, since they are not actually instantiated, but there is only so much one can do with alias templates alone. Bruno

2 1

test message
by Michael Caisse 04 Mar '17

04 Mar '17

-- Michael Caisse Ciere Consulting ciere.com

1 0

[gsoc17]Some problems Project 2 in Boost.Geometry : R-tree serialization
by Ruoyun Jing 04 Mar '17

04 Mar '17

Hi ! I'm Ruoyun Jing,and I'm back.:) I have many problems about these projects. And I begin to configure the development environment of these project, and decided to fix some issue about Boost.Geometry. It will be many problems to ask, how could i communicate with mentor more quickly? I join in the gitter of Boostorg/geometry,but there might not be very active, could you please tell me how to get in touch with devs more convenient? Looking forward from you.:) Thanks. -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

1 0

cross-compilation: building boost on linux targetting osx
by Frédéric Bron 04 Mar '17

04 Mar '17

Hi, I am trying to cross-build boost on linux targetting osx. I am using a cross compiler based on the linux clang 3.8.1 (osxcross). You can find below the process I use to build boost. My problem is that apparently b2 cannot find iconv, zlib and bzip2. Also apprently it says that clang does not support C++11 features (which is not true): - Boost.Config Feature Check: cxx11_auto_declarations : no - Boost.Config Feature Check: cxx11_constexpr : no - Boost.Config Feature Check: cxx11_defaulted_functions : no - Boost.Config Feature Check: cxx11_final : no - Boost.Config Feature Check: cxx11_hdr_mutex : no - Boost.Config Feature Check: cxx11_hdr_tuple : no - Boost.Config Feature Check: cxx11_lambdas : no - Boost.Config Feature Check: cxx11_noexcept : no - Boost.Config Feature Check: cxx11_nullptr : no - Boost.Config Feature Check: cxx11_rvalue_references : no - Boost.Config Feature Check: cxx11_template_aliases : no - Boost.Config Feature Check: cxx11_thread_local : no - Boost.Config Feature Check: cxx11_variadic_templates : no - zlib : no - bzip2 : no - iconv (libc) : no - iconv (separate) : no - Boost.Locale needs either iconv or ICU library to be built. I identified potential issues: 1. I give toolset clang to bootstrap.sh which sets the toolset to clang in project-config.jam but clang-linux is used: common.mkdir bin.v2/libs/system/build/clang-linux-3.8.1/release Should it be clang-darwin instead? However, if I set it myself to clang-darwin with bootstrap.sh, it says that clang-darwin toolset does not exist. By the way, there is nothing about clang in getting started: http://www.boost.org/doc/libs/1_63_0/more/getting_started/unix-variants.html 2. when looking for the iconv library (same issue with zlib and bzip2), there are unknown linker options (--start-group or -R) and the iconv library path I gave to b2 is not given to the compiler/linker. Here is part of the output in config.log: clang-linux.compile.c++.without-pth bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_obj.o "x86_64-apple-darwin13-clang++-libc++" -c -x c++ -std=c++14 -O2 -DNDEBUG -O0 -g -fno-inline -Wall -g -fPIC -m64 -DBOOST_ALL_NO_LIB=1 -DBOOST_LOG_WITHOUT_EVENT_LOG -DBOOST_THREAD_USE_LIB -I"." -o "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_obj.o" "libs/locale/src/../build/has_iconv.cpp" "x86_64-apple-darwin13-clang++-libc++" -o "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv" -Wl,--start-group "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_obj.o" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g -m64~ ld: unknown option: --start-group clang-linux.compile.c++.without-pth bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_ext.o "x86_64-apple-darwin13-clang++-libc++" -c -x c++ -std=c++14 -O2 -DNDEBUG -O0 -g -fno-inline -Wall -g -fPIC -m64 -DBOOST_ALL_NO_LIB=1 -DBOOST_LOG_WITHOUT_EVENT_LOG -DBOOST_THREAD_USE_LIB -I"." -I"/softs/osx64-clang-3.8.1/release/iconv/include" -o "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_ext.o" "libs/locale/src/../build/has_iconv.cpp" "x86_64-apple-darwin13-clang++-libc++" -L"/softs/osx64-clang-3.8.1/release/iconv/lib" -Wl,-R -Wl,"/softs/osx64-clang-3.8.1/release/iconv/lib" -Wl,-rpath-link -Wl,"/softs/osx64-clang-3.8.1/release/iconv/lib" -o "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_external_iconv" -Wl,--start-group "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_ext.o" -Wl,-Bstatic -Wl,-Bdynamic -liconv -Wl,--end-group -g -m64~ ld: unknown option: -R Any idea? Frédéric Currently, I am using the following commands to build boost: CC="x86_64-apple-darwin13-clang" CFLAGS="-O2 -DNDEBUG" CXX="x86_64-apple-darwin13-clang++-libc++" CXXFLAGS="-O2 -DNDEBUG -std=c++14" CPPFLAGS="-I/softs/osx64-clang-3.8.1/release/iconv/include -I/softs/osx64-clang-3.8.1/release/bzip2/include -I/softs/osx64-clang-3.8.1/release/zlib/include" LDFLAGS="-L/softs/osx64-clang-3.8.1/release/iconv/lib -L/softs/osx64-clang-3.8.1/release/bzip2/lib -L/softs/osx64-clang-3.8.1/release/zlib/lib" AR="x86_64-apple-darwin13-ar" AS="x86_64-apple-darwin13-as" RANLIB="x86_64-apple-darwin13-ranlib" ./bootstrap.sh --without-icu --prefix=/softs/osx64-clang-3.8.1/release/boost --with-toolset=clang then I write a user-config.jam: using clang : : x86_64-apple-darwin13-clang++-libc++ : <cxxflags>-std=c++14 <cxxflags>-O2 <cxxflags>-DNDEBUG <archiver>x86_64-apple-darwin13-ar <ranlib>x86_64-apple-darwin13-ranlib ; and run b2: CC="x86_64-apple-darwin13-clang" CFLAGS="-O2 -DNDEBUG" CXX="x86_64-apple-darwin13-clang++-libc++" CXXFLAGS="-O2 -DNDEBUG -std=c++14" CPPFLAGS="-I/softs/osx64-clang-3.8.1/release/iconv/include -I/softs/osx64-clang-3.8.1/release/bzip2/include -I/softs/osx64-clang-3.8.1/release/zlib/include" LDFLAGS="-L/softs/osx64-clang-3.8.1/release/iconv/lib -L/softs/osx64-clang-3.8.1/release/bzip2/lib -L/softs/osx64-clang-3.8.1/release/zlib/lib" AR="x86_64-apple-darwin13-ar" AS="x86_64-apple-darwin13-as" RANLIB="x86_64-apple-darwin13-ranlib" ./b2 -d2 -j8 boost.locale.iconv=on boost.locale.icu=off boost.locale.std=off -sICONV_PATH=/softs/osx64-clang-3.8.1/release/iconv -sBZIP2_INCLUDE=/softs/osx64-clang-3.8.1/release/bzip2/include -sBZIP2_LIBPATH=/softs/osx64-clang-3.8.1/release/bzip2/lib -sZLIB_INCLUDE=/softs/osx64-clang-3.8.1/release/zlib/include -sZLIB_LIBPATH=/softs/osx64-clang-3.8.1/release/zlib/lib --layout=system --user-config=user-config.jam --without-mpi --without-python --without-context --without-coroutine link=static threading=multi runtime-link=shared target-os=darwin threadapi=pthread address-model=64 define=BOOST_THREAD_USE_LIB define=BOOST_LOG_WITHOUT_EVENT_LOG variant=release install

2 2

[nowide] Library Updates
by Artyom Beilis 04 Mar '17

04 Mar '17

Hello, Disclaimer: --------------- I recently discovered that virtually all e-mails sent from Yahoo account to any mailing lists go to user's spam due to recent Yahoo's DMARC policy. So I'm sending some important stuff from GMail account that almost certainly was missed: What is Boost.Nowide: -------------------------------- Boost.Nowide is a library that make cross platform Unicode aware programming easier. The library 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. It was inspiration and inspired by http://utf8everywhere.org/ development ideas and policy. Some updates regarding Boost.Nowide ------------------------------- 1. Library moved to github and its format is converted to modular boost layout: https://github.com/artyom-beilis/nowide 2. Fixed unsupported std::ios::ate flag by boost::nowide::fstream 3. Added some C++11 interfaces to boost::nowide::fstream 4. Added integration functionality with boost::filesystem: https://github.com/artyom-beilis/nowide/blob/master/include/boost/nowide/in… Note: that the links to the source code on review schedule aren't relevant, it should be: - Code: https://github.com/artyom-beilis/nowide - Documentation: http://cppcms.com/files/nowide/html/ Also the library is still looking for review manager. Artyom Beilis P.S.: I'm sorry if you are getting this as "duplicate"

2 1

[Boost-users] Unbounded integers and shared memory
by Antony Polukhin 04 Mar '17

04 Mar '17

Hello, One of the ISO WG21 C++ Study Groups is investigating the usecases of shared memory usage with wide arithmetics (Boost.Interprocess, Boost.Multiprecision, in-house solutions?). Particularly interesting: * Are there users that store unbounded numbers in shared memory? * Will bounded integers satisfy need of those users? Informal glossary: * "unbounded numbers" - numbers (integral, relational, floating point and others) that can store and operate on any huge value by dynamically allocating memory as necessary to maintain a representation of operation results. * "bounded types" - Numbers (integral, relational, floating point and others) which bounds are specified in number of bytes/bits/words at compile time and that do not allocate memory. Please, response if you are one of such users. Great thanks in advance! -- Best regards, Antony Polukhin

1 0

[gsoc17]Getting started with Project 2 in Boost.Geometry : R-tree serialization and Project 1:static map
by Ruoyun Jing 03 Mar '17

03 Mar '17

Hi Everyone: My name is Ruoyun Jing, I am an undergraduate student in Northwest University(China) of Software Engineering.Although i am a girl,i really love coding and algorithms!!! I've coded many algorithms problems with C++ and Python,and got Bronze Metal in ACMICPC Asia Shenyang Regional contest. GSoC is really a precious chance for me to get in touch with open source software. After reading all the organizatuions and their projects, I'm pretty interested in R-tree serialization and static map. Despite my lack of project experience,i will try my best to learn ,code and communicate with mentor!!! Looking forward from you.:) Thank -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

1 0

[MPL][vector] Is there interest in mpl::vector using variadic templates?
by Михаил Максимов 03 Mar '17

03 Mar '17

Dear community, I've recently started contributing to boost::variant. To speed up variant's compilation I'm implementing mpl::vector on variadic templates. For now status of new vector implementation is: 1) it passes all mpl/test tests on gcc 4.9 and 6.3 2) it is decoupled from mpl::vectorN, simultaneously making mpl::vectorN visible, so libs like Boost.Geometry, which rely on mpl::vectorN compile nicely 3) There are several compilation errors during full build on gcc 4.9 and 6.3 4) I fix problems on mpl/tests stage for clang 3.4 and latest MSVS2017 compiler Bruno's introduction of new shiny Metal library and Sergey's comment in the same thread: > The biggest and most useful feature of "new" TMP libraries is variadic > templates that increase performance by a really huge factor. The problem > with MPL is that vector type sequence must derive from vectorN-s, which are > documented and can be used in template specialization. So it is impossible > or pointless to remplement mpl::vector in terms of variadic parameters > because of that. The other problem that I can quickly recall is recursive > iterator-based approach, which also kills performance. made me wonder, is there interest in variadic templates implementation? Are there limitations for it's usefulness, which I did not see? Regards, Mike Maximov

7 14

Review Request: poly_collection
by Joaquin M López Muñoz 03 Mar '17

03 Mar '17

Hello, I'd like to ask for formal review of (candidate) Boost.PolyCollection, a library providing fast containers of polymorphic objects: https://github.com/joaquintides/poly_collection http://blincubator.com/bi_library/polycollection/?gform_post_id=1643 http://rawgit.com/joaquintides/poly_collection/website/doc/html/index.html Typically, polymorphic objects cannot be stored directly in regular containers and need be accessed through an indirection pointer, which introduces performance problems related to CPU caching and branch prediction. Boost.PolyCollection implements a novel data structure that is able to contiguously store polymorphic objects without such indirection, thus providing a value-semantics user interface and better performance. Three polymorphic collections are provided: * boost::base_collection * boost::function_collection * boost::any_collection dealing respectively with classic base/derived or OOP polymorphism, function wrapping in the spirit of std::function and so-called duck typing as implemented by Boost.TypeErasure. The library compiles and runs succesfully in Visual Studio 2015, GCC 5.2.1 and Clang 3.7. Ion Gaztañaga has kindly volunteered to act as the review manager for (candidate) Boost.PolyCollection. Best regards, Joaquín M López Muñoz

3 6

[GSoC 17] Getting started with Project Idea 1 : Static Map
by Govind Sahai 02 Mar '17

02 Mar '17

Hi to all, I am Govind Sahai student at Indian Institute of Technology BHU Varanasi, India. I would like to work on 'Project 1: Static Map'. I am already contributing to different open source projects from past two years. I have read the project description on page https://svn.boost.org/trac/boost/wiki/SoC2017., I have looked at toy static_map implementation and would like to know more details about the project. Thanks, -- ------------------------------------------------------------------------------------ Govind Sahai Indian Institute of Technology Varanasi Mathematical Sciences Part-IV Varanasi-221005

2 1

Getting Started
by mohammad sharique 02 Mar '17

02 Mar '17

Hello boost community! I want to work on 'PROJECT 2 : Data.Frames in boost.uBlas' under GSOC'17 (https://svn.boost.org/trac/boost/wiki/SoC2017) I have setup the boost library and had taken overview of uBLAS library from here : <https://github.com/boostorg/ublas/tree/develop/doc>. As I am new to open source, I need some help to get started on above mentioned lines. Thank you

1 0

[release] 1.64.0 closed for major changes
by Rene Rivera 02 Mar '17

02 Mar '17

The master branch is now closed for new libraries and breaking changes, and will be closing for major changes in a week and closed for the beta in two weeks. Also, if you're ready, you can also add your libraries' changes to the release notes at: < https://github.com/boostorg/website/blob/master/feed/history/boost_1_64_0.q… > Thanks, -- The Boost Release Team

1 0

Re: [boost] [Boost-testing] Much longer linux regression run times
by Tom Kent 01 Mar '17

01 Mar '17

On Tue, Feb 28, 2017 at 9:08 PM, Rene Rivera <grafikrobot(a)gmail.com> wrote: > On Tue, Feb 28, 2017 at 8:55 PM, Tom Kent via Boost-Testing < > boost-testing(a)lists.boost.org> wrote: > >> >> I'm not really sure how to trace this down. Is there any way to log the >> time it takes the various libraries to complete their test suites? >> > > Not currently. The individual tests can run in parallel. To give you that > number we would have to save the information as part of the regression data > and sum it up as part of the regression reports. > > >> I'm guessing that will show one library that is using 3+ hours. Although, >> it is possible that a change went in to a higher level library that just >> adds a few seconds to each call and is used across many of the libraries. >> >> Thoughts? >> > > Binary search manually? You can limit what tests you run on the command > line by using the "--include-tests" b2 option < > https://github.com/boostorg/boost/blob/develop/status/Jamfile.v2#L18>. So > start off by only running tests for [a-m] or [n-z], then [a-g], and so on. > Until you find the time hog. > That sounds tough. As a shortcut, I've looked at the libraries that had commits to develop on the 18th: https://github.com/boostorg/boost/commits/develop?after=Y3Vyc29yOudbdLMAs4G… It looks like hana, chrono, ratio, and thread (with wave and core/winapi the previous day). If I get a chance tonight I'll start checking through those. Meanwhile, if those authors could look at those and see if there is anything that might be causing this, it would be appreciated. > > Other than that, maybe it's one of the libraries tested on Travis < > https://travis-ci.org/boostorg/boost>. And maybe check the length of > those first if they are long on Travis perhaps they are also long on > regular tests. > I could find the travis scripts for the superset repo (no change in build time), but I'm not clear on what that is doing. Is it testing individual libraries? Tom

3 2

[smart_ptr][thread] Build failures
by Raffi Enficiaud 01 Mar '17

01 Mar '17

Hi all, I have the following compilation issues on master and develop, failing the VS2008, VS2012, VS2013 builds for boost.test (VS2015 ok): 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build\msvc-11 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build\msvc-11\debug 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build\msvc-11\debug\link-static 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build\msvc-11\debug\link-static\threading-multi 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build\msvc-11\debug\link-static\threading-multi\win32 01-Mar-2017 09:57:45 compile-c-c++ ..\..\..\bin.v2\libs\thread\build\msvc-11\debug\link-static\threading-multi\win32\thread.obj 01-Mar-2017 09:57:45 thread.cpp 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/thread/detail/thread.hpp(486) : warning C4067: unexpected tokens following preprocessor directive - expected a newline 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(355) : error C2059: syntax error : ')' 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(358) : see reference to class template instantiation 'boost::detail::sp_less_align<T,U>' being compiled 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(357) : error C2143: syntax error : missing ')' before ';' 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(357) : error C2143: syntax error : missing '}' before ')' 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(357) : error C2059: syntax error : ')' 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(357) : error C2238: unexpected token(s) preceding ';' Can those be quickly fixed? Thanks, Raffi

3 4

[thread]Forever sleeping
by Niklas Angare 01 Mar '17

01 Mar '17

Recent runs of my regression test runner NA-QNX660-x86 leave a lot of Boost.Thread test executables stuck in nanosleep, waiting for a condition variable, or both. Commit 544eda [1] which switched from CLOCK_REALTIME to CLOCK_MONOTONIC seems suspicious to me. If the returned timespec is ever compared to values based on the CLOCK_REALTIME epoch, such as system_clock, the results will be quite undesirable. Are you sure the return values of timespec_now() are only ever compared to each other and values based on the CLOCK_MONOTONIC epoch? [1] https://github.com/boostorg/thread/commit/544eda51bdf0c62b2f29dea6fe1cf935a… Regards, Niklas Angare

3 9

boost exception to_string()
by Olaf van der Spek 28 Feb '17

28 Feb '17

Hi, Is to_string() here supposed to match to_string() in boost\exception\to_string.hpp? class shared_array2 : public boost::iterator_range<T*> {}; typedef shared_array2<unsigned char> shared_data; to_string(shared_data()); I really didn't expect this to_string() to be found here.. is it a feature or is it a bug? -- Olaf

1 0

[config] [atomic] Problem with placement of BOOST_ALIGNMENT - requesting opinions/suggestions
by Groke, Paul 28 Feb '17

28 Feb '17

While preparing a pull request for my Boost.Atomic extensions for the z/OS compiler, I noticed that I have a slight problem there. To get the code to work on z/OS, I changed the placement of the BOOST_ALIGNMENT macro in atomic/detail/storage_type.hpp from... BOOST_ALIGNMENT(16) unsigned char data[Size]; to unsigned char data[Size] BOOST_ALIGNMENT(16); ...because unfortunately the z compiler doesn't understand the __attribute__ ((__aligned__(x))) when it's at the beginning of a variable/data member definition. (For the GNU __attribute__ ((__aligned__(x))) the new location is also the only documented location, although GCC doesn't seem to mind.) While reviewing my changes I now realized that this won't do, because BOOST_ALIGNMENT can also be defined as __declspec(align(x)) or alignas(x), both of which are legal at the beginning but not at the end of a variable/data member definition. (I'm not 100% sure about valid positions of alignas (x) - the examples I can find use alignas (x) at the beginning, but the compilers we currently use - which include MSVC, GCC and Clang, also seem to accept it at the end. __declspec(align(x)) definitely is a problem though.) And now I'm wondering what to do about this. One way to fix this would obviously be to introduce two additional macros, e.g. BOOST_ALIGNMENT_DECLSPEC and BOOST_ALIGNMENT_ATTRIBUTE. Only one of those would then expand to something non-empty, and both would have to be used in variable definitions. The BOOST_ALIGNMENT macro would remain as is for type declarations and for compatibility. The code in storage_type.hpp would then have to be re-written as BOOST_ALIGNMENT_DECLSPEC(16) unsigned char data[Size] BOOST_ALIGNMENT_ATTRIBUTE(16); Which of course is very very ugly. Another option would be a BOOST_ALIGNED_VARIABLE(alignment, variable_definition) macro. This would be nice in definitions like BOOST_ALIGNED_VARIABLE(16, unsigned char data[Size]); but much less nice in definitions like BOOST_ALIGNED_VARIABLE(16, some_template<foo BOOST_PP_COMMA bar BOOST_PP_COMMA baz>); And since not all compilers support variadic macros, this is probably the best one could do. The third option I can think of would be to leave things as they are, which of course would mean that I can't submit my Boost.Atomic implementation for z/OS... hm. I realize that making things uglier for a single compiler that almost nobody uses isn't something many people will cheer for. But then again I'd really like to have my Boost.Atomic implementation for z/OS in the official Boost releases :) So I'm calling out to you for suggestions/opinions/comments. Is there another way to combine the above mentioned square peg + round hole? And which option would you deem favorable/acceptable? Thank you for taking the time to read this wall of text, Cheers, Paul Groke The contents of this e-mail are intended for the named addressee only. It contains information that may be confidential. Unless you are the named addressee or an authorized designee, you may not copy or use it, or disclose it to anyone else. If you received it in error please notify us immediately and then destroy it. Dynatrace Austria GmbH (registration number FN 91482h) is a company registered in Linz whose registered office is at 4040 Linz, Austria, Freistaedterstrasse 313

3 8

[gsoc17] Boost will be participating in Google Summer of Code in 2017
by Niall Douglas 27 Feb '17

27 Feb '17

I am very pleased to inform the Boost community that Google accepted us into their Summer of Code programme this year. This was especially welcome after we were given "a year off" last year which could have caused substantial disruption to the multi year student projects had it not been due to the timely action of the steering committee and generous sponsorship of a stop gap Boost Summer of Code in 2016 by IMC Financial Markets. Last year Google completely rebuilt the Summer of Code website so it no longer is anything like it was before. Now we must individually invite those who vote on student projects, so *anyone willing to rank student project proposals* can you please email us with your details: 1. Your email address matching your Google Account so we can invite you onto the GSoC programme. 2. (Optional) your email address matching your Github Account so we can invite you onto the Boost GSoC github org for 2017 as a potential mentor. Our thanks to those who have already added project ideas to https://svn.boost.org/trac/boost/wiki/SoC2017, but we need MORE ideas and MORE potential project mentors. Follow the project idea template at https://svn.boost.org/trac/boost/wiki/GSoCIdeaTemplate and either add it straight to the wiki page or email it to us so we can add it for you. Our thanks to all in advance.

1 0

ABI navigator for Boost libraries
by Andrey Ponomarenko 26 Feb '17

26 Feb '17

Hello, I'd like to present a new project called "ABI Navigator" to search for binary symbols (functions, methods, global data, etc.) in the Boost and other open-source libraries: https://abi-laboratory.pro/index.php?view=navigator The project allows to find out in which versions of the library and in which particular objects of the library some symbol is defined, added or removed. The project is based on the ABI report for Boost: https://abi-laboratory.pro/tracker/timeline/boost/ Examples: 1. symbol "boost::system::system_category()" from libboost_system.so: https://abi-laboratory.pro/index.php?view=navigator&selected=_ZN5boost6syst… 2. symbol _ZnwmPv21boost_container_new_t from libboost_container.so: https://abi-laboratory.pro/index.php?view=navigator&selected=_ZnwmPv21boost… The project aims to help library users and maintainers to resolve issues with missed symbols and navigate through the ABI reports. Have you ever encountered the "undefined reference" error or want to know whether the symbol is _stable_ enough to use in your code? Try to find it in the ABI Navigator! Enjoy!

1 0

[release] 1.64.0 closed for major changes
by Rene Rivera 23 Feb '17

23 Feb '17

The master branch is now closed for new libraries and breaking changes, and will be closing for major changes in a week and closed for the beta in two weeks. Also, if you're ready, you can also add your libraries' changes to the release notes at: < https://github.com/boostorg/website/blob/master/feed/history/boost_1_64_0.q… > Thanks, -- The Boost Release Team -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

1 0

[mpi] Merging a PR fixing auto_ptr usage
by Andrey Semashev 22 Feb '17

22 Feb '17

Hi, Could someone take a look at this PR and hopefully merge it? https://github.com/boostorg/mpi/pull/38 It should be safe to merge, and I would really like to see it in 1.64. I'm surprised noone fixed it earlier, actually. Thanks.

2 1

Status of Visual Studio 2017 support
by Mateusz Loskot 22 Feb '17

22 Feb '17

Hi, In the mid of 2016, PR "Add support for Visual Studio 15" [1] was merged into develop and eventually into master branch. Although the patch was released in Boost 1.63.0, the release notes [2] are silent about that update. That is about Boost.Build, which I assume is the first to be updated to support a new toolkit. I haven't checked current commits history of individual libraries. Status of VS2017 support in individual libraries may be at different stages. Could anyone clarify any of these points: - Does Boost.Build in Boost 1.63.0 officially support VS2017? - Is there any schedule to fully support VS2017 in Boost 1.64.0? - Or, is that left at discretion of maintainers of individual libraries and VS2017 support might be reached gradually over several releases instead of in a single shot? [1] https://github.com/boostorg/build/pull/132 [2] http://www.boost.org/users/history/version_1_63_0.html Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

16 46

[config] [atomics] Support for z/OS XL C/C++
by Groke, Paul 21 Feb '17

21 Feb '17

Hi, we're using several Boost libraries in a large cross-platform project. One of the platforms we need to support is z/OS, using the IBM z/OS XL C/C++ compiler (which BTW is a completely different beast from the XL C/C++ compilers for other IBM platforms, which Boost.Config already seems to support). To be able to use Boost we had to write some patches and we'd very much like to contribute them. In more detail: * A minor patch to make the configure script work * Patches to some of the configure tests to fix incorrect feature detections * Compiler-, library- and platform-config header files * A Boost.Atomic implementation * An implementation of Boost.SmartPtr atomic operations This won't result in full support for all Boost libraries, not even close, but it's enough to make an appreciable subset usable on z/OS. I've never contributed code to any open source project so far, so I'd appreciate your help. Where should I start? Do I have to talk to the maintainers of Config/Atomic/SmartPtr? Is there even a maintainer for every specific project? Or should I just fork the Git repos and create pull requests? I'm pretty much lost here, sorry :) Regards, Paul Groke The contents of this e-mail are intended for the named addressee only. It contains information that may be confidential. Unless you are the named addressee or an authorized designee, you may not copy or use it, or disclose it to anyone else. If you received it in error please notify us immediately and then destroy it. Dynatrace Austria GmbH (registration number FN 91482h) is a company registered in Linz whose registered office is at 4040 Linz, Austria, Freistaedterstrasse 313

4 6

Re: [boost] Status of Visual Studio 2017 support
by Nat Goodspeed 20 Feb '17

20 Feb '17

On Feb 20, 2017 5:25 AM, "Olaf van der Spek" <ml(a)vdspek.org> wrote: On Fri, Feb 17, 2017 at 2:57 PM, Nat Goodspeed <nat(a)lindenlab.com> wrote: > In a (non-Boost) project with which I've helped, there's a script that > does the following: > > ... Wouldn't it be much simpler if you let the user pick the right dev environment prompt from the start menu and have all stuff available without having to call extra scripts? It's a command-line build tool. The command-line equivalent to what you suggest is making the user discover, and then type, the correct pathname of the desired VS version.

4 3

Mail List Migration - Update
by Michael Caisse 19 Feb '17

19 Feb '17

The Boost mail lists are now migrated to a new set of servers. This change affected all mail lists and web resources (signing up, changing passwords, moderator access, archives...) that were associated with the domain lists.boost.org . If you are having difficulties, please drop me an email. (Oh the irony) Happy coding! michael -- Michael Caisse Ciere Consulting ciere.com

9 15

Variadic append for std::string
by Olaf van der Spek 19 Feb '17

19 Feb '17

Hi, One frequently needs to append stuff to strings, but the standard way (s += "A" + "B" + to_string(42)) isn't optimal due to temporaries. A variadic append() for std::string seems like the obvious solution. It could support string_view (boost and std), integers, maybe floats but without formatting options.. It could even be extensible by calling append(s, t); append(s, "A", "B", 42); Would this be useful for the Boost String Algo lib? -- Olaf

16 104

Interprocess mutex & condition variable at process termination
by Phil Endecott 18 Feb '17

18 Feb '17

Dear Experts, I've just been surprised by the behaviour of the interprocess mutex and condition variable on abnormal process termination, i.e. they are not automatically released. Google tells me that I'm not the first to be surprised by this; there have been previous posts here, stack overflow questions etc. One often-valid observation is that if a process crashes - or otherwise terminates without executing its destructors - while it holds a lock on a shared data structure then the data is probably now corrupt, so unlocking the mutex that protects it is not very useful. I think there is an important case where that does not apply - when the process that crashes is only reading the shared data. In my case, I had written a "monitor" utility that loops forever, waiting on a shared condition, taking the corresponding mutex, and then dumping the shared data to stdout. I had been running this and stopping it by pressing ctrl-C and it had not occurred to me that this might not work as I expected. My attempt at debugging using this utility was making my problems worse, not better! Modifying this code to run destructors on ctrl-C is non-trivial. I am aware that the SysV shared semaphore is able to undo on process termination (see SEM_UNDO in man semop), and I had assumed that Boost.Interprocess was using this or something like it. I now see that it is using pthreads, which I didn't even realise could work between processes, and I don't think this API has any way to specify process termination behaviour. Anyway, I'd like to suggest that the interprocess docs should make some mention of the behaviour of the synchronisation primitives on process termination, e.g. somewhere near the beginning of http://www.boost.org/doc/libs/1_63_0/doc/html/interprocess/synchronization_… I may now try to implement some primitives that use semop() and unlock automatically. I haven't yet looked at what's involved to implement a condition variable on top of a semaphore, so I may not get very far! Has anyone else ever tried this? Also, I note that Interprocess is using "old style" times, not std::chrono like the std::mutex/condition do. Are there any plans to update this? Thanks, Phil.

5 6

Missing link for Boost.Algorithm documentation
by Alexander Zaitsev 17 Feb '17

17 Feb '17

3 2

Scheduled Outage : Web sites / Trac
by Michael Caisse 17 Feb '17

17 Feb '17

We are planning the final move of services from IU this week. Expect service outages for all web sites including Trac on 17-February-2017 between 16:00 UTC - 00:00 UTC. The mail lists will continue to operate during this time; however, all other sub-domains for boost.org will be affected. Sync'ing bandwidth with IU has been low recently and has caused us to increase the outage window. We will notify these lists when services are available again. Thank you for your patience during the move. -- Michael Caisse Ciere Consulting ciere.com

1 1

Boost.Python sandox or multiple interpreters
by David Bellot 17 Feb '17

17 Feb '17

Hi, I'm using Boost.Python to load and use plugins in Python. Each plugin can define a few functions which are are pre-determined, so that my C++ software knows what to call. However, the mistake I've made was to think that the Python interpreter could be initialized many times, so that each plugins was existing and running into a separate interpreter. It's of course not the case and therefore, each time I load a new plugin, its functions overwrite the functions of the same name from the previous plugin (the one which was loaded just before), and so on. Is there a possibility to either : - have as many independent Python interpreters at the same time ? - or encapsulate each plugin in an independent "environment" ? - or any other solution which would elegantly solve this problem ? :-D Thanks for your help, David

3 6

[trac] how close trac for bug reports
by Oliver Kowalke 17 Feb '17

17 Feb '17

Hello, how can I close boost trac for a specific library? Users should report issues only at github. ty, Oliver

1 0

[teeks] Missing winerror.h for MSVC-9
by Andrey Semashev 17 Feb '17

17 Feb '17

Hi, I see lots of tests failing on teeks99-09b-win2012R2-64on64, MSVC-9.0 because winerror.h is missing. Here's an example: http://www.boost.org/development/tests/develop/developer/output/teeks99-09b… I can see that the file is present in Windows SDK 6.0A, which is supposed to be used with this compiler. The tests are passing on my machine. Could this be a tester configuration issue? Also, all MSVC-15 tests are failing on teeks99-09o-win2012R2-64on64 with the error of 'cl' not being found.

3 14

Functional programming in boost
by Abhishek Kumar 16 Feb '17

16 Feb '17

Hello I am a Computer Science senior from India. I have been doing functional programming for quite some time and have also used C++ for different projects. I recently came across BOOST libraries for supporting functional programming in C++. I want to contribute to one of the BOOST libraries maybe PHOENIX. Are there any open issues or plans in this direction, in which I might help? Thanks Abhishek Kumar

1 0

[release] 1.64.0 deadline for new libraries approaching
by Rene Rivera 16 Feb '17

16 Feb '17

One week from today master will close for commits of new libraries. Thanks, -- The Boost Release Team -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

1 0

[safe_numerics] Review coming in March
by Andrzej Krzemienski 15 Feb '17

15 Feb '17

Hi Everyone, This is to inform you ahead of time that the formal review of Robert Ramey's Safe Numerics library will be held in about two weeks: March 2 - March 11. Boost Numerics is a set of drop-in replacements for the built-in integer types, which make the guarantee that the results of operations are either correct according to the rules of integer arithmetic or report a diagnosable error (rather than offering modulo arithmetic results, or resulting in undefined behavior, or returning incorrect results as in the case of signed vs. unsigned comparisons). The library can be found on GitHub: https://github.com/robertramey/safe_numerics/ Online docs: http://htmlpreview.github.io/?https://github.com/robertramey/safe_numerics/… Even before the formal review starts, you can provide your review on Boost Library Incubator: http://blincubator.com/reviews/?library_id=426 It will also be included in the final verdict. I will be making the official announcement on March 2. Andrzej Krzemienski, review manager.

1 0

Is there any interest in non-owning pointer-like types?
by Joseph Thomson 14 Feb '17

14 Feb '17

For some time, I have been developing a pair of non-owning pointer-like types that I am currently calling `observer_ptr` and `observer`. I had planned to propose their addition to the C++ standard library, but I have been informed by the author of the original `observer_ptr` proposal <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4282.pdf> that the ISO C++ committee has rejected his proposal and made clear that it feels there is no place in the standard library for such types, believing that this role is filled to a satisfactory degree by regular pointers. I wholeheartedly disagree with this assessment, so I am bringing my proposal here instead. The `observer_ptr<T>` class template is a pointer-like type that does not do any resource management, and is intended to be used in place of `T*` wherever `T*` is used as a non-owning reference to an object of type `T`. `observer_ptr<T>` has three main advantages over `T*`: 1. `T&` is implicitly convertible to `observer_ptr<T>` which, unlike `T*`, makes it *type-safe*. `T*` can represent things that are not conceptually objects of type `T`: arrays, strings, iterators. No implicit conversion from `T*` means that these things cannot implicitly convert to `observer_ptr<T>`. Pointers aren't even required to point to valid objects (e.g. a past-the-end iterator). Conversely, in a well-formed program, `T&` is *always* a valid object of type `T`. 2. `observer_ptr<T>` documents its purpose. This is really a side-effect of it being type-safe (a type should have a single, specific purpose), but it's worth mentioning. Conversely, when you see `T*`, it may not be immediately obvious what it represents. 3. `observer_ptr<T>` has a minimal interface, which makes it harder to misuse than `T*`; for example, `observer_ptr<T>` has no pointer arithmetic operators, no array subscript operator, no conversion to `void*`. The `observer<T>` class template is a counterpart to `observer_ptr<T>` that has *no null state*; it cannot be default constructed, constructed from `nullptr_t` or constructed from `T*`, and it does not contextually convert to `bool`. The only way to create an `observer<T>` is from `T&`. This allows a "not null" precondition to be enforced at compile-time, rather than having to worry about pointers being null at run-time. Just to give you an idea of the current syntax, here is a simple tree node type (where the nodes do not own their children) implemented using `observer_ptr` and `observer`: class node { public: node() = default; node(node const&) = delete; node& operator=(node const&) = delete; node(node&&) = delete; node& operator=(node&&) = delete; void set_parent(observer_ptr<node> new_parent) { if (parent) parent->remove_child(*this); parent = new_parent; if (parent) parent->add_child(*this); } observer_ptr<node> get_parent() const { return parent; } size_t get_child_count() const { return children.size(); } observer<node> get_child(size_t index) const { return children[index]; } private: observer_ptr<node> parent; vector<observer<node>> children; void add_child(observer<node> child) { children.push_back(child); } void remove_child(observer<node> child) { children.erase(find(begin(children), end(children), child)); } }; And a contrived usage example: node a, b, c; b.set_parent(a); // conversion from `T&` c.set_parent(b); observer_ptr<node> x = c.get_parent(); if (x) // conversion to `bool` { observer<node> y = x->get_child(0); assert(y == c); // comparison with `T&` y->set_parent(a); b.set_parent(y); // conversion from `observer<T>` to `observer_ptr<T>` } A project with a working implementation <https://github.com/hpesoj/cpp-observer/blob/master/api/observer.hpp> and full test suite <https://github.com/hpesoj/cpp-observer/blob/master/tests/observer_tests.cpp> can be found here <https://github.com/hpesoj/cpp-observer>. Regards, Joseph

16 35

What is http://downloads.sourceforge.net/boost/boost_1_63_0.tar.bz2 ?
by Jonathan Wakely 14 Feb '17

14 Feb '17

The link http://downloads.sourceforge.net/boost/boost_1_63_0.tar.bz2 redirects to http://downloads.sourceforge.net/project/boost/boost/snapshots/master/boost… which seems to be a snapshot from master, and VERY different to the boost_1_63_0 release (which makes it a VERY misleading URL). How often is that snapshot updated? Shouldn't it have a different name if it's not boost_1_63_0.tar.bz2 but some completely different set of sources (which currently don't even build)? The Fedora Linux packages have been using that URL, for several years by the look of things. So I have no idea what arbitrary collection of changes we've been shipping instead of a proper release.

9 21

[test]redefinition of boost::unit_test::ut_detail::auto_test_unit_registrar
by Takatoshi Kondo 14 Feb '17

14 Feb '17

Hello, I'm using Boost.Test. When I define BOOST_AUTO_TEST_SUITE, I got a compile error 'redefinition of boost::unit_test::ut_detail::auto_test_unit_registrar' if the all following conditions are satisfied: 1. The test suite names are the same. 2. BOOST_AUTO_TEST_SUITE are defined in different files. 3. The files are included by one file. 4. BOOST_AUTO_TEST_SUITE are defined at the same line number. For example, main.cpp #define BOOST_TEST_MODULE test #include <boost/test/unit_test.hpp> #include "one.ipp" #include "two.ipp" one.ipp BOOST_AUTO_TEST_SUITE(a) BOOST_AUTO_TEST_CASE(tc1) { } BOOST_AUTO_TEST_SUITE_END() two.ipp BOOST_AUTO_TEST_SUITE(a) BOOST_AUTO_TEST_CASE(tc2) { } BOOST_AUTO_TEST_SUITE_END() Here is a live demo: http://melpon.org/wandbox/permlink/R459VQ6apnQfapyw If I insert a line the top of two.ipp, no errors are occurred. http://melpon.org/wandbox/permlink/jPRTstNDVb7agjXl According to the following document http://www.boost.org/doc/libs/1_63_0/libs/test/doc/html/boost_test/tests_or… "The same test suite can be restarted multiple times inside the same test file or in a different test files." The compile error is caused by the following line: https://github.com/boostorg/test/blob/develop/include/boost/test/unit_test_… If I replace BOOST_JOIN( BOOST_JOIN( test_name, _registrar ), __LINE__ ) \ with BOOST_JOIN( BOOST_JOIN( test_name, _registrar ), __COUNTER__ ) \ , then the error is disappeared. However, __COUNTER__ is not portable. I know that I can compile one.ipp and two.ipp separately, but I also want to have the option that include them from one file. Is there any good way to solve the error? Thanks, Takatoshi Kondo

2 2

Lazy Spirit Generators?
by Christof Donat 14 Feb '17

14 Feb '17

Hi, In a hobby project, I am using Spirit Karma generators. As far as I have understood Spirit Karma, it is not designed to work lazily in the iterator based interface. It takes an output iterator and writes to it until it has finished. What I am thinking of is a kind of generating range. E.g.: for(auto& char: generator_range(double_ << " + " << double_ << "i", context, c.real(), c.imag())) { // do whatever with the single characters returned by the generator } Is there something like that, which I simply have not found? Christof

3 2

Fit - Request for formal review
by Paul Fultz II 13 Feb '17

13 Feb '17

Hi, So I’ve made a lot of updates to the Fit library since last review. There are a few more changes I would like to make, but most of the work has been done. So, I would like to request for a formal review, and get it on the schedule soon. Vicente Botet was the review manager last time, I don’t know if he would be interested in being the review manager again. Is there perhaps someone else that would be interested in being review manager? https://github.com/pfultz2/Fit Thanks, Paul

1 1

boost::aligned_storage is not a POD.
by Vicente J. Botet Escriba 11 Feb '17

11 Feb '17

Hi, boost::aligned_storage is not a POD. I suspect it is because of the declared constructors private: // noncopyable aligned_storage(const aligned_storage&); aligned_storage& operator=(const aligned_storage&); public: // structors aligned_storage() { } ~aligned_storage() { } Was this intentional? Why aligned_storage is not copyable? Best, Vicente

2 2

[exception] error: looser throw specifier
by Niklas Angare 11 Feb '17

11 Feb '17

On QNX 6.6.0 with GCC 4.7.3 and Dinkumware library in -std=gnu++0x mode, I get the following error: ../libs/exception/test/throw_exception_test.cpp:21:1: error: looser throw specifier for 'virtual exception2::~exception2()' In file included from ../libs/exception/test/helper2.hpp:9:0, from ../libs/exception/test/throw_exception_test.cpp:6: ../boost/exception/exception.hpp:303:5: error: overriding 'virtual boost::exception::~exception() throw ()' libs/exception/test/throw_exception_test.cpp has these definitions: struct exception1: std::exception {}; struct exception2: std::exception, boost::exception {}; There is no error for exception1. Is the bug in the Boost library, the test, the compiler or the Dinkumware library? Other regression runners with GCC 4.7 don't get the error. My regression test runner is NA-QNX660-x86 so you can see all details in the result matrix. Regards, Niklas Angare

1 0