aboutsummaryrefslogtreecommitdiff
path: root/ttt.jai
blob: 1a2514310554f1cb576918e58c50a52b3a994620 (plain)
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
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
// Copyright 2023 Daniel Martins
// License GPL-3.0-or-later
//
// This program is free software: you can redistribute it and/or modify it under 
// the terms of the GNU General Public License as published by the Free Software 
// Foundation, either version 3 of the License, or (at your option) any later 
// version.
//
// This program is distributed in the hope that it will be useful, but WITHOUT 
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS 
// FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along with 
// this program. If not, see <https://www.gnu.org/licenses/>. 

// Compilation commands:
// - release                : jai ttt.jai -import_dir . -quiet -x64 -release
// - debug                  : jai ttt.jai -import_dir . -quiet -x64

#import "Basic"()(MEMORY_DEBUGGER=true); // TODO Remove after final debug sessions.
#import "System";
#import "Sort";
#import "Math";
// #import "POSIX";
#import "File";
#import "File_Utilities";
#import "String";
// #import "curses";
// #import "kscurses";
TIO :: #import "tio"; // TODO Move things into TUI.
TUI :: #import "TUI";
#load "Integer_Saturating_Arithmetic.jai";


// TODO List:
// [ ] Every time we add or remove tasks to the database, it may be reallocated, thus making the selected_task and active_task pointers invalid. Check if this is messing up the app.
stdscr: *void;                                  // TODO DAM
A_BOLD: s32 = 0;                                // TODO DAM
COLOR_PAIR :: (a: s32) -> s32 { return 0; }     // TODO DAM
KEY_RESIZE          :: 410;                     // TODO DAM
KEY_F2              :: 266;                     // TODO DAM
KEY_F5              :: 269;                     // TODO DAM
KEY_HOME            :: 262;                     // TODO DAM
KEY_UP              :: 259;                     // TODO DAM
KEY_DOWN            :: 258;                     // TODO DAM
KEY_NPAGE           :: 338;                     // TODO DAM
KEY_PPAGE           :: 339;                     // TODO DAM
KEY_END             :: 360;                     // TODO DAM
KEY_BACKSPACE       :: 263;                     // TODO DAM
KEY_DC              :: 330;                     // TODO DAM
WINDOW :: struct { }                            // TODO DAM


VERSION             :: "2.0";   // Use only 3 chars (to fit layouts).
YEAR                :: "2023";
FIRST_DAY_OF_WEEK   :: 1;       // (0-6, Sunday = 0).
NUM_WEEK_DAYS       :: 7;       // TODO This has to go - Just to be more clear about what we're looping about.
NAME_SIZE           :: 72;      // TODO Use this instead of Task.name.count ?

APP_FOLDER_NAME     :: ".task_time_tracker_test"; // TODO Using different folder to avoid erasing my work data.
DB_FILE_NAME        :: "database.bin";
AR_FILE_NAME        :: "archive.csv";
DB_FILE_SIGN_STR    :: "TTT:B:02";

ASSERT_NOT_NULL     :: "Parameter '%' is null.";
ASSERT_NOT_EMPTY    :: "Parameter '%' is empty.";
ASSERT_NOT_CONTAIN  :: "'%' does not contain '%'.";
ASSERT_INVALID_INDEX:: "Invalid index '%'.";

SECONDS_IN_MINUTE   :: cast(s64)60;
SECONDS_IN_HOUR     :: cast(s64)60*SECONDS_IN_MINUTE;
SECONDS_IN_DAY      :: cast(s64)24*SECONDS_IN_HOUR;
SECONDS_IN_YEAR     :: cast(s64)365*SECONDS_IN_DAY;
MAX_DATABASE_TASKS  :: S64_MAX;

Task :: struct {
    times       : [NUM_WEEK_DAYS] s64;
    name        : [72] u8;
}

Database :: struct {
    modified_on     : Apollo_Time;
    active_idx      : s64 = -1;
    selected_idx    : s64 = -1;
    total_times     : [NUM_WEEK_DAYS] s64;
    tasks           : [..] Task;
}

database                : Database;
archive                 : Database;
is_autosave_enabled     := true;
countdown_to_autosave   := -1;
app_directory           : string;
db_file_path            : string;
ar_file_path            : string;

size_x                  : s32;
size_y                  : s32;
pos_x                   : s32;
pos_y                   : s32;

Styles :: enum s16 {
    SELECTED :: 1;
    SELECTED_INVERTED;
    ACTIVE;
    ACTIVE_SELECTED;
    ERROR;
}

Layouts :: enum u8 {
    NORMAL;
    COMPACT;
}

error_window        : *WINDOW = null;
error_time_limit    := Apollo_Time.{0, 0};

print_error :: (format :string, args : .. Any) {
    if stdscr == null { // || isendwin() == true { // Not in ncurses mode? TODO DAM
        print(format, ..args);
        print("\n");
    }
    else {
        CHAR_SPACE :: #char " ";
        w_size_x: s32 = ifx size_x > 120 then 120 else size_x - 2;
        w_size_y: s32 = 4;
        if (error_window == null) {
            //error_window = newwin(w_size_y, w_size_x, (size_y - w_size_y) / 2, (size_x - w_size_x) / 2); TODO DAM
            //wattron(error_window, COLOR_PAIR(xx Styles.ERROR)); TODO DAM
            //wborder(error_window, CHAR_SPACE, CHAR_SPACE, 0, 0, ACS_HLINE, ACS_HLINE, ACS_HLINE, ACS_HLINE); TODO DAM
            //mvwprintw(error_window, 0, 1, " Error "); TODO DAM
            //wmove(error_window, 1, 0); TODO DAM
        }
        else {
            //waddch(error_window, CHAR_SPACE); TODO DAM
        }
        //wprintw(error_window, temp_c_string(tprint(format, args))); TODO DAM
        error_time_limit = current_time_monotonic() + seconds_to_apollo(5);
    }
}

draw_error_window :: () {
    if (error_window == null) return;
    
    // Hide error window after time-limit or if terminal is shrank.
    w_size_x: s32;
    w_size_y: s32;
    //getmaxyx(error_window, *w_size_y, *w_size_x); TODO DAM
    if (current_time_monotonic() >= error_time_limit
        || size_x - w_size_x < 2
        || size_y - w_size_y < 2
    ) {
        //delwin(error_window); TODO DAM
        error_window = null;
        return;
    }
    
    // Adjust error window position.
    pos_x := (size_x - w_size_x) / 2;
    pos_y := (size_y - w_size_y) / 2;
    //mvwin(error_window, pos_y, pos_x); TODO DAM
    
    // Avoid being overwritten by main window content.
    //refresh(); TODO DAM
    //touchwin(error_window); TODO DAM
    //wrefresh(error_window); TODO DAM
}

trigger_autosave :: () {
    countdown_to_autosave = 13375; // ms
}

show_processing :: () {
    //mvaddch(0, 0, ACS_DIAMOND); TODO DAM
    //refresh(); TODO DAM
}

// Returns true if string to_compare is equal to any of the other passed strings, false otherwise.
is_equal_to_any :: (to_compare :string, test_a :string, test_b :string) -> bool {
    return to_compare == test_a || to_compare == test_b;
}

// Count digits required to represent number on base. Sign is discarded.
count_digits :: (number: s64, base: s64 = 10) -> s64 {
    if number == 0 return 1;
    return cast(s64) floor( log(cast(float64)abs(number)) / log(cast(float64)abs(base)) ) + 1;
}

Text_Encoding :: enum u8 #specified {
    ASCII   :: 1;
    UTF8    :: 2;
}

// Truncates the string to the length provided or shorter, in case of UTF8 strings that require so.
// Truncation is done by zeroing the tail of the string in place.
// Returns length of truncated string.
truncate_string :: (str: string, length: s64, $encoding: Text_Encoding = .UTF8) -> length: s64 {
    assert(str.data != null, ASSERT_NOT_NULL, "str");
    assert(str.count >= length, "'str.count' should be equal or greater to 'length'.");
    
    data := str.data;
    count := str.count;

    #if encoding == .UTF8 {
        // Find index of first continuation byte.
        idx := length;
        while (idx > 0 && ((data[idx - 1] & 0xC0) == 0x80)) {
            idx -= 1;
        }
        continuation_bytes := length - idx;
    
        // If string starts with continuation bytes, it's an invalid UTF8 string.
        if (idx == 0 && continuation_bytes > 0) {
            length = 0;
        }
        // If length truncates some continuation bytes, remove incomplete UTF8 character.
        else if (idx > 0 // string is not empty
            // continuation bytes are not complete
            && !(continuation_bytes == 0 && (data[idx - 1] & 0x80) == 0x00)
            && !(continuation_bytes == 1 && (data[idx - 1] & 0xE0) == 0xC0)
            && !(continuation_bytes == 2 && (data[idx - 1] & 0xF0) == 0xE0)
            && !(continuation_bytes == 3 && (data[idx - 1] & 0xF8) == 0xF0)
        ) {
            length -= (continuation_bytes + 1); // Remove start byte, ence '+ 1'.
        }
    }

    memset(data + length, 0, count - length);
    return length;
}

