Re: getting duplicates in a list by item id
Re: getting duplicates in a list by item id
- Subject: Re: getting duplicates in a list by item id
- From: "Mark J. Reed" <email@hidden>
- Date: Sat, 25 Aug 2007 17:30:03 -0400
On 8/25/07, Ed Stockly <email@hidden> wrote:
> On myMac it processed a list of 11000 items with many duplicates in less
> than 4 mins.
Yes, that'd be what I meant by "inefficient". As a point of
reference, Perl solves this problem in less than 1/8 of a second OMM.
Even Ruby, which as the newcomer on the block hasn't been optimized as
much as Perl and Python, solves it in less than 1/4 of a second. (in
each case on a list of 11,000 filenames, 7500 of them unique, the rest
random duplicates). And in each case I don't have to write any code
to go digging through a list to find matching items.
Built-in associative arrays (hashes, dictionaries, tables - call them
what you will) make a huge difference here.
_______________________________________________
Do not post admin requests to the list. They will be ignored.
AppleScript-Users mailing list (email@hidden)
Help/Unsubscribe/Update your Subscription:
Archives: http://lists.apple.com/archives/applescript-users
This email sent to email@hidden