Cocoa/Objective-C's Relative Performance
Cocoa/Objective-C's Relative Performance
- Subject: Cocoa/Objective-C's Relative Performance
- From: "Ivan S. Kourtev" <email@hidden>
- Date: Wed, 12 Jan 2005 13:26:05 -0500
Hi everyone,
I have been [so far unsuccessfully] trying to find out published
information regarding the performance of some of the popular Cocoa data
structures. I am particularly interested in containers such as
NSMutableArray, NSMutableDictionary, and so on. After having been
involved in a couple projects I am starting to think that the Cocoa
containers are not the best way to go for really large data sets (tens
of millions of elements) requiring extremely frequent access (need
containers with very fast average search and insertion time).
Does anyone know of any comparative study or [even better] published
runtime complexities for the Cocoa data structures? I wish Apple had
provided these numbers but, alas, I have not been able to find them.
Perhaps I am missing the point and these Cocoa data structures are only
optimal for use with GUI widgets (of which there are never millions).
I am starting to think that for maximum performance (I am talking about
data sets with hundreds of millions of elements) one would always need
a custom non-Cocoa (and not even Objectivee-C because of the
objc_msgsend() overhead) data structures.
In any case, if anyone knows of a source of information on the above,
please let me know as I have not been able to find almost anything.
Thanks.
--
ivan
_______________________________________________
Do not post admin requests to the list. They will be ignored.
Cocoa-dev mailing list (email@hidden)
Help/Unsubscribe/Update your Subscription:
This email sent to email@hidden