mirror of
https://github.com/ldc-developers/ldc.git
synced 2025-05-08 20:06:03 +03:00
964f91b5a1
Branch statements now emit a new block after it. Fixed the _adSort runtime function had a bad signature. Added a missing dot prefix on compiler generated string tables for string switch. Fixed, PTRSIZE seems like it was wrong on 64bit, now it definitely gets set properly.
70 lines
1.1 KiB
D
70 lines
1.1 KiB
D
|
|
/*
|
|
* Placed into Public Domain
|
|
* written by Walter Bright
|
|
* www.digitalmars.com
|
|
*
|
|
* This is a public domain version of qsort.d.
|
|
* All it does is call C's qsort(), but runs a little slower since
|
|
* it needs to synchronize a global variable.
|
|
*/
|
|
|
|
/*
|
|
* Modified by Sean Kelly <sean@f4.ca> for use with Tango.
|
|
*/
|
|
|
|
//debug=qsort;
|
|
|
|
private import tango.stdc.stdlib;
|
|
|
|
struct Array
|
|
{
|
|
size_t length;
|
|
void* ptr;
|
|
}
|
|
|
|
private TypeInfo tiglobal;
|
|
|
|
extern (C) int cmp(void* p1, void* p2)
|
|
{
|
|
return tiglobal.compare(p1, p2);
|
|
}
|
|
|
|
extern (C) Array _adSort(Array a, TypeInfo ti)
|
|
{
|
|
synchronized
|
|
{
|
|
tiglobal = ti;
|
|
tango.stdc.stdlib.qsort(a.ptr, a.length, cast(size_t)ti.tsize(), &cmp);
|
|
}
|
|
return a;
|
|
}
|
|
|
|
|
|
|
|
unittest
|
|
{
|
|
debug(qsort) printf("array.sort.unittest()\n");
|
|
|
|
int a[] = new int[10];
|
|
|
|
a[0] = 23;
|
|
a[1] = 1;
|
|
a[2] = 64;
|
|
a[3] = 5;
|
|
a[4] = 6;
|
|
a[5] = 5;
|
|
a[6] = 17;
|
|
a[7] = 3;
|
|
a[8] = 0;
|
|
a[9] = -1;
|
|
|
|
a.sort;
|
|
|
|
for (int i = 0; i < a.length - 1; i++)
|
|
{
|
|
//printf("i = %d", i);
|
|
//printf(" %d %d\n", a[i], a[i + 1]);
|
|
assert(a[i] <= a[i + 1]);
|
|
}
|
|
}
|