On Apr 20, 2009, at 5:32 PM, Greg Guerin wrote:
Would NSSet cut the mustard here?
NSArray allows duplicate items; NSSet does not. What do you propose
happen if one or both NSArray inputs have items that compare as equal?
Algorithmically speaking, a merge sort from two inputs into a new
output seems pretty simple. Simply choose the lesser of the two
available next-items and append it to the new array. Or if both
next-items are equal, choose one arbitrarily.
You should probably choose the one that came first in the original
array. Merge sort should be order preserving, and even though the
objects are ordered the same with respect to the comparison function,
their identities my be different and their relative ordering should be
preserved.
Jon Hess
-- GG
_______________________________________________
Cocoa-dev mailing list (Cocoa-dev@lists.apple.com)
Please do not post admin requests or moderator comments to the list.
Contact the moderators at cocoa-dev-admins(at)lists.apple.com
Help/Unsubscribe/Update your Subscription:
http://lists.apple.com/mailman/options/cocoa-dev/jhess%40apple.com
This email sent to jh...@apple.com
_______________________________________________
Cocoa-dev mailing list (Cocoa-dev@lists.apple.com)
Please do not post admin requests or moderator comments to the list.
Contact the moderators at cocoa-dev-admins(at)lists.apple.com
Help/Unsubscribe/Update your Subscription:
http://lists.apple.com/mailman/options/cocoa-dev/archive%40mail-archive.com
This email sent to arch...@mail-archive.com
