Nestharus
o-o
- Reaction score
- 83
Added a quickstart guide to getting Lua into a map since a lot of people are struggling with that =).
/cry> Perhaps, but it'd be an incredible hassle to change it... going through the demo map changing all refs to it, updating two threads... >.<
Change it along with anything else you change in the next update. It's obviously not a high priority issue. You'll need to update the system at some point though.
Anyway, approved. I'll also change the prefix to [System]. Demo maps are something slightly different.
I thought you wanted me to change the SPACE -> DELIMITER at some point, even if no other update was planned =P.You'll need to update the system at some point though.
From Scrambler thread on THWWere you able to maintain a 0.45-0.5 p-value
As the data set increases in value or decreases in value, the average increases/decreases in value. Because of this, lower values are weighted on one side and higher values are weighted on another side with medium values in the center. This is the reason why this fails the runs test with large numbers of data.
This behavior is to be expected and is actually desirable for this =).
Within a local area of 20 or 80, the data is very even as the data set isn't large enough to cause this effect.
So given a number, you can expect it to fall within a specific range. The larger the number, the bigger the range it can fall in. As save/load codes are very large, the effect that takes away from the randomness will take much longer to occur (I was dealing with a very small value of 65536), meaning that this will pretty much generate a random number given a number.
To give you an idea of the range for larger numbers, 65536 goes between around 4500 and 1.2 million.
Nah, I don't like to split code up into two posts. That's just something I don't do ^)^. It makes it very difficult to update the post, harder cnp, and harder for users to read.
function CatalogAddCatalog takes integer y, integer b returns nothing
local integer z = w
loop
if (not f[y].boolean.has(p<b>)) then
set z = z + 1
set p[z] = p<b>
set f[y].boolean[p<b>] = true
set e[l[y]] = z
set l[y] = z
endif
set b = e<b>
exitwhen b == 0
endloop
set w = z
endfunction</b></b></b></b>