gavindiaz/mql5
1
0
Fork 0
mirror of https://github.com/softwaredevelop/mql5.git synced 2026-08-23 09:18:05 +00:00
Code Issues Packages Projects Releases Wiki Activity

refactor: PreparePriceSeries

Browse Source
This commit is contained in:
Toh4iem9
2025-10-29 21:53:33 +01:00
parent 826ebadb4e
commit 1264d71377
1 changed files with 44 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Include/MyIncludes/Ehlers_Smoother_Lab_Calculator.mqh
+44 -4
View File
@@ -197,9 +197,29 @@ bool CSmootherLabCalculator::PreparePriceSeries(int rates_total, ENUM_APPLIED_PR
case PRICE_CLOSE: case PRICE_CLOSE:
ArrayCopy(m_price, close, 0, 0, rates_total); ArrayCopy(m_price, close, 0, 0, rates_total);
break; break;
default: case PRICE_OPEN:
ArrayCopy(m_price, close, 0, 0, rates_total); ArrayCopy(m_price, open, 0, 0, rates_total);
break; break;
case PRICE_HIGH:
ArrayCopy(m_price, high, 0, 0, rates_total);
break;
case PRICE_LOW:
ArrayCopy(m_price, low, 0, 0, rates_total);
break;
case PRICE_MEDIAN:
for(int i=0; i<rates_total; i++)
m_price[i] = (high[i]+low[i])/2.0;
break;
case PRICE_TYPICAL:
for(int i=0; i<rates_total; i++)
m_price[i] = (high[i]+low[i]+close[i])/3.0;
break;
case PRICE_WEIGHTED:
for(int i=0; i<rates_total; i++)
m_price[i] = (high[i]+low[i]+close[i]+close[i])/4.0;
break;
default:
return false;
} }
return true; return true;
} }
@@ -230,9 +250,29 @@ bool CSmootherLabCalculator_HA::PreparePriceSeries(int rates_total, ENUM_APPLIED
case PRICE_CLOSE: case PRICE_CLOSE:
ArrayCopy(m_price, ha_close, 0, 0, rates_total); ArrayCopy(m_price, ha_close, 0, 0, rates_total);
break; break;
default: case PRICE_OPEN:
ArrayCopy(m_price, ha_close, 0, 0, rates_total); ArrayCopy(m_price, ha_open, 0, 0, rates_total);
break; break;
case PRICE_HIGH:
ArrayCopy(m_price, ha_high, 0, 0, rates_total);
break;
case PRICE_LOW:
ArrayCopy(m_price, ha_low, 0, 0, rates_total);
break;
case PRICE_MEDIAN:
for(int i=0; i<rates_total; i++)
m_price[i] = (ha_high[i]+ha_low[i])/2.0;
break;
case PRICE_TYPICAL:
for(int i=0; i<rates_total; i++)
m_price[i] = (ha_high[i]+ha_low[i]+ha_close[i])/3.0;
break;
case PRICE_WEIGHTED:
for(int i=0; i<rates_total; i++)
m_price[i] = (ha_high[i]+ha_low[i]+ha_close[i]+ha_close[i])/4.0;
break;
default:
return false;
} }
return true; return true;
} }