Add cstl headers, comparators and docs

Introduce modular cstl headers and update comparators; add docs and small example fixes.

Changes include:
- Added opencstl/cstl.h and integrated cstl.h into opencstl/opencstl.h.
- Refactored comparison API: renamed builtin compare functions to less_* and added greater_* counterparts; introduced CSTL_LESS/CSTL_GREATER and macros LESS(TYPE)/GREATER(TYPE) for easier comparator selection.
- Exposed stable_sort/msort via cstl_msort and kept sort mapping to qsort.
- Updated examples and main: switched GETLINE -> FGETLINE, updated qsort/bsearch calls to use LESS(), removed stray tokens, fixed printf format for size, added test02() which demonstrates GREATER sorting and is called from main (exits after run).
- Documentation: added docs/README.md and linked it from README, README.ko.md and README.zh.md; removed mkdocs.yml.
- Added amalgamate.bat and removed binary perftest.

These changes reorganize compare/sort utilities, provide explicit less/greater helpers, and update examples/docs to use the new APIs.

Author: springkim

README.ko.md

@@ -41,6 +41,10 @@ curl -LO "https://raw.githubusercontent.com/springkim/OpenCSTL/refs/heads/master
 | MinGW64 | ✅ | | |
 | Intel (icx-cc) | ✅ | ✅ | ✅ |
 
+## 문서
+
+[문서](./docs/README.md)
+
 ## 예제
 
 ```c

README.md

@@ -41,6 +41,12 @@ curl -LO "https://raw.githubusercontent.com/springkim/OpenCSTL/refs/heads/master
 | MinGW64 | ✅ | | |
 | Intel (icx-cc) | ✅ | ✅ | ✅ |
 
+## Document
+
+[Document](./docs/README.md)
+
+
+
 ## Example
 
 ```c

README.zh.md

@@ -41,6 +41,12 @@ curl -LO "https://raw.githubusercontent.com/springkim/OpenCSTL/refs/heads/master
 | MinGW64 | ✅ | | |
 | Intel (icx-cc) | ✅ | ✅ | ✅ |
 
+## 文档
+
+[文档](./docs/README.md)
+
+
+
 ## 示例
 
 ```c

amalgamate.bat

@@ -0,0 +1,3 @@
+python amalgamate.py
+
+pause

docs/README.md

@@ -6,6 +6,12 @@ C99 · C11 · C17 · C23
 
 ---
 
+
+
+[container document](./_containers.md)
+
+
+
 ## Why OpenCSTL?
 
 - **Single-header** — Just `#include "opencstl.h"` and you're done. No build steps, no linking.
@@ -131,7 +137,7 @@ int main() {
 | [`DEQUE`](__deque.md) | Sequence | `T*` | ✅ | `it++` |
 | [`SET`](__set.md) | Associative | `T**` | ❌ | `next(it)` |
 | [`MAP`](__map.md) | Associative | `K**` | ❌ | `next(it)` |
-| [`UNORDERED_SET`](__unordered_set.md) | Unordered | `T**` | ✅ (bucket) | `next(it)` |
+| [`UNORDERED_SET`](__unordered_set.md) | Unordered | `T**` | ❌ | `next(it)` |
 | [`UNORDERED_MAP`](__unordered_map.md) | Unordered | `K**` | ❌ | `next(it)` |
 | [`STACK`](__stack.md) | Adaptor | `T*` | ❌ | — |
 | [`QUEUE`](__queue.md) | Adaptor | `T*` | ❌ | — |

examples/example_02.c

@@ -6,7 +6,7 @@ int main() {
     FILE *fp = NULL;
     FOPEN(&fp, "words_random.txt", "rt");
     char line[1024] = {0};
-    while (GETLINE(fp, line, 1024)) {
+    while (FGETLINE(fp, line, 1024)) {
         int length = strlen(line);
         char *word = (char *) calloc(length + 1, sizeof(char));
         strncpy(word, line, length);
@@ -15,7 +15,7 @@ int main() {
     FCLOSE(fp);
 
     // qsort example
-    qsort(v,size(v), sizeof(char *), StringCmp);
+    qsort(v,size(v), sizeof(char *), LESS(char*));
 
 
     for (int i = 0; i < size(v); i++) {
@@ -24,7 +24,7 @@ int main() {
 
     // bsearch example
     char *key = "spring";
-    void *iter = bsearch(&key, v,size(v), sizeof(char *), StringCmp);
+    void *iter = bsearch(&key, v,size(v), sizeof(char *), LESS(char*));
 
     int idx = (char **) iter - (char **) v;
     printf("bsearch: %s(%d)\n", *(char **) iter, idx);

examples/example_06.c

@@ -1,7 +1,7 @@
 #include"opencstl.h"
 
 int main() {
-    QUEUE(int) q = new_priority_queue(int, IntCmp);
+    QUEUE(int) q = new_priority_queue(int);
     for (int i = 0; i < 10; i++) {
         push(q, i);
     }
@@ -12,5 +12,4 @@ int main() {
     puts("");
     destroy(q);
     return 0;
-    qsort
 }

examples/example_basic_01.c

@@ -42,8 +42,8 @@ void example_map() {
         "vector", "list", "set", "map", "stack", "queue", "priority_queue", "unordered_map", "unordered_set"
     };
     size_t len = sizeof(containers) / sizeof(containers[0]);
-    printf("Number of elements: %d\n", len);
-    MAP(int) d = new_map(int, char*, COMPARE(int));
+    printf("Number of elements: %llu\n", len);
+    MAP(int) d = new_map(int, char*);
     for (int i = 0; i < len; i++) {
         insert(d, i, containers[i]);
     }

main.c

@@ -92,7 +92,7 @@ void cstl_vector_test3() {
     }
 
 
-    stable_sort(vec,size(vec), sizeof(int), COMPARE(int));
+    stable_sort(vec,size(vec), sizeof(int), LESS(int));
     for (int i = 0; i < size(vec); i++) {
         printf("Sorted: [%lld]\n", vec[i]);
     }
@@ -369,6 +369,22 @@ void test01() {
     cstl_hash_test();
 }
 
+void test02() {
+    VECTOR(int) v = new_vector(int);
+    for (int i = 0; i < 1000; i++) {
+        push_back(v, rand32()%10000);
+    }
+
+    sort(v,size(v), sizeof(int),GREATER(int));
+
+
+    for (int i = 0; i < size(v); i++) {
+        printf("%d\n", v[i]);
+    }
+
+    exit(0);
+}
+
 #include <stdio.h>
 
 const char *get_c_version(void) {
@@ -423,6 +439,7 @@ void print_c_version(void) {
 
 
 int main() {
+    test02();
     print_c_version();
     test01();
     //cstl_priority_queue_test();