summaryrefslogtreecommitdiff
path: root/src/lib/libast/man/strsort.3
diff options
context:
space:
mode:
authorIgor Pashev <pashev.igor@gmail.com>2012-06-24 22:28:35 +0000
committerIgor Pashev <pashev.igor@gmail.com>2012-06-24 22:28:35 +0000
commit3950ffe2a485479f6561c27364d3d7df5a21d124 (patch)
tree468c6e14449d1b1e279222ec32f676b0311917d2 /src/lib/libast/man/strsort.3
downloadksh-upstream.tar.gz
Imported Upstream version 93u+upstream
Diffstat (limited to 'src/lib/libast/man/strsort.3')
-rw-r--r--src/lib/libast/man/strsort.373
1 files changed, 73 insertions, 0 deletions
diff --git a/src/lib/libast/man/strsort.3 b/src/lib/libast/man/strsort.3
new file mode 100644
index 0000000..c48cfc2
--- /dev/null
+++ b/src/lib/libast/man/strsort.3
@@ -0,0 +1,73 @@
+.fp 5 CW
+.de Af
+.ds ;G \\*(;G\\f\\$1\\$3\\f\\$2
+.if !\\$4 .Af \\$2 \\$1 "\\$4" "\\$5" "\\$6" "\\$7" "\\$8" "\\$9"
+..
+.de aF
+.ie \\$3 .ft \\$1
+.el \{\
+.ds ;G \&
+.nr ;G \\n(.f
+.Af "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7" "\\$8" "\\$9"
+\\*(;G
+.ft \\n(;G \}
+..
+.de L
+.aF 5 \\n(.f "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7"
+..
+.de LR
+.aF 5 1 "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7"
+..
+.de RL
+.aF 1 5 "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7"
+..
+.de EX \" start example
+.ta 1i 2i 3i 4i 5i 6i
+.PP
+.RS
+.PD 0
+.ft 5
+.nf
+..
+.de EE \" end example
+.fi
+.ft
+.PD
+.RE
+.PP
+..
+.TH HSORT 3
+.SH NAME
+hsort \- array heap sort
+.SH SYNOPSIS
+.EX
+#include <ast.h>
+
+void strsort(char** \fIarray\fP, int \fIelements\fP, int (*\fIcompare\fP)(const char* \fIa\fP, const char* \fIb\fP));
+.EE
+.SH DESCRIPTION
+.L strsort
+does a heap sort on the array of pointers
+.I array
+with
+.I elements
+elements using the comparison function
+.IR compare .
+.I compare
+returns
+.L \-1
+if
+.I a
+is lexicographically less than
+.IR b ,
+.L 0
+if
+.I a
+is equal to
+.IR b ,
+and
+.L 1
+if
+.I a
+is lexicographically greater than
+.IR b .