1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142

/*
 * // Copyright 2024 (c) the Radzivon Bartoshyk. All rights reserved.
 * //
 * // Use of this source code is governed by a BSD-style
 * // license that can be found in the LICENSE file.
 */

use std::ops::{Add, Mul};

use crate::floor::efloorf;

#[inline]
pub fn mulsignf(x: f32, y: f32) -> f32 {
    f32::from_bits(x.to_bits() ^ (y.to_bits() & (1 << 31)))
}

#[inline]
pub fn mulsign(x: f64, y: f64) -> f64 {
    f64::from_bits(x.to_bits() ^ (y.to_bits() & (1 << 63)))
}

#[inline(always)]
pub fn make_negf(x: f32) -> f32 {
    f32::from_bits(x.to_bits() | (1 << 31))
}

#[inline(always)]
pub fn make_neg(x: f64) -> f64 {
    f64::from_bits(x.to_bits() | (1u64 << 63u64))
}

#[inline]
pub fn copysignfk(x: f32, y: f32) -> f32 {
    f32::from_bits((x.to_bits() & !(1 << 31)) ^ (y.to_bits() & (1 << 31)))
}

/// Copy sign of a number
#[inline]
pub fn copysignk(x: f64, y: f64) -> f64 {
    f64::from_bits((x.to_bits() & !(1 << 63)) ^ (y.to_bits() & (1 << 63)))
}

/// Sign of a number
#[inline]
pub fn signf(d: f32) -> f32 {
    mulsignf(1., d)
}

#[inline]
pub fn rintfk(x: f32) -> f32 {
    (if x < 0. { x - 0.5 } else { x + 0.5 }) as i32 as f32
}

#[inline]
pub fn rintk(x: f64) -> f64 {
    (if x < 0. { x - 0.5 } else { x + 0.5 }) as i64 as f64
}

#[inline]
pub fn mlaf<T: Copy + Add<Output = T> + Mul<Output = T>>(x: T, y: T, z: T) -> T {
    return x * y + z;
}

#[inline]
// Founds n in ln(𝑥)=ln(𝑎)+𝑛ln(2)
pub fn ilogb2kf(d: f32) -> i32 {
    (((d.to_bits() as i32) >> 23) & 0xff) - 0x7f
}

#[inline]
pub fn ilogb2k(d: f64) -> i32 {
    (((d.to_bits() >> 52) & 0x7ff) as i32) - 0x3ff
}

#[inline]
pub fn ldexp3k(d: f64, e: i32) -> f64 {
    f64::from_bits(((d.to_bits() as i64) + ((e as i64) << 52)) as u64)
}

#[inline]
pub fn pow2if(q: i32) -> f32 {
    f32::from_bits(((q + 0x7f) as u32) << 23)
}

#[inline]
pub fn is_pos_infinite(j: f64) -> bool {
    j == f64::INFINITY
}

#[inline]
pub fn is_neg_infinite(j: f64) -> bool {
    j == f64::NEG_INFINITY
}

#[inline]
pub fn is_pos_infinitef(j: f32) -> bool {
    j == f32::INFINITY
}

#[inline]
pub fn is_neg_infinitef(j: f32) -> bool {
    j == f32::NEG_INFINITY
}

#[inline]
pub fn ldexp2kf(d: f32, e: i32) -> f32 {
    d * pow2if(e >> 1) * pow2if(e - (e >> 1))
}

#[inline]
// Founds a in x=a+𝑛ln(2)
pub fn ldexp3kf(d: f32, n: i32) -> f32 {
    f32::from_bits(((d.to_bits() as i32) + (n << 23)) as u32)
}

pub fn rempif2(x: f32) -> f32 {
    let n = efloorf(x / std::f32::consts::PI);
    return x - n * std::f32::consts::PI;
}

pub trait IsNegZero {
    fn isnegzero(self) -> bool;
}

impl IsNegZero for f32 {
    #[inline]
    fn isnegzero(self) -> bool {
        self.to_bits() == (-0.0f32).to_bits()
    }
}

impl IsNegZero for f64 {
    #[inline]
    fn isnegzero(self) -> bool {
        self.to_bits() == (-0.0f64).to_bits()
    }
}

#[inline(always)]
pub fn pow2i(q: i32) -> f64 {
    f64::from_bits(((q + 0x3ff) as u64) << 52)
}