Any questions from newcomers on MQL4 and MQL5, help and discussion on algorithms and codes - page 1317

You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
Greetings All ! Thank you all in advance !
Bug of this type:
There is a line Low_D1_Level relative to which we are looking in arrayBar_data_D1 [][6]; new levelMin_D_Level
//---global variables
double_D1_Level;
double Bar_data_D1 [][6]; //copies bar data of the specified chart into the array and returns number of copied D1 bars
The first dimension of the array contains the number of bars. The second dimension has 6 elements with the values:
0 - time,
1 - open price,
2 - lowest price (low),
3 - highest price (high),
4 - close price (close),
5 - volume.
Print Print
Please help.
I've tried everything and still get error 130.
Everything works for me, no errors
In the strategy tester, run from 2016.12.15.
It works for me, no errors
Run the optimisation. Optimisation is interrupted by a CriticalError message
Please help.
I've tried everything and still get error 130.
from the fact sheet
I don't understand, where does the loop end?
It's supposed to be the last element of the array. No?
And then do a check for inequality
Then there will be no surprises of going outside the arrayStart the optimisation. Optimisation is interrupted by the message CriticalError
No errors, with optimisation from 01.12.2016 to today
if you would like to go to https://www.mql5.com/ru/forum/357558
it's all there in detail
I don't understand, where does the loop end?
It's supposed to be the last element of the array. No?
And then do a check for inequality.
Then there won't be any surprises outside the arrayExcuse me, where does the loop end?
It's supposed to be the last element of the array. No?
And then do a check for inequality.
Then there will be no surprises of going outside the arrayOkay, I got it. I'll try it right now.
Thank you!