× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.


  1.  Home
  2. RPG400-L
  3. August 2006

Re: Bsearch for closest match

Jon, may i ask a generic question here? In the search of a typical array, under 1000 elements, done repeatedly, are there reasons to look for major performance improvements? Are there performance improvements that are useful?
I have always thought that these lookups were pretty darn fast anyway, so that chasing improvements was like standing on a stepladder to get closer to the moon? 



Jon Paris wrote:

 >> I always though that lookup does not work for dynamic array.  I'll test
it out again.

The old LOOKUP op-code was not viable because it wanted to search all of the
elements defined in the DIM.  %LOOKUP however allows you to specify not just
the starting point but also the end point for the search - so it can be
used.

I'm not certain - but I don't think %Lookup will do a binary search when you
use %LookupGE - in which case it will perform at the speed of the old LOOKUP
op-code (i.e. slowly)

Jon Paris
Partner400
www.Partner400.com

As an Amazon Associate we earn from qualifying purchases.

This thread ...
Follow-Ups:
Replies:
Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.