Re^3: finding number of contiguous letters

GrandFather,
If you are feeling bored, I would be interested in seeing how my unpack solution I came up with for Challenge: Fast Common Substrings does. In a nutshell, we programmatically generate a template to extract all substrings of a given length.

Cheers - L~R

Comment on Re^3: finding number of contiguous letters

Replies are listed 'Best First'.
Re^4: finding number of contiguous letters by GrandFather (Saint) on May 23, 2007 at 21:01 UTC
More interested than bored. Note that removing the template generation from do_update makes no significant difference to the result. DWIM is Perl's answer to Gödel	[reply]
Re^5: finding number of contiguous letters by Limbic~Region (Chancellor) on May 24, 2007 at 12:39 UTC
GrandFather, Neat and thanks. I am interested myself but am finding myself with no free time. The next question I would want to ask is if the results change as the size of string changes. Oh well, another time perhaps. Thanks again. Cheers - L~R	[reply]
Re^6: finding number of contiguous letters by GrandFather (Saint) on May 24, 2007 at 21:47 UTC
`Run against 24 character string: Rate regex unpack substr regex 40260/s -- -17% -44% unpack 48660/s 21% -- -33% substr 72138/s 79% 48% -- Run against 480000 character string: Rate regex unpack substr regex 0.983/s -- -10% -60% unpack 1.10/s 11% -- -55% substr 2.44/s 148% 122% --` [download] ;) DWIM is Perl's answer to Gödel	[reply] [d/l]