/* TA-LIB Copyright (c) 1999-2025, Mario Fortier
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or
 * without modification, are permitted provided that the following
 * conditions are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 *
 * - 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.
 *
 * - Neither name of author 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
 * REGENTS 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.
 */

/* Important:
 *  This file is automatically generated by the utility ta_codegen.
 *  Any modifications will be lost on next execution of ta_codegen.
 *
 *  Modifications should instead be done with the "C" source file
 *  in ta-lib\src\ta_func
 */

/* List of contributors:
 *
 *  Initial  Name/description
 *  -------------------------------------------------------------------
 *  MF       Mario Fortier
 *
 *
 * Change history:
 *
 *  MMDDYY BY   Description
 *  -------------------------------------------------------------------
 *  112400 MF   Template creation.
 *  022203 MF   Add MAMA
 *  040503 MF   Add T3
 *  052603 MF   Adapt code to compile with .NET Managed C++
 *  111603 MF   Allow period of 1. Just copy input into output.
 *  060907 MF   Use TA_SMA/TA_EMA instead of internal implementation.
 */

// Import types from parent module
use super::*;

// Allow non-snake-case names to maintain TA-Lib API compatibility
#[allow(non_snake_case)]
#[allow(unused_variables)]
#[allow(dead_code)]
#[allow(unused_mut)]
#[allow(unused_assignments)]
impl Core {
    /// Lookback period for [`Core::ma`]: the number of leading input values consumed before the
    /// first output value can be produced.
    ///
    /// # Arguments
    ///
    /// * `optInTimePeriod` — Averaging window length (default 30, range 1..=100000)
    /// * `optInMAType` — Which moving-average algorithm to dispatch to (default 0 = SMA, values:
    ///   0=SMA, 1=EMA, 2=WMA, 3=DEMA, 4=TEMA, 5=TRIMA, 6=KAMA, 7=MAMA, 8=T3)
    ///
    /// Returns `usize::MAX` when a parameter is out of range. Integer parameters accept `i32::MIN`
    /// to select their default value.
    #[inline]
    pub fn ma_lookback(&self, mut optInTimePeriod: i32, mut optInMAType: i32) -> usize {
        if ((optInTimePeriod) as i32) == (i32::MIN) {
            optInTimePeriod = 30;
        } else if (((optInTimePeriod) as i32) < 1) || (((optInTimePeriod) as i32) > 100000) {
            return usize::MAX;
        }
        let mut retValue: usize = 0_usize;
        if optInTimePeriod <= 1 {
            return (0) as usize;
        }
        match optInMAType {
            0 => {
                retValue = self.sma_lookback(optInTimePeriod);
            }
            1 => {
                retValue = self.ema_lookback(optInTimePeriod);
            }
            2 => {
                retValue = self.wma_lookback(optInTimePeriod);
            }
            3 => {
                retValue = self.dema_lookback(optInTimePeriod);
            }
            4 => {
                retValue = self.tema_lookback(optInTimePeriod);
            }
            5 => {
                retValue = self.trima_lookback(optInTimePeriod);
            }
            6 => {
                retValue = self.kama_lookback(optInTimePeriod);
            }
            7 => {
                retValue = self.mama_lookback(0.5, 0.05);
            }
            8 => {
                retValue = self.t3_lookback(optInTimePeriod, 0.7);
            }
            _ => {
                retValue = 0;
            }
        }
        return retValue;
    }
    /// Generic moving-average dispatcher that forwards the job to a concrete MA implementation
    /// selected by optInMAType. Single uniform interface over all TA-Lib moving averages.
    ///
    /// # Formula
    ///
    /// ```text
    /// outReal = MA_of_type(optInMAType)(inReal, optInTimePeriod); default type = SMA
    /// ```
    ///
    /// # Notes
    ///
    /// * A period of 1 performs no smoothing for every MAType: the output is a copy of the input.
    ///
    /// # Arguments
    ///
    /// * `startIdx` — Start index of the requested calculation range.
    /// * `endIdx` — End index of the requested calculation range (inclusive).
    /// * `inReal` — Series to average.
    /// * `optInTimePeriod` — Averaging window length (default 30, range 1..=100000)
    /// * `optInMAType` — Which moving-average algorithm to dispatch to (default 0 = SMA, values:
    ///   0=SMA, 1=EMA, 2=WMA, 3=DEMA, 4=TEMA, 5=TRIMA, 6=KAMA, 7=MAMA, 8=T3)
    /// * `outBegIdx` — Set to the input index of the first output value.
    /// * `outNBElement` — Set to the number of output values written.
    /// * `outReal` — Selected moving average of the input.
    ///
    /// Integer parameters accept `i32::MIN` to select their default value.
    ///
    /// # Errors
    ///
    /// Returns [`RetCode::OutOfRangeStartIndex`] when `endIdx < startIdx`, and
    /// [`RetCode::BadParam`] when an optional parameter is outside its documented range.
    ///
    /// # Panics
    ///
    /// Input slices must cover `startIdx..=endIdx` and output slices must hold the number of values
    /// produced for that range: undersized slices panic or, for functions that forward to unchecked
    /// internals, cause undefined behavior. Sizing every output slice to the input length is always
    /// sufficient.
    ///
    /// # Examples
    ///
    /// ```
    /// use ta_lib::{Core, RetCode};
    ///
    /// let data: Vec<f64> = (0..252).map(|i| 100.0 + 10.0 * (0.1 * i as f64).sin()).collect();
    ///
    /// let core = Core::new();
    /// let mut out_beg = 0;
    /// let mut out_nb = 0;
    /// let mut out = vec![0.0; 252];
    ///
    /// let ret = core.ma(0, data.len() - 1, &data, 30, 0, &mut out_beg, &mut out_nb, &mut out);
    /// assert_eq!(ret, RetCode::Success);
    /// assert!(out_nb > 0);
    /// ```
    ///
    /// # See also
    ///
    /// [`Core::sma`] · [`Core::ema`] · [`Core::wma`] · [`Core::dema`] · [`Core::tema`] ·
    /// [`Core::trima`] · [`Core::kama`] · [`Core::mama`] · [`Core::t3`]
    ///
    /// Further reading: [ta-lib.org/functions/ma](https://ta-lib.org/functions/ma/)
    #[doc(alias = "MovingAverage")]
    pub fn ma(
        &self,
        startIdx: usize,
        endIdx: usize,
        inReal: &[f64],
        mut optInTimePeriod: i32,
        mut optInMAType: i32,
        outBegIdx: &mut usize,
        outNBElement: &mut usize,
        outReal: &mut [f64],
    ) -> RetCode {
        if endIdx < startIdx {
            return RetCode::OutOfRangeStartIndex;
        }
        if ((optInTimePeriod) as i32) == (i32::MIN) {
            optInTimePeriod = 30;
        } else if (((optInTimePeriod) as i32) < 1) || (((optInTimePeriod) as i32) > 100000) {
            return RetCode::BadParam;
        }
        let mut startIdx = startIdx;
        let mut dummyBuffer: Vec<f64> = Vec::new();
        let mut retCode: RetCode = RetCode::Success;
        let mut nbElement: usize = 0_usize;
        let mut outIdx: usize = 0_usize;
        let mut todayIdx: usize = 0_usize;
        if optInTimePeriod == 1 {
            nbElement = endIdx - startIdx + 1;
            (*outNBElement) = nbElement;
            // for( todayIdx = startIdx, outIdx = 0; outIdx < nbElement; outIdx += 1, todayIdx += 1 )
            todayIdx = startIdx;
            outIdx = 0;
            while outIdx < nbElement {
                outReal[outIdx] = ((inReal[todayIdx]) as f64);
                outIdx += 1;
                todayIdx += 1;
            }
            (*outBegIdx) = startIdx;
            return RetCode::Success;
        }
        // Simply forward the job to the corresponding TA function.
        match optInMAType {
            0 => {
                retCode = self.sma_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            1 => {
                retCode = self.ema_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            2 => {
                retCode = self.wma_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            3 => {
                retCode = self.dema_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            4 => {
                retCode = self.tema_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            5 => {
                retCode = self.trima_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            6 => {
                retCode = self.kama_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            7 => {
                // The optInTimePeriod is ignored and the FAMA output of the MAMA
                // is ignored.
                dummyBuffer = vec![0.0_f64; ((endIdx - startIdx + 1) * 1) as usize];
                retCode = self.mama_unguarded(startIdx, endIdx, inReal, 0.5, 0.05, outBegIdx, outNBElement, outReal, &mut dummyBuffer[..]);
            }
            8 => {
                retCode = self.t3_unguarded(startIdx, endIdx, inReal, optInTimePeriod, 0.7, outBegIdx, outNBElement, outReal);
            }
            _ => {
                retCode = RetCode::BadParam;
            }
        }
        return retCode;
    }
    /// Unchecked variant of [`Core::ma`], used for internal cross-indicator calls.
    ///
    /// Skips parameter validation and uses unchecked indexing internally. Every argument must
    /// satisfy the constraints documented on [`Core::ma`]; an out-of-range parameter, an input
    /// slice not covering `startIdx..=endIdx`, or an undersized output slice may panic or cause
    /// undefined behavior. Prefer [`Core::ma`].
    #[inline]
    pub fn ma_unguarded(
        &self,
        mut startIdx: usize,
        endIdx: usize,
        inReal: &[f64],
        mut optInTimePeriod: i32,
        mut optInMAType: i32,
        outBegIdx: &mut usize,
        outNBElement: &mut usize,
        outReal: &mut [f64],
    ) -> RetCode {
        let mut dummyBuffer: Vec<f64> = Vec::new();
        let mut retCode: RetCode = RetCode::Success;
        let mut nbElement: usize = 0_usize;
        let mut outIdx: usize = 0_usize;
        let mut todayIdx: usize = 0_usize;
        unsafe {
        assert!(endIdx < inReal.len());
        let _assertLb = self.ma_lookback(optInTimePeriod, optInMAType);
        let _assertStart = if startIdx > _assertLb { startIdx } else { _assertLb };
        assert!(_assertStart > endIdx || endIdx - _assertStart < outReal.len());
        if optInTimePeriod == 1 {
            nbElement = endIdx - startIdx + 1;
            (*outNBElement) = nbElement;
            // for( todayIdx = startIdx, outIdx = 0; outIdx < nbElement; outIdx += 1, todayIdx += 1 )
            todayIdx = startIdx;
            outIdx = 0;
            while outIdx < nbElement {
                *outReal.as_mut_ptr().add(outIdx) = ((*inReal.as_ptr().add(todayIdx)) as f64);
                outIdx += 1;
                todayIdx += 1;
            }
            (*outBegIdx) = startIdx;
            return RetCode::Success;
        }
        match optInMAType {
            0 => {
                retCode = self.sma_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            1 => {
                retCode = self.ema_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            2 => {
                retCode = self.wma_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            3 => {
                retCode = self.dema_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            4 => {
                retCode = self.tema_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            5 => {
                retCode = self.trima_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            6 => {
                retCode = self.kama_unguarded(startIdx, endIdx, inReal, optInTimePeriod, outBegIdx, outNBElement, outReal);
            }
            7 => {
                dummyBuffer = vec![0.0_f64; ((endIdx - startIdx + 1) * 1) as usize];
                retCode = self.mama_unguarded(startIdx, endIdx, inReal, 0.5, 0.05, outBegIdx, outNBElement, outReal, &mut dummyBuffer[..]);
            }
            8 => {
                retCode = self.t3_unguarded(startIdx, endIdx, inReal, optInTimePeriod, 0.7, outBegIdx, outNBElement, outReal);
            }
            _ => {
                retCode = RetCode::BadParam;
            }
        }
        return retCode;
        } // unsafe
    }
}
/***************/
/* End of File */
/***************/
