Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re^2: Is there a way to compare strings without using an array?

by CountZero (Bishop)
on Oct 18, 2011 at 20:08 UTC ( #932236=note: print w/ replies, xml ) Need Help??


in reply to Re: Is there a way to compare strings without using an array?
in thread Is there a way to compare strings without using an array?

With duplicates removed and the output sorted:

use Modern::Perl; my $line1= 'CABGFEBFA'; my $line2= 'DBFDDF'; say sort keys %{{map {$_ => 1} $line2 =~ /[$line1]/g}}; say sort keys %{{map {$_ => 1} $line1 =~ /[^$line2]/g, $line2 =~ /[^$l +ine1]/g}};

CountZero

A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James


Comment on Re^2: Is there a way to compare strings without using an array?
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (7)
As of 2014-12-26 11:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

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





    Results (171 votes), past polls