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


No such thing as a small change
	PerlMonks

by technojosh (Priest)

on Aug 11, 2016 at 19:08 UTC ( [id://1169603]=note: print w/replies, xml )

Need Help??

Irrelevant

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

Replies are listed 'Best First'.
Re^3: Fastest way to merge (and de-dup) two large arrays? by perldigious (Priest) on Aug 11, 2016 at 19:13 UTC
Then as Corion suggested hashing instead of smart matching is probably a great way to go for run time efficiency. I love it when things get difficult; after all, difficult pays the mortgage. - Dr. Keith Whites I hate it when things get difficult, so I'll just sell my house and rent cheap instead. - perldigious	[reply]
Re^3: Fastest way to merge (and de-dup) two large arrays? by Anonymous Monk on Aug 11, 2016 at 19:18 UTC
On a *nix system, I would try writing both arrays out to the same file and run `sort -u` [download] on the file. Might be faster, might not...	[reply] [d/l]

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://1169603]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others scrutinizing the Monastery: (4)

As of 2024-04-23 06:01 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

No recent polls found