On Fri, Jan 16, 2009 at 11:27 AM, David Harper wrote:
> Hello,
>
> I have written a comparator that returns an NSComparisonResult based on the
> comparison of two objects as required for
>
> [(NSMutableArray *)someArray sortUsingSelector:@selector(theSelector:)]
>
> Now, I want this array to
On Fri, Jan 16, 2009 at 8:27 AM, David Harper wrote:
> Hello,
>
> I have written a comparator that returns an NSComparisonResult based on the
> comparison of two objects as required for
>
> [(NSMutableArray *)someArray sortUsingSelector:@selector(theSelector:)]
>
> Now, I want this array to r
An alternative (though one that might be slightly less flexible than a
regular NSArray) is to use a datastructure that automatically sorts on
insert.
A guy in our Cocoaheads group has created the CHDatastructures
framework (FOSS), which has all sorts of data structures not available
in Co
On Jan 16, 2009, at 8:27 AM, David Harper wrote:
Hello,
I have written a comparator that returns an NSComparisonResult based
on the comparison of two objects as required for
[(NSMutableArray *)someArray
sortUsingSelector:@selector(theSelector:)]
Now, I want this array to remain sor
On Jan 16, 2009, at 8:27 AM, David Harper wrote:
I have written a comparator that returns an NSComparisonResult based
on the comparison of two objects as required for
[(NSMutableArray *)someArray
sortUsingSelector:@selector(theSelector:)]
Now, I want this array to remain sorted after e
On 16 Jan 2009, at 17:27, David Harper wrote:
Hello,
I have written a comparator that returns an NSComparisonResult based
on the comparison of two objects as required for
[(NSMutableArray *)someArray
sortUsingSelector:@selector(theSelector:)]
Now, I want this array to remain sorted
