@Nicolas, page 15 of this topic presents a black screen. This is how the topic “don’t know what happened, but this was the ‘Array Post'” emerged (a continuation of the original topic).
I am now responding to page 14 – maybe that recovers page 15. But if not, I will post it in that 2nd topic (see below). And in that case ? can the Array Topic be repaired ?
@Nicolas, page 15 of this topic (see 2nd pic) presents a black screen. This is how the topic “don’t know what happened, but this was the ‘Array Post'” emerged (a continuation of the original topic).
I am now responding to page 14 – maybe that recovers page 15. But if not, I will post it in that 2nd topic (see below). And in that case ? can the Array Topic be repaired ?
… so it did not work out. See the 2nd pic below for the topic which is stuck.
Recovering historical values of an array.
Compared to normal variables, arrays don’t create their historical values at the end of bar but retain their current value.
Using simple maths:
A + B = C , which can be transposed to , C – A = B or C – B = A
Also, A – B = D which is the difference between A and B.
Looking at the sequence of events, the first formula, takes value A then adds value B, which results in C.
The transposed formula, take the result , C and subtracts either A or B which gets the missing value.
Looking closer at this sequence, you could say the later value C, requires an earlier value, A or B, to find the missing value.
So applying that to arrays, arr[0] =10, needs the value prior to it which could be store in arr-1[0] = 6.
Therefore, arr[0] – arr-1[0] = 10 – 6 = 4 the difference is the missing value, A – B = D.
Looking at the history values of 1 element, with original values in arr.
See table 1.
res = arr-arr-1 gives the difference between the current and prior value, A – B = D.
Instead of storing the original values, we store the sum of the values. Which is like adding the difference between new and current value. Therefore D – B = A or C – B = A if your following.
Here, D is the accumulated value and B is the prior accumulated value.
Doing this, encodes the original data values or information. In normal array operation, the current value, is lost when the original element values get overwritten. Or to put it another way, originally we have A = C where A and C don’t retain any information from the earlier values as they go forward and just represents the new value.
Looking at the history values of 1 element, with an accumulated value in arr.
See table 2.
Note: the difference value of Res=arr-arr-1 is now the same as the original arr values.
Magic…
Using the two arrays, along with the accumulative values, allows, not only to find a specific prior value of an array, but depending on the range of element index for both arrays chosen, you can get a summed value over a range of array elements.
A few things to point out,
Using the barindex value for the array index, aligns the arrays with respect to the chart bars, which is helpful when trying to look-back to recover values. This also means that the arrays need to be updated each bar to keep the alignment.
Now the above is the Rule and I’m sure there could be exception to it, depending on application, type of data, and context.
In simple example, the look-back value is retrieved from both CLOSE[LB] and from the arrays.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
// avoid changing text value
defparamdrawonlastbaronly=true
// avoid look-back beyond bar 0
ifbarindex>0then
// copy last bars arr value to arrM1
$arrM1[barindex]=$arr[barindex-1]
else
$arrM1[0]=-1// define array by assigning a default value
endif
// new arr value accumulated
$arr[barindex]=$arrM1[barindex]+close
// on current bar, look-back LB bars and recover the close value
I was nicely confusing myself there. Plus I was addressing you, Roberto, while it should have been Nicolas.
I guess part of the confusion springs from the fact that that picture is still there in this other topic, plus that druby now (implicitly) links to the topic over here (a few posts back).
To help us continually offer you the best experience on ProRealCode, we use cookies. By clicking on "Continue" you are agreeing to our use of them. You can also check our "privacy policy" page for more information.Continue
.
