Forum: Object-Pascal / Delphi-Language
Delphi
by alzaimar,
22. Jan 2009
@3_of_8:Regular Expressions 'might' be too slow, but I would suggest giving it a try. I would think that the TRegExpr-Implementation is not that bad. However, an optimized KMP* (or something similar) might be much faster, but to be honest, I am too lazy to find that out right now. There should be oodles of implementations out there.
Forum: Object-Pascal / Delphi-Language
Delphi
by alzaimar,
22. Jan 2009
BM is by definition not suitable for wildcards. It uses good and bad suffix tables which are based on exact characters. So the algorithm just won't fit.
You might try looking for a variation of the Knuth-Morris-Pratt algorithm which uses wildcard characters. The KMP uses a DEA which supports wildcards.
