Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re: Efficient selection mechanism?

by ikegami (Pope)
on Jan 14, 2014 at 17:13 UTC ( #1070577=note: print w/ replies, xml ) Need Help??


in reply to Efficient selection mechanism?

Not indexed, but a regex should search an 8k string pretty fast.

my $AoA = pack 'C*', map @$_, @AoA; my $omit = $AoA[0]; my $pat = '[^'.( join '', map quotemeta, pack 'C*', @$omit ).']{4}'; my $re = qr/\G(?:.{4})*?($pat)/s; my @matches = map [ unpack 'C*', $_ ], $AoA =~ /$re/g;

The following avoids recreating the original arrays at the expense of two bytes per element of @AoA.

my $AoA = pack '(C4S)*', map { @{ $AoA[$_] }, $_ } 0..$#AoA; my $omit = $AoA[0]; my $pat = '[^'.( join '', map quotemeta, pack 'C*', @$omit ).']{4}'; my $re = qr/\G(?:.{6})*?$pat(..)/s; my @matches = @AoA[ map unpack 'S', $AoA =~ /$re/g ];


Comment on Re: Efficient selection mechanism?
Select or Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1070577]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (14)
As of 2014-12-22 16:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (121 votes), past polls