Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Comparing two hashes for duplicate keys with no case sensitivity

by injunjoel (Priest)
on Aug 14, 2008 at 23:25 UTC ( #704444=note: print w/ replies, xml ) Need Help??


in reply to Comparing two hashes for duplicate keys with no case sensitivity

More of TIMTOWTDI,

#!/usr/bin/perl -w use strict; my %hash1 = (TEXT => 25, Text => 25, Wibble => 20, foo=>42, BAZ => 0); my %hash2 = (text => 25, TexT => 25, wibble => 20, bar=>43, bAz => -1) +; my @dups = do{ local %_; $_{$_}++ for(map lc, (keys %hash1, keys %hash2)); delete @_{map $_{$_} == 1 ? $_ : (), keys %_}; sort keys %_; }; print "@dups \n";
Have a look at The Uniqueness of hashes. to see similar examples.

-InjunJoel
"I do not feel obliged to believe that the same God who endowed us with sense, reason and intellect has intended us to forego their use." -Galileo


Comment on Re: Comparing two hashes for duplicate keys with no case sensitivity
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (6)
As of 2014-12-25 14:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

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





    Results (160 votes), past polls