blob: e7ab49af9a5e74d9405f3485b4248a33bb37793a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
/***********************************************************************
* *
* This software is part of the ast package *
* Copyright (c) 1985-2011 AT&T Intellectual Property *
* and is licensed under the *
* Eclipse Public License, Version 1.0 *
* by AT&T Intellectual Property *
* *
* A copy of the License is available at *
* http://www.eclipse.org/org/documents/epl-v10.html *
* (with md5 checksum b35adb5213ca9657e911e9befb180842) *
* *
* Information and Software Systems Research *
* AT&T Research *
* Florham Park NJ *
* *
* Glenn Fowler <gsf@research.att.com> *
* David Korn <dgk@research.att.com> *
* Phong Vo <kpv@research.att.com> *
* *
***********************************************************************/
#pragma prototyped
/*
* strsort - sort an array pointers using fn
*
* fn follows strcmp(3) conventions
*
* David Korn
* AT&T Bell Laboratories
*
* derived from Bourne Shell
*/
#include <ast.h>
void
strsort(char** argv, int n, int(*fn)(const char*, const char*))
{
register int i;
register int j;
register int m;
register char** ap;
char* s;
int k;
for (j = 1; j <= n; j *= 2);
for (m = 2 * j - 1; m /= 2;)
for (j = 0, k = n - m; j < k; j++)
for (i = j; i >= 0; i -= m)
{
ap = &argv[i];
if ((*fn)(ap[m], ap[0]) >= 0) break;
s = ap[m];
ap[m] = ap[0];
ap[0] = s;
}
}
|
