| 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::matan::is_curve_ascending; |
| 30 |
|
| 31 |
/// Finds out if curve is monotonic. |
| 32 |
pub(crate) fn is_curve_monotonic<T: PartialOrd>(lut: &[T]) -> bool { |
| 33 |
if lut.len() < 2 { |
| 34 |
return true; |
| 35 |
} |
| 36 |
let is_ascending = is_curve_ascending(lut); |
| 37 |
let mut violations = 0usize; |
| 38 |
if is_ascending { |
| 39 |
for (current, previous) in lut.iter().skip(1).zip(lut.iter().take(lut.len() - 1)) { |
| 40 |
if current.lt(previous) { |
| 41 |
violations += 1; |
| 42 |
} |
| 43 |
} |
| 44 |
} else { |
| 45 |
for (current, previous) in lut.iter().skip(1).zip(lut.iter().take(lut.len() - 1)) { |
| 46 |
if current.gt(previous) { |
| 47 |
violations += 1; |
| 48 |
} |
| 49 |
} |
| 50 |
} |
| 51 |
(violations as f64 / lut.len() as f64) < 0.05 |
| 52 |
} |