diff --git a/Include/MyIncludes/StochasticSlow_Calculator.mqh b/Include/MyIncludes/StochasticSlow_Calculator.mqh index f2286dd..bfa8db4 100644 --- a/Include/MyIncludes/StochasticSlow_Calculator.mqh +++ b/Include/MyIncludes/StochasticSlow_Calculator.mqh @@ -1,6 +1,6 @@ //+------------------------------------------------------------------+ //| StochasticSlow_Calculator.mqh| -//| Calculation engine for Standard and Heikin Ashi Slow Stochastic. | +//| VERSION 1.20: Optimized for incremental calculation. | //| Copyright 2025, xxxxxxxx | //+------------------------------------------------------------------+ #property copyright "Copyright 2025, xxxxxxxx" @@ -8,33 +8,37 @@ #include //+==================================================================+ -//| | //| CLASS 1: CStochasticSlowCalculator (Base Class) | -//| | //+==================================================================+ class CStochasticSlowCalculator { protected: int m_k_period, m_d_period, m_slowing_period; ENUM_MA_METHOD m_slowing_ma_type, m_d_ma_type; + + //--- Persistent Buffers for Incremental Calculation double m_src_high[], m_src_low[], m_src_close[]; + double m_raw_k[]; // Stores Fast %K double Highest(int period, int current_pos); double Lowest(int period, int current_pos); - virtual bool PrepareSourceData(int rates_total, const double &open[], const double &high[], const double &low[], const double &close[]); + //--- Updated: Accepts start_index + virtual bool PrepareSourceData(int rates_total, int start_index, const double &open[], const double &high[], const double &low[], const double &close[]); public: CStochasticSlowCalculator(void) {}; virtual ~CStochasticSlowCalculator(void) {}; bool Init(int k_p, int slow_p, ENUM_MA_METHOD slow_ma, int d_p, ENUM_MA_METHOD d_ma); - void Calculate(int rates_total, const double &open[], const double &high[], const double &low[], const double &close[], + + //--- Updated: Accepts prev_calculated + void Calculate(int rates_total, int prev_calculated, const double &open[], const double &high[], const double &low[], const double &close[], double &k_buffer[], double &d_buffer[]); }; //+------------------------------------------------------------------+ -//| CStochasticSlowCalculator: Initialization | +//| Init | //+------------------------------------------------------------------+ bool CStochasticSlowCalculator::Init(int k_p, int slow_p, ENUM_MA_METHOD slow_ma, int d_p, ENUM_MA_METHOD d_ma) { @@ -47,34 +51,54 @@ bool CStochasticSlowCalculator::Init(int k_p, int slow_p, ENUM_MA_METHOD slow_ma } //+------------------------------------------------------------------+ -//| CStochasticSlowCalculator: Main Calculation Method (Shared Logic)| +//| Main Calculation (Optimized) | //+------------------------------------------------------------------+ -void CStochasticSlowCalculator::Calculate(int rates_total, const double &open[], const double &high[], const double &low[], const double &close[], +void CStochasticSlowCalculator::Calculate(int rates_total, int prev_calculated, const double &open[], const double &high[], const double &low[], const double &close[], double &k_buffer[], double &d_buffer[]) { if(rates_total <= m_k_period + m_slowing_period + m_d_period) return; - if(!PrepareSourceData(rates_total, open, high, low, close)) + +//--- 1. Determine Start Index + int start_index; + if(prev_calculated == 0) + start_index = 0; + else + start_index = prev_calculated - 1; + +//--- 2. Resize Buffers + if(ArraySize(m_src_high) != rates_total) + { + ArrayResize(m_src_high, rates_total); + ArrayResize(m_src_low, rates_total); + ArrayResize(m_src_close, rates_total); + ArrayResize(m_raw_k, rates_total); + } + +//--- 3. Prepare Source Data (Optimized) + if(!PrepareSourceData(rates_total, start_index, open, high, low, close)) return; - double raw_k[]; - ArrayResize(raw_k, rates_total); +//--- 4. Calculate Raw %K (Fast %K) + int loop_start_k = MathMax(m_k_period - 1, start_index); -//--- STEP 1: Calculate Raw %K (Fast %K) - for(int i = m_k_period - 1; i < rates_total; i++) + for(int i = loop_start_k; i < rates_total; i++) { double highest_h = Highest(m_k_period, i); double lowest_l = Lowest(m_k_period, i); double range = highest_h - lowest_l; + if(range > 0) - raw_k[i] = (m_src_close[i] - lowest_l) / range * 100.0; + m_raw_k[i] = (m_src_close[i] - lowest_l) / range * 100.0; else - raw_k[i] = (i > 0) ? raw_k[i-1] : 50.0; + m_raw_k[i] = (i > 0) ? m_raw_k[i-1] : 50.0; } -//--- STEP 2: Calculate Slow %K (Main Line) by smoothing Raw %K +//--- 5. Calculate Slow %K (Main Line) int k_slow_start = m_k_period + m_slowing_period - 2; - for(int i = k_slow_start; i < rates_total; i++) + int loop_start_slow = MathMax(k_slow_start, start_index); + + for(int i = loop_start_slow; i < rates_total; i++) { switch(m_slowing_ma_type) { @@ -84,7 +108,7 @@ void CStochasticSlowCalculator::Calculate(int rates_total, const double &open[], { double sum=0; for(int j=0; j0) k_buffer[i]=sum/w_sum;} + {double sum=0,w_sum=0; for(int j=0; j0) k_buffer[i]=sum/w_sum;} break; default: - {double sum=0; for(int j=0; j