Mercurial > projects > ldc
diff druntime/src/compiler/ldc/qsort2.d @ 759:d3eb054172f9
Added copy of druntime from DMD 2.020 modified for LDC.
author | Tomas Lindquist Olsen <tomas.l.olsen@gmail.com> |
---|---|
date | Tue, 11 Nov 2008 01:52:37 +0100 |
parents | |
children |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/druntime/src/compiler/ldc/qsort2.d Tue Nov 11 01:52:37 2008 +0100 @@ -0,0 +1,67 @@ + +/* + * 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; + +version( D_Version2 ) +private import stdlib = stdc.stdlib; +else +private import stdlib = tango.stdc.stdlib; + +private TypeInfo tiglobal; + +extern (C) int cmp(in void* p1, in void* p2) +{ + return tiglobal.compare(p1, p2); +} + +extern (C) void[] _adSort(void[] a, TypeInfo ti) +{ + synchronized + { + tiglobal = ti; + 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]); + } +}