getmx() now uses our array class

[citadel.git] / libcitadel / lib / array.c

diff --git a/libcitadel/lib/array.c b/libcitadel/lib/array.c
index 444a3470a48b4e194e4a9977566778026936351f..c8f433f5d5c3bdf2a070a060a56936854d8468ae 100644 (file)
--- a/libcitadel/lib/array.c
+++ b/libcitadel/lib/array.c
@@ -87,3 +87,12 @@ void *array_get_element_at(Array *arr, int index) {
 int array_len(Array *arr) {
        return arr->num_elements;
 }
+
+
+/*
+ * Sort an array.  We already know the element size and number of elements, so all we need is
+ * a sort function, which we will pass along to qsort().
+ */
+void array_sort(Array *arr, int (*compar)(const void *, const void *)) {
+       qsort(arr->the_elements, arr->num_elements, arr->element_size, compar);
+}