/* Copyright 2023 Philipp Wundrack Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. */ mod utils; use std::ops::{Add, Div, Mul, Sub}; use fast_arrays::{Array, Mask}; use utils::{get_random_bool_vec, get_random_f32_vec}; use rstest::rstest; #[rstest] #[case::add(Array::add_in_place, f32::add)] #[case::sub(Array::sub_in_place, f32::sub)] #[case::mul(Array::mul_in_place, f32::mul)] #[case::div(Array::div_in_place, f32::div)] #[case::max(Array::max_in_place, f32::max)] #[case::min(Array::min_in_place, f32::min)] fn in_place( #[case] test_function: fn(&mut Array<1>, &Array<1>), #[case] target_function: fn(f32, f32) -> f32, ) { for i in 0..64 { let data1 = get_random_f32_vec(0, i); let data2 = get_random_f32_vec(1, i); let mut array1: Array<1> = data1.clone().into(); let array2: Array<1> = data2.clone().into(); test_function(&mut array1, &array2); let result: Vec = array1.into(); for ((d1, d2), r) in data1.iter().zip(data2.iter()).zip(result.iter()) { assert_eq!(*r, target_function(*d1, *d2)); } } } #[rstest] #[case::add(Array::add_in_place)] #[case::sub(Array::sub_in_place)] #[case::mul(Array::mul_in_place)] #[case::div(Array::div_in_place)] #[case::max(Array::max_in_place)] #[case::min(Array::min_in_place)] #[should_panic] fn in_place_shape_mismatch(#[case] test_function: fn(&mut Array<1>, &Array<1>)) { let mut array1: Array<1> = get_random_f32_vec(0, 3).into(); let array2: Array<1> = get_random_f32_vec(1, 4).into(); let _ = test_function(&mut array1, &array2); } #[rstest] #[case::add(Array::add_in_place_masked, f32::add)] #[case::sub(Array::sub_in_place_masked, f32::sub)] #[case::mul(Array::mul_in_place_masked, f32::mul)] #[case::div(Array::div_in_place_masked, f32::div)] #[case::max(Array::max_in_place_masked, f32::max)] #[case::min(Array::min_in_place_masked, f32::min)] fn in_place_masked( #[case] test_function: fn(&mut Array<1>, &Array<1>, mask: &Mask<1>), #[case] target_function: fn(f32, f32) -> f32, ) { for i in 0..64 { let data1 = get_random_f32_vec(0, i); let data2 = get_random_f32_vec(1, i); let mut array1: Array<1> = data1.clone().into(); let array2: Array<1> = data2.clone().into(); let gt = array1.compare_greater_than(&array2); gt.assert_invariants_satisfied(); test_function(&mut array1, &array2, >); let result: Vec = array1.into(); for ((d1, d2), r) in data1.iter().zip(data2.iter()).zip(result.iter()) { if d1 > d2 { assert_eq!(*r, target_function(*d1, *d2)); } else { assert_eq!(*r, *d1); } } } } #[rstest] #[case::add(Array::add_in_place_masked)] #[case::sub(Array::sub_in_place_masked)] #[case::mul(Array::mul_in_place_masked)] #[case::div(Array::div_in_place_masked)] #[case::max(Array::max_in_place_masked)] #[case::min(Array::min_in_place_masked)] #[should_panic] fn in_place_masked_shape_mismatch(#[case] test_function: fn(&mut Array<1>, &Array<1>, &Mask<1>)) { let mut array1: Array<1> = get_random_f32_vec(0, 3).into(); let array2: Array<1> = get_random_f32_vec(1, 3).into(); let array3: Array<1> = get_random_f32_vec(0, 4).into(); let array4: Array<1> = get_random_f32_vec(1, 4).into(); let mask = array3.compare_greater_than(&array4); mask.assert_invariants_satisfied(); let _ = test_function(&mut array1, &array2, &mask); } #[rstest] #[case::add(Array::add, f32::add)] #[case::sub(Array::sub, f32::sub)] #[case::mul(Array::mul, f32::mul)] #[case::div(Array::div, f32::div)] #[case::max(Array::max, f32::max)] #[case::min(Array::min, f32::min)] fn out_of_place( #[case] test_function: fn(&Array<1>, &Array<1>) -> Array<1>, #[case] target_function: fn(f32, f32) -> f32, ) { for i in 0..64 { let data1 = get_random_f32_vec(0, i); let data2 = get_random_f32_vec(1, i); let array1: Array<1> = data1.clone().into(); let array2: Array<1> = data2.clone().into(); let result: Vec = test_function(&array1, &array2).into(); for ((d1, d2), r) in data1.iter().zip(data2.iter()).zip(result.iter()) { assert_eq!(*r, target_function(*d1, *d2)); } } } #[rstest] #[case::add(Array::add)] #[case::sub(Array::sub)] #[case::mul(Array::mul)] #[case::div(Array::div)] #[case::max(Array::max)] #[case::min(Array::min)] #[should_panic] fn out_of_place_shape_mismatch(#[case] test_function: fn(&Array<1>, &Array<1>) -> Array<1>) { let array1: Array<1> = get_random_f32_vec(0, 3).into(); let array2: Array<1> = get_random_f32_vec(1, 4).into(); let _ = test_function(&array1, &array2); } #[rstest] #[case::add(Array::add_scalar_in_place, f32::add)] #[case::sub(Array::sub_scalar_in_place, f32::sub)] #[case::mul(Array::mul_scalar_in_place, f32::mul)] #[case::div(Array::div_scalar_in_place, f32::div)] #[case::max(Array::max_scalar_in_place, f32::max)] #[case::min(Array::min_scalar_in_place, f32::min)] fn in_place_scalar( #[case] test_function: fn(&mut Array<1>, f32), #[case] target_function: fn(f32, f32) -> f32, ) { for i in 0..64 { let data1 = get_random_f32_vec(0, i); let scalar = 4.2f32; let mut array1: Array<1> = data1.clone().into(); test_function(&mut array1, scalar); let result: Vec = array1.into(); for (d, r) in data1.iter().zip(result.iter()) { assert_eq!(*r, target_function(*d, scalar)); } } } #[rstest] #[case::add(Array::add_scalar_in_place_masked, f32::add)] #[case::sub(Array::sub_scalar_in_place_masked, f32::sub)] #[case::mul(Array::mul_scalar_in_place_masked, f32::mul)] #[case::div(Array::div_scalar_in_place_masked, f32::div)] #[case::max(Array::max_scalar_in_place_masked, f32::max)] #[case::min(Array::min_scalar_in_place_masked, f32::min)] fn in_place_scalar_masked( #[case] test_function: fn(&mut Array<1>, f32, &Mask<1>), #[case] target_function: fn(f32, f32) -> f32, ) { for i in 0..64 { let data1 = get_random_f32_vec(0, i); let scalar = 4.2f32; let mut array1: Array<1> = data1.clone().into(); let array2 = Array::<1>::zeros(&[i]); let mask = array1.compare_greater_than(&array2); test_function(&mut array1, scalar, &mask); let result: Vec = array1.into(); for (d, r) in data1.iter().zip(result.iter()) { if *d > 0.0 { assert_eq!(*r, target_function(*d, scalar)); } else { assert_eq!(*r, *d); } } } } #[rstest] #[case::add(Array::add_scalar_in_place_masked)] #[case::sub(Array::sub_scalar_in_place_masked)] #[case::mul(Array::mul_scalar_in_place_masked)] #[case::div(Array::div_scalar_in_place_masked)] #[case::max(Array::max_scalar_in_place_masked)] #[case::min(Array::min_scalar_in_place_masked)] #[should_panic] fn in_place_scalar_masked_shape_mismatched( #[case] test_function: fn(&mut Array<1>, f32, &Mask<1>), ) { let mut array1: Array<1> = get_random_f32_vec(0, 3).into(); let mask: Mask<1> = get_random_bool_vec(0, 4).into(); let _ = test_function(&mut array1, 42.0, &mask); } #[rstest] #[case::add(Array::add_scalar, f32::add)] #[case::sub(Array::sub_scalar, f32::sub)] #[case::mul(Array::mul_scalar, f32::mul)] #[case::div(Array::div_scalar, f32::div)] #[case::max(Array::max_scalar, f32::max)] #[case::min(Array::min_scalar, f32::min)] fn out_of_place_scalar( #[case] test_function: fn(&Array<1>, f32) -> Array<1>, #[case] target_function: fn(f32, f32) -> f32, ) { for i in 0..64 { let data1 = get_random_f32_vec(0, i); let scalar = 4.2f32; let array1: Array<1> = data1.clone().into(); let result: Vec = test_function(&array1, scalar).into(); for (d, r) in data1.iter().zip(result.iter()) { assert_eq!(*r, target_function(*d, scalar)); } } }