Re^4: Exact string matching

[BrowserUk]

The fastest way to n-tuple long strings is using unpack:

$text = 'howdoidoit';;

print for unpack '(a3X2)*', $text;;
how
owd
wdo
doi
oid
ido
doi
oit
it
it

print for unpack '(a4X3)*', $text;;
howd
owdo
wdoi
doid
oido
idoi
doit
oit
oit
oit

You have to discard the last n-1 results but that is very quick and simple to do.

[AnomalousMonk]

... and this approach can easily be extended to make n dynamic by interpolating the width counts in the unpack template string.

>perl -wMstrict -le
"my $text = 'howdoidoit';
 ;;
 my $n    = 3;
 my $back = $n - 1;
 ;;
 my @unpacked = unpack qq{(a$n X$back)*}, $text;
 my %count;
 $count{$_}++ for @unpacked[0 .. $#unpacked - $back];
 ;;
 use Data::Dumper;
 print Dumper \%count;
"
$VAR1 = {
          'wdo' => 1,
          'ido' => 1,
          'owd' => 1,
          'how' => 1,
          'oid' => 1,
          'oit' => 1,
          'doi' => 2
        };