Efficient String Matching Algorithm with Use of Wildcard Characters
The text of this article is not in this database — only its details are. The old site it was published on is gone, but the Internet Archive kept a copy: Efficient String Matching Algorithm with Use of Wildcard Characters
9 Comments
Join the conversation! Your thoughts help the community grow.
Sign in to leave a comment
It is the same account you read, post and publish with — and you will come straight back to this page.
Mohammed ChowdhuryPosted Aug 15, 2017, 9:39 AM
I don't see the latest code fix here http://www.sysexpand.com/?path=net/sysexpand/text/strmatch/source/wildmatch. Please provide
Sonu ChaudharyPosted Feb 25, 2016, 7:17 AM
nice article
LarsPosted Dec 18, 2013, 9:13 PM
There is a problem with multipleWildcard last in pattern if last block is in end of input string. Ex) IsMatch("RED", "*ED*", '?', '*'). How to solve that?
Kenneth SkovhedePosted Sep 1, 2013, 4:01 AM
You should pre-create the regular expression in the IsMatchRegex example. For common uses, the pattern is the same, used to match multiple strings. In your example, you create a whole new version each time. Also the Regex option Compiled has some impact. None the less, this is a fast wildcard matcher.
Marcel BokhorstPosted Apr 11, 2012, 6:04 AM
Assuming that the multiple wildcard characters means 0 or more characters: if (inputPos == input.Length && (patternPos == pattern.Length || (patternPos == pattern.Length - 1 && pattern[patternPos] == multipleWildcard)))
Jas KauldharPosted Aug 17, 2011, 7:17 AM
This is something the most programmers don't pay much attention to nowadays - code efficiency. Good work.