/
dynamic_array.hpp
55 lines (48 loc) · 1.26 KB
/
dynamic_array.hpp
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
49
50
51
52
53
54
55
#pragma once
template <typename T, bool PERSISTENT, int NODES>
struct Dynamic_Array {
static constexpr int LOG = 4;
static constexpr int MASK = (1 << LOG) - 1;
struct Node {
T x;
Node* ch[1 << LOG] = {};
};
Node* pool;
int pid;
using np = Node*;
const T x0;
Dynamic_Array(T default_value) : pid(0), x0(default_value) {
pool = new Node[NODES];
}
np new_root() {
pool[pid].x = x0;
fill(pool[pid].ch, pool[pid].ch + (1 << LOG), nullptr);
return &(pool[pid++]);
}
np new_node(vc<T> dat) {
np root = new_root();
FOR(i, len(dat)) root = set(root, i, dat[i], false);
return root;
}
T get(np c, int idx) {
if (!c) return x0;
if (idx == 0) return c->x;
return get(c->ch[idx & MASK], (idx - 1) >> LOG);
}
np set(np c, int idx, T x, bool make_copy = true) {
c = (c ? copy_node(c, make_copy) : new_root());
if (idx == 0) {
c->x = x;
return c;
}
c->ch[idx & MASK] = set(c->ch[idx & MASK], (idx - 1) >> LOG, x);
return c;
}
private:
np copy_node(np c, bool make_copy) {
if (!make_copy || !PERSISTENT) return c;
pool[pid].x = c->x;
FOR(k, (1 << LOG)) pool[pid].ch[k] = c->ch[k];
return &(pool[pid++]);
}
};