Selection differences -> adds and removes
sigmund.desouza at csfb.com
Thu Nov 17 06:40:14 GMT 2005
Sorry about the wide copy here but could anyone send me the sign-on/off url for the mail listing please.
Computing Technical Services (CTS) - Unix Admin EU
CREDIT | FIRST
SUISSE | BOSTON
* Direct: +44 (0)20 7888 0491 Group Line: +44 (0)20 7888 6060
* sigmund.desouza at csfb.com
* # GTI CTS UNIX EU - Internal
From: london.pm-bounces at london.pm.org
[mailto:london.pm-bounces at london.pm.org]On Behalf Of Jacqui Caren
Sent: 17 November 2005 00:25
To: London.pm Perl M[ou]ngers
Subject: Re: Selection differences -> adds and removes
Matt Sergeant wrote:
> On 14 Nov 2005, at 16:15, Lusercop wrote:
>> On Mon, Nov 14, 2005 at 06:22:45PM +0000, Jacqui Caren wrote:
>>> A pretty standard problem.
>>> I have a current set of integers (1,2,15)
>>> and a updated set of integers (1, 4,15,19)
>>> Is there a perl module that holds such a utility function?
> Will the list get large? Algorithm::Diff requires the list fits into ram.
In my case no - lists are expected to peak at 10 -20 entries each.
> An alternate algorithm (if it won't fit into ram) exists for sorted
> data and it's probably faster than Algorithm::Diff.
I already have tested code - I just prefer to not "reinvent the wheel"
if possible - and the less custom code in an app the better :-)
Please access the attached hyperlink for an important electronic communications disclaimer:
More information about the london.pm