Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^4: Selecting HL7 Transactions (backtracking and partial anchors)

by LanX (Chancellor)
on May 02, 2013 at 09:00 UTC ( #1031710=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
      DB<119> $x
     => "junk   ;a;not;b;not;c;;  junk   ;d;not;e;;  junk   "
    ...
    
      DB<122> $x =~ /;([^;]*?);;/g      # non-greedy, trying multiple anch
    +ors.
     => ("c", "e")
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1031710]
help
Chatterbox?
[Lady_Aleena]: Discipuluis, I don't know if I want to fight with File::Find. File::Find and I are not friends.
[Discipulus]: 4 day Bach is too muche even for me
[Discipulus]: LA you know who is paco?
[Lady_Aleena]: Disc, nope.
[Discipulus]: ahi ahi ahi!!
[Lady_Aleena]: paco is a little over 2 years before my time.
[Discipulus]: you can try tachyon's iterative approach Re: Win32 Recursive Directory Listing
[Lady_Aleena]: I'm on Linux/
[beech]: isn't 2 year about standard recovery time for that kind of surgery?
[Discipulus]: if you hate FIle::Find

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (13)
As of 2017-04-23 20:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (432 votes). Check out past polls.