Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
PerlMonks  

Re^2: Fastest way to merge (and de-dup) two large arrays?

by technojosh (Priest)
on Aug 11, 2016 at 19:46 UTC ( [id://1169611]=note: print w/replies, xml ) Need Help??


in reply to Re: Fastest way to merge (and de-dup) two large arrays?
in thread Fastest way to merge (and de-dup) two large arrays?

both are arrays of strings

English alphabet, and nothing incredibly long... length($string) could be > 100, but nothing past 400, and could be much smaller (ie: just a few characters)

Replies are listed 'Best First'.
Re^3: Fastest way to merge (and de-dup) two large arrays?
by BrowserUk (Patriarch) on Aug 11, 2016 at 19:59 UTC
    arrays of strings English alphabet, could be > 100,

    Then a hash is your best bet.


    With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority". I knew I was on the right track :)
    In the absence of evidence, opinion is indistinguishable from prejudice.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others goofing around in the Monastery: (8)
As of 2024-04-16 18:25 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found