Prepared v4.0 BETA.

2 files changed, 27 insertions, 19 deletions

diff --git a/README.md b/README.md
index 86187575..29c28a4f 100644
--- a/README.md
+++ b/README.md
@@ -3,10 +3,13 @@
 STC - Smart Template Containers for C
 =====================================
 
-News: Version 3.9 released (July 2022)
+News: Version 4.0 BETA (Aug 2022)
 ---------------------------------------
-- "ccommon API: `c_forrange` with 3 to 5 args swapped 1st <-> 2nd.
-- **csview** fully inlined and tokenizer fix
+- Removed macro `c_apply` - usage was not intuitive.
+- `c_forarray` macro replaces usages of `c_apply`.
+- Minor changes in API of **cregex**, and improved documentation. 
+- Version 3.9:
+    - "ccommon API: `c_forrange` with 3 to 5 args swapped 1st <-> 2nd.
 - Version 3.8:
     - "Officially" added **cregex** - powerful regular expressions.
     - Added back **coption** - command line argument parsing.
diff --git a/docs/clist_api.md b/docs/clist_api.md
index 274c0f6f..45caeb93 100644
--- a/docs/clist_api.md
+++ b/docs/clist_api.md
@@ -101,36 +101,35 @@ clist_X_value       clist_X_value_clone(clist_X_value val);
 
 Interleave *push_front()* / *push_back()* then *sort()*:
 ```c
+#define i_type DList
 #define i_val double
-#define i_tag d
 #define i_extern // link with sort() fn.
 #include <stc/clist.h>
 
 #include <stdio.h>
 
 int main() {
-    double dv[] = { 10.0, 20.0, 30.0, 40.0, 50.0, 60.0, 70.0, 80.0, 90.0 };
+    DList list = DList_init();
 
-    clist_d list = clist_d_init();
-    c_forrange (i, c_arraylen(dv); ++i)
-        clist_d_push_back(&list, dv[i]);
+    c_forarray (double, v, {10., 20., 30., 40., 50., 60., 70., 80., 90.})
+        DList_push_back(&list, *v);
 
     c_forrange (int, i, 1, 10) {
-        if (i & 1) clist_d_push_front(&list, (float) i);
-        else       clist_d_push_back(&list, (float) i);
+        if (i & 1) DList_push_front(&list, (double) i);
+        else       DList_push_back(&list, (double) i);
     }
 
     printf("initial: ");
-    c_foreach (i, clist_d, list)
+    c_foreach (i, DList, list)
         printf(" %g", *i.ref);
 
-    clist_d_sort(&list); // mergesort O(n*log n)
+    DList_sort(&list); // mergesort O(n*log n)
 
     printf("\nsorted: ");
-    c_foreach (i, clist_d, list)
+    c_foreach (i, DList, list)
         printf(" %g", *i.ref);
 
-    clist_d_drop(&list);
+    DList_drop(&list);
 }
 ```
 Output:
@@ -152,6 +151,7 @@ Use of *erase_at()* and *erase_range()*:
 int main ()
 {
     clist_i L = clist_i_init();
+
     c_forarray (int, v, {10, 20, 30, 40, 50})
         clist_i_push_back(&L, *v);
                                                 // 10 20 30 40 50
@@ -164,7 +164,8 @@ int main ()
     it = clist_i_erase_range(&L, it, end);      // 10 30
                                                 //       ^
     printf("mylist contains:");
-    c_foreach (x, clist_i, L) printf(" %d", *x.ref);
+    c_foreach (x, clist_i, L)
+        printf(" %d", *x.ref);
     puts("");
 
     clist_i_drop(&L);
@@ -188,16 +189,20 @@ Splice `[30, 40]` from *L2* into *L1* before `3`:
 int main() {
     c_auto (clist_i, L1, L2)
     {
-        c_forarray (int, v, {1, 2, 3, 4, 5}) clist_i_push_back(&L1, *v);
-        c_forarray (int, v, {10, 20, 30, 40, 50}) clist_i_push_back(&L2, *v);
+        c_forarray (int, v, {1, 2, 3, 4, 5})
+            clist_i_push_back(&L1, *v);
+        c_forarray (int, v, {10, 20, 30, 40, 50})
+            clist_i_push_back(&L2, *v);
 
         clist_i_iter i = clist_i_advance(clist_i_begin(&L1), 2);
         clist_i_iter j1 = clist_i_advance(clist_i_begin(&L2), 2), j2 = clist_i_advance(j1, 2);
 
         clist_i_splice_range(&L1, i, &L2, j1, j2);
 
-        c_foreach (i, clist_i, L1) printf(" %d", *i.ref); puts("");
-        c_foreach (i, clist_i, L2) printf(" %d", *i.ref); puts("");
+        c_foreach (i, clist_i, L1)
+            printf(" %d", *i.ref); puts("");
+        c_foreach (i, clist_i, L2)
+            printf(" %d", *i.ref); puts("");
     }
 }
 ```