Hi
I have a script which contains 2 hashes of file names as the keys and
md5 sums as the values. I am looking for ideas on fast and efficient
ways to compare the 2 hashes in the manner of the pseudo code below
--
%base_hash
%new_hash
for keys in %new_hash
if key in %new_hash exists in %base_ha
A hash is an array actually in perl.So you may use Array::Diff module on CPAN:
http://search.cpan.org/~typester/Array-Diff-0.04/lib/Array/Diff.pm
2007/7/4, [EMAIL PROTECTED] <[EMAIL PROTECTED]>:
Hi
I have a script which contains 2 hashes of file names as the keys and
md5 sums as the values. I
[EMAIL PROTECTED] wrote:
Hi
Hello,
I have a script which contains 2 hashes of file names as the keys and
md5 sums as the values. I am looking for ideas on fast and efficient
ways to compare the 2 hashes in the manner of the pseudo code below
Can you fill us in on the big picture? Perhaps
From: "[EMAIL PROTECTED]" <[EMAIL PROTECTED]>
> Hi
> I have a script which contains 2 hashes of file names as the keys and
> md5 sums as the values. I am looking for ideas on fast and efficient
> ways to compare the 2 hashes in the manner of the pseudo code below
>
> --
> %base_hash
> %new_hash
>
From: "Jeff Pang" <[EMAIL PROTECTED]>
> A hash is an array actually in perl.
> So you may use Array::Diff module on CPAN:
> http://search.cpan.org/~typester/Array-Diff-0.04/lib/Array/Diff.pm
Beg tour pardon? Are we talking about the silly name "associative
array" sometimes used form hashes? Or ar
On Jul 4, 2:05 am, [EMAIL PROTECTED] (John W. Krahn) wrote:
>
> > I have a script which contains 2 hashes of file names as the keys and
> > md5 sums as the values. I am looking for ideas on fast and efficient
> > ways to compare the 2 hashes in the manner of the pseudo code below
>
> Can you fill
