walkingthecow has asked for the wisdom of the Perl Monks concerning the following question:
Hey all,
I have 4 hashes that all contain search results from LDAP queries. Oftentimes these 4 hashes will all contain the same user (LDAP is queried by ID#, NAME, USERNAME, and another ID#), and my goal is to only show the unique values from the LDAP query. However, they do need to remain seperate. I'm trying to figure this out: if same information exists in hashA and in hashB, remove that information from hashB, and if exists remove from hashC, and so on.
The hashes are all setup the same way, just from different queries. I present the results like the following:
You have an ID# Match:
Username: $username
...
You have a username match:
Username: $username
...
The results are not always the same. For example, someone with a different name could have the username, and so you'd get a name match and a username match. The first ID# (ID#1) is supposed to be unique, but in rare cases it is not.
The arrays are all setup like below: $numOneHash{$acctName} = [ $firstName, $initial, $lastName, $numOne, $numTwo ];$nameHash{$acctName} = [ $firstName, $initial, $lastName, $numOne, $numTwo ];
Currently it will display like this:
You have an ID# Match:
Username: bobJones
numOne: 12345
...
You have a username match:
Username: bobJones
numOne: 12345
...
Redundant? Yes.
Comment on Getting unique values from multiples hashes