Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: Re: Re: Re: Re: How many bugs can *you* find

by satchboost (Scribe)
on May 01, 2001 at 23:58 UTC ( #77101=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: Re: Re: How many bugs can *you* find
in thread How many bugs can *you* find

That may be true in general, but the idea is to take the CRLF sequence in Unix (\n) and the CRLF sequence in Windows (\n\r) and replace either of them with <p>. To do that, one regex is simpler than two.


Comment on Re: Re: Re: Re: Re: How many bugs can *you* find
Re: Re: Re: Re: Re: Re: How many bugs can *you* find
by Beatnik (Parson) on May 02, 2001 at 00:02 UTC
    a character case won't solve that :)

    Greetz
    Beatnik
    ... Quidquid perl dictum sit, altum viditur.
      You're right. That's why that was a bug. :) A better solution would have been s/\n\r?/<p>/g;, not that character class.
Re (tilly) 6: How many bugs can *you* find
by tilly (Archbishop) on May 03, 2001 at 05:53 UTC
    FYI when I am on Unix looking at files from DOS, the end of line sequence is \r\n, not \n\r.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (8)
As of 2014-12-28 15:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (182 votes), past polls