/* Quicksort + Insertion sort for small arrays */
#define SMALL 8
-#define SWAP(a,b) { itmp=(a); (a)=(b); (b)=itmp; }
+#define MIDL_SWAP(a,b) { itmp=(a); (a)=(b); (b)=itmp; }
void
mdb_midl_sort( MDB_IDL ids )
l = istack[jstack--];
} else {
k = (l + ir) >> 1; /* Choose median of left, center, right */
- SWAP(ids[k], ids[l+1]);
+ MIDL_SWAP(ids[k], ids[l+1]);
if (ids[l] < ids[ir]) {
- SWAP(ids[l], ids[ir]);
+ MIDL_SWAP(ids[l], ids[ir]);
}
if (ids[l+1] < ids[ir]) {
- SWAP(ids[l+1], ids[ir]);
+ MIDL_SWAP(ids[l+1], ids[ir]);
}
if (ids[l] < ids[l+1]) {
- SWAP(ids[l], ids[l+1]);
+ MIDL_SWAP(ids[l], ids[l+1]);
}
i = l+1;
j = ir;
do i++; while(ids[i] > a);
do j--; while(ids[j] < a);
if (j < i) break;
- SWAP(ids[i],ids[j]);
+ MIDL_SWAP(ids[i],ids[j]);
}
ids[l+1] = ids[j];
ids[j] = a;