/* 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
 *  -------------------------------------------------------------------
 *  031202 MF   Template creation.
 *  052603 MF   Port to managed C++. Change to use CIRCBUF macros.
 *  061704 MF   Lower limit for period to 2, and correct algorithm
 *              to avoid cummulative error when value are close to
 *              the floating point epsilon.
 */

// 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::cci`]: the number of leading input values consumed before the
    /// first output value can be produced.
    ///
    /// # Arguments
    ///
    /// * `optInTimePeriod` — Number of bars in the averaging/deviation window (default 14, range
    ///   2..=100000)
    ///
    /// Returns `usize::MAX` when a parameter is out of range. Integer parameters accept `i32::MIN`
    /// to select their default value.
    #[inline]
    pub fn cci_lookback(&self, mut optInTimePeriod: i32) -> usize {
        if ((optInTimePeriod) as i32) == (i32::MIN) {
            optInTimePeriod = 14;
        } else if (((optInTimePeriod) as i32) < 2) || (((optInTimePeriod) as i32) > 100000) {
            return usize::MAX;
        }
        return (optInTimePeriod - 1) as usize;
    }
    /// Commodity Channel Index: measures the current typical price relative to its simple moving
    /// average, scaled by mean absolute deviation. Momentum oscillator flagging overbought/oversold
    /// extremes. CCI > +100 overbought; CCI \< -100 oversold.
    ///
    /// # Formula
    ///
    /// ```text
    /// TP_i = (High_i + Low_i + Close_i)/3
    /// SMA = (1/N) * sum(TP over N bars)
    /// meanDev = (1/N) * sum(|TP - SMA| over N bars)
    /// CCI = (TP_last - SMA) / (0.015 * meanDev)
    /// ```
    ///
    /// # Arguments
    ///
    /// * `startIdx` — Start index of the requested calculation range.
    /// * `endIdx` — End index of the requested calculation range (inclusive).
    /// * `inHigh` — High prices per bar.
    /// * `inLow` — Low prices per bar.
    /// * `inClose` — Close prices per bar.
    /// * `optInTimePeriod` — Number of bars in the averaging/deviation window (default 14, range
    ///   2..=100000)
    /// * `outBegIdx` — Set to the input index of the first output value.
    /// * `outNBElement` — Set to the number of output values written.
    /// * `outReal` — CCI value per bar.
    ///
    /// 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 high: Vec<f64> = (0..252).map(|i| 101.0 + 10.0 * (0.1 * i as f64).sin()).collect();
    /// let low: Vec<f64> = (0..252).map(|i| 99.0 + 10.0 * (0.1 * i as f64).sin()).collect();
    /// let close: 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.cci(
    ///     0, high.len() - 1, &high, &low, &close, 14,
    ///     &mut out_beg, &mut out_nb, &mut out,
    /// );
    /// assert_eq!(ret, RetCode::Success);
    /// assert!(out_nb > 0);
    /// ```
    ///
    /// # See also
    ///
    /// [`Core::typprice`] · [`Core::sma`]
    ///
    /// # References
    ///
    /// * Donald Lambert
    ///
    /// Further reading: [ta-lib.org/functions/cci](https://ta-lib.org/functions/cci/)
    #[doc(alias = "CommodityChannelIndex")]
    pub fn cci(
        &self,
        startIdx: usize,
        endIdx: usize,
        inHigh: &[f64],
        inLow: &[f64],
        inClose: &[f64],
        mut optInTimePeriod: i32,
        outBegIdx: &mut usize,
        outNBElement: &mut usize,
        outReal: &mut [f64],
    ) -> RetCode {
        if endIdx < startIdx {
            return RetCode::OutOfRangeStartIndex;
        }
        if ((optInTimePeriod) as i32) == (i32::MIN) {
            optInTimePeriod = 14;
        } else if (((optInTimePeriod) as i32) < 2) || (((optInTimePeriod) as i32) > 100000) {
            return RetCode::BadParam;
        }
        let mut startIdx = startIdx;
        let mut tempReal: f64 = 0.0_f64;
        let mut tempReal2: f64 = 0.0_f64;
        let mut theAverage: f64 = 0.0_f64;
        let mut lastValue: f64 = 0.0_f64;
        let mut i: usize = 0_usize;
        let mut j: usize = 0_usize;
        let mut outIdx: usize = 0_usize;
        let mut lookbackTotal: usize = 0_usize;
        let mut circBuffer: Vec<f64> = Vec::new();
        let mut circBuffer_Idx: usize = 0;
        let mut maxIdx_circBuffer: usize = 29;
        // This ptr will points on a circular buffer of
        // at least "optInTimePeriod" element.
        // Identify the minimum number of price bar needed
        // to calculate at least one output.
        lookbackTotal = (optInTimePeriod - 1) as usize;
        // Move up the start index if there is not
        // enough initial data.
        if startIdx < lookbackTotal {
            startIdx = lookbackTotal;
        }
        // Make sure there is still something to evaluate.
        if startIdx > endIdx {
            (*outBegIdx) = 0;
            (*outNBElement) = 0;
            return RetCode::Success;
        }
        // Allocate a circular buffer equal to the requested
        // period.
        if optInTimePeriod < 1 { return RetCode::AllocErr; }
        circBuffer = vec![0.0_f64; (optInTimePeriod) as usize];
        maxIdx_circBuffer = ((optInTimePeriod) as usize) - 1;
        circBuffer_Idx = 0;
        // Do the MA calculation using tight loops.
        // Add-up the initial period, except for the last value.
        // Fill up the circular buffer at the same time.
        i = startIdx - lookbackTotal;
        if optInTimePeriod > 1 {
            while i < startIdx {
                circBuffer[circBuffer_Idx] = (inHigh[i] + inLow[i] + inClose[i]) / 3_f64;
                i += 1;
                circBuffer_Idx += 1;
                if circBuffer_Idx > maxIdx_circBuffer { circBuffer_Idx = 0; }
            }
        }
        // Proceed with the calculation for the requested range.
        // Note that this algorithm allows the inReal and
        // outReal to be the same buffer.
        outIdx = 0;
        loop {
            lastValue = (inHigh[i] + inLow[i] + inClose[i]) / 3_f64;
            circBuffer[circBuffer_Idx] = lastValue;
            // Calculate the average for the whole period.
            theAverage = 0.0;
            // for( j = 0; j < (optInTimePeriod) as usize; j += 1 )
            j = 0;
            while j < (optInTimePeriod) as usize {
                theAverage += circBuffer[j];
                j += 1;
            }
            theAverage /= ((optInTimePeriod) as f64);
            // Do the summation of the ABS(TypePrice-average)
            // for the whole period.
            tempReal2 = 0.0;
            // for( j = 0; j < (optInTimePeriod) as usize; j += 1 )
            j = 0;
            while j < (optInTimePeriod) as usize {
                tempReal2 += (circBuffer[j] - theAverage).abs();
                j += 1;
            }
            // And finally, the CCI...
            tempReal = lastValue - theAverage;
            if tempReal != 0.0 && tempReal2 != 0.0 {
                outReal[outIdx] = tempReal / (0.015 * (tempReal2 / ((optInTimePeriod) as f64)));
                outIdx += 1;
            } else {
                outReal[outIdx] = 0.0;
                outIdx += 1;
            }
            // Move forward the circular buffer indexes.
            circBuffer_Idx += 1;
            if circBuffer_Idx > maxIdx_circBuffer { circBuffer_Idx = 0; }
            i += 1;
            if !(i <= endIdx) { break; }
        }
        // All done. Indicate the output limits and return.
        (*outNBElement) = outIdx;
        (*outBegIdx) = startIdx;
        // Free the circular buffer if it was dynamically allocated.
        return RetCode::Success;
    }
    /// Unchecked variant of [`Core::cci`], used for internal cross-indicator calls.
    ///
    /// Skips parameter validation and uses unchecked indexing internally. Every argument must
    /// satisfy the constraints documented on [`Core::cci`]; 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::cci`].
    #[inline]
    pub fn cci_unguarded(
        &self,
        mut startIdx: usize,
        endIdx: usize,
        inHigh: &[f64],
        inLow: &[f64],
        inClose: &[f64],
        mut optInTimePeriod: i32,
        outBegIdx: &mut usize,
        outNBElement: &mut usize,
        outReal: &mut [f64],
    ) -> RetCode {
        let mut tempReal: f64 = 0.0_f64;
        let mut tempReal2: f64 = 0.0_f64;
        let mut theAverage: f64 = 0.0_f64;
        let mut lastValue: f64 = 0.0_f64;
        let mut i: usize = 0_usize;
        let mut j: usize = 0_usize;
        let mut outIdx: usize = 0_usize;
        let mut lookbackTotal: usize = 0_usize;
        let mut circBuffer: Vec<f64> = Vec::new();
        let mut circBuffer_Idx: usize = 0;
        let mut maxIdx_circBuffer: usize = 29;
        unsafe {
        assert!(endIdx < inHigh.len());
        assert!(endIdx < inLow.len());
        assert!(endIdx < inClose.len());
        let _assertLb = self.cci_lookback(optInTimePeriod);
        let _assertStart = if startIdx > _assertLb { startIdx } else { _assertLb };
        assert!(_assertStart > endIdx || endIdx - _assertStart < outReal.len());
        lookbackTotal = (optInTimePeriod - 1) as usize;
        if startIdx < lookbackTotal {
            startIdx = lookbackTotal;
        }
        if startIdx > endIdx {
            (*outBegIdx) = 0;
            (*outNBElement) = 0;
            return RetCode::Success;
        }
        if optInTimePeriod < 1 { return RetCode::AllocErr; }
        circBuffer = vec![0.0_f64; (optInTimePeriod) as usize];
        maxIdx_circBuffer = ((optInTimePeriod) as usize) - 1;
        circBuffer_Idx = 0;
        i = startIdx - lookbackTotal;
        if optInTimePeriod > 1 {
            while i < startIdx {
                *circBuffer.as_mut_ptr().add(circBuffer_Idx) = (*inHigh.as_ptr().add(i) + *inLow.as_ptr().add(i) + *inClose.as_ptr().add(i)) / 3_f64;
                i += 1;
                circBuffer_Idx += 1;
                if circBuffer_Idx > maxIdx_circBuffer { circBuffer_Idx = 0; }
            }
        }
        outIdx = 0;
        loop {
            lastValue = (*inHigh.as_ptr().add(i) + *inLow.as_ptr().add(i) + *inClose.as_ptr().add(i)) / 3_f64;
            *circBuffer.as_mut_ptr().add(circBuffer_Idx) = lastValue;
            theAverage = 0.0;
            // for( j = 0; j < (optInTimePeriod) as usize; j += 1 )
            j = 0;
            while j < (optInTimePeriod) as usize {
                theAverage += *circBuffer.as_ptr().add(j);
                j += 1;
            }
            theAverage /= ((optInTimePeriod) as f64);
            tempReal2 = 0.0;
            // for( j = 0; j < (optInTimePeriod) as usize; j += 1 )
            j = 0;
            while j < (optInTimePeriod) as usize {
                tempReal2 += (*circBuffer.as_ptr().add(j) - theAverage).abs();
                j += 1;
            }
            tempReal = lastValue - theAverage;
            if tempReal != 0.0 && tempReal2 != 0.0 {
                *outReal.as_mut_ptr().add(outIdx) = tempReal / (0.015 * (tempReal2 / ((optInTimePeriod) as f64)));
                outIdx += 1;
            } else {
                *outReal.as_mut_ptr().add(outIdx) = 0.0;
                outIdx += 1;
            }
            circBuffer_Idx += 1;
            if circBuffer_Idx > maxIdx_circBuffer { circBuffer_Idx = 0; }
            i += 1;
            if !(i <= endIdx) { break; }
        }
        (*outNBElement) = outIdx;
        (*outBegIdx) = startIdx;
        return RetCode::Success;
        } // unsafe
    }
}
/***************/
/* End of File */
/***************/
