Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re: Checking contents of array against contents of a hash

by ssandv (Hermit)
on Oct 06, 2010 at 23:58 UTC ( #863888=note: print w/replies, xml ) Need Help??

in reply to Checking contents of array against contents of a hash

Before you do anything else, you can count the number of emails on the dlist. if it's not at least as big as the master list of users, you can short circuit. After that, you can sort them and walk the dlist using the master list. As soon as you find a master list element that's skipped on the dlist, you're done for that dlist. If you get to the end of the master list and nothing was skipped, flag it. Or something like that.

  • Comment on Re: Checking contents of array against contents of a hash

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://863888]
[Corion]: Hi Lady_Aleena!
[Lady_Aleena]: marioroy, are you also writing a Meditation for this?
choroba o/
Discipulus adds tozzetti alle mandorle to the platter on the sideboard.
Lady_Aleena was checking #cbstream and saw the big announcement.
[marioroy]: Tie::IxHash can be shared. Also similar modules. I cannot wait to post a solution sharing Tie::File and iterating among workers.
[marioroy]: Lady_Aleena Yes, will post something with all the new features. Parallel with few lines of code.
[marioroy]: Yes, will do for PM. I love PM.
Lady_Aleena ponders a meditation of her own, but it would be on a far far less important topic.
[marioroy]: I'm hoping to have a release in about a week's time.

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (5)
As of 2017-05-26 08:54 GMT
Find Nodes?
    Voting Booth?