Commit all changes for development gawk.

6 files changed, 95 insertions, 0 deletions

diff --git a/awklib/eg/data/class_data1 b/awklib/eg/data/class_data1
new file mode 100644
index 00000000..864c2842
--- /dev/null
+++ b/awklib/eg/data/class_data1
@@ -0,0 +1,3 @@
+Biology_101 sum average data: 87.0 92.4 78.5 94.9
+Chemistry_305 sum average data: 75.2 98.3 94.7 88.2
+English_401 sum average data: 100.0 95.6 87.1 93.4
diff --git a/awklib/eg/data/class_data2 b/awklib/eg/data/class_data2
new file mode 100644
index 00000000..f5de0e29
--- /dev/null
+++ b/awklib/eg/data/class_data2
@@ -0,0 +1,3 @@
+Biology_101 sum average sort rsort data: 87.0 92.4 78.5 94.9
+Chemistry_305 sum average sort rsort data: 75.2 98.3 94.7 88.2
+English_401 sum average sort rsort data: 100.0 95.6 87.1 93.4
diff --git a/awklib/eg/lib/quicksort.awk b/awklib/eg/lib/quicksort.awk
new file mode 100644
index 00000000..aa67736d
--- /dev/null
+++ b/awklib/eg/lib/quicksort.awk
@@ -0,0 +1,34 @@
+# quicksort.awk --- Quicksort algorithm, with user-supplied
+#                   comparison function
+#
+# Arnold Robbins, arnoldskeeve.com, Public Domain
+# January 2009
+# quicksort --- C.A.R. Hoare's quick sort algorithm. See Wikipedia
+#               or almost any algorithms or computer science text
+#
+# Adapted from K&R-II, page 110
+end ignore
+
+function quicksort(data, left, right, less_than,    i, last)
+{
+    if (left >= right)  # do nothing if array contains fewer
+        return          # than two elements
+
+    quicksort_swap(data, left, int((left + right) / 2))
+    last = left
+    for (i = left + 1; i <= right; i++)
+        if (@less_than(data[i], data[left]))
+            quicksort_swap(data, ++last, i)
+    quicksort_swap(data, left, last)
+    quicksort(data, left, last - 1, less_than)
+    quicksort(data, last + 1, right, less_than)
+}
+
+# quicksort_swap --- helper function for quicksort, should really be inline
+
+function quicksort_swap(data, i, j, temp)
+{
+    temp = data[i]
+    data[i] = data[j]
+    data[j] = temp
+}
diff --git a/awklib/eg/misc/addresses.csv b/awklib/eg/misc/addresses.csv
new file mode 100644
index 00000000..a9eee0b2
--- /dev/null
+++ b/awklib/eg/misc/addresses.csv
@@ -0,0 +1 @@
+Robbins,Arnold,"1234 A Pretty Street, NE",MyTown,MyState,12345-6789,USA
diff --git a/awklib/eg/misc/simple-csv.awk b/awklib/eg/misc/simple-csv.awk
new file mode 100644
index 00000000..36cb4a6e
--- /dev/null
+++ b/awklib/eg/misc/simple-csv.awk
@@ -0,0 +1,10 @@
+BEGIN {
+    FPAT = "([^,]+)|(\"[^\"]+\")"
+}
+
+{
+    print "NF = ", NF
+    for (i = 1; i <= NF; i++) {
+        printf("$%d = <%s>\n", i, $i)
+    }
+}
diff --git a/awklib/eg/prog/indirectcall.awk b/awklib/eg/prog/indirectcall.awk
new file mode 100644
index 00000000..56843d5d
--- /dev/null
+++ b/awklib/eg/prog/indirectcall.awk
@@ -0,0 +1,44 @@
+# num_lt --- do a numeric less than comparison
+
+function num_lt(left, right)
+{
+    return ((left + 0) < (right + 0))
+}
+
+# num_ge --- do a numeric greater than or equal to comparison
+
+function num_ge(left, right)
+{
+    return ((left + 0) >= (right + 0))
+}
+# do_sort --- sort the data according to `compare' and return it as a string
+
+function do_sort(first, last, compare,      data, i, retval)
+{
+    delete data
+    for (i = 1; first <= last; first++) {
+        data[i] = $first
+        i++
+    }
+
+    quicksort(data, 1, i-1, compare)
+
+    retval = data[1]
+    for (i = 2; i in data; i++)
+        retval = retval " " data[i]
+    
+    return retval
+}
+# sort --- sort the data in ascending order and return it as a string
+
+function sort(first, last)
+{
+    return do_sort(first, last, "num_lt")
+}
+
+# rsort --- sort the data in descending order and return it as a string
+
+function rsort(first, last)
+{
+    return do_sort(first, last, "num_ge")
+}