STC smap: Sorted Map
A smap is a sorted associative container that contains key-value pairs with unique keys. Keys are sorted by using the comparison function keyCompare. Search, removal, and insertion operations have logarithmic complexity. smap is implemented as an AA-tree (Arne Andersson, 1993), which tends to create a flatter structure (slightly more balanced) than red-black trees.
Iterator invalidation: Iterators are invalidated after insert and erase. References are only invalidated after erase. It is possible to erase individual elements while iterating through the container by using the returned iterator from erase_at(), which references the next element. Alternatively erase_range() can be used.
See the c++ class std::map for a functional description.
#define i_TYPE <ct>,<kt>,<vt> // shorthand to define i_type,i_key,i_val
#define i_type <t> // container type name (default: smap_{i_key})
#define i_key <t> // key type: REQUIRED.
#define i_val <t> // mapped value type: REQUIRED.
#define i_cmp <f> // three-way compare two i_keyraw* : REQUIRED IF i_keyraw is a non-integral type
#define i_keydrop <f> // destroy key func - defaults to empty destruct
#define i_keyclone <f> // REQUIRED IF i_valdrop defined
#define i_keyraw <t> // convertion "raw" type - defaults to i_key
#define i_keyfrom <f> // convertion func i_keyraw => i_key
#define i_keyto <f> // convertion func i_key* => i_keyraw
#define i_valdrop <f> // destroy value func - defaults to empty destruct
#define i_valclone <f> // REQUIRED IF i_valdrop defined
#define i_valraw <t> // convertion "raw" type - defaults to i_val
#define i_valfrom <f> // convertion func i_valraw => i_val
#define i_valto <f> // convertion func i_val* => i_valraw
#define i_tag <s> // alternative typename: smap_{i_tag}. i_tag defaults to i_key
#include "stc/smap.h"X should be replaced by the value of i_tag in all of the following documentation.
smap_X smap_X_init(void);
sset_X smap_X_with_capacity(intptr_t cap);
bool smap_X_reserve(smap_X* self, intptr_t cap);
void smap_X_shrink_to_fit(smap_X* self);
smap_X smap_X_clone(smap_x map);
void smap_X_clear(smap_X* self);
void smap_X_copy(smap_X* self, const smap_X* other);
void smap_X_drop(smap_X* self); // destructor
bool smap_X_empty(const smap_X* self);
intptr_t smap_X_size(const smap_X* self);
intptr_t smap_X_capacity(const smap_X* self);
const smap_X_mapped* smap_X_at(const smap_X* self, i_keyraw rkey); // rkey must be in map
smap_X_mapped* smap_X_at_mut(smap_X* self, i_keyraw rkey); // mutable at
const smap_X_value* smap_X_get(const smap_X* self, i_keyraw rkey); // return NULL if not found
smap_X_value* smap_X_get_mut(smap_X* self, i_keyraw rkey); // mutable get
bool smap_X_contains(const smap_X* self, i_keyraw rkey);
smap_X_iter smap_X_find(const smap_X* self, i_keyraw rkey);
smap_X_value* smap_X_find_it(const smap_X* self, i_keyraw rkey, smap_X_iter* out); // return NULL if not found
smap_X_iter smap_X_lower_bound(const smap_X* self, i_keyraw rkey); // find closest entry >= rkey
smap_X_value* smap_X_front(const smap_X* self);
smap_X_value* smap_X_back(const smap_X* self);
smap_X_result smap_X_insert(smap_X* self, i_key key, i_val mapped); // no change if key in map
smap_X_result smap_X_insert_or_assign(smap_X* self, i_key key, i_val mapped); // always update mapped
smap_X_result smap_X_push(smap_X* self, smap_X_value entry); // similar to insert()
smap_X_result smap_X_emplace(smap_X* self, i_keyraw rkey, i_valraw rmapped); // no change if rkey in map
smap_X_result smap_X_emplace_or_assign(smap_X* self, i_keyraw rkey, i_valraw rmapped); // always update rmapped
smap_X_result smap_X_emplace_key(smap_X* self, i_keyraw rkey); // if key not in map, mapped is left unassigned
int smap_X_erase(smap_X* self, i_keyraw rkey);
smap_X_iter smap_X_erase_at(smap_X* self, smap_X_iter it); // returns iter after it
smap_X_iter smap_X_erase_range(smap_X* self, smap_X_iter it1, smap_X_iter it2); // returns updated it2
smap_X_iter smap_X_begin(const smap_X* self);
smap_X_iter smap_X_end(const smap_X* self);
void smap_X_next(smap_X_iter* iter);
smap_X_iter smap_X_advance(smap_X_iter it, intptr_t n);
smap_X_value smap_X_value_clone(smap_X_value val);
smap_X_raw smap_X_value_toraw(const smap_X_value* pval);
void smap_X_value_drop(smap_X_value* pval);| Type name | Type definition | Used to represent... |
|---|---|---|
smap_X |
struct { ... } |
The smap type |
smap_X_key |
i_key |
The key type |
smap_X_mapped |
i_val |
The mapped type |
smap_X_value |
struct { i_key first; i_val second; } |
The value: key is immutable |
smap_X_keyraw |
i_keyraw |
The raw key type |
smap_X_rmapped |
i_valraw |
The raw mapped type |
smap_X_raw |
struct { i_keyraw first; i_valraw second; } |
i_keyraw+i_valraw type |
smap_X_result |
struct { smap_X_value *ref; bool inserted; } |
Result of insert/put/emplace |
smap_X_iter |
struct { smap_X_value *ref; ... } |
Iterator type |
#define i_implement
#include "stc/cstr.h"
#define i_key_str // special macro for i_key = cstr, i_tag = str
#define i_val_str // ditto
#include "stc/smap.h"
int main(void)
{
// Create a sorted map of three strings (maps to string)
smap_str colors = c_init(smap_str, {
{"RED", "#FF0000"},
{"GREEN", "#00FF00"},
{"BLUE", "#0000FF"}
});
// Iterate and print keys and values of sorted map
c_foreach (i, smap_str, colors) {
printf("Key:[%s] Value:[%s]\n", cstr_str(&i.ref->first), cstr_str(&i.ref->second));
}
// Add two new entries to the sorted map
smap_str_emplace(&colors, "BLACK", "#000000");
smap_str_emplace(&colors, "WHITE", "#FFFFFF");
// Output values by key
printf("The HEX of color RED is:[%s]\n", cstr_str(smap_str_at(&colors, "RED")));
printf("The HEX of color BLACK is:[%s]\n", cstr_str(smap_str_at(&colors, "BLACK")));
smap_str_drop(&colors);
}Output:
Key:[BLUE] Value:[#0000FF]
Key:[GREEN] Value:[#00FF00]
Key:[RED] Value:[#FF0000]
The HEX of color RED is:[#FF0000]
The HEX of color BLACK is:[#000000]
Translate a C++ example using insert and emplace to STC:
[ Run this code ]
#define i_implement
#include "stc/cstr.h"
#define i_type strmap
#define i_key_str
#define i_val_str
#include "stc/smap.h"
static void print_node(const strmap_value* node) {
printf("[%s] = %s\n", cstr_str(&node->first), cstr_str(&node->second));
}
static void print_result(strmap_result result) {
printf("%s", result.inserted ? "inserted: " : "ignored: ");
print_node(result.ref);
}
int main(void)
{
strmap m = {0};
print_result( strmap_emplace(&m, "a", "a") );
print_result( strmap_emplace(&m, "b", "abcd") );
print_result( strmap_insert(&m, cstr_from("c"), cstr_with_size(10, 'c') ) );
print_result( strmap_emplace(&m, "c", "Won't be inserted") );
c_foreach (p, strmap, m) { print_node(p.ref); }
strmap_drop(&m);
}This example uses a smap with cstr as mapped value.
#define i_implement
#include "stc/cstr.h"
#define i_type IDSMap
#define i_key int
#define i_val_str
#include "stc/smap.h"
int main(void)
{
uint32_t col = 0xcc7744ff;
IDSMap idnames = c_init(IDSMap, { {100, "Red"}, {110, "Blue"} });
// Assign/overwrite an existing mapped value with a const char*
IDSMap_emplace_or_assign(&idnames, 110, "White");
// Insert (or assign) a new cstr
IDSMap_insert_or_assign(&idnames, 120, cstr_from_fmt("#%08x", col));
// emplace() adds only when key does not already exist:
IDSMap_emplace(&idnames, 100, "Green"); // ignored
c_foreach (i, IDSMap, idnames)
printf("%d: %s\n", i.ref->first, cstr_str(&i.ref->second));
IDSMap_drop(&idnames);
}Output:
100: Red
110: White
120: #cc7744ffDemonstrate smap with plain-old-data key type Vec3i and int as mapped type: smap<Vec3i, int>.
typedef struct { int x, y, z; } Vec3i;
static int Vec3i_cmp(const Vec3i* a, const Vec3i* b) {
int c;
if ((c = a->x - b->x) != 0) return c;
if ((c = a->y - b->y) != 0) return c;
return a->z - b->z;
}
#define i_TYPE smap_vi, Vec3i, int
#define i_cmp Vec3i_cmp
#include "stc/smap.h"
#include <stdio.h>
int main(void)
{
smap_vi vmap = {0};
smap_vi_insert(&vmap, (Vec3i){100, 0, 0}, 1);
smap_vi_insert(&vmap, (Vec3i){0, 100, 0}, 2);
smap_vi_insert(&vmap, (Vec3i){0, 0, 100}, 3);
smap_vi_insert(&vmap, (Vec3i){100, 100, 100}, 4);
c_forpair (v, n, smap_vi, vmap)
printf("{ %3d, %3d, %3d }: %d\n", _.v->x, _.v->y, _.v->z, *_.n);
smap_vi_drop(&vmap);
}Output:
{ 0, 0, 100 }: 3
{ 0, 100, 0 }: 2
{ 100, 0, 0 }: 1
{ 100, 100, 100 }: 4