Making Revolution faster with really big arrays

[Mark Brownell]

On Tuesday, April 12, 2005, at 07:25 PM, 
use-revolution-request at lists.runrev.com wrote:

> I might be able to suffer with the
> chunk specification for the line#, then use a repeat for each item and
> put 2500 items in an array.  That way I will only need 2500 array items
> at any one time instead of 125,000,000 array items per data file.  But
> I will still have to put 125,000,000 items into array elements and then
> read them back out again once per data pass.  Perhaps 10-100 times
> slower than an "access" keyword instead of 1000-10,000 times slower.  I
> will do some sample tests and see what I come up with.
>
> Dennis

Dennis,

I once used the split function to create almost instant arrays based on 
1, 2, 3, etc... as the locations created by the split, ( I call them 
locations because I'm an old Director user.) This process could work 
well when you put "2500 items in an array." The split function creates 
the array without a loop process.

Mark