4 releases

0.0.7 Oct 15, 2023
0.0.6 Oct 14, 2023

#2135 in Math

Download history 25/week @ 2026-01-22 22/week @ 2026-01-29 20/week @ 2026-02-05 9/week @ 2026-02-12 30/week @ 2026-02-19 17/week @ 2026-02-26 34/week @ 2026-03-05 28/week @ 2026-03-12 47/week @ 2026-03-19 52/week @ 2026-03-26 31/week @ 2026-04-02 37/week @ 2026-04-09 38/week @ 2026-04-16 14/week @ 2026-04-23 9/week @ 2026-04-30 32/week @ 2026-05-07

95 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