2个不错的通配符比较函数

　2006-02-04 13:50:17　来源：WEB开发网　闂傚倸鍊搁崐鎼佸磹妞嬪孩顐芥慨姗嗗厳缂傛氨鎲稿鍫罕闂備礁婀遍搹搴ㄥ窗閺嶎偆涓嶆い鏍仦閻撱儵鏌ｉ弴鐐测偓鍦偓姘炬嫹

闂傚倸鍊搁崐鎼佸磹妞嬪海鐭嗗〒姘ｅ亾妤犵偛顦甸弫鎾绘偐閹绘帞鈧參姊哄Ч鍥х仼闁诲繑鑹鹃悾鐑藉蓟閵夛妇鍘甸梺瑙勵問閸犳牠銆傛總鍛婄厱閹艰揪绱曟牎闂侀潧娲ょ€氫即鐛幒妤€绠ｆ繝闈涘暙娴滈箖鏌ｉ姀鈶跺湱澹曟繝姘厵闁绘劦鍓氶悘杈ㄤ繆閹绘帞澧涚紒缁樼洴瀹曞崬螖閸愬啠鍓濈换娑樼暆婵犱胶鏁栫紓浣介哺閹瑰洤鐣烽幒鎴僵闁瑰吀鐒﹂悗鎼佹⒒娴ｇ儤鍤€闁搞倖鐗犻獮蹇涙晸閿燂拷

濠电姷鏁告慨鐑藉极閸涘﹥鍙忔い鎾卞灩缁狀垶鏌涢幇闈涙灈鐎瑰憡绻冮妵鍕箻鐎靛摜鐣奸梺纭咁潐濞茬喎顫忕紒妯肩懝闁逞屽墮宀ｈ儻顦查悡銈夋煏閸繃鍋繛宸簻鎯熼梺瀹犳〃閼冲爼宕濋敃鈧—鍐Χ閸℃鐟愰梺鐓庡暱閻栧ジ宕烘繝鍥у嵆闁靛骏绱曢崢顏堟⒑閹肩偛鍔楅柡鍛⊕缁傛帟顦寸紒杈ㄥ笚濞煎繘鍩℃担閿嬵潟闂備浇妗ㄩ悞锕傚箲閸ヮ剙鏋侀柟鍓х帛閺呮悂鏌ㄩ悤鍌涘闂傚倸鍊搁崐鎼佸磹妞嬪孩顐芥慨姗嗗厳缂傛氨鎲稿鍫罕闂備礁婀遍搹搴ㄥ窗閺嶎偆涓嶆い鏍仦閻撱儵鏌ｉ弴鐐测偓鍦偓姘炬嫹　　闂傚倸鍊搁崐鎼佸磹閻戣姤鍤勯柤鍝ユ暩娴犳氨绱撻崒娆掑厡缂侇噮鍨堕妴鍐川閺夋垹鍘洪悗骞垮劚椤︻垶宕￠幎鑺ョ厪闊洦娲栨牎闂佽瀵掗崜鐔奉潖閾忓湱纾兼俊顖氭惈椤秴顪冮妶鍡楀闁告鍥х叀濠㈣泛谩閻斿吋鐓ラ悗锝庡厴閸嬫挻绻濆顓涙嫼閻熸粎澧楃敮鎺撶娴煎瓨鐓曢柟鎯ь嚟閳藉鏌嶇紒妯荤叆妞ゎ偅绻堥幊婊呭枈濡顏归梻鍌欑閹诧紕绮欓幋锔哄亼闁哄鍨熼弸鏃堟煛閸愶絽浜剧紓浣虹帛缁嬫挻绂掗敃鍌氱＜婵﹩鍓﹂悗鎶芥⒒娴ｅ摜锛嶇紒顕呭灦楠炴垿宕堕鍌氱ウ闁诲函缍嗘禍鏍绩娴犲鐓欓梺顓ㄧ畱婢ь垱銇勯弬鍨偓瑙勭┍婵犲洦鍊锋い蹇撳閸嬫捇寮借濞兼牕鈹戦悩瀹犲闁稿被鍔庨幉姝岀疀濞戞ḿ鐤呴梺鍦檸閸犳寮查幖浣圭叆闁绘洖鍊圭€氾拷

核心提示：近日在和朋友讨论 MaskMatch 时偶得2个不错的算法，函数1 只支持'*','?'模糊匹配，2个不错的通配符比较函数，速度比采用递归算法的快近2倍，比TMask方法快很多，函数2 完全支持正规表达式，速度于之前的相同

近日在和朋友讨论 MaskMatch 时偶得2个不错的算法。
函数1 只支持'*','?'模糊匹配。速度比采用递归算法的快近2倍，比TMask方法快很多。
函数2 完全支持正规表达式。速度于之前的相同。(不会正规表达式的朋友慎用)

// ===========================
// Funtion 1
// ===========================

