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 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 4767 4768 4769 4770 4771 4772 4773 4774 4775 4776 4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 4802 4803 4804 4805 4806 4807 4808 4809 4810 4811 4812 4813 4814 4815 4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837 4838 4839 4840 4841 4842 4843 4844 4845 4846 4847 4848 4849 4850 4851 4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 4931 4932 4933 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957 4958 4959 4960 4961 4962 4963 4964 4965 4966 4967 4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978 4979 4980 4981 4982 4983 4984 4985 4986 4987 4988 4989 4990 4991 4992 4993 4994 4995 4996 4997 4998 4999 5000 5001 5002 5003 5004 5005 5006 5007 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 5019 5020 5021 5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 5089 5090 5091 5092 5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126 5127 5128 5129 5130 5131 5132 5133 5134 5135 5136 5137 5138 5139 5140 5141 5142 5143 5144 5145 5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 5192 5193 5194 5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212 5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 5223 5224 5225 5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 5246 5247 5248 5249 5250 5251 5252 5253 5254 5255 5256 5257 5258 5259 5260 5261 5262 5263 5264 5265 5266 5267 5268 5269 5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280 5281 5282 5283 5284 5285 5286 5287 5288 5289 5290 5291 5292 5293 5294 5295 5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307 5308 5309 5310 5311 5312 5313 5314 5315 5316 5317 5318 5319 5320 5321 5322 5323 5324 5325 5326 5327 5328 5329 5330 5331 5332 5333 5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 5359 5360 5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 5389 5390 5391 5392 5393 5394 5395 5396 5397 5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 5410 5411 5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 5435 5436 5437 5438 5439 5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450 5451 5452 5453 5454 5455 5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475 5476 5477 5478 5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527 5528 5529 5530 5531 5532 5533 5534 5535 5536 5537 5538 5539 5540 5541 5542 5543 5544 5545 5546 5547 5548 5549 5550 5551 5552 5553 5554 5555 5556 5557 5558 5559 5560 5561 5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 5573 5574 5575 5576 5577 5578 5579 5580 5581 5582 5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598 5599 5600 5601 5602 5603 5604 5605 5606 5607 5608 5609 5610 5611 5612 5613 5614 5615 5616 5617 5618 5619 5620 5621 5622 5623 5624 5625 5626 5627 5628 5629 5630 5631 5632 5633 5634 5635 5636 5637 5638 5639 5640 5641 5642 5643 5644 5645 5646 5647 5648 5649 5650 5651 5652 5653 5654 5655 5656 5657 5658 5659 5660 5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671 5672 5673 5674 5675 5676 5677 5678 5679 5680 5681 5682 5683 5684 5685 5686 5687 5688 5689 5690 5691 5692 5693 5694 5695 5696 5697 5698 5699 5700 5701 5702 5703 5704 5705 5706 5707 5708 5709 5710 5711 5712 5713 5714 5715 5716 5717 5718 5719 5720 5721 5722 5723 5724 5725 5726 5727 5728 5729 5730 5731 5732 5733 5734 5735 5736 5737 5738 5739 5740 5741 5742 5743 5744 5745 5746 5747 5748 5749 5750 5751 5752 5753 5754 5755 5756 5757 5758 5759 5760 5761 5762 5763 5764 5765 5766 5767 5768 5769 5770 5771 5772 5773 5774 5775 5776 5777 5778 5779 5780 5781 5782 5783 5784 5785 5786 5787 5788 5789 5790 5791 5792 5793 5794 5795 5796 5797 5798 5799 5800 5801 5802 5803 5804 5805 5806 5807 5808 5809 5810 5811 5812 5813 5814 5815 5816 5817 5818 5819 5820 5821 5822 5823 5824 5825 5826 5827 5828 5829 5830 5831 5832 5833 5834 5835 5836 5837 5838 5839 5840 5841 5842 5843 5844 5845 5846 5847 5848 5849 5850 5851 5852 5853 5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864 5865 5866 5867 5868 5869 5870 5871 5872 5873 5874 5875 5876 5877 5878 5879 5880 5881 5882 5883 5884 5885 5886 5887 5888 5889 5890 5891 5892 5893 5894 5895 5896 5897 5898 5899 5900 5901 5902 5903 5904 5905 5906 5907 5908 5909 5910 5911 5912 5913 5914 5915 5916 5917 5918 5919 5920 5921 5922 5923 5924 5925 5926 5927 5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 5938 5939 5940 5941 5942 5943 5944 5945 5946 5947 5948 5949 5950 5951 5952 5953 5954 5955 5956 5957 5958 5959 5960 5961 5962 5963 5964 5965 5966 5967 5968 5969 5970 5971 5972 5973 5974 5975 5976 5977 5978 5979 5980 5981 5982 5983 5984 5985 5986 5987 5988 5989 5990 5991 5992 5993 5994 5995 5996 5997 5998 5999 6000 6001 6002 6003 6004 6005 6006 6007 6008 6009 6010 6011 6012 6013 6014 6015 6016 6017 6018 6019 6020 6021 6022 6023 6024 6025 6026 6027 6028 6029 6030 6031 6032 6033 6034 6035 6036 6037 6038 6039 6040 6041 6042 6043 6044 6045 6046 6047 6048 6049 6050 6051 6052 6053 6054 6055 6056 6057 6058 6059 6060 6061 6062 6063 6064 6065 6066 6067 6068 6069 6070 6071 6072 6073 6074 6075 6076 6077 6078 6079 6080 6081 6082 6083 6084 6085 6086 6087 6088 6089 6090 6091 6092 6093 6094 6095 6096 6097 6098 6099 6100 6101 6102 6103 6104 6105 6106 6107 6108 6109 6110 6111 6112 6113 6114 6115 6116 6117 6118 6119 6120 6121 6122 6123 6124 6125 6126 6127 6128 6129 6130 6131 6132 6133 6134 6135 6136 6137 6138 6139 6140 6141 6142 6143 6144 6145 6146 6147 6148 6149 6150 6151 6152 6153 6154 6155 6156 6157 6158 6159 6160 6161 6162 6163 6164 6165
|
/**
* @file
* @brief Support code for Crawl des files.
**/
#include "AppHdr.h"
#include "mapdef.h"
#include <algorithm>
#include <cctype>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include "abyss.h"
#include "artefact.h"
#include "branch.h"
#include "cluautil.h"
#include "colour.h"
#include "coordit.h"
#include "describe.h"
#include "dgn-height.h"
#include "dungeon.h"
#include "end.h"
#include "english.h"
#include "files.h"
#include "initfile.h"
#include "item-status-flag-type.h"
#include "invent.h"
#include "libutil.h"
#include "mapmark.h"
#include "maps.h"
#include "mon-book.h"
#include "mon-cast.h"
#include "mon-place.h"
#include "mutant-beast.h"
#include "place.h"
#include "random.h"
#include "religion.h"
#include "shopping.h"
#include "spl-book.h"
#include "spl-util.h"
#include "stringutil.h"
#include "terrain.h"
#include "tiledef-dngn.h"
#include "tiledef-player.h"
static const char *map_section_names[] =
{
"",
"north",
"south",
"east",
"west",
"northwest",
"northeast",
"southwest",
"southeast",
"encompass",
"float",
"centre",
};
static string_set Map_Flag_Names;
const char *traversable_glyphs =
".+=w@{}()[]<>BC^TUVY$%*|Odefghijk0123456789";
// atoi that rejects strings containing non-numeric trailing characters.
// returns defval for invalid input.
template <typename V>
static V strict_aton(const char *s, V defval = 0)
{
char *end;
const V res = strtol(s, &end, 10);
return (!*s || *end) ? defval : res;
}
const char *map_section_name(int msect)
{
if (msect < 0 || msect >= MAP_NUM_SECTION_TYPES)
return "";
return map_section_names[msect];
}
static int find_weight(string &s, int defweight = TAG_UNFOUND)
{
int weight = strip_number_tag(s, "weight:");
if (weight == TAG_UNFOUND)
weight = strip_number_tag(s, "w:");
return weight == TAG_UNFOUND ? defweight : weight;
}
void clear_subvault_stack()
{
env.new_subvault_names.clear();
env.new_subvault_tags.clear();
env.new_used_subvault_names.clear();
env.new_used_subvault_tags.clear();
}
void map_register_flag(const string &flag)
{
Map_Flag_Names.insert(flag);
}
static bool _map_tag_is_selectable(const string &tag)
{
return !Map_Flag_Names.count(tag)
&& tag.find("luniq_") != 0
&& tag.find("uniq_") != 0
&& tag.find("ruin_") != 0
&& tag.find("chance_") != 0;
}
string mapdef_split_key_item(const string &s, string *key, int *separator,
string *arg, int key_max_len)
{
string::size_type
norm = s.find("=", 1),
fixe = s.find(":", 1);
const string::size_type sep = norm < fixe? norm : fixe;
if (sep == string::npos)
{
return make_stringf("malformed declaration - must use = or : in '%s'",
s.c_str());
}
*key = trimmed_string(s.substr(0, sep));
string substitute = trimmed_string(s.substr(sep + 1));
if (key->empty()
|| (key_max_len != -1 && (int) key->length() > key_max_len))
{
return make_stringf(
"selector '%s' must be <= %d characters in '%s'",
key->c_str(), key_max_len, s.c_str());
}
if (substitute.empty())
{
return make_stringf("no substitute defined in '%s'",
s.c_str());
}
*arg = substitute;
*separator = s[sep];
return "";
}
int store_tilename_get_index(const string& tilename)
{
if (tilename.empty())
return 0;
// Increase index by 1 to distinguish between first entry and none.
unsigned int i;
for (i = 0; i < env.tile_names.size(); ++i)
if (tilename == env.tile_names[i])
return i+1;
#ifdef DEBUG_TILE_NAMES
mprf("adding %s on index %d (%d)", tilename.c_str(), i, i+1);
#endif
// If not found, add tile name to vector.
env.tile_names.push_back(tilename);
return i+1;
}
///////////////////////////////////////////////
// subvault_place
//
subvault_place::subvault_place()
: tl(), br(), subvault()
{
}
subvault_place::subvault_place(const coord_def &_tl,
const coord_def &_br,
const map_def &_subvault)
: tl(_tl), br(_br), subvault(new map_def(_subvault))
{
}
subvault_place::subvault_place(const subvault_place &place)
: tl(place.tl), br(place.br),
subvault(place.subvault ? new map_def(*place.subvault) : nullptr)
{
}
subvault_place &subvault_place::operator = (const subvault_place &place)
{
tl = place.tl;
br = place.br;
subvault.reset(place.subvault ? new map_def(*place.subvault)
: nullptr);
return *this;
}
void subvault_place::set_subvault(const map_def &_subvault)
{
subvault.reset(new map_def(_subvault));
}
///////////////////////////////////////////////
// level_range
//
level_range::level_range(branch_type br, int s, int d)
: branch(br), shallowest(), deepest(), deny(false)
{
set(s, d);
}
level_range::level_range(const raw_range &r)
: branch(r.branch), shallowest(r.shallowest), deepest(r.deepest),
deny(r.deny)
{
}
void level_range::write(writer& outf) const
{
marshallShort(outf, branch);
marshallShort(outf, shallowest);
marshallShort(outf, deepest);
marshallBoolean(outf, deny);
}
void level_range::read(reader& inf)
{
branch = static_cast<branch_type>(unmarshallShort(inf));
shallowest = unmarshallShort(inf);
deepest = unmarshallShort(inf);
deny = unmarshallBoolean(inf);
}
string level_range::str_depth_range() const
{
if (shallowest == -1)
return ":??";
if (shallowest == BRANCH_END)
return ":$";
if (deepest == BRANCH_END)
return shallowest == 1? "" : make_stringf("%d-", shallowest);
if (shallowest == deepest)
return make_stringf(":%d", shallowest);
return make_stringf(":%d-%d", shallowest, deepest);
}
string level_range::describe() const
{
return make_stringf("%s%s%s",
deny? "!" : "",
branch == NUM_BRANCHES ? "Any" :
branches[branch].abbrevname,
str_depth_range().c_str());
}
level_range::operator raw_range () const
{
raw_range r;
r.branch = branch;
r.shallowest = shallowest;
r.deepest = deepest;
r.deny = deny;
return r;
}
void level_range::set(const string &br, int s, int d)
{
if (br == "any" || br == "Any")
branch = NUM_BRANCHES;
else if ((branch = branch_by_abbrevname(br)) == NUM_BRANCHES)
throw bad_level_id_f("Unknown branch: '%s'", br.c_str());
shallowest = s;
deepest = d;
if (deepest < shallowest || deepest <= 0)
{
throw bad_level_id_f("Level-range %s:%d-%d is malformed",
br.c_str(), s, d);
}
}
level_range level_range::parse(string s)
{
level_range lr;
trim_string(s);
if (s == "*")
{
lr.set("any", 0, BRANCH_END);
return lr;
}
if (s[0] == '!')
{
lr.deny = true;
s = trimmed_string(s.substr(1));
}
string::size_type cpos = s.find(':');
if (cpos == string::npos)
parse_partial(lr, s);
else
{
string br = trimmed_string(s.substr(0, cpos));
string depth = trimmed_string(s.substr(cpos + 1));
parse_depth_range(depth, &lr.shallowest, &lr.deepest);
lr.set(br, lr.shallowest, lr.deepest);
}
return lr;
}
void level_range::parse_partial(level_range &lr, const string &s)
{
if (isadigit(s[0]))
{
lr.branch = NUM_BRANCHES;
parse_depth_range(s, &lr.shallowest, &lr.deepest);
}
else
lr.set(s, 1, BRANCH_END);
}
void level_range::parse_depth_range(const string &s, int *l, int *h)
{
if (s == "*")
{
*l = 1;
*h = BRANCH_END;
return;
}
if (s == "$")
{
*l = BRANCH_END;
*h = BRANCH_END;
return;
}
string::size_type hy = s.find('-');
if (hy == string::npos)
{
*l = *h = strict_aton<int>(s.c_str());
if (!*l)
throw bad_level_id("Bad depth: " + s);
}
else
{
*l = strict_aton<int>(s.substr(0, hy).c_str());
string tail = s.substr(hy + 1);
if (tail.empty() || tail == "$")
*h = BRANCH_END;
else
*h = strict_aton<int>(tail.c_str());
if (!*l || !*h || *l > *h)
throw bad_level_id("Bad depth: " + s);
}
}
void level_range::set(int s, int d)
{
shallowest = s;
deepest = d;
if (deepest == -1)
deepest = shallowest;
if (deepest < shallowest)
throw bad_level_id_f("Bad depth range: %d-%d", shallowest, deepest);
}
void level_range::reset()
{
deepest = shallowest = -1;
branch = NUM_BRANCHES;
}
bool level_range::matches(const level_id &lid) const
{
if (branch == NUM_BRANCHES)
return matches(absdungeon_depth(lid.branch, lid.depth));
else
{
return branch == lid.branch
&& (lid.depth >= shallowest
|| shallowest == BRANCH_END && lid.depth == brdepth[branch])
&& lid.depth <= deepest;
}
}
bool level_range::matches(int x) const
{
// [ds] The level ranges used by the game are zero-based, adjust for that.
++x;
return x >= shallowest && x <= deepest;
}
bool level_range::operator == (const level_range &lr) const
{
return deny == lr.deny
&& shallowest == lr.shallowest
&& deepest == lr.deepest
&& branch == lr.branch;
}
bool level_range::valid() const
{
return shallowest > 0 && deepest >= shallowest;
}
////////////////////////////////////////////////////////////////////////
// map_lines
map_lines::map_lines()
: markers(), lines(), overlay(),
map_width(0), solid_north(false), solid_east(false),
solid_south(false), solid_west(false), solid_checked(false)
{
}
map_lines::map_lines(const map_lines &map)
{
init_from(map);
}
void map_lines::write_maplines(writer &outf) const
{
const int h = height();
marshallShort(outf, h);
for (int i = 0; i < h; ++i)
marshallString(outf, lines[i]);
}
void map_lines::read_maplines(reader &inf)
{
clear();
const int h = unmarshallShort(inf);
ASSERT_RANGE(h, 0, GYM + 1);
for (int i = 0; i < h; ++i)
add_line(unmarshallString(inf));
}
rectangle_iterator map_lines::get_iter() const
{
ASSERT(width() > 0);
ASSERT(height() > 0);
coord_def tl(0, 0);
coord_def br(width() - 1, height() - 1);
return rectangle_iterator(tl, br);
}
char map_lines::operator () (const coord_def &c) const
{
return lines[c.y][c.x];
}
char& map_lines::operator () (const coord_def &c)
{
return lines[c.y][c.x];
}
char map_lines::operator () (int x, int y) const
{
return lines[y][x];
}
char& map_lines::operator () (int x, int y)
{
return lines[y][x];
}
bool map_lines::in_bounds(const coord_def &c) const
{
return c.x >= 0 && c.y >= 0 && c.x < width() && c.y < height();
}
bool map_lines::in_map(const coord_def &c) const
{
return in_bounds(c) && lines[c.y][c.x] != ' ';
}
map_lines &map_lines::operator = (const map_lines &map)
{
if (this != &map)
init_from(map);
return *this;
}
map_lines::~map_lines()
{
clear_markers();
}
void map_lines::init_from(const map_lines &map)
{
// Markers have to be regenerated, they will not be copied.
clear_markers();
overlay.reset(nullptr);
lines = map.lines;
map_width = map.map_width;
solid_north = map.solid_north;
solid_east = map.solid_east;
solid_south = map.solid_south;
solid_west = map.solid_west;
solid_checked = map.solid_checked;
}
void map_lines::clear_markers()
{
deleteAll(markers);
}
void map_lines::add_marker(map_marker *marker)
{
markers.push_back(marker);
}
string map_lines::add_feature_marker(const string &s)
{
string key, arg;
int sep = 0;
string err = mapdef_split_key_item(s, &key, &sep, &arg, -1);
if (!err.empty())
return err;
map_marker_spec spec(key, arg);
spec.apply_transform(*this);
return "";
}
string map_lines::add_lua_marker(const string &key, const lua_datum &function)
{
map_marker_spec spec(key, function);
spec.apply_transform(*this);
return "";
}
void map_lines::apply_markers(const coord_def &c)
{
for (map_marker *marker : markers)
{
marker->pos += c;
env.markers.add(marker);
}
// *not* clear_markers() since we've offloaded marker ownership to
// the crawl env.
markers.clear();
}
void map_lines::apply_grid_overlay(const coord_def &c, bool is_layout)
{
if (!overlay)
return;
for (int y = height() - 1; y >= 0; --y)
for (int x = width() - 1; x >= 0; --x)
{
coord_def gc(c.x + x, c.y + y);
if (is_layout && map_masked(gc, MMT_VAULT))
continue;
const int colour = (*overlay)(x, y).colour;
if (colour)
dgn_set_grid_colour_at(gc, colour);
const terrain_property_t property = (*overlay)(x, y).property;
if (property.flags >= FPROP_BLOODY)
{
// Over-ride whatever property is already there.
env.pgrid(gc) |= property;
}
const int fheight = (*overlay)(x, y).height;
if (fheight != INVALID_HEIGHT)
{
if (!env.heightmap)
dgn_initialise_heightmap();
dgn_height_at(gc) = fheight;
}
bool has_floor = false, has_rock = false;
string name = (*overlay)(x, y).floortile;
if (!name.empty() && name != "none")
{
env.tile_flv(gc).floor_idx =
store_tilename_get_index(name);
tileidx_t floor;
tile_dngn_index(name.c_str(), &floor);
if (colour)
floor = tile_dngn_coloured(floor, colour);
int offset = random2(tile_dngn_count(floor));
env.tile_flv(gc).floor = floor + offset;
has_floor = true;
}
name = (*overlay)(x, y).rocktile;
if (!name.empty() && name != "none")
{
env.tile_flv(gc).wall_idx =
store_tilename_get_index(name);
tileidx_t rock;
tile_dngn_index(name.c_str(), &rock);
if (colour)
rock = tile_dngn_coloured(rock, colour);
int offset = random2(tile_dngn_count(rock));
env.tile_flv(gc).wall = rock + offset;
has_rock = true;
}
name = (*overlay)(x, y).tile;
if (!name.empty() && name != "none")
{
env.tile_flv(gc).feat_idx =
store_tilename_get_index(name);
tileidx_t feat;
tile_dngn_index(name.c_str(), &feat);
if (colour)
feat = tile_dngn_coloured(feat, colour);
int offset = 0;
if ((*overlay)(x, y).last_tile)
offset = tile_dngn_count(feat) - 1;
else
offset = random2(tile_dngn_count(feat));
if (!has_floor && grd(gc) == DNGN_FLOOR)
env.tile_flv(gc).floor = feat + offset;
else if (!has_rock && grd(gc) == DNGN_ROCK_WALL)
env.tile_flv(gc).wall = feat + offset;
else
{
if ((*overlay)(x, y).no_random)
offset = 0;
env.tile_flv(gc).feat = feat + offset;
}
}
}
}
void map_lines::apply_overlays(const coord_def &c, bool is_layout)
{
apply_markers(c);
apply_grid_overlay(c, is_layout);
}
const vector<string> &map_lines::get_lines() const
{
return lines;
}
vector<string> &map_lines::get_lines()
{
return lines;
}
void map_lines::add_line(const string &s)
{
lines.push_back(s);
if (static_cast<int>(s.length()) > map_width)
map_width = s.length();
}
string map_lines::clean_shuffle(string s)
{
return replace_all_of(s, " \t", "");
}
string map_lines::check_block_shuffle(const string &s)
{
const vector<string> segs = split_string("/", s);
const unsigned seglen = segs[0].length();
for (const string &seg : segs)
{
if (seglen != seg.length())
return "block shuffle segment length mismatch";
}
return "";
}
string map_lines::check_shuffle(string &s)
{
if (s.find(',') != string::npos)
return "use / for block shuffle, or multiple SHUFFLE: lines";
s = clean_shuffle(s);
if (s.find('/') != string::npos)
return check_block_shuffle(s);
return "";
}
string map_lines::check_clear(string &s)
{
s = clean_shuffle(s);
if (!s.length())
return "no glyphs specified for clearing";
return "";
}
string map_lines::parse_glyph_replacements(string s, glyph_replacements_t &gly)
{
s = replace_all_of(s, "\t", " ");
for (const string &is : split_string(" ", s))
{
if (is.length() > 2 && is[1] == ':')
{
const int glych = is[0];
int weight;
if (!parse_int(is.substr(2).c_str(), weight) || weight < 1)
return "Invalid weight specifier in \"" + s + "\"";
else
gly.emplace_back(glych, weight);
}
else
{
for (int c = 0, cs = is.length(); c < cs; ++c)
gly.emplace_back(is[c], 10);
}
}
return "";
}
template<class T>
static string _parse_weighted_str(const string &spec, T &list)
{
for (string val : split_string("/", spec))
{
lowercase(val);
int weight = find_weight(val);
if (weight == TAG_UNFOUND)
{
weight = 10;
// :number suffix?
string::size_type cpos = val.find(':');
if (cpos != string::npos)
{
if (!parse_int(val.substr(cpos + 1).c_str(), weight) || weight <= 0)
return "Invalid weight specifier in \"" + spec + "\"";
val.erase(cpos);
trim_string(val);
}
}
if (!list.parse(val, weight))
{
return make_stringf("bad spec: '%s' in '%s'",
val.c_str(), spec.c_str());
}
}
return "";
}
bool map_colour_list::parse(const string &col, int weight)
{
const int colour = col == "none" ? BLACK : str_to_colour(col, -1, false, true);
if (colour == -1)
return false;
emplace_back(colour, weight);
return true;
}
string map_lines::add_colour(const string &sub)
{
string s = trimmed_string(sub);
if (s.empty())
return "";
int sep = 0;
string key;
string substitute;
string err = mapdef_split_key_item(sub, &key, &sep, &substitute, -1);
if (!err.empty())
return err;
map_colour_list colours;
err = _parse_weighted_str<map_colour_list>(substitute, colours);
if (!err.empty())
return err;
colour_spec spec(key, sep == ':', colours);
overlay_colours(spec);
return "";
}
bool map_fprop_list::parse(const string &fp, int weight)
{
feature_property_type fprop;
if (fp == "nothing")
fprop = FPROP_NONE;
else if (fp.empty())
return false;
else if (str_to_fprop(fp) == FPROP_NONE)
return false;
else
fprop = str_to_fprop(fp);
emplace_back(fprop, weight);
return true;
}
bool map_featheight_list::parse(const string &fp, int weight)
{
const int thisheight = strict_aton(fp.c_str(), INVALID_HEIGHT);
if (thisheight == INVALID_HEIGHT)
return false;
emplace_back(thisheight, weight);
return true;
}
string map_lines::add_fproperty(const string &sub)
{
string s = trimmed_string(sub);
if (s.empty())
return "";
int sep = 0;
string key;
string substitute;
string err = mapdef_split_key_item(sub, &key, &sep, &substitute, -1);
if (!err.empty())
return err;
map_fprop_list fprops;
err = _parse_weighted_str<map_fprop_list>(substitute, fprops);
if (!err.empty())
return err;
fprop_spec spec(key, sep == ':', fprops);
overlay_fprops(spec);
return "";
}
string map_lines::add_fheight(const string &sub)
{
string s = trimmed_string(sub);
if (s.empty())
return "";
int sep = 0;
string key;
string substitute;
string err = mapdef_split_key_item(sub, &key, &sep, &substitute, -1);
if (!err.empty())
return err;
map_featheight_list fheights;
err = _parse_weighted_str(substitute, fheights);
if (!err.empty())
return err;
fheight_spec spec(key, sep == ':', fheights);
overlay_fheights(spec);
return "";
}
bool map_string_list::parse(const string &fp, int weight)
{
emplace_back(fp, weight);
return !fp.empty();
}
string map_lines::add_subst(const string &sub)
{
string s = trimmed_string(sub);
if (s.empty())
return "";
int sep = 0;
string key;
string substitute;
string err = mapdef_split_key_item(sub, &key, &sep, &substitute, -1);
if (!err.empty())
return err;
glyph_replacements_t repl;
err = parse_glyph_replacements(substitute, repl);
if (!err.empty())
return err;
subst_spec spec(key, sep == ':', repl);
subst(spec);
return "";
}
string map_lines::parse_nsubst_spec(const string &s, subst_spec &spec)
{
string key, arg;
int sep;
string err = mapdef_split_key_item(s, &key, &sep, &arg, -1);
if (!err.empty())
return err;
int count = 0;
if (key == "*")
count = -1;
else
parse_int(key.c_str(), count);
if (!count)
return make_stringf("Illegal spec: %s", s.c_str());
glyph_replacements_t repl;
err = parse_glyph_replacements(arg, repl);
if (!err.empty())
return err;
spec = subst_spec(count, sep == ':', repl);
return "";
}
string map_lines::add_nsubst(const string &s)
{
vector<subst_spec> substs;
int sep;
string key, arg;
string err = mapdef_split_key_item(s, &key, &sep, &arg, -1);
if (!err.empty())
return err;
vector<string> segs = split_string("/", arg);
for (int i = 0, vsize = segs.size(); i < vsize; ++i)
{
string &ns = segs[i];
if (ns.find('=') == string::npos && ns.find(':') == string::npos)
{
if (i < vsize - 1)
ns = "1=" + ns;
else
ns = "*=" + ns;
}
subst_spec spec;
err = parse_nsubst_spec(ns, spec);
if (!err.empty())
{
return make_stringf("Bad NSUBST spec: %s (%s)",
s.c_str(), err.c_str());
}
substs.push_back(spec);
}
nsubst_spec spec(key, substs);
nsubst(spec);
return "";
}
string map_lines::add_shuffle(const string &raws)
{
string s = raws;
const string err = check_shuffle(s);
if (err.empty())
resolve_shuffle(s);
return err;
}
string map_lines::add_clear(const string &raws)
{
string s = raws;
const string err = check_clear(s);
if (err.empty())
clear(s);
return err;
}
int map_lines::width() const
{
return map_width;
}
int map_lines::height() const
{
return lines.size();
}
void map_lines::extend(int min_width, int min_height, char fill)
{
min_width = max(1, min_width);
min_height = max(1, min_height);
bool dirty = false;
int old_width = width();
int old_height = height();
if (static_cast<int>(lines.size()) < min_height)
{
dirty = true;
while (static_cast<int>(lines.size()) < min_height)
add_line(string(min_width, fill));
}
if (width() < min_width)
{
dirty = true;
lines[0] += string(min_width - width(), fill);
map_width = max(map_width, min_width);
}
if (!dirty)
return;
normalise(fill);
// Extend overlay matrix as well.
if (overlay)
{
auto new_overlay = make_unique<overlay_matrix>(width(), height());
for (int y = 0; y < old_height; ++y)
for (int x = 0; x < old_width; ++x)
(*new_overlay)(x, y) = (*overlay)(x, y);
overlay = move(new_overlay);
}
}
coord_def map_lines::size() const
{
return coord_def(width(), height());
}
int map_lines::glyph(int x, int y) const
{
return lines[y][x];
}
int map_lines::glyph(const coord_def &c) const
{
return glyph(c.x, c.y);
}
bool map_lines::is_solid(int gly) const
{
return gly == 'x' || gly == 'c' || gly == 'b' || gly == 'v' || gly == 't'
|| gly == 'X';
}
void map_lines::check_borders()
{
if (solid_checked)
return;
const int wide = width(), high = height();
solid_north = solid_south = true;
for (int x = 0; x < wide && (solid_north || solid_south); ++x)
{
if (solid_north && !is_solid(glyph(x, 0)))
solid_north = false;
if (solid_south && !is_solid(glyph(x, high - 1)))
solid_south = false;
}
solid_east = solid_west = true;
for (int y = 0; y < high && (solid_east || solid_west); ++y)
{
if (solid_west && !is_solid(glyph(0, y)))
solid_west = false;
if (solid_east && !is_solid(glyph(wide - 1, y)))
solid_east = false;
}
solid_checked = true;
}
bool map_lines::solid_borders(map_section_type border)
{
check_borders();
switch (border)
{
case MAP_NORTH: return solid_north;
case MAP_SOUTH: return solid_south;
case MAP_EAST: return solid_east;
case MAP_WEST: return solid_west;
case MAP_NORTHEAST: return solid_north && solid_east;
case MAP_NORTHWEST: return solid_north && solid_west;
case MAP_SOUTHEAST: return solid_south && solid_east;
case MAP_SOUTHWEST: return solid_south && solid_west;
default: return false;
}
}
void map_lines::clear()
{
clear_markers();
lines.clear();
keyspecs.clear();
overlay.reset(nullptr);
map_width = 0;
solid_checked = false;
// First non-legal character.
next_keyspec_idx = 256;
}
void map_lines::subst(string &s, subst_spec &spec)
{
string::size_type pos = 0;
while ((pos = s.find_first_of(spec.key, pos)) != string::npos)
s[pos++] = spec.value();
}
void map_lines::subst(subst_spec &spec)
{
ASSERT(!spec.key.empty());
for (string &line : lines)
subst(line, spec);
}
void map_lines::bind_overlay()
{
if (!overlay)
overlay.reset(new overlay_matrix(width(), height()));
}
void map_lines::overlay_colours(colour_spec &spec)
{
bind_overlay();
for (iterator mi(*this, spec.key); mi; ++mi)
(*overlay)(*mi).colour = spec.get_colour();
}
void map_lines::overlay_fprops(fprop_spec &spec)
{
bind_overlay();
for (iterator mi(*this, spec.key); mi; ++mi)
(*overlay)(*mi).property |= spec.get_property();
}
void map_lines::overlay_fheights(fheight_spec &spec)
{
bind_overlay();
for (iterator mi(*this, spec.key); mi; ++mi)
(*overlay)(*mi).height = spec.get_height();
}
void map_lines::fill_mask_matrix(const string &glyphs,
const coord_def &tl,
const coord_def &br,
Matrix<bool> &flags)
{
ASSERT(tl.x >= 0);
ASSERT(tl.y >= 0);
ASSERT(br.x < width());
ASSERT(br.y < height());
ASSERT(tl.x <= br.x);
ASSERT(tl.y <= br.y);
for (int y = tl.y; y <= br.y; ++y)
for (int x = tl.x; x <= br.x; ++x)
{
int ox = x - tl.x;
int oy = y - tl.y;
flags(ox, oy) = (strchr(glyphs.c_str(), (*this)(x, y)) != nullptr);
}
}
map_corner_t map_lines::merge_subvault(const coord_def &mtl,
const coord_def &mbr,
const Matrix<bool> &mask,
const map_def &vmap)
{
const map_lines &vlines = vmap.map;
// If vault is bigger than the mask region (mtl, mbr), then it gets
// randomly centered. (vtl, vbr) stores the vault's region.
coord_def vtl = mtl;
coord_def vbr = mbr;
int width_diff = (mbr.x - mtl.x + 1) - vlines.width();
int height_diff = (mbr.y - mtl.y + 1) - vlines.height();
// Adjust vault coords with a random offset.
int ox = random2(width_diff + 1);
int oy = random2(height_diff + 1);
vtl.x += ox;
vtl.y += oy;
vbr.x -= (width_diff - ox);
vbr.y -= (height_diff - oy);
if (!overlay)
overlay.reset(new overlay_matrix(width(), height()));
// Clear any markers in the vault's grid
for (size_t i = 0; i < markers.size(); ++i)
{
map_marker *mm = markers[i];
if (mm->pos.x >= vtl.x && mm->pos.x <= vbr.x
&& mm->pos.y >= vtl.y && mm->pos.y <= vbr.y)
{
const coord_def maskc = mm->pos - mtl;
if (!mask(maskc.x, maskc.y))
continue;
// Erase this marker.
markers[i] = markers[markers.size() - 1];
markers.resize(markers.size() - 1);
i--;
}
}
// Copy markers and update locations.
for (map_marker *mm : vlines.markers)
{
coord_def mapc = mm->pos + vtl;
coord_def maskc = mapc - mtl;
if (!mask(maskc.x, maskc.y))
continue;
map_marker *clone = mm->clone();
clone->pos = mapc;
add_marker(clone);
}
unsigned mask_tags = 0;
// TODO: merge the matching of tags to MMTs into a function that is
// called from both here and dungeon.cc::dgn_register_place.
if (vmap.has_tag("no_monster_gen"))
mask_tags |= MMT_NO_MONS;
if (vmap.has_tag("no_item_gen"))
mask_tags |= MMT_NO_ITEM;
if (vmap.has_tag("no_pool_fixup"))
mask_tags |= MMT_NO_POOL;
if (vmap.has_tag("no_wall_fixup"))
mask_tags |= MMT_NO_WALL;
if (vmap.has_tag("no_trap_gen"))
mask_tags |= MMT_NO_TRAP;
// Cache keyspecs we've already pushed into the extended keyspec space.
// If !ksmap[key], then we haven't seen the 'key' glyph before.
keyspec_map ksmap(0);
for (int y = mtl.y; y <= mbr.y; ++y)
for (int x = mtl.x; x <= mbr.x; ++x)
{
int mx = x - mtl.x;
int my = y - mtl.y;
if (!mask(mx, my))
continue;
// Outside subvault?
if (x < vtl.x || x > vbr.x || y < vtl.y || y > vbr.y)
continue;
int vx = x - vtl.x;
int vy = y - vtl.y;
coord_def vc(vx, vy);
char c = vlines(vc);
if (c == ' ')
continue;
// Merge keyspecs.
// Push vault keyspecs into extended keyspecs.
// Push MONS/ITEM into KMONS/KITEM keyspecs.
// Generate KFEAT keyspecs for any normal glyphs.
int idx;
if (ksmap[c])
{
// Already generated this keyed_pmapspec.
idx = ksmap[c];
}
else
{
idx = next_keyspec_idx++;
ASSERT(idx > 0);
if (c != SUBVAULT_GLYPH)
ksmap[c] = idx;
const keyed_mapspec *kspec = vlines.mapspec_at(vc);
// If c is a SUBVAULT_GLYPH, it came from a sub-subvault.
// Sub-subvaults should always have mapspecs at this point.
ASSERT(c != SUBVAULT_GLYPH || kspec);
if (kspec)
{
// Copy vault keyspec into the extended keyspecs.
keyspecs[idx] = *kspec;
keyspecs[idx].key_glyph = SUBVAULT_GLYPH;
}
else if (map_def::valid_monster_array_glyph(c))
{
// Translate monster array into keyed_mapspec
keyed_mapspec &km = keyspecs[idx];
km.key_glyph = SUBVAULT_GLYPH;
km.feat.feats.clear();
feature_spec spec(-1);
spec.glyph = '.';
km.feat.feats.insert(km.feat.feats.begin(), spec);
int slot = map_def::monster_array_glyph_to_slot(c);
km.mons.set_from_slot(vmap.mons, slot);
}
else if (map_def::valid_item_array_glyph(c))
{
// Translate item array into keyed_mapspec
keyed_mapspec &km = keyspecs[idx];
km.key_glyph = SUBVAULT_GLYPH;
km.feat.feats.clear();
feature_spec spec(-1);
spec.glyph = '.';
km.feat.feats.insert(km.feat.feats.begin(), spec);
int slot = map_def::item_array_glyph_to_slot(c);
km.item.set_from_slot(vmap.items, slot);
}
else
{
// Normal glyph. Turn into a feature keyspec.
// This is valid for non-array items and monsters
// as well, e.g. '$' and '8'.
keyed_mapspec &km = keyspecs[idx];
km.key_glyph = SUBVAULT_GLYPH;
km.feat.feats.clear();
feature_spec spec(-1);
spec.glyph = c;
km.feat.feats.insert(km.feat.feats.begin(), spec);
}
// Add overall tags to the keyspec.
keyspecs[idx].map_mask.flags_set
|= (mask_tags & ~keyspecs[idx].map_mask.flags_unset);
}
// Finally, handle merging the cell itself.
// Glyph becomes SUBVAULT_GLYPH. (The old glyph gets merged into a
// keyspec, above). This is so that the glyphs that are included
// from a subvault are immutable by the parent vault. Otherwise,
// latent transformations (like KMONS or KITEM) from the parent
// vault might confusingly modify a glyph from the subvault.
//
// NOTE: It'd be possible to allow subvaults to be modified by the
// parent vault, but KMONS/KITEM/KFEAT/MONS/ITEM would have to
// apply immediately instead of latently. They would also then
// need to be stored per-coord, rather than per-glyph.
(*this)(x, y) = SUBVAULT_GLYPH;
// Merge overlays
if (vlines.overlay)
(*overlay)(x, y) = (*vlines.overlay)(vx, vy);
else
{
// Erase any existing overlay, as the vault's doesn't exist.
(*overlay)(x, y) = overlay_def();
}
// Set keyspec index for this subvault.
(*overlay)(x, y).keyspec_idx = idx;
}
return map_corner_t(vtl, vbr);
}
void map_lines::overlay_tiles(tile_spec &spec)
{
if (!overlay)
overlay.reset(new overlay_matrix(width(), height()));
for (int y = 0, ysize = lines.size(); y < ysize; ++y)
{
string::size_type pos = 0;
while ((pos = lines[y].find_first_of(spec.key, pos)) != string::npos)
{
if (spec.floor)
(*overlay)(pos, y).floortile = spec.get_tile();
else if (spec.feat)
(*overlay)(pos, y).tile = spec.get_tile();
else
(*overlay)(pos, y).rocktile = spec.get_tile();
(*overlay)(pos, y).no_random = spec.no_random;
(*overlay)(pos, y).last_tile = spec.last_tile;
++pos;
}
}
}
void map_lines::nsubst(nsubst_spec &spec)
{
vector<coord_def> positions;
for (int y = 0, ysize = lines.size(); y < ysize; ++y)
{
string::size_type pos = 0;
while ((pos = lines[y].find_first_of(spec.key, pos)) != string::npos)
positions.emplace_back(pos++, y);
}
shuffle_array(positions);
int pcount = 0;
const int psize = positions.size();
for (int i = 0, vsize = spec.specs.size();
i < vsize && pcount < psize; ++i)
{
const int nsubsts = spec.specs[i].count;
pcount += apply_nsubst(positions, pcount, nsubsts, spec.specs[i]);
}
}
int map_lines::apply_nsubst(vector<coord_def> &pos, int start, int nsub,
subst_spec &spec)
{
if (nsub == -1)
nsub = pos.size();
const int end = min(start + nsub, (int) pos.size());
int substituted = 0;
for (int i = start; i < end; ++i)
{
const int val = spec.value();
const coord_def &c = pos[i];
lines[c.y][c.x] = val;
++substituted;
}
return substituted;
}
string map_lines::block_shuffle(const string &s)
{
vector<string> segs = split_string("/", s);
shuffle_array(segs);
return comma_separated_line(segs.begin(), segs.end(), "/", "/");
}
string map_lines::shuffle(string s)
{
string result;
if (s.find('/') != string::npos)
return block_shuffle(s);
// Inefficient brute-force shuffle.
while (!s.empty())
{
const int c = random2(s.length());
result += s[c];
s.erase(c, 1);
}
return result;
}
void map_lines::resolve_shuffle(const string &shufflage)
{
string toshuffle = shufflage;
string shuffled = shuffle(toshuffle);
if (toshuffle.empty() || shuffled.empty())
return;
for (string &s : lines)
{
for (char &c : s)
{
string::size_type pos = toshuffle.find(c);
if (pos != string::npos)
c = shuffled[pos];
}
}
}
void map_lines::clear(const string &clearchars)
{
for (string &s : lines)
{
for (char &c : s)
{
string::size_type pos = clearchars.find(c);
if (pos != string::npos)
c = ' ';
}
}
}
void map_lines::normalise(char fillch)
{
for (string &s : lines)
if (static_cast<int>(s.length()) < map_width)
s += string(map_width - s.length(), fillch);
}
// Should never be attempted if the map has a defined orientation, or if one
// of the dimensions is greater than the lesser of GXM,GYM.
void map_lines::rotate(bool clockwise)
{
vector<string> newlines;
// normalise() first for convenience.
normalise();
const int xs = clockwise? 0 : map_width - 1,
xe = clockwise? map_width : -1,
xi = clockwise? 1 : -1;
const int ys = clockwise? (int) lines.size() - 1 : 0,
ye = clockwise? -1 : (int) lines.size(),
yi = clockwise? -1 : 1;
for (int i = xs; i != xe; i += xi)
{
string line;
for (int j = ys; j != ye; j += yi)
line += lines[j][i];
newlines.push_back(line);
}
if (overlay)
{
auto new_overlay = make_unique<overlay_matrix>(lines.size(), map_width);
for (int i = xs, y = 0; i != xe; i += xi, ++y)
for (int j = ys, x = 0; j != ye; j += yi, ++x)
(*new_overlay)(x, y) = (*overlay)(i, j);
overlay = move(new_overlay);
}
map_width = lines.size();
lines = newlines;
rotate_markers(clockwise);
solid_checked = false;
}
void map_lines::translate_marker(
void (map_lines::*xform)(map_marker *, int),
int par)
{
for (map_marker *marker : markers)
(this->*xform)(marker, par);
}
void map_lines::vmirror_marker(map_marker *marker, int)
{
marker->pos.y = height() - 1 - marker->pos.y;
}
void map_lines::hmirror_marker(map_marker *marker, int)
{
marker->pos.x = width() - 1 - marker->pos.x;
}
void map_lines::rotate_marker(map_marker *marker, int clockwise)
{
const coord_def c = marker->pos;
if (clockwise)
marker->pos = coord_def(width() - 1 - c.y, c.x);
else
marker->pos = coord_def(c.y, height() - 1 - c.x);
}
void map_lines::vmirror_markers()
{
translate_marker(&map_lines::vmirror_marker);
}
void map_lines::hmirror_markers()
{
translate_marker(&map_lines::hmirror_marker);
}
void map_lines::rotate_markers(bool clock)
{
translate_marker(&map_lines::rotate_marker, clock);
}
void map_lines::vmirror()
{
const int vsize = lines.size();
const int midpoint = vsize / 2;
for (int i = 0; i < midpoint; ++i)
{
string temp = lines[i];
lines[i] = lines[vsize - 1 - i];
lines[vsize - 1 - i] = temp;
}
if (overlay)
{
for (int i = 0; i < midpoint; ++i)
for (int j = 0, wide = width(); j < wide; ++j)
swap((*overlay)(j, i), (*overlay)(j, vsize - 1 - i));
}
vmirror_markers();
solid_checked = false;
}
void map_lines::hmirror()
{
const int midpoint = map_width / 2;
for (string &s : lines)
for (int j = 0; j < midpoint; ++j)
swap(s[j], s[map_width - 1 - j]);
if (overlay)
{
for (int i = 0, vsize = lines.size(); i < vsize; ++i)
for (int j = 0; j < midpoint; ++j)
swap((*overlay)(j, i), (*overlay)(map_width - 1 - j, i));
}
hmirror_markers();
solid_checked = false;
}
keyed_mapspec *map_lines::mapspec_for_key(int key)
{
return map_find(keyspecs, key);
}
const keyed_mapspec *map_lines::mapspec_for_key(int key) const
{
return map_find(keyspecs, key);
}
keyed_mapspec *map_lines::mapspec_at(const coord_def &c)
{
int key = (*this)(c);
if (key == SUBVAULT_GLYPH)
{
// Any subvault should create the overlay.
ASSERT(overlay);
if (!overlay)
return nullptr;
key = (*overlay)(c.x, c.y).keyspec_idx;
ASSERT(key);
if (!key)
return nullptr;
}
return mapspec_for_key(key);
}
const keyed_mapspec *map_lines::mapspec_at(const coord_def &c) const
{
int key = (*this)(c);
if (key == SUBVAULT_GLYPH)
{
// Any subvault should create the overlay and set the keyspec idx.
ASSERT(overlay);
if (!overlay)
return nullptr;
key = (*overlay)(c.x, c.y).keyspec_idx;
ASSERT(key);
if (!key)
return nullptr;
}
return mapspec_for_key(key);
}
string map_lines::add_key_field(
const string &s,
string (keyed_mapspec::*set_field)(const string &s, bool fixed),
void (keyed_mapspec::*copy_field)(const keyed_mapspec &spec))
{
int separator = 0;
string key, arg;
string err = mapdef_split_key_item(s, &key, &separator, &arg, -1);
if (!err.empty())
return err;
keyed_mapspec &kmbase = keyspecs[key[0]];
kmbase.key_glyph = key[0];
err = ((kmbase.*set_field)(arg, separator == ':'));
if (!err.empty())
return err;
size_t len = key.length();
for (size_t i = 1; i < len; i++)
{
keyed_mapspec &km = keyspecs[key[i]];
km.key_glyph = key[i];
((km.*copy_field)(kmbase));
}
return err;
}
string map_lines::add_key_item(const string &s)
{
return add_key_field(s, &keyed_mapspec::set_item,
&keyed_mapspec::copy_item);
}
string map_lines::add_key_feat(const string &s)
{
return add_key_field(s, &keyed_mapspec::set_feat,
&keyed_mapspec::copy_feat);
}
string map_lines::add_key_mons(const string &s)
{
return add_key_field(s, &keyed_mapspec::set_mons,
&keyed_mapspec::copy_mons);
}
string map_lines::add_key_mask(const string &s)
{
return add_key_field(s, &keyed_mapspec::set_mask,
&keyed_mapspec::copy_mask);
}
vector<coord_def> map_lines::find_glyph(int gly) const
{
vector<coord_def> points;
for (int y = height() - 1; y >= 0; --y)
{
for (int x = width() - 1; x >= 0; --x)
{
const coord_def c(x, y);
if ((*this)(c) == gly)
points.push_back(c);
}
}
return points;
}
vector<coord_def> map_lines::find_glyph(const string &glyphs) const
{
vector<coord_def> points;
for (int y = height() - 1; y >= 0; --y)
{
for (int x = width() - 1; x >= 0; --x)
{
const coord_def c(x, y);
if (glyphs.find((*this)(c)) != string::npos)
points.push_back(c);
}
}
return points;
}
coord_def map_lines::find_first_glyph(int gly) const
{
for (int y = 0, h = height(); y < h; ++y)
{
string::size_type pos = lines[y].find(gly);
if (pos != string::npos)
return coord_def(pos, y);
}
return coord_def(-1, -1);
}
coord_def map_lines::find_first_glyph(const string &glyphs) const
{
for (int y = 0, h = height(); y < h; ++y)
{
string::size_type pos = lines[y].find_first_of(glyphs);
if (pos != string::npos)
return coord_def(pos, y);
}
return coord_def(-1, -1);
}
bool map_lines::find_bounds(int gly, coord_def &tl, coord_def &br) const
{
tl = coord_def(width(), height());
br = coord_def(-1, -1);
if (width() == 0 || height() == 0)
return false;
for (rectangle_iterator ri(get_iter()); ri; ++ri)
{
const coord_def mc = *ri;
if ((*this)(mc) != gly)
continue;
tl.x = min(tl.x, mc.x);
tl.y = min(tl.y, mc.y);
br.x = max(br.x, mc.x);
br.y = max(br.y, mc.y);
}
return br.x >= 0;
}
bool map_lines::find_bounds(const char *str, coord_def &tl, coord_def &br) const
{
tl = coord_def(width(), height());
br = coord_def(-1, -1);
if (width() == 0 || height() == 0)
return false;
for (rectangle_iterator ri(get_iter()); ri; ++ri)
{
ASSERT(ri);
const coord_def &mc = *ri;
const size_t len = strlen(str);
for (size_t i = 0; i < len; ++i)
{
if ((*this)(mc) == str[i])
{
tl.x = min(tl.x, mc.x);
tl.y = min(tl.y, mc.y);
br.x = max(br.x, mc.x);
br.y = max(br.y, mc.y);
break;
}
}
}
return br.x >= 0;
}
bool map_lines::fill_zone(travel_distance_grid_t &tpd, const coord_def &start,
const coord_def &tl, const coord_def &br, int zone,
const char *wanted, const char *passable) const
{
// This is the map_lines equivalent of _dgn_fill_zone.
// It's unfortunately extremely similar, but not close enough to combine.
bool ret = false;
list<coord_def> points[2];
int cur = 0;
for (points[cur].push_back(start); !points[cur].empty();)
{
for (const auto &c : points[cur])
{
tpd[c.x][c.y] = zone;
ret |= (wanted && strchr(wanted, (*this)(c)) != nullptr);
for (int yi = -1; yi <= 1; ++yi)
for (int xi = -1; xi <= 1; ++xi)
{
if (!xi && !yi)
continue;
const coord_def cp(c.x + xi, c.y + yi);
if (cp.x < tl.x || cp.x > br.x
|| cp.y < tl.y || cp.y > br.y
|| !in_bounds(cp) || tpd[cp.x][cp.y]
|| passable && !strchr(passable, (*this)(cp)))
{
continue;
}
tpd[cp.x][cp.y] = zone;
points[!cur].push_back(cp);
}
}
points[cur].clear();
cur = !cur;
}
return ret;
}
int map_lines::count_feature_in_box(const coord_def &tl, const coord_def &br,
const char *feat) const
{
int result = 0;
for (rectangle_iterator ri(tl, br); ri; ++ri)
{
if (strchr(feat, (*this)(*ri)))
result++;
}
return result;
}
bool map_tile_list::parse(const string &s, int weight)
{
tileidx_t idx = 0;
if (s != "none" && !tile_dngn_index(s.c_str(), &idx))
return false;
emplace_back(s, weight);
return true;
}
string map_lines::add_tile(const string &sub, bool is_floor, bool is_feat)
{
string s = trimmed_string(sub);
if (s.empty())
return "";
bool no_random = strip_tag(s, "no_random");
bool last_tile = strip_tag(s, "last_tile");
int sep = 0;
string key;
string substitute;
string err = mapdef_split_key_item(s, &key, &sep, &substitute, -1);
if (!err.empty())
return err;
map_tile_list list;
err = _parse_weighted_str<map_tile_list>(substitute, list);
if (!err.empty())
return err;
tile_spec spec(key, sep == ':', no_random, last_tile, is_floor, is_feat, list);
overlay_tiles(spec);
return "";
}
string map_lines::add_rocktile(const string &sub)
{
return add_tile(sub, false, false);
}
string map_lines::add_floortile(const string &sub)
{
return add_tile(sub, true, false);
}
string map_lines::add_spec_tile(const string &sub)
{
return add_tile(sub, false, true);
}
//////////////////////////////////////////////////////////////////////////
// tile_spec
string tile_spec::get_tile()
{
if (chose_fixed)
return fixed_tile;
string chosen = "";
int cweight = 0;
for (const map_weighted_tile &tile : tiles)
if (x_chance_in_y(tile.second, cweight += tile.second))
chosen = tile.first;
if (fix)
{
chose_fixed = true;
fixed_tile = chosen;
}
return chosen;
}
//////////////////////////////////////////////////////////////////////////
// map_lines::iterator
map_lines::iterator::iterator(map_lines &_maplines, const string &_key)
: maplines(_maplines), key(_key), p(0, 0)
{
advance();
}
void map_lines::iterator::advance()
{
const int height = maplines.height();
while (p.y < height)
{
string::size_type place = p.x;
if (place < maplines.lines[p.y].length())
{
place = maplines.lines[p.y].find_first_of(key, place);
if (place != string::npos)
{
p.x = place;
break;
}
}
++p.y;
p.x = 0;
}
}
map_lines::iterator::operator bool() const
{
return p.y < maplines.height();
}
coord_def map_lines::iterator::operator *() const
{
return p;
}
coord_def map_lines::iterator::operator ++ ()
{
p.x++;
advance();
return **this;
}
coord_def map_lines::iterator::operator ++ (int)
{
coord_def here(**this);
++*this;
return here;
}
///////////////////////////////////////////////
// dlua_set_map
dlua_set_map::dlua_set_map(map_def *map)
{
clua_push_map(dlua, map);
if (!dlua.callfn("dgn_set_map", 1, 1))
{
mprf(MSGCH_ERROR, "dgn_set_map failed for '%s': %s",
map->name.c_str(), dlua.error.c_str());
}
// Save the returned map as a lua_datum
old_map.reset(new lua_datum(dlua));
}
dlua_set_map::~dlua_set_map()
{
old_map->push();
if (!dlua.callfn("dgn_set_map", 1, 0))
mprf(MSGCH_ERROR, "dgn_set_map failed: %s", dlua.error.c_str());
}
///////////////////////////////////////////////
// map_chance
string map_chance::describe() const
{
return make_stringf("%d", chance);
}
bool map_chance::roll() const
{
return random2(CHANCE_ROLL) < chance;
}
void map_chance::write(writer &outf) const
{
marshallInt(outf, chance);
}
void map_chance::read(reader &inf)
{
#if TAG_MAJOR_VERSION == 34
if (inf.getMinorVersion() < TAG_MINOR_NO_PRIORITY)
unmarshallInt(inf); // was chance_priority
#endif
chance = unmarshallInt(inf);
}
///////////////////////////////////////////////
// depth_ranges
void depth_ranges::write(writer& outf) const
{
marshallShort(outf, depths.size());
for (const level_range &depth : depths)
depth.write(outf);
}
void depth_ranges::read(reader &inf)
{
depths.clear();
const int nranges = unmarshallShort(inf);
for (int i = 0; i < nranges; ++i)
{
level_range lr;
lr.read(inf);
depths.push_back(lr);
}
}
depth_ranges depth_ranges::parse_depth_ranges(const string &depth_range_string)
{
depth_ranges ranges;
for (const string &frag : split_string(",", depth_range_string))
ranges.depths.push_back(level_range::parse(frag));
return ranges;
}
bool depth_ranges::is_usable_in(const level_id &lid) const
{
bool any_matched = false;
for (const level_range &lr : depths)
{
if (lr.matches(lid))
{
if (lr.deny)
return false;
any_matched = true;
}
}
return any_matched;
}
void depth_ranges::add_depths(const depth_ranges &other_depths)
{
depths.insert(depths.end(),
other_depths.depths.begin(),
other_depths.depths.end());
}
string depth_ranges::describe() const
{
return comma_separated_line(depths.begin(), depths.end(), ", ", ", ");
}
///////////////////////////////////////////////
// map_def
//
const int DEFAULT_MAP_WEIGHT = 10;
map_def::map_def()
: name(), description(), order(INT_MAX), place(), depths(),
orient(), _chance(), _weight(DEFAULT_MAP_WEIGHT),
map(), mons(), items(), random_mons(),
prelude("dlprelude"), mapchunk("dlmapchunk"), main("dlmain"),
validate("dlvalidate"), veto("dlveto"), epilogue("dlepilogue"),
rock_colour(BLACK), floor_colour(BLACK), rock_tile(""),
floor_tile(""), border_fill_type(DNGN_ROCK_WALL),
tags(),
index_only(false), cache_offset(0L), validating_map_flag(false)
{
init();
}
void map_def::init()
{
orient = MAP_NONE;
name.clear();
description.clear();
order = INT_MAX;
tags.clear();
place.clear();
depths.clear();
prelude.clear();
mapchunk.clear();
main.clear();
validate.clear();
veto.clear();
epilogue.clear();
place_loaded_from.clear();
reinit();
// Subvault mask set and cleared externally.
// It should *not* be in reinit.
svmask = nullptr;
}
void map_def::reinit()
{
description.clear();
order = INT_MAX;
items.clear();
random_mons.clear();
rock_colour = floor_colour = BLACK;
rock_tile = floor_tile = "";
border_fill_type = DNGN_ROCK_WALL;
// Chance of using this level. Nonzero chance should be used
// sparingly. When selecting vaults for a place, first those
// vaults with chance > 0 are considered, in the order they were
// loaded (which is arbitrary). If random2(100) < chance, the
// vault is picked, and all other vaults are ignored for that
// random selection. weight is ignored if the vault is chosen
// based on its chance.
_chance.clear();
// Weight for this map. When selecting a map, if no map with a
// nonzero chance is picked, one of the other eligible vaults is
// picked with a probability of weight / (sum of weights of all
// eligible vaults).
_weight.clear(DEFAULT_MAP_WEIGHT);
// Clearing the map also zaps map transforms.
map.clear();
mons.clear();
feat_renames.clear();
subvault_places.clear();
}
bool map_def::map_already_used() const
{
return you.uniq_map_names.count(name)
|| env.level_uniq_maps.find(name) !=
env.level_uniq_maps.end()
|| env.new_used_subvault_names.find(name) !=
env.new_used_subvault_names.end()
|| has_any_tag(you.uniq_map_tags.begin(),
you.uniq_map_tags.end())
|| has_any_tag(env.level_uniq_map_tags.begin(),
env.level_uniq_map_tags.end())
|| has_any_tag(env.new_used_subvault_tags.begin(),
env.new_used_subvault_tags.end());
}
bool map_def::valid_item_array_glyph(int gly)
{
return gly >= 'd' && gly <= 'k';
}
int map_def::item_array_glyph_to_slot(int gly)
{
ASSERT(map_def::valid_item_array_glyph(gly));
return gly - 'd';
}
bool map_def::valid_monster_glyph(int gly)
{
return gly >= '0' && gly <= '9';
}
bool map_def::valid_monster_array_glyph(int gly)
{
return gly >= '1' && gly <= '7';
}
int map_def::monster_array_glyph_to_slot(int gly)
{
ASSERT(map_def::valid_monster_array_glyph(gly));
return gly - '1';
}
bool map_def::in_map(const coord_def &c) const
{
return map.in_map(c);
}
int map_def::glyph_at(const coord_def &c) const
{
return map(c);
}
string map_def::name_at(const coord_def &c) const
{
vector<string> names;
names.push_back(name);
for (const subvault_place& subvault : subvault_places)
{
if (c.x >= subvault.tl.x && c.x <= subvault.br.x &&
c.y >= subvault.tl.y && c.y <= subvault.br.y &&
subvault.subvault->in_map(c - subvault.tl))
{
names.push_back(subvault.subvault->name_at(c - subvault.tl));
}
}
return comma_separated_line(names.begin(), names.end(), ", ", ", ");
}
string map_def::desc_or_name() const
{
return description.empty()? name : description;
}
void map_def::write_full(writer& outf) const
{
cache_offset = outf.tell();
marshallUByte(outf, TAG_MAJOR_VERSION);
marshallUByte(outf, TAG_MINOR_VERSION);
marshallString4(outf, name);
prelude.write(outf);
mapchunk.write(outf);
main.write(outf);
validate.write(outf);
veto.write(outf);
epilogue.write(outf);
}
void map_def::read_full(reader& inf, bool check_cache_version)
{
// There's a potential race-condition here:
// - If someone modifies a .des file while there are games in progress,
// - a new Crawl process will overwrite the .dsc.
// - older Crawl processes trying to reading the new .dsc will be hosed.
// We could try to recover from the condition (by locking and
// reloading the index), but it's easier to save the game at this
// point and let the player reload.
const uint8_t major = unmarshallUByte(inf);
const uint8_t minor = unmarshallUByte(inf);
if (major != TAG_MAJOR_VERSION || minor > TAG_MINOR_VERSION)
{
throw map_load_exception(make_stringf(
"Map was built for a different version of Crawl (%s) "
"(map: %d.%d us: %d.%d)",
name.c_str(), int(major), int(minor),
TAG_MAJOR_VERSION, TAG_MINOR_VERSION));
}
string fp_name;
unmarshallString4(inf, fp_name);
if (fp_name != name)
{
throw map_load_exception(make_stringf(
"Map fp_name (%s) != name (%s)!",
fp_name.c_str(), name.c_str()));
}
prelude.read(inf);
mapchunk.read(inf);
main.read(inf);
validate.read(inf);
veto.read(inf);
epilogue.read(inf);
}
int map_def::weight(const level_id &lid) const
{
return _weight.depth_value(lid);
}
map_chance map_def::chance(const level_id &lid) const
{
return _chance.depth_value(lid);
}
string map_def::describe() const
{
return make_stringf("Map: %s\n%s%s%s%s%s%s",
name.c_str(),
prelude.describe("prelude").c_str(),
mapchunk.describe("mapchunk").c_str(),
main.describe("main").c_str(),
validate.describe("validate").c_str(),
veto.describe("veto").c_str(),
epilogue.describe("epilogue").c_str());
}
void map_def::strip()
{
if (index_only)
return;
index_only = true;
map.clear();
mons.clear();
items.clear();
random_mons.clear();
prelude.clear();
mapchunk.clear();
main.clear();
validate.clear();
veto.clear();
epilogue.clear();
feat_renames.clear();
}
void map_def::load()
{
if (!index_only)
return;
const string descache_base = get_descache_path(cache_name, "");
file_lock deslock(descache_base + ".lk", "rb", false);
const string loadfile = descache_base + ".dsc";
reader inf(loadfile, TAG_MINOR_VERSION);
if (!inf.valid())
{
throw map_load_exception(
make_stringf("Map inf is invalid: %s", name.c_str()));
}
inf.advance(cache_offset);
read_full(inf, true);
index_only = false;
}
vector<coord_def> map_def::find_glyph(int glyph) const
{
return map.find_glyph(glyph);
}
coord_def map_def::find_first_glyph(int glyph) const
{
return map.find_first_glyph(glyph);
}
coord_def map_def::find_first_glyph(const string &s) const
{
return map.find_first_glyph(s);
}
void map_def::write_maplines(writer &outf) const
{
map.write_maplines(outf);
}
static void _marshall_map_chance(writer &th, const map_chance &chance)
{
chance.write(th);
}
static map_chance _unmarshall_map_chance(reader &th)
{
map_chance chance;
chance.read(th);
return chance;
}
void map_def::write_index(writer& outf) const
{
if (!cache_offset)
{
end(1, false, "Map %s: can't write index - cache offset not set!",
name.c_str());
}
marshallString4(outf, name);
marshallString4(outf, place_loaded_from.filename);
marshallInt(outf, place_loaded_from.lineno);
marshallShort(outf, orient);
// XXX: This is a hack. See the comment in l-dgn.cc.
marshallShort(outf, static_cast<short>(border_fill_type));
_chance.write(outf, _marshall_map_chance);
_weight.write(outf, marshallInt);
marshallInt(outf, cache_offset);
marshallString4(outf, tags_string());
place.write(outf);
depths.write(outf);
prelude.write(outf);
}
void map_def::read_maplines(reader &inf)
{
map.read_maplines(inf);
}
void map_def::read_index(reader& inf)
{
unmarshallString4(inf, name);
unmarshallString4(inf, place_loaded_from.filename);
place_loaded_from.lineno = unmarshallInt(inf);
orient = static_cast<map_section_type>(unmarshallShort(inf));
// XXX: Hack. See the comment in l-dgn.cc.
border_fill_type =
static_cast<dungeon_feature_type>(unmarshallShort(inf));
_chance = range_chance_t::read(inf, _unmarshall_map_chance);
_weight = range_weight_t::read(inf, unmarshallInt);
cache_offset = unmarshallInt(inf);
string read_tags;
unmarshallString4(inf, read_tags);
set_tags(read_tags);
place.read(inf);
depths.read(inf);
prelude.read(inf);
index_only = true;
}
void map_def::set_file(const string &s)
{
prelude.set_file(s);
mapchunk.set_file(s);
main.set_file(s);
validate.set_file(s);
veto.set_file(s);
epilogue.set_file(s);
file = get_base_filename(s);
cache_name = get_cache_name(s);
}
string map_def::run_lua(bool run_main)
{
dlua_set_map mset(this);
int err = prelude.load(dlua);
if (err == E_CHUNK_LOAD_FAILURE)
lua_pushnil(dlua);
else if (err)
return prelude.orig_error();
if (!dlua.callfn("dgn_run_map", 1, 0))
return rewrite_chunk_errors(dlua.error);
if (run_main)
{
// Run the map chunk to set up the vault's map grid.
err = mapchunk.load(dlua);
if (err == E_CHUNK_LOAD_FAILURE)
lua_pushnil(dlua);
else if (err)
return mapchunk.orig_error();
if (!dlua.callfn("dgn_run_map", 1, 0))
return rewrite_chunk_errors(dlua.error);
// The vault may be non-rectangular with a ragged-right edge; for
// transforms to work right at this point, we must pad out the right
// edge with spaces, so run normalise:
normalise();
// Run the main Lua chunk to set up the rest of the vault
run_hook("pre_main");
err = main.load(dlua);
if (err == E_CHUNK_LOAD_FAILURE)
lua_pushnil(dlua);
else if (err)
return main.orig_error();
if (!dlua.callfn("dgn_run_map", 1, 0))
return rewrite_chunk_errors(dlua.error);
run_hook("post_main");
}
return dlua.error;
}
void map_def::copy_hooks_from(const map_def &other_map, const string &hook_name)
{
const dlua_set_map mset(this);
if (!dlua.callfn("dgn_map_copy_hooks_from", "ss",
other_map.name.c_str(), hook_name.c_str()))
{
mprf(MSGCH_ERROR, "Lua error copying hook (%s) from '%s' to '%s': %s",
hook_name.c_str(), other_map.name.c_str(),
name.c_str(), dlua.error.c_str());
}
}
// Runs Lua hooks registered by the map's Lua code, if any. Returns true if
// no errors occurred while running hooks.
bool map_def::run_hook(const string &hook_name, bool die_on_lua_error)
{
const dlua_set_map mset(this);
if (!dlua.callfn("dgn_map_run_hook", "s", hook_name.c_str()))
{
if (die_on_lua_error)
{
end(1, false, "Lua error running hook '%s' on map '%s': %s",
hook_name.c_str(), name.c_str(),
rewrite_chunk_errors(dlua.error).c_str());
}
else
mprf(MSGCH_ERROR, "Lua error running hook '%s' on map '%s': %s",
hook_name.c_str(), name.c_str(),
rewrite_chunk_errors(dlua.error).c_str());
return false;
}
return true;
}
bool map_def::run_postplace_hook(bool die_on_lua_error)
{
return run_hook("post_place", die_on_lua_error);
}
bool map_def::test_lua_boolchunk(dlua_chunk &chunk, bool defval,
bool die_on_lua_error)
{
bool result = defval;
dlua_set_map mset(this);
int err = chunk.load(dlua);
if (err == E_CHUNK_LOAD_FAILURE)
return result;
else if (err)
{
if (die_on_lua_error)
end(1, false, "Lua error: %s", chunk.orig_error().c_str());
else
mprf(MSGCH_ERROR, "Lua error: %s", chunk.orig_error().c_str());
return result;
}
if (dlua.callfn("dgn_run_map", 1, 1))
dlua.fnreturns(">b", &result);
else
{
if (die_on_lua_error)
{
end(1, false, "Lua error: %s",
rewrite_chunk_errors(dlua.error).c_str());
}
else
{
mprf(MSGCH_ERROR, "Lua error: %s",
rewrite_chunk_errors(dlua.error).c_str());
}
}
return result;
}
bool map_def::test_lua_validate(bool croak)
{
return validate.empty() || test_lua_boolchunk(validate, false, croak);
}
bool map_def::test_lua_veto()
{
return !veto.empty() && test_lua_boolchunk(veto, true);
}
bool map_def::run_lua_epilogue(bool die_on_lua_error)
{
run_hook("pre_epilogue", die_on_lua_error);
const bool epilogue_result =
!epilogue.empty() && test_lua_boolchunk(epilogue, false,
die_on_lua_error);
run_hook("post_epilogue", die_on_lua_error);
return epilogue_result;
}
string map_def::rewrite_chunk_errors(const string &s) const
{
string res = s;
if (prelude.rewrite_chunk_errors(res))
return res;
if (mapchunk.rewrite_chunk_errors(res))
return res;
if (main.rewrite_chunk_errors(res))
return res;
if (validate.rewrite_chunk_errors(res))
return res;
if (veto.rewrite_chunk_errors(res))
return res;
epilogue.rewrite_chunk_errors(res);
return res;
}
string map_def::validate_temple_map()
{
vector<coord_def> altars = find_glyph('B');
if (has_tag_prefix("temple_overflow_"))
{
if (has_tag_prefix("temple_overflow_generic_"))
{
string matching_tag = make_stringf("temple_overflow_generic_%u",
(unsigned int) altars.size());
if (!has_tag(matching_tag))
{
return make_stringf(
"Temple ('%s') has %u altars and a "
"'temple_overflow_generic_' tag, but does not match the "
"number of altars: should have at least '%s'.",
tags_string().c_str(),
(unsigned int) altars.size(),
matching_tag.c_str());
}
}
else
{
// Assume specialised altar vaults are set up correctly.
return "";
}
}
if (altars.empty())
return "Temple vault must contain at least one altar.";
// TODO: check for substitutions and shuffles
vector<coord_def> b_glyphs = map.find_glyph('B');
for (auto c : b_glyphs)
{
const keyed_mapspec *spec = map.mapspec_at(c);
if (spec != nullptr && !spec->feat.feats.empty())
return "Can't change feat 'B' in temple (KFEAT)";
}
vector<god_type> god_list = temple_god_list();
if (altars.size() > god_list.size())
return "Temple vault has too many altars";
return "";
}
string map_def::validate_map_placeable()
{
if (has_depth() || !place.empty())
return "";
// Ok, the map wants to be placed by tag. In this case it should have
// at least one tag that's not a map flag.
bool has_selectable_tag = false;
for (const string &piece : get_tags())
{
if (_map_tag_is_selectable(piece))
{
has_selectable_tag = true;
break;
}
}
return has_selectable_tag? "" :
make_stringf("Map '%s' has no DEPTH, no PLACE and no "
"selectable tag in '%s'",
name.c_str(), tags_string().c_str());
}
/**
* Check to see if the vault can connect normally to the rest of the dungeon.
*/
bool map_def::has_exit() const
{
map_def dup = *this;
for (int y = 0, cheight = map.height(); y < cheight; ++y)
for (int x = 0, cwidth = map.width(); x < cwidth; ++x)
{
if (!map.in_map(coord_def(x, y)))
continue;
const char glyph = map.glyph(x, y);
dungeon_feature_type feat =
map_feature_at(&dup, coord_def(x, y), -1);
// If we have a stair, assume the vault can be disconnected.
if (feat_is_stair(feat) && !feat_is_escape_hatch(feat))
return true;
const bool non_floating =
glyph == '@' || glyph == '=' || glyph == '+';
if (non_floating
|| !feat_is_solid(feat) || feat_is_closed_door(feat))
{
if (x == 0 || x == cwidth - 1 || y == 0 || y == cheight - 1)
return true;
for (orth_adjacent_iterator ai(coord_def(x, y)); ai; ++ai)
if (!map.in_map(*ai))
return true;
}
}
return false;
}
string map_def::validate_map_def(const depth_ranges &default_depths)
{
unwind_bool valid_flag(validating_map_flag, true);
string err = run_lua(true);
if (!err.empty())
return err;
fixup();
resolve();
test_lua_validate(true);
run_lua_epilogue(true);
if (!has_depth() && !lc_default_depths.empty())
depths.add_depths(lc_default_depths);
if (place.is_usable_in(level_id(BRANCH_TEMPLE))
|| has_tag_prefix("temple_overflow_"))
{
err = validate_temple_map();
if (!err.empty())
return err;
}
if (has_tag("overwrite_floor_cell") && (map.width() != 1 || map.height() != 1))
return "Map tagged 'overwrite_floor_cell' must be 1x1";
// Abyssal vaults have additional size and orientation restrictions.
if (has_tag("abyss") || has_tag("abyss_rune"))
{
if (orient == MAP_ENCOMPASS)
{
return make_stringf(
"Map '%s' cannot use 'encompass' orientation in the abyss",
name.c_str());
}
const int max_abyss_map_width =
GXM / 2 - MAPGEN_BORDER - ABYSS_AREA_SHIFT_RADIUS;
const int max_abyss_map_height =
GYM / 2 - MAPGEN_BORDER - ABYSS_AREA_SHIFT_RADIUS;
if (map.width() > max_abyss_map_width
|| map.height() > max_abyss_map_height)
{
return make_stringf(
"Map '%s' is too big for the Abyss: %dx%d - max %dx%d",
name.c_str(),
map.width(), map.height(),
max_abyss_map_width, max_abyss_map_height);
}
// Unless both height and width fit in the smaller dimension,
// map rotation will be disallowed.
const int dimension_lower_bound =
min(max_abyss_map_height, max_abyss_map_width);
if ((map.width() > dimension_lower_bound
|| map.height() > dimension_lower_bound)
&& !has_tag("no_rotate"))
{
add_tags("no_rotate");
}
}
if (orient == MAP_FLOAT || is_minivault())
{
if (map.width() > GXM - MAPGEN_BORDER * 2
|| map.height() > GYM - MAPGEN_BORDER * 2)
{
return make_stringf(
"%s '%s' is too big: %dx%d - max %dx%d",
is_minivault()? "Minivault" : "Float",
name.c_str(),
map.width(), map.height(),
GXM - MAPGEN_BORDER * 2,
GYM - MAPGEN_BORDER * 2);
}
}
else
{
if (map.width() > GXM || map.height() > GYM)
{
return make_stringf(
"Map '%s' is too big: %dx%d - max %dx%d",
name.c_str(),
map.width(), map.height(),
GXM, GYM);
}
}
switch (orient)
{
case MAP_NORTH: case MAP_SOUTH:
if (map.height() > GYM * 2 / 3)
{
return make_stringf("Map too large - height %d (max %d)",
map.height(), GYM * 2 / 3);
}
break;
case MAP_EAST: case MAP_WEST:
if (map.width() > GXM * 2 / 3)
{
return make_stringf("Map too large - width %d (max %d)",
map.width(), GXM * 2 / 3);
}
break;
case MAP_NORTHEAST: case MAP_SOUTHEAST:
case MAP_NORTHWEST: case MAP_SOUTHWEST:
case MAP_FLOAT: case MAP_CENTRE:
if (map.width() > GXM * 2 / 3 || map.height() > GYM * 2 / 3)
{
return make_stringf("Map too large - %dx%d (max %dx%d)",
map.width(), map.height(),
GXM * 2 / 3, GYM * 2 / 3);
}
break;
default:
break;
}
// Encompass vaults, pure subvaults, and dummy vaults are exempt from
// exit-checking.
if (orient != MAP_ENCOMPASS && !has_tag("unrand") && !has_tag("dummy")
&& !has_tag("no_exits") && map.width() > 0 && map.height() > 0)
{
if (!has_exit())
{
return make_stringf(
"Map '%s' has no (possible) exits; use TAGS: no_exits if "
"this is intentional",
name.c_str());
}
}
dlua_set_map dl(this);
return validate_map_placeable();
}
bool map_def::is_usable_in(const level_id &lid) const
{
return depths.is_usable_in(lid);
}
void map_def::add_depth(const level_range &range)
{
depths.add_depth(range);
}
bool map_def::has_depth() const
{
return !depths.empty();
}
bool map_def::is_minivault() const
{
return has_tag("minivault");
}
// Returns true if the map is a layout that allows other vaults to be
// built on it.
bool map_def::is_overwritable_layout() const
{
return has_tag("overwritable");
}
// Tries to dock a floating vault - push it to one edge of the level.
// Docking will only succeed if two contiguous edges are all x/c/b/v
// (other walls prevent docking). If the vault's width is > GXM*2/3,
// it's also eligible for north/south docking, and if the height >
// GYM*2/3, it's eligible for east/west docking. Although docking is
// similar to setting the orientation, it doesn't affect 'orient'.
coord_def map_def::float_dock()
{
const map_section_type orients[] =
{ MAP_NORTH, MAP_SOUTH, MAP_EAST, MAP_WEST,
MAP_NORTHEAST, MAP_SOUTHEAST, MAP_NORTHWEST, MAP_SOUTHWEST };
map_section_type which_orient = MAP_NONE;
int norients = 0;
for (map_section_type sec : orients)
{
if (map.solid_borders(sec) && can_dock(sec)
&& one_chance_in(++norients))
{
which_orient = sec;
}
}
if (which_orient == MAP_NONE || which_orient == MAP_FLOAT)
return coord_def(-1, -1);
dprf(DIAG_DNGN, "Docking floating vault to %s",
map_section_name(which_orient));
return dock_pos(which_orient);
}
coord_def map_def::dock_pos(map_section_type norient) const
{
const int minborder = 6;
switch (norient)
{
case MAP_NORTH:
return coord_def((GXM - map.width()) / 2, minborder);
case MAP_SOUTH:
return coord_def((GXM - map.width()) / 2,
GYM - minborder - map.height());
case MAP_EAST:
return coord_def(GXM - minborder - map.width(),
(GYM - map.height()) / 2);
case MAP_WEST:
return coord_def(minborder,
(GYM - map.height()) / 2);
case MAP_NORTHEAST:
return coord_def(GXM - minborder - map.width(), minborder);
case MAP_NORTHWEST:
return coord_def(minborder, minborder);
case MAP_SOUTHEAST:
return coord_def(GXM - minborder - map.width(),
GYM - minborder - map.height());
case MAP_SOUTHWEST:
return coord_def(minborder,
GYM - minborder - map.height());
case MAP_CENTRE:
return coord_def((GXM - map.width()) / 2,
(GYM - map.height()) / 2);
default:
return coord_def(-1, -1);
}
}
bool map_def::can_dock(map_section_type norient) const
{
switch (norient)
{
case MAP_NORTH: case MAP_SOUTH:
return map.width() > GXM * 2 / 3;
case MAP_EAST: case MAP_WEST:
return map.height() > GYM * 2 / 3;
default:
return true;
}
}
coord_def map_def::float_random_place() const
{
// Try to leave enough around the float for roomification.
int minhborder = MAPGEN_BORDER + 11,
minvborder = minhborder;
if (GXM - 2 * minhborder < map.width())
minhborder = (GXM - map.width()) / 2 - 1;
if (GYM - 2 * minvborder < map.height())
minvborder = (GYM - map.height()) / 2 - 1;
coord_def result;
result.x = random_range(minhborder, GXM - minhborder - map.width());
result.y = random_range(minvborder, GYM - minvborder - map.height());
return result;
}
point_vector map_def::anchor_points() const
{
point_vector points;
for (int y = 0, cheight = map.height(); y < cheight; ++y)
for (int x = 0, cwidth = map.width(); x < cwidth; ++x)
if (map.glyph(x, y) == '@')
points.emplace_back(x, y);
return points;
}
coord_def map_def::float_aligned_place() const
{
const point_vector our_anchors = anchor_points();
const coord_def fail(-1, -1);
dprf(DIAG_DNGN, "Aligning floating vault with %u points vs %u"
" reference points",
(unsigned int)our_anchors.size(),
(unsigned int)map_anchor_points.size());
// Mismatch in the number of points we have to align, bail.
if (our_anchors.size() != map_anchor_points.size())
return fail;
// Align first point of both vectors, then check that the others match.
const coord_def pos = map_anchor_points[0] - our_anchors[0];
for (int i = 1, psize = map_anchor_points.size(); i < psize; ++i)
if (pos + our_anchors[i] != map_anchor_points[i])
return fail;
// Looking good, check bounds.
if (!map_bounds(pos) || !map_bounds(pos + size() - 1))
return fail;
// Go us!
return pos;
}
coord_def map_def::float_place()
{
ASSERT(orient == MAP_FLOAT);
coord_def pos(-1, -1);
if (!map_anchor_points.empty())
pos = float_aligned_place();
else
{
if (coinflip())
pos = float_dock();
if (pos.x == -1)
pos = float_random_place();
}
return pos;
}
void map_def::hmirror()
{
if (has_tag("no_hmirror"))
return;
dprf(DIAG_DNGN, "Mirroring %s horizontally.", name.c_str());
map.hmirror();
switch (orient)
{
case MAP_EAST: orient = MAP_WEST; break;
case MAP_NORTHEAST: orient = MAP_NORTHWEST; break;
case MAP_SOUTHEAST: orient = MAP_SOUTHWEST; break;
case MAP_WEST: orient = MAP_EAST; break;
case MAP_NORTHWEST: orient = MAP_NORTHEAST; break;
case MAP_SOUTHWEST: orient = MAP_SOUTHEAST; break;
default: break;
}
for (subvault_place &sv : subvault_places)
{
coord_def old_tl = sv.tl;
coord_def old_br = sv.br;
sv.tl.x = map.width() - 1 - old_br.x;
sv.br.x = map.width() - 1 - old_tl.x;
sv.subvault->map.hmirror();
}
}
void map_def::vmirror()
{
if (has_tag("no_vmirror"))
return;
dprf(DIAG_DNGN, "Mirroring %s vertically.", name.c_str());
map.vmirror();
switch (orient)
{
case MAP_NORTH: orient = MAP_SOUTH; break;
case MAP_NORTHEAST: orient = MAP_SOUTHEAST; break;
case MAP_NORTHWEST: orient = MAP_SOUTHWEST; break;
case MAP_SOUTH: orient = MAP_NORTH; break;
case MAP_SOUTHEAST: orient = MAP_NORTHEAST; break;
case MAP_SOUTHWEST: orient = MAP_NORTHWEST; break;
default: break;
}
for (subvault_place& sv : subvault_places)
{
coord_def old_tl = sv.tl;
coord_def old_br = sv.br;
sv.tl.y = map.height() - 1 - old_br.y;
sv.br.y = map.height() - 1 - old_tl.y;
sv.subvault->map.vmirror();
}
}
void map_def::rotate(bool clock)
{
if (has_tag("no_rotate"))
return;
#define GMINM ((GXM) < (GYM)? (GXM) : (GYM))
// Make sure the largest dimension fits in the smaller map bound.
if (map.width() <= GMINM && map.height() <= GMINM)
{
dprf(DIAG_DNGN, "Rotating %s %sclockwise.",
name.c_str(), !clock? "anti-" : "");
map.rotate(clock);
// Orientation shifts for clockwise rotation:
const map_section_type clockrotate_orients[][2] =
{
{ MAP_NORTH, MAP_EAST },
{ MAP_NORTHEAST, MAP_SOUTHEAST },
{ MAP_EAST, MAP_SOUTH },
{ MAP_SOUTHEAST, MAP_SOUTHWEST },
{ MAP_SOUTH, MAP_WEST },
{ MAP_SOUTHWEST, MAP_NORTHWEST },
{ MAP_WEST, MAP_NORTH },
{ MAP_NORTHWEST, MAP_NORTHEAST },
};
const int nrots = ARRAYSZ(clockrotate_orients);
const int refindex = !clock;
for (int i = 0; i < nrots; ++i)
if (orient == clockrotate_orients[i][refindex])
{
orient = clockrotate_orients[i][!refindex];
break;
}
for (subvault_place& sv : subvault_places)
{
coord_def p1, p2;
if (clock) //Clockwise
{
p1 = coord_def(map.width() - 1 - sv.tl.y, sv.tl.x);
p2 = coord_def(map.width() - 1 - sv.br.y, sv.br.x);
}
else
{
p1 = coord_def(sv.tl.y, map.height() - 1 - sv.tl.x);
p2 = coord_def(sv.br.y, map.height() - 1 - sv.br.x);
}
sv.tl = coord_def(min(p1.x, p2.x), min(p1.y, p2.y));
sv.br = coord_def(max(p1.x, p2.x), max(p1.y, p2.y));
sv.subvault->map.rotate(clock);
}
}
}
void map_def::normalise()
{
// Pad out lines that are shorter than max.
map.normalise(' ');
}
string map_def::resolve()
{
dlua_set_map dl(this);
return "";
}
void map_def::fixup()
{
normalise();
// Fixup minivaults into floating vaults tagged "minivault".
if (orient == MAP_NONE)
{
orient = MAP_FLOAT;
add_tags("minivault");
}
}
bool map_def::has_tag(const set<string> &tagswanted) const
{
if (tags.empty() || tagswanted.size() == 0)
return false;
for (const string &tag : tagswanted)
if (!tags.count(tag))
return false;
return true;
}
bool map_def::has_tag(const string &tagswanted) const
{
return has_tag(parse_tags(tagswanted));
}
bool map_def::has_tag_prefix(const string &prefix) const
{
if (prefix.empty())
return false;
for (const auto &tag : tags)
if (starts_with(tag, prefix))
return true;
return false;
}
bool map_def::has_tag_suffix(const string &suffix) const
{
if (suffix.empty())
return false;
for (const auto &tag : tags)
if (ends_with(tag, suffix))
return true;
return false;
}
const set<string> map_def::get_tags() const
{
return tags;
}
void map_def::add_tags(const string &tag)
{
auto parsed_tags = parse_tags(tag);
tags.insert(parsed_tags.begin(), parsed_tags.end());
}
bool map_def::remove_tags(const string &tag)
{
bool removed = false;
auto parsed_tags = parse_tags(tag);
for (auto &t : parsed_tags)
removed = tags.erase(t) || removed; // would iterator overload be ok?
return removed;
}
void map_def::clear_tags()
{
tags.clear();
}
void map_def::set_tags(const string &tag)
{
clear_tags();
add_tags(tag);
}
string map_def::tags_string() const
{
return join_strings(tags.begin(), tags.end());
}
keyed_mapspec *map_def::mapspec_at(const coord_def &c)
{
return map.mapspec_at(c);
}
const keyed_mapspec *map_def::mapspec_at(const coord_def &c) const
{
return map.mapspec_at(c);
}
string map_def::subvault_from_tagstring(const string &sub)
{
string s = trimmed_string(sub);
if (s.empty())
return "";
int sep = 0;
string key;
string substitute;
string err = mapdef_split_key_item(sub, &key, &sep, &substitute, -1);
if (!err.empty())
return err;
// Randomly picking a different vault per-glyph is not supported.
if (sep != ':')
return "SUBVAULT does not support '='. Use ':' instead.";
map_string_list vlist;
err = _parse_weighted_str<map_string_list>(substitute, vlist);
if (!err.empty())
return err;
bool fix = false;
string_spec spec(key, fix, vlist);
// Although it's unfortunate to not be able to validate subvaults except a
// run-time, this allows subvaults to reference maps by tag that may not
// have been loaded yet.
if (!is_validating())
err = apply_subvault(spec);
if (!err.empty())
return err;
return "";
}
static void _register_subvault(const string &name, const string &spaced_tags)
{
auto parsed_tags = parse_tags(spaced_tags);
if (!parsed_tags.count("allow_dup") || parsed_tags.count("luniq"))
env.new_used_subvault_names.insert(name);
for (const string &tag : parsed_tags)
if (starts_with(tag, "uniq_") || starts_with(tag, "luniq_"))
env.new_used_subvault_tags.insert(tag);
}
static void _reset_subvault_stack(const int reg_stack)
{
env.new_subvault_names.resize(reg_stack);
env.new_subvault_tags.resize(reg_stack);
env.new_used_subvault_names.clear();
env.new_used_subvault_tags.clear();
for (int i = 0; i < reg_stack; i++)
{
_register_subvault(env.new_subvault_names[i],
env.new_subvault_tags[i]);
}
}
string map_def::apply_subvault(string_spec &spec)
{
// Find bounding box for key glyphs
coord_def tl, br;
if (!map.find_bounds(spec.key.c_str(), tl, br))
{
// No glyphs, so do nothing.
return "";
}
int vwidth = br.x - tl.x + 1;
int vheight = br.y - tl.y + 1;
Matrix<bool> flags(vwidth, vheight);
map.fill_mask_matrix(spec.key, tl, br, flags);
// Remember the subvault registration pointer, so we can clear it.
const int reg_stack = env.new_subvault_names.size();
ASSERT(reg_stack == (int)env.new_subvault_tags.size());
ASSERT(reg_stack >= (int)env.new_used_subvault_names.size());
const int max_tries = 100;
int ntries = 0;
string tag = spec.get_property();
while (++ntries <= max_tries)
{
// Each iteration, restore tags and names. This is because this vault
// may successfully load a subvault (registering its tag and name), but
// then itself fail.
_reset_subvault_stack(reg_stack);
const map_def *orig = random_map_for_tag(tag, true);
if (!orig)
return make_stringf("No vault found for tag '%s'", tag.c_str());
map_def vault = *orig;
vault.load();
// Temporarily set the subvault mask so this subvault can know
// that it is being generated as a subvault.
vault.svmask = &flags;
if (!resolve_subvault(vault))
continue;
ASSERT(vault.map.width() <= vwidth);
ASSERT(vault.map.height() <= vheight);
const map_corner_t subvault_corners =
map.merge_subvault(tl, br, flags, vault);
copy_hooks_from(vault, "post_place");
env.new_subvault_names.push_back(vault.name);
const string vault_tags = vault.tags_string();
env.new_subvault_tags.push_back(vault_tags);
_register_subvault(vault.name, vault_tags);
subvault_places.emplace_back(subvault_corners.first,
subvault_corners.second, vault);
return "";
}
// Failure, drop subvault registrations.
_reset_subvault_stack(reg_stack);
return make_stringf("Could not fit '%s' in (%d,%d) to (%d, %d).",
tag.c_str(), tl.x, tl.y, br.x, br.y);
}
bool map_def::is_subvault() const
{
return svmask != nullptr;
}
void map_def::apply_subvault_mask()
{
if (!svmask)
return;
map.clear();
map.extend(subvault_width(), subvault_height(), ' ');
for (rectangle_iterator ri(map.get_iter()); ri; ++ri)
{
const coord_def mc = *ri;
if (subvault_cell_valid(mc))
map(mc) = '.';
else
map(mc) = ' ';
}
}
bool map_def::subvault_cell_valid(const coord_def &c) const
{
if (!svmask)
return false;
if (c.x < 0 || c.x >= subvault_width()
|| c.y < 0 || c.y >= subvault_height())
{
return false;
}
return (*svmask)(c.x, c.y);
}
int map_def::subvault_width() const
{
if (!svmask)
return 0;
return svmask->width();
}
int map_def::subvault_height() const
{
if (!svmask)
return 0;
return svmask->height();
}
int map_def::subvault_mismatch_count(const coord_def &offset) const
{
int count = 0;
if (!is_subvault())
return count;
for (rectangle_iterator ri(map.get_iter()); ri; ++ri)
{
// Coordinate in the subvault
const coord_def sc = *ri;
// Coordinate in the mask
const coord_def mc = sc + offset;
bool valid_subvault_cell = (map(sc) != ' ');
bool valid_mask = (*svmask)(mc.x, mc.y);
if (valid_subvault_cell && !valid_mask)
count++;
}
return count;
}
///////////////////////////////////////////////////////////////////
// mons_list
//
mons_list::mons_list() : mons()
{
}
mons_spec mons_list::pick_monster(mons_spec_slot &slot)
{
int totweight = 0;
mons_spec pick;
for (const auto &spec : slot.mlist)
{
const int weight = spec.genweight;
if (x_chance_in_y(weight, totweight += weight))
pick = spec;
}
#if TAG_MAJOR_VERSION == 34
// Force rebuild of the des cache to drop this check.
if ((int)pick.type < -1)
pick = (monster_type)(-100 - (int)pick.type);
#endif
if (slot.fix_slot)
{
slot.mlist.clear();
slot.mlist.push_back(pick);
slot.fix_slot = false;
}
return pick;
}
mons_spec mons_list::get_monster(int index)
{
if (index < 0 || index >= (int)mons.size())
return mons_spec(RANDOM_MONSTER);
return pick_monster(mons[index]);
}
mons_spec mons_list::get_monster(int slot_index, int list_index) const
{
if (slot_index < 0 || slot_index >= (int)mons.size())
return mons_spec(RANDOM_MONSTER);
const mons_spec_list &list = mons[slot_index].mlist;
if (list_index < 0 || list_index >= (int)list.size())
return mons_spec(RANDOM_MONSTER);
return list[list_index];
}
void mons_list::clear()
{
mons.clear();
}
void mons_list::set_from_slot(const mons_list &list, int slot_index)
{
clear();
// Don't set anything if an invalid index.
// Future calls to get_monster will just return a random monster.
if (slot_index < 0 || (size_t)slot_index >= list.mons.size())
return;
mons.push_back(list.mons[slot_index]);
}
void mons_list::parse_mons_spells(mons_spec &spec, vector<string> &spells)
{
spec.explicit_spells = true;
for (const string &slotspec : spells)
{
monster_spells cur_spells;
const vector<string> spell_names(split_string(";", slotspec));
for (unsigned i = 0, ssize = spell_names.size(); i < ssize; ++i)
{
cur_spells.emplace_back();
const string spname(
lowercase_string(replace_all_of(spell_names[i], "_", " ")));
if (spname.empty() || spname == "." || spname == "none"
|| spname == "no spell")
{
cur_spells[i].spell = SPELL_NO_SPELL;
}
else
{
const vector<string> slot_vals = split_string(".", spname);
if (slot_vals.size() < 2)
{
error = make_stringf(
"Invalid spell slot format: '%s' in '%s'",
spname.c_str(), slotspec.c_str());
return;
}
const spell_type sp(spell_by_name(slot_vals[0]));
if (sp == SPELL_NO_SPELL)
{
error = make_stringf("Unknown spell name: '%s' in '%s'",
slot_vals[0].c_str(),
slotspec.c_str());
return;
}
if (!is_valid_mon_spell(sp))
{
error = make_stringf("Not a monster spell: '%s'",
slot_vals[0].c_str());
return;
}
cur_spells[i].spell = sp;
const int freq = atoi(slot_vals[1].c_str());
if (freq <= 0)
{
error = make_stringf("Need a positive spell frequency;"
"got '%s' in '%s'",
slot_vals[1].c_str(),
spname.c_str());
return;
}
cur_spells[i].freq = freq;
for (size_t j = 2; j < slot_vals.size(); j++)
{
if (slot_vals[j] == "emergency")
cur_spells[i].flags |= MON_SPELL_EMERGENCY;
if (slot_vals[j] == "natural")
cur_spells[i].flags |= MON_SPELL_NATURAL;
if (slot_vals[j] == "magical")
cur_spells[i].flags |= MON_SPELL_MAGICAL;
if (slot_vals[j] == "wizard")
cur_spells[i].flags |= MON_SPELL_WIZARD;
if (slot_vals[j] == "priest")
cur_spells[i].flags |= MON_SPELL_PRIEST;
if (slot_vals[j] == "breath")
cur_spells[i].flags |= MON_SPELL_BREATH;
if (slot_vals[j] == "no silent")
cur_spells[i].flags |= MON_SPELL_NO_SILENT;
if (slot_vals[j] == "instant")
cur_spells[i].flags |= MON_SPELL_INSTANT;
if (slot_vals[j] == "noisy")
cur_spells[i].flags |= MON_SPELL_NOISY;
if (slot_vals[j] == "short range")
cur_spells[i].flags |= MON_SPELL_SHORT_RANGE;
if (slot_vals[j] == "long range")
cur_spells[i].flags |= MON_SPELL_LONG_RANGE;
}
if (!(cur_spells[i].flags & MON_SPELL_TYPE_MASK))
{
error = make_stringf(
"Spell slot '%s' missing a casting type",
spname.c_str());
return;
}
}
}
spec.spells.push_back(cur_spells);
}
}
mon_enchant mons_list::parse_ench(string &ench_str, bool perm)
{
vector<string> ep = split_string(":", ench_str);
if (ep.size() > (perm ? 2 : 3))
{
error = make_stringf("bad %sench specifier: \"%s\"",
perm ? "perm_" : "",
ench_str.c_str());
return mon_enchant();
}
enchant_type et = name_to_ench(ep[0].c_str());
if (et == ENCH_NONE)
{
error = make_stringf("unknown ench: \"%s\"", ep[0].c_str());
return mon_enchant();
}
int deg = 0, dur = perm ? INFINITE_DURATION : 0;
if (ep.size() > 1 && !ep[1].empty())
if (!parse_int(ep[1].c_str(), deg))
{
error = make_stringf("invalid deg in ench specifier \"%s\"",
ench_str.c_str());
return mon_enchant();
}
if (ep.size() > 2 && !ep[2].empty())
if (!parse_int(ep[2].c_str(), dur))
{
error = make_stringf("invalid dur in ench specifier \"%s\"",
ench_str.c_str());
return mon_enchant();
}
return mon_enchant(et, deg, 0, dur);
}
mons_list::mons_spec_slot mons_list::parse_mons_spec(string spec)
{
mons_spec_slot slot;
slot.fix_slot = strip_tag(spec, "fix_slot");
vector<string> specs = split_string("/", spec);
for (const string &monspec : specs)
{
string s(monspec);
mons_spec mspec;
vector<string> spells(strip_multiple_tag_prefix(s, "spells:"));
if (!spells.empty())
{
parse_mons_spells(mspec, spells);
if (!error.empty())
return slot;
}
vector<string> parts = split_string(";", s);
if (parts.size() == 0)
{
error = make_stringf("Not enough non-semicolons for '%s' spec.",
s.c_str());
return slot;
}
string mon_str = parts[0];
if (parts.size() > 2)
{
error = make_stringf("Too many semi-colons for '%s' spec.",
mon_str.c_str());
return slot;
}
else if (parts.size() == 2)
{
// TODO: Allow for a "fix_slot" type tag which will cause
// all monsters generated from this spec to have the
// exact same equipment.
string items_str = parts[1];
items_str = replace_all(items_str, "|", "/");
vector<string> segs = split_string(".", items_str);
if (segs.size() > NUM_MONSTER_SLOTS)
{
error = make_stringf("More items than monster item slots "
"for '%s'.", mon_str.c_str());
return slot;
}
for (const string &seg : segs)
{
error = mspec.items.add_item(seg, false);
if (!error.empty())
return slot;
}
}
mspec.genweight = find_weight(mon_str);
if (mspec.genweight == TAG_UNFOUND || mspec.genweight <= 0)
mspec.genweight = 10;
mspec.generate_awake = strip_tag(mon_str, "generate_awake");
mspec.patrolling = strip_tag(mon_str, "patrolling");
mspec.band = strip_tag(mon_str, "band");
const string att = strip_tag_prefix(mon_str, "att:");
if (att.empty() || att == "hostile")
mspec.attitude = ATT_HOSTILE;
else if (att == "friendly")
mspec.attitude = ATT_FRIENDLY;
else if (att == "good_neutral")
mspec.attitude = ATT_GOOD_NEUTRAL;
else if (att == "fellow_slime" || att == "strict_neutral")
mspec.attitude = ATT_STRICT_NEUTRAL;
else if (att == "neutral")
mspec.attitude = ATT_NEUTRAL;
// Useful for summoned monsters.
if (strip_tag(mon_str, "seen"))
mspec.extra_monster_flags |= MF_SEEN;
if (strip_tag(mon_str, "always_corpse"))
mspec.props["always_corpse"] = true;
if (strip_tag(mon_str, NEVER_CORPSE_KEY))
mspec.props[NEVER_CORPSE_KEY] = true;
if (!mon_str.empty() && isadigit(mon_str[0]))
{
// Look for space after initial digits.
string::size_type pos = mon_str.find_first_not_of("0123456789");
if (pos != string::npos && mon_str[pos] == ' ')
{
const string mcount = mon_str.substr(0, pos);
const int count = atoi(mcount.c_str()); // safe atoi()
if (count >= 1 && count <= 99)
mspec.quantity = count;
mon_str = mon_str.substr(pos);
}
}
// place:Elf:$ to choose monsters appropriate for that level,
// for example.
const string place = strip_tag_prefix(mon_str, "place:");
if (!place.empty())
{
try
{
mspec.place = level_id::parse_level_id(place);
}
catch (const bad_level_id &err)
{
error = err.what();
return slot;
}
}
mspec.hd = min(100, strip_number_tag(mon_str, "hd:"));
if (mspec.hd == TAG_UNFOUND)
mspec.hd = 0;
mspec.hp = strip_number_tag(mon_str, "hp:");
if (mspec.hp == TAG_UNFOUND)
mspec.hp = 0;
int dur = strip_number_tag(mon_str, "dur:");
if (dur == TAG_UNFOUND)
dur = 0;
else if (dur < 1 || dur > 6)
dur = 0;
mspec.abjuration_duration = dur;
string shifter_name = replace_all_of(strip_tag_prefix(mon_str, "shifter:"), "_", " ");
if (!shifter_name.empty())
{
mspec.initial_shifter = get_monster_by_name(shifter_name);
if (mspec.initial_shifter == MONS_PROGRAM_BUG)
mspec.initial_shifter = RANDOM_MONSTER;
}
int summon_type = 0;
string s_type = strip_tag_prefix(mon_str, "sum:");
if (!s_type.empty())
{
// In case of spells!
s_type = replace_all_of(s_type, "_", " ");
summon_type = static_cast<int>(str_to_summon_type(s_type));
if (summon_type == SPELL_NO_SPELL)
{
error = make_stringf("bad monster summon type: \"%s\"",
s_type.c_str());
return slot;
}
if (mspec.abjuration_duration == 0)
{
error = "marked summon with no duration";
return slot;
}
}
mspec.summon_type = summon_type;
string non_actor_summoner = strip_tag_prefix(mon_str, "nas:");
if (!non_actor_summoner.empty())
{
non_actor_summoner = replace_all_of(non_actor_summoner, "_", " ");
mspec.non_actor_summoner = non_actor_summoner;
if (mspec.abjuration_duration == 0)
{
error = "marked summon with no duration";
return slot;
}
}
string colour = strip_tag_prefix(mon_str, "col:");
if (!colour.empty())
{
if (colour == "any")
mspec.colour = COLOUR_UNDEF;
else
{
mspec.colour = str_to_colour(colour, COLOUR_UNDEF, false, true);
if (mspec.colour == COLOUR_UNDEF)
{
error = make_stringf("bad monster colour \"%s\" in \"%s\"",
colour.c_str(), monspec.c_str());
return slot;
}
}
}
string mongod = strip_tag_prefix(mon_str, "god:");
if (!mongod.empty())
{
const string god_name(replace_all_of(mongod, "_", " "));
mspec.god = str_to_god(god_name);
if (mspec.god == GOD_NO_GOD)
{
error = make_stringf("bad monster god: \"%s\"",
god_name.c_str());
return slot;
}
if (strip_tag(mon_str, "god_gift"))
mspec.god_gift = true;
}
string tile = strip_tag_prefix(mon_str, "tile:");
if (!tile.empty())
{
tileidx_t index;
if (!tile_player_index(tile.c_str(), &index))
{
error = make_stringf("bad tile name: \"%s\".", tile.c_str());
return slot;
}
// Store name along with the tile.
mspec.props["monster_tile_name"].get_string() = tile;
mspec.props["monster_tile"] = short(index);
}
string dbname = strip_tag_prefix(mon_str, "dbname:");
if (!dbname.empty())
{
dbname = replace_all_of(dbname, "_", " ");
mspec.props["dbname"].get_string() = dbname;
}
string name = strip_tag_prefix(mon_str, "name:");
if (!name.empty())
{
name = replace_all_of(name, "_", " ");
mspec.monname = name;
if (strip_tag(mon_str, "name_suffix")
|| strip_tag(mon_str, "n_suf"))
{
mspec.extra_monster_flags |= MF_NAME_SUFFIX;
}
else if (strip_tag(mon_str, "name_adjective")
|| strip_tag(mon_str, "n_adj"))
{
mspec.extra_monster_flags |= MF_NAME_ADJECTIVE;
}
else if (strip_tag(mon_str, "name_replace")
|| strip_tag(mon_str, "n_rpl"))
{
mspec.extra_monster_flags |= MF_NAME_REPLACE;
}
if (strip_tag(mon_str, "name_definite")
|| strip_tag(mon_str, "n_the"))
{
mspec.extra_monster_flags |= MF_NAME_DEFINITE;
}
// Reasoning for setting more than one flag: suffixes and
// adjectives need NAME_DESCRIPTOR to get proper grammar,
// and definite names do nothing with the description unless
// NAME_DESCRIPTOR is also set.
const auto name_flags = mspec.extra_monster_flags & MF_NAME_MASK;
const bool need_name_desc =
name_flags == MF_NAME_SUFFIX
|| name_flags == MF_NAME_ADJECTIVE
|| (mspec.extra_monster_flags & MF_NAME_DEFINITE);
if (strip_tag(mon_str, "name_descriptor")
|| strip_tag(mon_str, "n_des")
|| need_name_desc)
{
mspec.extra_monster_flags |= MF_NAME_DESCRIPTOR;
}
if (strip_tag(mon_str, "name_species")
|| strip_tag(mon_str, "n_spe"))
{
mspec.extra_monster_flags |= MF_NAME_SPECIES;
}
if (strip_tag(mon_str, "name_zombie")
|| strip_tag(mon_str, "n_zom"))
{
mspec.extra_monster_flags |= MF_NAME_ZOMBIE;
}
if (strip_tag(mon_str, "name_nocorpse")
|| strip_tag(mon_str, "n_noc"))
{
mspec.extra_monster_flags |= MF_NAME_NOCORPSE;
}
}
string ench_str;
while (!(ench_str = strip_tag_prefix(mon_str, "ench:")).empty())
{
mspec.ench.push_back(parse_ench(ench_str, false));
if (!error.empty())
return slot;
}
while (!(ench_str = strip_tag_prefix(mon_str, "perm_ench:")).empty())
{
mspec.ench.push_back(parse_ench(ench_str, true));
if (!error.empty())
return slot;
}
trim_string(mon_str);
if (mon_str == "8")
mspec.type = RANDOM_SUPER_OOD;
else if (mon_str == "9")
mspec.type = RANDOM_MODERATE_OOD;
else if (mspec.place.is_valid())
{
// For monster specs such as place:Orc:4 zombie, we may
// have a monster modifier, in which case we set the
// modifier in monbase.
const mons_spec nspec = mons_by_name("orc " + mon_str);
if (nspec.type != MONS_PROGRAM_BUG)
{
// Is this a modified monster?
if (nspec.monbase != MONS_PROGRAM_BUG
&& mons_class_is_zombified(static_cast<monster_type>(nspec.type)))
{
mspec.monbase = static_cast<monster_type>(nspec.type);
}
}
}
else if (mon_str != "0")
{
const mons_spec nspec = mons_by_name(mon_str);
if (nspec.type == MONS_PROGRAM_BUG)
{
error = make_stringf("unknown monster: \"%s\"",
mon_str.c_str());
return slot;
}
if (mons_class_flag(nspec.type, M_CANT_SPAWN))
{
error = make_stringf("can't place dummy monster: \"%s\"",
mon_str.c_str());
return slot;
}
mspec.type = nspec.type;
mspec.monbase = nspec.monbase;
if (nspec.colour > COLOUR_UNDEF && mspec.colour <= COLOUR_UNDEF)
mspec.colour = nspec.colour;
if (nspec.hd != 0)
mspec.hd = nspec.hd;
#define MAYBE_COPY(x) \
if (nspec.props.exists((x))) \
{ \
mspec.props[(x)] \
= nspec.props[(x)]; \
}
MAYBE_COPY(MUTANT_BEAST_FACETS);
MAYBE_COPY(MGEN_BLOB_SIZE);
MAYBE_COPY(MGEN_NUM_HEADS);
MAYBE_COPY(MGEN_NO_AUTO_CRUMBLE);
#undef MAYBE_COPY
}
if (!mspec.items.empty())
{
monster_type type = (monster_type)mspec.type;
if (type == RANDOM_DRACONIAN
|| type == RANDOM_BASE_DRACONIAN
|| type == RANDOM_NONBASE_DRACONIAN)
{
type = MONS_DRACONIAN;
}
if (type >= NUM_MONSTERS)
{
error = "Can't give spec items to a random monster.";
return slot;
}
else if (mons_class_itemuse(type) < MONUSE_STARTING_EQUIPMENT
&& (!mons_class_is_animated_weapon(type)
|| mspec.items.size() > 1)
&& (type != MONS_ZOMBIE && type != MONS_SKELETON
|| invalid_monster_type(mspec.monbase)
|| mons_class_itemuse(mspec.monbase)
< MONUSE_STARTING_EQUIPMENT))
{
error = make_stringf("Monster '%s' can't use items.",
mon_str.c_str());
}
}
slot.mlist.push_back(mspec);
}
return slot;
}
string mons_list::add_mons(const string &s, bool fix)
{
error.clear();
mons_spec_slot slotmons = parse_mons_spec(s);
if (!error.empty())
return error;
if (fix)
{
slotmons.fix_slot = true;
pick_monster(slotmons);
}
mons.push_back(slotmons);
return error;
}
string mons_list::set_mons(int index, const string &s)
{
error.clear();
if (index < 0)
return error = make_stringf("Index out of range: %d", index);
mons_spec_slot slotmons = parse_mons_spec(s);
if (!error.empty())
return error;
if (index >= (int) mons.size())
{
mons.reserve(index + 1);
mons.resize(index + 1, mons_spec_slot());
}
mons[index] = slotmons;
return error;
}
static monster_type _fixup_mon_type(monster_type orig)
{
if (mons_class_flag(orig, M_CANT_SPAWN))
return MONS_PROGRAM_BUG;
if (orig < 0)
orig = MONS_PROGRAM_BUG;
monster_type dummy_mons = MONS_PROGRAM_BUG;
coord_def dummy_pos;
level_id place = level_id::current();
return resolve_monster_type(orig, dummy_mons, PROX_ANYWHERE, &dummy_pos, 0,
&place);
}
void mons_list::get_zombie_type(string s, mons_spec &spec) const
{
static const char *zombie_types[] =
{
" zombie", " skeleton", " simulacrum", " spectre", nullptr
};
// This order must match zombie_types, indexed from one.
static const monster_type zombie_montypes[] =
{
MONS_PROGRAM_BUG, MONS_ZOMBIE, MONS_SKELETON, MONS_SIMULACRUM,
MONS_SPECTRAL_THING,
};
int mod = ends_with(s, zombie_types);
if (!mod)
{
if (starts_with(s, "spectral "))
{
mod = ends_with(" spectre", zombie_types);
s = s.substr(9); // strlen("spectral ")
}
else
{
spec.type = MONS_PROGRAM_BUG;
return;
}
}
else
s = s.substr(0, s.length() - strlen(zombie_types[mod - 1]));
trim_string(s);
mons_spec base_monster = mons_by_name(s);
base_monster.type = _fixup_mon_type(base_monster.type);
if (base_monster.type == MONS_PROGRAM_BUG)
{
spec.type = MONS_PROGRAM_BUG;
return;
}
spec.monbase = static_cast<monster_type>(base_monster.type);
if (base_monster.props.exists(MGEN_NUM_HEADS))
spec.props[MGEN_NUM_HEADS] = base_monster.props[MGEN_NUM_HEADS];
const int zombie_size = mons_zombie_size(spec.monbase);
if (!zombie_size)
{
spec.type = MONS_PROGRAM_BUG;
return;
}
if (mod == 1 && mons_class_flag(spec.monbase, M_NO_ZOMBIE))
{
spec.type = MONS_PROGRAM_BUG;
return;
}
if (mod == 2 && mons_class_flag(spec.monbase, M_NO_SKELETON))
{
spec.type = MONS_PROGRAM_BUG;
return;
}
spec.type = zombie_montypes[mod];
}
mons_spec mons_list::get_hydra_spec(const string &name) const
{
string prefix = name.substr(0, name.find("-"));
int nheads = atoi(prefix.c_str());
if (nheads != 0)
;
else if (prefix == "0")
nheads = 0;
else
{
// Might be "two-headed hydra" type string.
for (int i = 0; i <= 20; ++i)
if (number_in_words(i) == prefix)
{
nheads = i;
break;
}
}
if (nheads < 1)
nheads = 27; // What can I say? :P
else if (nheads > 20)
{
#if defined(DEBUG) || defined(DEBUG_DIAGNOSTICS)
mprf(MSGCH_DIAGNOSTICS, "Hydra spec wants %d heads, clamping to 20.",
nheads);
#endif
nheads = 20;
}
mons_spec spec(MONS_HYDRA);
spec.props[MGEN_NUM_HEADS] = nheads;
return spec;
}
mons_spec mons_list::get_slime_spec(const string &name) const
{
string prefix = name.substr(0, name.find(" slime creature"));
int slime_size = 1;
if (prefix == "large")
slime_size = 2;
else if (prefix == "very large")
slime_size = 3;
else if (prefix == "enormous")
slime_size = 4;
else if (prefix == "titanic")
slime_size = 5;
else
{
#if defined(DEBUG) || defined(DEBUG_DIAGNOSTICS)
mprf(MSGCH_DIAGNOSTICS, "Slime spec wants invalid size '%s'",
prefix.c_str());
#endif
}
mons_spec spec(MONS_SLIME_CREATURE);
spec.props[MGEN_BLOB_SIZE] = slime_size;
return spec;
}
/**
* Build a monster specification for a specified pillar of salt. The pillar of
* salt won't crumble over time, since that seems unuseful for any version of
* this function.
*
* @param name The description of the pillar of salt; e.g.
* "human-shaped pillar of salt",
* "titanic slime creature-shaped pillar of salt."
* XXX: doesn't currently work with zombie specifiers
* e.g. "zombie-shaped..." (does this matter?)
* @return A specifier for a pillar of salt.
*/
mons_spec mons_list::get_salt_spec(const string &name) const
{
const string prefix = name.substr(0, name.find("-shaped pillar of salt"));
mons_spec base_mon = mons_by_name(prefix);
if (base_mon.type == MONS_PROGRAM_BUG)
return base_mon; // invalid specifier
mons_spec spec(MONS_PILLAR_OF_SALT);
spec.monbase = _fixup_mon_type(base_mon.type);
spec.props[MGEN_NO_AUTO_CRUMBLE] = true;
return spec;
}
// Handle draconians specified as:
// Exactly as in mon-data.h:
// yellow draconian or draconian knight - the monster specified.
//
// Others:
// any draconian => any random draconain
// any base draconian => any unspecialised coloured draconian.
// any nonbase draconian => any specialised coloured draconian.
// any <colour> draconian => any draconian of the colour.
// any nonbase <colour> draconian => any specialised drac of the colour.
//
mons_spec mons_list::drac_monspec(string name) const
{
mons_spec spec;
spec.type = get_monster_by_name(name);
// Check if it's a simple drac name, we're done.
if (spec.type != MONS_PROGRAM_BUG)
return spec;
spec.type = RANDOM_DRACONIAN;
// Request for any draconian?
if (starts_with(name, "any "))
name = name.substr(4); // Strip "any "
if (starts_with(name, "base "))
{
// Base dracs need no further work.
return RANDOM_BASE_DRACONIAN;
}
else if (starts_with(name, "nonbase "))
{
spec.type = RANDOM_NONBASE_DRACONIAN;
name = name.substr(8);
}
trim_string(name);
// Match "any draconian"
if (name == "draconian")
return spec;
// Check for recognition again to match any (nonbase) <colour> draconian.
const monster_type colour = get_monster_by_name(name);
if (colour != MONS_PROGRAM_BUG)
{
spec.monbase = colour;
return spec;
}
// Only legal possibility left is <colour> boss drac.
string::size_type wordend = name.find(' ');
if (wordend == string::npos)
return MONS_PROGRAM_BUG;
string scolour = name.substr(0, wordend);
if ((spec.monbase = draconian_colour_by_name(scolour)) == MONS_PROGRAM_BUG)
return MONS_PROGRAM_BUG;
name = trimmed_string(name.substr(wordend + 1));
spec.type = get_monster_by_name(name);
// We should have a non-base draconian here.
if (spec.type == MONS_PROGRAM_BUG
|| mons_genus(static_cast<monster_type>(spec.type)) != MONS_DRACONIAN
|| mons_is_base_draconian(spec.type))
{
return MONS_PROGRAM_BUG;
}
return spec;
}
// As with draconians, so with demonspawn.
mons_spec mons_list::demonspawn_monspec(string name) const
{
mons_spec spec;
spec.type = get_monster_by_name(name);
// Check if it's a simple demonspawn name, we're done.
if (spec.type != MONS_PROGRAM_BUG)
return spec;
spec.type = RANDOM_DEMONSPAWN;
// Request for any demonspawn?
if (starts_with(name, "any "))
name = name.substr(4); // Strip "any "
if (starts_with(name, "base "))
{
// Base demonspawn need no further work.
return RANDOM_BASE_DEMONSPAWN;
}
else if (starts_with(name, "nonbase "))
{
spec.type = RANDOM_NONBASE_DEMONSPAWN;
name = name.substr(8);
}
trim_string(name);
// Match "any demonspawn"
if (name == "demonspawn")
return spec;
// Check for recognition again to match any (nonbase) <base> demonspawn.
const monster_type base = get_monster_by_name(name);
if (base != MONS_PROGRAM_BUG)
{
spec.monbase = base;
return spec;
}
// Only legal possibility left is <base> boss demonspawn.
string::size_type wordend = name.find(' ');
if (wordend == string::npos)
return MONS_PROGRAM_BUG;
string sbase = name.substr(0, wordend);
if ((spec.monbase = demonspawn_base_by_name(sbase)) == MONS_PROGRAM_BUG)
return MONS_PROGRAM_BUG;
name = trimmed_string(name.substr(wordend + 1));
spec.type = get_monster_by_name(name);
// We should have a non-base demonspawn here.
if (spec.type == MONS_PROGRAM_BUG
|| mons_genus(static_cast<monster_type>(spec.type)) != MONS_DEMONSPAWN
|| spec.type == MONS_DEMONSPAWN
|| (spec.type >= MONS_FIRST_BASE_DEMONSPAWN
&& spec.type <= MONS_LAST_BASE_DEMONSPAWN))
{
return MONS_PROGRAM_BUG;
}
return spec;
}
mons_spec mons_list::soh_monspec(string name) const
{
// "serpent of hell " is 16 characters
name = name.substr(16);
string abbrev =
uppercase_first(lowercase(name)).substr(0, 3);
switch (branch_by_abbrevname(abbrev))
{
case BRANCH_GEHENNA:
return MONS_SERPENT_OF_HELL;
case BRANCH_COCYTUS:
return MONS_SERPENT_OF_HELL_COCYTUS;
case BRANCH_DIS:
return MONS_SERPENT_OF_HELL_DIS;
case BRANCH_TARTARUS:
return MONS_SERPENT_OF_HELL_TARTARUS;
default:
return MONS_PROGRAM_BUG;
}
}
/**
* What mutant beast facet corresponds to the given name?
*
* @param name The name in question (e.g. 'bat')
* @return The corresponding facet (e.g. BF_BAT), or BF_NONE.
*/
static int _beast_facet_by_name(const string &name)
{
for (int bf = BF_FIRST; bf < NUM_BEAST_FACETS; ++bf)
if (mutant_beast_facet_names[bf] == lowercase_string(name))
return bf;
return BF_NONE;
}
/**
* What HD corresponds to the given mutant beast tier name?
*
* XXX: refactor this together with _beast_facet_by_name()?
*
* @param tier The name in question (e.g. 'juvenile')
* @return The corresponding tier XL (e.g. 9), or 0 if none is valid.
*/
static int _mutant_beast_xl(const string &tier)
{
for (int bt = BT_FIRST; bt < NUM_BEAST_TIERS; ++bt)
if (mutant_beast_tier_names[bt] == lowercase_string(tier))
return beast_tiers[bt];
return 0;
}
mons_spec mons_list::mons_by_name(string name) const
{
name = replace_all_of(name, "_", " ");
name = replace_all(name, "random", "any");
if (name == "nothing")
return MONS_NO_MONSTER;
// Special casery:
if (name == "pandemonium lord")
return MONS_PANDEMONIUM_LORD;
if (name == "any" || name == "any monster")
return RANDOM_MONSTER;
if (name == "any demon")
return RANDOM_DEMON;
if (name == "any lesser demon" || name == "lesser demon")
return RANDOM_DEMON_LESSER;
if (name == "any common demon" || name == "common demon")
return RANDOM_DEMON_COMMON;
if (name == "any greater demon" || name == "greater demon")
return RANDOM_DEMON_GREATER;
if (name == "small zombie" || name == "large zombie"
|| name == "small skeleton" || name == "large skeleton"
|| name == "small simulacrum" || name == "large simulacrum")
{
return MONS_PROGRAM_BUG;
}
if (name == "small abomination")
return MONS_ABOMINATION_SMALL;
if (name == "large abomination")
return MONS_ABOMINATION_LARGE;
if (ends_with(name, "-headed hydra") && !starts_with(name, "spectral "))
return get_hydra_spec(name);
if (ends_with(name, " slime creature"))
return get_slime_spec(name);
if (ends_with(name, "-shaped pillar of salt"))
return get_salt_spec(name);
const auto m_index = name.find(" mutant beast");
if (m_index != string::npos)
{
mons_spec spec = MONS_MUTANT_BEAST;
const string trimmed = name.substr(0, m_index);
const vector<string> segments = split_string(" ", trimmed);
if (segments.size() > 2)
return MONS_PROGRAM_BUG; // too many words
const bool fully_specified = segments.size() == 2;
spec.hd = _mutant_beast_xl(segments[0]);
if (spec.hd == 0 && fully_specified)
return MONS_PROGRAM_BUG; // gave invalid tier spec
if (spec.hd == 0 || fully_specified)
{
const int seg = segments.size() - 1;
const vector<string> facet_names
= split_string("-", segments[seg]);
for (const string &facet_name : facet_names)
{
const int facet = _beast_facet_by_name(facet_name);
if (facet == BF_NONE)
return MONS_PROGRAM_BUG; // invalid facet
spec.props[MUTANT_BEAST_FACETS].get_vector().push_back(facet);
}
}
return spec;
}
mons_spec spec;
if (name.find(" ugly thing") != string::npos)
{
const string::size_type wordend = name.find(' ');
const string first_word = name.substr(0, wordend);
const int colour = str_to_ugly_thing_colour(first_word);
if (colour)
{
spec = mons_by_name(name.substr(wordend + 1));
spec.colour = colour;
return spec;
}
}
get_zombie_type(name, spec);
if (spec.type != MONS_PROGRAM_BUG)
return spec;
if (name.find("draconian") != string::npos)
return drac_monspec(name);
// FIXME: cleaner way to do this?
if (name.find("demonspawn") != string::npos
|| name.find("black sun") != string::npos
|| name.find("blood saint") != string::npos
|| name.find("corrupter") != string::npos
|| name.find("warmonger") != string::npos)
{
return demonspawn_monspec(name);
}
// The space is important - it indicates a flavour is being specified.
if (name.find("serpent of hell ") != string::npos)
return soh_monspec(name);
// Allow access to her second form, which shares display names.
if (name == "bai suzhen dragon")
return MONS_BAI_SUZHEN_DRAGON;
return get_monster_by_name(name);
}
//////////////////////////////////////////////////////////////////////
// item_list
item_spec::item_spec(const item_spec &other)
: _corpse_monster_spec(nullptr)
{
*this = other;
}
item_spec &item_spec::operator = (const item_spec &other)
{
if (this != &other)
{
genweight = other.genweight;
base_type = other.base_type;
sub_type = other.sub_type;
plus = other.plus;
plus2 = other.plus2;
ego = other.ego;
allow_uniques = other.allow_uniques;
level = other.level;
item_special = other.item_special;
qty = other.qty;
acquirement_source = other.acquirement_source;
place = other.place;
props = other.props;
release_corpse_monster_spec();
if (other._corpse_monster_spec)
set_corpse_monster_spec(other.corpse_monster_spec());
}
return *this;
}
item_spec::~item_spec()
{
release_corpse_monster_spec();
}
void item_spec::release_corpse_monster_spec()
{
delete _corpse_monster_spec;
_corpse_monster_spec = nullptr;
}
bool item_spec::corpselike() const
{
return base_type == OBJ_CORPSES && (sub_type == CORPSE_BODY
|| sub_type == CORPSE_SKELETON)
|| base_type == OBJ_FOOD && sub_type == FOOD_CHUNK;
}
const mons_spec &item_spec::corpse_monster_spec() const
{
ASSERT(_corpse_monster_spec);
return *_corpse_monster_spec;
}
void item_spec::set_corpse_monster_spec(const mons_spec &spec)
{
if (&spec != _corpse_monster_spec)
{
release_corpse_monster_spec();
_corpse_monster_spec = new mons_spec(spec);
}
}
void item_list::clear()
{
items.clear();
}
item_spec item_list::random_item()
{
if (items.empty())
{
const item_spec none;
return none;
}
return get_item(random2(size()));
}
typedef pair<item_spec, int> item_pair;
item_spec item_list::random_item_weighted()
{
const item_spec none;
vector<item_pair> pairs;
for (int i = 0, sz = size(); i < sz; ++i)
{
item_spec item = get_item(i);
pairs.emplace_back(item, item.genweight);
}
item_spec* rn_item = random_choose_weighted(pairs);
if (rn_item)
return *rn_item;
return none;
}
item_spec item_list::pick_item(item_spec_slot &slot)
{
int cumulative = 0;
item_spec pick;
for (const auto &spec : slot.ilist)
{
const int weight = spec.genweight;
if (x_chance_in_y(weight, cumulative += weight))
pick = spec;
}
if (slot.fix_slot)
{
slot.ilist.clear();
slot.ilist.push_back(pick);
slot.fix_slot = false;
}
return pick;
}
item_spec item_list::get_item(int index)
{
if (index < 0 || index >= (int) items.size())
{
const item_spec none;
return none;
}
return pick_item(items[index]);
}
string item_list::add_item(const string &spec, bool fix)
{
error.clear();
item_spec_slot sp = parse_item_spec(spec);
if (error.empty())
{
if (fix)
{
sp.fix_slot = true;
pick_item(sp);
}
items.push_back(sp);
}
return error;
}
string item_list::set_item(int index, const string &spec)
{
error.clear();
if (index < 0)
return error = make_stringf("Index %d out of range", index);
item_spec_slot sp = parse_item_spec(spec);
if (error.empty())
{
if (index >= (int) items.size())
{
items.reserve(index + 1);
items.resize(index + 1, item_spec_slot());
}
items.push_back(sp);
}
return error;
}
void item_list::set_from_slot(const item_list &list, int slot_index)
{
clear();
// Don't set anything if an invalid index.
// Future calls to get_item will just return no item.
if (slot_index < 0 || (size_t)slot_index >= list.items.size())
return;
items.push_back(list.items[slot_index]);
}
// TODO: More checking for inappropriate combinations, like the holy
// wrath brand on a demonic weapon or the running ego on a helmet.
// NOTE: Be sure to update the reference in syntax.txt if this gets moved!
int str_to_ego(object_class_type item_type, string ego_str)
{
const char* armour_egos[] =
{
"running",
"fire_resistance",
"cold_resistance",
"poison_resistance",
"see_invisible",
"invisibility",
"strength",
"dexterity",
"intelligence",
"ponderousness",
"flying",
"magic_resistance",
"protection",
"stealth",
"resistance",
"positive_energy",
"archmagi",
#if TAG_MAJOR_VERSION == 34
"preservation",
#endif
"reflection",
"spirit_shield",
"archery",
#if TAG_MAJOR_VERSION == 34
"jumping",
#endif
"repulsion",
"cloud_immunity",
nullptr
};
COMPILE_CHECK(ARRAYSZ(armour_egos) == NUM_REAL_SPECIAL_ARMOURS);
const char* weapon_brands[] =
{
"flaming",
"freezing",
"holy_wrath",
"electrocution",
#if TAG_MAJOR_VERSION == 34
"orc_slaying",
"dragon_slaying",
#endif
"venom",
"protection",
"draining",
"speed",
"vorpal",
#if TAG_MAJOR_VERSION == 34
"flame",
"frost",
#endif
"vampirism",
"pain",
"antimagic",
"distortion",
#if TAG_MAJOR_VERSION == 34
"reaching",
"returning",
#endif
"chaos",
"evasion",
#if TAG_MAJOR_VERSION == 34
"confuse",
#endif
"penetration",
"reaping",
nullptr
};
COMPILE_CHECK(ARRAYSZ(weapon_brands) == NUM_REAL_SPECIAL_WEAPONS);
const char* missile_brands[] =
{
"flame",
"frost",
"poisoned",
"curare",
"returning",
"chaos",
"penetration",
"dispersal",
"exploding",
"steel",
"silver",
"paralysis",
#if TAG_MAJOR_VERSION == 34
"slow",
#endif
"sleep",
"confusion",
#if TAG_MAJOR_VERSION == 34
"sickness",
#endif
"frenzy",
nullptr
};
COMPILE_CHECK(ARRAYSZ(missile_brands) == NUM_REAL_SPECIAL_MISSILES);
const char** name_lists[3] = {armour_egos, weapon_brands, missile_brands};
int armour_order[3] = {0, 1, 2};
int weapon_order[3] = {1, 0, 2};
int missile_order[3] = {2, 0, 1};
int *order;
switch (item_type)
{
case OBJ_ARMOUR:
order = armour_order;
break;
case OBJ_WEAPONS:
order = weapon_order;
break;
case OBJ_MISSILES:
#if TAG_MAJOR_VERSION == 34
// HACK to get an old save to load; remove me soon?
if (ego_str == "sleeping")
return SPMSL_SLEEP;
#endif
order = missile_order;
break;
default:
die("Bad base_type for ego'd item.");
return 0;
}
const char** allowed = name_lists[order[0]];
for (int i = 0; allowed[i] != nullptr; i++)
{
if (ego_str == allowed[i])
return i + 1;
}
// Incompatible or non-existent ego type
for (int i = 1; i <= 2; i++)
{
const char** list = name_lists[order[i]];
for (int j = 0; list[j] != nullptr; j++)
if (ego_str == list[j])
// Ego incompatible with base type.
return -1;
}
// Non-existent ego
return 0;
}
int item_list::parse_acquirement_source(const string &source)
{
const string god_name(replace_all_of(source, "_", " "));
const god_type god(str_to_god(god_name));
if (god == GOD_NO_GOD)
error = make_stringf("unknown god name: '%s'", god_name.c_str());
return god;
}
bool item_list::monster_corpse_is_valid(monster_type *mons,
const string &name,
bool corpse,
bool skeleton,
bool chunk)
{
if (*mons == RANDOM_NONBASE_DRACONIAN || *mons == RANDOM_NONBASE_DEMONSPAWN)
{
error = "Can't use non-base monster for corpse/chunk items";
return false;
}
// Accept randomised types without further checks:
if (*mons >= NUM_MONSTERS)
return true;
// Convert to the monster species:
*mons = mons_species(*mons);
if (!mons_class_can_leave_corpse(*mons))
{
error = make_stringf("'%s' cannot leave corpses", name.c_str());
return false;
}
if (skeleton && !mons_skeleton(*mons))
{
error = make_stringf("'%s' has no skeleton", name.c_str());
return false;
}
// We're ok.
return true;
}
bool item_list::parse_corpse_spec(item_spec &result, string s)
{
const bool never_decay = strip_tag(s, "never_decay");
if (never_decay)
result.props[CORPSE_NEVER_DECAYS].get_bool() = true;
const bool corpse = strip_suffix(s, "corpse");
const bool skeleton = !corpse && strip_suffix(s, "skeleton");
const bool chunk = !corpse && !skeleton && strip_suffix(s, "chunk");
result.base_type = chunk ? OBJ_FOOD : OBJ_CORPSES;
result.sub_type = (chunk ? static_cast<int>(FOOD_CHUNK) :
static_cast<int>(corpse ? CORPSE_BODY :
CORPSE_SKELETON));
// The caller wants a specific monster, no doubt with the best of
// motives. Let's indulge them:
mons_list mlist;
const string mons_parse_err = mlist.add_mons(s, true);
if (!mons_parse_err.empty())
{
error = mons_parse_err;
return false;
}
// Get the actual monster spec:
mons_spec spec = mlist.get_monster(0);
monster_type mtype = static_cast<monster_type>(spec.type);
if (!monster_corpse_is_valid(&mtype, s, corpse, skeleton, chunk))
{
error = make_stringf("Requested corpse '%s' is invalid",
s.c_str());
return false;
}
// Ok, looking good, the caller can have their requested toy.
result.set_corpse_monster_spec(spec);
return true;
}
bool item_list::parse_single_spec(item_spec& result, string s)
{
// If there's a colon, this must be a generation weight.
int weight = find_weight(s);
if (weight != TAG_UNFOUND)
{
result.genweight = weight;
if (result.genweight <= 0)
{
error = make_stringf("Bad item generation weight: '%d'",
result.genweight);
return false;
}
}
const int qty = strip_number_tag(s, "q:");
if (qty != TAG_UNFOUND)
result.qty = qty;
const int fresh = strip_number_tag(s, "fresh:");
if (fresh != TAG_UNFOUND)
result.item_special = fresh;
const int special = strip_number_tag(s, "special:");
if (special != TAG_UNFOUND)
result.item_special = special;
// When placing corpses, use place:Elf:$ to choose monsters
// appropriate for that level, as an example.
const string place = strip_tag_prefix(s, "place:");
if (!place.empty())
{
try
{
result.place = level_id::parse_level_id(place);
}
catch (const bad_level_id &err)
{
error = err.what();
return false;
}
}
// Damaged + cursed, but allow other specs to override the former.
if (strip_tag(s, "cursed"))
{
result.level = ISPEC_BAD;
result.props["cursed"] = bool(true);
}
const string acquirement_source = strip_tag_prefix(s, "acquire:");
if (!acquirement_source.empty() || strip_tag(s, "acquire"))
{
if (!acquirement_source.empty())
{
result.acquirement_source =
parse_acquirement_source(acquirement_source);
}
// If requesting acquirement, must specify item base type or
// "any".
result.level = ISPEC_ACQUIREMENT;
if (s == "any")
result.base_type = OBJ_RANDOM;
else
parse_random_by_class(s, result);
return true;
}
string ego_str = strip_tag_prefix(s, "ego:");
string id_str = strip_tag_prefix(s, "ident:");
if (id_str == "all")
result.props["ident"].get_int() = ISFLAG_IDENT_MASK;
else if (!id_str.empty())
{
vector<string> ids = split_string("|", id_str);
int id = 0;
for (const auto &is : ids)
{
if (is == "curse")
id |= ISFLAG_KNOW_CURSE;
else if (is == "type")
id |= ISFLAG_KNOW_TYPE;
else if (is == "pluses")
id |= ISFLAG_KNOW_PLUSES;
else if (is == "properties")
id |= ISFLAG_KNOW_PROPERTIES;
else
{
error = make_stringf("Bad identify status: %s", id_str.c_str());
return false;
}
}
result.props["ident"].get_int() = id;
}
if (strip_tag(s, "good_item"))
result.level = ISPEC_GOOD_ITEM;
else
{
int number = strip_number_tag(s, "level:");
if (number != TAG_UNFOUND)
{
if (number <= 0 && number != ISPEC_STAR && number != ISPEC_SUPERB
&& number != ISPEC_DAMAGED && number != ISPEC_BAD)
{
error = make_stringf("Bad item level: %d", number);
return false;
}
result.level = number;
}
}
if (strip_tag(s, "mundane"))
{
result.level = ISPEC_MUNDANE;
result.ego = -1;
}
if (strip_tag(s, "damaged"))
result.level = ISPEC_DAMAGED;
if (strip_tag(s, "randart"))
result.level = ISPEC_RANDART;
if (strip_tag(s, "not_cursed"))
result.props["uncursed"] = bool(true);
if (strip_tag(s, "useful"))
result.props["useful"] = bool(true);
if (strip_tag(s, "unobtainable"))
result.props["unobtainable"] = true;
const int mimic = strip_number_tag(s, "mimic:");
if (mimic != TAG_UNFOUND)
result.props["mimic"] = mimic;
if (strip_tag(s, "mimic"))
result.props["mimic"] = 1;
if (strip_tag(s, "no_pickup"))
result.props["no_pickup"] = true;
const short charges = strip_number_tag(s, "charges:");
if (charges >= 0)
result.props["charges"].get_int() = charges;
const int plus = strip_number_tag(s, "plus:");
if (plus != TAG_UNFOUND)
result.props["plus"].get_int() = plus;
const int plus2 = strip_number_tag(s, "plus2:");
if (plus2 != TAG_UNFOUND)
result.props["plus2"].get_int() = plus2;
if (strip_tag(s, "no_uniq"))
result.allow_uniques = 0;
if (strip_tag(s, "allow_uniq"))
result.allow_uniques = 1;
else
{
int uniq = strip_number_tag(s, "uniq:");
if (uniq != TAG_UNFOUND)
{
if (uniq <= 0)
{
error = make_stringf("Bad uniq level: %d", uniq);
return false;
}
result.allow_uniques = uniq;
}
}
// XXX: This is nice-ish now, but could probably do with being improved.
if (strip_tag(s, "randbook"))
{
result.props["build_themed_book"] = true;
// build_themed_book requires the following properties:
// disc: <first discipline>, disc2: <optional second discipline>
// numspells: <total number of spells>, slevels: <maximum levels>
// spell: <include this spell>, owner:<name of owner>
// None of these are required, but if you don't intend on using any
// of them, use "any fixed theme book" instead.
spschool disc1 = spschool::none;
spschool disc2 = spschool::none;
string st_disc1 = strip_tag_prefix(s, "disc:");
if (!st_disc1.empty())
{
disc1 = school_by_name(st_disc1);
if (disc1 == spschool::none)
{
error = make_stringf("Bad spell school: %s", st_disc1.c_str());
return false;
}
}
string st_disc2 = strip_tag_prefix(s, "disc2:");
if (!st_disc2.empty())
{
disc2 = school_by_name(st_disc2);
if (disc2 == spschool::none)
{
error = make_stringf("Bad spell school: %s", st_disc2.c_str());
return false;
}
}
if (disc1 == spschool::none && disc2 != spschool::none)
{
// Don't fail, just quietly swap. Any errors in disc1's syntax will
// have been caught above, anyway.
swap(disc1, disc2);
}
short num_spells = strip_number_tag(s, "numspells:");
if (num_spells == TAG_UNFOUND)
num_spells = -1;
else if (num_spells <= 0 || num_spells > RANDBOOK_SIZE)
{
error = make_stringf("Bad spellbook size: %d", num_spells);
return false;
}
short slevels = strip_number_tag(s, "slevels:");
if (slevels == TAG_UNFOUND)
slevels = -1;
else if (slevels == 0)
{
error = make_stringf("Bad slevels: %d.", slevels);
return false;
}
const string title = replace_all_of(strip_tag_prefix(s, "title:"),
"_", " ");
const string spells = strip_tag_prefix(s, "spells:");
vector<string> spell_list = split_string("&", spells);
CrawlVector &incl_spells
= result.props[RANDBK_SPELLS_KEY].new_vector(SV_INT);
for (const string &spnam : spell_list)
{
string spell_name = replace_all_of(spnam, "_", " ");
spell_type spell = spell_by_name(spell_name);
if (spell == SPELL_NO_SPELL)
{
error = make_stringf("Bad spell: %s", spnam.c_str());
return false;
}
incl_spells.push_back(spell);
}
const string owner = replace_all_of(strip_tag_prefix(s, "owner:"),
"_", " ");
result.props[RANDBK_DISC1_KEY].get_short() = static_cast<short>(disc1);
result.props[RANDBK_DISC2_KEY].get_short() = static_cast<short>(disc2);
result.props[RANDBK_NSPELLS_KEY] = num_spells;
result.props[RANDBK_SLVLS_KEY] = slevels;
result.props[RANDBK_TITLE_KEY] = title;
result.props[RANDBK_OWNER_KEY] = owner;
result.base_type = OBJ_BOOKS;
// This is changed in build_themed_book().
result.sub_type = BOOK_MINOR_MAGIC;
result.plus = -1;
return true;
}
if (s.find("deck") != string::npos)
{
error = make_stringf("removed deck: \"%s\".", s.c_str());
return false;
}
string tile = strip_tag_prefix(s, "tile:");
if (!tile.empty())
{
tileidx_t index;
if (!tile_main_index(tile.c_str(), &index))
{
error = make_stringf("bad tile name: \"%s\".", tile.c_str());
return false;
}
result.props["item_tile_name"].get_string() = tile;
}
tile = strip_tag_prefix(s, "wtile:");
if (!tile.empty())
{
tileidx_t index;
if (!tile_player_index(tile.c_str(), &index))
{
error = make_stringf("bad tile name: \"%s\".", tile.c_str());
return false;
}
result.props["worn_tile_name"].get_string() = tile;
}
// Clean up after any tag brain damage.
trim_string(s);
if (!ego_str.empty())
error = "Can't set an ego for random items.";
// Completely random?
if (s == "random" || s == "any" || s == "%")
return true;
if (s == "*" || s == "star_item")
{
result.level = ISPEC_STAR;
return true;
}
else if (s == "|" || s == "superb_item")
{
result.level = ISPEC_SUPERB;
return true;
}
else if (s == "$" || s == "gold")
{
if (!ego_str.empty())
{
error = "Can't set an ego for gold.";
return false;
}
result.base_type = OBJ_GOLD;
result.sub_type = OBJ_RANDOM;
return true;
}
if (s == "nothing")
{
error.clear();
result.base_type = OBJ_UNASSIGNED;
return true;
}
error.clear();
// Look for corpses, chunks, skeletons:
if (ends_with(s, "corpse") || ends_with(s, "chunk")
|| ends_with(s, "skeleton"))
{
return parse_corpse_spec(result, s);
}
const int unrand_id = get_unrandart_num(s.c_str());
if (unrand_id)
{
result.ego = -unrand_id; // lol
return true;
}
// Check for "any objclass"
if (starts_with(s, "any "))
parse_random_by_class(s.substr(4), result);
else if (starts_with(s, "random "))
parse_random_by_class(s.substr(7), result);
// Check for actual item names.
else
parse_raw_name(s, result);
if (!error.empty())
return false;
if (ego_str.empty())
return true;
if (result.base_type != OBJ_WEAPONS
&& result.base_type != OBJ_MISSILES
&& result.base_type != OBJ_ARMOUR)
{
error = "An ego can only be applied to a weapon, missile or "
"armour.";
return false;
}
if (ego_str == "none")
{
result.ego = -1;
return true;
}
const int ego = str_to_ego(result.base_type, ego_str);
if (ego == 0)
{
error = make_stringf("No such ego as: %s", ego_str.c_str());
return false;
}
else if (ego == -1)
{
error = make_stringf("Ego '%s' is invalid for item '%s'.",
ego_str.c_str(), s.c_str());
return false;
}
else if (result.sub_type == OBJ_RANDOM)
{
// it will be assigned among appropriate ones later
}
else if (result.base_type == OBJ_WEAPONS
&& !is_weapon_brand_ok(result.sub_type, ego, false)
|| result.base_type == OBJ_ARMOUR
&& !is_armour_brand_ok(result.sub_type, ego, false)
|| result.base_type == OBJ_MISSILES
&& !is_missile_brand_ok(result.sub_type, ego, false))
{
error = make_stringf("Ego '%s' is incompatible with item '%s'.",
ego_str.c_str(), s.c_str());
return false;
}
result.ego = ego;
return true;
}
void item_list::parse_random_by_class(string c, item_spec &spec)
{
trim_string(c);
if (c == "?" || c.empty())
{
error = make_stringf("Bad item class: '%s'", c.c_str());
return;
}
for (int type = OBJ_WEAPONS; type < NUM_OBJECT_CLASSES; ++type)
{
if (c == item_class_name(type, true))
{
spec.base_type = static_cast<object_class_type>(type);
return;
}
}
// Random manual?
if (c == "manual")
{
spec.base_type = OBJ_BOOKS;
spec.sub_type = BOOK_MANUAL;
spec.plus = -1;
return;
}
else if (c == "fixed theme book")
{
spec.base_type = OBJ_BOOKS;
spec.sub_type = BOOK_RANDART_THEME;
spec.plus = -1;
return;
}
else if (c == "fixed level book")
{
spec.base_type = OBJ_BOOKS;
spec.sub_type = BOOK_RANDART_LEVEL;
spec.plus = -1;
return;
}
else if (c == "ring")
{
spec.base_type = OBJ_JEWELLERY;
spec.sub_type = NUM_RINGS;
return;
}
else if (c == "amulet")
{
spec.base_type = OBJ_JEWELLERY;
spec.sub_type = NUM_JEWELLERY;
return;
}
error = make_stringf("Bad item class: '%s'", c.c_str());
}
void item_list::parse_raw_name(string name, item_spec &spec)
{
trim_string(name);
if (name.empty())
{
error = make_stringf("Bad item name: '%s'", name.c_str());
return ;
}
item_kind parsed = item_kind_by_name(name);
if (parsed.base_type != OBJ_UNASSIGNED)
{
spec.base_type = parsed.base_type;
spec.sub_type = parsed.sub_type;
spec.plus = parsed.plus;
spec.plus2 = parsed.plus2;
return;
}
error = make_stringf("Bad item name: '%s'", name.c_str());
}
item_list::item_spec_slot item_list::parse_item_spec(string spec)
{
// lowercase(spec);
item_spec_slot list;
list.fix_slot = strip_tag(spec, "fix_slot");
for (const string &specifier : split_string("/", spec))
{
item_spec result;
if (parse_single_spec(result, specifier))
list.ilist.push_back(result);
else
dprf(DIAG_DNGN, "Failed to parse: %s", specifier.c_str());
}
return list;
}
/////////////////////////////////////////////////////////////////////////
// subst_spec
subst_spec::subst_spec(string _k, bool _f, const glyph_replacements_t &g)
: key(_k), count(-1), fix(_f), frozen_value(0), repl(g)
{
}
subst_spec::subst_spec(int _count, bool dofix, const glyph_replacements_t &g)
: key(""), count(_count), fix(dofix), frozen_value(0), repl(g)
{
}
int subst_spec::value()
{
if (frozen_value)
return frozen_value;
int cumulative = 0;
int chosen = 0;
for (glyph_weighted_replacement_t rep : repl)
if (x_chance_in_y(rep.second, cumulative += rep.second))
chosen = rep.first;
if (fix)
frozen_value = chosen;
return chosen;
}
//////////////////////////////////////////////////////////////////////////
// nsubst_spec
nsubst_spec::nsubst_spec(string _key, const vector<subst_spec> &_specs)
: key(_key), specs(_specs)
{
}
//////////////////////////////////////////////////////////////////////////
// colour_spec
int colour_spec::get_colour()
{
if (fixed_colour != BLACK)
return fixed_colour;
int chosen = BLACK;
int cweight = 0;
for (map_weighted_colour col : colours)
if (x_chance_in_y(col.second, cweight += col.second))
chosen = col.first;
if (fix)
fixed_colour = chosen;
return chosen;
}
//////////////////////////////////////////////////////////////////////////
// fprop_spec
feature_property_type fprop_spec::get_property()
{
if (fixed_prop != FPROP_NONE)
return fixed_prop;
feature_property_type chosen = FPROP_NONE;
int cweight = 0;
for (map_weighted_fprop fprop : fprops)
if (x_chance_in_y(fprop.second, cweight += fprop.second))
chosen = fprop.first;
if (fix)
fixed_prop = chosen;
return chosen;
}
//////////////////////////////////////////////////////////////////////////
// fheight_spec
int fheight_spec::get_height()
{
if (fixed_height != INVALID_HEIGHT)
return fixed_height;
int chosen = INVALID_HEIGHT;
int cweight = 0;
for (map_weighted_fheight fh : fheights)
if (x_chance_in_y(fh.second, cweight += fh.second))
chosen = fh.first;
if (fix)
fixed_height = chosen;
return chosen;
}
//////////////////////////////////////////////////////////////////////////
// string_spec
string string_spec::get_property()
{
if (!fixed_str.empty())
return fixed_str;
string chosen = "";
int cweight = 0;
for (const map_weighted_string &str : strlist)
if (x_chance_in_y(str.second, cweight += str.second))
chosen = str.first;
if (fix)
fixed_str = chosen;
return chosen;
}
//////////////////////////////////////////////////////////////////////////
// map_marker_spec
string map_marker_spec::apply_transform(map_lines &map)
{
vector<coord_def> positions = map.find_glyph(key);
// Markers with no key are not an error.
if (positions.empty())
return "";
for (coord_def p : positions)
{
try
{
map_marker *mark = create_marker();
if (!mark)
{
return make_stringf("Unable to parse marker from %s",
marker.c_str());
}
mark->pos = p;
map.add_marker(mark);
}
catch (const bad_map_marker &err)
{
return err.what();
}
}
return "";
}
map_marker *map_marker_spec::create_marker()
{
return lua_fn
? new map_lua_marker(*lua_fn)
: map_marker::parse_marker(marker);
}
//////////////////////////////////////////////////////////////////////////
// map_flags
map_flags::map_flags()
: flags_set(0), flags_unset(0)
{
}
void map_flags::clear()
{
flags_set = flags_unset = 0;
}
map_flags &map_flags::operator |= (const map_flags &o)
{
flags_set |= o.flags_set;
flags_unset |= o.flags_unset;
// In the event of conflict, the later flag set (o here) wins.
flags_set &= ~o.flags_unset;
flags_unset &= ~o.flags_set;
return *this;
}
typedef map<string, unsigned long> flag_map;
map_flags map_flags::parse(const string flag_list[], const string &s)
{
map_flags mf;
const vector<string> segs = split_string("/", s);
flag_map flag_vals;
for (int i = 0; !flag_list[i].empty(); i++)
flag_vals[flag_list[i]] = 1 << i;
for (string flag: segs)
{
bool negate = false;
if (flag[0] == '!')
{
flag = flag.substr(1);
negate = true;
}
if (unsigned long *val = map_find(flag_vals, flag))
{
if (negate)
mf.flags_unset |= *val;
else
mf.flags_set |= *val;
}
else
throw bad_map_flag(flag);
}
return mf;
}
//////////////////////////////////////////////////////////////////////////
// keyed_mapspec
keyed_mapspec::keyed_mapspec()
: key_glyph(-1), feat(), item(), mons()
{
}
string keyed_mapspec::set_feat(const string &s, bool fix)
{
err.clear();
parse_features(s);
feat.fix_slot = fix;
// Fix this feature.
if (fix)
get_feat();
return err;
}
void keyed_mapspec::copy_feat(const keyed_mapspec &spec)
{
feat = spec.feat;
}
void keyed_mapspec::parse_features(const string &s)
{
feat.feats.clear();
for (const string &spec : split_string("/", s))
{
feature_spec_list feats = parse_feature(spec);
if (!err.empty())
return;
feat.feats.insert(feat.feats.end(),
feats.begin(),
feats.end());
}
}
/**
* Convert a trap string into a trap_spec.
*
* This function converts an incoming trap specification string from a vault
* into a trap_spec.
*
* @param s The string to be parsed.
* @param weight The weight of this string.
* @return A feature_spec with the contained, parsed trap_spec stored via
* unique_ptr as feature_spec->trap.
**/
feature_spec keyed_mapspec::parse_trap(string s, int weight)
{
strip_tag(s, "trap");
// All traps are known, strip this tag for compatibility
strip_tag(s, "known");
trim_string(s);
lowercase(s);
const int trap = str_to_trap(s);
if (trap == -1)
err = make_stringf("bad trap name: '%s'", s.c_str());
feature_spec fspec(1, weight);
fspec.trap.reset(new trap_spec(static_cast<trap_type>(trap)));
return fspec;
}
/**
* Convert a shop string into a shop_spec.
*
* This function converts an incoming shop specification string from a vault
* into a shop_spec.
*
* @param s The string to be parsed.
* @param weight The weight of this string.
* @param mimic What kind of mimic (if any) to set for this shop.
* @param no_mimic Whether to prohibit mimics altogether for this shop.
* @return A feature_spec with the contained, parsed shop_spec stored
* via unique_ptr as feature_spec->shop.
**/
feature_spec keyed_mapspec::parse_shop(string s, int weight, int mimic,
bool no_mimic)
{
string orig(s);
strip_tag(s, "shop");
trim_string(s);
bool use_all = strip_tag(s, "use_all");
const bool gozag = strip_tag(s, "gozag");
string shop_name = replace_all_of(strip_tag_prefix(s, "name:"), "_", " ");
string shop_type_name = replace_all_of(strip_tag_prefix(s, "type:"),
"_", " ");
string shop_suffix_name = replace_all_of(strip_tag_prefix(s, "suffix:"),
"_", " ");
int num_items = min(20, strip_number_tag(s, "count:"));
if (num_items == TAG_UNFOUND)
num_items = -1;
int greed = strip_number_tag(s, "greed:");
if (greed == TAG_UNFOUND)
greed = -1;
vector<string> parts = split_string(";", s);
string main_part = parts[0];
const shop_type shop = str_to_shoptype(main_part);
if (shop == SHOP_UNASSIGNED)
err = make_stringf("bad shop type: '%s'", s.c_str());
if (parts.size() > 2)
err = make_stringf("too many semi-colons for '%s' spec", orig.c_str());
item_list items;
if (err.empty() && parts.size() == 2)
{
string item_list = parts[1];
vector<string> str_items = split_string("|", item_list);
for (const string &si : str_items)
{
err = items.add_item(si);
if (!err.empty())
break;
}
}
feature_spec fspec(-1, weight, mimic, no_mimic);
fspec.shop.reset(new shop_spec(shop, shop_name, shop_type_name,
shop_suffix_name, greed,
num_items, use_all, gozag));
fspec.shop->items = items;
return fspec;
}
feature_spec_list keyed_mapspec::parse_feature(const string &str)
{
string s = str;
int weight = find_weight(s);
if (weight == TAG_UNFOUND || weight <= 0)
weight = 10;
int mimic = strip_number_tag(s, "mimic:");
if (mimic == TAG_UNFOUND && strip_tag(s, "mimic"))
mimic = 1;
const bool no_mimic = strip_tag(s, "no_mimic");
trim_string(s);
feature_spec_list list;
if (s.length() == 1)
{
feature_spec fsp(-1, weight, mimic, no_mimic);
fsp.glyph = s[0];
list.push_back(fsp);
}
else if (strip_tag(s, "trap") || s == "web")
list.push_back(parse_trap(s, weight));
else if (strip_tag(s, "shop"))
list.push_back(parse_shop(s, weight, mimic, no_mimic));
else if (auto ftype = dungeon_feature_by_name(s)) // DNGN_UNSEEN == 0
list.emplace_back(ftype, weight, mimic, no_mimic);
else
err = make_stringf("no features matching \"%s\"", str.c_str());
return list;
}
string keyed_mapspec::set_mons(const string &s, bool fix)
{
err.clear();
mons.clear();
for (const string &segment : split_string(",", s))
{
const string error = mons.add_mons(segment, fix);
if (!error.empty())
return error;
}
return "";
}
string keyed_mapspec::set_item(const string &s, bool fix)
{
err.clear();
item.clear();
for (const string &seg : split_string(",", s))
{
err = item.add_item(seg, fix);
if (!err.empty())
return err;
}
return err;
}
string keyed_mapspec::set_mask(const string &s, bool /*garbage*/)
{
err.clear();
try
{
// Be sure to change the order of map_mask_type to match!
static string flag_list[] =
{"vault", "no_item_gen", "no_monster_gen", "no_pool_fixup",
"UNUSED",
"no_wall_fixup", "opaque", "no_trap_gen", ""};
map_mask |= map_flags::parse(flag_list, s);
}
catch (const bad_map_flag &error)
{
err = make_stringf("Unknown flag: '%s'", error.what());
}
return err;
}
void keyed_mapspec::copy_mons(const keyed_mapspec &spec)
{
mons = spec.mons;
}
void keyed_mapspec::copy_item(const keyed_mapspec &spec)
{
item = spec.item;
}
void keyed_mapspec::copy_mask(const keyed_mapspec &spec)
{
map_mask = spec.map_mask;
}
feature_spec keyed_mapspec::get_feat()
{
return feat.get_feat('.');
}
mons_list &keyed_mapspec::get_monsters()
{
return mons;
}
item_list &keyed_mapspec::get_items()
{
return item;
}
map_flags &keyed_mapspec::get_mask()
{
return map_mask;
}
bool keyed_mapspec::replaces_glyph()
{
return !(mons.empty() && item.empty() && feat.feats.empty());
}
//////////////////////////////////////////////////////////////////////////
// feature_spec and feature_slot
feature_spec::feature_spec()
{
genweight = 0;
feat = 0;
glyph = -1;
shop.reset(nullptr);
trap.reset(nullptr);
mimic = 0;
no_mimic = false;
}
feature_spec::feature_spec(int f, int wt, int _mimic, bool _no_mimic)
{
genweight = wt;
feat = f;
glyph = -1;
shop.reset(nullptr);
trap.reset(nullptr);
mimic = _mimic;
no_mimic = _no_mimic;
}
feature_spec::feature_spec(const feature_spec &other)
{
init_with(other);
}
feature_spec& feature_spec::operator = (const feature_spec& other)
{
if (this != &other)
init_with(other);
return *this;
}
void feature_spec::init_with(const feature_spec& other)
{
genweight = other.genweight;
feat = other.feat;
glyph = other.glyph;
mimic = other.mimic;
no_mimic = other.no_mimic;
if (other.trap)
trap.reset(new trap_spec(*other.trap));
else
trap.reset(nullptr);
if (other.shop)
shop.reset(new shop_spec(*other.shop));
else
shop.reset(nullptr);
}
feature_slot::feature_slot() : feats(), fix_slot(false)
{
}
feature_spec feature_slot::get_feat(int def_glyph)
{
int tweight = 0;
feature_spec chosen_feat = feature_spec(DNGN_FLOOR);
if (def_glyph != -1)
{
chosen_feat.feat = -1;
chosen_feat.glyph = def_glyph;
}
for (const feature_spec &feat : feats)
if (x_chance_in_y(feat.genweight, tweight += feat.genweight))
chosen_feat = feat;
if (fix_slot)
{
feats.clear();
feats.push_back(chosen_feat);
}
return chosen_feat;
}
|