Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: Reconciling multiple lists (similar to "merge" in CVS?)

by Popcorn Dave (Abbot)
on Jan 05, 2007 at 20:56 UTC ( #593257=note: print w/replies, xml ) Need Help??


in reply to Reconciling multiple lists (similar to "merge" in CVS?)

This may be a long winded way of doing it, but what about this?

1.Dump all your arrays in to a hash to get frequency of the letters

2. Rebuild array comparing original array element and hash key, and checking if value is < 1 then that element is undef.

Unless I've misunderstood what you want, doesn't that do what you're after?

Revolution. Today, 3 O'Clock. Meet behind the monkey bars.

If quizzes are quizzical, what are tests?

  • Comment on Re: Reconciling multiple lists (similar to "merge" in CVS?)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://593257]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (9)
As of 2019-05-21 11:20 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you enjoy 3D movies?



    Results (132 votes). Check out past polls.

    Notices?
    • (Sep 10, 2018 at 18:53 UTC) Welcome new users!