Revision 795 branches/replacement/src/linad99/qsort.h

qsort.h (revision 795)
2 2
 * $Id$
3 3
 *
4 4
 * Modified by Derek Seiple
5
 * Copyright (c) 2009 ADMB Foundation
5
 * Copyright (c) 2010 ADMB Foundation
6 6
 *
7 7
 * Adopted from GNU glibc by Mjt.
8 8
 * See stdlib/qsort.c in glibc
......
125 125
	((--top, (low = top->_lo2), (high = top->_hi2)))
126 126
#define	_QSORT_STACK_NOT_EMPTY	(_stack < _top)
127 127

  
128

  
129 128
/* Order size using quicksort.  This implementation incorporates
130 129
   four optimizations discussed in Sedgewick:
131 130

  
......
311 310
									\
312 311
}
313 312

  
314

  
315

  
316

  
317

  
318

  
319

  
320

  
321
/* The main code starts here... */
322 313
//modified by Derek Seiple
323 314
#define QSORT2(QSORT_TYPE,QSORT_TYPE2,QSORT_BASE,QSORT_BASE2,QSORT_NELT,QSORT_LT)	\
324 315
{									\

Also available in: Unified diff