Re:

["James W. Kilgore" <eMail@xxxxxxxxxxxxxxxxxxx>]

Jon,

You bring up a good point.  Although the getFromArray was the fastest
method tested, Nathan might have been getting the first entry with each
evocation.

Getting the middle entry with a binary search may change the results of
the test a bit.

BTW, Nathan: when I spoke of putting the file in memory I was thinking
more of using the SETOBJACC (Set Object Access) which acts like the old
RAM disk and still using CHAIN to read it.

Jon.Paris@hal.it wrote:
> 
>  >> getFromArray() - uses LOOKUP to retrieve from an array
> 
> I wouldn't mind betting that if you used the C function bsearch (or coded
> your own binary search routine) you could cut the run time of this option
> significantly.  Unless they have changed the compiler, LOOKUP is not
> exactly efficient.  This assumes that the array is in sequence of course.
> 
> +---
> | This is the Midrange System Mailing List!
> | To submit a new message, send your mail to MIDRANGE-L@midrange.com.
> | To subscribe to this list send email to MIDRANGE-L-SUB@midrange.com.
> | To unsubscribe from this list send email to MIDRANGE-L-UNSUB@midrange.com.
> | Questions should be directed to the list owner/operator: david@midrange.com
> +---
+---
| This is the Midrange System Mailing List!
| To submit a new message, send your mail to MIDRANGE-L@midrange.com.
| To subscribe to this list send email to MIDRANGE-L-SUB@midrange.com.
| To unsubscribe from this list send email to MIDRANGE-L-UNSUB@midrange.com.
| Questions should be directed to the list owner/operator: david@midrange.com
+---