• See details for breaking changes.

STC is a modern, typesafe, fast and compact container and algorithms library for C99. The API naming is similar to C++ STL, but it takes inspiration from Rust and Python as well. The library handles everything from trivial to highly complex data using templates.

• carc - std::shared_ptr alike type
• cbox - std::unique_ptr alike type
• cbits - std::bitset alike type
• clist - std::forward_list alike type
• cstack - std::stack alike type
• cvec - std::vector alike type
• cqueue - std::queue alike type
• cdeq - std::deque alike type
• cpque - std::priority_queue alike type
• cmap - std::unordered_map alike type
• cset - std::unordered_set alike type
• csmap - std::map sorted map alike type
• csset - std::set sorted set alike type
• cstr - std::string alike type
• csview - std::string_view alike type
• crawstr - null-terminated string view type
• cspan - std::span + std::mdspan alike type

• Ranged for-loops - c_foreach, c_forpair, c_forlist
• Range algorithms - c_forrange, crange, c_forfilter
• Generic algorithms - c_init, stc_find_if, stc_erase_if, X_quicksort, etc.
• Coroutines - ergonomic portable coroutines
• Regular expressions - Rob Pike's Plan 9 regexp modernized!
• Random numbers - a very fast PRNG based on SFC64
• Command line argument parser - similar to getopt()

• Highlights
• STC is unique!
• Performance
• Naming conventions
• Usage
• Installation
• Specifying template parameters
• Specifying comparison parameters
• The emplace methods
• The erase methods
• User-defined container type name
• Forward declarations
• Per container-instance customization
• Memory efficiency

• Minimal boilerplate code - Specify only the required template parameters, and leave the rest as defaults.
• Fully type safe - Because of templating, it avoids error-prone casting of container types and elements back and forth from the containers.
• High performance - Unordered maps and sets, queues and deques are significantly faster than the C++ STL containers, the remaining are similar or close to STL in speed (See graph below).
• Fully memory managed - Containers destructs keys/values via default or user supplied drop function. They may be cloned if element types are clonable. Also, smart pointers are supported and can be stored in containers. See carc and cbox.
• Uniform, easy-to-learn API - Just include the headers and you are good. The API and functionality resembles c++ STL and is fully listed in the docs. Intuitive method/type names and uniform usage across the various containers.
• No signed/unsigned mixing - Unsigned sizes and indices mixed with signed for comparison and calculation is asking for trouble. STC only uses signed numbers in the API for this reason.
• Small footprint - Small source code and generated executables. The executable from the example below using four different container types is only 19 Kb in size compiled with gcc -O3 -s on Linux.
• Dual mode compilation - By default it is a simple header-only library with inline and static methods only, but you can easily switch to create a traditional library with shared symbols, without changing existing source files. See the installation section.
• No callback functions - All passed template argument functions/macros are directly called from the implementation, no slow callbacks which requires storage.
• Compiles with C++ and C99 - C code can be compiled with C++ (container element types must be POD).
• Forward declaration - Templated containers may be forward declared without including the full API/implementation.
• Extendable containers - STC provides a mechanism to wrap containers inside a struct with custom data per instance.

1. Centralized analysis of template parameters. The analyser assigns values to all non-specified template parameters (based on the specified ones) using meta-programming, so that you don't have to! You may specify a set of "standard" template parameters for each container, but as a minimum only one is required: i_key (+ i_val for maps). In this case, STC assumes that the elements are of basic types. For non-trivial types, additional template parameters must be given.
2. Alternative insert/lookup type. You may specify an alternative type to use for lookup in containers. E.g., containers with STC string elements (cstr) uses const char* as lookup type, so constructing a cstr (which may allocate memory) for the lookup is not needed. Hence, the alternative lookup key does not need to be destroyed after use, as it is normally a POD type. Finally, the key may be passed to an emplace-function. So instead of calling e.g. cvec_str_push(&vec, cstr_from("Hello")), you may call cvec_str_emplace(&vec, "Hello"), which is functionally identical, but more convenient.
3. Standardized container iterators. All containers can be iterated in the same manner, and all use the same element access syntax. E.g.:
   • c_foreach (it, MyInts, myints) *it.ref += 42; works for any container defined as MyInts with int elements.
   • c_foreach (it, MyInts, it1, it2) *it.ref += 42; iterates from it1 up to not including it2.

