Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re: Hash Comparisions

by vitoco (Friar)
on Nov 23, 2009 at 12:21 UTC ( #808794=note: print w/ replies, xml ) Need Help??

in reply to Hash Comparisions

I don't know if one UR key may appear many times in one input file, each time with the same or different CI keys, or vice versa.

If so, you the hash key must be the whole (chomped) record of one input files, and proceed just like grizzley said, but reversing the fields of the records from the second file when testing for existence in the loop.

Also, if there are many records with exact the same keys on the second file, you can delete the full key from the hash each time you match it, just to get unique records in the output file.

Bonus track (not tested):

#!perl use strict; use warnings; # ... open $IN1, "<", $infile1 or die "cannot open $infile1: $!\n"; open $IN2, "<", $infile2 or die "cannot open $infile2: $!\n"; open $OUT, ">", $outfile or die "cannot open $outfile: $!\n"; my %pair = (); while (<$IN1>) { chomp; s/^(\w+)\s+(\w+)$/$1 $2/; # just one space between keys $pair{$_} = 1; } while (<$IN2>) { chomp; s/^(\w+)\s+(\w+)$/$2 $1/; # swap keys if (exists $pair{$_}) { print $OUT "$_\n"; delete $pair{$_}; } } close $IN1; close $IN2; close $OUT;

Update: Initialized and changed name of the hash and newline added on output records. Still not tested!

Comment on Re: Hash Comparisions
Download Code
Re^2: Hash Comparisions
by Anonymous Monk on Nov 23, 2009 at 18:05 UTC
    Amazing! Thank you so much Vitoco and GrandFather, I really appreciate it!

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (8)
As of 2014-08-29 00:32 GMT
Find Nodes?
    Voting Booth?

    The best computer themed movie is:

    Results (275 votes), past polls