4 releases

0.0.7 Oct 15, 2023
0.0.6 Oct 14, 2023

#1322 in Math

Download history 22/week @ 2024-05-12 25/week @ 2024-05-19 36/week @ 2024-05-26 28/week @ 2024-06-02 14/week @ 2024-06-09 27/week @ 2024-06-16 25/week @ 2024-06-23 48/week @ 2024-06-30 8/week @ 2024-07-07 28/week @ 2024-07-14 14/week @ 2024-07-21 46/week @ 2024-07-28 22/week @ 2024-08-04 20/week @ 2024-08-11 7/week @ 2024-08-18 19/week @ 2024-08-25

72 downloads per month
Used in 7 crates (4 directly)

MIT license

23KB
520 lines

umath: ffast-math, for rust.

MSRV DOCS

Want to make your math faster? *t&c apply

Want to order a float?

You can do all of that, with umath!

use umath::FFloat;
// wrap a non NAN and non INF f32/f64 (we will also *never* make this number nan).
let mut f = unsafe { FFloat::new(4.0f32) };
f *= 3; // multiply by 3
// this check will be removed by the optimizer!
assert!(!f.is_nan());
# use std::collections::BinaryHeap;
// use a ORD type! this is allowed, as FFloat is not allowed to be NAN | INF.
let mut b = BinaryHeap::new();
b.push(unsafe { FFloat::new(2.0) });
b.push(unsafe { FFloat::new(1.0) });
b.push(unsafe { FFloat::new(3.0) });
b.push(f);
assert_eq!(b.pop(), Some(unsafe { FFloat::new(24.0) }));

A note on safety

When you make your first FFLoat, you must promise that you will never create a NAN | INF FFLoat. Hence, *f = NAN is (delayed) UB.

Nightlyness

umath is nightly because it makes use of core intrinsics, like fadd_fast(), which require the core_intrinsics feature to use.

No runtime deps