Hi Marvin,

as Mike said, there can be situations when locate will use rushmore and be faster. OTOH, even if there is a usable index, go top will be faster if recno() 1 is allowed by the current filter: all the rushmore processing, which can be timeconsuming as well, can be skipped. But what if the record you are looking for sits on reccount()-3 in a 1.5 GB table ?

I've done quite a bit of perf optimizing, and in fpw/vfp you have to think a lot more about possible influencing factors: this gives you as a developer more tools to get it right and fast, but also ways to cripple the app. The key is to analyze the situation and then pick the right commands: I can build scenarios where locate is faster and scenarios where seek-scan works better.

my 2 cent (EUR)

thomas