fastnum2 0.3.5

fork of Fast decimal numbers library
Documentation 
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

use core::cmp::Ordering;

use crate::{
    decimal::{
        dec::{
            math::add::add_abs,
            scale::{extend_scale_to, rescale},
            utils,
        },
        Decimal,
    },
    int::UInt,
};

type D<const N: usize> = Decimal<N>;

#[inline]
pub(crate) const fn sub<const N: usize>(lhs: D<N>, rhs: D<N>) -> D<N> {
    if lhs.is_nan() {
        return lhs.compound(&rhs).op_invalid();
    }

    if rhs.is_nan() {
        return rhs.compound(&lhs).op_invalid();
    }

    match (lhs.cb.is_negative(), rhs.cb.is_negative()) {
        (false, false) => sub_abs(lhs, rhs),
        (true, true) => sub_abs(rhs.neg(), lhs.neg()),
        (false, true) => add_abs(lhs, rhs.neg()),
        (true, false) => add_abs(lhs.neg(), rhs).neg(),
    }
}

#[inline]
pub(crate) const fn sub_abs<const N: usize>(mut lhs: D<N>, mut rhs: D<N>) -> D<N> {
    debug_assert!(!lhs.is_negative() && !rhs.is_negative());

    if lhs.is_infinite() && rhs.is_infinite() {
        return D::SIGNALING_NAN.set_ctx(lhs.context()).compound(&rhs);
    } else if lhs.is_infinite() {
        return lhs.compound(&rhs);
    } else if rhs.is_infinite() {
        return rhs.compound(&lhs).neg();
    }

    if rhs.is_zero() {
        return extend_scale_to(lhs, rhs.cb.get_scale()).compound(&rhs);
    }

    if lhs.is_zero() {
        return extend_scale_to(rhs, lhs.cb.get_scale())
            .compound(&lhs)
            .neg();
    }

    match lhs.cb.scale_cmp(&rhs.cb) {
        Ordering::Equal => sub_aligned(lhs, rhs),
        Ordering::Less => {
            rescale(&mut lhs, rhs.cb.get_scale());

            if lhs.is_op_clamped() {
                rescale(&mut rhs, lhs.cb.get_scale());
                sub_aligned(lhs, rhs)
            } else {
                sub_aligned(lhs, rhs)
            }
        }
        Ordering::Greater => {
            rescale(&mut rhs, lhs.cb.get_scale());

            if rhs.is_op_clamped() {
                rescale(&mut lhs, rhs.cb.get_scale());
                sub_aligned(lhs, rhs)
            } else {
                sub_aligned(lhs, rhs)
            }
        }
    }
}

#[inline]
const fn sub_aligned<const N: usize>(mut lhs: D<N>, mut rhs: D<N>) -> D<N> {
    debug_assert!(lhs.cb.get_scale() == rhs.cb.get_scale());

    match lhs.digits.cmp(&rhs.digits) {
        Ordering::Less => {
            rhs.digits = rhs.digits.strict_sub(lhs.digits);
            utils::sub_extra_precision(&mut rhs, &lhs);
            rhs.compound(&lhs).neg()
        }
        Ordering::Equal => {
            lhs.digits = UInt::ZERO;
            utils::sub_extra_precision(&mut lhs, &rhs);
            lhs.compound(&rhs)
        }
        Ordering::Greater => {
            lhs.digits = lhs.digits.strict_sub(rhs.digits);
            utils::sub_extra_precision(&mut lhs, &rhs);
            lhs.compound(&rhs)
        }
    }
}