- Boost - lists.preview.boost.org

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