45b38550ee
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. |
||
|---|---|---|
| .. | ||
| fnmatch.c | ||
| glob.c | ||
| regcomp.c | ||
| regerror.c | ||
| regexec.c | ||
| tre-mem.c | ||
| tre.h | ||