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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
#ifndef DT_H
#define DT_H
#include <stdbool.h>
#include <stdlib.h>
#include <stdio.h>
struct value_t;
typedef struct edge {
struct edge *next;
struct node *node;
} edge_t;
typedef struct node {
struct edge *edge;
value_t x;
bool flag;
value_t (*function)(struct node *node);
} node_t;
void dt_connect(node_t *, node_t *);
void dt_disconnect(node_t *, node_t *);
void dt_update(node_t *);
value_t dt_one(node_t *node);
value_t dt_add(node_t *node);
value_t dt_subtract(node_t *node);
#endif
#ifdef DT_IMPLEMENTATION
void dt_connect(node_t *to, node_t *from) {
edge_t *edge = malloc(sizeof(edge_t));
edge->node = from;
edge->next = to->edge;
to->edge = edge;
}
void dt_disconnect(node_t *to, node_t *from) {
edge_t *edge = to->edge;
edge_t *last = NULL;
while (edge) {
if (edge->node == from) {
edge_t *tmp = edge;
last->next = edge->next;
free(tmp);
}
last = edge;
edge = edge->next;
}
}
void dt_update(node_t *origin) {
// printf(">: %p - %lf\n", origin, origin->x);
edge_t *edge = origin->edge;
origin->flag = !origin->flag;
while (edge) {
if (origin->flag != edge->node->flag) {
dt_update(edge->node);
}
edge = edge->next;
}
origin->x = origin->function(origin);
// printf("<: %p - %lf\n", origin, origin->x);
}
void dt_update_trace(node_t *origin) {
printf(">: %p - %lf\n", origin, origin->x);
edge_t *edge = origin->edge;
origin->flag = !origin->flag;
while (edge) {
if (origin->flag != edge->node->flag) {
dt_update_trace(edge->node);
}
edge = edge->next;
}
origin->x = origin->function(origin);
printf("<: %p - %lf\n", origin, origin->x);
}
value_t dt_one(node_t *node) {
return 1;
}
value_t dt_add(node_t *node) {
edge_t *edge = node->edge;
value_t x = node->x;
while(edge) {
x += edge->node->x;
edge = edge->next;
}
return x;
}
value_t dt_subtract(node_t *node) {
edge_t *edge = node->edge;
value_t x = node->x;
while(edge) {
x -= edge->node->x;
edge = edge->next;
}
return x;
}
#endif
|