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