Huge update: cqueue and cdeq completely rewritten. cvec and cdeq API harmonized. Docs update/improved.

1 files changed, 0 insertions, 89 deletions

diff --git a/include/stc/algo/csort.h b/include/stc/algo/csort.h
deleted file mode 100644
index e01a2893..00000000
--- a/include/stc/algo/csort.h
+++ /dev/null
@@ -1,89 +0,0 @@
-/* MIT License
- *
- * Copyright (c) 2023 Tyge Løvset
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in all
- * copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-/* Generic Quicksort in C, performs as fast as c++ std::sort().
-template params:
-#define i_val           - value type [required]
-#define i_less          - less function. default: *x < *y
-#define i_tag NAME      - define csort_NAME(). default {i_val}
-
-// test:
-#include <stdio.h>
-#define i_val int
-#include <stc/algo/csort.h>
-
-int main() {
-    int arr[] = {23, 321, 5434, 25, 245, 1, 654, 33, 543, 21};
-    
-    csort_int(arr, c_arraylen(arr));
-
-    for (int i = 0; i < c_arraylen(arr); i++)
-        printf(" %d", arr[i]);
-    puts("");
-}
-*/
-#include "../ccommon.h"
-#define _i_prefix csort_
-#include "../priv/template.h"
-
-typedef i_val _cx_value;
-
-static inline void _cx_memb(_insertion)(i_val arr[], intptr_t lo, intptr_t hi) {
-    for (intptr_t j = lo, i = lo + 1; i <= hi; j = i, ++i) {
-        i_val key = arr[i];
-        while (j >= 0 && (i_less((&key), (&arr[j])))) {
-            arr[j + 1] = arr[j];
-            --j;
-        }
-        arr[j + 1] = key;
-    }
-}
-
-static inline void _cx_memb(_quicksort)(i_val arr[], intptr_t lo, intptr_t hi) {
-    intptr_t i = lo, j;
-    while (lo < hi) {
-        i_val pivot = arr[lo + (hi - lo)*7/16];
-        j = hi;
-
-        while (i <= j) {
-            while (i_less((&arr[i]), (&pivot))) ++i;
-            while (i_less((&pivot), (&arr[j]))) --j;
-            if (i <= j) {
-                c_swap(i_val, arr+i, arr+j);
-                ++i; --j;
-            }
-        }
-        if (j - lo > hi - i) {
-            c_swap(intptr_t, &lo, &i);
-            c_swap(intptr_t, &hi, &j);
-        }
-
-        if (j - lo > 64) _cx_memb(_quicksort)(arr, lo, j);
-        else if (j > lo) _cx_memb(_insertion)(arr, lo, j);
-        lo = i;
-    }
-}
-
-static inline void _cx_self(i_val arr[], intptr_t n)
-    { _cx_memb(_quicksort)(arr, 0, n - 1); }
-
-#include "../priv/template2.h"