>I recommend using ALINES() to break your string up and then ASCAN() to search. I think it's much cleaner and suspect it will be much faster.


Long time ago (FPW times, 486/P I cpus) I moved a ASCAN-logic to string searching similar to Naomis approach in a large opimization task - string search back then was much faster than ASCAN and a testwise implemented binary search (done in .prg, not in a .fll) on a sorted array. No idea if newer runtimes and current cpu architecture change that...