gnustep/libs-base
0
0
Fork 0
mirror of https://github.com/gnustep/libs-base.git synced 2025-05-30 16:30:41 +00:00
Code Issues Projects Releases Packages Wiki Activity

Changes from Scott Christley. See ChangeLog Dec 04 and Nov 21

Browse source 
git-svn-id: svn+ssh://svn.gna.org/svn/gnustep/libs/base/trunk@2032 72102866-910b-0410-8b05-ffd578937521
This commit is contained in:
mccallum 1997-01-09 16:24:07 +00:00
parent c14b5e539b
commit 67869fb4e0
13 changed files with 285 additions and 43 deletions
Download patch file Download diff file Expand all files Collapse all files

49
Source/NSArray.m
View file

@ -279,15 +279,21 @@ static Class NSMutableArray_concrete_class;
- (NSArray*) sortedArrayUsingSelector: (SEL)comparator
{
[self notImplemented:_cmd];
return nil;
int compare(id elem1, id elem2, void* context)
{
return (int)[elem1 perform:comparator withObject:elem2];
}
return [self sortedArrayUsingFunction:compare context:NULL];
}
- (NSArray*) sortedArrayUsingFunction: (int(*)(id,id,void*))comparator
context: (void*)context
{
[self notImplemented:_cmd];
return nil;
id sortedArray = [[self mutableCopy] autorelease];
[sortedArray sortUsingFunction:comparator context:context];
return [[sortedArray copy] autorelease];
}
- (NSString*) componentsJoinedByString: (NSString*)separator
@ -563,7 +569,40 @@ static Class NSMutableArray_concrete_class;
- (void) sortUsingFunction: (int(*)(id,id,void*))compare
context: (void*)context
{
[self notImplemented:_cmd];
/* Shell sort algorithm taken from SortingInAction - a NeXT example */
#define STRIDE_FACTOR 3 // good value for stride factor is not well-understood
// 3 is a fairly good choice (Sedgewick)
int c,d, stride;
BOOL found;
int count = [self count];
stride = 1;
while (stride <= count)
stride = stride * STRIDE_FACTOR + 1;
while(stride > (STRIDE_FACTOR - 1)) {
// loop to sort for each value of stride
stride = stride / STRIDE_FACTOR;
for (c = stride; c < count; c++) {
found = NO;
d = c - stride;
while ((d >= 0) && !found) {
// move to left until correct place
id a = [self objectAtIndex:d + stride];
id b = [self objectAtIndex:d];
if ((*compare)(a, b, context) == NSOrderedAscending) {
[a retain];
[b retain];
[self replaceObjectAtIndex:d + stride withObject:b];
[self replaceObjectAtIndex:d withObject:a];
d -= stride; // jump by stride factor
[a release];
[b release];
}
else found = YES;
}
}
}
}
@end