Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^2: How to count substrings in an array?

by Athanasius (Chancellor)
on Feb 03, 2013 at 08:20 UTC ( #1016805=note: print w/replies, xml ) Need Help??

in reply to Re: How to count substrings in an array?
in thread How to count substrings in an array?

This works where successive matches do not overlap. But consider the case where the string to match is 'ababa' and the substring is 'aba'. The substring occurs twice in the string, but /$t/g finds only one match, because after the first match the regex engine picks up the search at the point immediately after the last match:

ababa ^ the regex engine starts looking for the second match here

To get overlapping matches, use a positive lookahead:

17:58 >perl -Mstrict -wE "my $s = 'ababa'; my $t = 'aba'; my $c = () = + $s =~ /(?=$t)/g; say $c;" 2 18:02 >

This works, because

  1. a positive lookahead is a zero-width assertion, so the first match does not consume any of the string $s; but
  2. the regex engine advances to (at least) the next character in the string following a successful match.

See Re: Regex: finding all possible substrings by AnomalousMonk.

Hope that helps,

Athanasius <°(((><contra mundum Iustus alius egestas vitae, eros Piratica,

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1016805]
and !@monks...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (5)
As of 2017-01-20 02:08 GMT
Find Nodes?
    Voting Booth?
    Do you watch meteor showers?

    Results (173 votes). Check out past polls.