/rust/registry/src/index.crates.io-1949cf8c6b5b557f/pic-scale-safe-0.1.6/src/math/cubic.rs

Source
/*
 * Copyright (c) Radzivon Bartoshyk, 10/2024. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without modification,
 * are permitted provided that the following conditions are met:
 *
 * 1.  Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 *
 * 2.  Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer in the documentation
 * and/or other materials provided with the distribution.
 *
 * 3.  Neither the name of the copyright holder nor the names of its
 * contributors may be used to endorse or promote products derived from
 * this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

use num_traits::{AsPrimitive, Signed};
use std::ops::{Add, Div, Mul, Neg, Sub};

#[inline(always)]
pub(crate) fn cubic_spline<
    V: Copy
        + Mul<Output = V>
        + Add<Output = V>
        + Neg<Output = V>
        + Sub<Output = V>
        + PartialOrd
        + PartialEq
        + Div<Output = V>
        + 'static,
>(
    d: V,
) -> V
where
    f32: AsPrimitive<V>,
{
    let mut x = d;
    if x < 0f32.as_() {
        x = -x;
    }
    if x < 1f32.as_() {
        return (4f32.as_() + x * x * (3f32.as_() * x - 6f32.as_())) * (1f32.as_() / 6f32.as_());
    } else if x < 2f32.as_() {
        return (8f32.as_() + x * ((-12f32).as_() + x * (6f32.as_() - x)))
            * (1f32.as_() / 6f32.as_());
    }
    0f32.as_()
}

#[inline(always)]
pub(crate) fn bicubic_spline<
    V: Copy
        + Mul<Output = V>
        + Sub<Output = V>
        + Add<Output = V>
        + 'static
        + Neg<Output = V>
        + Signed
        + PartialOrd,
>(
    d: V,
) -> V
where
    f32: AsPrimitive<V>,
{
    let x = d;
    let a = (-0.5).as_();
    let modulo = x.abs();
    if modulo >= 2f32.as_() {
        return 0f32.as_();
    }
    let floatd = modulo * modulo;
    let triplet = floatd * modulo;
    if modulo <= 1f32.as_() {
        return (a + 2f32.as_()) * triplet - (a + 3f32.as_()) * floatd + 1f32.as_();
    }
    a * triplet - 5f32.as_() * a * floatd + 8f32.as_() * a * modulo - 4f32.as_() * a
}

Coverage Report

Created: 2026-01-19 07:25

Line	Count	Source
1		/*
2		* Copyright (c) Radzivon Bartoshyk, 10/2024. 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		use num_traits::{AsPrimitive, Signed};
31		use std::ops::{Add, Div, Mul, Neg, Sub};
32
33		#[inline(always)]
34	0	pub(crate) fn cubic_spline<
35	0	V: Copy
36	0	+ Mul<Output = V>
37	0	+ Add<Output = V>
38	0	+ Neg<Output = V>
39	0	+ Sub<Output = V>
40	0	+ PartialOrd
41	0	+ PartialEq
42	0	+ Div<Output = V>
43	0	+ 'static,
44	0	>(
45	0	d: V,
46	0	) -> V
47	0	where
48	0	f32: AsPrimitive<V>,
49		{
50	0	let mut x = d;
51	0	if x < 0f32.as_() {
52	0	x = -x;
53	0	}
54	0	if x < 1f32.as_() {
55	0	return (4f32.as_() + x * x * (3f32.as_() * x - 6f32.as_())) * (1f32.as_() / 6f32.as_());
56	0	} else if x < 2f32.as_() {
57	0	return (8f32.as_() + x * ((-12f32).as_() + x * (6f32.as_() - x)))
58	0	* (1f32.as_() / 6f32.as_());
59	0	}
60	0	0f32.as_()
61	0	}
62
63		#[inline(always)]
64	0	pub(crate) fn bicubic_spline<
65	0	V: Copy
66	0	+ Mul<Output = V>
67	0	+ Sub<Output = V>
68	0	+ Add<Output = V>
69	0	+ 'static
70	0	+ Neg<Output = V>
71	0	+ Signed
72	0	+ PartialOrd,
73	0	>(
74	0	d: V,
75	0	) -> V
76	0	where
77	0	f32: AsPrimitive<V>,
78		{
79	0	let x = d;
80	0	let a = (-0.5).as_();
81	0	let modulo = x.abs();
82	0	if modulo >= 2f32.as_() {
83	0	return 0f32.as_();
84	0	}
85	0	let floatd = modulo * modulo;
86	0	let triplet = floatd * modulo;
87	0	if modulo <= 1f32.as_() {
88	0	return (a + 2f32.as_()) * triplet - (a + 3f32.as_()) * floatd + 1f32.as_();
89	0	}
90	0	a * triplet - 5f32.as_() * a * floatd + 8f32.as_() * a * modulo - 4f32.as_() * a
91	0	}