Mercurial > projects > ldc
view runtime/internal/qsort2.d @ 1351:8d501abecd24
Initial (but disabled) fix for ticket #294 , the actual part that fixes the bug is in a #if 0 block as I'm afraid it will cause regressions. I'm most likely not going to be around tonight, and maybe not tomorrow as well, so I'm pushing it in case someone wants to run some serious testing/investigate the problem noted in llvmhelpers.cpp : realignOffset .
author | Tomas Lindquist Olsen <tomas.l.olsen gmail com> |
---|---|
date | Thu, 14 May 2009 17:20:17 +0200 |
parents | 30b42a283c8e |
children |
line wrap: on
line source
/* * 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; private TypeInfo tiglobal; extern (C) int cmp(void* p1, void* p2) { return tiglobal.compare(p1, p2); } extern (C) void[] _adSort(void[] 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]); } }