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
|
package tafl
import "core:fmt"
//import "core:math"
import rl "vendor:raylib"
tafl_elements : [4096]Tafl
tafl_elements_count : int
tafl_stack : [4096]int
tafl_stack_depth : int
child_buffer : [4096]int
child_buffer_len : int
temp_child_buffer : [4096]int
temp_child_buffer_len : int // May be inferred by child count, and not be needed
main :: proc() {
{
tafl(color={.1,.1,.1,1})
{
tafl(color={.1,.1,.1,1})
{
tafl(color={.1,.1,.1,1})
{
tafl(color={.1,.1,.1,1})
}
{
tafl(color={.1,.1,.1,1})
}
{
tafl(color={.1,.1,.1,1})
}
}
{
tafl(color={.1,.1,.1,1})
}
}
{
tafl(color={.1,.1,.1,1})
}
{
tafl(color={.1,.1,.1,1})
{
tafl(color={.1,.1,.1,1})
}
{
tafl(color={.1,.1,.1,1})
}
}
{
tafl(color={.1,.1,.1,1})
}
}
}
@(deferred_out=__tafl_close)
tafl :: proc(
/*width : int = 0,
height : int = 0,
x : int = 0,
y : int = 0,*/
sizing_width : Sizing_Dimension = {.FIT, 0, 0},
sizing_height : Sizing_Dimension = {.FIT, 0, 0},
layout : Layout = .LEFT_TO_RIGHT,
padding : Sides = {0,0,0,0},
child_gap : int = 0,
color : Color = {1,1,0,1},
) -> ^Tafl{
parent_ptr : ^Tafl = nil
if tafl_stack_depth > 0 {
parent_ptr = &tafl_elements[tafl_stack[tafl_stack_depth-1]]
}
tafl_elements[tafl_elements_count] = {
/*width = width,
height = height,
x = x,
y = y,*/
sizing = {sizing_width, sizing_height},
layout = layout,
padding = padding,
child_gap = child_gap,
parent = parent_ptr,
}
this_tafl : ^Tafl = &tafl_elements[tafl_elements_count]
tafl_stack[tafl_stack_depth] = tafl_elements_count
this_tafl.own_index = tafl_elements_count
this_tafl.own_depth = tafl_stack_depth
this_tafl.children.index = temp_child_buffer_len
indent(this_tafl.own_depth)
fmt.printfln("+ Opened tafl {}", this_tafl.own_index)
tafl_elements_count += 1
tafl_stack_depth += 1
return this_tafl
}
__tafl_close :: proc(tafl : ^Tafl) {
parent := tafl.parent
if parent != nil {
tafl.width += tafl.padding.left + tafl.padding.right
tafl.height += tafl.padding.top + tafl.padding.bottom
// Not entirely sure yet, because Nic's video doesn't say you need this
// max(), but I have a feeling that childless tafls will cause negative
// total_child_gaps, which would be bad.
//
// ALSO: Wtf? Why are we basing this off of the tafls number of siblings?
// I do not understand this.
total_child_gap := max(parent.children.len - 1, 0) * parent.child_gap
switch parent.layout {
case .LEFT_TO_RIGHT:
tafl.width += total_child_gap
parent.width += tafl.width
parent.height = max(tafl.height, parent.height)
case .TOP_TO_BOTTOM:
tafl.height += total_child_gap
parent.height += tafl.height
parent.width = max(tafl.width, parent.width)
}
}
for i in 0..<tafl.children.len {
child_buffer[child_buffer_len+i] = temp_child_buffer[tafl.children.index+i]
temp_child_buffer_len -= 1
}
tafl.children.index = child_buffer_len
child_buffer_len += tafl.children.len
temp_child_buffer[temp_child_buffer_len] = tafl.own_index
temp_child_buffer_len += 1
if parent != nil {
parent.children.len += 1
} else {
child_buffer[child_buffer_len] = 0
child_buffer_len += 1
}
tafl_stack_depth -= 1
indent(tafl.own_depth)
fmt.printfln("+ Closed tafl {}\t\tchild_buffer:{}\t\ttemp_child_buffer:{}\tchild_index:{} {}", tafl.own_index, child_buffer[0:child_buffer_len], temp_child_buffer[0:temp_child_buffer_len], tafl.children.index, tafl.children.len)
}
grow_children :: proc(parent : ^Tafl) {
remainingWidth := parent.width
remainingHeight := parent.height
remainingWidth -= parent.padding.left + parent.padding.right
remainingHeight -= parent.padding.top + parent.padding.bottom
for i in 0..<parent.children.len {
child : ^Tafl = &tafl_elements[child_buffer[parent.children.index+i]]
remainingWidth -= child.width
}
// Do we need to make sure this isn't negative???
remainingWidth -= (parent.children.len - 1) * parent.child_gap
for i in 0..<parent.children.len {
child : ^Tafl = &tafl_elements[child_buffer[parent.children.index+i]]
if child.sizing.width.type == .GROW {
child.width += remainingWidth
} else if (child.sizing.height.type == .GROW) {
child.height += remainingHeight
}
}
}
Sizing_Dimension :: struct {
type : enum{
FIT,
GROW,
FIXED
},
min, max : int
}
Layout :: enum {
LEFT_TO_RIGHT,
TOP_TO_BOTTOM,
}
Sides :: struct {
top, bottom, left, right : int
}
Color :: struct {
r,g,b,a : f32
}
Tafl :: struct {
width, height : int,
x, y : int,
own_index : int, // Delete me
own_depth : int, // Delete me
parent : ^Tafl,
// style
children : struct {
index, len : int
},
sizing : struct {
width : Sizing_Dimension,
height : Sizing_Dimension,
},
layout : Layout,
padding : Sides,
child_gap : int,
color : Color,
}
Tafl_Style :: struct {
sizing : struct {
width : Sizing_Dimension,
height : Sizing_Dimension,
},
layout : Layout,
padding : Sides,
child_gap : int,
color : Color,
}
indent :: proc(x : int) {
for _ in 0..<x {
fmt.print("| ")
}
}
GROW : Sizing_Dimension : {.GROW, 0, max(type_of(Sizing_Dimension{}.max))}
FIT : Sizing_Dimension : {.FIT, 0, max(type_of(Sizing_Dimension{}.max))}
|
