|Just another Perl shrine|
Challenge: fastest count of substringby LanX (Chancellor)
|on May 06, 2013 at 15:17 UTC||Need Help??|
LanX has asked for the
wisdom of the Perl Monks concerning the following question:
inspired from the recent discussion I was seeking for the fastest way to count all fix substring in a long string.
But most approaches have the problem to allocate memory for a result list which is ignore anyway ...
( addicted to the Perl Programming Language)