// Check if the string can match the wildcard. It can be used for unicode strings as well!
// C: 2004-07-24 | M: 2004-07-24
function MaskMatch(const aPattern, aSource: string): Boolean;
var
StringPtr, PatternPtr: PChar;
StringRes, PatternRes: PChar;
begin
Result := False;
StringPtr := PChar(UpperCase(aSource));
PatternPtr := PChar(UpperCase(aPattern));
StringRes := nil;
PatternRes := nil;
repeat
repeat // ohne vorangegangenes "*"
case PatternPtr^ of
#0 : begin
Result := StringPtr^ = #0;
if Result or (StringRes = nil) or (PatternRes = nil) then Exit;
StringPtr := StringRes;
PatternPtr := PatternRes;
Break;
end;
'*': begin
Inc(PatternPtr);
PatternRes := PatternPtr;
Break;
end;
'?': begin
if StringPtr^ = #0 then Exit;
Inc(StringPtr);
Inc(PatternPtr);
end;
else begin
if StringPtr^ = #0 then Exit;
if StringPtr^ <> PatternPtr^ then
begin
if (StringRes = nil) or (PatternRes = nil) then Exit;
StringPtr := StringRes;
PatternPtr := PatternRes;
Break;
end else
begin
Inc(StringPtr);
Inc(PatternPtr);
end;
end;
end;
until False;

repeat // mit vorangegangenem "*"
case PatternPtr^ of
#0 : begin
Result := True;
Exit;
end;
'*': begin
Inc(PatternPtr);
PatternRes := PatternPtr;
end;
'?': begin
if StringPtr^ = #0 then Exit;
Inc(StringPtr);
Inc(PatternPtr);
end;
else begin
repeat
if StringPtr^ = #0 then Exit;
if StringPtr^ = PatternPtr^ then Break;
Inc(StringPtr);
until False;
Inc(StringPtr);
StringRes := StringPtr;
Inc(PatternPtr);
Break;
end;
end;
until False;
until False;
end;

// ===========================
// Funtion 2
// ===========================

function _MatchPattern(aPattern, aSource: PChar): Boolean;
begin
Result := True;
while (True) do
begin
case aPattern[0] of
#0 : begin
//End of pattern reached.
Result := (aSource[0] = #0); //TRUE if end of aSource.
Exit;
end;

'*': begin //Match zero or more occurances of any char.
if (aPattern[1] = #0) then
begin
//Match any number of trailing chars.
Result := True;
Exit;
end else
Inc(aPattern);

while (aSource[0] <> #0) do
begin
//Try to match any substring of aSource.
if (_MatchPattern(aSource, aPattern)) then
begin
Result := True;
Exit;
end;

//Continue testing next char...
Inc(aSource);
end;
end;

'?': begin //Match any one char.
if (aSource[0] = #0) then
begin
Result := False;
Exit;
end;

//Continue testing next char...
Inc(aSource);
Inc(aPattern);
end;

'[': begin //Match given set of chars.
if (aPattern[1] in [#0,'[',']']) then
begin
//Invalid Set - So no match.
Result := False;
Exit;
end;

if (aPattern[1] = '^') then
begin
//Match for exclusion of given set...
Inc(aPattern, 2);
Result := True;
while (aPattern[0] <> ']') do
begin
if (aPattern[1] = '-') then
begin
//Match char exclusion range.
if (aSource[0] >= aPattern[0]) and (aSource[0] <= aPattern[2]) then
begin
//Given char failed set exclusion range.
Result := False;
Break;
end else
Inc(aPattern, 3);
end else
begin
//Match individual char exclusion.
if (aSource[0] = aPattern[0]) then
begin
//Given char failed set element exclusion.
Result := False;
Break;
end else
Inc(aPattern);
end;
end;
end else
begin
//Match for inclusion of given set...
Inc(aPattern);
Result := False;
while (aPattern[0] <> ']') do
begin
if (aPattern[1] = '-') then
begin
//Match char inclusion range.
if (aSource[0] >= aPattern[0]) and (aSource[0] <= aPattern[2]) then
begin
//Given char matched set range inclusion.
// Continue testing...
Result := True;
Break;
end else
Inc(aPattern, 3);
end else
begin
//Match individual char inclusion.
if (aSource[0] = aPattern[0]) then
begin
//Given char matched set element inclusion.
// Continue testing...
Result := True;
Break;
end else
Inc(aPattern);
end;
end;
end;

if (Result) then
begin
//Match was found. Continue further.
Inc(aSource);
//Position Pattern to char after "]"
while (aPattern[0] <> ']') and (aPattern[0] <> #0) do Inc(aPattern);
if (aPattern[0] = #0) then
begin
//Invalid Pattern - missing "]"
Result := False;
Exit;
end else
Inc(aPattern);
end else
Exit;
end;

else begin //Match given single char.
if (aSource[0] <> aPattern[0]) then
begin
Result := False;
Break;
end;

//Continue testing next char...
Inc(aSource);
Inc(aPattern);
end;
end;
end;
end;

function MatchPattern(const aPattern, aSource: string): Boolean;
begin
Result := _MatchPattern(PChar(aPattern), PChar(aSource));
end;