/*

 * Copyright (c) Radzivon Bartoshyk, 10/2024. All rights reserved.

 *

 * Redistribution and use in source and binary forms, with or without modification,

 * are permitted provided that the following conditions are met:

 *

 * 1.  Redistributions of source code must retain the above copyright notice, this

 * list of conditions and the following disclaimer.

 *

 * 2.  Redistributions in binary form must reproduce the above copyright notice,

 * this list of conditions and the following disclaimer in the documentation

 * and/or other materials provided with the distribution.

 *

 * 3.  Neither the name of the copyright holder nor the names of its

 * contributors may be used to endorse or promote products derived from

 * this software without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"

 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE

 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE

 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL

 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR

 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER

 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,

 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE

 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

 */

use crate::filter_weights::{FilterBounds, FilterWeights};

use crate::math::{ConstPI, ConstSqrt2, Jinc};

use crate::sampler::ResamplingFunction;

use num_traits::{AsPrimitive, Float, Signed};

use std::fmt::Debug;

use std::ops::{AddAssign, Div, MulAssign, Neg};

pub(crate) fn generate_weights<T>(

    function: ResamplingFunction,

    in_size: usize,

    out_size: usize,

) -> FilterWeights<T>

where

    T: Copy

        + Neg

        + Signed

        + Float

        + 'static

        + ConstPI

        + MulAssign<T>

        + AddAssign<T>

        + AsPrimitive<f64>

        + AsPrimitive<i64>

        + AsPrimitive<usize>

        + Jinc<T>

        + ConstSqrt2

        + Default

        + AsPrimitive<i32>

        + Div<T, Output = T>

        + Debug,

    f32: AsPrimitive<T>,

    f64: AsPrimitive<T>,

    i64: AsPrimitive<T>,

    i32: AsPrimitive<T>,

    usize: AsPrimitive<T>,

{

    let resampling_filter = function.get_resampling_filter();

    let scale = in_size.as_() / out_size.as_();

    let is_resizable_kernel = resampling_filter.is_resizable_kernel;

    let filter_scale_cutoff = match is_resizable_kernel {

        true => scale.max(1f32.as_()),

        false => 1f32.as_(),

    };

    let filter_base_size = resampling_filter.min_kernel_size * 2.;

    let resampling_function = resampling_filter.kernel;

    let window_func = resampling_filter.window;

    let mut bounds: Vec<FilterBounds> = vec![FilterBounds::new(0, 0); out_size];

    let is_area = resampling_filter.is_area_filter && scale < 1.as_();

    if !is_area {

        let base_size: usize = (filter_base_size.as_() * filter_scale_cutoff).round().as_();

        let kernel_size = base_size;

        let filter_radius = base_size.as_() / 2.as_();

        let filter_scale = 1f32.as_() / filter_scale_cutoff;

        let mut weights: Vec<T> = vec![T::default(); kernel_size * out_size];

        let mut local_filters = vec![T::default(); kernel_size];

        let mut filter_position = 0usize;

        let blur_scale = match window_func {

            None => 1f32.as_(),

            Some(window) => {

                if window.blur.as_() > 0f32.as_() {

                    1f32.as_() / window.blur.as_()

                } else {

                    0f32.as_()

                }

            }

        };

        for (i, bound) in bounds.iter_mut().enumerate() {

            let center_x = ((i.as_() + 0.5.as_()) * scale).min(in_size.as_());

            let mut weights_sum: T = 0f32.as_();

            let start: usize = (center_x - filter_radius).floor().max(0f32.as_()).as_();

            let end: usize = (center_x + filter_radius)

                .ceil()

                .min(in_size.as_())

                .min(start.as_() + kernel_size.as_())

                .as_();

            let center = center_x - 0.5.as_();

            for (local_filter_iteration, k) in (start..end).enumerate() {

                let dx = k.as_() - center;

                let weight;

                if let Some(resampling_window) = window_func {

                    let mut x = dx.abs();

                    x = if resampling_window.blur.as_() > 0f32.as_() {

                        x * blur_scale

                    } else {

                        x

                    };

                    x = if x <= resampling_window.taper.as_() {

                        0f32.as_()

                    } else {

                        (x - resampling_window.taper.as_())

                            / (1f32.as_() - resampling_window.taper.as_())

                    };

                    let window_producer = resampling_window.window;

                    let x_kernel_scaled = x * filter_scale;

                    let window = if x < resampling_window.window_size.as_() {

                        window_producer(x_kernel_scaled * resampling_window.window_size.as_())

                    } else {

                        0f32.as_()

                    };

                    weight = window * resampling_function(x_kernel_scaled);

                } else {

                    let dx = dx.abs();

                    weight = resampling_function(dx * filter_scale);

                }

                weights_sum += weight;

                local_filters[local_filter_iteration] = weight;

            }

            let size = end - start;

            *bound = FilterBounds::new(start, size);

            if weights_sum != 0f32.as_() {

                let recpeq = 1f32.as_() / weights_sum;

                for (dst, src) in weights

                    .iter_mut()

                    .skip(filter_position)

                    .take(size)

                    .zip(local_filters.iter().take(size))

                {

                    *dst = *src * recpeq;

                }

            }

            filter_position += kernel_size;

        }

        FilterWeights::<T>::new(

            weights,

            kernel_size,

            kernel_size,

            out_size,

            filter_radius.as_(),

            bounds,

        )

    } else {

        // Simulating INTER_AREA from OpenCV, for up scaling here,

        // this is necessary because weight computation is different

        // from any other func

        let inv_scale: T = 1.as_() / scale;

        let kernel_size = 2;

        let filter_radius: T = 1.as_();

        let mut weights: Vec<T> = vec![T::default(); kernel_size * out_size];

        let mut local_filters = vec![T::default(); kernel_size];

        let mut filter_position = 0usize;

        for (i, bound) in bounds.iter_mut().enumerate() {

            let mut weights_sum: T = 0f32.as_();

            let sx: T = (i.as_() * scale).floor();

            let fx = (i as i64 + 1).as_() - (sx + 1.as_()) * inv_scale;

            let dx = if fx <= 0.as_() {

                0.as_()

            } else {

                fx - fx.floor()

            };

            let dx = dx.abs();

            let weight0 = 1.as_() - dx;

            let weight1: T = dx;

            local_filters[0] = weight0;

            local_filters[1] = weight1;

            let start: usize = sx.floor().max(0f32.as_()).as_();

            let end: usize = (sx + kernel_size.as_())

                .ceil()

                .min(in_size.as_())

                .min(start.as_() + kernel_size.as_())

                .as_();

            let size = end - start;

            weights_sum += weight0;

            if size > 1 {

                weights_sum += weight1;

            }

            *bound = FilterBounds::new(start, size);

            if weights_sum != 0f32.as_() {

                let recpeq = 1f32.as_() / weights_sum;

                for (dst, src) in weights

                    .iter_mut()

                    .skip(filter_position)

                    .take(size)

                    .zip(local_filters.iter().take(size))

                {

                    *dst = *src * recpeq;

                }

            } else {

                weights[filter_position] = 1.as_();

            }

            filter_position += kernel_size;

        }

        FilterWeights::new(

            weights,

            kernel_size,

            kernel_size,

            out_size,

            filter_radius.as_(),

            bounds,

        )

    }

}