>>OK - just wanted to make the point that RegEx does not crash, does not need an extra UCase(), and is very quick
>
>The regular process executes in a fraction of a second. This is why we do not have any justification to grab 0.001 millisecond more by re-engineering this process and retro to test. That specific process is something that is presently being fixed at a higher level, and as a security measure, will be verified at my level as well just to make we do not try to process such file because there is no point in doing so in the way the application works.


Ok, instead of

 n = Occurs(....)
  for I = 1 to n
      xx = At(...., I)
  end

Consider writing an overload of Occurs which returns a List< int > with all the indexes where there's a match. That way you wouldn't need At() any more