Regex string matching using the bitap algorithm
The bitap library is a clean implementation of regular expression (regex/grep) string matching using the bitap algorithm. Approximate (a.k.a. fuzzy) matching is allowed. This is the same algorithm as the one used in Glimpse and agrep, but it is much more complete with regard to regular expression syntax, and is much cleaner. It is quite fast compared to other greps due to the bitap algoritm and modern CPU architechture. Modifying code for special cases speeds things up even futher. Note that the complete 'search' string must be matched by the pattern. If you want to search for substrings of the search string, prefix and postfix the pattern with '.*'.
released on 13 May 2004
|License||Verified by||Verified on||Notes|
|PublicDomain||Janet Casey||13 May 2004|
Leaders and contributors
Resources and communication
This entry (in part or in whole) was last reviewed on 28 December 2016.