1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41

{*********** PosEx ***********}
function Posex(const substr,str:string; const startloc:integer):integer;
{Search for "substr" in "str" starting at "startloc" return 0 or the start
 postion where "substr" was found}
var
  i, j,k,ssLen, sLen, stop:integer;
  a:char;
begin
  result:=0;
  ssLen:=length(substr);
  slen:=length(str);
  stop:=slen-sslen+1; {highest feasible start location for substring}
  if (ssLen=0) or (sslen>sLen) then exit;
  a:=substr[1];  {1st letter of substr}
  i:=startloc; {start search location}
  while (i<=stop) and (result=0) do
  begin
    while (i<=stop) and (a<>str[i]) do inc(i); {find the 1st letter}
    if i<=stop then
    begin
      if sslen=1 then  result:=i {It was a 1 character search, so we're done}
      else
      begin
        j:=2;
        k:=i-1; {back "K" up by 1 so that we can use K+j as the index to the string}
        while (j<=sslen) do
        begin {compare the rest of the substring}
          if (substr[j]<>str[k+j]) then break
          else inc(j); {The letter matched, go to the next+
                   {When we pass the substring end, "while" loop will terminate}
        end;
        if (j>sslen) then
        begin
          result:=i;
          exit;
        end
        else inc(i); {that search failed, look for the next 1st letter match}
      end;
    end;
  end;
end;