/rust/registry/src/index.crates.io-1949cf8c6b5b557f/moxcms-0.7.9/src/lut_hint.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 | | use crate::LutWarehouse; |
30 | | |
31 | | impl LutWarehouse { |
32 | | /// Method tests if mathematical fusion on LUT table is allowed. |
33 | | /// If it's not, full brute-force pass in [Katana] is required. |
34 | 0 | pub(crate) fn is_katana_required(&self) -> bool { |
35 | 0 | match self { |
36 | 0 | LutWarehouse::Lut(lut) => { |
37 | 0 | let input_entries = lut.num_input_channels as usize; |
38 | 0 | let output_entries = lut.num_output_channels as usize; |
39 | 0 | for i in 0..input_entries { |
40 | 0 | if lut.input_table.is_degenerated(input_entries, i) { |
41 | 0 | return true; |
42 | 0 | } |
43 | 0 | if !lut.input_table.is_monotonic(input_entries, i) { |
44 | 0 | return true; |
45 | 0 | } |
46 | 0 | if lut.input_table.have_discontinuities(input_entries, i) { |
47 | 0 | return true; |
48 | 0 | } |
49 | | } |
50 | | |
51 | 0 | for i in 0..output_entries { |
52 | 0 | if lut.output_table.is_degenerated(output_entries, i) { |
53 | 0 | return true; |
54 | 0 | } |
55 | 0 | if !lut.output_table.is_monotonic(output_entries, i) { |
56 | 0 | return true; |
57 | 0 | } |
58 | 0 | if lut.output_table.have_discontinuities(output_entries, i) { |
59 | 0 | return true; |
60 | 0 | } |
61 | | } |
62 | | |
63 | 0 | false |
64 | | } |
65 | 0 | LutWarehouse::Multidimensional(mab) => { |
66 | 0 | for curve in mab.a_curves.iter() { |
67 | 0 | if curve.is_degenerated() { |
68 | 0 | return true; |
69 | 0 | } |
70 | 0 | if !curve.is_monotonic() { |
71 | 0 | return true; |
72 | 0 | } |
73 | 0 | if curve.have_discontinuities() { |
74 | 0 | return true; |
75 | 0 | } |
76 | | } |
77 | | |
78 | 0 | for curve in mab.m_curves.iter() { |
79 | 0 | if curve.is_degenerated() { |
80 | 0 | return true; |
81 | 0 | } |
82 | 0 | if !curve.is_monotonic() { |
83 | 0 | return true; |
84 | 0 | } |
85 | 0 | if curve.have_discontinuities() { |
86 | 0 | return true; |
87 | 0 | } |
88 | | } |
89 | | |
90 | 0 | for curve in mab.b_curves.iter() { |
91 | 0 | if curve.is_degenerated() { |
92 | 0 | return true; |
93 | 0 | } |
94 | 0 | if !curve.is_monotonic() { |
95 | 0 | return true; |
96 | 0 | } |
97 | 0 | if curve.have_discontinuities() { |
98 | 0 | return true; |
99 | 0 | } |
100 | | } |
101 | | |
102 | 0 | false |
103 | | } |
104 | | } |
105 | 0 | } |
106 | | } |