String-LCSS_XS version 1.2
String::LCSS_XS computes the Longest Common Substring of two strings
s and t. It is a C implementation of String::LCSS and uses a
dynamic programming algorithm with runtime of O(mn) and memory usage
of O(n) (m is the length of s and n the length of t).
Since version 1.1 it works also with UTF8 encoded strings.
To install thi
Revision history for Perl extension String::LCSS_XS.
1.2 Tue Mar 2 2010
- Bugfix: * Segfault when one string is undef (thanks Louis-David, closes
1.1 Mon Feb 8 2010
- Patch from ikegami (thank you so much :-) ):
* Uses appropriate #defines for types rather than "int".
* No longer allocates C structures to pass info from the .c to the .
The intent of this document is to state the conditions under which a Package
may be copied, such that the Copyright Holder maintains some semblance of
artistic control over the development of the package, while giving the users
of the package the right to use and distribute the Package in a more-or-less
customary fashion, plus the right to make reasonable modifications.
Browse inside String-LCSS_XS-1.2.tar.gz
Results 1 - 1 of 1Search over 15 billion files
© 1997-2016 FileWatcher.com