- Boost - lists.boost.org

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