Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re: Question on qx

by BUU (Prior)
on Nov 03, 2006 at 20:53 UTC ( #582164=note: print w/replies, xml ) Need Help??

in reply to Question on qx

The output of qx// is whatever the program inside's STDOUT is. In your specific case you send all of the program's STDOUT to a file, so there is none left for perl to read.

Replies are listed 'Best First'.
Re^2: Question on qx
by duckyd (Hermit) on Nov 03, 2006 at 22:11 UTC
    if BUU's explanation wasn't enough, perhaps perlop can help
      If you're looking for the return code of the command you're running, you can use system().
        qx// also sets $?.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://582164]
[LanX]: /.*(?:ß|ss).*/
[hippo]: How are you doing the match? Regex, index, eq or something else?
[choroba]: fc $s1 eq fc $s2 I guess
[Tanktalus]: hippo: I don't care, I just want to prove it can match correctly compared to, say, ILIKE / UPPER / LOWER in postgres :)
[LanX]: is there a unicode convention that ß is ss ?
[Tanktalus]: LanX: yes :) I haven't tried java, but I have this match working in its bastard cousin, C# :) I just thought perl's unicode support would get me there :)
[LanX]: I have my doubts, IMHO its a workaround if the glyph is missing
[LanX]: (they are pronounced differently)
[choroba]: perl -Mutf8 -Mfeature=fc -wE 'say fc "straße" eq fc "strasse"'
[choroba]: returns 1 for me

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (13)
As of 2018-03-21 15:42 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (268 votes). Check out past polls.