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 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150
|
/* listedit.c
* (c) 2002 Petr 'Brain' Kulhavy
* This file is a part of the Links program, released under GPL.
*/
#include "links.h"
/*
(#####)
(#########)
)))) (######)
,C--O (###) _________________
|`:, \ ~~ |. , v , .|
`-__o ~~ ; | ZAKAZ KOURENI |
/ _ \ ` |. .|
| ( \__`_=k== `~~~~~~~~~~~~~~~~~'
| `-/__---'
|=====C/
`. ),'
\ /
||_|
|| |__
||____)
v v v , ,v
KONECNE NEJAKE KOMENTARE...
*/
/* Klikani myssi (nebo mysijou, jak rika Mikulas) v list-okne:
* (hrozne dulezity komentar ;-P )
*
* Klikani je vyreseno nasledovne, pokud ma nekdo lepsi napad, nebo nejake
* vyhrady, tak at mi je posle.
*
* Prostredni tlacitko+pohyb je scroll nahoru/dolu. Levym tlacitkem se nastavi
* kurzor (cerna lista) na konkretni polozku. Kdyz se levym klikne na adresar
* (na ty graficke nesmysly, ne na ten text), tak se adresar toggle
* otevre/zavre. Prave tlacitko oznaci/odznaci polozku/adresar.
*/
/* Premistovani polozek:
*
* Pravym tlacitkem se oznaci/odznaci polozka. Cudlikem "Odznacit vse" se
* vsechny polozky odznaci. Cudlik "Prestehovat" presune vsechny oznacene
* polozky za aktualni pozici, v tom poradi, jak jsou v seznamu. Pri zavreni
* adresare se vsechny polozky v adresari odznaci.
*/
/* Prekreslovani grafickych nesmyslu v okenku je samozrejme bez jedineho
* v
* bliknuti. Ne jako nejmenovane browsery... Proste obraz jako BIC (TM)
*/
/* Ovladani klavesnici:
* sipky, page up, page down, home end pohyb
* + otevri adresar
* - zavri adresar
* mezera toggle adresar
* ins, *, 8, i toggle oznacit
* ?, /, N, n hledani nahoru, dolu, znova, znova na druhou stranu
*/
/*
* Struktura struct list_decription obsahuje popis seznamu. Tenhle file
* obsahuje obecne funkce k obsluze seznamu. Pomoci struct list_description se
* seznam customizuje. Obecne funkce volaji funkce z list_description.
*
* Jedina funkce z tohoto filu, ktera se vola zvenku, je create_list_window. Ta
* vyrobi a obstarava okno pro obsluhu seznamu.
*
* Obecny list neresi veci jako nahravani seznamu z filu, ukladani na disk
* atd.(tyhle funkce si uzivatel musi napsat sam). Resi vlastne jenom to velke
* okno na manipulaci se seznamem.
*/
/*
* Aby bylo konzistentni pridavani a editovani polozek, tak se musi pytlacit.
*
* To znamena, ze pri pridavani polozky do listu se vyrobi nova polozka
* (NEPRIDA se do seznamu), pusti se edit a po zmacknuti OK se polozka prida do
* seznamu. Pri zmacknuti cancel, se polozka smaze.
*
* Pri editovani polozky se vyrobi nova polozka, zkopiruje se do ni obsah te
* puvodni (od toho tam je funkce copy_item), pak se zavola edit a podobne jako
* v predchozim pripade: pri cancel se polozka smaze, pri OK se zkopiruje do
* puvodni polozky a smaze se taky.
*
* O smazani polozky pri cancelu se bude starat uzivatelska funkce edit_item
* sama. Funkce edit_item po zmacknuti OK zavola funkci, kterou dostane. Jako
* 1. argument ji da data, ktera dostane, jako 2. argument ji preda pointer na
* item.
*/
/*
* Seznam je definovan ve struct list. Muze byt bud placaty nebo stromovy.
*
* K placatemu asi neni co dodat. U placateho se ignoruje hloubka a neexistuji
* adresare - vsechny polozky jsou si rovny (typ polozky se ignoruje).
*
* Stromovy seznam:
* Kazdy clen seznamu ma flag sbaleno/rozbaleno. U itemy se to ignoruje, u
* adresare to znamena, zda se zobrazuje obsah nebo ne. Aby rozbaleno/sbaleno
* bylo u vsech prvku adresare, to by neslo: kdybych mel adresar a v nem dalsi
* adresar, tak bych u toho vnoreneho adresare nevedel, jestli to
* sbaleno/rozbaleno je od toho vnoreneho adresare, nebo od toho nad nim.
*
* Clenove seznamu maji hloubku - cislo od 0 vyse. Cim je prvek hloubeji ve
* strukture, tim je hloubka vyssi. Obsah adresare s hloubkou x je souvisly blok
* nasledujicich prvku s hloubkou >x.
*
* Hlava ma hloubku -1 a zobrazuje se taky jako clen seznamu (aby se dal
* zobrazit prazdny seznam a dalo se do nej pridavat), takze se da vlastne cely
* seznam zabalit/rozbalit. Hlava sice nema data, ale funkce type_item ji musi
* umet zobrazit. Jako popis bude psat fixni text, napriklad "Bookmarks".
*
* Pro urychleni vykreslovani kazdy prvek v seznamu s adresarema obsahuje
* pointer na otce (polozka fotr). U plocheho seznamu se tento pointer
* ignoruje.
*
* Strukturu stromu bude vykreslovat obecna funkce (v tomto filu), protoze v
* obecnem listu je struktura uz zachycena.
*/
/*
* V hlavnim okne se da nadefinovat 1 uzivatelske tlacitko. Polozka button ve
* struct list_description obsahuje popisku tlacitka (kod stringu v
* prekodovavacich tabulkach). Funkce button_fn je zavolana pri stisku
* tlacitka, jako argument (void *) dostane aktualni polozku. Pokud je
* button_fn NULL, tlacitko se nekona.
*
* Toto tlacitko se da vyuzit napriklad u bookmarku, kde je potreba [ Goto ].
*
* Kdyz bude potreba predavat obsluzne funkci tlacitka nejake dalsi argumenty,
* tak se pripadne definice obsluzne funkce prepise.
*
* Tlacitko funguje jen na polozky. Nefunguje na adresare (pokud se jedna o
* stromovy list) ani na hlavu.
*/
/* Jak funguje default_value:
* kdyz se zmackne tlacitko add, zavola se funkce default_value, ktera si
* naalokuje nejaky data pro new_item. Do funkce default_value se treba u
* bookmarku umisti okopirovani altualniho nazvu a url stranky. Pak se zavola
* new_item, ktera si prislusne hodnoty dekoduje a pomoci nich vyplni novou
* polozku. Funkce new_item pak MUSI data dealokovat. Pokud funkce new_item
* dostane misto pointeru s daty NULL, vyrobi prazdnou polozku.
*
* Default value musi vratit hodnoty v kodovani uvedenem v list_description
*/
/* Pristupovani z vice linksu:
*
* ... se neresi - je zakazano. K tomu slouzi polozka open ve struct
* list_description, ktera rika, jestli je okno uz otevrene, nebo ne.
*/
/* Prekodovavani znakovych sad:
*
* type_item vraci text prekodovany do kodovani terminalu, ktery dostane.
*/
/* struct list *current_pos; current cursor position in the list */
/* struct list *win_offset; item at the top of the window */
/* int win_pos; current y position in the window */
#define BOHNICE "+420-2-84016111"
#define BFU_ELEMENT_PIPE 0
#define BFU_ELEMENT_TEE 1
#define BFU_ELEMENT_CLOSED 2
#define BFU_ELEMENT_OPEN 3
/* for mouse scrolling */
long last_mouse_y;
#ifdef G
#define sirka_scrollovadla (G_SCROLL_BAR_WIDTH<<1)
#else
#define sirka_scrollovadla 0
#endif
/* prototypes */
int draw_bfu_element(struct terminal *, int, int, unsigned, long, long, unsigned char, unsigned char);
struct list *next_in_tree(struct list_description *, struct list *);
struct list *prev_in_tree(struct list_description *, struct list *);
void list_insert_behind_item(struct dialog_data *, void *, void *, struct list_description *);
void list_copy_item(struct dialog_data *, void *, void *, struct list_description *);
int list_item_add(struct dialog_data *, struct dialog_item_data *);
int list_folder_add(struct dialog_data *, struct dialog_item_data *);
int list_item_edit(struct dialog_data *, struct dialog_item_data *);
int list_item_move(struct dialog_data *, struct dialog_item_data *);
int list_item_unselect(struct dialog_data *, struct dialog_item_data *);
int list_item_button(struct dialog_data *, struct dialog_item_data *);
int is_empty_dir(struct list_description *, struct list *);
int list_item_delete(struct dialog_data *, struct dialog_item_data *);
void redraw_list_line(struct terminal *, void *);
void scroll_list(struct terminal *, void *);
int list_event_handler(struct dialog_data *, struct event *);
void create_list_window_fn(struct dialog_data *);
void close_list_window(struct dialog_data *);
/* This function uses these defines from setup.h:
*
* BFU_GRX_WIDTH
* BFU_GRX_HEIGHT
* BFU_ELEMENT_WIDTH
*/
/* draws one of BFU elements: | |- [-] [+] */
/* BFU elements are used in the list window */
/* this function also defines shape and size of the elements */
/* returns width of the BFU element (all elements have the same size, but sizes differ if we're in text mode or in graphics mode) */
int draw_bfu_element(struct terminal * term, int x, int y, unsigned c, long b, long f, unsigned char type, unsigned char selected)
{
if (!F){
unsigned char vertical=179;
unsigned char horizontal=196;
unsigned char tee=195;
switch (type)
{
case BFU_ELEMENT_PIPE:
c|=ATTR_FRAME;
set_char(term,x,y,' ',c);
set_char(term,x+1,y,vertical,c);
set_char(term,x+2,y,' ',c);
set_char(term,x+3,y,' ',c);
set_char(term,x+4,y,' ',c);
break;
case BFU_ELEMENT_TEE:
c|=ATTR_FRAME;
set_char(term,x,y,' ',c);
set_char(term,x+1,y,tee,c);
set_char(term,x+2,y,horizontal,c);
set_char(term,x+3,y,horizontal,c);
set_char(term,x+4,y,' ',c);
break;
case BFU_ELEMENT_CLOSED:
set_char(term,x,y,'[',c);
set_char(term,x+1,y,'+',c);
set_char(term,x+2,y,']',c);
c|=ATTR_FRAME;
set_char(term,x+3,y,horizontal,c);
set_char(term,x+4,y,' ',c);
break;
case BFU_ELEMENT_OPEN:
set_char(term,x,y,'[',c);
set_char(term,x+1,y,'-',c);
set_char(term,x+2,y,']',c);
c|=ATTR_FRAME;
set_char(term,x+3,y,horizontal,c);
set_char(term,x+4,y,' ',c);
break;
default:
internal("draw_bfu_element: unknown BFU element type %d.\n",type);
}
if (selected)set_char(term,x+4,y,'*',c);
return BFU_ELEMENT_WIDTH; /* BFU element size in text mode */
#ifdef G
}else{
struct graphics_device *dev=term->dev;
struct rect r;
restrict_clip_area(dev,&r,x,y,x+5*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT);
switch (type)
{
case BFU_ELEMENT_PIPE:
/* pipe */
drv->draw_vline(dev,x+1*BFU_GRX_WIDTH,y,y+BFU_GRX_HEIGHT,f);
drv->draw_vline(dev,x+1+1*BFU_GRX_WIDTH,y,y+BFU_GRX_HEIGHT,f);
/* clear the rest */
drv->fill_area(dev,x,y,x+1*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+2+1*BFU_GRX_WIDTH,y,x+4*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT,b);
break;
case BFU_ELEMENT_TEE:
/* tee */
drv->draw_vline(dev,x+1*BFU_GRX_WIDTH,y,y+BFU_GRX_HEIGHT,f);
drv->draw_vline(dev,x+1+1*BFU_GRX_WIDTH,y,y+BFU_GRX_HEIGHT,f);
drv->draw_hline(dev,x+1*BFU_GRX_WIDTH,y+.5*BFU_GRX_HEIGHT,x+1+3.5*BFU_GRX_WIDTH,f);
drv->draw_hline(dev,x+1*BFU_GRX_WIDTH,y-1+.5*BFU_GRX_HEIGHT,x+1+3.5*BFU_GRX_WIDTH,f);
/* clear the rest */
drv->fill_area(dev,x,y,x+1*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+2+BFU_GRX_WIDTH,y+.5*BFU_GRX_HEIGHT+1,x+1+3.5*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+2+BFU_GRX_WIDTH,y,x+1+3.5*BFU_GRX_WIDTH,y-1+.5*BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+1+3.5*BFU_GRX_WIDTH,y,x+4*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT,b);
break;
case BFU_ELEMENT_CLOSED:
/* vertical line of the + */
drv->draw_vline(dev,x+1*BFU_GRX_WIDTH,y+1+.25*BFU_GRX_HEIGHT,y-1+.75*BFU_GRX_HEIGHT,f);
drv->draw_vline(dev,x+1+1*BFU_GRX_WIDTH,y+1+.25*BFU_GRX_HEIGHT,y-1+.75*BFU_GRX_HEIGHT,f);
/* clear around the + */
drv->fill_area(dev,x+2+.5*BFU_GRX_WIDTH,y+3,x+1.5*BFU_GRX_WIDTH,y+1+.25*BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+2+.5*BFU_GRX_WIDTH,y-1+.75*BFU_GRX_HEIGHT,x+1.5*BFU_GRX_WIDTH,y-3+BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+2+.5*BFU_GRX_WIDTH,y+1+.25*BFU_GRX_HEIGHT,x+BFU_GRX_WIDTH,y-1+.5*BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+2+BFU_GRX_WIDTH,y+1+.25*BFU_GRX_HEIGHT,x+1.5*BFU_GRX_WIDTH,y-1+.5*BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+2+.5*BFU_GRX_WIDTH,y+1+.5*BFU_GRX_HEIGHT,x+BFU_GRX_WIDTH,y-3+BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+2+BFU_GRX_WIDTH,y+1+.5*BFU_GRX_HEIGHT,x+1.5*BFU_GRX_WIDTH,y-3+BFU_GRX_HEIGHT,b);
case BFU_ELEMENT_OPEN:
/* box */
drv->draw_vline(dev,x+2,y+1,y-1+BFU_GRX_HEIGHT,f);
drv->draw_vline(dev,x+3,y+1,y-1+BFU_GRX_HEIGHT,f);
drv->draw_vline(dev,x-1+2*BFU_GRX_WIDTH,y+1,y-1+BFU_GRX_HEIGHT,f);
drv->draw_vline(dev,x-2+2*BFU_GRX_WIDTH,y+1,y-1+BFU_GRX_HEIGHT,f);
drv->draw_hline(dev,x+4,y+1,x-2+2*BFU_GRX_WIDTH,f);
drv->draw_hline(dev,x+4,y+2,x-2+2*BFU_GRX_WIDTH,f);
drv->draw_hline(dev,x+4,y-2+BFU_GRX_HEIGHT,x-2+2*BFU_GRX_WIDTH,f);
drv->draw_hline(dev,x+4,y-3+BFU_GRX_HEIGHT,x-2+2*BFU_GRX_WIDTH,f);
/* horizontal line of the - */
drv->draw_hline(dev,x+2+.5*BFU_GRX_WIDTH,y+.5*BFU_GRX_HEIGHT,x+1.5*BFU_GRX_WIDTH,f);
drv->draw_hline(dev,x+2+.5*BFU_GRX_WIDTH,y-1+.5*BFU_GRX_HEIGHT,x+1.5*BFU_GRX_WIDTH,f);
/* line to title */
drv->draw_hline(dev,x+2*BFU_GRX_WIDTH,y+(BFU_GRX_HEIGHT>>1),x+1+3.5*BFU_GRX_WIDTH,f);
drv->draw_hline(dev,x+2*BFU_GRX_WIDTH,y-1+(BFU_GRX_HEIGHT>>1),x+1+3.5*BFU_GRX_WIDTH,f);
/* top and bottom short vertical line */
drv->draw_hline(dev,x+1*BFU_GRX_WIDTH,y,x+2+1*BFU_GRX_WIDTH,f);
drv->draw_hline(dev,x+1*BFU_GRX_WIDTH,y-1+BFU_GRX_HEIGHT,x+2+1*BFU_GRX_WIDTH,f);
/* clear the rest */
drv->draw_vline(dev,x,y,y+BFU_GRX_HEIGHT,b);
drv->draw_vline(dev,x+1,y,y+BFU_GRX_HEIGHT,b);
drv->draw_hline(dev,x+2,y,x+BFU_GRX_WIDTH,b);
drv->draw_hline(dev,x+2,y-1+BFU_GRX_HEIGHT,x+BFU_GRX_WIDTH,b);
drv->draw_hline(dev,x+2+BFU_GRX_WIDTH,y,x+2*BFU_GRX_WIDTH,b);
drv->draw_hline(dev,x+2+BFU_GRX_WIDTH,y-1+BFU_GRX_HEIGHT,x+2*BFU_GRX_WIDTH,b);
drv->fill_area(dev,x+2*BFU_GRX_WIDTH,y,x+1+3.5*BFU_GRX_WIDTH,y+.5*BFU_GRX_HEIGHT-1,b);
drv->fill_area(dev,x+2*BFU_GRX_WIDTH,y+1+.5*BFU_GRX_HEIGHT,x+1+3.5*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+4,y+3,x+2+.5*BFU_GRX_WIDTH,y-3+BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+1.5*BFU_GRX_WIDTH,y+3,x-2+2*BFU_GRX_WIDTH,y-3+BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+2+.5*BFU_GRX_WIDTH,y+3,x+1.5*BFU_GRX_WIDTH,y+1+.25*BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+2+.5*BFU_GRX_WIDTH,y-1+.75*BFU_GRX_HEIGHT,x+1.5*BFU_GRX_WIDTH,y-3+BFU_GRX_HEIGHT,b);
if (type==BFU_ELEMENT_OPEN)
{
drv->fill_area(dev,x+2+.5*BFU_GRX_WIDTH,y+3,x+1.5*BFU_GRX_WIDTH,y-1+.5*BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+2+.5*BFU_GRX_WIDTH,y+1+.5*BFU_GRX_HEIGHT,x+1.5*BFU_GRX_WIDTH,y-3+BFU_GRX_HEIGHT,b);
}
drv->fill_area(dev,x+1+3.5*BFU_GRX_WIDTH,y,x+4*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT,b);
break;
default:
internal("draw_bfu_element: unknown BFU element type %d.\n",type);
}
if (!selected)
drv->fill_area(dev,x+4*BFU_GRX_WIDTH,y,x+5*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT,b);
else
{
drv->fill_area(dev,x+4*BFU_GRX_WIDTH,y,x+4.25*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+4.25*BFU_GRX_WIDTH,y,x+4.75*BFU_GRX_WIDTH,y+2.5*BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+4.25*BFU_GRX_WIDTH,y+.25*BFU_GRX_HEIGHT,x+4.75*BFU_GRX_WIDTH,y+.75*BFU_GRX_HEIGHT,f);
drv->fill_area(dev,x+4.25*BFU_GRX_WIDTH,y+.75*BFU_GRX_HEIGHT,x+4.75*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT,b);
drv->fill_area(dev,x+4.75*BFU_GRX_WIDTH,y,x+5*BFU_GRX_WIDTH,y+BFU_GRX_HEIGHT,b);
}
drv->set_clip_area(dev, &r);
return BFU_ELEMENT_WIDTH;
#endif
}
}
/* aux structure for parameter exchange for redrawing list window */
struct redraw_data
{
struct list_description *ld;
struct dialog_data *dlg;
int n;
};
void redraw_list(struct terminal *term, void *bla);
void list_find_next(struct redraw_data *, int);
void list_search_for_back(struct redraw_data *, unsigned char *);
void list_search_for(struct redraw_data *, unsigned char *);
/* returns next visible item in tree list */
/* works only with visible items (head or any item returned by this function) */
/* when list is flat returns next item */
struct list *next_in_tree(struct list_description *ld, struct list *item)
{
int depth=item->depth;
/* flat list */
if (!(ld->type))return item->next;
if (!((item->type)&1)||((item->type)&2)) /* item or opened folder */
return item->next;
/* skip content of this folder */
do item=item->next; while (item->depth>depth); /* must stop on head 'cause it's depth is -1 */
return item;
}
/* returns previous visible item in tree list */
/* works only with visible items (head or any item returned by this function) */
/* when list is flat returns previous item */
struct list *prev_in_tree(struct list_description *ld, struct list *item)
{
struct list *last_closed;
int depth=item->depth;
/* flat list */
if (!(ld->type))return item->prev;
if (item==ld->list)depth=0;
/* items with same or lower depth must be visible, because current item is visible */
if ((((struct list*)(item->prev))->depth)<=(item->depth))return item->prev;
/* find item followed with opened fotr's only */
/* searched item is last closed folder (going up from item) or item->prev */
last_closed=item->prev;
item=item->prev;
while (1)
{
if (((item->type)&3)==1)/* closed folder */
last_closed=item;
if ((item->depth)<=depth)break;
item=item->fotr;
}
return last_closed;
}
#ifdef G
static int get_total_items(struct list_description *ld)
{
struct list*l=ld->list;
int count=0;
do{
l=next_in_tree(ld,l);
count++;
}while(l!=ld->list);
return count;
}
static int get_scroll_pos(struct list_description *ld)
{
struct list*l;
int count;
for (l=ld->list,count=0;l!=ld->win_offset;l=next_in_tree(ld,l),count++);
return count;
}
static int get_visible_items(struct list_description *ld)
{
struct list*l=ld->win_offset;
int count=0;
do{
l=next_in_tree(ld,l);
count++;
}while(count<ld->n_items&&l!=ld->list);
return count;
}
static struct list *find_last_in_window(struct list_description *ld)
{
struct list*l=ld->win_offset;
struct list *x=l;
int count=0;
do{
l=next_in_tree(ld,l);
count++;
if (l!=ld->list&&count!=ld->n_items)x=l;
}while(count<ld->n_items&&l!=ld->list);
return x;
}
#endif
static int get_win_pos(struct list_description *ld)
{
struct list*l;
int count;
for (l=ld->win_offset,count=0;l!=ld->current_pos;l=next_in_tree(ld,l),count++);
return count;
}
static void unselect_in_folder(struct list_description *ld, struct list *l)
{
int depth;
depth=l->depth;
for(l=l->next;l!=ld->list&&l->depth>depth;l=l->next)
l->type&=~4;
}
/* aux function for list_item_add */
void list_insert_behind_item(struct dialog_data *dlg, void *p, void *i, struct list_description *ld)
{
struct list *item=(struct list *)i;
struct list *pos=(struct list *)p;
struct list *a;
struct redraw_data rd;
/* BEFORE: ... <----> pos <--(possible invisible items)--> a <----> ... */
/* AFTER: ... <----> pos <--(possible invisible items)--> item <----> a <----> ... */
a=next_in_tree(ld,pos);
((struct list*)(a->prev))->next=item;
item->prev=a->prev;
item->next=a;
a->prev=item;
/* if list is flat a->fotr will contain nosenses, but it won't crash ;-) */
if (((pos->type)&3)==3||(pos->depth)==-1){item->fotr=pos;item->depth=pos->depth+1;} /* open directory or head */
else {item->fotr=pos->fotr;item->depth=pos->depth;}
ld->current_pos=next_in_tree(ld,ld->current_pos); /* ld->current_pos->next==item */
ld->win_pos++;
if (ld->win_pos>ld->n_items-1) /* scroll down */
{
ld->win_pos=ld->n_items-1;
ld->win_offset=next_in_tree(ld,ld->win_offset);
}
ld->modified=1;
rd.ld=ld;
rd.dlg=dlg;
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
}
/* aux function for list_item_edit */
/* copies data of src to dest and calls free on the src */
/* first argument is argument passed to user function */
void list_copy_item(struct dialog_data *dlg, void *d, void *s, struct list_description *ld)
{
struct list *src=(struct list *)s;
struct list *dest=(struct list *)d;
struct redraw_data rd;
dlg=dlg;
ld->copy_item(src,dest);
ld->delete_item(src);
ld->modified=1; /* called after an successful edit */
rd.ld=ld;
rd.dlg=dlg;
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
}
/* creates new item (calling new_item function) and calls edit_item function */
int list_item_add(struct dialog_data *dlg,struct dialog_item_data *useless)
{
struct list_description *ld=(struct list_description*)(dlg->dlg->udata2);
struct list *item=ld->current_pos;
struct list *new_item;
useless=useless;
if (!(new_item=ld->new_item(ld->default_value((struct session*)(dlg->dlg->udata),0))))return 1;
new_item->prev=0;
new_item->next=0;
new_item->type=0;
new_item->depth=0;
ld->edit_item(dlg,new_item,list_insert_behind_item,item,TITLE_ADD);
return 0;
}
/* like list_item_add but creates folder */
int list_folder_add(struct dialog_data *dlg,struct dialog_item_data *useless)
{
struct list_description *ld=(struct list_description*)(dlg->dlg->udata2);
struct list *item=ld->current_pos;
struct list *new_item;
useless=useless;
if (!(new_item=ld->new_item(NULL)))return 1;
new_item->prev=0;
new_item->next=0;
new_item->type=1;
new_item->depth=0;
ld->edit_item(dlg,new_item,list_insert_behind_item,item,TITLE_ADD);
return 0;
}
int list_item_edit(struct dialog_data *dlg,struct dialog_item_data *useless)
{
struct list_description *ld=(struct list_description*)(dlg->dlg->udata2);
struct list *item=ld->current_pos;
struct list *new_item;
useless=useless;
if (item==ld->list)return 0; /* head */
if (!(new_item=ld->new_item(NULL)))return 1;
new_item->prev=0;
new_item->next=0;
ld->copy_item(item,new_item);
ld->edit_item(dlg,new_item,list_copy_item,item,TITLE_EDIT);
return 0;
}
static inline int is_parent(struct list_description *ld, struct list *item, struct list *parent)
{
struct list *l;
if (ld->type)
for (l=item;l->depth>=0;l=l->fotr)
if (l==parent) return 1;
return 0;
}
int list_item_move(struct dialog_data *dlg,struct dialog_item_data *useless)
{
struct list_description *ld=(struct list_description*)(dlg->dlg->udata2);
struct list *i;
struct list *behind=ld->current_pos;
struct redraw_data rd;
int window_moved=0;
int count=0;
useless=useless;
if (ld->current_pos->type&4) /* odznacime current_pos, kdyby nahodou byla oznacena */
{
count++;
ld->current_pos->type&=~4;
}
for (i=ld->list->next;i!=ld->list;)
{
struct list *next=next_in_tree(ld,i);
struct list *prev=i->prev;
struct list *behind_next=next_in_tree(ld,behind); /* to se musi pocitat pokazdy, protoze by se nam mohlo stat, ze to je taky oznaceny */
struct list *item_last=next->prev; /* last item of moved block */
if (is_parent(ld, ld->current_pos, i)) /* we're moving directory into itself - let's behave like item was not selected */
{
i->type&=~4;
i=next;
count++;
continue;
}
if (!(i->type&4)){i=next;continue;}
if ((i->type&3)==3) /* dirty trick */
{
i->type&=~2;
next=next_in_tree(ld,i);
prev=i->prev;
item_last=next->prev;
i->type|=2;
}
if (i==ld->win_offset)
{
window_moved=1;
if (next!=ld->list)ld->win_offset=next;
}
/* upravime fotrisko a hloubku */
if (ld->type)
{
int a=i->depth;
struct list *l=i;
if (((behind->type)&3)==3||behind==ld->list)/* open folder or head */
{i->fotr=behind;i->depth=behind->depth+1;}
else {i->fotr=behind->fotr;i->depth=behind->depth;}
a=i->depth-a;
/* poopravime hloubku v adresari */
if (l!=item_last)
{
do{
l=l->next;
l->depth+=a;
} while(l!=item_last);
}
}
if (behind_next==i)goto predratovano; /* to uz je vsechno, akorat menime hloubku */
/* predratujeme ukazatele kolem bloku na stare pozici */
prev->next=next;
next->prev=prev;
/* posuneme na novou pozici (tesne pred behind_next) */
i->prev=behind_next->prev;
((struct list*)(behind_next->prev))->next=i;
item_last->next=behind_next;
behind_next->prev=item_last;
predratovano:
/* odznacime */
i->type&=~4;
unselect_in_folder(ld,i);
/* upravime pointery pro dalsi krok */
behind=i;
i=next;
count++;
}
if (window_moved)
{
ld->current_pos=ld->win_offset;
ld->win_pos=0;
}
else
ld->win_pos=get_win_pos(ld);
if (!count)
msg_box(
dlg->win->term, /* terminal */
NULL, /* blocks to free */
TEXT(T_MOVE), /* title */
AL_CENTER, /* alignment */
TEXT(T_NO_ITEMS_SELECTED), /* text */
NULL, /* data */
1, /* # of buttons */
TEXT(T_OK),NULL,B_ESC|B_ENTER /* button1 */
);
else
{
ld->modified=1;
rd.ld=ld;
rd.dlg=dlg;
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
}
return 0;
}
/* unselect all items */
int list_item_unselect(struct dialog_data *dlg,struct dialog_item_data *useless)
{
struct list_description *ld=(struct list_description*)(dlg->dlg->udata2);
struct list *item=ld->current_pos;
struct redraw_data rd;
useless=useless;
item=ld->list;
do{
item->type&=~4;
item=item->next;
}while(item!=ld->list);
rd.ld=ld;
rd.dlg=dlg;
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
return 0;
}
/* user button function - calls button_fn with current item */
int list_item_button(struct dialog_data *dlg, struct dialog_item_data *useless)
{
struct list_description *ld=(struct list_description*)(dlg->dlg->udata2);
struct list *item=ld->current_pos;
struct session *ses=(struct session *)(dlg->dlg->udata);
if (!(ld->button_fn))internal("Links got schizophrenia! Call "BOHNICE".\n");
if (item==(ld->list)||list_empty(*item))return 0; /* head or empty list */
if (ld->type&&((item->type)&1))return 0; /* this is tree list and item is directory */
ld->button_fn(ses,item);
cancel_dialog(dlg, useless);
return 0;
}
struct ve_skodarne_je_jeste_vetsi_narez
{
struct list_description* ld;
struct dialog_data *dlg;
struct list* item;
};
/* when delete is confirmed adjusts current_pos and calls delete function */
static void delete_ok(void * data)
{
struct list_description* ld=((struct ve_skodarne_je_jeste_vetsi_narez*)data)->ld;
struct list* item=((struct ve_skodarne_je_jeste_vetsi_narez*)data)->item;
struct dialog_data* dlg=((struct ve_skodarne_je_jeste_vetsi_narez*)data)->dlg;
struct redraw_data rd;
/* strong premise: we can't delete head of the list */
if (ld->current_pos->next!=ld->list) {
if (ld->current_pos == ld->win_offset) ld->win_offset = ld->current_pos->next;
ld->current_pos=ld->current_pos->next;
}
else /* last item */
{
if (!(ld->win_pos)) /* only one line on the screen */
ld->win_offset=prev_in_tree(ld,ld->win_offset);
else ld->win_pos--;
ld->current_pos=prev_in_tree(ld,ld->current_pos);
}
ld->delete_item(item);
rd.ld=ld;
rd.dlg=dlg;
rd.n=0;
ld->modified=1;
draw_to_window(dlg->win,redraw_list,&rd);
}
/* when delete folder is confirmed adjusts current_pos and calls delete function */
static void delete_folder_recursively(void * data)
{
struct list_description* ld=((struct ve_skodarne_je_jeste_vetsi_narez*)data)->ld;
struct list* item=((struct ve_skodarne_je_jeste_vetsi_narez*)data)->item;
struct dialog_data* dlg=((struct ve_skodarne_je_jeste_vetsi_narez*)data)->dlg;
struct redraw_data rd;
struct list *i,*j;
int depth;
for (i=item->next,depth=item->depth;i!=ld->list&&i->depth>depth;)
{
j=i;
i=i->next;
ld->delete_item(j);
}
/* strong premise: we can't delete head of the list */
if (ld->current_pos->next!=ld->list) {
if (ld->current_pos == ld->win_offset) ld->win_offset = ld->current_pos->next;
ld->current_pos=ld->current_pos->next;
}
else /* last item */
{
if (!(ld->win_pos)) /* only one line on the screen */
ld->win_offset=prev_in_tree(ld,ld->win_offset);
else ld->win_pos--;
ld->current_pos=prev_in_tree(ld,ld->current_pos);
}
ld->delete_item(item);
rd.ld=ld;
rd.dlg=dlg;
rd.n=0;
ld->modified=1;
draw_to_window(dlg->win,redraw_list,&rd);
}
/* tests if directory is emty */
int is_empty_dir(struct list_description *ld, struct list *dir)
{
if (!(ld->type))return 1; /* flat list */
if (!((dir->type)&1))return 1; /* not a directory */
return (((struct list *)(dir->next))->depth<=dir->depth); /* head depth is -1 */
}
/* delete dialog */
int list_item_delete(struct dialog_data *dlg,struct dialog_item_data *useless)
{
struct terminal *term=dlg->win->term;
struct list_description *ld=(struct list_description*)(dlg->dlg->udata2);
struct list *item=ld->current_pos;
/*struct session *ses=(struct session *)(dlg->dlg->udata);*/
unsigned char *txt;
struct ve_skodarne_je_jeste_vetsi_narez *narez;
useless=useless;
if (item==(ld->list)||list_empty(*item))return 0; /* head or empty list */
narez=mem_alloc(sizeof(struct ve_skodarne_je_jeste_vetsi_narez));
narez->ld=ld;narez->item=item;narez->dlg=dlg;
txt=ld->type_item(term, item,0);
if (!txt)
{
txt=mem_alloc(sizeof(unsigned char));
*txt=0;
}
if ((item->type)&1) /* folder */
{
if (!is_empty_dir(ld,item))
msg_box(
term, /* terminal */
getml(txt,narez,NULL), /* blocks to free */
TEXT(T_DELETE_FOLDER), /* title */
AL_CENTER|AL_EXTD_TEXT, /* alignment */
TEXT(T_FOLDER)," \"",txt,"\" ",TEXT(T_NOT_EMPTY_SURE_DELETE),NULL, /* text */
narez, /* data for ld->delete_item */
2, /* # of buttons */
TEXT(T_NO),NULL,B_ESC, /* button1 */
TEXT(T_YES),delete_folder_recursively,B_ENTER /* button2 */
);
else
msg_box(
term, /* terminal */
getml(txt,narez,NULL), /* blocks to free */
TEXT(T_DELETE_FOLDER), /* title */
AL_CENTER|AL_EXTD_TEXT, /* alignment */
TEXT(T_SURE_DELETE)," ",TEXT(T_fOLDER)," \"",txt,"\"?",NULL, /* null-terminated text */
narez, /* data for ld->delete_item */
2, /* # of buttons */
TEXT(T_YES),delete_ok,B_ENTER, /* button1 */
TEXT(T_NO),NULL,B_ESC /* button2 */
);
}
else /* item */
msg_box(
term, /* terminal */
getml(txt,narez,NULL), /* blocks to free */
TEXT(ld->delete_dialog_title), /* title */
AL_CENTER|AL_EXTD_TEXT, /* alignment */
TEXT(T_SURE_DELETE)," ",TEXT(ld->item_description)," \"",txt,"\"?",NULL, /* null-terminated text */
narez, /* data for ld->delete_item */
2, /* # of buttons */
TEXT(T_YES),delete_ok,B_ENTER, /* button1 */
TEXT(T_NO),NULL,B_ESC /* button2 */
);
return 0;
}
/* redraws list */
void redraw_list(struct terminal *term, void *bla)
{
struct redraw_data* rd=(struct redraw_data *)bla;
struct list_description *ld=rd->ld;
struct dialog_data *dlg=rd->dlg;
/*struct session *ses=(struct session*)(dlg->dlg->udata);*/
int y,a;
struct list *l;
int w=dlg->xw-2*DIALOG_LB-(F?sirka_scrollovadla:0);
y=dlg->y+DIALOG_TB;
#ifdef G
if (F)
{
int total=get_total_items(ld);
int visible=get_visible_items(ld);
int pos=get_scroll_pos(ld);
struct rect old_area;
restrict_clip_area(term->dev,&old_area,dlg->x+w+DIALOG_LB+G_SCROLL_BAR_WIDTH,y,dlg->x+DIALOG_LB+w+sirka_scrollovadla,y+G_BFU_FONT_SIZE*ld->n_items);
term->dev->drv->set_clip_area(term->dev,&old_area);
draw_vscroll_bar(term->dev,dlg->x+DIALOG_LB+w+G_SCROLL_BAR_WIDTH,y,G_BFU_FONT_SIZE*ld->n_items,total,visible,pos);
if (dlg->s)exclude_from_set(&(dlg->s),dlg->x+DIALOG_LB+w+G_SCROLL_BAR_WIDTH,y,dlg->x+DIALOG_LB+w+sirka_scrollovadla,y+G_BFU_FONT_SIZE*ld->n_items);
}
#endif
switch (ld->type)
{
case 0: /* flat */
for (a=0,l=ld->win_offset;a<ld->n_items;)
{
unsigned char *txt;
int x=0;
txt=ld->type_item(term, l,1);
if (!txt)
{
txt=mem_alloc(sizeof(unsigned char));
*txt=0;
}
/* everything except head */
if (!F)
{
unsigned color=(l==ld->current_pos)?COLOR_MENU_SELECTED:COLOR_MENU;
if (l!=ld->list)x+=draw_bfu_element(term,dlg->x+DIALOG_LB,y,color,0,0,BFU_ELEMENT_TEE,(l->type)&4);
print_text(term,dlg->x+x+DIALOG_LB,y,w-x,txt,color);
x+=strlen(txt);
fill_area(term,dlg->x+DIALOG_LB+x,y,w-x,1,' ',0);
set_line_color(term,dlg->x+DIALOG_LB+x,y,w-x,color);
}
#ifdef G
else
{
struct rect old_area;
long bgcolor=(l==ld->current_pos)?G_BFU_FG_COLOR:G_BFU_BG_COLOR;
long fgcolor=(l==ld->current_pos)?G_BFU_BG_COLOR:G_BFU_FG_COLOR;
struct style* stl=(l==ld->current_pos)?bfu_style_wb:bfu_style_bw;
bgcolor=dip_get_color_sRGB(bgcolor);
fgcolor=dip_get_color_sRGB(fgcolor);
if (l!=ld->list)x+=draw_bfu_element(term,dlg->x+DIALOG_LB,y,0,bgcolor,fgcolor,BFU_ELEMENT_TEE,(l->type)&4);
restrict_clip_area(term->dev,&old_area,dlg->x+x+DIALOG_LB,y,dlg->x+DIALOG_LB+w,y+G_BFU_FONT_SIZE);
g_print_text(term->dev->drv,term->dev,dlg->x+x+DIALOG_LB,y,stl,txt,0);
x+=g_text_width(stl,txt);
term->dev->drv->fill_area(term->dev,dlg->x+DIALOG_LB+x,y,dlg->x+DIALOG_LB+w,y+G_BFU_FONT_SIZE,bgcolor);
term->dev->drv->set_clip_area(term->dev,&old_area);
if (dlg->s)exclude_from_set(&(dlg->s),dlg->x+DIALOG_LB,y,dlg->x+DIALOG_LB+w,y+G_BFU_FONT_SIZE);
}
#endif
mem_free(txt);
l=l->next;
a++;
y+=gf_val(1,G_BFU_FONT_SIZE);
if (l==ld->list) break;
}
if (!F) fill_area(term,dlg->x+DIALOG_LB,y,w,ld->n_items-a,' ',COLOR_MENU);
#ifdef G
else
{
term->dev->drv->fill_area(term->dev,dlg->x+DIALOG_LB,y,dlg->x+DIALOG_LB+w,dlg->y+DIALOG_TB+(ld->n_items)*G_BFU_FONT_SIZE,dip_get_color_sRGB(G_BFU_BG_COLOR));
}
#endif
break;
case 1: /* tree */
for (a=0,l=ld->win_offset;a<ld->n_items;)
{
unsigned char *txt;
int b;
int x=0;
unsigned color=0;
long fgcolor=0;
long bgcolor=0;
int element=0;
if (!F){
color=(l==ld->current_pos)?COLOR_MENU_SELECTED:COLOR_MENU;
#ifdef G
}else{
bgcolor=(l==ld->current_pos)?G_BFU_FG_COLOR:G_BFU_BG_COLOR;
fgcolor=(l==ld->current_pos)?G_BFU_BG_COLOR:G_BFU_FG_COLOR;
bgcolor=dip_get_color_sRGB(bgcolor);
fgcolor=dip_get_color_sRGB(fgcolor);
#endif
};
txt=ld->type_item(term,l,1);
if (!txt)
{
txt=mem_alloc(sizeof(unsigned char));
*txt=0;
}
for (b=0;b<l->depth;b++)
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,color,bgcolor,fgcolor,BFU_ELEMENT_PIPE,0);
if (l->depth>=0) /* everything except head */
{
switch((l->type)&1)
{
case 0: /* item */
element=BFU_ELEMENT_TEE;
break;
case 1: /* directory */
element=((l->type)&2)?BFU_ELEMENT_OPEN:BFU_ELEMENT_CLOSED;
break;
default: /* this should never happen */
internal("=8-Q lunacy level too high! Call "BOHNICE".\n");
}
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,color,bgcolor,fgcolor,element,(l->type)&4);
}
if (!F)
{
print_text(term,dlg->x+x+DIALOG_LB,y,w-x,txt,color);
x+=strlen(txt);
fill_area(term,dlg->x+x+DIALOG_LB,y,w-x,1,' ',0);
set_line_color(term,dlg->x+x+DIALOG_LB,y,w-x,color);
}
#ifdef G
else
{
struct rect old_area;
restrict_clip_area(term->dev,&old_area,dlg->x+x+DIALOG_LB,y,dlg->x+DIALOG_LB+w,y+G_BFU_FONT_SIZE);
g_print_text(term->dev->drv,term->dev,dlg->x+x+DIALOG_LB,y,(l==ld->current_pos)?bfu_style_wb:bfu_style_bw,txt,0);
x+=g_text_width((l==ld->current_pos)?bfu_style_wb:bfu_style_bw,txt);
term->dev->drv->fill_area(term->dev,dlg->x+DIALOG_LB+x,y,dlg->x+DIALOG_LB+w,y+G_BFU_FONT_SIZE,bgcolor);
term->dev->drv->set_clip_area(term->dev,&old_area);
if (dlg->s)exclude_from_set(&(dlg->s),dlg->x+DIALOG_LB,y,dlg->x+DIALOG_LB+w,y+G_BFU_FONT_SIZE);
}
#endif
mem_free(txt);
l=next_in_tree(ld,l);
a++;
y+=gf_val(1,G_BFU_FONT_SIZE);
if (l==ld->list) break;
}
if (!F) fill_area(term,dlg->x+DIALOG_LB,y,w,ld->n_items-a,' ',COLOR_MENU);
#ifdef G
else
{
term->dev->drv->fill_area(term->dev,dlg->x+DIALOG_LB,y,dlg->x+DIALOG_LB+w,dlg->y+DIALOG_TB+(ld->n_items)*G_BFU_FONT_SIZE,dip_get_color_sRGB(G_BFU_BG_COLOR));
}
#endif
break;
default:
internal(
"Invalid list description type.\n"
"Somebody's probably shooting into memory.\n"
"_______________\n"
"`--|_____|--|___ `\\\n"
" \" \\___\\\n");
break;
}
}
/* moves cursor from old position to a new one */
/* direction: -1=old is previous, +1=old is next */
void redraw_list_line(struct terminal *term, void *bla)
{
struct redraw_data *rd=(struct redraw_data *)bla;
struct list_description *ld=rd->ld;
struct dialog_data *dlg=rd->dlg;
/*struct session *ses=(struct session *)(dlg->dlg->udata);*/
int direction=rd->n;
int w=dlg->xw-2*DIALOG_LB-(F?sirka_scrollovadla:0);
int y=dlg->y+DIALOG_TB+gf_val(ld->win_pos,ld->win_pos*G_BFU_FONT_SIZE);
if (!F)
{
/* novou radku musim prekreslit celou, protoze ji BFU mohlo oznacit a mohla to byt posledni radka v seznamu */
set_line_color(term,dlg->x+DIALOG_LB,y,w,COLOR_MENU_SELECTED);
if (ld->type) /* tree */
{
unsigned char *txt;
int b;
int x=0;
int element=0;
struct list*l=ld->current_pos;
txt=ld->type_item(term, l,1);
if (!txt)
{
txt=mem_alloc(sizeof(unsigned char));
*txt=0;
}
if (!term->spec->block_cursor || term->spec->braille) set_cursor(term, dlg->x + DIALOG_LB + x, y, dlg->x + DIALOG_LB + x, y);
for (b=0;b<l->depth;b++)
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,COLOR_MENU_SELECTED,0,0,BFU_ELEMENT_PIPE,0);
if (l->depth>=0) /* everything except head */
{
switch((l->type)&1)
{
case 0: /* item */
element=BFU_ELEMENT_TEE;
break;
case 1: /* directory */
element=((l->type)&2)?BFU_ELEMENT_OPEN:BFU_ELEMENT_CLOSED;
break;
default: /* this should never happen */
internal("=8-Q lunacy level too high! Call "BOHNICE".\n");
}
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,COLOR_MENU_SELECTED,0,0,element,(l->type)&4);
}
print_text(term,dlg->x+x+DIALOG_LB,y,w-x,txt,COLOR_MENU_SELECTED);
x+=strlen(txt);
fill_area(term,dlg->x+x+DIALOG_LB,y,w-x,1,' ',0);
set_line_color(term,dlg->x+x+DIALOG_LB,y,w-x,COLOR_MENU_SELECTED);
mem_free(txt);
}
else /* flat */
{
unsigned char *txt;
int x=0;
struct list *l=ld->current_pos;
txt=ld->type_item(term, l,1);
if (!txt)
{
txt=mem_alloc(sizeof(unsigned char));
*txt=0;
}
if (!term->spec->block_cursor || term->spec->braille) set_cursor(term, dlg->x + DIALOG_LB + x, y, dlg->x + DIALOG_LB + x, y);
/* everything except head */
if (l!=ld->list)x+=draw_bfu_element(term,dlg->x+DIALOG_LB,y,COLOR_MENU_SELECTED,0,0,BFU_ELEMENT_TEE,(l->type)&4);
print_text(term,dlg->x+x+DIALOG_LB,y,w-x,txt,COLOR_MENU_SELECTED);
x+=strlen(txt);
fill_area(term,dlg->x+DIALOG_LB+x,y,w-x,1,' ',0);
set_line_color(term,dlg->x+DIALOG_LB+x,y,w-x,COLOR_MENU_SELECTED);
mem_free(txt);
}
/* starou radku musim prekreslit celou, protoze ji BFU mohlo oznacit */
if (!direction) goto skip_old_1;
if (ld->type) /* tree */
{
unsigned char *txt;
int b;
int x=0;
int element=0;
struct list*l;
y+=direction;
if (direction==1)l=next_in_tree(ld,ld->current_pos);
else l=prev_in_tree(ld,ld->current_pos);
txt=ld->type_item(term, l,1);
if (!txt)
{
txt=mem_alloc(sizeof(unsigned char));
*txt=0;
}
for (b=0;b<l->depth;b++)
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,COLOR_MENU,0,0,BFU_ELEMENT_PIPE,0);
if (l->depth>=0) /* everything except head */
{
switch((l->type)&1)
{
case 0: /* item */
element=BFU_ELEMENT_TEE;
break;
case 1: /* directory */
element=((l->type)&2)?BFU_ELEMENT_OPEN:BFU_ELEMENT_CLOSED;
break;
default: /* this should never happen */
internal("=8-Q lunacy level too high! Call "BOHNICE".\n");
}
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,COLOR_MENU,0,0,element,(l->type)&4);
}
print_text(term,dlg->x+x+DIALOG_LB,y,w-x,txt,COLOR_MENU);
x+=strlen(txt);
fill_area(term,dlg->x+x+DIALOG_LB,y,w-x,1,' ',0);
set_line_color(term,dlg->x+x+DIALOG_LB,y,w-x,COLOR_MENU);
mem_free(txt);
}
else /* flat */
{
unsigned char *txt;
int x=0;
struct list *l;
y+=direction;
if (direction==1)l=next_in_tree(ld,ld->current_pos);
else l=prev_in_tree(ld,ld->current_pos);
txt=ld->type_item(term, l,1);
if (!txt)
{
txt=mem_alloc(sizeof(unsigned char));
*txt=0;
}
/* everything except head */
if (l!=ld->list)x+=draw_bfu_element(term,dlg->x+DIALOG_LB,y,COLOR_MENU,0,0,BFU_ELEMENT_TEE,(l->type)&4);
print_text(term,dlg->x+x+DIALOG_LB,y,w-x,txt,COLOR_MENU);
x+=strlen(txt);
fill_area(term,dlg->x+DIALOG_LB+x,y,w-x,1,' ',0);
set_line_color(term,dlg->x+DIALOG_LB+x,y,w-x,COLOR_MENU);
mem_free(txt);
}
skip_old_1:;
#ifdef G
}
else
{
unsigned char *txt;
struct rect old_area;
int n=0;
int x=0;
int b;
struct list *l;
unsigned char element=BFU_ELEMENT_PIPE;
long bg_color,fg_color;
bg_color=dip_get_color_sRGB(G_BFU_BG_COLOR);
fg_color=dip_get_color_sRGB(G_BFU_FG_COLOR);
/* current */
l=ld->current_pos;
txt=ld->type_item(term, l,1);
if (!txt)
{
txt=mem_alloc(sizeof(unsigned char));
*txt=0;
}
if (!ld->type)
element=BFU_ELEMENT_TEE;
else
switch((l->type)&1)
{
case 0: /* item */
element=BFU_ELEMENT_TEE;
break;
case 1: /* directory */
element=((l->type)&2)?BFU_ELEMENT_OPEN:BFU_ELEMENT_CLOSED;
break;
default: /* this should never happen */
internal("=8-Q lunacy level too high! Call "BOHNICE".\n");
}
if (ld->type)
{
for (b=0;b<l->depth;b++)
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,0,fg_color,bg_color,BFU_ELEMENT_PIPE,0);
if (l->depth>=0)/* everything except head */
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,0,fg_color,bg_color,element,(l->type)&4);
}
else
{
if (l!=ld->list)/* everything except head */
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,0,fg_color,bg_color,element,(l->type)&4);
}
restrict_clip_area(term->dev,&old_area,dlg->x+x+DIALOG_LB,y,dlg->x+DIALOG_LB+w,y+G_BFU_FONT_SIZE);
g_print_text(term->dev->drv,term->dev,dlg->x+x+DIALOG_LB,y,bfu_style_wb,txt,0);
x+=g_text_width(bfu_style_wb,txt);
term->dev->drv->fill_area(term->dev,dlg->x+DIALOG_LB+x,y,dlg->x+DIALOG_LB+w,y+G_BFU_FONT_SIZE,fg_color);
term->dev->drv->set_clip_area(term->dev,&old_area);
mem_free(txt);
if (!direction) goto skip_old_2;
n=0;
x=0;
/* previous/next */
if (direction==1)l=next_in_tree(ld,ld->current_pos);
else l=prev_in_tree(ld,ld->current_pos);
if (!ld->type)
element=BFU_ELEMENT_TEE;
else
switch((l->type)&1)
{
case 0: /* item */
element=BFU_ELEMENT_TEE;
break;
case 1: /* directory */
element=((l->type)&2)?BFU_ELEMENT_OPEN:BFU_ELEMENT_CLOSED;
break;
default: /* this should never happen */
internal("=8-Q lunacy level too high! Call "BOHNICE".\n");
}
txt=ld->type_item(term, l,1);
if (!txt)
{
txt=mem_alloc(sizeof(unsigned char));
*txt=0;
}
y+=direction*G_BFU_FONT_SIZE;
if (ld->type)
{
for (b=0;b<l->depth;b++)
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,0,bg_color,fg_color,BFU_ELEMENT_PIPE,0);
if (l->depth>=0)/* everything except head */
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,0,bg_color,fg_color,element,(l->type)&4);
}
else
if (l!=ld->list)/* everything except head */
x+=draw_bfu_element(term,dlg->x+DIALOG_LB+x,y,0,bg_color,fg_color,element,(l->type)&4);
restrict_clip_area(term->dev,&old_area,dlg->x+x+DIALOG_LB,y,dlg->x+DIALOG_LB+w,y+G_BFU_FONT_SIZE);
g_print_text(term->dev->drv,term->dev,dlg->x+x+DIALOG_LB,y,bfu_style_bw,txt,0);
x+=g_text_width(bfu_style_bw,txt);
term->dev->drv->fill_area(term->dev,dlg->x+DIALOG_LB+x,y,dlg->x+DIALOG_LB+w,y+G_BFU_FONT_SIZE,bg_color);
term->dev->drv->set_clip_area(term->dev,&old_area);
mem_free(txt);
skip_old_2:;
#endif
}
}
/* like redraw_list, but scrolls window, prints new line to top/bottom */
/* in text mode calls redraw list */
/* direction: -1=up, 1=down */
void scroll_list(struct terminal *term, void *bla)
{
#ifdef G
struct redraw_data *rd=(struct redraw_data *)bla;
struct list_description *ld=rd->ld;
struct dialog_data *dlg=rd->dlg;
int direction=rd->n;
struct rect_set *set;
#endif
if (!F)
{
redraw_list(term, bla);
#ifdef G
}
else
{
struct rect old_area;
struct graphics_device *dev=term->dev;
int w=dlg->xw-2*DIALOG_LB-sirka_scrollovadla;
int y=dlg->y+DIALOG_TB;
int top=0,bottom=0;
switch(direction)
{
case 1: /* down */
top=G_BFU_FONT_SIZE;
break;
case -1: /* up */
bottom=-G_BFU_FONT_SIZE;
break;
default:
internal("Wrong direction %d in function scroll_list.\n",direction);
}
restrict_clip_area(term->dev,&old_area,dlg->x+DIALOG_LB,y+top,dlg->x+DIALOG_LB+w,y+bottom+G_BFU_FONT_SIZE*(ld->n_items));
set=NULL;
drv->vscroll(dev,&set,top+bottom);
if (set) /* redraw rectangles in the set - we cannot redraw particular rectangles, we are only able to redraw whole window */
{
redraw_list(term, bla);
mem_free(set);
}
drv->set_clip_area(term->dev,&old_area);
/* redraw scroll bar */
{
int total=get_total_items(ld);
int visible=get_visible_items(ld);
int pos=get_scroll_pos(ld);
struct rect old_area;
restrict_clip_area(term->dev,&old_area,dlg->x+w+DIALOG_LB+G_SCROLL_BAR_WIDTH,y,dlg->x+DIALOG_LB+w+sirka_scrollovadla,y+G_BFU_FONT_SIZE*ld->n_items);
term->dev->drv->set_clip_area(term->dev,&old_area);
draw_vscroll_bar(term->dev,dlg->x+DIALOG_LB+w+G_SCROLL_BAR_WIDTH,y,G_BFU_FONT_SIZE*ld->n_items,total,visible,pos);
if (dlg->s)exclude_from_set(&(dlg->s),dlg->x+DIALOG_LB+w+G_SCROLL_BAR_WIDTH,y,dlg->x+DIALOG_LB+w+sirka_scrollovadla,y+G_BFU_FONT_SIZE*ld->n_items);
}
#endif
}
}
void list_find_next(struct redraw_data *rd, int direction)
{
struct list_description *ld=rd->ld;
struct dialog_data *dlg=rd->dlg;
struct session *ses=(struct session *)(dlg->dlg->udata);
struct list* item;
if (!ld->search_word) {msg_box(ses->term, NULL, TEXT(T_SEARCH), AL_CENTER, TEXT(T_NO_PREVIOUS_SEARCH), NULL, 1, TEXT(T_CANCEL), NULL, B_ENTER | B_ESC); return;}
if ((item=ld->find_item(ld->current_pos,ld->search_word,direction)))
{
struct list *l;
ld->current_pos=item;
ld->win_offset=item;
ld->win_pos=0;
if (ld->type)
for (l=item;l->depth>=0;l=l->fotr)
if (l!=item) l->type|=2;
draw_to_window(dlg->win,redraw_list,rd);
if (!F) if (!ses->term->spec->block_cursor || ses->term->spec->braille) set_cursor(ses->term, dlg->x + DIALOG_LB, dlg->y+DIALOG_TB+ld->win_pos, dlg->x + DIALOG_LB, dlg->y+DIALOG_TB+ld->win_pos);
}
else
msg_box(ses->term, NULL, TEXT(T_SEARCH), AL_CENTER, TEXT(T_SEARCH_STRING_NOT_FOUND), NULL, 1, TEXT(T_CANCEL), NULL, B_ENTER | B_ESC);
}
void list_search_for_back(struct redraw_data *rd, unsigned char *str)
{
struct list_description *ld=rd->ld;
if (!*str) return;
if (!ld->open) return;
if (ld->search_word) mem_free(ld->search_word);
ld->search_word = to_utf8_upcase(str, rd->dlg->win->term->spec->charset);
ld->search_direction = -1;
list_find_next(rd, ld->search_direction);
}
void list_search_for(struct redraw_data *rd, unsigned char *str)
{
struct list_description *ld=rd->ld;
if (!*str) return;
if (!ld->open) return;
if (ld->search_word) mem_free(ld->search_word);
ld->search_word = to_utf8_upcase(str, rd->dlg->win->term->spec->charset);
ld->search_direction = 1;
list_find_next(rd, ld->search_direction);
}
int list_event_handler(struct dialog_data *dlg, struct event *ev)
{
struct list_description *ld=(struct list_description*)(dlg->dlg->udata2);
static struct redraw_data rd;
struct session *ses=(struct session *)(dlg->dlg->udata);
rd.ld=ld;
rd.dlg=dlg;
switch ((int)ev->ev)
{
case EV_KBD:
if (ld->type==1) /* tree list */
{
if (ev->x==' ') /* toggle folder */
{
if (!((ld->current_pos->type)&1))return EVENT_PROCESSED; /* item */
ld->current_pos->type^=2;
if (!(ld->current_pos->type&2))unselect_in_folder(ld, ld->current_pos);
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
return EVENT_PROCESSED;
}
if (ev->x=='+'||ev->x=='=') /* open folder */
{
if (!((ld->current_pos->type)&1))return EVENT_PROCESSED; /* item */
if ((ld->current_pos->type)&2)return EVENT_PROCESSED; /* already open */
ld->current_pos->type|=2;
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
return EVENT_PROCESSED;
}
if (ev->x=='-') /* close folder */
{
if (!((ld->current_pos->type)&1))return EVENT_PROCESSED; /* item */
if (!((ld->current_pos->type)&2))return EVENT_PROCESSED; /* already closed */
ld->current_pos->type&=~2;
unselect_in_folder(ld,ld->current_pos);
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
return EVENT_PROCESSED;
}
}
if (ev->x=='/') /* search forward */
{
struct redraw_data *r;
r=mem_alloc(sizeof(struct redraw_data));
r->ld=ld;
r->dlg=dlg;
input_field(ses->term, getml(r,NULL), TEXT(T_SEARCH), TEXT(T_SEARCH_FOR_TEXT), r, ld->search_history, MAX_INPUT_URL_LEN, "", 0, 0, NULL, TEXT(T_OK), (void (*)(void *, unsigned char *)) list_search_for, TEXT(T_CANCEL), NULL, NULL);
return EVENT_PROCESSED;
}
if (ev->x=='?') /* search back */
{
struct redraw_data *r;
r=mem_alloc(sizeof(struct redraw_data));
r->ld=ld;
r->dlg=dlg;
input_field(ses->term, getml(r,NULL), TEXT(T_SEARCH_BACK), TEXT(T_SEARCH_FOR_TEXT), r, ld->search_history, MAX_INPUT_URL_LEN, "", 0, 0, NULL, TEXT(T_OK), (void (*)(void *, unsigned char *)) list_search_for_back, TEXT(T_CANCEL), NULL, NULL);
return EVENT_PROCESSED;
}
if (ev->x=='n') /* find next */
{
list_find_next(&rd, ld->search_direction);
return EVENT_PROCESSED;
}
if (ev->x=='N') /* find prev */
{
list_find_next(&rd, - ld->search_direction);
return EVENT_PROCESSED;
}
if (ev->x==KBD_UP)
{
if (ld->current_pos==ld->list)return EVENT_PROCESSED; /* already on the top */
ld->current_pos=prev_in_tree(ld,ld->current_pos);
ld->win_pos--;
rd.n=+1;
if (ld->win_pos<0) /* scroll up */
{
ld->win_pos=0;
ld->win_offset=prev_in_tree(ld,ld->win_offset);
draw_to_window(dlg->win,scroll_list,&rd);
}
draw_to_window(dlg->win,redraw_list_line,&rd);
return EVENT_PROCESSED;
}
if (ev->x=='i'||ev->x=='*'||ev->x=='8'||ev->x==KBD_INS)
{
if (ld->current_pos!=ld->list)ld->current_pos->type^=4;
rd.n=-1;
if (next_in_tree(ld,ld->current_pos)==ld->list) /* already at the bottom */
{
draw_to_window(dlg->win,redraw_list_line,&rd);
return EVENT_PROCESSED;
}
ld->current_pos=next_in_tree(ld,ld->current_pos);
ld->win_pos++;
if (ld->win_pos>ld->n_items-1) /* scroll down */
{
ld->win_pos=ld->n_items-1;
ld->win_offset=next_in_tree(ld,ld->win_offset);
draw_to_window(dlg->win,scroll_list,&rd);
}
draw_to_window(dlg->win,redraw_list_line,&rd);
return EVENT_PROCESSED;
}
if (ev->x==KBD_DOWN)
{
if (next_in_tree(ld,ld->current_pos)==ld->list)return EVENT_PROCESSED; /* already at the bottom */
ld->current_pos=next_in_tree(ld,ld->current_pos);
ld->win_pos++;
rd.n=-1;
if (ld->win_pos>ld->n_items-1) /* scroll down */
{
ld->win_pos=ld->n_items-1;
ld->win_offset=next_in_tree(ld,ld->win_offset);
draw_to_window(dlg->win,scroll_list,&rd);
}
draw_to_window(dlg->win,redraw_list_line,&rd);
return EVENT_PROCESSED;
}
if (ev->x==KBD_HOME || (upcase(ev->x) == 'A' && ev->y & KBD_CTRL))
{
if (ld->current_pos==ld->list)return EVENT_PROCESSED; /* already on the top */
ld->win_offset=ld->list;
ld->current_pos=ld->win_offset;
ld->win_pos=0;
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
draw_to_window(dlg->win,redraw_list_line,&rd);
return EVENT_PROCESSED;
}
if (ev->x==KBD_END || (upcase(ev->x) == 'E' && ev->y & KBD_CTRL))
{
int a;
if (ld->current_pos==prev_in_tree(ld,ld->list))return EVENT_PROCESSED; /* already on the top */
ld->win_offset=prev_in_tree(ld,ld->list);
for (a=1;a<ld->n_items&&ld->win_offset!=ld->list;a++)
ld->win_offset=prev_in_tree(ld,ld->win_offset);
ld->current_pos=prev_in_tree(ld,ld->list);
ld->win_pos=a-1;
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
draw_to_window(dlg->win,redraw_list_line,&rd);
return EVENT_PROCESSED;
}
if (ev->x==KBD_PAGE_UP || (upcase(ev->x) == 'B' && ev->y & KBD_CTRL))
{
int a;
if (ld->current_pos==ld->list)return EVENT_PROCESSED; /* already on the top */
for (a=0;a<ld->n_items&&ld->win_offset!=ld->list;a++)
{
ld->win_offset=prev_in_tree(ld,ld->win_offset);
ld->current_pos=prev_in_tree(ld,ld->current_pos);
}
if (a<ld->n_items){ld->current_pos=ld->win_offset;ld->win_pos=0;}
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
draw_to_window(dlg->win,redraw_list_line,&rd);
return EVENT_PROCESSED;
}
if (ev->x==KBD_PAGE_DOWN || (upcase(ev->x) == 'F' && ev->y & KBD_CTRL))
{
int a;
struct list*p=ld->win_offset;
if (ld->current_pos==prev_in_tree(ld,ld->list))return EVENT_PROCESSED; /* already on the bottom */
for (a=0;a<ld->n_items&&ld->list!=next_in_tree(ld,p);a++)
p=next_in_tree(ld,p);
if (a<ld->n_items) /* already last screen */
{
ld->current_pos=p;
ld->win_pos=a;
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
draw_to_window(dlg->win,redraw_list_line,&rd);
return EVENT_PROCESSED;
}
/* here is whole screen only - the window was full before pressing the page-down key */
/* p is pointing behind last item of the window (behind last visible item in the window) */
for (a=0;a<ld->n_items&&p!=ld->list;a++)
{
ld->win_offset=next_in_tree(ld,ld->win_offset);
ld->current_pos=next_in_tree(ld,ld->current_pos);
p=next_in_tree(ld,p);
}
if (a<ld->n_items){ld->current_pos=prev_in_tree(ld,ld->list);ld->win_pos=ld->n_items-1;}
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
draw_to_window(dlg->win,redraw_list_line,&rd);
return EVENT_PROCESSED;
}
break;
case EV_MOUSE:
/* toggle select item */
if ((ev->b&BM_ACT)==B_DOWN&&(ev->b&BM_BUTT)==B_RIGHT)
{
int n,a;
struct list *l=ld->win_offset;
last_mouse_y=ev->y;
if (
(ev->y)<(dlg->y+DIALOG_TB)||
(ev->y)>=(dlg->y+DIALOG_TB+gf_val(ld->n_items,G_BFU_FONT_SIZE*(ld->n_items)))||
(ev->x)<(dlg->x+DIALOG_LB)||
(ev->x)>(dlg->x+dlg->xw-DIALOG_LB-(F?sirka_scrollovadla:0))
)break; /* out of the dialog */
n=(ev->y-dlg->y-DIALOG_TB)/gf_val(1,G_BFU_FONT_SIZE);
for (a=0;a<n;a++)
{
struct list *l1;
l1=next_in_tree(ld,l); /* current item under the mouse pointer */
if (l1==ld->list)break;
else l=l1;
}
a=ld->type?((l->depth)>=0?(l->depth)+1:0):(l->depth>=0);
l->type^=4;
ld->current_pos=l;
ld->win_pos=n;
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
return EVENT_PROCESSED;
}
/* click on item */
if ((ev->b&BM_ACT)==B_DOWN&&(ev->b&BM_BUTT)==B_LEFT)
{
int n,a;
struct list *l=ld->win_offset;
last_mouse_y=ev->y;
if (
(ev->y)<(dlg->y+DIALOG_TB)||
(ev->y)>=(dlg->y+DIALOG_TB+gf_val(ld->n_items,G_BFU_FONT_SIZE*(ld->n_items)))||
(ev->x)<(dlg->x+DIALOG_LB)||
(ev->x)>(dlg->x+dlg->xw-DIALOG_LB-(F?sirka_scrollovadla:0))
)break; /* out of the dialog */
n=(ev->y-dlg->y-DIALOG_TB)/gf_val(1,G_BFU_FONT_SIZE);
for (a=0;a<n;a++)
{
struct list *l1;
l1=next_in_tree(ld,l); /* current item under the mouse pointer */
if (l1==ld->list)break;
else l=l1;
}
a=ld->type?((l->depth)>=0?(l->depth)+1:0):(l->depth>=0);
ld->current_pos=l;
/* clicked on directory graphical stuff */
if ((ld->type)&&(ev->x)<(dlg->x+DIALOG_LB+a*BFU_ELEMENT_WIDTH)&&((l->type)&1))
{
l->type^=2;
if (!(l->type&2))unselect_in_folder(ld, ld->current_pos);
}
ld->win_pos=n;
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
return EVENT_PROCESSED;
}
/* scroll with the bar */
#ifdef G
if (F&&((ev->b&BM_ACT)==B_DRAG&&(ev->b&BM_BUTT)==B_LEFT))
{
int total=get_total_items(ld);
int scroll_pos=get_scroll_pos(ld);
signed long delta;
long h=ld->n_items*G_BFU_FONT_SIZE;
if (
(ev->y)<(dlg->y+DIALOG_TB)||
(ev->y)>=(dlg->y+DIALOG_TB+G_BFU_FONT_SIZE*(ld->n_items))||
(ev->x)<(dlg->x+dlg->xw-DIALOG_LB-G_SCROLL_BAR_WIDTH)||
(ev->x)>(dlg->x+dlg->xw-DIALOG_LB)
)break; /* out of the dialog */
delta=(ev->y-dlg->y-DIALOG_TB)*total/h-scroll_pos;
last_mouse_y=ev->y;
if (delta>0) /* scroll down */
{
struct list *lll=find_last_in_window(ld);
if (next_in_tree(ld,lll)==ld->list)return EVENT_PROCESSED; /* already at the bottom */
ld->current_pos=next_in_tree(ld,lll);
ld->win_offset=next_in_tree(ld,ld->win_offset);
ld->win_pos=ld->n_items-1;
rd.n=-1;
draw_to_window(dlg->win,scroll_list,&rd);
draw_to_window(dlg->win,redraw_list_line,&rd);
}
if (delta<0) /* scroll up */
{
if (ld->win_offset==ld->list)return EVENT_PROCESSED; /* already on the top */
ld->win_offset=prev_in_tree(ld,ld->win_offset);
ld->current_pos=ld->win_offset;
ld->win_pos=0;
rd.n=+1;
draw_to_window(dlg->win,scroll_list,&rd);
draw_to_window(dlg->win,redraw_list_line,&rd);
}
return EVENT_PROCESSED;
}
#endif
if ((ev->b&BM_ACT)==B_DRAG&&(ev->b&BM_BUTT)==B_MIDDLE)
{
long delta=(ev->y-last_mouse_y)/MOUSE_SCROLL_DIVIDER;
last_mouse_y=ev->y;
if (delta>0) /* scroll down */
{
if (next_in_tree(ld,ld->current_pos)==ld->list)return EVENT_PROCESSED; /* already at the bottom */
ld->current_pos=next_in_tree(ld,ld->current_pos);
ld->win_pos++;
rd.n=-1;
if (ld->win_pos>ld->n_items-1) /* scroll down */
{
ld->win_pos=ld->n_items-1;
ld->win_offset=next_in_tree(ld,ld->win_offset);
draw_to_window(dlg->win,scroll_list,&rd);
}
draw_to_window(dlg->win,redraw_list_line,&rd);
}
if (delta<0) /* scroll up */
{
if (ld->current_pos==ld->list)return EVENT_PROCESSED; /* already on the top */
ld->current_pos=prev_in_tree(ld,ld->current_pos);
ld->win_pos--;
rd.n=+1;
if (ld->win_pos<0) /* scroll up */
{
ld->win_pos=0;
ld->win_offset=prev_in_tree(ld,ld->win_offset);
draw_to_window(dlg->win,scroll_list,&rd);
}
draw_to_window(dlg->win,redraw_list_line,&rd);
}
return EVENT_PROCESSED;
}
/* mouse wheel */
if ((ev->b&BM_ACT)==B_MOVE&&((ev->b&BM_BUTT)==B_WHEELUP||(ev->b&BM_BUTT)==B_WHEELDOWN||(ev->b&BM_BUTT)==B_WHEELDOWN1||(ev->b&BM_BUTT)==B_WHEELUP1))
{
int button=(ev->b)&BM_BUTT;
last_mouse_y=ev->y;
if (button==B_WHEELDOWN||button==B_WHEELDOWN1) /* scroll down */
{
if (next_in_tree(ld,ld->current_pos)==ld->list)return EVENT_PROCESSED; /* already at the bottom */
ld->current_pos=next_in_tree(ld,ld->current_pos);
ld->win_pos++;
rd.n=-1;
if (ld->win_pos>ld->n_items-1) /* scroll down */
{
ld->win_pos=ld->n_items-1;
ld->win_offset=next_in_tree(ld,ld->win_offset);
draw_to_window(dlg->win,scroll_list,&rd);
}
draw_to_window(dlg->win,redraw_list_line,&rd);
}
if (button==B_WHEELUP||button==B_WHEELUP1) /* scroll up */
{
if (ld->current_pos==ld->list)return EVENT_PROCESSED; /* already on the top */
ld->current_pos=prev_in_tree(ld,ld->current_pos);
ld->win_pos--;
rd.n=+1;
if (ld->win_pos<0) /* scroll up */
{
ld->win_pos=0;
ld->win_offset=prev_in_tree(ld,ld->win_offset);
draw_to_window(dlg->win,scroll_list,&rd);
}
draw_to_window(dlg->win,redraw_list_line,&rd);
}
return EVENT_PROCESSED;
}
break;
case EV_INIT:
case EV_RESIZE:
case EV_REDRAW:
case EV_ABORT:
break;
default:
internal("Unknown event received: %d", ev->ev);
}
return EVENT_NOT_PROCESSED;
}
/* display function for the list window */
void create_list_window_fn(struct dialog_data *dlg)
{
struct terminal *term=dlg->win->term;
struct list_description *ld=(struct list_description*)(dlg->dlg->udata2);
int min=0;
int w,rw,y;
struct redraw_data rd;
int a=6;
ld->dlg=dlg;
if (ld->button_fn)a++; /* user button */
if (ld->type==1)a++; /* add directory button */
y=gf_val(ld->n_items,ld->n_items*G_BFU_FONT_SIZE);
min_buttons_width(term, dlg->items, a, &min);
w=gf_val(ld->window_width,ld->window_width*G_BFU_FONT_SIZE);
if (w<min)w=min;
if (w>term->x-2*DIALOG_LB)w=term->x-2*DIALOG_LB;
if (w<5)w=5;
rw=0;
dlg_format_buttons(dlg, NULL, dlg->items, a, 0, &y, w, &rw, AL_CENTER);
rw=w;
dlg->xw=rw+2*DIALOG_LB;
dlg->yw=y+2*DIALOG_TB;
center_dlg(dlg);
draw_dlg(dlg);
rd.ld=ld;
rd.dlg=dlg;
rd.n=0;
draw_to_window(dlg->win,redraw_list,&rd);
y=dlg->y+DIALOG_TB+gf_val(ld->n_items+1,(ld->n_items+1)*G_BFU_FONT_SIZE);
dlg_format_buttons(dlg, term, dlg->items, a, dlg->x+DIALOG_LB, &y, w, &rw, AL_CENTER);
}
void close_list_window(struct dialog_data *dlg)
{
struct dialog *d=dlg->dlg;
struct list_description *ld=(struct list_description*)(d->udata2);
ld->open=0;
ld->dlg=NULL;
if (ld->search_word) mem_free(ld->search_word);
ld->search_word=NULL;
}
/* dialog->udata2 ... list_description */
/* dialog->udata ... session */
int create_list_window(
struct list_description *ld,
struct list *list,
struct terminal *term,
struct session *ses
)
{
struct dialog *d;
int a;
/* zavodime, zavodime... */
if (!(ld->open))ld->open=1;
else /* already in use */
{
msg_box(
term,
NULL,
TEXT(T_INFO),
AL_CENTER,
TEXT(ld->already_in_use),
NULL,
1,
TEXT(T_OK),NULL,B_ENTER|B_ESC
);
return 1;
}
if (!ld->current_pos)
{
ld->current_pos=list;
ld->win_offset=list;
ld->win_pos=0;
ld->dlg=NULL;
}
a=7;
if (ld->button_fn)a++;
if (ld->type==1)a++;
d = mem_calloc(sizeof(struct dialog) + a * sizeof(struct dialog_item));
d->title=TEXT(ld->window_title);
d->fn=create_list_window_fn;
d->abort=close_list_window;
d->handle_event=list_event_handler;
d->udata=ses;
d->udata2=ld;
a=0;
if (ld->button_fn)
{
d->items[a].type=D_BUTTON;
d->items[a].fn=list_item_button;
d->items[a].text=TEXT(ld->button);
a++;
}
if (ld->type==1)
{
d->items[a].type=D_BUTTON;
d->items[a].text=TEXT(T_FOLDER);
d->items[a].fn=list_folder_add;
a++;
}
d->items[a].type=D_BUTTON;
d->items[a].text=TEXT(T_ADD);
d->items[a].fn=list_item_add;
d->items[a+1].type=D_BUTTON;
d->items[a+1].text=TEXT(T_DELETE);
d->items[a+1].fn=list_item_delete;
d->items[a+2].type=D_BUTTON;
d->items[a+2].text=TEXT(T_EDIT);
d->items[a+2].fn=list_item_edit;
d->items[a+3].type=D_BUTTON;
d->items[a+3].text=TEXT(T_MOVE);
d->items[a+3].fn=list_item_move;
d->items[a+4].type=D_BUTTON;
d->items[a+4].text=TEXT(T_UNSELECT_ALL);
d->items[a+4].fn=list_item_unselect;
d->items[a+5].type=D_BUTTON;
d->items[a+5].gid=B_ESC;
d->items[a+5].fn=cancel_dialog;
d->items[a+5].text=TEXT(T_CLOSE);
d->items[a+6].type=D_END;
do_dialog(term, d, getml(d, NULL));
return 0;
}
void redraw_list_window(struct list_description *ld)
{
struct redraw_data rd;
if (!(ld->open)||!(ld->dlg))return;
rd.ld=ld;
rd.dlg=ld->dlg;
rd.n=0;
draw_to_window(ld->dlg->win,redraw_list,&rd);
}
void reinit_list_window(struct list_description *ld)
{
struct redraw_data rd;
ld->current_pos=ld->list;
ld->win_offset=ld->list;
ld->win_pos=0;
if (!(ld->open)||!(ld->dlg))return;
rd.ld=ld;
rd.dlg=ld->dlg;
rd.n=0;
draw_to_window(ld->dlg->win,redraw_list,&rd);
}
|