Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re: Is there a regular expression version of the index function?

by rob_au (Abbot)
on Jun 20, 2004 at 12:16 UTC ( #368271=note: print w/replies, xml ) Need Help??

in reply to Is there a regular expression version of the index function?

You can do this using the pos function when performing matching against a string - This function returns the offset of where the last "m//g" search left off for the variable in question ($_ is used when the variable is not specified).

The following code demonstrates this function in action:

#!/opt/bin/perl $str = 'The quick brown fox jumps over the lazy dog.'; while ( $str =~ /[aeiou]/ig ) { printf( "%d %s\n", pos( $str ), substr( $str, pos( $str ) - 1 ) ); substr( $str, 0, pos( $str ), '' ); }


perl -le "print unpack'N', pack'B32', '00000000000000000000001011100101'"

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://368271]
[stevieb]: debugged my first very low-level C memory issue within a shared library with gdb so I did :D
[stevieb]: problem was in my code, but through the debugger I figured out what was actually happening, and why. Pretty straight forward after a few hours of reading and testing

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (5)
As of 2017-06-25 18:21 GMT
Find Nodes?
    Voting Booth?
    How many monitors do you use while coding?

    Results (568 votes). Check out past polls.