// Returns true when the string is empty or consists of space characters.
is_empty_string :: (str: string) -> bool {
    for 0..str.count-1 {
        if str[it] == {
            case #char "\0"; #through;
            case #char "\t"; #through;      // horizontal tab
            case #char "\n"; #through;      // line feed
            case #char "\x0B"; #through;    // vertical tabulation
            case #char "\x0C"; #through;    // form feed
            case #char "\r"; #through;      // carriage return
            case #char " ";
                continue;
            case;
                return false;
        }
    }
    return true;
}

// Prints, on row y and column x, the time using 5 characters centered on space.
// Returns the result of a call to mvprintw.
mvprintw_time :: (y: s32, x: s32, time: s64, space: s32) -> int {
    TIME_CHARS :: 5;
    assert(space >= TIME_CHARS);
    
    mul_f64_s64 :: inline (a: float64, b: s64) -> s64 {
        return cast(s64)(a * cast(float64)b);
    }
    
    left_padding := (space - TIME_CHARS) / 2;
    right_padding := space - TIME_CHARS - left_padding;
    
    if time < 0 {
        return 0;
        // return mvprintw(y, x, "%*s  -  %*s", left_padding, "", right_padding, ""); TODO DAM
    }
    else if time == 0 {
        return 0;
        // return mvprintw(y, x, "%*s  0  %*s", left_padding, "", right_padding, ""); TODO DAM
    }
    else if time < SECONDS_IN_MINUTE {
        return 0;
        // return mvprintw(y, x, "%*s%3jds %*s", left_padding, "", time, right_padding, ""); TODO DAM
    }
    else if time < #run mul_f64_s64(100, SECONDS_IN_HOUR) {
        hours := time / SECONDS_IN_HOUR;
        minutes := (time - (hours * SECONDS_IN_HOUR) ) / SECONDS_IN_MINUTE;
        return 0;
        // return mvprintw(y, x, "%*s%02jd:%02jd%*s", left_padding, "", hours, minutes, right_padding, ""); TODO DAM
    }
    else if time < #run mul_f64_s64(9999.5, SECONDS_IN_DAY) {
        value := cast(float64) time / SECONDS_IN_DAY;
        decimals :=
            ifx time >= #run mul_f64_s64(99.95, SECONDS_IN_DAY) then 0 else
            ifx time >= #run mul_f64_s64(9.995, SECONDS_IN_DAY) then 1 else
            2;
        return 0;
        // return mvprintw(y, x, "%*s%4.*fd%*s", left_padding, "", decimals, value, right_padding, ""); TODO DAM
    }
    else if time < #run mul_f64_s64(9999.5, SECONDS_IN_YEAR) {
        value := cast(float64) time / SECONDS_IN_YEAR;
        decimals :=
            ifx time >= #run mul_f64_s64(99.95, SECONDS_IN_YEAR) then 0 else
            ifx time >= #run mul_f64_s64(9.995, SECONDS_IN_YEAR) then 1 else
            2;
        return 0;
        // return mvprintw(y, x, "%*s%4.*fy%*s", left_padding, "", decimals, value, right_padding, ""); TODO DAM
    }
    else {
        // TODO Set back the unicode emoji once ncurses has been replaced.
        return 0;
        // return mvprintw(y, x, "%*s  ∞  %*s", left_padding, "", right_padding, ""); TODO DAM
    }
}

// Returns active task or NULL if none applies.
get_active_task :: inline (db: Database) -> *Task {
    return ifx db.active_idx >= 0 then *db.tasks[db.active_idx] else null;
}

// Returns selected task or NULL if none applies.
get_selected_task :: inline (db: Database) -> *Task {
    return ifx db.selected_idx >= 0 then *db.tasks[db.selected_idx] else null;
}

is_valid_index :: inline(db: Database, index: s64) -> bool { return index >= 0 && index < db.tasks.count; }

// Adds a task to the database and returns it.
// If necessary, expands database capacity.
add_task :: (db: *Database, task: *Task = null) -> task: *Task, index: s64 {
    assert(db != null, ASSERT_NOT_NULL, "db");
    
    // If the task belongs to this database, calling array_add might invalidate the pointer
    // because the memory may be reallocated, thus we always use a copy of the task.
    new_task := ifx task == null then .{} else <<task;
    array_add(*db.tasks, new_task);
    
    for * db.total_times {
        <<it = add(<<it, new_task.times[it_index]);
    }
    
    idx := db.tasks.count-1;
    return *db.tasks[idx], idx;
}

// Deletes task from database.
// If possible, shrinks the database capacity.
// Returns success.
delete_task :: (using db: *Database, index: s64) -> bool { // TODO Maybe use `using db`.
    assert(db != null, ASSERT_NOT_NULL, "db");
    assert(is_valid_index(db, index), ASSERT_INVALID_INDEX, index);
    
    // Remove task timer values from total timers.
    for tasks[index].times {
        total_times[it_index] = sub(total_times[it_index], it);
    }
    
    // Move tasks after the index position to their new positions.
    for index..tasks.count-2
        tasks[it] = tasks[it+1];
    tasks.count -= 1;
    
    // Adjust selected task.
    if (selected_idx >= tasks.count) {
        selected_idx -= 1;
    }
    
    // Adjust active task.
    if (active_idx > index) {
        active_idx -= 1;
    }
    else if (active_idx == index) {
        active_idx = -1;
    }

    // Try to shrink database capacity if using more than 2MB.
    size_of_task := size_of(Task);
    if (tasks.allocated >> 2) > tasks.count && tasks.allocated * size_of_task > 2_000_000 {
        new_capacity := tasks.allocated >> 1;
        new_tasks_data := realloc(tasks.data, new_capacity * size_of_task, tasks.allocated * size_of_task, tasks.allocator);
        if new_tasks_data != null {
            tasks.data = new_tasks_data;
            tasks.allocated = new_capacity;
        }
    }
    
    return true;
}

// Moves task from source to target.
// Source and target get clamped to database size.
move_task :: (db: *Database, source: s64, target: s64) { // TODO Maybe `using db`
    assert(db != null, ASSERT_NOT_NULL, "db");
    
    source = clamp(source, 0, db.tasks.count-1);
    target = clamp(target, 0, db.tasks.count-1);
    
    if (source == target) return;
    
    // Move task to new location, but first, shift the others to allow some space.
    temp_task := db.tasks[source];
    move_size := abs(target - source);
    
    if target > source {
        for 0..move_size-1
            db.tasks[source + it] = db.tasks[source + it + 1];
    }
    else {
        for < move_size-1..0
            db.tasks[target + it + 1] = db.tasks[target + it];
    }
    
    db.tasks[target] = temp_task;
    
    // Adjust active and selected tasks.
    if (db.active_idx == source) {
        db.active_idx = target;
    }
    else if (source < db.active_idx && db.active_idx <= target) {
        db.active_idx -= 1;
    }
    else if (target <= db.active_idx && db.active_idx < source) {
        db.active_idx += 1;
    }
    db.selected_idx = target;
}

// Find similar task and return it's index, or -1 if not found.
find_similar_task :: (db: *Database, task: Task) -> idx: s64 {
      compare_array :: (a: [] $T, b: [] T) -> int {
        for 0..min(a.count, b.count)-1 {
            if a[it] > b[it] return 1;
            if a[it] < b[it] return -1;
        }
        if a.count > b.count return 1;
        if a.count < b.count return -1;
        return 0;
    }
    
    for db.tasks {
        if compare(xx task.name, xx it.name) == 0 && compare_array(task.times, it.times) == 0 {
            return it_index;
        }
    }
    return -1;
}

