/rust/registry/src/index.crates.io-1949cf8c6b5b557f/pic-scale-safe-0.1.6/src/math/hann.rs
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 crate::math::consts::ConstPI; |
31 | | use num_traits::{AsPrimitive, Float, Signed}; |
32 | | use std::ops::{Add, Div, Mul}; |
33 | | |
34 | | #[inline(always)] |
35 | 0 | pub(crate) fn hann< |
36 | 0 | V: Copy + ConstPI + Mul<Output = V> + Div<Output = V> + Signed + Float + 'static, |
37 | 0 | >( |
38 | 0 | x: V, |
39 | 0 | ) -> V |
40 | 0 | where |
41 | 0 | f32: AsPrimitive<V>, |
42 | | { |
43 | 0 | let length = 2.0f32.as_(); |
44 | 0 | let size = length * 2f32.as_(); |
45 | 0 | let size_scale = 1f32.as_() / size; |
46 | 0 | let part = V::const_pi() / size; |
47 | 0 | if x.abs() > length { |
48 | 0 | return 0f32.as_(); |
49 | 0 | } |
50 | 0 | let r = (x * part).cos(); |
51 | 0 | let r = r * r; |
52 | 0 | r * size_scale |
53 | 0 | } |
54 | | |
55 | | #[inline(always)] |
56 | 0 | pub(crate) fn hamming< |
57 | 0 | V: Copy + ConstPI + Mul<Output = V> + Div<Output = V> + Signed + Float + Add<Output = V> + 'static, |
58 | 0 | >( |
59 | 0 | x: V, |
60 | 0 | ) -> V |
61 | 0 | where |
62 | 0 | f32: AsPrimitive<V>, |
63 | | { |
64 | 0 | let x = x.abs(); |
65 | 0 | if x == 0f32.as_() { |
66 | 0 | 1f32.as_() |
67 | 0 | } else if x >= 1f32.as_() { |
68 | 0 | 0f32.as_() |
69 | | } else { |
70 | 0 | let x = x * V::const_pi(); |
71 | 0 | 0.54f32.as_() + 0.46f32.as_() * x.cos() |
72 | | } |
73 | 0 | } |
74 | | |
75 | | #[inline(always)] |
76 | 0 | pub(crate) fn hanning< |
77 | 0 | V: Copy + ConstPI + Mul<Output = V> + Div<Output = V> + Signed + Float + Add<Output = V> + 'static, |
78 | 0 | >( |
79 | 0 | x: V, |
80 | 0 | ) -> V |
81 | 0 | where |
82 | 0 | f32: AsPrimitive<V>, |
83 | | { |
84 | 0 | let x = x.abs(); |
85 | 0 | if x == 0.0f32.as_() { |
86 | 0 | 1.0f32.as_() |
87 | 0 | } else if x >= 1.0f32.as_() { |
88 | 0 | 0.0f32.as_() |
89 | | } else { |
90 | 0 | let x = x * V::const_pi(); |
91 | 0 | 0.5f32.as_() + 0.5f32.as_() * x.cos() |
92 | | } |
93 | 0 | } |