/rust/registry/src/index.crates.io-1949cf8c6b5b557f/moxcms-0.7.7/src/math/mod.rs
Line | Count | Source |
1 | | /* |
2 | | * // Copyright (c) Radzivon Bartoshyk 6/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 | | #![allow(clippy::approx_constant, clippy::manual_range_contains)] |
30 | | |
31 | | use num_traits::Num; |
32 | | |
33 | | #[inline(always)] |
34 | 0 | pub const fn rounding_div_ceil(value: i32, div: i32) -> i32 { |
35 | 0 | (value + div - 1) / div |
36 | 0 | } |
37 | | |
38 | | // Generic function for max |
39 | | #[inline(always)] |
40 | 0 | pub(crate) fn m_max<T: Num + PartialOrd>(a: T, b: T) -> T { |
41 | 0 | if a > b { a } else { b } |
42 | 0 | } |
43 | | |
44 | | // Generic function for min |
45 | | #[inline(always)] |
46 | 0 | pub(crate) fn m_min<T: Num + PartialOrd>(a: T, b: T) -> T { |
47 | 0 | if a < b { a } else { b } |
48 | 0 | } |
49 | | |
50 | | #[inline] |
51 | 0 | pub(crate) fn m_clamp<T: Num + PartialOrd>(a: T, min: T, max: T) -> T { |
52 | 0 | if a > max { |
53 | 0 | max |
54 | 0 | } else if a >= min { |
55 | 0 | a |
56 | | } else { |
57 | | // a < min or a is NaN |
58 | 0 | min |
59 | | } |
60 | 0 | } |
61 | | |
62 | | pub trait FusedMultiplyAdd<T> { |
63 | | fn mla(&self, b: T, c: T) -> T; |
64 | | } |
65 | | |
66 | | pub(crate) trait FusedMultiplyNegAdd<T> { |
67 | | fn neg_mla(&self, b: T, c: T) -> T; |
68 | | } |