Content deleted Content added
No edit summary |
Declining submission: Most of your sources are to Krauss himself; you need to cite additional sources showing that people ''other'' than Krauss are talking about this concept. Otherwise we have no way of knowing if this idea has spread further than one person. (AFCH 0.9) |
||
Line 1:
{{AFC submission|d|reason|Most of your sources are to Krauss himself; you need to cite additional sources showing that people ''other'' than Krauss are talking about this concept. Otherwise we have no way of knowing if this idea has spread further than one person.|u=JuliusClimacus|ns=118|decliner=MatthewVanitas|declinets=20180511011124|ts=20180509065319}} <!-- Do not remove this line! -->
In [[computer science]], the '''Krauss matching wildcards algorithm''' is a [[pattern matching]] algorithm. Based on the [[wildcard character|wildcard syntax]] in common use, e.g. in the [[Microsoft Windows]] [[command-line interface]], the algorithm provides a non-[[Recursion|recursive]] mechanism for matching patterns in software applications, based on syntax simpler than that typically offered by [[regular expression]]s.
Line 26 ⟶ 27:
== References ==
{{reflist}}
| |||