STC is a fast and memory efficient library, and code compiles fast:

Benchmark notes:

• The barchart shows average test times over three compilers: Mingw64 13.1.0, Win-Clang 16.0.5, VC-19-36. CPU: Ryzen 7 5700X.
• Containers uses value types uint64_t and pairs of uint64_t for the maps.
• Black bars indicates performance variation between various platforms/compilers.
• Iterations and access are repeated 4 times over n elements.
• access: no entryfor forward_list, deque, and vector because these c++ containers does not have native find().
• deque: insert: n/3 push_front(), n/3 push_back()+pop_front(), n/3 push_back().
• map and unordered map: insert: n/2 random numbers, n/2 sequential numbers. erase: n/2 keys in the map, n/2 random keys.

• Container names are prefixed by c, e.g. cvec, cstr.
• Public STC macros are prefixed by c_, e.g. c_foreach, c_init.
• Template parameter macros are prefixed by i_, e.g. i_key, i_type.
• All containers can be initialized with {0}, i.e. no heap allocation used by default init.
• Common types for a container type Con:
  • Con
  • Con_value
  • Con_raw
  • Con_iter
• Some common function names:
  • Con_init()
  • Con_reserve(&con, capacity)
  • Con_drop(&con)
  • Con_empty(&con)
  • Con_size(&con)
  • Con_clone(con)
  • Con_push(&con, value)
  • Con_emplace(&con, rawval)
  • Con_erase_at(&con, iter)
  • Con_front(&con)
  • Con_back(&con)
  • Con_begin(&con)
  • Con_end(&con)
  • Con_next(&iter)
  • Con_advance(iter, n)

STC containers have similar functionality to C++ STL standard containers. All containers except for a few, like cstr and cbits are generic/templated. No type casting is used, so containers are type-safe like templated types in C++. However, to specify template parameters with STC, you define them as macros prior to including the container.

#define i_type Floats  // Container type name (optional); if not defined name would be cvec_float
#define i_key float    // Container element type
#include "stc/cvec.h"  // "instantiate" the desired container type
#include <stdio.h>

int main(void)
{
    Floats nums = {0};
    Floats_push(&nums, 30.f);
    Floats_push(&nums, 10.f);
    Floats_push(&nums, 20.f);

    for (int i = 0; i < Floats_size(&nums); ++i)
        printf(" %g", nums.data[i]);
    
    c_foreach (i, Floats, nums)     // Alternative and recommended way to iterate.
        printf(" %g", *i.ref);      // i.ref is a pointer to the current element.

    Floats_drop(&nums); // cleanup memory
}

Note that i_val* template parameters can be used instead of i_key* for non-map containers.

Switching to a different container type, e.g. a sorted set (csset):

[ Run this code ]

#define i_type Floats
#define i_key float
#include "stc/csset.h" // Use a sorted set instead
#include <stdio.h>

int main(void)
{
    Floats nums = {0};
    Floats_push(&nums, 30.f);
    Floats_push(&nums, 10.f);
    Floats_push(&nums, 20.f);

    // print the numbers (sorted)
    c_foreach (i, Floats, nums)
        printf(" %g", *i.ref);

    Floats_drop(&nums);
}

Comparison/lookup functions are enabled by default for associative containers and priority queue (cmap, cset, csmap, csset, cpque). To enable it for the remaining containers, define i_cmp or i_less (and optionally i_eq) on the element type. If the element is an integral type, simply define i_use_cmp to use < and == operators for comparisons.

Note that for #define i_key_class Type, defining i_use_cmp means that Type_cmp() function is expected to exist (along with Type_clone() and Type_drop()).

