1N/A/***********************************************************************
1N/A* *
1N/A* This software is part of the ast package *
1N/A* Copyright (c) 1985-2011 AT&T Intellectual Property *
1N/A* and is licensed under the *
1N/A* Common Public License, Version 1.0 *
1N/A* by AT&T Intellectual Property *
1N/A* *
1N/A* A copy of the License is available at *
1N/A* http://www.opensource.org/licenses/cpl1.0.txt *
1N/A* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
1N/A* *
1N/A* Information and Software Systems Research *
1N/A* AT&T Research *
1N/A* Florham Park NJ *
1N/A* *
1N/A* Glenn Fowler <gsf@research.att.com> *
1N/A* David Korn <dgk@research.att.com> *
1N/A* Phong Vo <kpv@research.att.com> *
1N/A* *
1N/A***********************************************************************/
1N/A#pragma prototyped
1N/A/*
1N/A * strsort - sort an array pointers using fn
1N/A *
1N/A * fn follows strcmp(3) conventions
1N/A *
1N/A * David Korn
1N/A * AT&T Bell Laboratories
1N/A *
1N/A * derived from Bourne Shell
1N/A */
1N/A
1N/A#include <ast.h>
1N/A
1N/Avoid
1N/Astrsort(char** argv, int n, int(*fn)(const char*, const char*))
1N/A{
1N/A register int i;
1N/A register int j;
1N/A register int m;
1N/A register char** ap;
1N/A char* s;
1N/A int k;
1N/A
1N/A for (j = 1; j <= n; j *= 2);
1N/A for (m = 2 * j - 1; m /= 2;)
1N/A for (j = 0, k = n - m; j < k; j++)
1N/A for (i = j; i >= 0; i -= m)
1N/A {
1N/A ap = &argv[i];
1N/A if ((*fn)(ap[m], ap[0]) >= 0) break;
1N/A s = ap[m];
1N/A ap[m] = ap[0];
1N/A ap[0] = s;
1N/A }
1N/A}