On Tue, Feb 21, 2012 at 1:36 AM, Vicente J. Botet Escriba < vicente.botet@wanadoo.fr> wrote:
Le 21/02/12 07:04, Ben Robinson a écrit :
The implementation is complete, with 5 policies created (and users can
always create and use more). The policies are:
ignore_overflow throw_overflow assert_overflow saturate_overflow nan_overflow
The implementation is fully portable, and it provides integer types which can be used like the builtin integers, except they will trigger their policy on an overflow.
Also, this library will integrate seamlessly with the Boost Constrained Value Library (contributed by Robert Kawulak).
Does this pique anyone's interest?
Hi,
Yes I think this is interesting by itself. Adding a range is a thing that you could consider, as proposed to the standard recently "C++ Binary Fixed-Point Arithmetic" (see http://www.open-std.org/jtc1/**sc22/wg21/docs/papers/2012/**n3352.html<http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3352.html>). Note that this proposal has a wider scope.
That paper was a good read. The author states twice "Pre-emptively checking for overflow is challenging and tedious" This library aims to simplify that task completely under the hood, provided you are using the integers supplied from the library, instead of the builtin ones.
Ben Robinson
I've on my ToDo list the implementation of the fractional part, which I will constraint to range and resolutions that can be represented using a built-in integer type.
Best, Vicente
______________________________**_________________ Unsubscribe & other changes: http://lists.boost.org/** mailman/listinfo.cgi/boost<http://lists.boost.org/mailman/listinfo.cgi/boost>