pxfm/rounding/
rintf.rs

1/*
2 * // Copyright (c) Radzivon Bartoshyk 9/2025. All rights reserved.
3 * //
4 * // Redistribution and use in source and binary forms, with or without modification,
5 * // are permitted provided that the following conditions are met:
6 * //
7 * // 1.  Redistributions of source code must retain the above copyright notice, this
8 * // list of conditions and the following disclaimer.
9 * //
10 * // 2.  Redistributions in binary form must reproduce the above copyright notice,
11 * // this list of conditions and the following disclaimer in the documentation
12 * // and/or other materials provided with the distribution.
13 * //
14 * // 3.  Neither the name of the copyright holder nor the names of its
15 * // contributors may be used to endorse or promote products derived from
16 * // this software without specific prior written permission.
17 * //
18 * // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 * // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
21 * // DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
22 * // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
24 * // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
25 * // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
26 * // OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 * // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */
29
30#[inline]
31pub const fn rintf(x: f32) -> f32 {
32    /* Use generic implementation.  */
33    static TWO23: [f32; 2] = [
34        8.3886080000e+06,  /* 0x4b000000 */
35        -8.3886080000e+06, /* 0xcb000000 */
36    ];
37    let mut i0: i32 = x.to_bits() as i32;
38    let sx = (i0 >> 31) & 1;
39    let j0 = ((i0 >> 23) & 0xff) - 0x7f;
40    if j0 < 23 {
41        if j0 < 0 {
42            let w = TWO23[sx as usize] + x;
43            let t = w - TWO23[sx as usize];
44            i0 = t.to_bits() as i32;
45            let u = (i0 & 0x7fffffff) | (sx << 31);
46            return f32::from_bits(u as u32);
47        }
48    } else {
49        return if j0 == 0x80 {
50            x + x /* inf or NaN  */
51        } else {
52            x /* x is integral  */
53        };
54    }
55    let w = TWO23[sx as usize] + x;
56    w - TWO23[sx as usize]
57}
58
59#[cfg(test)]
60mod tests {
61    use super::*;
62    #[test]
63    fn test_rintf() {
64        assert_eq!(rintf(0f32), 0.0f32.round());
65        assert_eq!(rintf(1f32), 1.0f32.round());
66        assert_eq!(rintf(1.2f32), 1.2f32.round());
67        assert_eq!(rintf(-1.2f32), (-1.2f32).round());
68        assert_eq!(rintf(-1.6f32), (-1.6f32).round());
69        assert_eq!(rintf(-1.5f32), (-1.5f32).round());
70        assert_eq!(rintf(1.6f32), 1.6f32.round());
71        assert_eq!(rintf(1.5f32), 1.5f32.round());
72        assert_eq!(rintf(2.5f32), 2.0f32);
73        assert_eq!(rintf(3.5f32), 4.0f32);
74        assert_eq!(rintf(-2.5f32), -2.0f32);
75        assert_eq!(rintf(-3.5f32), -4.0f32);
76        assert_eq!(rintf(f32::INFINITY), f32::INFINITY);
77        assert_eq!(rintf(f32::NEG_INFINITY), f32::NEG_INFINITY);
78        assert!(rintf(f32::NAN).is_nan());
79    }
80}
pxfm/rounding/rintf.rs

pxfm/rounding/
rintf.rs
