2012-09-19 13:31:09 +00:00
|
|
|
/* Implementation of QuickSort for GNUStep
|
|
|
|
Copyright (C) 2005-2012 Free Software Foundation, Inc.
|
|
|
|
|
|
|
|
Written by: Saso Kiselkov <diablos@manga.sk>
|
|
|
|
Date: 2005
|
|
|
|
|
|
|
|
Modified by: Niels Grewe <niels.grewe@halbordnung.de>
|
|
|
|
Date: September 2012
|
|
|
|
|
|
|
|
This file is part of the GNUstep Base Library.
|
|
|
|
|
|
|
|
This library is free software; you can redistribute it and/or
|
|
|
|
modify it under the terms of the GNU Lesser General Public
|
|
|
|
License as published by the Free Software Foundation; either
|
|
|
|
version 2 of the License, or (at your option) any later version.
|
|
|
|
|
|
|
|
This library is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
2019-12-09 23:36:00 +00:00
|
|
|
Lesser General Public License for more details.
|
2012-09-19 13:31:09 +00:00
|
|
|
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
|
|
License along with this library; if not, write to the Free
|
|
|
|
Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
2019-12-09 23:36:00 +00:00
|
|
|
Boston, MA 02110 USA.
|
2012-09-19 13:31:09 +00:00
|
|
|
*/
|
|
|
|
|
2012-09-20 09:32:00 +00:00
|
|
|
#import "common.h"
|
2012-09-19 13:31:09 +00:00
|
|
|
#import "Foundation/NSSortDescriptor.h"
|
|
|
|
#import "Foundation/NSArray.h"
|
|
|
|
#import "Foundation/NSObjCRuntime.h"
|
|
|
|
#import "GSSorting.h"
|
|
|
|
|
2016-05-14 09:34:01 +00:00
|
|
|
/**
|
|
|
|
* Sorts the provided object array's sortRange according to sortDescriptor.
|
|
|
|
*/
|
|
|
|
// Quicksort algorithm copied from Wikipedia :-).
|
|
|
|
|
2012-09-19 13:31:09 +00:00
|
|
|
static inline void
|
|
|
|
SwapObjects(id * o1, id * o2)
|
|
|
|
{
|
|
|
|
id temp;
|
|
|
|
|
|
|
|
temp = *o1;
|
|
|
|
*o1 = *o2;
|
|
|
|
*o2 = temp;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
_GSQuickSort(id *objects,
|
2012-09-19 14:20:01 +00:00
|
|
|
NSRange sortRange,
|
|
|
|
id comparisonEntity,
|
|
|
|
GSComparisonType type,
|
|
|
|
void *context)
|
2012-09-19 13:31:09 +00:00
|
|
|
{
|
|
|
|
if (sortRange.length > 1)
|
|
|
|
{
|
|
|
|
id pivot = objects[sortRange.location];
|
|
|
|
unsigned int left = sortRange.location + 1;
|
|
|
|
unsigned int right = NSMaxRange(sortRange);
|
|
|
|
|
|
|
|
while (left < right)
|
|
|
|
{
|
2012-09-20 10:19:18 +00:00
|
|
|
if (GSCompareUsingDescriptorOrComparator(objects[left], pivot,
|
2012-09-19 13:31:09 +00:00
|
|
|
comparisonEntity, type, context) == NSOrderedDescending)
|
|
|
|
{
|
|
|
|
SwapObjects(&objects[left], &objects[--right]);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
left++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
SwapObjects(&objects[--left], &objects[sortRange.location]);
|
2012-09-20 10:19:18 +00:00
|
|
|
_GSQuickSort(objects,
|
|
|
|
NSMakeRange(sortRange.location, left - sortRange.location),
|
|
|
|
comparisonEntity, type, context);
|
|
|
|
_GSQuickSort(objects,
|
|
|
|
NSMakeRange(right, NSMaxRange(sortRange) - right),
|
|
|
|
comparisonEntity, type, context);
|
2012-09-19 13:31:09 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
@interface GSQuickSortPlaceHolder : NSObject
|
2016-07-15 11:30:07 +00:00
|
|
|
+ (void) setUnstable;
|
2012-09-19 13:31:09 +00:00
|
|
|
@end
|
|
|
|
|
|
|
|
@implementation GSQuickSortPlaceHolder
|
2016-07-15 11:30:07 +00:00
|
|
|
+ (void) setUnstable
|
2012-09-19 13:31:09 +00:00
|
|
|
{
|
|
|
|
_GSSortUnstable = _GSQuickSort;
|
|
|
|
}
|
|
|
|
@end
|