To summarize, i_use_cmp is only needed to enable comparison (sort/search) functions when defining cstack, cvec, cqueue, cdeq, carc, cbox. With built-in types, it enables the comparison operators, whereas for keyclass types, it binds comparison to its Type_cmp() function.

If an element destructor i_keydrop is defined, i_keyclone function is required. Alternatively #define i_opt c_no_clone to disable container cloning.

Let's make a vector of vectors, which can be cloned. All of its element vectors will be destroyed when destroying the Vec2D.

[ Run this code ]

#include <stdio.h>

#define i_type Vec
#define i_key float
#include "stc/cvec.h"

#define i_type Vec2D
#define i_key_class Vec  // Use i_key_class instead i_key when element type has "members" _clone(), _drop() and _cmp().
#include "stc/cvec.h"

int main(void)
{
    Vec* v;
    Vec2D vec = {0};                  // All containers in STC can be initialized with {0}.
    v = Vec2D_push(&vec, Vec_init()); // push() returns a pointer to the new element in vec.
    Vec_push(v, 10.f);
    Vec_push(v, 20.f);

    v = Vec2D_push(&vec, Vec_init());
    Vec_push(v, 30.f);
    Vec_push(v, 40.f);

    Vec2D clone = Vec2D_clone(vec);   // Make a deep-copy of vec

    c_foreach (i, Vec2D, clone)       // Loop through the cloned vector
        c_foreach (j, Vec, *i.ref)
            printf(" %g", *j.ref);

    c_drop(Vec2D, &vec, &clone);      // Cleanup all (6) vectors.
}

This example uses four different container types:

[ Run this code ]

#include <stdio.h>

#define i_key int
#include "stc/cset.h"  // cset_int: unordered set (assume i_key is basic type, uses `==` operator)

struct Point { float x, y; };
// Define cvec_pnt with a less-comparison function for Point.
#define i_key struct Point
#define i_less(a, b) a->x < b->x || (a->x == b->x && a->y < b->y) // enable sort/search
#define i_tag pnt
#include "stc/cvec.h"   // cvec_pnt: vector of struct Point

#define i_key int
#define i_use_cmp       // enable sort/search. Use native `<` and `==` operators
#include "stc/clist.h"  // clist_int: singly linked list

#define i_key int
#define i_val int
#include "stc/csmap.h>  // csmap_int: sorted map int =" int

int main(void)
{
    // Define four empty containers
    cset_int set = {0};
    cvec_pnt vec = {0};
    clist_int lst = {0};
    csmap_int map = {0};

    c_defer( // Drop the containers at scope exit
        cset_int_drop(&set),
        cvec_pnt_drop(&vec),
        clist_int_drop(&lst),
        csmap_int_drop(&map)
    ){
        enum{N = 5};
        int nums[N] = {10, 20, 30, 40, 50};
        struct Point pts[N] = { {10, 1}, {20, 2}, {30, 3}, {40, 4}, {50, 5} };
        int pairs[N][2] = { {20, 2}, {10, 1}, {30, 3}, {40, 4}, {50, 5} };
        
        // Add some elements to each container
        for (int i = 0; i < N; ++i) {
            cset_int_insert(&set, nums[i]);
            cvec_pnt_push(&vec, pts[i]);
            clist_int_push_back(&lst, nums[i]);
            csmap_int_insert(&map, pairs[i][0], pairs[i][1]);
        }

        // Find an element in each container
        cset_int_iter i1 = cset_int_find(&set, 20);
        cvec_pnt_iter i2 = cvec_pnt_find(&vec, (struct Point){20, 2});
        clist_int_iter i3 = clist_int_find(&lst, 20);
        csmap_int_iter i4 = csmap_int_find(&map, 20);

        printf("\nFound: %d, (%g, %g), %d, [%d: %d]\n",
                *i1.ref, i2.ref->x, i2.ref->y, *i3.ref, 
                i4.ref->first, i4.ref->second);
        
        // Erase all the elements found
        cset_int_erase_at(&set, i1);
        cvec_pnt_erase_at(&vec, i2);
        clist_int_erase_at(&lst, i3);
        csmap_int_erase_at(&map, i4);

        printf("After erasing the elements found:");
        printf("\n set:");
        c_foreach (i, cset_int, set)
            printf(" %d", *i.ref);
        
        printf("\n vec:");
        c_foreach (i, cvec_pnt, vec)
            printf(" (%g, %g)", i.ref->x, i.ref->y);
        
        printf("\n lst:");
        c_foreach (i, clist_int, lst)
            printf(" %d", *i.ref);
        
        printf("\n map:");
        c_foreach (i, csmap_int, map)
            printf(" [%d: %d]", i.ref->first, i.ref->second);
    }
}

