Only n matches need to be made - assuming you can map the keys across the hashes correctly (my guess is below on this one).
I think you misunderstood the question.
cLive ;-)
In reply to Re^2: Comparing hash data
by cLive ;-)
in thread Comparing hash data
by FubarPA
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |