| commit | 45b38550eec7de580d790440154791c67cae8475 | [log] [tgz] |
|---|---|---|
| author | Rich Felker <dalias@aerifal.cx> | Sat Apr 28 18:05:29 2012 -0400 |
| committer | Rich Felker <dalias@aerifal.cx> | Sat Apr 28 18:05:29 2012 -0400 |
| tree | 93005ff72589f5f0ea2989eb08b383d35198b695 | |
| parent | a1b442335d6382b0dc0363fdd3a5604493b6a9c7 [diff] |
new fnmatch implementation unlike the old one, this one's algorithm does not suffer from potential stack overflow issues or pathologically bad performance on certain patterns. instead of backtracking, it uses a matching algorithm which I have not seen before (unsure whether I invented or re-invented it) that runs in O(1) space and O(nm) time. it may be possible to improve the time to O(n), but not without significantly greater complexity.