mirror of
https://github.com/xomboverlord/ldc.git
synced 2026-01-12 10:53:14 +01:00
d51e392b8d
Fixed some problems with the string runtime support functions. Fixed initialization of array of structs. Fixed slice assignment where LHS is slice but RHS is dynamic array. Fixed problems with result of assignment expressions. Fixed foreach problems with key type mismatches.
70 lines
1.0 KiB
D
70 lines
1.0 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.
|
|
*/
|
|
|
|
|
|
//debug=qsort;
|
|
|
|
import std.c.stdlib;
|
|
|
|
pragma(LLVM_internal, "notypeinfo")
|
|
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;
|
|
std.c.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]);
|
|
}
|
|
}
|
|
|