Re^2: comparing two files, with known variations

fine on your reply. But i am interested in knowing about the tools / modules to do this Job.
And also, it is not 2,500 it is 25,000 minimum.
Thanks for your reply, hence i got some modules for comparison, and other ideas.

Sathiyamoorthy

Comment on Re^2: comparing two files, with known variations

Replies are listed 'Best First'.
Re^3: comparing two files, with known variations by targetsmart (Curate) on Jan 07, 2009 at 07:11 UTC
Hi, I feel that your worry is about 25000 lines of data into hash or into perl's memory!. If my guess is correct, you can use DBM::Deep. But since the data will be stored in a file, it will not be as quick as normal hash.	[reply]
Re^3: comparing two files, with known variations by apl (Monsignor) on Jan 07, 2009 at 12:33 UTC
Use the nix sort and diff utilities. As far as field separator is concerned, it looks like your file is fixed format; you could just use a space... Revised:* Sorry, I realize that doesn't handle your definition of time identity.	[reply]