pxfm/gamma/
lnbetaf.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
30use crate::gamma::lgamma_rf::lgamma_coref;
31
32/// Computes log(beta(x)) function
33pub fn f_lnbetaf(a: f32, b: f32) -> f32 {
34    let ax = a.to_bits();
35    let bx = b.to_bits();
36
37    if ax >= 0xffu32 << 23 || ax == 0 || bx >= 0xffu32 << 23 || bx == 0 {
38        if (ax >> 31) != 0 || (bx >> 31) != 0 {
39            // |a| < 0 or |b| < 0
40            return f32::NAN;
41        }
42        if ax.wrapping_shl(1) == 0 || bx.wrapping_shl(1) == 0 {
43            // |a| == 0 || |b| == 0
44            if ax.wrapping_shl(1) != 0 || bx.wrapping_shl(1) != 0 {
45                return f32::INFINITY;
46            }
47            return f32::NAN;
48        }
49        if a.is_infinite() || b.is_infinite() {
50            // |a| == inf or |b| == inf
51            return f32::NEG_INFINITY;
52        }
53        return a + f32::NAN; // nan
54    }
55
56    let (mut y, _) = lgamma_coref(a + b);
57    let (y1, _) = lgamma_coref(b);
58    y = y1 - y;
59    let (y1, _) = lgamma_coref(a);
60    y += y1;
61    y as f32
62}
63
64pub(crate) fn lnbetaf_core(a: f32, b: f32) -> f64 {
65    let (mut y, _) = lgamma_coref(a + b);
66    let (y1, _) = lgamma_coref(b);
67    y = y1 - y;
68    let (y1, _) = lgamma_coref(a);
69    y += y1;
70    y
71}
72
73#[cfg(test)]
74mod tests {
75    use crate::f_lnbetaf;
76
77    #[test]
78    fn test_betaf() {
79        assert_eq!(f_lnbetaf(1., f32::INFINITY), f32::NEG_INFINITY);
80        assert_eq!(f_lnbetaf(f32::INFINITY, 0.), f32::INFINITY);
81        assert!(f_lnbetaf(0., 0.).is_nan());
82        assert_eq!(f_lnbetaf(0., f32::INFINITY), f32::INFINITY);
83        assert!(f_lnbetaf(-5., 15.).is_nan());
84        assert!(f_lnbetaf(5., -15.).is_nan());
85        assert!(f_lnbetaf(f32::NAN, 15.).is_nan());
86        assert!(f_lnbetaf(15., f32::NAN).is_nan());
87        assert_eq!(f_lnbetaf(f32::INFINITY, 1.), f32::NEG_INFINITY);
88        assert_eq!(f_lnbetaf(5., 3.), -4.65396);
89        assert_eq!(f_lnbetaf(3., 5.), -4.65396);
90        assert_eq!(f_lnbetaf(12., 23.), -22.607338);
91    }
92}
pxfm/gamma/lnbetaf.rs

pxfm/gamma/
lnbetaf.rs
