I have used a binary search whenever it was possible. The search that I am currently trying to perform is on data that cannot be sorted. I need to do a calculation on data that is in the database to see if it meets the criteria. I cannot do any pre-calculations since I do not know what the search criteria will be beforehand.
My suspicion is that I am stuck with the linear search, but I was hoping that someone had come up with something clever. You could presumably bypass the database routines and index through the database, but that would probably be extremely dangerous. It would be very nice if the OS provided a routine to search the entire database for a match based on a user defined callback routine (such as is done for the sorting routines). Laurie "Steve Mann" <[EMAIL PROTECTED]> wrote in message news:79606@palm-dev-forum... > > At 1:56 PM -0500 3/12/02, Laurie Davis wrote: > > >I have successfully used DmFindSortPosition when looking for data > >that is sorted, but I > >cannot think of any way to speed up the search for other data. > > Why not use a binary search instead of a sequential one? > > Regards, > Steve Mann > > -- For information on using the Palm Developer Forums, or to unsubscribe, please see http://www.palmos.com/dev/support/forums/