Output

Found: 20, (20, 2), 20, [20: 2]
After erasing the elements found:    
 set: 40 10 30 50
 vec: (10, 1) (30, 3) (40, 4) (50, 5)
 lst: 10 30 40 50
 map: [10: 1] [30: 3] [40: 4] [50: 5]

STC is primarily a "headers-only" library, so most headers can simply be included in your program. By default, all "templated" functions are static (many inlined). If you add the STC include folder to the CPATH environment variable, GCC, Clang, and TinyC will locate the headers automatically.

The templated container functions are defined with static linking by default, which is normally optimal for both performance and compiled binary size. However, some common container type instances, e.g. cvec_int may be used in several translation units. When they are used in more than 3-4, consider creating a separate header file for them as described here. Now it will use shared linking, so one c-file must implement the templated container, e.g.:

#define i_implement
#include "cvec_int.h"

The non-templated string type cstr uses shared linking by default, but can have static linking instead by #define i_static. Same for the string-view type csview, but most of its functions are static inlined, so linking specifications and implementation are only needed for a few lesser used functions.

Conveniently, src\libstc.c implements all the non-templated functions with shared linking for cstr, csview, cregex, utf8, and crand.

As a special case, you can #define i_import before including cregex or cstr to implement the dependent utf8 functions (proper utf8 case conversions, etc.). Or link with src\libstc.

Each templated type requires one #include, even if it's the same container base type, as described earlier. The template parameters are given by a #define i_xxxx statement, where xxxx is the parameter name. The list of template parameters:

• i_key Type - Element key type. [required]. Note: i_val may be used instead for non-maps (not recommended).
• i_val Type - Element value type. [required for] cmap/csmap as the mapped value type.
• i_cmp Func - Three-way comparison of two i_keyraw* or i_valraw* - [required for] non-integral i_keyraw elements.
• i_hash Func - Hash function taking i_keyraw* - defaults to c_default_hash. [required for] cmap/cset with non-POD i_keyraw elements.
• i_eq Func - Equality comparison of two i_keyraw* - defaults to !i_cmp. Companion with i_hash.

Properties:

• i_tag Name - Container type name tag. Defaults to i_key name.
• i_type Name - Full container type name. Alternative to i_tag.
• i_opt Flags - Boolean properties: may combine c_no_clone, c_no_atomic, c_is_forward, c_static, c_header with the | separator.

Key:

• i_keydrop Func - Destroy map/set key func - defaults to empty destructor.
• i_keyclone Func - [required if] i_keydrop is defined (exception for carc, as it shares).
• i_keyraw Type - Convertion "raw" type - defaults to i_key.
• i_keyfrom Func - Convertion func i_key <= i_keyraw.
• i_keyto Func - Convertion func i_key* => i_keyraw. [required if] i_keyraw is defined

Val:

• i_valdrop Func - Destroy mapped or value func - defaults to empty destruct.
• i_valclone Func - [required if] i_valdrop is defined.
• i_valraw Type - Convertion "raw" type - defaults to i_val.
• i_valfrom Func - Convertion func i_val <= i_valraw.
• i_valto Func - Convertion func i_val* => i_valraw.

Specials: Meta-template parameters. Use instead of i_key / i_val.

