Re^3: Use hashes instead of grep

Yes, but this method is not clearly superior if arrays are needed for other purposes. The array comparison is simpler, uses less memory, and will be fast unless both files are huge.

When's the last time you used duct tape on a duct? --Larry Wall

Comment on Re^3: Use hashes instead of grep

Replies are listed 'Best First'.
Re^4: Use hashes instead of grep by Anonymous Monk on Nov 15, 2012 at 14:18 UTC
Or, as Darth put it: The time to build the structure is insignificant compared to the power of the hash!	[reply]
Re^4: Use hashes instead of grep by space_monk (Chaplain) on Nov 15, 2012 at 14:01 UTC
The code to implement the hash version isn't significantly more complex - see the version in another nodelet for how it would go. A Monk aims to give answers to those who have none, and to learn from those who know more.	[reply]