Page 2 of 2
Re: start at the end and go back in an array
Posted: Mon May 30, 2022 5:16 pm
by Otto
Silvio, is your program running if you start at the top and with ASCAN?
If yes, you could sort your array for a test only?
Best regards,
Otto
aRData := ASort( aData, nil, nil, { |x,y| x[ 1 ] > y[ 1 ] } )
xbrowse(aRData)
Re: start at the end and go back in an array
Posted: Mon May 30, 2022 6:26 pm
by Silvio.Falconi
I allready tried last week
ASort( aDataDbf ,,, {|x,y| x[2] > y[2] } ) because you must sort on date field
then using the Aeval but it not run ok , it result 9155 instead of 24
Code: Select all | Expand
Function Rit( aData, numero, nWheel,nRecord )
local nCount := 0
local nPos1,nPos2,nPos3,nPos4,nPos5
local bBlock,cond
nPos1 := ( nWheel - 1 ) * 5 + 3
nPos2 := ( nWheel - 1 ) * 5 + 4
nPos3 := ( nWheel - 1 ) * 5 + 5
nPos4 := ( nWheel - 1 ) * 5 + 6
nPos5 := ( nWheel - 1 ) * 5 + 7
AEval( aData, { |a| If( a[ nPos1 ] == numero .or. ;
a[ nPos2 ] == numero .or. ;
a[ nPos3 ] == numero .or. ;
a[ nPos4 ] == numero .or. ;
a[ nPos5 ] == numero , , ncount++ ) } )
return nCount
If you put
AEval( aData, { |a| If( a[ nPos1 ] == numero .or. ;
a[ nPos2 ] == numero .or. ;
a[ nPos3 ] == numero .or. ;
a[ nPos4 ] == numero .or. ;
a[ nPos5 ] == numero , ncount++, ) } )it result the frequency number not the delay !!!!
Re: start at the end and go back in an array
Posted: Mon May 30, 2022 6:39 pm
by Otto
Silvio,
What is the "delay"?
You use AEVAL but I think you should use ASCAN?
Best regards,
Otto
Re: start at the end and go back in an array
Posted: Mon May 30, 2022 10:38 pm
by Silvio.Falconi
We call "delay" of a lottery number the number of draws that have elapsed without that number coming out. A number has a delay of 1 if it just came out, a delay of 30 if it last came out 30 draws ago, and so on.
Re: start at the end and go back in an array
Posted: Wed Jun 01, 2022 11:40 am
by Silvio.Falconi
Found the solution
I Made it with For next cicle