|
<![CDATA[
function search( pat: PATTERN; text: TEXT ): integer;
var i, j, m, n: integer;
found: boolean;
begin
m := length(pat);
if m = 0 then search := 1
else begin
n := length(text); search := 0;
j := 1; i := 1; found := FALSE;
while not found and (i <= n-m+1) do begin
if pat = substr( text, i, m ) then begin
search := i; found := TRUE; end;
i := i + 1;
end;
end;
end;
]]> |
Pascal source (711b.srch.p) 