>>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...

I haven't tested this particular question. For sure, ALINES() is way faster for parsing a string than anything else. (Here's my most recent article on the subject: http://www.tomorrowssolutionsllc.com/Articles/Breaking%20Up%20is%20Not%20Hard%20to%20Do.pdf.) But it's possible that searching the result could outweigh that advantage.

Tamar