Christopher Swenson 424f38f211 Simplification of BigNum::bit_length ...

As indicated in the comment, the BigNum::bit_length function could be
optimized by using CLZ, which is often a single instruction instead a
loop.

I think the code is also simpler now without the loop.

I added some additional tests for Big8x3 and Big32x40 to ensure that
there were no regressions.

2022-01-10 14:18:28 -08:00

..

dec2flt

Changed dec2flt to use the Eisel-Lemire algorithm.

2021-07-17 00:30:34 -05:00

flt2dec

Move flt2dec::{Formatted, Part} to dedicated module

2021-06-06 02:54:51 +01:00

bignum.rs

Simplification of BigNum::bit_length

2022-01-10 14:18:28 -08:00

const_from.rs

Add test for int to float

2021-08-07 19:03:34 +02:00

i8.rs

…

i16.rs

…

i32.rs

…

i64.rs

…

i128.rs

…

ieee754.rs

Add IEEE754 tests

2021-03-22 17:02:06 -07:00

int_log.rs

Speed up integer log10.

2021-09-09 18:14:47 +02:00

int_macros.rs

Revert "Temporarily rename int_roundings functions to avoid conflicts"

2021-11-22 15:49:04 -05:00

mod.rs

Implement IEEE 754-2019 minimun and maximum functions for f32/f64

2021-11-20 10:14:03 +01:00

nan.rs

…

ops.rs

Adds tests to ensure some base op traits exist.

2021-01-13 23:14:00 -05:00

u8.rs

…

u16.rs

…

u32.rs

…

u64.rs

…

u128.rs

…

uint_macros.rs

Revert "Temporarily rename int_roundings functions to avoid conflicts"

2021-11-22 15:49:04 -05:00

wrapping.rs

…