// Updates the times on the active task (and adjusts database totals).
update_times :: (db: *Database) {
    assert(db != null, ASSERT_NOT_NULL, "db");
    
    // Get time frame in UTC.
    start_time := db.modified_on;
    stop_time := seconds_to_apollo(to_seconds(current_time_consensus())); // HACK Discard sub-seconds information because Task.times only store seconds. To other workaround would be to use Task.times as Apollo_Time instead of s64 seconds.
    
    // Keep track of this update.
    db.modified_on = stop_time;
    
    if db.active_idx < 0 return;
    
    active_task := *db.tasks[db.active_idx];
    start_week_day: s8;
    while (start_time < stop_time) {
        
        start_week_day = to_calendar(start_time, .LOCAL).day_of_week_starting_at_0;
        
        // Get next day in local time.
        start_of_day_cal := to_calendar(start_time, .LOCAL);
        start_of_day_cal.hour = 0;
        start_of_day_cal.minute = 0;
        start_of_day_cal.second = 0;
        start_of_day_cal.millisecond = 0;
        start_of_day := calendar_to_apollo(start_of_day_cal);
        
        next_day := start_of_day + #run seconds_to_apollo(SECONDS_IN_DAY);
        next_start := ifx next_day < stop_time then next_day else stop_time;
        elapsed_time := to_seconds(next_start - start_time);
        active_task.times[start_week_day] += elapsed_time;
        db.total_times[start_week_day] += elapsed_time;
        
        start_time = next_start;
    }
}

// Recalculates database totals.
update_total_times :: (db: *Database) {
    assert(db != null, ASSERT_NOT_NULL, "db");
    
    for *total: db.total_times { <<total = 0; }
    
    for task: db.tasks {
        for *total, index: db.total_times {
            <<total = add(<<total, task.times[index]);
        }
    }
}

// Resets the times of the provided task (and adjusts database totals).
reset_task_times :: (db: *Database, index: s64) {
    assert(db != null, ASSERT_NOT_NULL, "db");
    assert(is_valid_index(db, index), ASSERT_INVALID_INDEX, index);
    
    // Make sure we sync before applying the changes.
    update_times(db);
    
    for * db.tasks[index].times {
        db.total_times[it_index] = sub(db.total_times[it_index], <<it);
        <<it = 0;
    }
}

// Sets the time on the day and task provided (and adjusts database totals).
set_task_time :: (db: *Database, index: s64, day: int, time: s64) {
    assert(db != null, ASSERT_NOT_NULL, "db");
    assert(is_valid_index(db, index), ASSERT_INVALID_INDEX, index);
    
    // Make sure we sync before applying the changes.
    update_times(db);
    
    db.total_times[day] = add(db.total_times[day], time - db.tasks[index].times[day]);
    db.tasks[index].times[day] = time;
}

// Adds the time on the day and task provided (and adjusts database totals).
add_task_time :: (db: *Database, index: s64, day: int, time: s64) {
    assert(db != null, ASSERT_NOT_NULL, "db");
    assert(is_valid_index(db, index), ASSERT_INVALID_INDEX, index);
    
    // Make sure we sync before applying the changes.
    update_times(db);
    
    db.total_times[day] = add(db.total_times[day], time);
    db.tasks[index].times[day] = add(db.tasks[index].times[day], time);
}

// Adds the time on the day and task provided (and adjusts database totals).
add_task_times :: (db: *Database, index: s64, times: [7] s64) {
    assert(db != null, ASSERT_NOT_NULL, "db");
    assert(is_valid_index(db, index), ASSERT_INVALID_INDEX, index);
    
    // Make sure we sync before applying the changes.
    update_times(db);
    
    for times {
        db.total_times[it_index] = add(db.total_times[it_index], it);
        db.tasks[index].times[it_index] = add(db.tasks[index].times[it_index], it);
    }
}

// Resets database to the initial state and deallocates all memory taken by tasks.
reset_database :: (db: *Database) {
    assert(db != null, ASSERT_NOT_NULL, "db");
    array_reset(*db.tasks);
    <<db = .{};
}

// Stores data from database into binary file.
// Returns success.
store_database :: (db: Database, path: string) -> success: bool {
    assert(xx path, ASSERT_NOT_EMPTY, "path");
    
    // Open file.
    file, open_success := file_open(path, for_writing = true); // log_errors: bool = true
    if open_success == false {
        print_error("Failed to open file '%' while storing database: ERROR_FROM_LOG", path); // TODO Get error from logger ?!
        return false;
    }
    defer file_close(*file);
    
    file_write(*file, DB_FILE_SIGN_STR);
    file_write(*file, *db, size_of(Database));
    file_write(*file, db.tasks.data, size_of(Task) * db.tasks.count);

    return true;
}

// Loads data from binary file into database.
// Returns success.
load_database :: (db: *Database, path: string) -> success: bool {
    assert(db != null, ASSERT_NOT_NULL, "db");
    assert(xx path, ASSERT_NOT_EMPTY, "path");
    
    // Open file.
    file, open_success := file_open(path); // log_errors: bool = true
    if open_success == false {
        print_error("Failed to open file '%' while loading database: ERROR_FROM_LOG", path); // TODO Get error from logger ?!
        return false;
    }
    defer file_close(*file);
    
    // Validate file signature.
    file_signature: [DB_FILE_SIGN_STR.count] u8;
    read_success := file_read(file, *file_signature, DB_FILE_SIGN_STR.count);
    if read_success == false print_error("Failed to read file signature from '%'.", path);
    if cast(string)file_signature != DB_FILE_SIGN_STR {
        print_error("Invalid file signature.");
        return false;
    }
    
    // Read database structure.
    read_success = file_read(file, db, size_of(Database));
    // TODO Use print_error or assert?
    if read_success == false {
        print_error("Failed to read database info from '%'.", path);
        return false;
    }
    assert(read_success == true, "Failed to read database info from '%'.", path);
    
    // Reserve database capacity for tasks.
    tasks_count := db.tasks.count;
    Initialize(*db.tasks); // Cleanup whatever was read from file.
    array_reserve(*db.tasks, tasks_count);
    
    // Read database tasks.
    file_read(file, db.tasks.data, size_of(Task) * tasks_count);
    db.tasks.count = tasks_count;
    
    // Make sure we are reading all the file.
    buffer: u8;
    success, bytes := file_read(file, *buffer, 1);
    assert(bytes == 0, "Unexpected content found at the end of file '%'.", path);

    return true;
}

