tango.text.Search

License:

BSD style: see license.txt

Version:

May 2009: Initial release

since:

0.99.9

Author:

Kris
FindFruct!(T) find(T)(const(T)[] what)
Returns a lightweight pattern matcher, good for short patterns and/or short to medium length content. Brute-force approach with fast multi-byte comparisons
SearchFruct!(T) search(T)(const(T)[] what)
Returns a welterweight pattern matcher, good for long patterns and/or extensive content. Based on the QS algorithm which is a Boyer-Moore variant. Does not allocate memory for the alphabet.
Generally becomes faster as the match-length grows