mirror of
https://github.com/softwaredevelop/mql5.git
synced 2026-07-27 20:47:44 +00:00
276 lines
9.8 KiB
Plaintext
276 lines
9.8 KiB
Plaintext
//+------------------------------------------------------------------+
|
|
//| Laguerre_Engine.mqh |
|
|
//| Copyright 2026, xxxxxxxx|
|
|
//+------------------------------------------------------------------+
|
|
#property copyright "Copyright 2026, xxxxxxxx"
|
|
#property version "1.31" // Implemented strict chronological array safeguards on dynamic resizes
|
|
|
|
#ifndef LAGUERRE_ENGINE_MQH
|
|
#define LAGUERRE_ENGINE_MQH
|
|
|
|
#include <MyIncludes\HeikinAshi_Tools.mqh>
|
|
|
|
enum ENUM_INPUT_SOURCE { SOURCE_PRICE, SOURCE_MOMENTUM };
|
|
|
|
//+==================================================================+
|
|
//| CLASS: CLaguerreEngine |
|
|
//+==================================================================+
|
|
class CLaguerreEngine
|
|
{
|
|
protected:
|
|
double m_gamma;
|
|
ENUM_INPUT_SOURCE m_source_type;
|
|
|
|
//--- Persistent Buffers for Incremental Calculation
|
|
double m_price[];
|
|
double m_L0[], m_L1[], m_L2[], m_L3[]; // Internal state buffers
|
|
|
|
virtual bool PreparePriceSeries(int rates_total, int start_index, ENUM_APPLIED_PRICE price_type, const double &open[], const double &high[], const double &low[], const double &close[]);
|
|
|
|
public:
|
|
CLaguerreEngine(void) {};
|
|
virtual ~CLaguerreEngine(void) {};
|
|
|
|
bool Init(double gamma, ENUM_INPUT_SOURCE source_type);
|
|
|
|
void CalculateFilter(int rates_total, int prev_calculated, ENUM_APPLIED_PRICE price_type, const double &open[], const double &high[], const double &low[], const double &close[],
|
|
double &filt_buffer[]);
|
|
|
|
void GetPriceBuffer(double &dest_array[]);
|
|
|
|
//--- Zero-copy inline price getter (Eliminates deep-copy performance bottleneck)
|
|
double GetPrice(int index) const { return m_price[index]; }
|
|
|
|
//--- Accessors for internal state buffers (Needed for Laguerre RSI)
|
|
void GetLBuffers(double &l0[], double &l1[], double &l2[], double &l3[]);
|
|
};
|
|
|
|
//+------------------------------------------------------------------+
|
|
//| Init |
|
|
//+------------------------------------------------------------------+
|
|
bool CLaguerreEngine::Init(double gamma, ENUM_INPUT_SOURCE source_type)
|
|
{
|
|
m_gamma = fmax(0.0, fmin(1.0, gamma));
|
|
m_source_type = source_type;
|
|
return true;
|
|
}
|
|
|
|
//+------------------------------------------------------------------+
|
|
//| Get Price Buffer (Helper for FIR filter) |
|
|
//+------------------------------------------------------------------+
|
|
void CLaguerreEngine::GetPriceBuffer(double &dest_array[])
|
|
{
|
|
int size = ArraySize(m_price);
|
|
if(size > 0)
|
|
{
|
|
ArrayResize(dest_array, size);
|
|
ArrayCopy(dest_array, m_price, 0, 0, size);
|
|
}
|
|
}
|
|
|
|
//+------------------------------------------------------------------+
|
|
//| Get Internal L Buffers |
|
|
//+------------------------------------------------------------------+
|
|
void CLaguerreEngine::GetLBuffers(double &l0[], double &l1[], double &l2[], double &l3[])
|
|
{
|
|
int size = ArraySize(m_L0);
|
|
if(size > 0)
|
|
{
|
|
ArrayResize(l0, size);
|
|
ArrayCopy(l0, m_L0, 0, 0, size);
|
|
ArrayResize(l1, size);
|
|
ArrayCopy(l1, m_L1, 0, 0, size);
|
|
ArrayResize(l2, size);
|
|
ArrayCopy(l2, m_L2, 0, 0, size);
|
|
ArrayResize(l3, size);
|
|
ArrayCopy(l3, m_L3, 0, 0, size);
|
|
}
|
|
}
|
|
|
|
//+------------------------------------------------------------------+
|
|
//| Main Calculation (Optimized) |
|
|
//+------------------------------------------------------------------+
|
|
void CLaguerreEngine::CalculateFilter(int rates_total, int prev_calculated, ENUM_APPLIED_PRICE price_type, const double &open[], const double &high[], const double &low[], const double &close[],
|
|
double &filt_buffer[])
|
|
{
|
|
if(rates_total < 2)
|
|
return;
|
|
|
|
//--- 1. Determine Start Index
|
|
int start_index;
|
|
if(prev_calculated == 0)
|
|
start_index = 0;
|
|
else
|
|
start_index = prev_calculated - 1;
|
|
|
|
//--- 2. Resize Internal Buffers & coerce strict chronological indexing (false) on resize
|
|
if(ArraySize(m_price) != rates_total)
|
|
{
|
|
ArrayResize(m_price, rates_total);
|
|
ArrayResize(m_L0, rates_total);
|
|
ArrayResize(m_L1, rates_total);
|
|
ArrayResize(m_L2, rates_total);
|
|
ArrayResize(m_L3, rates_total);
|
|
|
|
ArraySetAsSeries(m_price, false);
|
|
ArraySetAsSeries(m_L0, false);
|
|
ArraySetAsSeries(m_L1, false);
|
|
ArraySetAsSeries(m_L2, false);
|
|
ArraySetAsSeries(m_L3, false);
|
|
}
|
|
|
|
// Resize output buffer if provided
|
|
if(ArraySize(filt_buffer) != rates_total)
|
|
ArrayResize(filt_buffer, rates_total);
|
|
|
|
//--- 3. Prepare Price (Optimized)
|
|
if(!PreparePriceSeries(rates_total, start_index, price_type, open, high, low, close))
|
|
return;
|
|
|
|
//--- 4. Calculate Laguerre Filter
|
|
int i = start_index;
|
|
|
|
if(i == 0)
|
|
{
|
|
m_L0[0] = m_price[0];
|
|
m_L1[0] = m_price[0];
|
|
m_L2[0] = m_price[0];
|
|
m_L3[0] = m_price[0];
|
|
filt_buffer[0] = (m_L0[0] + 2.0 * m_L1[0] + 2.0 * m_L2[0] + m_L3[0]) / 6.0;
|
|
i = 1;
|
|
}
|
|
|
|
for(; i < rates_total; i++)
|
|
{
|
|
// Recursive calculation uses [i-1] from persistent buffers
|
|
double L0_prev = m_L0[i-1];
|
|
double L1_prev = m_L1[i-1];
|
|
double L2_prev = m_L2[i-1];
|
|
double L3_prev = m_L3[i-1];
|
|
|
|
m_L0[i] = (1.0 - m_gamma) * m_price[i] + m_gamma * L0_prev;
|
|
m_L1[i] = -m_gamma * m_L0[i] + L0_prev + m_gamma * L1_prev;
|
|
m_L2[i] = -m_gamma * m_L1[i] + L1_prev + m_gamma * L2_prev;
|
|
m_L3[i] = -m_gamma * m_L2[i] + L2_prev + m_gamma * L3_prev;
|
|
|
|
filt_buffer[i] = (m_L0[i] + 2.0 * m_L1[i] + 2.0 * m_L2[i] + m_L3[i]) / 6.0;
|
|
}
|
|
}
|
|
|
|
//+------------------------------------------------------------------+
|
|
//| Prepare Price (Standard - Optimized) |
|
|
//+------------------------------------------------------------------+
|
|
bool CLaguerreEngine::PreparePriceSeries(int rates_total, int start_index, ENUM_APPLIED_PRICE price_type, const double &open[], const double &high[], const double &low[], const double &close[])
|
|
{
|
|
for(int i = start_index; i < rates_total; i++)
|
|
{
|
|
if(m_source_type == SOURCE_PRICE)
|
|
{
|
|
switch(price_type)
|
|
{
|
|
case PRICE_OPEN:
|
|
m_price[i] = open[i];
|
|
break;
|
|
case PRICE_HIGH:
|
|
m_price[i] = high[i];
|
|
break;
|
|
case PRICE_LOW:
|
|
m_price[i] = low[i];
|
|
break;
|
|
case PRICE_MEDIAN:
|
|
m_price[i] = (high[i]+low[i])/2.0;
|
|
break;
|
|
case PRICE_TYPICAL:
|
|
m_price[i] = (high[i]+low[i]+close[i])/3.0;
|
|
break;
|
|
case PRICE_WEIGHTED:
|
|
m_price[i] = (high[i]+low[i]+2.0*close[i])/4.0;
|
|
break;
|
|
default:
|
|
m_price[i] = close[i];
|
|
break;
|
|
}
|
|
}
|
|
else // SOURCE_MOMENTUM
|
|
{
|
|
m_price[i] = close[i] - open[i];
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
//+==================================================================+
|
|
//| CLASS 2: CLaguerreEngine_HA (Heikin Ashi) |
|
|
//+==================================================================+
|
|
class CLaguerreEngine_HA : public CLaguerreEngine
|
|
{
|
|
private:
|
|
CHeikinAshi_Calculator m_ha_calculator;
|
|
double m_ha_open[], m_ha_high[], m_ha_low[], m_ha_close[];
|
|
|
|
protected:
|
|
virtual bool PreparePriceSeries(int rates_total, int start_index, ENUM_APPLIED_PRICE price_type, const double &open[], const double &high[], const double &low[], const double &close[]) override;
|
|
};
|
|
|
|
//+------------------------------------------------------------------+
|
|
//| Prepare Price (Heikin Ashi - Optimized) |
|
|
//+------------------------------------------------------------------+
|
|
bool CLaguerreEngine_HA::PreparePriceSeries(int rates_total, int start_index, ENUM_APPLIED_PRICE price_type, const double &open[], const double &high[], const double &low[], const double &close[])
|
|
{
|
|
// Resize internal HA buffers & coerce chronological indexing
|
|
if(ArraySize(m_ha_open) != rates_total)
|
|
{
|
|
ArrayResize(m_ha_open, rates_total);
|
|
ArrayResize(m_ha_high, rates_total);
|
|
ArrayResize(m_ha_low, rates_total);
|
|
ArrayResize(m_ha_close, rates_total);
|
|
|
|
ArraySetAsSeries(m_ha_open, false);
|
|
ArraySetAsSeries(m_ha_high, false);
|
|
ArraySetAsSeries(m_ha_low, false);
|
|
ArraySetAsSeries(m_ha_close, false);
|
|
}
|
|
|
|
m_ha_calculator.Calculate(rates_total, start_index, open, high, low, close,
|
|
m_ha_open, m_ha_high, m_ha_low, m_ha_close);
|
|
|
|
for(int i = start_index; i < rates_total; i++)
|
|
{
|
|
if(m_source_type == SOURCE_PRICE)
|
|
{
|
|
switch(price_type)
|
|
{
|
|
case PRICE_OPEN:
|
|
m_price[i] = m_ha_open[i];
|
|
break;
|
|
case PRICE_HIGH:
|
|
m_price[i] = m_ha_high[i];
|
|
break;
|
|
case PRICE_LOW:
|
|
m_price[i] = m_ha_low[i];
|
|
break;
|
|
case PRICE_MEDIAN:
|
|
m_price[i] = (m_ha_high[i]+m_ha_low[i])/2.0;
|
|
break;
|
|
case PRICE_TYPICAL:
|
|
m_price[i] = (m_ha_high[i]+m_ha_low[i]+m_ha_close[i])/3.0;
|
|
break;
|
|
case PRICE_WEIGHTED:
|
|
m_price[i] = (m_ha_high[i]+m_ha_low[i]+2.0*m_ha_close[i])/4.0;
|
|
break;
|
|
default:
|
|
m_price[i] = m_ha_close[i];
|
|
break;
|
|
}
|
|
}
|
|
else // SOURCE_MOMENTUM
|
|
{
|
|
m_price[i] = m_ha_close[i] - m_ha_open[i];
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
#endif // LAGUERRE_ENGINE_MQH
|
|
//+------------------------------------------------------------------+
|