Difference between revisions of "Bitap"
(Created page with "{{Entry |Name=Bitap |Short description=Regex string matching using the bitap algorithm |Full description=The bitap library is a clean implementation of regular expression (regex/...") |
(Not found) |
||
| Line 3: | Line 3: | ||
|Short description=Regex string matching using the bitap algorithm | |Short description=Regex string matching using the bitap algorithm | ||
|Full description=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 '.*'. | |Full description=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 '.*'. | ||
| + | |Homepage URL=http://sourceforge.net/projects/libbitap/ | ||
|User level=none | |User level=none | ||
| − | |||
| − | |||
| − | |||
| − | |||
|Computer languages=C | |Computer languages=C | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|Related projects=TRE,Grep | |Related projects=TRE,Grep | ||
|Keywords=regex,string,grep,search,matching,bitap,fuzzy,glimpse,agrep | |Keywords=regex,string,grep,search,matching,bitap,fuzzy,glimpse,agrep | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|Version identifier=0.99 | |Version identifier=0.99 | ||
|Version date=2004-05-13 | |Version date=2004-05-13 | ||
|Version status=stable | |Version status=stable | ||
|Version download=http://rational.co.za/libbitap/libbitap.tgz | |Version download=http://rational.co.za/libbitap/libbitap.tgz | ||
| + | |Version comment=0.99 stable released 2004-05-13 | ||
| + | |Last review by=Alejandroindependiente | ||
| + | |Last review date=2016/12/28 | ||
| + | |Submitted by=Database conversion | ||
| + | |Submitted date=2011-04-01 | ||
| + | |Status= | ||
| + | |Is GNU=No | ||
| + | |License verified date=2004-05-13 | ||
| + | }} | ||
| + | {{Project license | ||
| + | |License=PublicDomain | ||
| + | |License verified by=Janet Casey | ||
|License verified date=2004-05-13 | |License verified date=2004-05-13 | ||
| − | |||
}} | }} | ||
{{Person | {{Person | ||
| + | |Real name=Nic Roets | ||
|Role=Maintainer | |Role=Maintainer | ||
| − | |||
|Email=users@sourceforge.net | |Email=users@sourceforge.net | ||
|Resource URL= | |Resource URL= | ||
| Line 44: | Line 42: | ||
|Works-with=text | |Works-with=text | ||
}} | }} | ||
| − | {{ | + | {{Featured}} |
| − | |||
| − | |||
| − | |||
| − | }} | ||
Latest revision as of 20:01, 27 December 2016
Bitap
http://sourceforge.net/projects/libbitap/
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 '.*'.
Licensing
License
Verified by
Verified on
Notes
Leaders and contributors
| Contact(s) | Role |
|---|---|
| Nic Roets | Maintainer |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Bug Tracking,Developer,Support | mailto:users@sourceforge.net |
Software prerequisites
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.