|
|
|
| There's more than one way to do things | |
| PerlMonks |
Re^7: Fast common substring matchingby GrandFather (Saint) |
| on Nov 29, 2005 at 22:56 UTC ( [id://512793]=note: print w/replies, xml ) | Need Help?? |
|
Actually as far as I can remember my code doesn't require a power of 2 for the minimum size either. It may have been more important in earlier versions than in the current version. Somewhere on my todo list is an item to look at Roy's code, but I've not got down to that item on the list yet. :) DWIM is Perl's answer to Gödel
In Section
Cool Uses for Perl
|
|
||||||||||||||||||||||