moxcms/lut_hint.rs
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 */
29use crate::LutWarehouse;
30
31impl 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 #[cfg(feature = "any_to_any")]
35 pub(crate) fn is_katana_required(&self) -> bool {
36 match self {
37 LutWarehouse::Lut(lut) => {
38 let input_entries = lut.num_input_channels as usize;
39 let output_entries = lut.num_output_channels as usize;
40 for i in 0..input_entries {
41 if lut.input_table.is_degenerated(input_entries, i) {
42 return true;
43 }
44 if !lut.input_table.is_monotonic(input_entries, i) {
45 return true;
46 }
47 if lut.input_table.have_discontinuities(input_entries, i) {
48 return true;
49 }
50 }
51
52 for i in 0..output_entries {
53 if lut.output_table.is_degenerated(output_entries, i) {
54 return true;
55 }
56 if !lut.output_table.is_monotonic(output_entries, i) {
57 return true;
58 }
59 if lut.output_table.have_discontinuities(output_entries, i) {
60 return true;
61 }
62 }
63
64 false
65 }
66 LutWarehouse::Multidimensional(mab) => {
67 for curve in mab.a_curves.iter() {
68 if curve.is_degenerated() {
69 return true;
70 }
71 if !curve.is_monotonic() {
72 return true;
73 }
74 if curve.have_discontinuities() {
75 return true;
76 }
77 }
78
79 for curve in mab.m_curves.iter() {
80 if curve.is_degenerated() {
81 return true;
82 }
83 if !curve.is_monotonic() {
84 return true;
85 }
86 if curve.have_discontinuities() {
87 return true;
88 }
89 }
90
91 for curve in mab.b_curves.iter() {
92 if curve.is_degenerated() {
93 return true;
94 }
95 if !curve.is_monotonic() {
96 return true;
97 }
98 if curve.have_discontinuities() {
99 return true;
100 }
101 }
102
103 false
104 }
105 }
106 }
107}