1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
// Define similar c++ data types:
//
// using FloatStack = std::stack<float>;
// using StackList = std::stack<FloatStack>;
// using ListMap = std::unordered_map<int, std::forward_list<StackList>>;
// using MapMap = std::unordered_map<std::string, ListMap>;
#define i_implement
#include <stc/cstr.h>
#define i_type FloatStack
#define i_key float
#include <stc/cstack.h>
#define i_type StackList
#define i_keyclass FloatStack // "class" picks up _clone, _drop, _cmp
#include <stc/clist.h>
#define i_type ListMap
#define i_key int
#define i_valclass StackList // "class" picks up _clone, _drop
#include <stc/cmap.h>
#define i_type MapMap
#define i_key_str
#define i_valclass ListMap
#include <stc/cmap.h>
int main(void)
{
MapMap mmap = {0};
// Put in some data in the structures
ListMap* lmap = &MapMap_emplace(&mmap, "first", ListMap_init()).ref->second;
StackList* list = &ListMap_insert(lmap, 42, StackList_init()).ref->second;
FloatStack* stack = StackList_push_back(list, FloatStack_with_size(10, 0));
stack->data[3] = 3.1415927f;
printf("stack size: %" c_ZI "\n", FloatStack_size(stack));
// Access the data entry
const ListMap* lmap_p = MapMap_at(&mmap, "first");
const StackList* list_p = ListMap_at(lmap_p, 42);
const FloatStack* stack_p = StackList_back(list_p);
printf("value is: %f\n", (double)*FloatStack_at(stack_p, 3)); // pi
MapMap_drop(&mmap);
}
|