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

Re^3: search for chr() fails

by LanX (Canon)
on May 21, 2013 at 01:41 UTC ( #1034435=note: print w/ replies, xml ) Need Help??

in reply to Re^2: search for chr() fails
in thread search for chr() fails

> then I can print the text between the two instances of the character...

many of your example lines have only one instance of that character.

Otherwise you could just use something like  print ((split /\xA0/,$_)[1])

Cheers Rolf

( addicted to the Perl Programming Language)


corrected escape code

Comment on Re^3: search for chr() fails
Download Code
Replies are listed 'Best First'.
Re^4: search for chr() fails
by tbone654 (Beadle) on May 21, 2013 at 02:09 UTC
    yes... I'm familiar with and also comfortable with split...
    What I showed was an excerpt of the intersection of two files, one of which has 1 occurance, and one that has two. I will just do something to the data first, depending on which instance before I append them together...

    Thank you for your help...

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (11)
As of 2015-10-07 09:00 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (175 votes), past polls