Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?
 
PerlMonks  

Re: Re: Open to suggestions on a search and replace..

by tachyon (Chancellor)
on Apr 12, 2002 at 11:05 UTC ( #158541=note: print w/ replies, xml ) Need Help??


in reply to Re: Open to suggestions on a search and replace..
in thread Open to suggestions on a search and replace..

You can use a positive lookahead assertion to avoid having to reinsert $1.

$line =~ s/^(?=R.*\$SUB=)<\*\d+>//;

cheers

tachyon

s&&rsenoyhcatreve&&&s&n.+t&"$'$`$\"$\&"&ee&&y&srve&&d&&print


Comment on Re: Re: Open to suggestions on a search and replace..
Download Code
Re3: Open to suggestions on a search and replace..
by Hofmator (Curate) on Apr 12, 2002 at 11:38 UTC
    You can use a positive lookahead assertion to avoid having to reinsert $1. $line =~ s/^(?=R.*\$SUB=)<\*\d+>//;

    aehhm, this won't work. The lookahead doesn't move the position in your regex, so you are effectively looking for /^<\*\d+>/ which isn't there. Instead you would need a look behind assertion but they are only available for constant length.

    As I understand the file format there are no other digits in angle brackets starting with a star. So why not simply write: s/<\*\d+>//;

    Update: As of Rhodium's clarification of the specs, I would now fully recommend IO's solution.

    -- Hofmator

      Hey Hof,
      As I understand the file format there are no other digits in angle brackets starting with a star.
      That is something I don't want to assume..
      Rhodium

      The <it>seeker</it> of perl wisdom.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (15)
As of 2015-07-06 12:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (74 votes), past polls