Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

Re^3: need help in extending the code

by Marshall (Prior)
on Jul 28, 2011 at 04:57 UTC ( #917184=note: print w/ replies, xml ) Need Help??

in reply to Re^2: need help in extending the code
in thread need help in extending the code

I'm not sure what you need. To count the number of occurrences of "finding" in a case insensitive way would require the /i switch for case_insensitive and then the /g switch to keep going globally.

There is a critter, called the goatse operator, "=()=" that will give the scalar count of the number of matches. You can read about it here: goatse operator. Or just look at the code and play with it..

!/usr/bin/perl -w use strict; my $x = "Finding fiNding fIndinG finding"; my $count = () = $x =~ /finding/ig; print "$count\n"; #prints 4

Comment on Re^3: need help in extending the code
Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (8)
As of 2016-02-09 13:50 GMT
Find Nodes?
    Voting Booth?

    How many photographs, souvenirs, artworks, trophies or other decorative objects are displayed in your home?

    Results (316 votes), past polls