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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
struct HashMap(K, V)
{
V* opBinaryRight(string op)(K key) const if (op == "in")
{
size_t index;
foreach (ref node; buckets[index].range)
{
return &(node.value);
}
return null;
}
struct Node
{
K key;
V value;
}
alias Bucket = UnrolledList!(Node);
Bucket[] buckets;
}
struct UnrolledList(T)
{
Range range() const pure
{
return Range(_front);
}
static struct Range
{
ref T front() const @property
{
return cast(T) current.items[index];
}
void popFront() pure
{
}
bool empty() const pure @property
{
return true;
}
const(Node)* current;
size_t index;
}
Node* _front;
static struct Node
{
ContainerStorageType!T[10] items;
}
}
template ContainerStorageType(T)
{
alias ContainerStorageType = T;
}
template isComponentStorage(CS, C)
{
enum bool isComponentStorage = is(typeof(
(inout int = 0)
{
CS cs = CS.init;
ulong eid;
cs.add(eid, C.init);
}));
}
struct HashmapComponentStorage(ComponentType)
{
private HashMap!(ulong, ComponentType) components;
void add(ulong eid, ComponentType component)
{
assert(eid !in components);
}
}
static assert(isComponentStorage!(HashmapComponentStorage!int, int));
void main()
{
}
|
