hi Super doc,
What I am trying to explain is that the list of keys in $c in hash1 should be exactly similar to list of keys in $f in hash2. I just want a list of keys that are not present in either of them. For ex:
html
$a = 'a, b , c , d, e, f';
$f = 'a, 1, c, d, 2, , f';
SO I want a report saying :
$a is missing keys "1, 2".
$f is missing keys "b, e".
/html
The hash that you used to explain works fine for simple hash tables with one key and one value.
I am not sure how to build a data structure, for a hash like this one:
html
$hash1->{$a}{$b}{$c}
$hash2->{$d}{$e}{$f}
/html
Can you help me out?