In computer science, an algorithm for matching wildcards (also known as globbing) is useful in comparing text strings that may contain wildcard syntax.[1] Common uses of these algorithms include command-line interfaces, e.g. the Bourne shell[2] or Microsoft Windows command-line[3] or text editor or file manager, as well as the interfaces for some search engines[4] and databases.[5] Wildcard matching is a subset of the problem of matching regular expressions and string matching in general.[6]
A wildcard matcher tests a wildcard pattern p against an input string s. It performs an anchored match, returns true only when p matches the entirety of s.
The pattern can be based on any common syntax (see globbing), but on Windows programmers tend to only discuss a simplified syntax supported by the native C runtime:[7]
This article mainly discusses the Windows formulation of the problem, unless otherwise stated.
Stated in zero-based indices, the wildcard-matching problem can be defined recursively as:
\begin{aligned} m00&=(p0=t0)\\ m0j&=(pj-1=‘*’)\landm0,j-1\\ mi0&=false\\ mij&= \begin{cases} mi-1,&for pi-1=tj-1\lorpi-1=‘?’\\ mi,\lormi-1,&for pi-1=‘*’\\ false&for pi-1 ≠ tj-1\end{cases}&& for 1\leqi\le|p|,1\leqj\le|t|. \end{aligned}
where mij is the result of matching the pattern p against the text t truncated at i and j characters respectively. This is the formulation used by Richter's algorithm and the Snippets algorithm found in Cantatore's collection. This description is similar to the Levenshtein distance.
Directly related problems in computer science include:
Early algorithms for matching wildcards often relied on recursion, but the technique was criticized on grounds of performance and reliability[11] considerations. Non-recursive algorithms for matching wildcards have gained favor in light of these considerations.
Among both recursive and non-recursive algorithms, strategies for performing the pattern matching operation vary widely, as evidenced among the variety of example algorithms referenced below. Test case development and performance optimization techniques have been demonstrably brought to bear on certain algorithms, particularly those developed by critics of the recursive algorithms.
The recursion generally happens on matching * when there is more suffix to match against. This is a form of backtracking, also done by some regular expression matchers.
[...] and multibyte character sets):The general form of these algorithms are the same. On recursion the algorithm slices the input into substrings, and considers a match to have happened when ONE of the substrings return a positive match. For, it would greedily call,, and . They usually differ by less-important things like support for features and by more important factors such as minor but highly effective optimizations. Some of them include:
* and making sure that ONE of the substrings return a positive match, the running time becomes exponential for rejecting a match with many * in the text. Lars Mathiesen changes the return to three classes, match, no-match, and ABORT (no match possible at all for asterisk recursion.) The ABORT value is returned when the text is consumed too early or when another asterisk match has failed, guaranteeing a linear performance with respect to the number of asterisks. (The overall complexity is additionally quadratic to the number of characters left to match.)[12] Git/Rsync's wildmatch ABORT also covers invalid inputs.[19] The new INN uwildmat does the same.Martin Richter's algorithm is an exception to this pattern, although the overall operation is equivalent. On * it recurses into increasing either of the indexes, following the dynamic programming formulation of the problem. The "ABORT" technique is applicable to it as well.[15] On typical patterns (as tested by Cantatore) it is slower than the greedy-call implementations.
The recursive algorithms are in general easier to reason about, and with the ABORT modification they perform acceptably in terms of worst-case complexity. On strings without * they take linear-to-string-size time to match since there is a fixed one-to-one relation.
The following are developed by critics of the recursive algorithms:
The following is not:
The iterative functions above implement backtracking by saving an old set of pattern/text pointers, and reverting to it should a match fails. According to Kurt, since only one successful match is required, only one such set needs to be saved.[23]
In addition, the problem of wildcard matching can be converted into regular expression matching using a naive text-replacement approach. Although non-recursive regular expression matchers such as Thompson's construction are less used in practice due to lack of backreference support, wildcard matching in general does not come with a similarly rich set of features. (In fact, many of the algorithms above only has support for and .) The Russ Cox implementation of Thompson NFA can be trivially modified for such.[26] Gustavo Navarro's -based nrgrep algorithm provides a more streamlined implementation with emphasis on efficient suffixes.[27] See also .