-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdecent.rb
264 lines (203 loc) · 5.13 KB
/
decent.rb
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
require_relative "state"
module Decent
extend DecentState
def self.app(&ui)
DecentInternal.new(&ui)
end
class TreeNode
include DecentState
def initialize(attributes = {})
@parent = self
@children = []
@unloadables = [] # storing Unloadables for when removing the node from the tree
@attributes = attributes
@app = app
end
def cleanup
@unloadables.each(&:cleanup)
@unloadables = [] # unnecessary but whatever
@children.each do |c|
c.cleanup
end
end
def walk(&block)
@children.each(&:walk &block)
end
def remove
@parent.remove_child(self)
end
def remove_child(node)
return node.remove if node.parent != self
@children.delete node
node.cleanup
until node.children.length == 0
node.remove_child node.children[0]
end
end
def remove_children
until @children.length == 0
@children[0].remove
end
end
def append_child(node)
@children.push node
node.parent = self
end
attr_accessor :parent, :unloadables, :app
def children
@children.reduce([]) do |prev, child|
if child.is_a? FragmentNode
prev + child.children
else
[*prev, child]
end
end
end
def children=(value)
@children = value
end
def attributes
unwrap_hash(@attributes)
end
def split_attributes
@attributes.each_pair.filter_map { |key, val| [key, val] if is_state? val }.to_h
end
def draw # This exists exclusively for type hinting.
throw "You must override this method to have it act as a root node."
end
def is_root?
false
end
end
class RootNode < TreeNode
def is_root?
true
end
end
class FragmentNode < TreeNode
def method_missing(name, *args)
@parent.send(name, *args)
end
end
class DecentInternal
include DecentState
def initialize(root = RootNode.new, node_type = TreeNode, &ui)
@root = root
@current_node = @root
@prevent_drawing = false
instance_eval(&ui)
end
def frag(&ui)
create_node(FragmentNode, {}, &ui)
end
def show(on:, &ui)
node = FragmentNode.new
cleanup_prev = nil
node.unloadables.push(Unloadable.new(node.unloadables) {
cleanup_prev&.cleanup
})
build_ui = -> {
node.remove_children
cleanup_prev&.cleanup
if on.value
cleanup_prev = scope do
build_in_node(node, &ui)
end
end
node.update
unless @prevent_drawing
prevent_drawing do
@root.draw
end
end
}
node.unloadables.push(effect([on], &build_ui))
@current_node.append_child node
build_ui.call
end
def each(of:, &builder)
parent_node = FragmentNode.new
build_node = ->(item) {
built_frag = FragmentNode.new
built_frag.parent = parent_node
built_frag.unloadables.push(scope {
build_in_node(built_frag) do
builder.call(item)
end
})
built_frag
}
nodes = []
run_effect = -> {
nodes.each do |(item, node)|
next if of.untracked.find { _1.equal? item }
node.cleanup
node.children = []
end
nodes = of.untracked.map do |item|
found = nodes.find {|(i, _)| i.equal? item }
found ? found : [item, build_node.call(item)]
end
parent_node.children = nodes.map { _1[1] }
parent_node.update
unless @prevent_drawing
prevent_drawing do
@root.draw
end
end
}
parent_node.unloadables.push(
effect([of], &run_effect)
)
@current_node.append_child parent_node
run_effect.call
end
def before(name, &hook)
original = @current_node.method(name)
@current_node.define_singleton_method(name) do |*args, &block|
hook.call(*args)
original.call(*args, &block)
end
end
def after(name, &hook)
original = @current_node.method(name)
@current_node.define_singleton_method(name) do |*args, &block|
result = original.call(*args, &block)
hook.call(*args)
result
end
end
alias_method :on, :after
def prevent_drawing
@prevent_drawing = true
yield
@prevent_drawing = false
end
def create_node(type = TreeNode, attributes = {}, &ui)
node = type.new(attributes)
@current_node.append_child node
@current_node = node
node.unloadables.push(
scope do
instance_eval(&ui)
effect node.split_attributes.values do
node.update
unless @prevent_drawing
prevent_drawing do
@root.draw
end
end
end
end
)
@current_node = node.parent
node
end
def build_in_node(node, &builder)
previous_node = @current_node
@current_node = node
builder.call
@current_node = previous_node
end
end
end