// Exports data into CSV file.
// Returns success.
export_to_csv :: (db: Database, path: string) -> success: bool {
    assert(xx path, ASSERT_NOT_EMPTY, "path");
    
    builder: String_Builder;
    defer reset(*builder);
    
    CSV_HEADER :: string.[ "task", "sunday", "monday", "tuesday", "wednesday", "thursday", "friday", "saturday" ];
    print_to_builder(*builder, "%\n", join(..CSV_HEADER, separator = ","));
    
    buffer: [Task.name.count] u8;
    name: string = xx buffer;
    for db.tasks {
        name.count = c_style_strlen(it.name.data);
        memcpy(name.data, it.name.data, name.count);
        replace_chars(name, ",", #char " ");
        print_to_builder(*builder, "%,%,%,%,%,%,%,%\n",
            name, it.times[0], it.times[1], it.times[2], it.times[3], it.times[4], it.times[5], it.times[6]);
    }

    write_entire_file(path, *builder);
    
    return true;
}

// Imports CSV file into database.
// Returns success.
import_from_csv :: (db: *Database, path: string) -> bool {
    // TODO Review code.
    assert(db != null, ASSERT_NOT_NULL, "db");
    assert(xx path, ASSERT_NOT_EMPTY, "path");
    error_code: s64;
    
    // Check file size TODO Read based on file size
    //file_info: stat_t;
    //error_code = sys_stat(path, *file_info); // TODO Check for error.
    //size := file_info.st_size;
    size := 0;
    
    success: bool;
    map: Map_File_Info;
    data: string;
    is_using_map := false;
    if size >= 1<<30 {
        assert(false, "Parsing big files not implemented yet.");
    }
    else {
        data, success = read_entire_file(path);
    }
    defer if is_using_map then map_entire_file_end(*map); else free(data.data);
    csv := data;
    
    if success == false {
        print_error("Failed to read file '%' while loading database: ERROR_FROM_LOG", path); // TODO Get error from logger ?!
        return false;
    }


    // TODO Helper function.
    advance :: inline (array: *[] $T, amount: int = 1) {
        assert(amount >= 0);
        assert(array.count >= amount);
        array.count -= amount;
        array.data  += amount;
    }
    
    
    // TODO Helper function.
    consume_next_line :: (sp: *string) -> string, bool {
        // To find the end of the line, we look for a linefeed character.
        // We will trim a carriage return off the end if there is one there also.
        // Thus this works on both 'dos' and 'unix'-style files.

        s := << sp;
        found, result, right := split_from_left(s, 10);

        if !found {
            // This is the last line; there may not have been a linefeed after that,
            // but we still want to handle that data, so we return true if there was
            // a nonzero amount of stuff there.
            
            << sp = "";

            return s, (s.count > 0);
        }

        // Chop the characters we are going to return from 'sp',
        // which holds the remaining file data.
        advance(sp, result.count + 1);

        if result {
            if result[result.count-1] == 13  result.count -= 1;  // If there's a carriage return at the end, remove it by decrementing the string's length.
        }
        
        return result, true;
    }
    
    //Skip header line.
    consume_next_line(*csv);
    
    next_line :: inline (csv: *string) -> line: string, success: bool {
        for 0..csv.count {
            if csv.data[it] == #char "\n" {
                line: string = <<csv;
                line.count = it;
                csv.data += it + 1;
                csv.count -= it + 1;
                return line, true;
            }
        }
        return "", false;
    }
    
    { // Parse CSV lines.
        auto_release_temp(); // TODO Needs to be tested.
        line := csv;
        while (true) {
            line, success := consume_next_line(*csv);
    //         line, success := next_line(*csv);
            if success == false break;
            
            task: Task;
            csv_values := split(line, ","); // TODO Temporary memory... if file is too big this may break.
            
            // Import task name.
            name_length := min(task.name.count, csv_values[0].count);
            memcpy(task.name.data, csv_values[0].data, name_length);
            truncate_string(xx task.name, name_length);
            
            advance(*csv_values);
            for csv_values
                task.times[it_index] = string_to_int(it);
            
            add_task(db, *task);
            // TODO Check this old code and remove it if not necessary.
    //         if context.temporary_storage.total_bytes_occupied > (100<<20) {
    //             print("temp: %\n", context.temporary_storage.total_bytes_occupied >> 20);
    //             reset_temporary_storage();
    //         }
        }
    }
    
    // Adjust selected task.
    if (db.selected_idx < 0 && db.tasks.count > 0) db.selected_idx = 0;

    return true;
}

