|author||Rich Felker <firstname.lastname@example.org>||2012-04-28 18:05:29 -0400|
|committer||Rich Felker <email@example.com>||2012-04-28 18:05:29 -0400|
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.
Diffstat (limited to 'README')
0 files changed, 0 insertions, 0 deletions