• i_key_class Type - Auto-set standard named functions: Type_clone(), Type_drop(), Type_cmp(), Type_eq(), Type_hash(). If i_keyraw is defined, it sets i_keyto = Type_toraw() and i_keyfrom = Type_from(). Only functions required by the container type is required to be defined. E.g.:
  • Type_hash() and Type_eq() are only required by cmap, cset and smart pointers.
  • Type_cmp() is not used by cstack and cmap/cset.
  • Type_clone() is not used if #define i_opt c_no_clone is specified.
• i_key_str - Sets i_key_class = cstr, i_tag = str, and i_keyraw = const char*. Defines both type convertion i_keyfrom, i_keyto, and sets i_cmp, i_eq, i_hash functions with const char** as argument.
• i_key_ssv - Sets i_key_class = cstr, i_tag = ssv, and i_keyraw = csview*. Defines both type convertion i_keyfrom, i_keyto, and sets i_cmp, i_eq, i_hash functions with csview* as argument.
• i_key_arcbox Type - Use when Type is a smart pointer carc or cbox. Defines i_key_class = Type, and i_keyraw = Type*. NB: Do not use when defining carc/cbox types themselves.
• i_val_class Type, i_val_str, i_val_ssv, i_val_arcbox - Similar rules as for key.

Notes:

• Instead of defining i_*clone, you may define i_opt c_no_clone to disable clone functionality.
• For i_key_class, if i_keyraw is defined along with it, i_keyfrom may also be defined to enable the emplace-functions. NB: the signature for cmp, eq, and hash uses i_keyraw as input.

The table below shows the template parameters which must be defined to support element search and sort for various containers versus element types.

For the containers marked optional, the features are disabled if the template parameter(s) are not defined. Note that the (integral type) columns also applies to "special" types, specified with i_key_str, i_key_arcbox, and i_key_class, and not only true integral types like int or float.

STC, like c++ STL, has two sets of methods for adding elements to containers. One set begins with emplace, e.g. cvec_X_emplace_back(). This is an ergonimic alternative to cvec_X_push_back() when dealing non-trivial container elements, e.g. strings, shared pointers or other elements using dynamic memory or shared resources.

The emplace methods constructs / clones the given element when they are added to the container. In contrast, the non-emplace methods moves the element into the container.

Note: For containers with integral/trivial element types, or when neither i_keyraw/i_valraw is defined, the emplace functions are not available (or needed), as it can easier lead to mistakes.

Strings are the most commonly used non-trivial data type. STC containers have proper pre-defined definitions for cstr container elements, so they are fail-safe to use both with the emplace and non-emplace methods:

#define i_implement     // define in ONE file to implement longer functions in cstr
#include "stc/cstr.h"

#define i_key_str       // special macro to enable container of cstr
#include "stc/cvec.h"   // vector of string (cstr)
...
cvec_str vec = {0};
cstr s = cstr_lit("a string literal");
const char* hello = "Hello";