// Appends task to the end of the CSV file.
// Returns success.
append_to_csv :: (task: Task, path: string) -> success: bool {
    assert(xx path, ASSERT_NOT_EMPTY, "path");
    
    file, file_success := file_open(path, true, true);
    defer file_close(*file);
    if file_success == false {
        //print_error("Failed to open file '%s' while appending to CSV: %s.", path, strerror(errno)); // TODO Show internal error or something
        return false;
    }
    
    file_size := file_length(file);
    file_set_position(file, file_size-1);
    last_char: u8;
    file_read(file, *last_char, 1);
    if (last_char != #char "\n") {
        file_write(*file, "\n");
    }
    
    task_name := copy_temporary_string(xx task.name); // TODO Cleanup this temp mess.
    replace_chars(task_name, ",", #char " ");
    csv_line := tprint("%,%,%,%,%,%,%,%\n",
        task_name, task.times[0], task.times[1], task.times[2], task.times[3], task.times[4], task.times[5], task.times[6]);
    file_write(*file, csv_line);
    
    return true;
}

// Selects task by index.
// Index gets clamped to [0, db->count[.
select_task :: (db: *Database, index: s64) {
    assert(db != null, ASSERT_NOT_NULL, "db");
    db.selected_idx = ifx db.tasks.count == 0 then -1 else clamp(index, 0, db.tasks.count-1);
}

// Selects task by delta relative to currently selected task.
select_task_by_delta :: (db: *Database, delta: s64) {
    assert(db != null, ASSERT_NOT_NULL, "db");
    idx :=
        ifx (delta > 0 && db.selected_idx > S64_MAX - delta) then S64_MAX else
        ifx (delta < 0 && db.selected_idx < S64_MIN - delta) then S64_MIN else
        db.selected_idx + delta;
    select_task(db, idx);
}

// Set active task.
// Passing -1 de-activates any previously active task.
set_active_task :: (db: *Database, index: s64) {
    assert(db != null, ASSERT_NOT_NULL, "db");
    assert(index == -1 || is_valid_index(db, index), ASSERT_INVALID_INDEX, index);
    update_times(db);
    db.active_idx = index;
}

// Returns true when database is full.
is_database_full :: inline (db: Database) -> bool {
    return db.tasks.count >= MAX_DATABASE_TASKS;
}

INPUT_TIMEOUT_MS    :: 1000;
INPUT_AWAIT_INF     :: -1;

NUM_HEADER_ROWS     :: 1;
NUM_FOOTER_ROWS     :: 1;
NUM_COLUMNS         :: 9;

L_TITLE_IDX         :: 0;
L_DAYS_IDX          :: 1;
L_TOTAL_IDX         :: 8;

Column :: struct {
    header              : string;
    width               : int;
    alignment_offset    : int;
    alignment           : u8;
}

Layout :: struct {
    columns             : [NUM_COLUMNS] Column;
    archive_title       : string;
}

layouts                 : [#run type_info(Layouts).values.count] Layout;
layout_tasks_rows       : int;
is_terminal_too_small   := true;


initialize_tui :: () {
    
    // Normal layout.
    layouts[Layouts.NORMAL] = .{
        archive_title = " Archive ",
        columns = .[
            .{ header = #run join(" Task Time Tracker v", VERSION, " "), width = -1, alignment = #char "L" },
            .{ header = " Sun ",   width = 7,  alignment = #char "C" },
            .{ header = " Mon ",   width = 7,  alignment = #char "C" },
            .{ header = " Tue ",   width = 7,  alignment = #char "C" },
            .{ header = " Wed ",   width = 7,  alignment = #char "C" },
            .{ header = " Thu ",   width = 7,  alignment = #char "C" },
            .{ header = " Fri ",   width = 7,  alignment = #char "C" },
            .{ header = " Sat ",   width = 7,  alignment = #char "C" },
            .{ header = " Total ", width = 9,  alignment = #char "C" },
        ]
    };
    
    // Compact layout.
    layouts[Layouts.COMPACT] = .{
        archive_title = " Archive ",
        columns = .[
            .{ header = #run join(" TTT ", VERSION, " "), width = -1, alignment = #char "L" },
            .{ header = " S ",     width = 5,   alignment = #char "C" },
            .{ header = " M ",     width = 5,   alignment = #char "C" },
            .{ header = " T ",     width = 5,   alignment = #char "C" },
            .{ header = " W ",     width = 5,   alignment = #char "C" },
            .{ header = " T ",     width = 5,   alignment = #char "C" },
            .{ header = " F ",     width = 5,   alignment = #char "C" },
            .{ header = " S ",     width = 5,   alignment = #char "C" },
            .{ header = " # ",     width = 5,   alignment = #char "C" },
        ]
    };
    
    // Calculate alignment_offsets.
    for * layout: layouts {
        for * col: layout.columns {
            offset: int;
            if col.alignment == {
                case #char "L";
                    offset = 0;
                case #char "C";
                    offset = ((col.width - col.header.count) / 2);
                case #char "R";
                    offset = (col.width - col.header.count);
            }
            col.alignment_offset = offset;
        }
    }
    
    // TODO DAM
    TIO.initialize();
    // stdscr = initscr();             // Start curses mode. TODO DAM
    // cbreak();                       // Line buffering disabled; pass on everty thing to me. TODO DAM
    // keypad(stdscr, true);           // I need those nifty F1..F12. TODO DAM
    // curs_set(0);                    // Set cursor invisible. TODO DAM
    // noecho();                       // Disable echoing input characters. TODO DAM
    
    // Initialize pairs of colors.
    //start_color(); TODO DAM
    //use_default_colors(); // Using default (-1) instead of COLOR_BLACK. TODO DAM
    //init_pair(xx Styles.SELECTED, COLOR_BLACK, COLOR_CYAN); TODO DAM
    //init_pair(xx Styles.SELECTED_INVERTED, COLOR_CYAN, -1); TODO DAM
    //init_pair(xx Styles.ACTIVE, COLOR_BLUE, -1); TODO DAM
    //init_pair(xx Styles.ACTIVE_SELECTED, COLOR_WHITE, COLOR_BLUE); TODO DAM
    //init_pair(xx Styles.ERROR, COLOR_RED, -1); TODO DAM
}

update_layout :: () {
    // Calculate number of available rows to display tasks.
    layout_tasks_rows = (size_y - NUM_HEADER_ROWS - NUM_FOOTER_ROWS);
    
    // Calculate first column width: expands to fill the remaining space dynamically.
    for * layout: layouts {
        layout.columns[0].width = size_x - (NUM_COLUMNS - 1) - 2;
        for 1..layout.columns.count-1 {
            layout.columns[0].width -= layout.columns[it].width;
        }
    }
}

draw_tui :: (db: *Database, layout: *Layout) {

    adjust_first_day_of_week := int.[
        (0 + FIRST_DAY_OF_WEEK) % NUM_WEEK_DAYS,
        (1 + FIRST_DAY_OF_WEEK) % NUM_WEEK_DAYS,
        (2 + FIRST_DAY_OF_WEEK) % NUM_WEEK_DAYS,
        (3 + FIRST_DAY_OF_WEEK) % NUM_WEEK_DAYS,
        (4 + FIRST_DAY_OF_WEEK) % NUM_WEEK_DAYS,
        (5 + FIRST_DAY_OF_WEEK) % NUM_WEEK_DAYS,
        (6 + FIRST_DAY_OF_WEEK) % NUM_WEEK_DAYS,
    ];
    
    x: int;
    y: int;
    col: *Column;

    // Get context information.
    active_task := get_active_task(db);
    selected_task := get_selected_task(db);
    now_utc := current_time_consensus();
    now_week_day := to_calendar(now_utc, .LOCAL).day_of_week_starting_at_0;

    // Reset theme and clear screen.
    //attrset(A_NORMAL); TODO DAM
    TIO.tui_clear_screen();

    // Draw outer border.
    //box(stdscr, 0, 0); TODO DAM
    // WIP

    // Draw table grids.
    // TODO Maybe this could be simplified?
    y = 0;
    x = 0;
    for 0..layout.columns.count-2 {
        column := layout.columns[it];
        x += 1 + column.width;
        //mvaddch(xx y, xx x, ACS_TTEE); TODO DAM
        for row: 1..size_y-1 {
            //mvaddch(xx row, xx x, ACS_VLINE); TODO DAM
        }
        //mvaddch(size_y-1, xx x, ACS_BTEE); TODO DAM
    }

    
    ///////////////////////////////////////////////////////////////////////////
    // Draw headers.
    y = 0;
    x = 0;
    
    // Headers : title
    x += 1;
    col = *layout.columns[L_TITLE_IDX];
    //mvaddstr(xx y, xx (x + col.alignment_offset), ifx db == *archive then layout.archive_title.data else col.header.data); TODO DAM
    x += col.width;
    
    // Headers : days
    for 0..NUM_WEEK_DAYS-1 {
        idx := adjust_first_day_of_week[it];
        x += 1;
        
        // Apply theme.
        if (idx == now_week_day && active_task != null) {
            // attron(COLOR_PAIR(xx Styles.ACTIVE) | A_BOLD); TODO DAM
        }
        else if (idx == now_week_day) {
            // attron(COLOR_PAIR(xx Styles.SELECTED_INVERTED) | A_BOLD); TODO DAM
        }
        
        col = *layout.columns[L_DAYS_IDX + idx];
        //mvaddstr(xx y, xx (x + col.alignment_offset), col.header.data); TODO DAM
        x += col.width;
        
        // Reset theme.
        //attrset(A_NORMAL); TODO DAM
    }
    
    // Headers : total
    x += 1;
    col = *layout.columns[L_TOTAL_IDX];
    //mvaddstr(xx y, xx (x + col.alignment_offset), col.header.data); TODO DAM
    
    
    ///////////////////////////////////////////////////////////////////////////
    // Draw tasks.

    total_time := 0;
    column_width: int;
    
    y = 0;
    // Pagination based on currently selected task (show page where selected task is).
    idx_start := (db.selected_idx / layout_tasks_rows) * layout_tasks_rows;
    // Display up to rows allowed by the layout, or less if reached end of database.
    idx_stop := idx_start + (ifx layout_tasks_rows > db.tasks.count - idx_start then db.tasks.count - idx_start else layout_tasks_rows);
    for task_idx: idx_start..idx_stop-1 {
        auto_release_temp(); // TODO Temporary memory being trashed?!
        task := *db.tasks[task_idx];
        y += 1;
        x = 0;
        
        // Apply theme.
        if (task == active_task && task == selected_task) {
            // attron(COLOR_PAIR(xx Styles.ACTIVE_SELECTED) | A_BOLD); TODO DAM
        }
        else if (task == selected_task) {
            // attron(COLOR_PAIR(xx Styles.SELECTED)); TODO DAM
        }
        else if (task == active_task) {
            // attron(COLOR_PAIR(xx Styles.ACTIVE) | A_BOLD); TODO DAM
        }
        
        // Task title.
        x += 1;
        column_width = layout.columns[L_TITLE_IDX].width;
        // mvprintw(xx y, xx x, "%-*.*s", column_width, column_width, temp_c_string(xx task.name)); //task.name); TODO Fix required for LLVM/Cncurses. TODO DAM
        x += column_width;
        
        // Task times.
        total_time = 0;
        for 0..NUM_WEEK_DAYS-1 {
            x += 1;
            day_idx := (it + FIRST_DAY_OF_WEEK) % NUM_WEEK_DAYS;
            column_width = layout.columns[L_DAYS_IDX + day_idx].width;
            task_time := task.times[day_idx];
            total_time = add(total_time, task_time);
            mvprintw_time(xx y, xx x, task_time, xx column_width);
            x += column_width;
        }
        
        // Task total.
        x += 1;
        mvprintw_time(xx y, xx x, total_time, xx layout.columns[L_TOTAL_IDX].width);
        
        // Reset theme.
        //attrset(A_NORMAL); TODO DAM
    }
    
    
    ///////////////////////////////////////////////////////////////////////////
    // Draw selected/total tasks.
    size := 1 + count_digits(db.selected_idx + 1) + 1 + count_digits(db.tasks.count) + 1; // " XXX/YYY "    
    if (size <= layout.columns[L_TITLE_IDX].width) {
        // mvprintw(size_y - 1, 1, " %td/%zd ", db.selected_idx + 1, db.tasks.count); TODO DAM
    }
    else {
        // mvprintw(size_y - 1, 1, "%td", db.selected_idx + 1); TODO DAM
    }
    
    
    ///////////////////////////////////////////////////////////////////////////
    // Draw daily totals.
    y = size_y - 1;
    x = 0 + 1 + layout.columns[L_TITLE_IDX].width;
    total_time = 0;
    for 0..NUM_WEEK_DAYS-1 {
        idx := adjust_first_day_of_week[it];
        daily_total := db.total_times[idx];
        x += 1;
        
        // Apply theme.
        if (idx == now_week_day && active_task != null) {
            // attron(COLOR_PAIR(xx Styles.ACTIVE) | A_BOLD); TODO DAM
        }
        else if (idx == now_week_day) {
            // attron(COLOR_PAIR(xx Styles.SELECTED_INVERTED) | A_BOLD); TODO DAM
        }
        
        column_width = layout.columns[L_DAYS_IDX + idx].width;
        total_time = add(total_time, daily_total);
        mvprintw_time(xx y, xx x, daily_total, xx column_width);
        x += column_width;
        
        // Reset theme.
        //attrset(A_NORMAL); TODO DAM
    }
    x += 1;
    mvprintw_time(xx y, xx x, total_time, xx layout.columns[L_TOTAL_IDX].width);
}

free_memory :: () {
    reset_database(*database);
    reset_database(*archive);
    
    free(app_directory);
    free(db_file_path);
    free(ar_file_path);
    //reset_temporary_storage();
}

read_input_string_padded :: (row: int, column: int, style: s32, length: int, padding: int) -> string {
    str := talloc_string(length);
    memset(str.data, 0, str.count);
    // attron(style | A_UNDERLINE); TODO DAM
    // mvprintw(xx row, xx column, "%*s", padding, ""); TODO DAM
    //echo(); TODO DAM
    //curs_set(1); TODO DAM
    //mvgetnstr(xx row, xx column, str.data, xx length); TODO DAM
    truncate_string(str, length);
    //noecho(); TODO DAM
    //curs_set(0); TODO DAM
    //attrset(A_NORMAL); TODO DAM
    return str;
}

read_input_string :: (row: int, column: int, style: s32, length: int) -> string {
    return read_input_string_padded(row, column, style, length, length);
}

// Returns success.
read_input_int :: (row: int, style: s32, message: string) -> value: int, success: bool {
    // attron(xx style); TODO DAM
    //move(xx row, 1); TODO DAM
    //addch(ACS_CKBOARD); TODO DAM
    //addstr(message.data); // TODO Convert to C type TODO DAM
    //attrset(A_NORMAL); TODO DAM
    
    // Get line number.
    input_pos_x := 0;//getcurx(stdscr); TODO DAM
    input_width := size_x - input_pos_x - 1;
    str := read_input_string(row, input_pos_x, style, input_width);
    
    value, success := parse_int(*str);
    return value, success;
}

// Retuns true if user presses enter, false otherwise.
read_input_char :: (row: int, style: int, message: string) -> s32 {
    assert(message.data != null, ASSERT_NOT_NULL, "message"); // TODO Improve this check?
    
    // attron(xx style); TODO DAM
    //move(xx row, 1); TODO DAM
    for 0..size_x-3 {
    //for (int idx = 0; idx < size_x - 2; idx++) { // TODO check what's going on here.
        //addch(ACS_CKBOARD); TODO DAM
    }
    //mvaddstr(xx row, 2, message.data); TODO DAM
    //attrset(A_NORMAL); TODO DAM
    
    //return getch(); TODO DAM
    return 0;
}

// Retuns true if user presses enter, false otherwise.
read_enter_confirmation :: inline (row: int, style: int, message: string) -> bool {
    return read_input_char(row, style, message) == #char "\n";
}

main :: () {

    // -- -- -- Testing TUI -- START
    #if 0 {
        print("test 0\n");
        TUI.test();
        return;
    }

    #if 0 {
        print("test 1\n");
        TUI.start();
        buffer: [8] u8;
        brss, error, msg := TUI.OS_read_input(buffer.data, buffer.count);
        TUI.stop();
        if error == true print("error:%", msg);
        print("br:%", brss);
        print("input:%", cast(string)buffer);
        TUI.stop();
        return;
    }

    #if 0 {
        print("test 2\n");
        key: TUI.Key = #char "d";
        while(key != #char "q") {
            // key = TUI.get_key(10);
            buffer: [8] u8;
            buffer[0] = 0;
            brss := TUI.OS_read_input(buffer.data, 1);
            if brss > 0 {
                key = buffer[0];
                print(">%<", xx key);
            }
            else {
                print(":");
            }
            sleep_milliseconds(10);
        }
        TUI.stop();
        return;
    }

    #if 0 {
        print("testing select\n");
        TUI.start();
        TUI.test();
        TUI.test();
        TUI.test();
        TUI.stop();
        return;
    }

    #if 0 {
        print("test 3\n");
        TUI.start();
        key: TUI.Key = #char "d";
        while(key != #char "q") {
            __mark := get_temporary_storage_mark();
            // sleep_milliseconds(1000);
            key = TUI.get_key(3000);
            
            if key != xx TUI.Keys.None print_character(key);
            else write_string("-");
            set_temporary_storage_mark(__mark);
        }
        print("Waiting 1s..");
        sleep_milliseconds(1000);
        print("!\n\r");
        print("Stoping..");
        TUI.stop();
        print("!\n\r");
        return;
    }

    #if 1 {
        print("test 4\n", to_standard_error = true);
        TUI.start();
        xcolumns, xrows: int;
        key: TUI.Key = #char "d";
        last_none_char := "X";
        while(key != #char "q") {
            // __mark := get_temporary_storage_mark();

            if key == {
                case xx TUI.Keys.None; {
                    TUI.set_cursor_position(2, 2);
                    last_none_char = ifx last_none_char == "X" then "+" else "X";
                    write_string(last_none_char);
                }

                case xx TUI.Keys.Resize; {
                    TUI.clear_terminal();
                }
            }
            size_r, size_c := TUI.get_terminal_size();
            TUI.draw_box(1, 1, size_c, size_r);
            x := ifx size_r > 1 then size_r-1 else 1;
            y := ifx size_c > 24 then size_c-24 else 1;
            TUI.set_cursor_position(x, y);
            print("size(CxR): %x%\n", size_c, size_r);
            
            key = TUI.get_key(3000);
        }
        TUI.stop();
        print("size(CxR): %x%\n", xcolumns, xrows);
        return;
    }

    // -- -- -- Testing TUI -- STOP

    
    // TODO Implement signal handling and see modules/Debug.jai for examples.
    
    defer report_memory_leaks(); // TODO Remove after final debug sessions.
    
    defer free_memory();
    
    {   // Initialize app directory.
        auto_release_temp();
        home_dir, success_dir := get_home_directory(); // Returns system owned memory.
        if success_dir == false {
            home_dir = ".";
        }
        
        home_path, success_path := get_absolute_path(home_dir); // Returns temporary memory.
                
        if success_path == false {
            print_error("Failed to find home directory '%'.", home_dir);
            exit(1);
        }
        
        app_directory = join(home_path, "/", APP_FOLDER_NAME);
        db_file_path = join(app_directory, "/", DB_FILE_NAME);
        ar_file_path = join(app_directory, "/", AR_FILE_NAME);

        // TODO app data should be stored under:
        // Windows:     APPDATA (~/AppData/Roaming)
        // Unix:        XDG_DATA_HOME (~/.local/share)
        
        make_directory_if_it_does_not_exist(app_directory, recursive = true);
    }
    
    { // Initialize database and archive files if needed.
        auto_release_temp();
        if (file_exists(db_file_path) == false) {
            if (store_database(database, db_file_path) == false) {
                print_error("Failed to initialize database.");
                exit(1);
            }
        }
    
        if (file_exists(ar_file_path) == false) {
            if (export_to_csv(archive, ar_file_path) == false) {
                print_error("Failed to initialize archive.");
                exit(1);
            }
        }
    }
    
    args :=  get_command_line_arguments();
    defer  array_reset(*args);
    
    if args.count > 1 {
        
        is_exit_requested := false;
        for 1..args.count-1 {
            if is_equal_to_any(args[it], "--help", "-h") {
                write_strings(
                    "Usage: ttt [OPTION]... [FILE]...\n",
                    "  -i, --import-csv [FILE]       Import CSV file to database (discard first row).\n",
                    "  -e, --export-csv [FILE]       Export database to CSV file.\n",
                    "  -n, --no-autosave             Disable autosave feature (only save on exit).\n",
                    "  -h, --help                    Display this help and exit.\n",
                    "  -v, --version                 Output version information and exit.\n",
                    "\n",
                    "In app commands\n",
                    "  w, W                          Archive a duplicate and reset times for all tasks.\n",
                    "  a, A                          Archive selected task (except if active).\n",
                    "  r, R                          Restore selected task from archive.\n",
                    "  t, T                          Select currently active task (if any).\n",
                    "  d, D                          Duplicate selected task.\n",
                    "  c, C                          Coalesce similar tasks.\n",
                    "  n, N                          Create new task.\n",
                    "  m, M                          Move selected task to position.\n",
                    "  g, G                          Select task by position.\n",
                    "  i, I                          Invert tasks order.\n",
                    "  s, S                          Sort tasks by:\n",
                    "                                  n     name;\n",
                    "                                  t     total time;\n",
                    "                                  1..7  time of Nth day of week.\n",
                    "  q, Q                          Save changes and exit.\n",
                    "  F2                            Rename selected task.\n",
                    "  F5                            Recalculate total times.\n",
                    "  TAB                           Toggle archive view.\n",
                    "  BACKSPACE                     Reset times for selected task.\n",
                    "  DELETE                        Delete selected task (except if active).\n",
                    "  SPACE, ENTER                  Toggle selected task as active/inactive.\n",
                    "  1, 2, 3, 4, 5, 6, 7           Edit selected task time for the Nth day of week:\n",
                    "                                  =#    sets # seconds;\n",
                    "                                  -#    subtracts # seconds;\n",
                    "                                  #     adds # seconds;\n",
                    "                                  #m    specifies # as minutes;\n",
                    "                                  #h    specifies # as hours;\n",
                    "                                  #d    specifies # as days;\n",
                    "                                  #y    specifies # as years.\n",
                    "  UP                            Select task above.\n",
                    "  DOWN                          Select task below.\n",
                    "  PAGE-UP                       Select task 1 page above.\n",
                    "  PAGE-DOWN                     Select task 1 page below.\n",
                    "  HOME                          Select first/top task.\n",
                    "  END                           Select last/bottom task.\n",
                    "\n",
                    "Notes\n");
                print("- All data files are stored in '%'.\n", app_directory);
                print("  If the home directory is undefined, './%' will be used.\n", APP_FOLDER_NAME);
                write_strings(
                    "  The database tasks are stored in binary format on the 'database.bin' file.\n",
                    "  The archived entries are stored in CSV format on the 'archive.csv' file.\n",
                    "- During intensive operations such as saving or recalculating totals times,\n",
                    "  a diamond symbol is shown on the top left corner.\n"
                );
                exit(0);
            }
            
            if is_equal_to_any(args[it], "--version", "-v") {
                print("Task Time Tracker version % \nCopyright % Daniel Martins\nLicense GPL-3.0-or-later\n", VERSION, YEAR);
                exit(0);
            }
            
            if is_equal_to_any(args[it], "--import-csv", "-i") {
                it += 1;
                if it >= args.count {
                    print_error("Missing CSV file path to import.");
                    exit(1);
                }
                if (load_database(*database, db_file_path) == false) {
                    print_error("Failed to load database.");
                    exit(1);
                }
                if (import_from_csv(*database, args[it]) == false) {
                    print_error("Failed to import CSV file.");
                    exit(1);
                }
                if (store_database(*database, db_file_path) == false) {
                    print_error("Failed to store database.");
                    exit(1);
                }
                reset_database(*database);
                is_exit_requested = true;
                continue;
            }
            
            if is_equal_to_any(args[it], "--export-csv", "-e") {
                it += 1;
                if it >= args.count {
                    print_error("Missing CSV file path to export.");
                    exit(1);
                }
                if (load_database(*database, db_file_path) == false) {
                    print_error("Failed to load database.");
                    exit(1);
                }
                if (export_to_csv(*database, args[it]) == false) {
                    print_error("Failed to export CSV file.");
                    exit(1);
                }
                reset_database(*database);
                is_exit_requested = true;
                continue;
            }
            
            if is_equal_to_any(args[it], "--no-autosave", "-n") {
                is_autosave_enabled = false;
                continue;
            }
            
            print_error("%: invalid option '%'.\nTry '% --help' for more information.", args[0], args[it], args[0]);
            exit(1);
        }
        
        if is_exit_requested {
            exit(0);
        }
    }
    
    if (load_database(*database, db_file_path) == false) {
        print_error("Failed to load database.");
        exit(1);
    }
    
    initialize_tui();
    
    db := *database;
    layout := *layouts[Layouts.COMPACT];
    
    //flushinp(); TODO DAM
    TIO.tui_ungetch(KEY_RESIZE); // TODO DAM
    while (true) {
        
        if (is_terminal_too_small) {
            INVALID_WINDOW_MESSAGE :: "Terminal is too small: minimum 60x3.";
            //mvaddstr(size_y / 2, (size_x - xx INVALID_WINDOW_MESSAGE.count) / 2, INVALID_WINDOW_MESSAGE); TODO DAM
        }
        else {
            draw_tui(db, layout);
            draw_error_window();
        }
        
        reset_temporary_storage();
        //timeout(INPUT_TIMEOUT_MS); TODO DAM
        key := TIO.tui_getch(); // getch(); TODO DAM
        if key == #char "q" || key == #char "Q" break;
        update_times(*database);
        //timeout(INPUT_AWAIT_INF); TODO DAM

        // TODO WIP Remove `selected_task` and `active_task` and helper functions.
        selected_task   := get_selected_task(db);
        active_task     := get_active_task(db);
        action_style: s32;
        error_style: s32;
        selected_task_row: int;
        { // TODO Recheck this code.
            using db;
            action_style        = A_BOLD | COLOR_PAIR(xx 
                                    ifx selected_idx == active_idx && selected_idx != -1 then Styles.ACTIVE
                                    else Styles.SELECTED_INVERTED);
            error_style         = A_BOLD | COLOR_PAIR(xx Styles.ERROR);
            selected_task_row   = ifx is_terminal_too_small then 0 
                                    else ifx (selected_idx < 0) then 1
                                else (selected_idx % layout_tasks_rows) + NUM_HEADER_ROWS;
        }
        if key == {
            
            // When getch() times out.
            case .READ_ERROR;
                if (is_autosave_enabled && countdown_to_autosave > 0) {
                    countdown_to_autosave -= INPUT_TIMEOUT_MS;
                    if (countdown_to_autosave <= 0) {
                        show_processing();
                        if (db == *archive) {
                            export_to_csv(*archive, ar_file_path);
                        }
                        store_database(database, db_file_path);
                    }
                }
            
            // When terminal is resized.
            case KEY_RESIZE;
                TIO.tui_clear_screen();
                //getmaxyx(stdscr, *size_y, *size_x);
                TIO.update_terminal_size(); // TODO DAM
                size_x = TIO.terminal_state.width;
                size_y = TIO.terminal_state.height;
                print("resize:%x%", size_x, size_y);
                asd := TIO.tui_getch();
                is_terminal_too_small = size_x < 60 || size_y < 3;
                update_layout();
                layout = *layouts[ifx size_x > 100 then Layouts.NORMAL else Layouts.COMPACT];
            
            case #char "i"; #through;
            case #char "I";
                if (db.tasks.count <= 1) continue;
                
                count := db.tasks.count-1;
                task: Task;
                for 0..count/2 {
                    task = db.tasks[it];
                    db.tasks[it] = db.tasks[count-it];
                    db.tasks[count-it] = task;
                }
                if db.active_idx >= 0
                    db.active_idx = count - db.active_idx;
                trigger_autosave();
                
            case #char "n"; #through;
            case #char "N";
                if is_database_full(db) {
                    read_enter_confirmation(selected_task_row, error_style, " Unable to create task: database is full. ");
                    continue;
                }
                
                // Create new task.
                now_utc := current_time_consensus();
                now_local := to_calendar(now_utc, .LOCAL);
                name := calendar_to_iso_string(now_local);
                task, index := add_task(db);
                memcpy(task.name.data, name.data, min(Task.name.count, name.count));
                
                // Select new task.
                select_task(db, index);
                selected_task = get_selected_task(db);
                trigger_autosave();
                
                // Force rename action.
                //flushinp(); TODO DAM
                //ungetch(KEY_F(2)); TODO DAM

            case KEY_F2;
                if (selected_task == null) continue;
                
                // Change task name.
                input := read_input_string_padded(selected_task_row, 1, action_style, Task.name.count, size_x - 2);
                if is_empty_string(input) == false {
                    replace_chars(input, "\t\x0B\x0C\r", #char " ");
                    memcpy(selected_task.name.data, input.data, min(Task.name.count, input.count));
                    trigger_autosave();
                }
            
            case KEY_BACKSPACE;
                if (selected_task == null) continue;
                
                if (read_enter_confirmation(selected_task_row, action_style, " Press enter to reset task. ") == true) {
                    reset_task_times(db, db.selected_idx);
                    trigger_autosave();
                }
            
            case KEY_DC; // Delete
                if (selected_task == null || selected_task == active_task) continue;
                
                if (read_enter_confirmation(selected_task_row, action_style, " Press enter to delete task. ") == true) {
                    delete_task(db, db.selected_idx);
                    trigger_autosave();
                }

            case #char "1"; #through;
            case #char "2"; #through;
            case #char "3"; #through;
            case #char "4"; #through;
            case #char "5"; #through;
            case #char "6"; #through;
            case #char "7";
                if (selected_task == null) continue;
                
                // Prepare position to input time operation.
                selected_day := cast(int)(key - #char "1"); // TODO DAM this cast...
                input_width := layout.columns[L_DAYS_IDX + selected_day].width;
                input_pos_x := 1 + layout.columns[L_TITLE_IDX].width;
                
                for 0..selected_day-1 {
                    input_pos_x += 1 + layout.columns[L_DAYS_IDX + it].width;
                }
                input_pos_x += 1;
                
                // Get input string.
                input := read_input_string(selected_task_row, input_pos_x, action_style, input_width); // TODO Temp stringzes.
                
                // Abort if input if empty.
                if is_empty_string(input) continue;
                
                // Search for assign '=' operator and discard everything before it.
                assign_idx := find_index_from_left(input, "=");
                is_assign := assign_idx >= 0;
                if is_assign advance(*input, assign_idx + 1);
                
                // Try to parse a number and abort if it fails.
                input_float, parse_success := string_to_float64(input);
                if parse_success == false continue;
                
                // Try to parse a character representing the time multiplier.
                multiplier: float64 = 1.0;
                for 0..input.count-1 {
                    ch := to_lower(input[it]);
                    if ch == {
                        case #char "m"; multiplier = xx SECONDS_IN_MINUTE;
                        case #char "h"; multiplier = xx SECONDS_IN_HOUR;
                        case #char "d"; multiplier = xx SECONDS_IN_DAY;
                        case #char "y"; multiplier = xx SECONDS_IN_YEAR;
                    }
                }
                
                // Process input and check if it's valid.
                input_time := input_float * multiplier;
                if (input_time > xx S64_MAX || input_time < xx S64_MIN) continue;
                
                // Apply changes.
                time := cast(s64)input_time;
                day := (selected_day + FIRST_DAY_OF_WEEK) % NUM_WEEK_DAYS;
                if is_assign set_task_time(db, db.selected_idx, day, time);
                else add_task_time(db, db.selected_idx, day, time);
                
                trigger_autosave();

            case #char "m"; #through;
            case #char "M";
                if selected_task == null continue;
                
                value, success := read_input_int(selected_task_row, action_style, " Move to: ");
                if success == false continue;
                move_task(db, db.selected_idx, value-1); // -1 to adjust for zero based index
                trigger_autosave();

            case #char "g"; #through;
            case #char "G";
                if selected_task == null continue;
                
                value, success := read_input_int(selected_task_row, action_style, " Go to: ");
                if success == false continue;
                target_index := clamp(value, 1, MAX_DATABASE_TASKS) - 1;
                select_task(db, target_index);
            
            case #char "d"; #through;
            case #char "D";
                if selected_task == null continue;
                
                if is_database_full(db) {
                    read_enter_confirmation(selected_task_row, error_style, " Unable to duplicate task: database is full. ");
                    continue;
                }
                
                if (add_task(db, selected_task) == null) {
                    print_error("Failed to duplicate task.");
                    continue;
                }
                trigger_autosave();

            case KEY_F5;
                update_total_times(db);
                trigger_autosave();
            
            case #char "t"; #through;
            case #char "T";
                if (active_task == null) continue;
                select_task(db, db.active_idx);
            
            case #char "\n"; #through;
            case #char " ";
                if (db != *database || selected_task == null) continue;
                set_active_task(db, ifx db.active_idx == db.selected_idx then -1 else db.selected_idx);
                active_task = get_active_task(db);
                trigger_autosave();
            
            case #char "\t";
                if (db == *database) {
                    if (import_from_csv(*archive, ar_file_path) == false) {
                        reset_database(*archive);
                        print_error("Failed to load archive.");
                        continue;
                    }
                    db = *archive;
                }
                else {
                    if (export_to_csv(*archive, ar_file_path) == false) {
                        print_error("Failed to store archive.");
                        continue;
                    }
                    reset_database(*archive);
                    db = *database;
                }

            case #char "a"; #through;
            case #char "A";
                if (db != *database || selected_task == null || selected_task == active_task) continue;
                
                if (append_to_csv(selected_task, ar_file_path) == false) {
                    print_error("Failed to archive task.");
                    continue;
                }
                delete_task(db, db.selected_idx);
                trigger_autosave();

            // Restore archived task.
            case #char "r"; #through;
            case #char "R";
                if (db != *archive || selected_task == null) continue;
                
                if is_database_full(*database) {
                    read_enter_confirmation(selected_task_row, error_style, " Unable to restore task: database is full. ");
                    continue;
                }
                
                if (add_task(*database, selected_task) == null) {
                    print_error("Failed to restore task.");
                    continue;
                }
                delete_task(db, db.selected_idx);
                trigger_autosave();
            
            // Sort by.
            case #char "s"; #through;
            case #char "S";
                // TODO The initial part should only decide what's the sorting procedure... then we would would all in a single place.
                sort_by := read_input_char(selected_task_row, action_style, " Sort by (n) name, (1..7) day, or (t) total time. ");
                show_processing();
                
                sort_procedure: (a: Task, b: Task) -> s64;
                active_task: Task = ifx db.active_idx >= 0 then db.tasks[db.active_idx] else .{};
                if sort_by == {
                    case #char "n"; #through;
                    case #char "N";
                        sort_procedure = (x, y) => compare_strings(xx x.name, xx y.name);
                        
                    case #char "t"; #through;
                    case #char "T";
                        sum_total :: inline (t: Task) -> s64 { total: s64; for t.times { total = add(total, it); } return total; }
                        sort_procedure = (x, y) => sum_total(x) - sum_total(y);
                        
                    case #char "1"; #through;
                    case #char "2"; #through;
                    case #char "3"; #through;
                    case #char "4"; #through;
                    case #char "5"; #through;
                    case #char "6"; #through;
                    case #char "7";
                        sort_by_idx := sort_by - #char "1";
                        day := (sort_by_idx + FIRST_DAY_OF_WEEK) % NUM_WEEK_DAYS;
                        if day == {
                            case 0; sort_procedure = (x, y) => x.times[0] - y.times[0];
                            case 1; sort_procedure = (x, y) => x.times[1] - y.times[1];
                            case 2; sort_procedure = (x, y) => x.times[2] - y.times[2];
                            case 3; sort_procedure = (x, y) => x.times[3] - y.times[3];
                            case 4; sort_procedure = (x, y) => x.times[4] - y.times[4];
                            case 5; sort_procedure = (x, y) => x.times[5] - y.times[5];
                            case 6; sort_procedure = (x, y) => x.times[6] - y.times[6];
                        }

                    case;
                        continue;
                }
                quick_sort(db.tasks, sort_procedure);
                
                if db.active_idx >= 0 {
                    db.active_idx = find_similar_task(db, active_task);
                }
                trigger_autosave();

            // Workspace cleanup.
            case #char "w"; #through;
            case #char "W";
                if (db != *database || db.tasks.count <= 0) continue;
                if (read_enter_confirmation(selected_task_row, action_style, " Press enter to archive duplicates and reset all. ") == false) continue;
                show_processing();
                                
                for db.tasks {
                    if (append_to_csv(it, ar_file_path) == false) {
                        print_error("Failed to archive task."); // TODO Improve this.
                    }
                    reset_task_times(db, it_index);
                }
                trigger_autosave();

            // Coalesce similar tasks.
            case #char "c"; #through;
            case #char "C";
                if (db.tasks.count <= 0) continue;
                if (read_enter_confirmation(selected_task_row, action_style, " Press enter to coalesce similar tasks. ") == false) continue;
                show_processing();
                
                head_idx := 0;
                while head_idx < db.tasks.count - 1 {
                    tail_idx := db.tasks.count - 1;
                    while tail_idx > head_idx {
                        t_head := *db.tasks[head_idx];
                        t_tail := *db.tasks[tail_idx];
                        if compare(xx t_head.name, xx t_tail.name) == 0 {
                            add_task_times(db, head_idx, db.tasks[tail_idx].times);
                            delete_task(db, tail_idx);
                        }
                        tail_idx -= 1;
                    }
                    head_idx += 1;
                }
                trigger_autosave();
            
            case KEY_HOME;
                select_task(db, 0);
              
            case KEY_UP;
                select_task_by_delta(db, -1);

            case KEY_PPAGE;
                select_task_by_delta(db, -layout_tasks_rows);
            
            case KEY_END;
                select_task(db, db.tasks.count-1);
            
            case KEY_DOWN;
                select_task_by_delta(db, 1);
            
            case KEY_NPAGE;
                select_task_by_delta(db, layout_tasks_rows);
        }
    }
    
    // Save any unsaved changes.
    show_processing();
    error_saving := false;
    if (db == *archive) {
        if (export_to_csv(archive, ar_file_path) == false) {
            print_error("Failed to save archive.");
            error_saving |= true;
        }
    }
    if (countdown_to_autosave > 0 || is_autosave_enabled == false) {
        if (store_database(database, db_file_path) == false) {
            print_error("Failed to save database.");
            error_saving |= true;
        }
    }
    if (error_saving) {
        print_error("Press any key to close.");
        draw_error_window();
        //timeout(INPUT_AWAIT_INF); TODO DAM
        //getch(); TODO DAM
    }
    
    TIO.terminate(); // TODO DAM
    
    exit(xx ifx error_saving then 1 else 0);
}