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
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
|
// 10 june 2016
#include "uipriv_windows.hpp"
// TODO compare with GTK+:
// - what happens if you call InsertAt() twice?
// - what happens if you call Append() twice?
// TODOs
// - the Assorted page has clipping and repositioning issues
struct gridChild {
uiControl *c;
int left;
int top;
int xspan;
int yspan;
int hexpand;
uiAlign halign;
int vexpand;
uiAlign valign;
// have these here so they don't need to be reallocated each relayout
int finalx, finaly;
int finalwidth, finalheight;
int minwidth, minheight;
};
struct uiGrid {
uiWindowsControl c;
HWND hwnd;
std::vector<struct gridChild *> *children;
std::map<uiControl *, size_t> *indexof;
int padded;
int xmin, ymin;
int xmax, ymax;
};
static bool gridRecomputeMinMax(uiGrid *g)
{
bool first = true;
for (struct gridChild *gc : *(g->children)) {
// this is important; we want g->xmin/g->ymin to satisfy gridLayoutData::visibleRow()/visibleColumn()
if (!uiControlVisible(gc->c))
continue;
if (first) {
g->xmin = gc->left;
g->ymin = gc->top;
g->xmax = gc->left + gc->xspan;
g->ymax = gc->top + gc->yspan;
first = false;
continue;
}
if (g->xmin > gc->left)
g->xmin = gc->left;
if (g->ymin > gc->top)
g->ymin = gc->top;
if (g->xmax < (gc->left + gc->xspan))
g->xmax = gc->left + gc->xspan;
if (g->ymax < (gc->top + gc->yspan))
g->ymax = gc->top + gc->yspan;
}
return first != false;
}
#define xcount(g) ((g)->xmax - (g)->xmin)
#define ycount(g) ((g)->ymax - (g)->ymin)
#define toxindex(g, x) ((x) - (g)->xmin)
#define toyindex(g, y) ((y) - (g)->ymin)
class gridLayoutData {
int ycount;
public:
int **gg; // topological map gg[y][x] = control index
int *colwidths;
int *rowheights;
bool *hexpand;
bool *vexpand;
int nVisibleRows;
int nVisibleColumns;
bool noVisible;
gridLayoutData(uiGrid *g)
{
size_t i;
int x, y;
this->noVisible = gridRecomputeMinMax(g);
this->gg = new int *[ycount(g)];
for (y = 0; y < ycount(g); y++) {
this->gg[y] = new int[xcount(g)];
for (x = 0; x < xcount(g); x++)
this->gg[y][x] = -1;
}
for (i = 0; i < g->children->size(); i++) {
struct gridChild *gc;
gc = (*(g->children))[i];
if (!uiControlVisible(gc->c))
continue;
for (y = gc->top; y < gc->top + gc->yspan; y++)
for (x = gc->left; x < gc->left + gc->xspan; x++)
this->gg[toyindex(g, y)][toxindex(g, x)] = i;
}
this->colwidths = new int[xcount(g)];
ZeroMemory(this->colwidths, xcount(g) * sizeof (int));
this->rowheights = new int[ycount(g)];
ZeroMemory(this->rowheights, ycount(g) * sizeof (int));
this->hexpand = new bool[xcount(g)];
ZeroMemory(this->hexpand, xcount(g) * sizeof (bool));
this->vexpand = new bool[ycount(g)];
ZeroMemory(this->vexpand, ycount(g) * sizeof (bool));
this->ycount = ycount(g);
// if a row or column only contains emptys and spanning cells of a opposite-direction spannings, it is invisible and should not be considered for padding amount calculations
// note that the first row and column will always be visible because gridRecomputeMinMax() computed a smallest fitting rectangle
if (this->noVisible)
return;
this->nVisibleRows = 0;
for (y = 0; y < this->ycount; y++)
if (this->visibleRow(g, y))
this->nVisibleRows++;
this->nVisibleColumns = 0;
for (x = 0; x < xcount(g); x++)
if (this->visibleColumn(g, x))
this->nVisibleColumns++;
}
~gridLayoutData()
{
size_t y;
delete[] this->hexpand;
delete[] this->vexpand;
delete[] this->colwidths;
delete[] this->rowheights;
for (y = 0; y < this->ycount; y++)
delete[] this->gg[y];
delete[] this->gg;
}
bool visibleRow(uiGrid *g, int y)
{
int x;
struct gridChild *gc;
for (x = 0; x < xcount(g); x++)
if (this->gg[y][x] != -1) {
gc = (*(g->children))[this->gg[y][x]];
if (gc->yspan == 1 || gc->top - g->ymin == y)
return true;
}
return false;
}
bool visibleColumn(uiGrid *g, int x)
{
int y;
struct gridChild *gc;
for (y = 0; y < this->ycount; y++)
if (this->gg[y][x] != -1) {
gc = (*(g->children))[this->gg[y][x]];
if (gc->xspan == 1 || gc->left - g->xmin == x)
return true;
}
return false;
}
};
static void gridPadding(uiGrid *g, int *xpadding, int *ypadding)
{
uiWindowsSizing sizing;
*xpadding = 0;
*ypadding = 0;
if (g->padded) {
uiWindowsGetSizing(g->hwnd, &sizing);
uiWindowsSizingStandardPadding(&sizing, xpadding, ypadding);
}
}
static void gridRelayout(uiGrid *g)
{
RECT r;
int x, y, width, height;
gridLayoutData *ld;
int xpadding, ypadding;
int ix, iy;
int iwidth, iheight;
int i;
struct gridChild *gc;
int nhexpand, nvexpand;
if (g->children->size() == 0)
return; // nothing to do
uiWindowsEnsureGetClientRect(g->hwnd, &r);
x = r.left;
y = r.top;
width = r.right - r.left;
height = r.bottom - r.top;
gridPadding(g, &xpadding, &ypadding);
ld = new gridLayoutData(g);
if (ld->noVisible) { // nothing to do
delete ld;
return;
}
// 0) discount padding from width/height
width -= (ld->nVisibleColumns - 1) * xpadding;
height -= (ld->nVisibleRows - 1) * ypadding;
// 1) compute colwidths and rowheights before handling expansion
// we only count non-spanning controls to avoid weirdness
for (iy = 0; iy < ycount(g); iy++)
for (ix = 0; ix < xcount(g); ix++) {
i = ld->gg[iy][ix];
if (i == -1)
continue;
gc = (*(g->children))[i];
uiWindowsControlMinimumSize(uiWindowsControl(gc->c), &iwidth, &iheight);
if (gc->xspan == 1)
if (ld->colwidths[ix] < iwidth)
ld->colwidths[ix] = iwidth;
if (gc->yspan == 1)
if (ld->rowheights[iy] < iheight)
ld->rowheights[iy] = iheight;
// save these for step 6
gc->minwidth = iwidth;
gc->minheight = iheight;
}
// 2) figure out which rows/columns expand but not span
// we need to know which expanding rows/columns don't span before we can handle the ones that do
for (i = 0; i < g->children->size(); i++) {
gc = (*(g->children))[i];
if (!uiControlVisible(gc->c))
continue;
if (gc->hexpand && gc->xspan == 1)
ld->hexpand[toxindex(g, gc->left)] = true;
if (gc->vexpand && gc->yspan == 1)
ld->vexpand[toyindex(g, gc->top)] = true;
}
// 3) figure out which rows/columns expand that do span
// the way we handle this is simple: if none of the spanned rows/columns expand, make all rows/columns expand
for (i = 0; i < g->children->size(); i++) {
gc = (*(g->children))[i];
if (!uiControlVisible(gc->c))
continue;
if (gc->hexpand && gc->xspan != 1) {
bool doit = true;
for (ix = gc->left; ix < gc->left + gc->xspan; ix++)
if (ld->hexpand[toxindex(g, ix)]) {
doit = false;
break;
}
if (doit)
for (ix = gc->left; ix < gc->left + gc->xspan; ix++)
ld->hexpand[toxindex(g, ix)] = true;
}
if (gc->vexpand && gc->yspan != 1) {
bool doit = true;
for (iy = gc->top; iy < gc->top + gc->yspan; iy++)
if (ld->vexpand[toyindex(g, iy)]) {
doit = false;
break;
}
if (doit)
for (iy = gc->top; iy < gc->top + gc->yspan; iy++)
ld->vexpand[toyindex(g, iy)] = true;
}
}
// 4) compute and assign expanded widths/heights
nhexpand = 0;
nvexpand = 0;
for (i = 0; i < xcount(g); i++)
if (ld->hexpand[i])
nhexpand++;
else
width -= ld->colwidths[i];
for (i = 0; i < ycount(g); i++)
if (ld->vexpand[i])
nvexpand++;
else
height -= ld->rowheights[i];
for (i = 0; i < xcount(g); i++)
if (ld->hexpand[i])
ld->colwidths[i] = width / nhexpand;
for (i = 0; i < ycount(g); i++)
if (ld->vexpand[i])
ld->rowheights[i] = height / nvexpand;
// 5) reset the final coordinates for the next step
for (i = 0; i < g->children->size(); i++) {
gc = (*(g->children))[i];
if (!uiControlVisible(gc->c))
continue;
gc->finalx = 0;
gc->finaly = 0;
gc->finalwidth = 0;
gc->finalheight = 0;
}
// 6) compute cell positions and sizes
for (iy = 0; iy < ycount(g); iy++) {
int curx;
int prev;
curx = 0;
prev = -1;
for (ix = 0; ix < xcount(g); ix++) {
if (!ld->visibleColumn(g, ix))
continue;
i = ld->gg[iy][ix];
if (i != -1) {
gc = (*(g->children))[i];
if (iy == toyindex(g, gc->top)) { // don't repeat this step if the control spans vertically
if (i != prev)
gc->finalx = curx;
else
gc->finalwidth += xpadding;
gc->finalwidth += ld->colwidths[ix];
}
}
curx += ld->colwidths[ix] + xpadding;
prev = i;
}
}
for (ix = 0; ix < xcount(g); ix++) {
int cury;
int prev;
cury = 0;
prev = -1;
for (iy = 0; iy < ycount(g); iy++) {
if (!ld->visibleRow(g, iy))
continue;
i = ld->gg[iy][ix];
if (i != -1) {
gc = (*(g->children))[i];
if (ix == toxindex(g, gc->left)) { // don't repeat this step if the control spans horizontally
if (i != prev)
gc->finaly = cury;
else
gc->finalheight += ypadding;
gc->finalheight += ld->rowheights[iy];
}
}
cury += ld->rowheights[iy] + ypadding;
prev = i;
}
}
// 7) everything as it stands now is set for xalign == Fill yalign == Fill; set the correct alignments
// this is why we saved minwidth/minheight above
for (i = 0; i < g->children->size(); i++) {
gc = (*(g->children))[i];
if (!uiControlVisible(gc->c))
continue;
if (gc->halign != uiAlignFill) {
switch (gc->halign) {
case uiAlignEnd:
gc->finalx += gc->finalwidth - gc->minwidth;
break;
case uiAlignCenter:
gc->finalx += (gc->finalwidth - gc->minwidth) / 2;
break;
}
gc->finalwidth = gc->minwidth; // for all three
}
if (gc->valign != uiAlignFill) {
switch (gc->valign) {
case uiAlignEnd:
gc->finaly += gc->finalheight - gc->minheight;
break;
case uiAlignCenter:
gc->finaly += (gc->finalheight - gc->minheight) / 2;
break;
}
gc->finalheight = gc->minheight; // for all three
}
}
// 8) and FINALLY we resize
for (iy = 0; iy < ycount(g); iy++)
for (ix = 0; ix < xcount(g); ix++) {
i = ld->gg[iy][ix];
if (i != -1) { // treat empty cells like spaces
gc = (*(g->children))[i];
uiWindowsEnsureMoveWindowDuringResize(
(HWND) uiControlHandle(gc->c),
gc->finalx,//TODO + x,
gc->finaly,//TODO + y,
gc->finalwidth,
gc->finalheight);
}
}
delete ld;
}
static void uiGridDestroy(uiControl *c)
{
uiGrid *g = uiGrid(c);
for (struct gridChild *gc : *(g->children)) {
uiControlSetParent(gc->c, NULL);
uiControlDestroy(gc->c);
uiFree(gc);
}
delete g->indexof;
delete g->children;
uiWindowsEnsureDestroyWindow(g->hwnd);
uiFreeControl(uiControl(g));
}
uiWindowsControlDefaultHandle(uiGrid)
uiWindowsControlDefaultParent(uiGrid)
uiWindowsControlDefaultSetParent(uiGrid)
uiWindowsControlDefaultToplevel(uiGrid)
uiWindowsControlDefaultVisible(uiGrid)
uiWindowsControlDefaultShow(uiGrid)
uiWindowsControlDefaultHide(uiGrid)
uiWindowsControlDefaultEnabled(uiGrid)
uiWindowsControlDefaultEnable(uiGrid)
uiWindowsControlDefaultDisable(uiGrid)
uiWindowsControlDefaultSetFocus(uiGrid)
static void uiGridSyncEnableState(uiWindowsControl *c, int enabled)
{
uiGrid *g = uiGrid(c);
if (uiWindowsShouldStopSyncEnableState(uiWindowsControl(g), enabled))
return;
for (const struct gridChild *gc : *(g->children))
uiWindowsControlSyncEnableState(uiWindowsControl(gc->c), enabled);
}
uiWindowsControlDefaultSetParentHWND(uiGrid)
static void uiGridMinimumSize(uiWindowsControl *c, int *width, int *height)
{
uiGrid *g = uiGrid(c);
int xpadding, ypadding;
gridLayoutData *ld;
int x, y;
int i;
struct gridChild *gc;
int minwid, minht;
int colwidth, rowheight;
*width = 0;
*height = 0;
if (g->children->size() == 0)
return; // nothing to do
gridPadding(g, &xpadding, &ypadding);
ld = new gridLayoutData(g);
if (ld->noVisible) { // nothing to do; return 0x0
delete ld;
return;
}
// 1) compute colwidths and rowheights before handling expansion
// TODO put this in its own function (but careful about the spanning calculation in gridRelayout())
for (y = 0; y < ycount(g); y++)
for (x = 0; x < xcount(g); x++) {
i = ld->gg[y][x];
if (i == -1)
continue;
gc = (*(g->children))[i];
uiWindowsControlMinimumSize(uiWindowsControl(gc->c), &minwid, &minht);
// allot equal space in the presence of spanning to keep things sane
if (ld->colwidths[x] < minwid / gc->xspan)
ld->colwidths[x] = minwid / gc->xspan;
if (ld->rowheights[y] < minht / gc->yspan)
ld->rowheights[y] = minht / gc->yspan;
// save these for step 6
gc->minwidth = minwid;
gc->minheight = minht;
}
// 2) compute total column width/row height
colwidth = 0;
rowheight = 0;
for (x = 0; x < xcount(g); x++)
colwidth += ld->colwidths[x];
for (y = 0; y < ycount(g); y++)
rowheight += ld->rowheights[y];
// and that's it; just account for padding
*width = colwidth + (ld->nVisibleColumns - 1) * xpadding;
*height = rowheight + (ld->nVisibleRows - 1) * ypadding;
}
static void uiGridMinimumSizeChanged(uiWindowsControl *c)
{
uiGrid *g = uiGrid(c);
if (uiWindowsControlTooSmall(uiWindowsControl(g))) {
uiWindowsControlContinueMinimumSizeChanged(uiWindowsControl(g));
return;
}
gridRelayout(g);
}
static void uiGridSetMinSize(uiControl *c, int w, int h)
{
// checkme
uiGridMinimumSizeChanged(uiWindowsControl(c));
}
uiWindowsControlDefaultLayoutRect(uiGrid)
uiWindowsControlDefaultAssignControlIDZOrder(uiGrid)
static void uiGridChildVisibilityChanged(uiWindowsControl *c)
{
// TODO eliminate the redundancy
uiWindowsControlMinimumSizeChanged(c);
}
// must have called gridRecomputeMinMax() first
static void gridArrangeChildren(uiGrid *g)
{
LONG_PTR controlID;
HWND insertAfter;
gridLayoutData *ld;
bool *visited;
int x, y;
int i;
struct gridChild *gc;
if (g->children->size() == 0)
return; // nothing to do
ld = new gridLayoutData(g);
controlID = 100;
insertAfter = NULL;
visited = new bool[g->children->size()];
ZeroMemory(visited, g->children->size() * sizeof (bool));
for (y = 0; y < ycount(g); y++)
for (x = 0; x < xcount(g); x++) {
i = ld->gg[y][x];
if (i == -1)
continue;
if (visited[i])
continue;
visited[i] = true;
gc = (*(g->children))[i];
uiWindowsControlAssignControlIDZOrder(uiWindowsControl(gc->c), &controlID, &insertAfter);
}
delete[] visited;
delete ld;
}
static struct gridChild *toChild(uiControl *c, int xspan, int yspan, int hexpand, uiAlign halign, int vexpand, uiAlign valign)
{
struct gridChild *gc;
if (xspan < 0)
userbug("You cannot have a negative xspan in a uiGrid cell.");
if (yspan < 0)
userbug("You cannot have a negative yspan in a uiGrid cell.");
gc = uiNew(struct gridChild);
gc->c = c;
gc->xspan = xspan;
gc->yspan = yspan;
gc->hexpand = hexpand;
gc->halign = halign;
gc->vexpand = vexpand;
gc->valign = valign;
return gc;
}
static void add(uiGrid *g, struct gridChild *gc)
{
uiControlSetParent(gc->c, uiControl(g));
uiWindowsControlSetParentHWND(uiWindowsControl(gc->c), g->hwnd);
g->children->push_back(gc);
(*(g->indexof))[gc->c] = g->children->size() - 1;
gridRecomputeMinMax(g);
gridArrangeChildren(g);
uiWindowsControlMinimumSizeChanged(uiWindowsControl(g));
}
void uiGridAppend(uiGrid *g, uiControl *c, int left, int top, int xspan, int yspan, int hexpand, uiAlign halign, int vexpand, uiAlign valign)
{
struct gridChild *gc;
gc = toChild(c, xspan, yspan, hexpand, halign, vexpand, valign);
gc->left = left;
gc->top = top;
add(g, gc);
}
// TODO decide what happens if existing is NULL
void uiGridInsertAt(uiGrid *g, uiControl *c, uiControl *existing, uiAt at, int xspan, int yspan, int hexpand, uiAlign halign, int vexpand, uiAlign valign)
{
struct gridChild *gc;
struct gridChild *other;
gc = toChild(c, xspan, yspan, hexpand, halign, vexpand, valign);
other = (*(g->children))[(*(g->indexof))[existing]];
switch (at) {
case uiAtLeading:
gc->left = other->left - gc->xspan;
gc->top = other->top;
break;
case uiAtTop:
gc->left = other->left;
gc->top = other->top - gc->yspan;
break;
case uiAtTrailing:
gc->left = other->left + other->xspan;
gc->top = other->top;
break;
case uiAtBottom:
gc->left = other->left;
gc->top = other->top + other->yspan;
break;
// TODO add error checks to ALL enums
}
add(g, gc);
}
int uiGridPadded(uiGrid *g)
{
return g->padded;
}
void uiGridSetPadded(uiGrid *g, int padded)
{
g->padded = padded;
uiWindowsControlMinimumSizeChanged(uiWindowsControl(g));
}
static void onResize(uiWindowsControl *c)
{
gridRelayout(uiGrid(c));
}
uiGrid *uiNewGrid(void)
{
uiGrid *g;
uiWindowsNewControl(uiGrid, g);
g->hwnd = uiWindowsMakeContainer(uiWindowsControl(g), onResize);
g->children = new std::vector<struct gridChild *>;
g->indexof = new std::map<uiControl *, size_t>;
return g;
}
|