cvec_str_push(&vec, cstr_from(hello);    // make a cstr from const char* and move it onto vec
cvec_str_push(&vec, cstr_clone(s));      // make a cstr clone and move it onto vec

cvec_str_emplace(&vec, "Yay, literal");  // internally make a cstr from const char*
cvec_str_emplace(&vec, cstr_clone(s));   // <-- COMPILE ERROR: expects const char*
cvec_str_emplace(&vec, cstr_str(&s));    // Ok: const char* input type.

cstr_drop(&s)
cvec_str_drop(&vec);

This is made possible because the type configuration may be given an optional conversion/"rawvalue"-type as template parameter, along with a back and forth conversion methods to the container value type.

Rawvalues are primarily beneficial for lookup and map insertions, however the emplace methods constructs cstr-objects from the rawvalues, but only when required:

cmap_str_emplace(&map, "Hello", "world");
// Two cstr-objects were constructed by emplace

cmap_str_emplace(&map, "Hello", "again");
// No cstr was constructed because "Hello" was already in the map.

cmap_str_emplace_or_assign(&map, "Hello", "there");
// Only cstr_lit("there") constructed. "world" was destructed and replaced.

cmap_str_insert(&map, cstr_lit("Hello"), cstr_lit("you"));
// Two cstr's constructed outside call, but both destructed by insert
// because "Hello" existed. No mem-leak but less efficient.

it = cmap_str_find(&map, "Hello");
// No cstr constructed for lookup, although keys are cstr-type.

Apart from strings, maps and sets are normally used with trivial value types. However, the last example on the cmap page demonstrates how to specify a map with non-trivial keys.

Define i_type instead of i_tag:

#define i_type MyVec
#define i_key int
#include "stc/cvec.h"

MyVec vec = {0};
MyVec_push(&vec, 42);
...

There are two ways to pre-declare templated containers in header files:

1. Include the templated container type instance as a header file. This also exposes all container functions, which can be used by client code. It requires that the element type is complete.
2. Or, pre-declare the container type only. In this case, the container can be a "private" member of a user struct (the container functions will not be available to the user).

Create a dedicated header for the container type instance:

#ifndef PointVec_H_
#define PointVec_H_
// Do not to include user defined headers here if they use templated containers themselves

#define i_type PointVec
#define i_val struct Point // NB! Element type must be complete at this point!
#define i_header           // Do not implement, only expose API
#include "stc/cvec.h"

#endif

Usage from e.g. other headers is trivial:

#ifndef Dataset_H_
#define Dataset_H_
#include "Point.h"         // include element type separately
#include "PointVec.h"

typedef struct Dataset {
    PointVec vertices;
    PointVec colors;
} Dataset;
...
#endif

Implement PointVec in a c-file:

#include "Point.h"
#define i_implement        // define immediately before PointVec.h
#include "PointVec.h"
...

// Dataset.h
#ifndef Dataset_H_
#define Dataset_H_
#include "stc/forward.h"   // include various container data structure templates

// declare PointVec. Note: struct Point may be an incomplete/undeclared type.
forward_cvec(PointVec, struct Point);

typedef struct Dataset {
    PointVec vertices;
    PointVec colors;
} Dataset;

void Dataset_drop(Dataset* self);
...
#endif

Define and use the "private" container in the c-file:

// Dataset.c
#include "Dataset.h"
#include "Point.h"                        // Point must be defined here.

#define i_is_forward                      // flag that the container was forward declared. 
#define i_type PointVec
#define i_val struct Point
#include "stc/cvec.h"                     // Implements PointVec with static linking by default
...

Sometimes it is useful to extend a container type to store extra data, e.g. a comparison or allocator function pointer or a context which the function pointers can use. Most libraries solve this by adding an opaque pointer (void*) or function pointer(s) into the data structure for the user to manage. This solution has a few disadvantages: the pointers are not typesafe, and they take up space when not needed. STC solves this by letting the user create a container wrapper struct where both the container and extra data fields can be stored. The template parameters may then access the extra data using the "container_of" technique.

The example below shows how to customize containers to work with PostgreSQL memory management. It adds a MemoryContext to each container by defining the i_extend template parameter followed the by inclusion of "stc/extend.h". Note that pgs_realloc and pgs_free is also passed the allocated size of the given pointer, unlike standard realloc and free.

// stcpgs.h
#define pgs_malloc(sz) MemoryContextAlloc(c_extend()->memctx, sz)
#define pgs_calloc(n, sz) MemoryContextAllocZero(c_extend()->memctx, (n)*(sz))
#define pgs_realloc(p, old_sz, sz) (p ? repalloc(p, sz) : pgs_malloc(sz))
#define pgs_free(p, sz) (p ? pfree(p) : (void)0) // pfree/repalloc does not accept NULL.

#define i_allocator pgs
#define i_no_clone
#define i_extend MemoryContext memctx;
#include "stc/extend.h"

To use it, define both i_type and i_base (the container type) before including the custom header:

#define i_type IMap
#define i_base csmap
#define i_key int
#define i_val int
#include "stcpgs.h"

// Note the wrapper struct type is IMap_ext. IMap is accessed by .get
void maptest()
{
    IMap_ext map = {.memctx=CurrentMemoryContext};
    c_forrange (i, 1, 16)
        IMap_insert(&map.get, i*i, i);

    c_foreach (i, IMap, map.get)
        printf("%d:%d ", i.ref->first, i.ref->second);

    IMap_drop(&map.get);
}

STC is generally very memory efficient. Memory usage for the different containers:

• cstr, cvec, cstack, cpque: 1 pointer, 2 intptr_t + memory for elements.
• csview, 1 pointer, 1 intptr_t. Does not own data!
• cspan, 1 pointer and 2 * dimension * int32_t. Does not own data!
• clist: Type size: 1 pointer. Each node allocates a struct to store its value and a next pointer.
• cdeq, cqueue: Type size: 2 pointers, 2 intptr_t. Otherwise like cvec.
• cmap/cset: Type size: 2 pointers, 2 int32_t (default). cmap uses one table of keys+value, and one table of precomputed hash-value/used bucket, which occupies only one byte per bucket. The closed hashing has a default max load factor of 85%, and hash table scales by 1.5x when reaching that.
• csmap/csset: Type size: 1 pointer. csmap manages its own array of tree-nodes for allocation efficiency. Each node uses two 32-bit ints for child nodes, and one byte for level, but has no parent node.
• carc: Type size: 1 pointer, 1 long for the reference counter + memory for the shared element.
• cbox: Type size: 1 pointer + memory for the pointed-to element.

• Breaking changes:
  • cstr and csview now uses shared linking by default. Implement by either defining i_implement or i_static before including.
  • Renamed "stc/calgo.h> => <stc/algorithm.h"
  • Moved "stc/algo/coroutine.h> => <stc/coroutine.h"
    • Much improved with some new API and added features.
  • Removed deprecated "stc/crandom.h>. Use <stc/crand.h" with the new API.
    • Reverted names _unif and _norm back to _uniform and _normal.
  • Removed default comparison for clist, cvec and cdeq:
    • Define i_use_cmp to enable comparison for built-in i_key types (<, ==).
    • Use of i_key_class still expects comparison functions to be defined.
    • Use of i_key_arcbox compares stored pointers instead of pointed to values if comparison not defined.
  • Renamed input enum flags for cregex-functions.
• cspan: Added column-major order (fortran) multidimensional spans and transposed views (changed representation of strides).
• All new faster and smaller cqueue and cdeq implementations, using a circular buffer.
• Renamed i_extern => i_import (i_extern deprecated).
  • Define i_import before #include "stc/cstr.h" will also define full utf8 case conversions.
  • Define i_import before #include "stc/cregex.h" will also define cstr + utf8 tables.
• Renamed c_make() => c_init() macro for initializing containers with element lists. c_make deprecated.
• Removed deprecated uppercase flow-control macro names.
• Other smaller additions, bug fixes and improved documentation.

• New home! And online single headers for https://godbolt.org
  • Library: https://github.com/stclib/STC
  • Headers, e.g. https://raw.githubusercontent.com/stclib/stcsingle/main/stc/cvec.h
• Much improved documentation
• Added Coroutines + documentation
• Added new crand.h API & header. Old crandom.h is deprecated.
• Added c_const_cast() typesafe macro.
• Removed RAII macros usage from examples
• Renamed c_flt_count(i) => c_flt_counter(i)
• Renamed c_flt_last(i) => c_flt_getcount(i)
• Renamed c_ARRAYLEN() => c_arraylen()
• Removed deprecated c_ARGSV(). Use c_SV()
• Removed c_PAIR

Major changes:

• A new exciting cspan single/multi-dimensional array view (with numpy-like slicing).
• Signed sizes and indices for all containers. See C++ Core Guidelines by Stroustrup/Sutter: ES.100, ES.102, ES.106, and ES.107.
• Customizable allocator per templated container type.
• Updates on cregex with several new unicode character classes.
• Algorithms:
  • crange - similar to boost::irange integer range generator.
  • c_forfilter - ranges-like view filtering.
  • csort - fast quicksort with custom inline comparison.
• Renamed c_ARGSV() => c_SV(): csview print arg. Note c_sv() is shorthand for csview_from().
• Support for uppercase flow-control macro names in ccommon.h.
• Some API changes in cregex and cstr.
• Create single header container versions with python script.

• Added cregex with documentation - powerful regular expressions.
• Added: c_forfilter: container iteration with "piped" filtering using && operator. 4 built-in filters.
• Added: crange: number generator type, which can be iterated (e.g. with c_forfilter).
• Added back coption - command line argument parsing.
• New + renamed loop iteration/scope macros:
  • c_forlist: macro replacing c_forarray and c_apply. Iterate a compound literal list.
  • c_forrange: macro replacing c_forrange. Iterate a long long type number sequence.
• Updated cstr, now always takes self as pointer, like all containers except csview.
• Updated cvec, cdeq, changed *_range* function names.

• Overhauled some cstr and csview API:
  • Changed cstr_replace*() => cstr_replace_at*(self, pos, len, repl): Replace at specific position.
  • Changed cstr_replace_all() cstr_replace*(self, search, repl, count): Replace count occurences.
  • Renamed cstr_find_from() => cstr_find_at()
  • Renamed cstr_*_u8() => cstr_u8_*()
  • Renamed csview_*_u8() => csview_u8_*()
  • Added cstr_u8_slice() and csview_u8_slice().
  • Removed csview_from_s(): Use cstr_sv(s) instead.
  • Added back file coption.h
  • Simplified cbits usage: all inlined.
  • Updated docs.

• NB! Changed self argument from value to const pointer on containers (does not apply to cstr):
  • CNT_size(const CNT *self)
  • CNT_capacity(const CNT *self)
  • CNT_empty(const CNT *self)
• Now both cstack and cbits can be used with template i_capacity parameter: #define i_capacity <NUM>. They then use fixed sized arrays, and no heap allocated memory.
• Renamed cstr_rename_n() => cstr_rename_with_n() as it could be confused with replacing n instances instead of n bytes.
• Fixed bug in csmap.h: begin() on empty map was not fully initialized.

• Swapped to new cstr (short string optimized, aka SSO). Note that cstr_str(&s) must be used, s.str is no longer usable.
• Removed redundant size argument to i_hash template parameter and c_default_hash. Please update your code.
• Added general i_keyclone/i_valclone template parameter: containers of smart pointers (carc, cbox) now correctly cloned.
• Allows for i_key* template parameters instead of i_val* for all containers, not only for cset and csset.
• Optimized c_default_hash(). Therefore c_hash32() and c_hash64() are removed (same speed).
• Added .._push() and .._emplace() function to all containers to allow for more generic coding.
• Renamed global PRNGs stc64_random() and stc64_srandom() to crand() and csrand().
• Added some examples and benchmarks for SSO and heterogenous lookup comparison with c++20 (string_bench_*.cpp).

• Renamed: all _del to _drop (like destructors in Rust).
• Renamed: all _compare to _cmp
• Renamed: i_equ to i_eq, and _equalto to _eq.
• Renamed: i_cnt to i_type for defining the complete container type name.
• Renamed: type csptr to carc (atomic reference counted) smart pointer.
• Renamed: i_key_csptr / i_val_csptr to i_key_arcbox / i_val_arcbox for specifying carc and cbox values in containers.
• Renamed: csptr_X_make() to carc_X_from().
• Renamed: cstr_new() to cstr_lit(literal), and cstr_assign_fmt() to cstr_printf().
• Renamed: c_default_fromraw() to c_default_from().
• Changed: the c_apply macros API.
• Replaced: csview_first_token() and csview_next_token() with one function: csview_token().
• Added: checkauto tool for checking that c-source files uses c_auto* macros correctly.
• Added: general i_key_class / i_val_class template parameters which auto-binds template functions.
• Added: i_opt template parameter: compile-time options: c_no_clone, c_no_atomic, c_is_forward; may be combined with |
• Added: cbox type: smart pointer, similar to Rust Box and std::unique_ptr.
• Added: c_forpair macro: for-loop with "structured binding"