/usr/include/gecode/int.hh is in libgecode-dev 4.4.0-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Guido Tack <tack@gecode.org>
*
* Contributing authors:
* Stefano Gualandi <stefano.gualandi@gmail.com>
* Mikael Lagerkvist <lagerkvist@gecode.org>
* David Rijsman <David.Rijsman@quintiq.com>
*
* Copyright:
* Stefano Gualandi, 2013
* Mikael Lagerkvist, 2006
* David Rijsman, 2009
* Christian Schulte, 2002
* Guido Tack, 2004
*
* Last modified:
* $Date: 2015-01-16 14:10:48 +0100 (Fri, 16 Jan 2015) $ by $Author: schulte $
* $Revision: 14362 $
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
#ifndef __GECODE_INT_HH__
#define __GECODE_INT_HH__
#include <climits>
#include <cfloat>
#include <iostream>
#include <vector>
#include <gecode/kernel.hh>
#include <gecode/iter.hh>
/*
* Configure linking
*
*/
#if !defined(GECODE_STATIC_LIBS) && \
(defined(__CYGWIN__) || defined(__MINGW32__) || defined(_MSC_VER))
#ifdef GECODE_BUILD_INT
#define GECODE_INT_EXPORT __declspec( dllexport )
#else
#define GECODE_INT_EXPORT __declspec( dllimport )
#endif
#else
#ifdef GECODE_GCC_HAS_CLASS_VISIBILITY
#define GECODE_INT_EXPORT __attribute__ ((visibility("default")))
#else
#define GECODE_INT_EXPORT
#endif
#endif
// Configure auto-linking
#ifndef GECODE_BUILD_INT
#define GECODE_LIBRARY_NAME "Int"
#include <gecode/support/auto-link.hpp>
#endif
/**
* \namespace Gecode::Int
* \brief Finite domain integers
*
* The Gecode::Int namespace contains all functionality required
* to program propagators and branchers for finite domain integers.
* In addition, all propagators and branchers for finite domain
* integers provided by %Gecode are contained as nested namespaces.
*
*/
#include <gecode/int/exception.hpp>
namespace Gecode { namespace Int {
/**
* \brief Numerical limits for integer variables
*
* The integer limits are chosen such changing the sign is always possible
* without overflow.
* \ingroup TaskModelIntVars
*/
namespace Limits {
/// Largest allowed integer value
const int max = INT_MAX - 1;
/// Smallest allowed integer value
const int min = -max;
/// Infinity for integers
const int infinity = max + 1;
/// Largest allowed long long integer value
const long long int llmax = LLONG_MAX - 1;
/// Smallest allowed long long integer value
const long long int llmin = -llmax;
/// Infinity for long long integers
const long long int llinfinity = llmax + 1;
/// Return whether \a n is in range
bool valid(int n);
/// Return whether \a n is in range
bool valid(long long int n);
/// Check whether \a n is in range, otherwise throw out of limits with information \a l
void check(int n, const char* l);
/// Check whether \a n is in range, otherwise throw out of limits with information \a l
void check(long long int n, const char* l);
/// Check whether \a n is in range and strictly positive, otherwise throw out of limits with information \a l
void positive(int n, const char* l);
/// Check whether \a n is in range and strictly positive, otherwise throw out of limits with information \a l
void positive(long long int n, const char* l);
/// Check whether \a n is in range and nonnegative, otherwise throw out of limits with information \a l
void nonnegative(int n, const char* l);
/// Check whether \a n is in integer range and nonnegative, otherwise throw out of limits exception with information \a l
void nonnegative(long long int n, const char* l);
/// Check whether adding \a n and \a m would overflow
bool overflow_add(int n, int m);
/// Check whether adding \a n and \a m would overflow
bool overflow_add(long long int n, long long int m);
/// Check whether subtracting \a m from \a n would overflow
bool overflow_sub(int n, int m);
/// Check whether subtracting \a m from \a n would overflow
bool overflow_sub(long long int n, long long int m);
/// Check whether multiplying \a n and \a m would overflow
bool overflow_mul(int n, int m);
/// Check whether multiplying \a n and \a m would overflow
bool overflow_mul(long long int n, long long int m);
}
}}
#include <gecode/int/limits.hpp>
namespace Gecode {
class IntSetRanges;
template<class I> class IntSetInit;
/**
* \brief Integer sets
*
* Integer sets are the means to specify arbitrary sets
* of integers to be used as domains for integer variables.
* \ingroup TaskModelIntVars TaskModelSetVars
*/
class IntSet : public SharedHandle {
friend class IntSetRanges;
template<class I> friend class IntSetInit;
private:
/// %Range (intervals) of integers
class Range {
public:
int min, max;
};
class IntSetObject : public SharedHandle::Object {
public:
/// Size of set
unsigned int size;
/// Number of ranges
int n;
/// Array of ranges
Range* r;
/// Allocate object with \a m elements
GECODE_INT_EXPORT static IntSetObject* allocate(int m);
/// Return copy of object
GECODE_INT_EXPORT SharedHandle::Object* copy(void) const;
/// Check whether \a n is included in the set
GECODE_INT_EXPORT bool in(int n) const;
/// Delete object
GECODE_INT_EXPORT virtual ~IntSetObject(void);
};
/// Sort ranges according to increasing minimum
class MinInc;
/// Normalize the first \a n elements of \a r
GECODE_INT_EXPORT void normalize(Range* r, int n);
/// Initialize as range with minimum \a n and maximum \a m
GECODE_INT_EXPORT void init(int n, int m);
/// Initialize with \a n integers from array \a r
GECODE_INT_EXPORT void init(const int r[], int n);
/// Initialize with \a n ranges from array \a r
GECODE_INT_EXPORT void init(const int r[][2], int n);
public:
/// \name Constructors and initialization
//@{
/// Initialize as empty set
IntSet(void);
/** \brief Initialize as range with minimum \a n and maximum \a m
*
* Note that the set is empty if \a n is larger than \a m
*/
IntSet(int n, int m);
/// Initialize with \a n integers from array \a r
IntSet(const int r[], int n);
/** \brief Initialize with \a n ranges from array \a r
*
* For position \a i in the array \a r, the minimum is \a r[\a i][0]
* and the maximum is \a r[\a i][1].
*/
IntSet(const int r[][2], int n);
/// Initialize with range iterator \a i
template<class I>
explicit IntSet(I& i);
/// Initialize with range iterator \a i
template<class I>
explicit IntSet(const I& i);
//@}
/// \name Range access
//@{
/// Return number of ranges of the specification
int ranges(void) const;
/// Return minimum of range at position \a i
int min(int i) const;
/// Return maximum of range at position \a i
int max(int i) const;
/// Return width of range at position \a i
unsigned int width(int i) const;
//@}
/// \name Entire set access
//@{
/// Return whether \a n is included in the set
bool in(int n) const;
/// Return size (cardinality) of set
unsigned int size(void) const;
/// Return width of set (distance between maximum and minimum)
unsigned int width(void) const;
/// Return minimum of entire set
int min(void) const;
/// Return maximum of entire set
int max(void) const;
//@}
/// \name Predefined value
//@{
/// Empty set
GECODE_INT_EXPORT static const IntSet empty;
//@}
};
/**
* \brief Range iterator for integer sets
*
* \ingroup TaskModelIntVars TaskModelSetVars
*/
class IntSetRanges {
private:
/// Current range
const IntSet::Range* i;
/// End range
const IntSet::Range* e;
public:
/// \name Constructors and initialization
//@{
/// Default constructor
IntSetRanges(void);
/// Initialize with ranges for set \a s
IntSetRanges(const IntSet& s);
/// Initialize with ranges for set \a s
void init(const IntSet& s);
//@}
/// \name Iteration control
//@{
/// Test whether iterator is still at a range or done
bool operator ()(void) const;
/// Move iterator to next range (if possible)
void operator ++(void);
//@}
/// \name Range access
//@{
/// Return smallest value of range
int min(void) const;
/// Return largest value of range
int max(void) const;
/// Return width of range (distance between minimum and maximum)
unsigned int width(void) const;
//@}
};
/**
* \brief Value iterator for integer sets
*
* \ingroup TaskModelIntVars TaskModelSetVars
*/
class IntSetValues : public Iter::Ranges::ToValues<IntSetRanges> {
public:
/// \name Constructors and initialization
//@{
/// Default constructor
IntSetValues(void);
/// Initialize with values for \a s
IntSetValues(const IntSet& s);
/// Initialize with values for \a s
void init(const IntSet& s);
//@}
};
/**
* \brief Print integer set \a s
* \relates Gecode::IntSet
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const IntSet& s);
}
#include <gecode/int/int-set-1.hpp>
#include <gecode/int/var-imp.hpp>
namespace Gecode {
namespace Int {
class IntView;
}
/**
* \brief Integer variables
*
* \ingroup TaskModelIntVars
*/
class IntVar : public VarImpVar<Int::IntVarImp> {
friend class IntVarArray;
friend class IntVarArgs;
private:
using VarImpVar<Int::IntVarImp>::x;
/**
* \brief Initialize variable with range domain
*
* The variable is created with a domain ranging from \a min
* to \a max. No exceptions are thrown.
*/
void _init(Space& home, int min, int max);
/**
* \brief Initialize variable with arbitrary domain
*
* The variable is created with a domain described by \a d.
* No exceptions are thrown.
*/
void _init(Space& home, const IntSet& d);
public:
/// \name Constructors and initialization
//@{
/// Default constructor
IntVar(void);
/// Initialize from integer variable \a y
IntVar(const IntVar& y);
/// Initialize from integer view \a y
IntVar(const Int::IntView& y);
/**
* \brief Initialize variable with range domain
*
* The variable is created with a domain ranging from \a min
* to \a max. The following exceptions might be thrown:
* - If \a min is greater than \a max, an exception of type
* Gecode::Int::VariableEmptyDomain is thrown.
* - If \a min or \a max exceed the limits for integers as defined
* in Gecode::Int::Limits, an exception of type
* Gecode::Int::OutOfLimits is thrown.
*/
GECODE_INT_EXPORT IntVar(Space& home, int min, int max);
/**
* \brief Initialize variable with arbitrary domain
*
* The variable is created with a domain described by \a d.
* The following exceptions might be thrown:
* - If \a d is empty, an exception of type
* Gecode::Int::VariableEmptyDomain is thrown.
* - If \a d contains values that exceed the limits for integers
* as defined in Gecode::Int::Limits, an exception of type
* Gecode::Int::OutOfLimits is thrown.
*/
GECODE_INT_EXPORT IntVar(Space& home, const IntSet& d);
//@}
/// \name Value access
//@{
/// Return minimum of domain
int min(void) const;
/// Return maximum of domain
int max(void) const;
/// Return median of domain (greatest element not greater than the median)
int med(void) const;
/**
* \brief Return assigned value
*
* Throws an exception of type Int::ValOfUnassignedVar if variable
* is not yet assigned.
*
*/
int val(void) const;
/// Return size (cardinality) of domain
unsigned int size(void) const;
/// Return width of domain (distance between maximum and minimum)
unsigned int width(void) const;
/// Return regret of domain minimum (distance to next larger value)
unsigned int regret_min(void) const;
/// Return regret of domain maximum (distance to next smaller value)
unsigned int regret_max(void) const;
//@}
/// \name Domain tests
//@{
/// Test whether domain is a range
bool range(void) const;
/// Test whether \a n is contained in domain
bool in(int n) const;
//@}
};
/**
* \brief Print integer variable \a x
* \relates Gecode::IntVar
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const IntVar& x);
/**
* \brief %Range iterator for integer variables
* \ingroup TaskModelIntVars
*/
class IntVarRanges : public Int::IntVarImpFwd {
public:
/// \name Constructors and initialization
//@{
/// Default constructor
IntVarRanges(void);
/// Initialize with ranges for integer variable \a x
IntVarRanges(const IntVar& x);
/// Initialize with ranges for integer variable \a x
void init(const IntVar& x);
//@}
};
/**
* \brief Value iterator for integer variables
* \ingroup TaskModelIntVars
*/
class IntVarValues : public Iter::Ranges::ToValues<IntVarRanges> {
public:
/// \name Constructors and initialization
//@{
/// Default constructor
IntVarValues(void);
/// Initialize with values for \a x
IntVarValues(const IntVar& x);
/// Initialize with values \a x
void init(const IntVar& x);
//@}
};
namespace Int {
class BoolView;
}
/**
* \brief Boolean integer variables
*
* \ingroup TaskModelIntVars
*/
class BoolVar : public VarImpVar<Int::BoolVarImp> {
friend class BoolVarArray;
friend class BoolVarArgs;
private:
using VarImpVar<Int::BoolVarImp>::x;
/**
* \brief Initialize Boolean variable with range domain
*
* The variable is created with a domain ranging from \a min
* to \a max. No exceptions are thrown.
*/
void _init(Space& home, int min, int max);
public:
/// \name Constructors and initialization
//@{
/// Default constructor
BoolVar(void);
/// Initialize from Boolean variable \a y
BoolVar(const BoolVar& y);
/// Initialize from Boolean view \a y
BoolVar(const Int::BoolView& y);
/**
* \brief Initialize Boolean variable with range domain
*
* The variable is created with a domain ranging from \a min
* to \a max. The following exceptions might be thrown:
* - If \a min is greater than \a max, an exception of type
* Gecode::Int::VariableEmptyDomain is thrown.
* - If \a min is less than 0 or \a max is greater than 1,
* an exception of type
* Gecode::Int::NotZeroOne is thrown.
*/
GECODE_INT_EXPORT BoolVar(Space& home, int min, int max);
//@}
/// \name Value access
//@{
/// Return minimum of domain
int min(void) const;
/// Return maximum of domain
int max(void) const;
/// Return median of domain (greatest element not greater than the median)
int med(void) const;
/**
* \brief Return assigned value
*
* Throws an exception of type Int::ValOfUnassignedVar if variable
* is not yet assigned.
*
*/
int val(void) const;
/// Return size (cardinality) of domain
unsigned int size(void) const;
/// Return width of domain (distance between maximum and minimum)
unsigned int width(void) const;
/// Return regret of domain minimum (distance to next larger value)
unsigned int regret_min(void) const;
/// Return regret of domain maximum (distance to next smaller value)
unsigned int regret_max(void) const;
//@}
/// \name Domain tests
//@{
/// Test whether domain is a range
bool range(void) const;
/// Test whether \a n is contained in domain
bool in(int n) const;
//@}
/// \name Boolean domain tests
//@{
/// Test whether domain is zero
bool zero(void) const;
/// Test whether domain is one
bool one(void) const;
/// Test whether domain is neither zero nor one
bool none(void) const;
//@}
};
/**
* \brief Print Boolean variable \a x
* \relates Gecode::BoolVar
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const BoolVar& x);
}
#include <gecode/int/view.hpp>
#include <gecode/int/propagator.hpp>
namespace Gecode {
/**
* \defgroup TaskModelIntArgs Argument arrays
*
* Argument arrays are just good enough for passing arguments
* with automatic memory management.
* \ingroup TaskModelInt
*/
//@{
/// Passing set arguments
typedef ArgArray<IntSet> IntSetArgs;
}
#include <gecode/int/array-traits.hpp>
namespace Gecode {
/// Passing integer arguments
class IntArgs : public PrimArgArray<int> {
public:
/// \name Constructors and initialization
//@{
/// Allocate empty array
IntArgs(void);
/// Allocate array with \a n elements
explicit IntArgs(int n);
/// Allocate array and copy elements from \a x
IntArgs(const SharedArray<int>& x);
/// Allocate array and copy elements from \a x
IntArgs(const std::vector<int>& x);
/// Allocate array and copy elements from \a first to \a last
template<class InputIterator>
IntArgs(InputIterator first, InputIterator last);
/// Allocate array with \a n elements and initialize with \a e0, ...
GECODE_INT_EXPORT
IntArgs(int n, int e0, ...);
/// Allocate array with \a n elements and initialize with elements from array \a e
IntArgs(int n, const int* e);
/// Initialize from primitive argument array \a a (copy elements)
IntArgs(const PrimArgArray<int>& a);
/// Allocate array with \a n elements such that for all \f$0\leq i<n: x_i=\text{start}+i\cdot\text{inc}\f$
static IntArgs create(int n, int start, int inc=1);
//@}
};
/// \brief Passing integer variables
class IntVarArgs : public VarArgArray<IntVar> {
public:
/// \name Constructors and initialization
//@{
/// Allocate empty array
IntVarArgs(void) {}
/// Allocate array with \a n elements
explicit IntVarArgs(int n) : VarArgArray<IntVar>(n) {}
/// Initialize from variable argument array \a a (copy elements)
IntVarArgs(const IntVarArgs& a) : VarArgArray<IntVar>(a) {}
/// Initialize from variable array \a a (copy elements)
IntVarArgs(const VarArray<IntVar>& a) : VarArgArray<IntVar>(a) {}
/// Initialize from vector \a a
IntVarArgs(const std::vector<IntVar>& a) : VarArgArray<IntVar>(a) {}
/// Initialize from InputIterator \a first and \a last
template<class InputIterator>
IntVarArgs(InputIterator first, InputIterator last)
: VarArgArray<IntVar>(first,last) {}
/**
* \brief Initialize array with \a n new variables
*
* The variables are created with a domain ranging from \a min
* to \a max. The following execptions might be thrown:
* - If \a min is greater than \a max, an exception of type
* Gecode::Int::VariableEmptyDomain is thrown.
* - If \a min or \a max exceed the limits for integers as defined
* in Gecode::Int::Limits, an exception of type
* Gecode::Int::OutOfLimits is thrown.
*/
GECODE_INT_EXPORT
IntVarArgs(Space& home, int n, int min, int max);
/**
* \brief Initialize array with \a n new variables
*
* The variables are created with a domain described by \a s.
* The following execptions might be thrown:
* - If \a s is empty, an exception of type
* Gecode::Int::VariableEmptyDomain is thrown.
* - If \a s contains values that exceed the limits for integers
* as defined in Gecode::Int::Limits, an exception of type
* Gecode::Int::OutOfLimits is thrown.
*/
GECODE_INT_EXPORT
IntVarArgs(Space& home, int n, const IntSet& s);
//@}
};
/** \brief Passing Boolean variables
*
* We could have used a simple typedef instead, but doxygen cannot
* resolve some overloading then, leading to unusable documentation for
* important parts of the library. As long as there is no fix for this,
* we will keep this workaround.
*
*/
class BoolVarArgs : public VarArgArray<BoolVar> {
public:
/// \name Constructors and initialization
//@{
/// Allocate empty array
BoolVarArgs(void) {}
/// Allocate array with \a n elements
explicit BoolVarArgs(int n) : VarArgArray<BoolVar>(n) {}
/// Initialize from variable argument array \a a (copy elements)
BoolVarArgs(const BoolVarArgs& a) : VarArgArray<BoolVar>(a) {}
/// Initialize from variable array \a a (copy elements)
BoolVarArgs(const VarArray<BoolVar>& a)
: VarArgArray<BoolVar>(a) {}
/// Initialize from vector \a a
BoolVarArgs(const std::vector<BoolVar>& a) : VarArgArray<BoolVar>(a) {}
/// Initialize from InputIterator \a first and \a last
template<class InputIterator>
BoolVarArgs(InputIterator first, InputIterator last)
: VarArgArray<BoolVar>(first,last) {}
/**
* \brief Initialize array with \a n new variables
*
* The variables are created with a domain ranging from \a min
* to \a max. The following execptions might be thrown:
* - If \a min is greater than \a max, an exception of type
* Gecode::Int::VariableEmptyDomain is thrown.
* - If \a min is less than 0 or \a max is greater than 1,
* an exception of type
* Gecode::Int::NotZeroOne is thrown.
*/
GECODE_INT_EXPORT
BoolVarArgs(Space& home, int n, int min, int max);
//@}
};
//@}
/**
* \defgroup TaskModelIntVarArrays Variable arrays
*
* Variable arrays can store variables. They are typically used
* for storing the variables being part of a solution (script). However,
* they can also be used for temporary purposes (even though
* memory is not reclaimed until the space it is created for
* is deleted).
* \ingroup TaskModelInt
*/
/**
* \brief Integer variable array
* \ingroup TaskModelIntVarArrays
*/
class IntVarArray : public VarArray<IntVar> {
public:
/// \name Creation and initialization
//@{
/// Default constructor (array of size 0)
IntVarArray(void);
/// Allocate array for \a n integer variables (variables are uninitialized)
IntVarArray(Space& home, int n);
/// Initialize from integer variable array \a a (share elements)
IntVarArray(const IntVarArray& a);
/// Initialize from integer variable argument array \a a (copy elements)
IntVarArray(Space& home, const IntVarArgs& a);
/**
* \brief Initialize array with \a n new variables
*
* The variables are created with a domain ranging from \a min
* to \a max. The following execptions might be thrown:
* - If \a min is greater than \a max, an exception of type
* Gecode::Int::VariableEmptyDomain is thrown.
* - If \a min or \a max exceed the limits for integers as defined
* in Gecode::Int::Limits, an exception of type
* Gecode::Int::OutOfLimits is thrown.
*/
GECODE_INT_EXPORT
IntVarArray(Space& home, int n, int min, int max);
/**
* \brief Initialize array with \a n new variables
*
* The variables are created with a domain described by \a s.
* The following execptions might be thrown:
* - If \a s is empty, an exception of type
* Gecode::Int::VariableEmptyDomain is thrown.
* - If \a s contains values that exceed the limits for integers
* as defined in Gecode::Int::Limits, an exception of type
* Gecode::Int::OutOfLimits is thrown.
*/
GECODE_INT_EXPORT
IntVarArray(Space& home, int n, const IntSet& s);
//@}
};
/**
* \brief Boolean variable array
* \ingroup TaskModelIntVarArrays
*/
class BoolVarArray : public VarArray<BoolVar> {
public:
/// \name Creation and initialization
//@{
/// Default constructor (array of size 0)
BoolVarArray(void);
/// Allocate array for \a n Boolean variables (variables are uninitialized)
BoolVarArray(Space& home, int n);
/// Initialize from Boolean variable array \a a (share elements)
BoolVarArray(const BoolVarArray& a);
/// Initialize from Boolean variable argument array \a a (copy elements)
BoolVarArray(Space& home, const BoolVarArgs& a);
/**
* \brief Initialize array with \a n new variables
*
* The variables are created with a domain ranging from \a min
* to \a max. The following execptions might be thrown:
* - If \a min is greater than \a max, an exception of type
* Gecode::Int::VariableEmptyDomain is thrown.
* - If \a min is less than 0 or \a max is greater than 1,
* an exception of type
* Gecode::Int::NotZeroOne is thrown.
*/
GECODE_INT_EXPORT
BoolVarArray(Space& home, int n, int min, int max);
//@}
};
}
#include <gecode/int/int-set-2.hpp>
#include <gecode/int/array.hpp>
namespace Gecode {
/**
* \brief Mode for reification
* \ingroup TaskModelInt
*/
enum ReifyMode {
/**
* \brief Equivalence for reification (default)
*
* For a constraint \f$c\f$ and a Boolean control variable \f$b\f$
* defines that \f$b=1\Leftrightarrow c\f$ is propagated.
*/
RM_EQV,
/**
* \brief Implication for reification
*
* For a constraint \f$c\f$ and a Boolean control variable \f$b\f$
* defines that \f$b=1\Leftarrow c\f$ is propagated.
*/
RM_IMP,
/**
* \brief Inverse implication for reification
*
* For a constraint \f$c\f$ and a Boolean control variable \f$b\f$
* defines that \f$b=1\Rightarrow c\f$ is propagated.
*/
RM_PMI
};
/**
* \brief Reification specification
* \ingroup TaskModelInt
*/
class Reify {
protected:
/// The Boolean control variable
BoolVar x;
/// The reification mode
ReifyMode rm;
public:
/// Default constructor without proper initialization
Reify(void);
/// Construct reification specification
Reify(BoolVar x, ReifyMode rm=RM_EQV);
/// Return Boolean control variable
BoolVar var(void) const;
/// Return reification mode
ReifyMode mode(void) const;
/// Set Boolean control variable
void var(BoolVar x);
/// Set reification mode
void mode(ReifyMode rm);
};
/**
* \brief Use equivalence for reification
* \ingroup TaskModelInt
*/
Reify eqv(BoolVar x);
/**
* \brief Use implication for reification
* \ingroup TaskModelInt
*/
Reify imp(BoolVar x);
/**
* \brief Use reverse implication for reification
* \ingroup TaskModelInt
*/
Reify pmi(BoolVar x);
}
#include <gecode/int/reify.hpp>
namespace Gecode {
/**
* \brief Relation types for integers
* \ingroup TaskModelInt
*/
enum IntRelType {
IRT_EQ, ///< Equality (\f$=\f$)
IRT_NQ, ///< Disequality (\f$\neq\f$)
IRT_LQ, ///< Less or equal (\f$\leq\f$)
IRT_LE, ///< Less (\f$<\f$)
IRT_GQ, ///< Greater or equal (\f$\geq\f$)
IRT_GR ///< Greater (\f$>\f$)
};
/**
* \brief Operation types for Booleans
* \ingroup TaskModelInt
*/
enum BoolOpType {
BOT_AND, ///< Conjunction
BOT_OR, ///< Disjunction
BOT_IMP, ///< Implication
BOT_EQV, ///< Equivalence
BOT_XOR ///< Exclusive or
};
/**
* \brief Consistency levels for integer propagators
*
* The descriptions are meant to be suggestions. It is not
* required that a propagator achieves full domain consistency or
* full bounds consistency. It is more like: which level
* of consistency comes closest.
*
* If in the description of a constraint below no consistency level
* is mentioned, the propagator for the constraint implements
* domain consistency.
* \ingroup TaskModelInt
*/
enum IntConLevel {
ICL_VAL, ///< Value propagation or consistency (naive)
ICL_BND, ///< Bounds propagation or consistency
ICL_DOM, ///< Domain propagation or consistency
ICL_DEF ///< The default consistency for a constraint
};
/**
* \brief Type of task for scheduling constraints
*
* \ingroup TaskModelInt
*/
enum TaskType {
TT_FIXP, //< Task with fixed processing time
TT_FIXS, //< Task with fixed start time
TT_FIXE //< Task with fixed end time
};
/**
* \brief Argument arrays for passing task type arguments
*
* \ingroup TaskModelInt
*/
typedef PrimArgArray<TaskType> TaskTypeArgs;
/// Traits of %TaskTypeArgs
template<>
class ArrayTraits<PrimArgArray<TaskType> > {
public:
typedef TaskTypeArgs StorageType;
typedef TaskType ValueType;
typedef TaskTypeArgs ArgsType;
};
/**
* \defgroup TaskModelIntDomain Domain constraints
* \ingroup TaskModelInt
*
*/
//@{
/// Propagates \f$x=n\f$
GECODE_INT_EXPORT void
dom(Home home, IntVar x, int n,
IntConLevel icl=ICL_DEF);
/// Propagates \f$ x_i=n\f$ for all \f$0\leq i<|x|\f$
GECODE_INT_EXPORT void
dom(Home home, const IntVarArgs& x, int n,
IntConLevel icl=ICL_DEF);
/// Propagates \f$ l\leq x\leq m\f$
GECODE_INT_EXPORT void
dom(Home home, IntVar x, int l, int m,
IntConLevel icl=ICL_DEF);
/// Propagates \f$ l\leq x_i\leq m\f$ for all \f$0\leq i<|x|\f$
GECODE_INT_EXPORT void
dom(Home home, const IntVarArgs& x, int l, int m,
IntConLevel icl=ICL_DEF);
/// Propagates \f$ x\in s \f$
GECODE_INT_EXPORT void
dom(Home home, IntVar x, const IntSet& s,
IntConLevel icl=ICL_DEF);
/// Propagates \f$ x_i\in s\f$ for all \f$0\leq i<|x|\f$
GECODE_INT_EXPORT void
dom(Home home, const IntVarArgs& x, const IntSet& s,
IntConLevel icl=ICL_DEF);
/// Post domain consistent propagator for \f$ (x=n) \equiv r\f$
GECODE_INT_EXPORT void
dom(Home home, IntVar x, int n, Reify r,
IntConLevel icl=ICL_DEF);
/// Post domain consistent propagator for \f$ (l\leq x \leq m) \equiv r\f$
GECODE_INT_EXPORT void
dom(Home home, IntVar x, int l, int m, Reify r,
IntConLevel icl=ICL_DEF);
/// Post domain consistent propagator for \f$ (x \in s) \equiv r\f$
GECODE_INT_EXPORT void
dom(Home home, IntVar x, const IntSet& s, Reify r,
IntConLevel icl=ICL_DEF);
/// Constrain domain of \a x according to domain of \a d
GECODE_INT_EXPORT void
dom(Home home, IntVar x, IntVar d,
IntConLevel icl=ICL_DEF);
/// Constrain domain of \a x according to domain of \a d
GECODE_INT_EXPORT void
dom(Home home, BoolVar x, BoolVar d,
IntConLevel icl=ICL_DEF);
/// Constrain domain of \f$ x_i \f$ according to domain of \f$ d_i \f$ for all \f$0\leq i<|x|\f$
GECODE_INT_EXPORT void
dom(Home home, const IntVarArgs& x, const IntVarArgs& d,
IntConLevel icl=ICL_DEF);
/// Constrain domain of \f$ x_i \f$ according to domain of \f$ d_i \f$ for all \f$0\leq i<|x|\f$
GECODE_INT_EXPORT void
dom(Home home, const BoolVarArgs& x, const BoolVarArgs& d,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntRelInt Simple relation constraints over integer variables
* \ingroup TaskModelInt
*/
/** \brief Post propagator for \f$ x_0 \sim_{irt} x_1\f$
*
* Supports both bounds (\a icl = ICL_BND) and
* domain consistency (\a icl = ICL_DOM, default).
* \ingroup TaskModelIntRelInt
*/
GECODE_INT_EXPORT void
rel(Home home, IntVar x0, IntRelType irt, IntVar x1,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ x_i \sim_{irt} y \f$ for all \f$0\leq i<|x|\f$
*
* Supports both bounds (\a icl = ICL_BND) and
* domain consistency (\a icl = ICL_DOM, default).
* \ingroup TaskModelIntRelInt
*/
GECODE_INT_EXPORT void
rel(Home home, const IntVarArgs& x, IntRelType irt, IntVar y,
IntConLevel icl=ICL_DEF);
/** \brief Propagates \f$ x \sim_{irt} c\f$
* \ingroup TaskModelIntRelInt
*/
GECODE_INT_EXPORT void
rel(Home home, IntVar x, IntRelType irt, int c,
IntConLevel icl=ICL_DEF);
/** \brief Propagates \f$ x_i \sim_{irt} c \f$ for all \f$0\leq i<|x|\f$
* \ingroup TaskModelIntRelInt
*/
GECODE_INT_EXPORT void
rel(Home home, const IntVarArgs& x, IntRelType irt, int c,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ (x_0 \sim_{irt} x_1)\equiv r\f$
*
* Supports both bounds (\a icl = ICL_BND) and
* domain consistency (\a icl = ICL_DOM, default).
* \ingroup TaskModelIntRelInt
*/
GECODE_INT_EXPORT void
rel(Home home, IntVar x0, IntRelType irt, IntVar x1, Reify r,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$(x \sim_{irt} c)\equiv r\f$
*
* Supports both bounds (\a icl = ICL_BND) and
* domain consistency (\a icl = ICL_DOM, default).
* \ingroup TaskModelIntRelInt
*/
GECODE_INT_EXPORT void
rel(Home home, IntVar x, IntRelType irt, int c, Reify r,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for relation among elements in \a x.
*
* States that the elements of \a x are in the following relation:
* - if \a r = IRT_LE, \a r = IRT_LQ, \a r = IRT_GR, or \a r = IRT_GQ,
* then the elements of \a x are ordered with respect to \a r.
* Supports domain consistency (\a icl = ICL_DOM, default).
* - if \a r = IRT_EQ, then all elements of \a x must be equal.
* Supports both bounds (\a icl = ICL_BND) and
* domain consistency (\a icl = ICL_DOM, default).
* - if \a r = IRT_NQ, then not all elements of \a x must be equal.
* Supports domain consistency (\a icl = ICL_DOM, default).
*
* \ingroup TaskModelIntRelInt
*/
GECODE_INT_EXPORT void
rel(Home home, const IntVarArgs& x, IntRelType irt,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for relation between \a x and \a y.
*
* Note that for the inequality relations this corresponds to
* the lexical order between \a x and \a y.
*
* Supports both bounds (\a icl = ICL_BND) and
* domain consistency (\a icl = ICL_DOM, default).
*
* Note that the constraint is also defined if \a x and \a y are of
* different size. That means that if \a x and \a y are of different
* size, then if \a r = IRT_EQ the constraint is false and if
* \a r = IRT_NQ the constraint is subsumed.
* \ingroup TaskModelIntRelInt
*/
GECODE_INT_EXPORT void
rel(Home home, const IntVarArgs& x, IntRelType irt, const IntVarArgs& y,
IntConLevel icl=ICL_DEF);
/**
* \defgroup TaskModelIntRelBool Simple relation constraints over Boolean variables
* \ingroup TaskModelInt
*/
/** \brief Post domain consistent propagator for \f$ x_0 \sim_{irt} x_1\f$
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, BoolVar x0, IntRelType irt, BoolVar x1,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for \f$(x_0 \sim_{irt} x_1)\equiv r\f$
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, BoolVar x0, IntRelType irt, BoolVar x1, Reify r,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for \f$ x_i \sim_{irt} y \f$ for all \f$0\leq i<|x|\f$
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, const BoolVarArgs& x, IntRelType irt, BoolVar y,
IntConLevel icl=ICL_DEF);
/**
* \brief Propagates \f$ x \sim_{irt} n\f$
*
* Throws an exception of type Int::NotZeroOne, if \a n is neither
* 0 or 1.
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, BoolVar x, IntRelType irt, int n,
IntConLevel icl=ICL_DEF);
/**
* \brief Post domain consistent propagator for \f$(x \sim_{irt} n)\equiv r\f$
*
* Throws an exception of type Int::NotZeroOne, if \a n is neither
* 0 or 1.
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, BoolVar x, IntRelType irt, int n, Reify r,
IntConLevel icl=ICL_DEF);
/**
* \brief Propagates \f$ x_i \sim_{irt} n \f$ for all \f$0\leq i<|x|\f$
*
* Throws an exception of type Int::NotZeroOne, if \a n is neither
* 0 or 1.
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, const BoolVarArgs& x, IntRelType irt, int n,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for relation between \a x and \a y.
*
* Note that for the inequality relations this corresponds to
* the lexical order between \a x and \a y.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a x and \a y are of different size.
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, const BoolVarArgs& x, IntRelType irt, const BoolVarArgs& y,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for relation between elements in \a x.
*
* States that the elements of \a x are in the following relation:
* - if \a r = IRT_LE, \a r = IRT_LQ, \a r = IRT_GR, or \a r = IRT_GQ,
* then the elements of \a x are ordered with respect to \a r.
* - if \a r = IRT_EQ, then all elements of \a x must be equal.
* - if \a r = IRT_NQ, then not all elements of \a x must be equal.
*
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, const BoolVarArgs& x, IntRelType irt,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for Boolean operation on \a x0 and \a x1
*
* Posts propagator for \f$ x_0 \diamond_{\mathit{o}} x_1 = x_2\f$
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, BoolVar x0, BoolOpType o, BoolVar x1, BoolVar x2,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for Boolean operation on \a x0 and \a x1
*
* Posts propagator for \f$ x_0 \diamond_{\mathit{o}} x_1 = n\f$
*
* Throws an exception of type Int::NotZeroOne, if \a n is neither
* 0 or 1.
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, BoolVar x0, BoolOpType o, BoolVar x1, int n,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for Boolean operation on \a x
*
* Posts propagator for \f$ x_0 \diamond_{\mathit{o}} \cdots
* \diamond_{\mathit{o}} x_{|x|-1}= y\f$
*
* Throws an exception of type Int::TooFewArguments, if \f$|x|<2\f$
* and \a o is BOT_IMP, BOT_EQV, or BOT_XOR.
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, BoolOpType o, const BoolVarArgs& x, BoolVar y,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for Boolean operation on \a x
*
* Posts propagator for \f$ x_0 \diamond_{\mathit{o}} \cdots
* \diamond_{\mathit{o}} x_{|x|-1}= n\f$
*
* Throws an exception of type Int::NotZeroOne, if \a n is neither
* 0 or 1.
*
* Throws an exception of type Int::TooFewArguments, if \f$|x|<2\f$
* and \a o is BOT_IMP, BOT_EQV, or BOT_XOR.
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
rel(Home home, BoolOpType o, const BoolVarArgs& x, int n,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for Boolean clause with positive variables \a x and negative variables \a y
*
* Posts propagator for \f$ x_0 \diamond_{\mathit{o}} \cdots
* \diamond_{\mathit{o}} x_{|x|-1} \diamond_{\mathit{o}} \neg y_0
* \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} \neg y_{|y|-1}= z\f$
*
* Throws an exception of type Int::IllegalOperation, if \a o is different
* from BOT_AND or BOT_OR.
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
clause(Home home, BoolOpType o, const BoolVarArgs& x, const BoolVarArgs& y,
BoolVar z, IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for Boolean clause with positive variables \a x and negative variables \a y
*
* Posts propagator for \f$ x_0 \diamond_{\mathit{o}} \cdots
* \diamond_{\mathit{o}} x_{|x|-1} \diamond_{\mathit{o}} \neg y_0
* \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} \neg y_{|y|-1}= n\f$
*
* Throws an exception of type Int::NotZeroOne, if \a n is neither
* 0 or 1.
*
* Throws an exception of type Int::IllegalOperation, if \a o is different
* from BOT_AND or BOT_OR.
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
clause(Home home, BoolOpType o, const BoolVarArgs& x, const BoolVarArgs& y,
int n, IntConLevel icl=ICL_DEF);
/** \brief Post propagator for if-then-else constraint
*
* Posts propagator for \f$ z = b ? x : y \f$
*
* \ingroup TaskModelIntRelBool
*/
GECODE_INT_EXPORT void
ite(Home home, BoolVar b, IntVar x, IntVar y, IntVar z,
IntConLevel icl=ICL_DEF);
/**
* \defgroup TaskModelIntPrecede Value precedence constraints over integer variables
* \ingroup TaskModelInt
*/
/** \brief Post propagator that \a s precedes \a t in \a x
*
* This constraint enforces that \f$x_0\neq t\f$ and
* \f$x_j=t \to \bigvee_{0\leq i<j} x_i=s\f$ for \f$0\leq j<|x|\f$.
* The propagator is domain consistent.
* \ingroup TaskModelIntPrecede
*/
GECODE_INT_EXPORT void
precede(Home home, const IntVarArgs& x, int s, int t,
IntConLevel=ICL_DEF);
/** \brief Post propagator that successive values in \a c precede each other in \a x
*
* This constraint enforces that \f$x_0\neq c_k\f$ for \f$0<k<|c|\f$ and
* \f$x_j=c_{k} \to \bigvee_{0\leq i<j} x_i=c_{k-1}\f$ for \f$0\leq j<|x|\f$
* and \f$0< k<|c|\f$.
* \ingroup TaskModelIntPrecede
*/
GECODE_INT_EXPORT void
precede(Home home, const IntVarArgs& x, const IntArgs& c,
IntConLevel=ICL_DEF);
/**
* \defgroup TaskModelIntMember Membership constraints
* \ingroup TaskModelInt
*/
//@{
/// Post domain consistent propagator for \f$y\in \{x_0,\ldots,x_{|x|-1}\}\f$
GECODE_INT_EXPORT void
member(Home home, const IntVarArgs& x, IntVar y,
IntConLevel icl=ICL_DEF);
/// Post domain consistent propagator for \f$y\in \{x_0,\ldots,x_{|x|-1}\}\f$
GECODE_INT_EXPORT void
member(Home home, const BoolVarArgs& x, BoolVar y,
IntConLevel icl=ICL_DEF);
/// Post domain consistent propagator for \f$\left(y\in \{x_0,\ldots,x_{|x|-1}\}\right)\equiv r\f$
GECODE_INT_EXPORT void
member(Home home, const IntVarArgs& x, IntVar y, Reify r,
IntConLevel icl=ICL_DEF);
/// Post domain consistent propagator for \f$\left(y\in \{x_0,\ldots,x_{|x|-1}\}\right)\equiv r\f$
GECODE_INT_EXPORT void
member(Home home, const BoolVarArgs& x, BoolVar y, Reify r,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntElement Element constraints
* \ingroup TaskModelInt
*/
//@{
/// Arrays of integers that can be shared among several element constraints
typedef SharedArray<int> IntSharedArray;
/** \brief Post domain consistent propagator for \f$ n_{x_0}=x_1\f$
*
* Throws an exception of type Int::OutOfLimits, if
* the integers in \a n exceed the limits in Int::Limits.
*/
GECODE_INT_EXPORT void
element(Home home, IntSharedArray n, IntVar x0, IntVar x1,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for \f$ n_{x_0}=x_1\f$
*
* Throws an exception of type Int::OutOfLimits, if
* the integers in \a n exceed the limits in Int::Limits.
*/
GECODE_INT_EXPORT void
element(Home home, IntSharedArray n, IntVar x0, BoolVar x1,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for \f$ n_{x_0}=x_1\f$
*
* Throws an exception of type Int::OutOfLimits, if
* the integers in \a n exceed the limits in Int::Limits.
*/
GECODE_INT_EXPORT void
element(Home home, IntSharedArray n, IntVar x0, int x1,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ x_{y_0}=y_1\f$
*
* Supports both bounds (\a icl = ICL_BND) and
* domain consistency (\a icl = ICL_DOM, default).
*/
GECODE_INT_EXPORT void
element(Home home, const IntVarArgs& x, IntVar y0, IntVar y1,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ x_{y_0}=y_1\f$
*
* Supports both bounds (\a icl = ICL_BND) and
* domain consistency (\a icl = ICL_DOM, default).
*/
GECODE_INT_EXPORT void
element(Home home, const IntVarArgs& x, IntVar y0, int y1,
IntConLevel icl=ICL_DEF);
/// Post domain consistent propagator for \f$ x_{y_0}=y_1\f$
GECODE_INT_EXPORT void
element(Home home, const BoolVarArgs& x, IntVar y0, BoolVar y1,
IntConLevel icl=ICL_DEF);
/// Post domain consistent propagator for \f$ x_{y_0}=y_1\f$
GECODE_INT_EXPORT void
element(Home home, const BoolVarArgs& x, IntVar y0, int y1,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for \f$ a_{x+w\cdot y}=z\f$
*
* If \a a is regarded as a two-dimensional array in row-major
* order of width \a w and height \a h, then \a z is constrained
* to be the element in column \a x and row \a y.
*
* Throws an exception of type Int::OutOfLimits, if
* the integers in \a n exceed the limits in Int::Limits.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \f$ w\cdot h\neq|a|\f$.
*/
GECODE_INT_EXPORT void
element(Home home, IntSharedArray a,
IntVar x, int w, IntVar y, int h, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for \f$ a_{x+w\cdot y}=z\f$
*
* If \a a is regarded as a two-dimensional array in row-major
* order of width \a w and height \a h, then \a z is constrained
* to be the element in column \a x and row \a y.
*
* Throws an exception of type Int::OutOfLimits, if
* the integers in \a n exceed the limits in Int::Limits.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \f$ w\cdot h\neq|a|\f$.
*/
GECODE_INT_EXPORT void
element(Home home, IntSharedArray a,
IntVar x, int w, IntVar y, int h, BoolVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ a_{x+w\cdot y}=z\f$
*
* If \a a is regarded as a two-dimensional array in row-major
* order of width \a w and height \a h, then \a z is constrained
* to be the element in column \a x and row \a y.
*
* Supports both bounds (\a icl = ICL_BND) and
* domain consistency (\a icl = ICL_DOM, default).
*
* Throws an exception of type Int::OutOfLimits, if
* the integers in \a n exceed the limits in Int::Limits.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \f$ w\cdot h\neq|a|\f$.
*/
GECODE_INT_EXPORT void
element(Home home, const IntVarArgs& a,
IntVar x, int w, IntVar y, int h, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post domain consistent propagator for \f$ a_{x+w\cdot y}=z\f$
*
* If \a a is regarded as a two-dimensional array in row-major
* order of width \a w and height \a h, then \a z is constrained
* to be the element in column \a x and row \a y.
*
* Throws an exception of type Int::OutOfLimits, if
* the integers in \a n exceed the limits in Int::Limits.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \f$ w\cdot h\neq|a|\f$.
*/
GECODE_INT_EXPORT void
element(Home home, const BoolVarArgs& a,
IntVar x, int w, IntVar y, int h, BoolVar z,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntDistinct Distinct constraints
* \ingroup TaskModelInt
*/
//@{
/** \brief Post propagator for \f$ x_i\neq x_j\f$ for all \f$0\leq i\neq j<|x|\f$
*
* Supports value (\a icl = ICL_VAL, default), bounds (\a icl = ICL_BND),
* and domain consistency (\a icl = ICL_DOM).
*
* Throws an exception of type Int::ArgumentSame, if \a x contains
* the same unassigned variable multiply.
*/
GECODE_INT_EXPORT void
distinct(Home home, const IntVarArgs& x,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ x_i+n_i\neq x_j+n_j\f$ for all \f$0\leq i\neq j<|x|\f$
*
* \li Supports value (\a icl = ICL_VAL, default), bounds (\a icl = ICL_BND),
* and domain consistency (\a icl = ICL_DOM).
* \li Throws an exception of type Int::OutOfLimits, if
* the integers in \a n exceed the limits in Int::Limits
* or if the sum of \a n and \a x exceed the limits.
* \li Throws an exception of type Int::ArgumentSizeMismatch, if
* \a x and \a n are of different size.
* \li Throws an exception of type Int::ArgumentSame, if \a x contains
* the same unassigned variable multiply.
*/
GECODE_INT_EXPORT void
distinct(Home home, const IntArgs& n, const IntVarArgs& x,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntChannel Channel constraints
* \ingroup TaskModelInt
*/
//@{
/** \brief Post propagator for \f$ x_i = j\leftrightarrow y_j=i\f$ for all \f$0\leq i<|x|\f$
*
* \li Supports domain consistency (\a icl = ICL_DOM) and value
* propagation (all other values for \a icl, default).
* \li Throws an exception of type Int::ArgumentSizeMismatch, if
* \a x and \a y are of different size.
* \li Throws an exception of type Int::ArgumentSame, if \a x or
* \a y contain the same unassigned variable multiply. Note that a
* variable can occur in both \a x and \a y, but not more than
* once in either \a x or \a y.
*/
GECODE_INT_EXPORT void
channel(Home home, const IntVarArgs& x, const IntVarArgs& y,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ x_i - \mathit{xoff} = j\leftrightarrow y_j - \mathit{yoff} = i\f$ for all \f$0\leq i<|x|\f$
*
* \li Supports domain consistency (\a icl = ICL_DOM) and value
* propagation (all other values for \a icl, default).
* \li Throws an exception of type Int::ArgumentSizeMismatch, if
* \a x and \a y are of different size.
* \li Throws an exception of type Int::ArgumentSame, if \a x or
* \a y contain the same unassigned variable multiply. Note that a
* variable can occur in both \a x and \a y, but not more than
* once in either \a x or \a y.
* \li Throws an exception of type Int::OutOfLimits, if \a xoff or
* \a yoff are negative.
*/
GECODE_INT_EXPORT void
channel(Home home, const IntVarArgs& x, int xoff,
const IntVarArgs& y, int yoff,
IntConLevel icl=ICL_DEF);
/// Post domain consistent propagator for channeling a Boolean and an integer variable \f$ x_0 = x_1\f$
GECODE_INT_EXPORT void
channel(Home home, BoolVar x0, IntVar x1,
IntConLevel icl=ICL_DEF);
/// Post domain consistent propagator for channeling an integer and a Boolean variable \f$ x_0 = x_1\f$
forceinline void
channel(Home home, IntVar x0, BoolVar x1,
IntConLevel icl=ICL_DEF) {
channel(home,x1,x0,icl);
}
/** \brief Post domain consistent propagator for channeling Boolean and integer variables \f$ x_i = 1\leftrightarrow y=i+o\f$
*
* Throws an exception of type Int::ArgumentSame, if \a x
* contains the same unassigned variable multiply.
*/
GECODE_INT_EXPORT void
channel(Home home, const BoolVarArgs& x, IntVar y, int o=0,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntSorted Sorted constraints
*
* All sorted constraints support bounds consistency only.
*
* \ingroup TaskModelInt
*/
//@{
/**
* \brief Post propagator that \a y is \a x sorted in increasing order
*
* Might throw the following exceptions:
* - Int::ArgumentSizeMismatch, if \a x and \a y differ in size.
* - Int::ArgumentSame, if \a x or \a y contain
* shared unassigned variables.
*/
GECODE_INT_EXPORT void
sorted(Home home, const IntVarArgs& x, const IntVarArgs& y,
IntConLevel icl=ICL_DEF);
/**
* \brief Post propagator that \a y is \a x sorted in increasing order
*
* The values in \a z describe the sorting permutation, that is
* \f$\forall i\in\{0,\dots,|x|-1\}: x_i=y_{z_i} \f$.
*
* Might throw the following exceptions:
* - Int::ArgumentSizeMismatch, if \a x and \a y differ in size.
* - Int::ArgumentSame, if \a x or \a y contain
* shared unassigned variables.
*/
GECODE_INT_EXPORT void
sorted(Home home, const IntVarArgs& x, const IntVarArgs& y,
const IntVarArgs& z,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntCount Counting constraints
* \ingroup TaskModelInt
*
* \note
* Domain consistency on the extended cardinality variables of
* the Global Cardinality Propagator is only obtained if they are bounds
* consistent, otherwise the problem of enforcing domain consistency
* on the cardinality variables is NP-complete as proved by
* Qumiper et. al. in
* ''Improved Algorithms for the Global Cardinality Constraint''.
*/
//@{
/** \brief Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\sim_{irt} m\f$
*
* Performs domain propagation but is not domain consistent.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x, int n, IntRelType irt, int m,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i\in y\}\sim_{irt} m\f$
*
* Performs domain propagation but is not domain consistent.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x, const IntSet& y, IntRelType irt, int m,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\sim_{irt} m\f$
*
* Performs domain propagation (\a icl = ICL_DOM, default)
* and slightly less domain propagation (all other values for \a icl),
* where \a y is not pruned. Note that in both cases propagation
* is not comain consistent.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x, IntVar y, IntRelType irt, int m,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\sim_{irt} m\f$
*
* Performs domain propagation but is not domain consistent.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a x and \a y are of different size.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x, const IntArgs& y, IntRelType irt, int m,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\sim_{irt} z\f$
*
* Performs domain propagation but is not domain consistent.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x, int n, IntRelType irt, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i\in y\}\sim_{irt} z\f$
*
* Performs domain propagation but is not domain consistent.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x, const IntSet& y, IntRelType irt, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\sim_{irt} z\f$
*
* Performs domain propagation (\a icl = ICL_DOM, default)
* and slightly less domain propagation (all other values for \a icl),
* where \a y is not pruned. Note that in both cases propagation
* is not comain consistent.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x, IntVar y, IntRelType irt, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\sim_{irt} z\f$
*
* Performs domain propagation but is not domain consistent.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a x and \a y are of different size.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x, const IntArgs& y, IntRelType irt, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Posts a global count (cardinality) constraint
*
* Posts the constraint that
* \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=j\}=c_j\f$ and
* \f$ \bigcup_i \{x_i\} \subseteq \{0,\ldots,|c|-1\}\f$
* (no other value occurs).
*
* Supports value (\a icl = ICL_VAL, default), bounds (\a icl = ICL_BND),
* and domain consistency (\a icl = ICL_DOM).
*
* Throws an exception of type Int::ArgumentSame, if \a x contains
* the same unassigned variable multiply.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x, const IntVarArgs& c,
IntConLevel icl=ICL_DEF);
/** \brief Posts a global count (cardinality) constraint
*
* Posts the constraint that
* \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=j\}\in c_j\f$ and
* \f$ \bigcup_i \{x_i\} \subseteq \{0,\ldots,|c|-1\}\f$
* (no other value occurs).
*
* Supports value (\a icl = ICL_VAL, default), bounds (\a icl = ICL_BND),
* and domain consistency (\a icl = ICL_DOM).
*
* Throws an exception of type Int::ArgumentSame, if \a x contains
* the same unassigned variable multiply.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x, const IntSetArgs& c,
IntConLevel icl=ICL_DEF);
/** \brief Posts a global count (cardinality) constraint
*
* Posts the constraint that
* \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=v_j\}=c_j\f$ and
* \f$ \bigcup_i \{x_i\} \subseteq \bigcup_j \{v_j\}\f$
* (no other value occurs).
*
* Supports value (\a icl = ICL_VAL, default), bounds (\a icl = ICL_BND),
* and domain consistency (\a icl = ICL_DOM).
*
* Throws an exception of type Int::ArgumentSame, if \a x contains
* the same unassigned variable multiply.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a c and \a v are of different size.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x,
const IntVarArgs& c, const IntArgs& v,
IntConLevel icl=ICL_DEF);
/** \brief Posts a global count (cardinality) constraint
*
* Posts the constraint that
* \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=v_j\}\in c_j\f$ and
* \f$ \bigcup_i \{x_i\} \subseteq \bigcup_j \{v_j\}\f$
* (no other value occurs).
*
* Supports value (\a icl = ICL_VAL, default), bounds (\a icl = ICL_BND),
* and domain consistency (\a icl = ICL_DOM).
*
* Throws an exception of type Int::ArgumentSame, if \a x contains
* the same unassigned variable multiply.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a c and \a v are of different size.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x,
const IntSetArgs& c, const IntArgs& v,
IntConLevel icl=ICL_DEF);
/** \brief Posts a global count (cardinality) constraint
*
* Posts the constraint that
* \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=v_j\}\in c\f$ and
* \f$ \bigcup_i \{x_i\} \subseteq \bigcup_j \{v_j\}\f$
* (no other value occurs).
*
* Supports value (\a icl = ICL_VAL, default), bounds (\a icl = ICL_BND),
* and domain consistency (\a icl = ICL_DOM).
*
* Throws an exception of type Int::ArgumentSame, if \a x contains
* the same unassigned variable multiply.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a c and \a v are of different size.
*/
GECODE_INT_EXPORT void
count(Home home, const IntVarArgs& x,
const IntSet& c, const IntArgs& v,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntNValues Number of values constraints
* \ingroup TaskModelInt
*
* The number of values constraints perform propagation
* following: C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan,
* and T. Walsh, Filtering Algorithms for the NValue
* Constraint, Constraints, 11(4), 271-293, 2006.
*/
//@{
/** \brief Post propagator for \f$\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y\f$
*
*/
GECODE_INT_EXPORT void
nvalues(Home home, const IntVarArgs& x, IntRelType irt, int y,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y\f$
*
*/
GECODE_INT_EXPORT void
nvalues(Home home, const IntVarArgs& x, IntRelType irt, IntVar y,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y\f$
*
*/
GECODE_INT_EXPORT void
nvalues(Home home, const BoolVarArgs& x, IntRelType irt, int y,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y\f$
*
*/
GECODE_INT_EXPORT void
nvalues(Home home, const BoolVarArgs& x, IntRelType irt, IntVar y,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntSequence Sequence constraints
* \ingroup TaskModelInt
*/
//@{
/** \brief Post propagator for \f$\operatorname{sequence}(x,s,q,l,u)\f$
*
* Posts a domain consistent propagator for the constraint
* \f$\bigwedge_{i=0}^{|x|-q}
* \operatorname{among}(\langle x_i,\ldots,x_{i+q-1}\rangle,s,l,u)\f$
* where the among constraint is defined as
* \f$l\leq\#\{j\in\{i,\ldots,i+q-1\}\;|\;x_j\in s\} \leq u\f$.
*
* Throws the following exceptions:
* - Of type Int::TooFewArguments, if \f$|x|=0\f$.
* - Of type Int::ArgumentSame, if \a x contains
* the same unassigned variable multiply.
* - Of type Int::OutOfRange, if \f$q < 1 \vee q > |x|\f$.
*/
GECODE_INT_EXPORT void
sequence(Home home, const IntVarArgs& x, const IntSet& s,
int q, int l, int u, IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\operatorname{sequence}(x,s,q,l,u)\f$
*
* Posts a domain consistent propagator for the constraint
* \f$\bigwedge_{i=0}^{|x|-q}
* \operatorname{among}(\langle x_i,\ldots,x_{i+q-1}\rangle,s,l,u)\f$
* where the among constraint is defined as
* \f$l\leq\#\{j\in\{i,\ldots,i+q-1\}\;|\;x_j\in s\} \leq u\f$.
*
* Throws the following exceptions:
* - Of type Int::TooFewArguments, if \f$|x|=0\f$.
* - Of type Int::ArgumentSame, if \a x contains
* the same unassigned variable multiply.
* - Of type Int::OutOfRange, if \f$q < 1 \vee q > |x|\f$.
*/
GECODE_INT_EXPORT void
sequence(Home home, const BoolVarArgs& x, const IntSet& s,
int q, int l, int u, IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntExt Extensional constraints
* \ingroup TaskModelInt
*
* Extensional constraints support different ways of how the
* extensionally defined relation between the variables is defined.
* Examples include specification by a %DFA or a table.
*
* A %DFA can be defined by a regular expression, for regular expressions
* see the module MiniModel.
*/
//@{
/**
* \brief Deterministic finite automaton (%DFA)
*
* After initialization, the start state is always zero.
* The final states are contiguous ranging from the first to the
* last final state.
*/
class DFA : public SharedHandle {
private:
/// Implementation of DFA
class DFAI;
public:
/// Specification of a %DFA transition
class Transition {
public:
int i_state; ///< input state
int symbol; ///< symbol
int o_state; ///< output state
/// Default constructor
Transition();
/// Initialize members
Transition(int i_state0, int symbol0, int o_state0);
};
/// Iterator for %DFA transitions (sorted by symbols)
class Transitions {
private:
/// Current transition
const Transition* c_trans;
/// End of transitions
const Transition* e_trans;
public:
/// Initialize to all transitions of DFA \a d
Transitions(const DFA& d);
/// Initialize to transitions of DFA \a d for symbol \a n
Transitions(const DFA& d, int n);
/// Test whether iterator still at a transition
bool operator ()(void) const;
/// Move iterator to next transition
void operator ++(void);
/// Return in-state of current transition
int i_state(void) const;
/// Return symbol of current transition
int symbol(void) const;
/// Return out-state of current transition
int o_state(void) const;
};
/// Iterator for %DFA symbols
class Symbols {
private:
/// Current transition
const Transition* c_trans;
/// End of transitions
const Transition* e_trans;
public:
/// Initialize to symbols of DFA \a d
Symbols(const DFA& d);
/// Test whether iterator still at a symbol
bool operator ()(void) const;
/// Move iterator to next symbol
void operator ++(void);
/// Return current symbol
int val(void) const;
};
public:
friend class Transitions;
/// Initialize for DFA accepting the empty word
DFA(void);
/**
* \brief Initialize DFA
*
* - Start state is given by \a s.
* - %Transitions are described by \a t, where the last element
* must have -1 as value for \c i_state.
* - Final states are given by \a f, where the last final element
* must be -1.
* - Minimizes the DFA, if \a minimize is true.
* - Note that the transitions must be deterministic.
*/
GECODE_INT_EXPORT
DFA(int s, Transition t[], int f[], bool minimize=true);
/// Initialize by DFA \a d (DFA is shared)
DFA(const DFA& d);
/// Return the number of states
int n_states(void) const;
/// Return the number of transitions
int n_transitions(void) const;
/// Return the number of symbols
unsigned int n_symbols(void) const;
/// Return maximal degree (in-degree and out-degree) of any state
unsigned int max_degree(void) const;
/// Return the number of the first final state
int final_fst(void) const;
/// Return the number of the last final state
int final_lst(void) const;
/// Return smallest symbol in DFA
int symbol_min(void) const;
/// Return largest symbol in DFA
int symbol_max(void) const;
};
/**
* \brief Extensional propagation kind
*
* Signals that a particular kind is used in propagation for
* the implementation of a extensional constraint.
*
*/
enum ExtensionalPropKind {
EPK_DEF, ///< Make a default decision
EPK_SPEED, ///< Prefer speed over memory consumption
EPK_MEMORY ///< Prefer little memory over speed
};
/**
* \brief Post domain consistent propagator for extensional constraint described by a DFA
*
* The elements of \a x must be a word of the language described by
* the DFA \a d.
*
* Throws an exception of type Int::ArgumentSame, if \a x contains
* the same unassigned variable multiply. If shared occurences of variables
* are required, unshare should be used.
*/
GECODE_INT_EXPORT void
extensional(Home home, const IntVarArgs& x, DFA d,
IntConLevel icl=ICL_DEF);
/**
* \brief Post domain consistent propagator for extensional constraint described by a DFA
*
* The elements of \a x must be a word of the language described by
* the DFA \a d.
*
* Throws an exception of type Int::ArgumentSame, if \a x contains
* the same unassigned variable multiply. If shared occurences of variables
* are required, unshare should be used.
*/
GECODE_INT_EXPORT void
extensional(Home home, const BoolVarArgs& x, DFA d,
IntConLevel icl=ICL_DEF);
/** \brief Class represeting a set of tuples.
*
* A TupleSet is used for storing an extensional representation of a
* constraint. After a TupleSet is finalized, no more tuples may be
* added to it.
*/
class TupleSet : public SharedHandle {
public:
/** \brief Type of a tuple
*
* The arity of the tuple is left implicit.
*/
typedef int* Tuple;
/**
* \brief Data stored for a Table
*
*/
class GECODE_VTABLE_EXPORT TupleSetI
: public SharedHandle::Object {
public:
/// Arity
int arity;
/// Number of Tuples
int size;
/// Tuples index
Tuple** tuples;
/// Tuple index data
Tuple* tuple_data;
/// Tuples data
int* data;
/// Excess storage
int excess;
/// Minimum and maximum in domain-values
int min, max;
/// Domain size
unsigned int domsize;
/// Initial last structure
Tuple** last;
/// Pointer to NULL-pointer
Tuple* nullpointer;
/// Add Tuple. Assumes that arity matches.
template<class T>
void add(T t);
/// Finalize datastructure (disallows additions of more Tuples)
GECODE_INT_EXPORT void finalize(void);
/// Resize data cache
GECODE_INT_EXPORT void resize(void);
/// Is datastructure finalized
bool finalized(void) const;
/// Initialize as empty tuple set
TupleSetI(void);
/// Delete implementation
GECODE_INT_EXPORT virtual ~TupleSetI(void);
/// Create a copy
GECODE_INT_EXPORT virtual SharedHandle::Object* copy(void) const;
};
/// Get implementation
TupleSetI* implementation(void);
/// Construct empty tuple set
TupleSet(void);
/// Initialize by TupleSet \a d (tuple set is shared)
TupleSet(const TupleSet& d);
/// Add tuple to tuple set
void add(const IntArgs& tuple);
/// Finalize tuple set
void finalize(void);
/// Is tuple set finalized
bool finalized(void) const;
/// Arity of tuple set
int arity(void) const;
/// Number of tuples
int tuples(void) const;
/// Get tuple i
Tuple operator [](int i) const;
/// Minimum domain element
int min(void) const;
/// Maximum domain element
int max(void) const;
};
/** \brief Post propagator for \f$x\in t\f$.
*
* \li Supports implementations optimized for memory (\a epk = \a
* EPK_MEMORY, default) and speed (\a epk = \a EPK_SPEED).
* \li Supports domain consistency (\a icl = ICL_DOM, default) only.
* \li Throws an exception of type Int::ArgumentSizeMismatch, if
* \a x and \a t are of different size.
* \li Throws an exception of type Int::NotYetFinalized, if the tuple
* set \a t has not been finalized.
*
* \warning If the domains for the \f$x_i\f$ are not dense and
* have similar bounds, lots of memory will be wasted (memory
* consumption is in \f$
* O\left(|x|\cdot\min_i(\underline{x_i})\cdot\max_i(\overline{x_i})\right)\f$
* for the basic algorithm (\a epk = \a EPK_MEMORY) and additionally \f$
* O\left(|x|^2\cdot\min_i(\underline{x_i})\cdot\max_i(\overline{x_i})\right)\f$
* for the incremental algorithm (\a epk = \a EPK_SPEED).
*/
GECODE_INT_EXPORT void
extensional(Home home, const IntVarArgs& x, const TupleSet& t,
ExtensionalPropKind epk=EPK_DEF, IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$x\in t\f$.
*
* \li Supports implementations optimized for memory (\a epk = \a
* EPK_MEMORY, default) and speed (\a epk = \a EPK_SPEED).
* \li Supports domain consistency (\a icl = ICL_DOM, default) only.
* \li Throws an exception of type Int::ArgumentSizeMismatch, if
* \a x and \a t are of different size.
* \li Throws an exception of type Int::NotYetFinalized, if the tuple
* set \a t has not been finalized.
*/
GECODE_INT_EXPORT void
extensional(Home home, const BoolVarArgs& x, const TupleSet& t,
ExtensionalPropKind epk=EPK_DEF, IntConLevel icl=ICL_DEF);
//@}
}
#include <gecode/int/extensional/dfa.hpp>
#include <gecode/int/extensional/tuple-set.hpp>
namespace Gecode {
/**
* \defgroup TaskModelIntArith Arithmetic constraints
* \ingroup TaskModelInt
*/
//@{
/** \brief Post propagator for \f$ \min\{x_0,x_1\}=x_2\f$
*
* Supports both bounds consistency (\a icl = ICL_BND, default)
* and domain consistency (\a icl = ICL_DOM).
*/
GECODE_INT_EXPORT void
min(Home home, IntVar x0, IntVar x1, IntVar x2,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ \min x=y\f$
*
* Supports both bounds consistency (\a icl = ICL_BND, default)
* and domain consistency (\a icl = ICL_DOM).
*
* If \a x is empty, an exception of type Int::TooFewArguments is thrown.
*/
GECODE_INT_EXPORT void
min(Home home, const IntVarArgs& x, IntVar y,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ \max\{x_0,x_1\}=x_2\f$
*
* Supports both bounds consistency (\a icl = ICL_BND, default)
* and domain consistency (\a icl = ICL_DOM).
*/
GECODE_INT_EXPORT void
max(Home home, IntVar x0, IntVar x1, IntVar x2,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ \max x=y\f$
*
* Supports both bounds consistency (\a icl = ICL_BND, default)
* and domain consistency (\a icl = ICL_DOM).
*
* If \a x is empty, an exception of type Int::TooFewArguments is thrown.
*/
GECODE_INT_EXPORT void
max(Home home, const IntVarArgs& x, IntVar y,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ \operatorname{argmin} x=y\f$
*
* In case of ties, the smallest value for \a y is chosen
* (provided \a tiebreak is true).
*
* If \a x is empty, an exception of type Int::TooFewArguments is thrown.
* If \a y occurs in \a x, an exception of type Int::ArgumentSame
* is thrown.
*/
GECODE_INT_EXPORT void
argmin(Home home, const IntVarArgs& x, IntVar y, bool tiebreak=true,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ \operatorname{argmax} x=y\f$
*
* In case of ties, the smallest value for \a y is chosen
* (provided \a tiebreak is true).
*
* If \a x is empty, an exception of type Int::TooFewArguments is thrown.
* If \a y occurs in \a x, an exception of type Int::ArgumentSame
* is thrown.
*/
GECODE_INT_EXPORT void
argmax(Home home, const IntVarArgs& x, IntVar y, bool tiebreak=true,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$ |x_0|=x_1\f$
*
* Supports both bounds consistency (\a icl = ICL_BND, default)
* and domain consistency (\a icl = ICL_DOM).
*/
GECODE_INT_EXPORT void
abs(Home home, IntVar x0, IntVar x1,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$x_0\cdot x_1=x_2\f$
*
* Supports both bounds consistency (\a icl = ICL_BND, default)
* and domain consistency (\a icl = ICL_DOM).
*/
GECODE_INT_EXPORT void
mult(Home home, IntVar x0, IntVar x1, IntVar x2,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$x_0\ \mathrm{div}\ x_1=x_2 \land x_0\ \mathrm{mod}\ x_1 = x_3\f$
*
* Supports bounds consistency (\a icl = ICL_BND, default).
*/
GECODE_INT_EXPORT void
divmod(Home home, IntVar x0, IntVar x1, IntVar x2, IntVar x3,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$x_0\ \mathrm{div}\ x_1=x_2\f$
*
* Supports bounds consistency (\a icl = ICL_BND, default).
*/
GECODE_INT_EXPORT void
div(Home home, IntVar x0, IntVar x1, IntVar x2,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$x_0\ \mathrm{mod}\ x_1=x_2\f$
*
* Supports bounds consistency (\a icl = ICL_BND, default).
*/
GECODE_INT_EXPORT void
mod(Home home, IntVar x0, IntVar x1, IntVar x2,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$x_0^2=x_1\f$
*
* Supports both bounds consistency (\a icl = ICL_BND, default)
* and domain consistency (\a icl = ICL_DOM).
*/
GECODE_INT_EXPORT void
sqr(Home home, IntVar x0, IntVar x1,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\lfloor\sqrt{x_0}\rfloor=x_1\f$
*
* Supports both bounds consistency (\a icl = ICL_BND, default)
* and domain consistency (\a icl = ICL_DOM).
*/
GECODE_INT_EXPORT void
sqrt(Home home, IntVar x0, IntVar x1,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$x_0^n=x_1\f$
*
* Supports both bounds consistency (\a icl = ICL_BND, default)
* and domain consistency (\a icl = ICL_DOM).
*
* Throws an exception of type Int::OutOfLimits, if \a n is
* negative.
*/
GECODE_INT_EXPORT void
pow(Home home, IntVar x0, int n, IntVar x1,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\lfloor\sqrt[n]{x_0}\rfloor=x_1\f$
*
* Supports both bounds consistency (\a icl = ICL_BND, default)
* and domain consistency (\a icl = ICL_DOM).
*
* Throws an exception of type Int::OutOfLimits, if \a n is
* not strictly positive.
*/
GECODE_INT_EXPORT void
nroot(Home home, IntVar x0, int n, IntVar x1,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntLI Linear constraints over integer variables
* \ingroup TaskModelInt
*
* All variants for linear constraints over integer variables share
* the following properties:
* - Bounds consistency (over the real numbers) is supported for
* all constraints (actually, for disequlities always domain consistency
* is used as it is cheaper). Domain consistency is supported for all
* non-reified constraint. As bounds consistency for inequalities
* coincides with domain consistency, the only
* real variation is for linear equations. Domain consistent
* linear equations have exponential complexity, so use with care!
* - Variables occurring multiply in the argument arrays are replaced
* by a single occurrence: for example, \f$ax+bx\f$ becomes
* \f$(a+b)x\f$.
* - If in the above simplification the value for \f$(a+b)\f$ (or for
* \f$a\f$ and \f$b\f$) exceeds the limits for integers as
* defined in Int::Limits, an exception of type
* Int::OutOfLimits is thrown.
* - Assume the constraint
* \f$\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c\f$.
* If \f$|c|+\sum_{i=0}^{|x|-1}a_i\cdot x_i\f$ exceeds the maximal
* available precision (at least \f$2^{48}\f$), an exception of
* type Int::OutOfLimits is thrown.
* - In all other cases, the created propagators are accurate (that
* is, they will not silently overflow during propagation).
*/
/** \brief Post propagator for \f$\sum_{i=0}^{|x|-1}x_i\sim_{irt} c\f$
* \ingroup TaskModelIntLI
*/
GECODE_INT_EXPORT void
linear(Home home, const IntVarArgs& x,
IntRelType irt, int c,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\sum_{i=0}^{|x|-1}x_i\sim_{irt} y\f$
* \ingroup TaskModelIntLI
*/
GECODE_INT_EXPORT void
linear(Home home, const IntVarArgs& x,
IntRelType irt, IntVar y,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} c\right)\equiv r\f$
* \ingroup TaskModelIntLI
*/
GECODE_INT_EXPORT void
linear(Home home, const IntVarArgs& x,
IntRelType irt, int c, Reify r,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} y\right)\equiv r\f$
* \ingroup TaskModelIntLI
*/
GECODE_INT_EXPORT void
linear(Home home, const IntVarArgs& x,
IntRelType irt, IntVar y, Reify r,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c\f$
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a a and \a x are of different size.
* \ingroup TaskModelIntLI
*/
GECODE_INT_EXPORT void
linear(Home home, const IntArgs& a, const IntVarArgs& x,
IntRelType irt, int c,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y\f$
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a a and \a x are of different size.
* \ingroup TaskModelIntLI
*/
GECODE_INT_EXPORT void
linear(Home home, const IntArgs& a, const IntVarArgs& x,
IntRelType irt, IntVar y,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c\right)\equiv r\f$
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a a and \a x are of different size.
* \ingroup TaskModelIntLI
*/
GECODE_INT_EXPORT void
linear(Home home, const IntArgs& a, const IntVarArgs& x,
IntRelType irt, int c, Reify r,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y\right)\equiv r\f$
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a a and \a x are of different size.
* \ingroup TaskModelIntLI
*/
GECODE_INT_EXPORT void
linear(Home home, const IntArgs& a, const IntVarArgs& x,
IntRelType irt, IntVar y, Reify r,
IntConLevel icl=ICL_DEF);
/**
* \defgroup TaskModelIntLB Linear constraints over Boolean variables
* \ingroup TaskModelInt
*
* All variants for linear constraints over Boolean variables share
* the following properties:
* - Bounds consistency (over the real numbers) is supported for
* all constraints (actually, for disequlities always domain consistency
* is used as it is cheaper).
* - Variables occurring multiply in the argument arrays are replaced
* by a single occurrence: for example, \f$ax+bx\f$ becomes
* \f$(a+b)x\f$.
* - If in the above simplification the value for \f$(a+b)\f$ (or for
* \f$a\f$ and \f$b\f$) exceeds the limits for integers as
* defined in Int::Limits, an exception of type
* Int::OutOfLimits is thrown.
* - Assume the constraint
* \f$\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c\f$.
* If \f$|c|+\sum_{i=0}^{|x|-1}a_i\cdot x_i\f$ exceeds the limits
* for integers as defined in Int::Limits, an exception of
* type Int::OutOfLimits is thrown.
* - In all other cases, the created propagators are accurate (that
* is, they will not silently overflow during propagation).
*/
/** \brief Post propagator for \f$\sum_{i=0}^{|x|-1}x_i\sim_{irt} c\f$
* \ingroup TaskModelIntLB
*/
GECODE_INT_EXPORT void
linear(Home home, const BoolVarArgs& x,
IntRelType irt, int c,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} c\right)\equiv r\f$
* \ingroup TaskModelIntLB
*/
GECODE_INT_EXPORT void
linear(Home home, const BoolVarArgs& x,
IntRelType irt, int c, Reify r,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\sum_{i=0}^{|x|-1}x_i\sim_{irt} y\f$
* \ingroup TaskModelIntLB
*/
GECODE_INT_EXPORT void
linear(Home home, const BoolVarArgs& x,
IntRelType irt, IntVar y,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} y\right)\equiv r\f$
* \ingroup TaskModelIntLB
*/
GECODE_INT_EXPORT void
linear(Home home, const BoolVarArgs& x,
IntRelType irt, IntVar y, Reify r,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c\f$
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a a and \a x are of different size.
* \ingroup TaskModelIntLB
*/
GECODE_INT_EXPORT void
linear(Home home, const IntArgs& a, const BoolVarArgs& x,
IntRelType irt, int c,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c\right)\equiv r\f$
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a a and \a x are of different size.
* \ingroup TaskModelIntLB
*/
GECODE_INT_EXPORT void
linear(Home home, const IntArgs& a, const BoolVarArgs& x,
IntRelType irt, int c, Reify r,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y\f$
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a a and \a x are of different size.
* \ingroup TaskModelIntLB
*/
GECODE_INT_EXPORT void
linear(Home home, const IntArgs& a, const BoolVarArgs& x,
IntRelType irt, IntVar y,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for \f$\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y\right)\equiv r\f$
*
* Throws an exception of type Int::ArgumentSizeMismatch, if
* \a a and \a x are of different size.
* \ingroup TaskModelIntLB
*/
GECODE_INT_EXPORT void
linear(Home home, const IntArgs& a, const BoolVarArgs& x,
IntRelType irt, IntVar y, Reify r,
IntConLevel icl=ICL_DEF);
/**
* \defgroup TaskModelIntBinPacking Bin packing constraints
* \ingroup TaskModelInt
*
*/
/** \brief Post propagator for bin packing
*
* The variables in \a l are the loads for each bin, whereas the
* variables in \a b define for each item into which bin it is packed.
* The integer values \a s define the size of the items.
*
* It is propagated that for each \f$j\f$ with \f$0\leq j<|l|\f$ the
* constraint \f$l_j=\sum_{0\leq i<|b|\wedge b_i=j}s_i\f$ holds and that
* for each \f$i\f$ with \f$0\leq i<|b|\f$ the constraint
* \f$0\leq b_i<|l|\f$ holds.
*
* The propagation follows: Paul Shaw. A Constraint for Bin Packing. CP 2004.
*
* Throws the following exceptions:
* - Of type Int::ArgumentSizeMismatch if \a b and \a s are not of
* the same size.
* - Of type Int::ArgumentSame if \a l and \a b share unassigned variables.
* - Of type Int::OutOfLimits if \a s contains a negative number.
*
* \ingroup TaskModelIntBinPacking
*/
GECODE_INT_EXPORT void
binpacking(Home home,
const IntVarArgs& l,
const IntVarArgs& b, const IntArgs& s,
IntConLevel icl=ICL_DEF);
/* \brief Post propagator for multi-dimensional bin packing
*
* In the following \a n refers to the number of items and \a m
* refers to the number of bins.
*
* The multi-dimensional bin-packing constraint enforces that
* all items are packed into bins
* \f$b_i\in\{0,\ldots,m-1\}\f$ for \f$0\leq i<n\f$
* and that the load of each bin corresponds to the items
* packed into it for each dimension \f$l_{j\cdot
* d + k} = \sum_{\{i\in\{0,\ldots,n-1\}|
* b_{j\cdot d+k}=i}\}s_{i\cdot d+k}\f$
* for \f$0\leq j<m\f$, \f$0\leq k<d\f$
* Furthermore, the load variables must satisfy the capacity
* constraints \f$l_{j\cdot d + k} \leq
* c_k\f$ for \f$0\leq j<m\f$, \f$0\leq k<d\f$.
*
* The constraint is implemented by the decomposition
* introduced in: Stefano Gualandi and Michele Lombardi. A
* simple and effective decomposition for the multidimensional
* binpacking constraint. CP 2013, pages 356--364.
*
* Posting the constraint returns a maximal set containing conflicting
* items that require pairwise different bins.
*
* Note that posting the constraint has exponential complexity in the
* number of items due to the Bron-Kerbosch algorithm used for finding
* the maximal conflict item sets.
*
* Throws the following exceptions:
* - Of type Int::ArgumentSizeMismatch if any of the following properties
* is violated: \f$|b|=n\f$, \f$|l|=m\cdot d\f$, \f$|s|=n\cdot d\f$,
* and \f$|c|=d\f$.
* - Of type Int::ArgumentSame if \a l and \a b share unassigned variables.
* - Of type Int::OutOfLimits if \a s or \a c contains a negative number.
*
* \ingroup TaskModelIntBinPacking
*/
GECODE_INT_EXPORT IntSet
binpacking(Home home, int d,
const IntVarArgs& l, const IntVarArgs& b,
const IntArgs& s, const IntArgs& c,
IntConLevel icl=ICL_DEF);
/**
* \defgroup TaskModelIntGeoPacking Geometrical packing constraints
* \ingroup TaskModelInt
*
* Constraints for modeling geometrical packing problems.
*/
/** \brief Post propagator for rectangle packing
*
* Propagate that no two rectangles as described by the coordinates
* \a x, and \a y, widths \a w, and heights \a h overlap.
*
* Throws the following exceptions:
* - Of type Int::ArgumentSizeMismatch if \a x, \a w, \a y, or \a h
* are not of the same size.
* - Of type Int::OutOfLimits if \a w or \a h contain a negative number.
*
* \ingroup TaskModelIntGeoPacking
*/
GECODE_INT_EXPORT void
nooverlap(Home home,
const IntVarArgs& x, const IntArgs& w,
const IntVarArgs& y, const IntArgs& h,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for rectangle packing
*
* Propagate that no two rectangles as described by the coordinates
* \a x, and \a y, widths \a w, and heights \a h overlap. The rectangles
* can be optional, as described by the Boolean variables \a o.
*
* Throws the following exceptions:
* - Of type Int::ArgumentSizeMismatch if \a x, \a w, \a y, \a h, or \a o
* are not of the same size.
* - Of type Int::OutOfLimits if \a w or \a h contain a negative number.
*
* \ingroup TaskModelIntGeoPacking
*/
GECODE_INT_EXPORT void
nooverlap(Home home,
const IntVarArgs& x, const IntArgs& w,
const IntVarArgs& y, const IntArgs& h,
const BoolVarArgs& o,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for rectangle packing
*
* Propagate that no two rectangles as described by the start coordinates
* \a x0 and \a y0, widths \a w and heights \a h, and end coordinates
* \a x1 and \a y1 overlap.
*
* Note that the relations \f$x0_i+w_i=x1_i\f$ and \f$y0_i+h_i=y1_i\f$ are
* not propagated (for \f$0\leq i<|x0|\f$). That is, additional constraints
* must be posted to enforce that relation.
*
* Throws the following exceptions:
* - Of type Int::ArgumentSizeMismatch if \a x0, \a x1, \a w,
* \a y0, \a y1, or \a h are not of the same size.
*
* \ingroup TaskModelIntGeoPacking
*/
GECODE_INT_EXPORT void
nooverlap(Home home,
const IntVarArgs& x0, const IntVarArgs& w, const IntVarArgs& x1,
const IntVarArgs& y0, const IntVarArgs& h, const IntVarArgs& y1,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator for rectangle packing
*
* Propagate that no two rectangles as described by the start coordinates
* \a x0 and \a y0, widths \a w and heights \a h, and end coordinates
* \a x1 and \a y1 overlap. The rectangles can be optional, as described
* by the Boolean variables \a o.
*
* Note that the relations \f$x0_i+w_i=x1_i\f$ and \f$y0_i+h_i=y1_i\f$ are
* not propagated (for \f$0\leq i<|x0|\f$). That is, additional constraints
* must be posted to enforce that relation.
*
* Throws the following exceptions:
* - Of type Int::ArgumentSizeMismatch if \a x0, \a x1, \a w,
* \a y0, \a y1, or \a h are not of the same size.
*
* \ingroup TaskModelIntGeoPacking
*/
GECODE_INT_EXPORT void
nooverlap(Home home,
const IntVarArgs& x0, const IntVarArgs& w, const IntVarArgs& x1,
const IntVarArgs& y0, const IntVarArgs& h, const IntVarArgs& y1,
const BoolVarArgs& o,
IntConLevel icl=ICL_DEF);
/**
* \defgroup TaskModelIntScheduling Scheduling constraints
* \ingroup TaskModelInt
*/
//@{
/**
* \brief Post propagators for the cumulatives constraint
*
* This function creates propagators for the cumulatives constraint
* presented in <em>"A new multi-resource cumulatives constraint
* with negative heights"</em>, Nicolas Beldiceanu and Mats
* Carlsson, Principles and Practice of Constraint Programming 2002.
*
* The constraint models a set of machines and a set of tasks that
* should be assigned to the machines. The machines have a positive
* resource limit and the tasks each have a resource usage that can
* be either positive, negative, or zero. The constraint is enforced
* over each point in time for a machine where there is at least one
* task assigned.
*
* The propagator does not enforce \f$s_i+p_i=e_i\f$, this constraint
* has to be posted in addition to ensure consistency of the task bounds.
*
* The limit for a machine is either the maximum amount available at
* any given time (\a at_most = true), or else the least amount to
* be used (\a at_most = false).
*
* \param home current space
* \param m \f$ m_i \f$ is the machine assigned to task \f$ i \f$
* \param s \f$ s_i \f$ is the start time assigned to task \f$ i \f$
* \param p \f$ p_i \f$ is the processing time of task \f$ i \f$
* \param e \f$ e_i \f$ is the end time assigned to task \f$ i \f$
* \param u \f$ u_i \f$ is the amount of
* resources consumed by task \f$ i \f$
* \param c \f$ c_r \f$ is the capacity, the amount of resource available
* for machine \f$ r \f$
* \param at_most \a at_most tells if the amount of resources used
* for a machine should be less than the limit (\a at_most
* = true) or greater than the limit (\a at_most = false)
* \param icl Supports value-consistency only (\a icl = ICL_VAL, default).
*
* \exception Int::ArgumentSizeMismatch thrown if the sizes
* of the arguments representing tasks does not match.
* \exception Int::OutOfLimits thrown if any numerical argument is
* larger than Int::Limits::max or less than
* Int::Limits::min.
*/
GECODE_INT_EXPORT void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for the cumulatives constraint.
*
* \copydoc cumulatives()
*/
GECODE_INT_EXPORT void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for the cumulatives constraint.
*
* \copydoc cumulatives()
*/
GECODE_INT_EXPORT void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for the cumulatives constraint.
*
* \copydoc cumulatives()
*/
GECODE_INT_EXPORT void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for the cumulatives constraint.
*
* \copydoc cumulatives()
*/
GECODE_INT_EXPORT void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for the cumulatives constraint.
*
* \copydoc cumulatives()
*/
GECODE_INT_EXPORT void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for the cumulatives constraint.
*
* \copydoc cumulatives()
*/
GECODE_INT_EXPORT void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for the cumulatives constraint.
*
* \copydoc cumulatives()
*/
GECODE_INT_EXPORT void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling tasks on unary resources
*
* Schedule tasks with start times \a s and processing times \a p
* on a unary resource. The propagator uses the algorithms from:
* Petr VilÃm, Global Constraints in Scheduling, PhD thesis,
* Charles University, Prague, Czech Republic, 2007.
*
* The propagator performs overload checking, detectable precendence
* propagation, not-first-not-last propagation, and edge finding.
*
* - Throws an exception of type Int::ArgumentSizeMismatch, if \a s
* and \a p are of different size.
* - Throws an exception of type Int::ArgumentSame, if \a s contains
* the same unassigned variable multiply.
* - Throws an exception of type Int::OutOfLimits, if \a p contains
* an integer that is negative or that could generate
* an overflow.
*/
GECODE_INT_EXPORT void
unary(Home home, const IntVarArgs& s, const IntArgs& p,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling optional tasks on unary resources
*
* Schedule optional tasks with start times \a s, processing times \a p,
* and whether a task is mandatory \a m (a task is mandatory if the
* Boolean variable is 1) on a unary resource. The propagator uses the
* algorithms from:
* Petr VilÃm, Global Constraints in Scheduling, PhD thesis,
* Charles University, Prague, Czech Republic, 2007.
*
* The propagator performs overload checking, detectable precendence
* propagation, not-first-not-last propagation, and edge finding.
*
* - Throws an exception of type Int::ArgumentSizeMismatch, if \a s,
* \a p, or \a m are of different size.
* - Throws an exception of type Int::ArgumentSame, if \a s contains
* the same unassigned variable multiply.
* - Throws an exception of type Int::OutOfLimits, if \a p contains
* an integer that is negative or that could generate
* an overflow.
*/
GECODE_INT_EXPORT void
unary(Home home, const IntVarArgs& s, const IntArgs& p,
const BoolVarArgs& m, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling tasks on unary resources
*
* Schedule tasks with flexible times \a flex and fixed times \a fix
* on a unary resource. For each
* task, it depends on \a t how the flexible and fix times are interpreted:
* - If <code>t[i]</code> is <code>TT_FIXP</code>, then
* <code>flex[i]</code> is the start time and <code>fix[i]</code> is the
* processing time.
* - If <code>t[i]</code> is <code>TT_FIXS</code>, then
* <code>flex[i]</code> is the end time and <code>fix[i]</code> is the
* start time.
* - If <code>t[i]</code> is <code>TT_FIXE</code>, then
* <code>flex[i]</code> is the start time and <code>fix[i]</code> is the
* end time.
*
* The propagator uses the algorithms from:
* Petr VilÃm, Global Constraints in Scheduling, PhD thesis,
* Charles University, Prague, Czech Republic, 2007.
*
* The propagator performs overload checking, detectable precendence
* propagation, not-first-not-last propagation, and edge finding.
*
* - Throws an exception of type Int::ArgumentSizeMismatch, if \a s
* and \a p are of different size.
* - Throws an exception of type Int::OutOfLimits, if \a p contains
* an integer that is negative for a task with type <code>TT_FIXP</code>
* or that could generate an overflow.
*/
GECODE_INT_EXPORT void
unary(Home home, const TaskTypeArgs& t,
const IntVarArgs& flex, const IntArgs& fix, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling optional tasks on unary resources
*
* Schedule optional tasks with flexible times \a flex, fixed times \a fix,
* and whether a task is mandatory \a m (a task is mandatory if the
* Boolean variable is 1) on a unary resource. For each
* task, it depends on \a t how the flexible and fix times are interpreted:
* - If <code>t[i]</code> is <code>TT_FIXP</code>, then
* <code>flex[i]</code> is the start time and <code>fix[i]</code> is the
* processing time.
* - If <code>t[i]</code> is <code>TT_FIXS</code>, then
* <code>flex[i]</code> is the end time and <code>fix[i]</code> is the
* start time.
* - If <code>t[i]</code> is <code>TT_FIXE</code>, then
* <code>flex[i]</code> is the start time and <code>fix[i]</code> is the
* end time.
*
* The propagator uses the
* algorithms from:
* Petr VilÃm, Global Constraints in Scheduling, PhD thesis,
* Charles University, Prague, Czech Republic, 2007.
*
* The propagator performs overload checking, detectable precendence
* propagation, not-first-not-last propagation, and edge finding.
*
* - Throws an exception of type Int::ArgumentSizeMismatch, if \a s,
* \a p, or \a m are of different size.
* - Throws an exception of type Int::OutOfLimits, if \a p contains
* an integer that is negative for a task with type <code>TT_FIXP</code>
* or that could generate an overflow.
*/
GECODE_INT_EXPORT void
unary(Home home, const TaskTypeArgs& t,
const IntVarArgs& flex, const IntArgs& fix,
const BoolVarArgs& m, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling tasks on unary resources
*
* Schedule tasks with start times \a s, processing times \a p, and
* end times \a e
* on a unary resource. The propagator uses the algorithms from:
* Petr VilÃm, Global Constraints in Scheduling, PhD thesis,
* Charles University, Prague, Czech Republic, 2007.
*
* The propagator does not enforce \f$s_i+p_i=e_i\f$, this constraint
* has to be posted in addition to ensure consistency of the task bounds.
*
* The propagator performs overload checking, detectable precendence
* propagation, not-first-not-last propagation, and edge finding.
*
* The processing times are constrained to be non-negative.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if \a s
* and \a p are of different size.
*/
GECODE_INT_EXPORT void
unary(Home home, const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling optional tasks on unary resources
*
* Schedule optional tasks with start times \a s, processing times \a p,
* end times \a e,
* and whether a task is mandatory \a m (a task is mandatory if the
* Boolean variable is 1) on a unary resource. The propagator uses the
* algorithms from:
* Petr VilÃm, Global Constraints in Scheduling, PhD thesis,
* Charles University, Prague, Czech Republic, 2007.
*
* The propagator does not enforce \f$s_i+p_i=e_i\f$, this constraint
* has to be posted in addition to ensure consistency of the task bounds.
*
* The processing times are constrained to be non-negative.
*
* The propagator performs overload checking, detectable precendence
* propagation, not-first-not-last propagation, and edge finding.
*
* Throws an exception of type Int::ArgumentSizeMismatch, if \a s,
* \a p, or \a m are of different size.
*/
GECODE_INT_EXPORT void
unary(Home home, const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const BoolVarArgs& m, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling tasks on cumulative resources
*
* Schedule tasks with flexible times \a flex, fixed times \a fix, and
* use capacity \a u on a cumulative resource with capacity \a c. For each
* task, it depends on \a t how the flexible and fix times are interpreted:
* - If <code>t[i]</code> is <code>TT_FIXP</code>, then
* <code>flex[i]</code> is the start time and <code>fix[i]</code> is the
* processing time.
* - If <code>t[i]</code> is <code>TT_FIXS</code>, then
* <code>flex[i]</code> is the end time and <code>fix[i]</code> is the
* start time.
* - If <code>t[i]</code> is <code>TT_FIXE</code>, then
* <code>flex[i]</code> is the start time and <code>fix[i]</code> is the
* end time.
*
* The propagator performs time-tabling, overload checking, and
* edge-finding. It uses algorithms taken from:
*
* Petr VilÃm, Max Energy Filtering Algorithm for Discrete Cumulative
* Resources, in W. J. van Hoeve and J. N. Hooker, editors, CPAIOR, volume
* 5547 of LNCS, pages 294-308. Springer, 2009.
*
* and
*
* Petr VilÃm, Edge finding filtering algorithm for discrete cumulative
* resources in O(kn log n). In I. P. Gent, editor, CP, volume 5732 of LNCS,
* pages 802-816. Springer, 2009.
*
* - Throws an exception of type Int::ArgumentSizeMismatch, if \a t, \a s
* \a p, or \a u are of different size.
* - Throws an exception of type Int::OutOfLimits, if \a p, \a u, or \a c
* contain an integer that is not nonnegative, or that could generate
* an overflow.
*/
GECODE_INT_EXPORT void
cumulative(Home home, int c, const TaskTypeArgs& t,
const IntVarArgs& flex, const IntArgs& fix, const IntArgs& u,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling tasks on cumulative resources
*
* \copydoc cumulative(Home,int,const TaskTypeArgs&,const IntVarArgs&,const IntArgs&,const IntArgs&,IntConLevel)
*/
GECODE_INT_EXPORT void
cumulative(Home home, IntVar c, const TaskTypeArgs& t,
const IntVarArgs& flex, const IntArgs& fix, const IntArgs& u,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling optional tasks on cumulative resources
*
* Schedule tasks with flexible times \a flex, fixed times \a fix,
* use capacity \a u, and whether a task is mandatory \a m (a task is
* mandatory if the Boolean variable is 1) on a cumulative resource with
* capacity \a c. For each
* task, it depends on \a t how the flexible and fix times are interpreted:
* - If <code>t[i]</code> is <code>TT_FIXP</code>, then
* <code>flex[i]</code> is the start time and <code>fix[i]</code> is the
* processing time.
* - If <code>t[i]</code> is <code>TT_FIXS</code>, then
* <code>flex[i]</code> is the end time and <code>fix[i]</code> is the
* start time.
* - If <code>t[i]</code> is <code>TT_FIXE</code>, then
* <code>flex[i]</code> is the start time and <code>fix[i]</code> is the
* end time.
*
* The propagator performs time-tabling, overload checking, and
* edge-finding. It uses algorithms taken from:
*
* Petr VilÃm, Max Energy Filtering Algorithm for Discrete Cumulative
* Resources, in W. J. van Hoeve and J. N. Hooker, editors, CPAIOR, volume
* 5547 of LNCS, pages 294-308. Springer, 2009.
*
* and
*
* Petr VilÃm, Edge finding filtering algorithm for discrete cumulative
* resources in O(kn log n). In I. P. Gent, editor, CP, volume 5732 of LNCS,
* pages 802-816. Springer, 2009.
*
* - Throws an exception of type Int::ArgumentSizeMismatch, if \a t, \a s
* \a p, or \a u are of different size.
* - Throws an exception of type Int::OutOfLimits, if \a p, \a u, or \a c
* contain an integer that is not nonnegative, or that could generate
* an overflow.
*/
GECODE_INT_EXPORT void
cumulative(Home home, int c, const TaskTypeArgs& t,
const IntVarArgs& flex, const IntArgs& fix, const IntArgs& u,
const BoolVarArgs& m, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling optional tasks on cumulative resources
* \copydoc cumulative(Home,int,const TaskTypeArgs&,const IntVarArgs&,const IntArgs&,const IntArgs&,const BoolVarArgs&,IntConLevel)
*/
GECODE_INT_EXPORT void
cumulative(Home home, IntVar c, const TaskTypeArgs& t,
const IntVarArgs& flex, const IntArgs& fix, const IntArgs& u,
const BoolVarArgs& m, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling tasks on cumulative resources
*
* Schedule tasks with start times \a s, processing times \a p, and
* use capacity \a u on a cumulative resource with capacity \a c.
*
* The propagator performs time-tabling, overload checking, and
* edge-finding. It uses algorithms taken from:
*
* Petr VilÃm, Max Energy Filtering Algorithm for Discrete Cumulative
* Resources, in W. J. van Hoeve and J. N. Hooker, editors, CPAIOR, volume
* 5547 of LNCS, pages 294-308. Springer, 2009.
*
* and
*
* Petr VilÃm, Edge finding filtering algorithm for discrete cumulative
* resources in O(kn log n). In I. P. Gent, editor, CP, volume 5732 of LNCS,
* pages 802-816. Springer, 2009.
*
* - Throws an exception of type Int::ArgumentSizeMismatch, if \a s
* \a p, or \a u are of different size.
* - Throws an exception of type Int::OutOfLimits, if \a p, \a u, or \a c
* contain an integer that is not nonnegative, or that could generate
* an overflow.
*/
GECODE_INT_EXPORT void
cumulative(Home home, int c, const IntVarArgs& s, const IntArgs& p,
const IntArgs& u, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling tasks on cumulative resources
* \copydoc cumulative(Home,int,const IntVarArgs&,const IntArgs&,const IntArgs&,IntConLevel)
*/
GECODE_INT_EXPORT void
cumulative(Home home, IntVar c, const IntVarArgs& s, const IntArgs& p,
const IntArgs& u, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling optional tasks on cumulative resources
*
* Schedule optional tasks with start times \a s, processing times \a p,
* used capacity \a u, and whether a task is mandatory \a m (a task is
* mandatory if the Boolean variable is 1) on a cumulative resource
* with capacity \a c.
*
* The propagator performs time-tabling, overload checking, and
* edge-finding. It uses algorithms taken from:
*
* Petr VilÃm, Max Energy Filtering Algorithm for Discrete Cumulative
* Resources, in W. J. van Hoeve and J. N. Hooker, editors, CPAIOR, volume
* 5547 of LNCS, pages 294-308. Springer, 2009.
*
* and
*
* Petr VilÃm, Edge finding filtering algorithm for discrete cumulative
* resources in O(kn log n). In I. P. Gent, editor, CP, volume 5732 of LNCS,
* pages 802-816. Springer, 2009.
*
* - Throws an exception of type Int::ArgumentSizeMismatch, if \a s,
* \a p, \a u, or \a m are of different size.
* - Throws an exception of type Int::OutOfLimits, if \a p, \a u, or \a c
* contain an integer that is not nonnegative, or that could generate
* an overflow.
*/
GECODE_INT_EXPORT void
cumulative(Home home, int c, const IntVarArgs& s, const IntArgs& p,
const IntArgs& u, const BoolVarArgs& m, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling optional tasks on cumulative resources
* \copydoc cumulative(Home,int,const IntVarArgs&,const IntArgs&,const IntArgs&,const BoolVarArgs&,IntConLevel)
*/
GECODE_INT_EXPORT void
cumulative(Home home, IntVar c, const IntVarArgs& s, const IntArgs& p,
const IntArgs& u, const BoolVarArgs& m, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling tasks on cumulative resources
*
* Schedule tasks with start times \a s, processing times \a p,
* end times \a e, and
* use capacity \a u on a cumulative resource with capacity \a c.
*
* The propagator does not enforce \f$s_i+p_i=e_i\f$, this constraint
* has to be posted in addition to ensure consistency of the task bounds.
*
* The propagator performs time-tabling, overload checking, and
* edge-finding. It uses algorithms taken from:
*
* Petr VilÃm, Max Energy Filtering Algorithm for Discrete Cumulative
* Resources, in W. J. van Hoeve and J. N. Hooker, editors, CPAIOR, volume
* 5547 of LNCS, pages 294-308. Springer, 2009.
*
* and
*
* Petr VilÃm, Edge finding filtering algorithm for discrete cumulative
* resources in O(kn log n). In I. P. Gent, editor, CP, volume 5732 of LNCS,
* pages 802-816. Springer, 2009.
*
* - Throws an exception of type Int::ArgumentSizeMismatch, if \a s
* \a p, or \a u are of different size.
* - Throws an exception of type Int::OutOfLimits, if \a u or \a c
* contain an integer that is not nonnegative, or that could generate
* an overflow.
*/
GECODE_INT_EXPORT void
cumulative(Home home, int c, const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntArgs& u, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling tasks on cumulative resources
* \copydoc cumulative(Home,int,const IntVarArgs&,const IntVarArgs&,const IntVarArgs&,const IntArgs&,IntConLevel)
*/
GECODE_INT_EXPORT void
cumulative(Home home, IntVar c, const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntArgs& u, IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling optional tasks on cumulative resources
*
* Schedule optional tasks with start times \a s, processing times \a p,
* end times \a e,
* used capacity \a u, and whether a task is mandatory \a m (a task is
* mandatory if the Boolean variable is 1) on a cumulative resource
* with capacity \a c.
*
* The propagator does not enforce \f$s_i+p_i=e_i\f$, this constraint
* has to be posted in addition to ensure consistency of the task bounds.
*
* The propagator performs time-tabling, overload checking, and
* edge-finding. It uses algorithms taken from:
*
* Petr VilÃm, Max Energy Filtering Algorithm for Discrete Cumulative
* Resources, in W. J. van Hoeve and J. N. Hooker, editors, CPAIOR, volume
* 5547 of LNCS, pages 294-308. Springer, 2009.
*
* and
*
* Petr VilÃm, Edge finding filtering algorithm for discrete cumulative
* resources in O(kn log n). In I. P. Gent, editor, CP, volume 5732 of LNCS,
* pages 802-816. Springer, 2009.
*
* - Throws an exception of type Int::ArgumentSizeMismatch, if \a s,
* \a p, \a u, or \a m are of different size.
* - Throws an exception of type Int::OutOfLimits, if \a u or \a c
* contain an integer that is not nonnegative, or that could generate
* an overflow.
*/
GECODE_INT_EXPORT void
cumulative(Home home, int c, const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntArgs& u, const BoolVarArgs& m,
IntConLevel icl=ICL_DEF);
/** \brief Post propagators for scheduling optional tasks on cumulative resources
* \copydoc cumulative(Home,int,const IntVarArgs&,const IntVarArgs&,const IntVarArgs&,const IntArgs&,const BoolVarArgs&,IntConLevel)
*/
GECODE_INT_EXPORT void
cumulative(Home home, IntVar c, const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntArgs& u, const BoolVarArgs& m,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntGraph Graph constraints
* \ingroup TaskModelInt
*/
//@{
/** \brief Post propagator such that \a x forms a circuit
*
* \a x forms a circuit if the graph with edges \f$i\to j\f$ where
* \f$x_i=j\f$ has a single cycle covering all nodes.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
*/
GECODE_INT_EXPORT void
circuit(Home home, const IntVarArgs& x,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator such that \a x forms a circuit
*
* \a x forms a circuit if the graph with edges \f$i\to j\f$ where
* \f$x_{i-\text{offset}}=j\f$ has a single cycle covering all nodes.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
* - Int::OutOfLimits, if \a offset is negative.
*/
GECODE_INT_EXPORT void
circuit(Home home, int offset, const IntVarArgs& x,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator such that \a x forms a circuit with costs \a y and \a z
*
* \a x forms a circuit if the graph with edges \f$i\to j\f$ where
* \f$x_i=j\f$ has a single cycle covering all nodes.
* The integer array
* \a c gives the costs of all possible edges where \f$c_{i*|x|+j}\f$ is
* the cost of the edge \f$i\to j\f$. The variable \a z is the cost of
* the entire circuit. The variables \a y define the cost
* of the edge in \a x: that is, if \f$x_i=j\f$ then \f$y_i=c_{i*n+j}\f$.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x for circuit.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
* - Int::ArgumentSizeMismacth, if \a x and \a y do not have the same
* size or if \f$|x|\times|x|\neq|c|\f$.
*/
GECODE_INT_EXPORT void
circuit(Home home,
const IntArgs& c,
const IntVarArgs& x, const IntVarArgs& y, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator such that \a x forms a circuit with costs \a y and \a z
*
* \a x forms a circuit if the graph with edges \f$i\to j\f$ where
* \f$x_{i-\text{offset}}=j\f$ has a single cycle covering all nodes.
* The integer array
* \a c gives the costs of all possible edges where \f$c_{i*|x|+j}\f$ is
* the cost of the edge \f$i\to j\f$. The variable \a z is the cost of
* the entire circuit. The variables \a y define the cost
* of the edge in \a x: that is, if \f$x_i=j\f$ then \f$y_i=c_{i*n+j}\f$.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x for circuit.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
* - Int::ArgumentSizeMismacth, if \a x and \a y do not have the same
* size or if \f$|x|\times|x|\neq|c|\f$.
* - Int::OutOfLimits, if \a offset is negative.
*/
GECODE_INT_EXPORT void
circuit(Home home,
const IntArgs& c, int offset,
const IntVarArgs& x, const IntVarArgs& y, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator such that \a x forms a circuit with cost \a z
*
* \a x forms a circuit if the graph with edges \f$i\to j\f$ where
* \f$x_i=j\f$ has a single cycle covering all nodes. The integer array
* \a c gives the costs of all possible edges where \f$c_{i*|x|+j}\f$ is
* the cost of the edge \f$i\to j\f$. The variable \a z is the cost of
* the entire circuit.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x for circuit.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
* - Int::ArgumentSizeMismacth, if \f$|x|\times|x|\neq|c|\f$.
*/
GECODE_INT_EXPORT void
circuit(Home home,
const IntArgs& c,
const IntVarArgs& x, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator such that \a x forms a circuit with cost \a z
*
* \a x forms a circuit if the graph with edges \f$i\to j\f$ where
* \f$x_{i-\text{offset}}=j\f$ has a single cycle covering all nodes.
* The integer array
* \a c gives the costs of all possible edges where \f$c_{i*|x|+j}\f$ is
* the cost of the edge \f$i\to j\f$. The variable \a z is the cost of
* the entire circuit.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x for circuit.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
* - Int::ArgumentSizeMismacth, if \f$|x|\times|x|\neq|c|\f$.
* - Int::OutOfLimits, if \a offset is negative.
*/
GECODE_INT_EXPORT void
circuit(Home home,
const IntArgs& c, int offset,
const IntVarArgs& x, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator such that \a x forms a Hamiltonian path
*
* \a x forms a Hamiltonian path if the graph with edges \f$i\to j\f$
* where \f$x_i=j\f$ visits all nodes exactly once. The path starts at
* node \a s and the successor of the last node \a e is equal to \f$|x|\f$.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
*/
GECODE_INT_EXPORT void
path(Home home, const IntVarArgs& x, IntVar s, IntVar e,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator such that \a x forms a Hamiltonian path
*
* \a x forms a Hamiltonian path if the graph with edges \f$i\to j\f$
* where \f$x_{i-\text{offset}}=j\f$ visits all nodes exactly once.
* The path starts at node \a s and the successor of the last node \a e
* is equal to \f$|x|+\text{offset}\f$.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
* - Int::OutOfLimits, if \a offset is negative.
*/
GECODE_INT_EXPORT void
path(Home home, int offset, const IntVarArgs& x, IntVar s, IntVar e,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator such that \a x forms a Hamiltonian path with costs \a y and \a z
*
* \a x forms a Hamiltonian path if the graph with edges \f$i\to j\f$
* where \f$x_i=j\f$ visits all nodes exactly once. The path starts at node
* \a s and the successor of
* the last node \a e is equal to \f$|x|\f$. The integer array
* \a c gives the costs of all possible edges where \f$c_{i*|x|+j}\f$ is
* the cost of the edge \f$i\to j\f$. The variable \a z is the cost of
* the entire path. The variables \a y define the cost
* of the edge in \a x: that is, if \f$x_i=j\f$ then \f$y_i=c_{i*n+j}\f$.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x for circuit.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
* - Int::ArgumentSizeMismacth, if \a x and \a y do not have the same
* size or if \f$|x|\times|x|\neq|c|\f$.
*/
GECODE_INT_EXPORT void
path(Home home,
const IntArgs& c,
const IntVarArgs& x, IntVar s, IntVar e, const IntVarArgs& y, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator such that \a x forms a Hamiltonian path with costs \a y and \a z
*
* \a x forms a Hamiltonian path if the graph with edges \f$i\to j\f$
* where \f$x_{i-\text{offset}}=j\f$ visits all nodes exactly once.
* The path starts at node \a s and the successor of
* the last node \a e is equal to \f$|x|+\text{offset}\f$.
* The integer array
* \a c gives the costs of all possible edges where \f$c_{i*|x|+j}\f$ is
* the cost of the edge \f$i\to j\f$. The variable \a z is the cost of
* the entire path. The variables \a y define the cost
* of the edge in \a x: that is, if \f$x_i=j\f$ then \f$y_i=c_{i*n+j}\f$.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x for circuit.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
* - Int::ArgumentSizeMismacth, if \a x and \a y do not have the same
* size or if \f$|x|\times|x|\neq|c|\f$.
* - Int::OutOfLimits, if \a offset is negative.
*/
GECODE_INT_EXPORT void
path(Home home,
const IntArgs& c, int offset,
const IntVarArgs& x, IntVar s, IntVar e, const IntVarArgs& y, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator such that \a x forms a Hamiltonian path with cost \a z
*
* \a x forms a Hamiltonian path if the graph with edges \f$i\to j\f$
* where \f$x_i=j\f$ visits all nodes exactly once. The path starts at node
* \a s and the successor of
* the last node \a e is equal to \f$|x|\f$. The integer array
* \a c gives the costs of all possible edges where \f$c_{i*|x|+j}\f$ is
* the cost of the edge \f$i\to j\f$. The variable \a z is the cost of
* the entire path.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x for circuit.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
* - Int::ArgumentSizeMismacth, if \f$|x|\times|x|\neq|c|\f$.
*/
GECODE_INT_EXPORT void
path(Home home,
const IntArgs& c,
const IntVarArgs& x, IntVar s, IntVar e, IntVar z,
IntConLevel icl=ICL_DEF);
/** \brief Post propagator such that \a x forms a Hamiltonian path with cost \a z
*
* \a x forms a Hamiltonian path if the graph with edges \f$i\to j\f$
* where \f$x_{i-\text{offset}}=j\f$ visits all nodes exactly once.
* The path starts at node \a s and the successor of
* the last node \a e is equal to \f$|x|+\text{offset}\f$.
* The integer array
* \a c gives the costs of all possible edges where \f$c_{i*|x|+j}\f$ is
* the cost of the edge \f$i\to j\f$. The variable \a z is the cost of
* the entire circuit.
*
* Supports domain (\a icl = ICL_DOM) and value propagation (all
* other values for \a icl), where this refers to whether value or
* domain consistent distinct in enforced on \a x for circuit.
*
* Throws the following exceptions:
* - Int::ArgumentSame, if \a x contains the same unassigned variable
* multiply.
* - Int::TooFewArguments, if \a x has no elements.
* - Int::ArgumentSizeMismacth, if \f$|x|\times|x|\neq|c|\f$.
* - Int::OutOfLimits, if \a offset is negative.
*/
GECODE_INT_EXPORT void
path(Home home,
const IntArgs& c, int offset,
const IntVarArgs& x, IntVar s, IntVar e, IntVar z,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntExec Synchronized execution
* \ingroup TaskModelInt
*
* Synchronized execution executes a function or a static member function
* when a certain event happends.
*/
//@{
/// Execute \a c when \a x becomes assigned
GECODE_INT_EXPORT void
wait(Home home, IntVar x, void (*c)(Space& home),
IntConLevel icl=ICL_DEF);
/// Execute \a c when \a x becomes assigned
GECODE_INT_EXPORT void
wait(Home home, BoolVar x, void (*c)(Space& home),
IntConLevel icl=ICL_DEF);
/// Execute \a c when all variables in \a x become assigned
GECODE_INT_EXPORT void
wait(Home home, const IntVarArgs& x, void (*c)(Space& home),
IntConLevel icl=ICL_DEF);
/// Execute \a c when all variables in \a x become assigned
GECODE_INT_EXPORT void
wait(Home home, const BoolVarArgs& x, void (*c)(Space& home),
IntConLevel icl=ICL_DEF);
/// Execute \a t (then) when \a x is assigned one, and \a e (else) otherwise
GECODE_INT_EXPORT void
when(Home home, BoolVar x,
void (*t)(Space& home), void (*e)(Space& home)= NULL,
IntConLevel icl=ICL_DEF);
//@}
/**
* \defgroup TaskModelIntUnshare Unsharing variables
* \ingroup TaskModelInt
*
* Unsharing replaces multiple occurences of the same variable by
* fresh yet equal (enforced through propagators for equality)
* variables: after unsharing a variable appears at most once. Note
* that this is only done for not yet assigned variables (as all
* propagators can handle multiple occurences of the same variable
* provided it is already assigned).
*
* Unsharing is useful for constraints that only accept variable
* arrays without multiple occurences of the same variable, for
* example extensional.
*
*/
//@{
/**
* \brief Replace multiple variable occurences in \a x by fresh variables
*
* Supports domain consistency (\a icl = ICL_DOM, default) and
* bounds consistency (\a icl = ICL_BND).
*
*/
GECODE_INT_EXPORT void
unshare(Home home, IntVarArgs& x,
IntConLevel icl=ICL_DEF);
/// Replace multiple variable occurences in \a x by fresh variables
GECODE_INT_EXPORT void
unshare(Home home, BoolVarArgs& x,
IntConLevel icl=ICL_DEF);
//@}
}
namespace Gecode {
/**
* \defgroup TaskModelIntBranch Branching
* \ingroup TaskModelInt
*/
/**
* \brief Branch filter function type for integer variables
*
* The variable \a x is considered for selection and \a i refers to the
* variable's position in the original array passed to the brancher.
*
* \ingroup TaskModelIntBranch
*/
typedef bool (*IntBranchFilter)(const Space& home, IntVar x, int i);
/**
* \brief Branch filter function type for Boolean variables
*
* The variable \a x is considered for selection and \a i refers to the
* variable's position in the original array passed to the brancher.
*
* \ingroup TaskModelIntBranch
*/
typedef bool (*BoolBranchFilter)(const Space& home, BoolVar x, int i);
/**
* \brief Branch merit function type for integer variables
*
* The function must return a merit value for the variable
* \a x. The integer \a i refers to the variable's position
* in the original array passed to the brancher.
*
* \ingroup TaskModelIntBranch
*/
typedef double (*IntBranchMerit)(const Space& home, IntVar x, int i);
/**
* \brief Branch merit function type for Boolean variables
*
* The function must return a merit value for the variable
* \a x. The integer \a i refers to the variable's position
* in the original array passed to the brancher.
*
* \ingroup TaskModelIntBranch
*/
typedef double (*BoolBranchMerit)(const Space& home, BoolVar x, int i);
/**
* \brief Branch value function type for integer variables
*
* Returns a value for the variable \a x that is to be used in the
* corresponding branch commit function. The integer \a i refers
* to the variable's position in the original array passed to the
* brancher.
*
* \ingroup TaskModelIntBranch
*/
typedef int (*IntBranchVal)(const Space& home, IntVar x, int i);
/**
* \brief Branch value function type for Boolean variables
*
* Returns a value for the variable \a x that is to be used in the
* corresponding branch commit function. The integer \a i refers
* to the variable's position in the original array passed to the
* brancher.
*
* \ingroup TaskModelIntBranch
*/
typedef int (*BoolBranchVal)(const Space& home, BoolVar x, int i);
/**
* \brief Branch commit function type for integer variables
*
* The function must post a constraint on the variable \a x which
* corresponds to the alternative \a a. The integer \a i refers
* to the variable's position in the original array passed to the
* brancher. The value \a n is the value
* computed by the corresponding branch value function.
*
* \ingroup TaskModelIntBranch
*/
typedef void (*IntBranchCommit)(Space& home, unsigned int a,
IntVar x, int i, int n);
/**
* \brief Branch commit function type for Boolean variables
*
* The function must post a constraint on the variable \a x which
* corresponds to the alternative \a a. The integer \a i refers
* to the variable's position in the original array passed to the
* brancher. The value \a n is the value
* computed by the corresponding branch value function.
*
* \ingroup TaskModelIntBranch
*/
typedef void (*BoolBranchCommit)(Space& home, unsigned int a,
BoolVar x, int i, int n);
}
#include <gecode/int/branch/traits.hpp>
namespace Gecode {
/**
* \brief Recording AFC information for integer and Boolean variables
*
* \ingroup TaskModelIntBranch
*/
class IntAFC : public AFC {
public:
/**
* \brief Construct as not yet initialized
*
* The only member functions that can be used on a constructed but not
* yet initialized AFC storage is init or the assignment operator.
*
*/
IntAFC(void);
/// Copy constructor
IntAFC(const IntAFC& a);
/// Assignment operator
IntAFC& operator =(const IntAFC& a);
/// Initialize for integer variables \a x with decay factor \a d
IntAFC(Home home, const IntVarArgs& x, double d=1.0);
/// Initialize for Boolean variables \a x with decay factor \a d
IntAFC(Home home, const BoolVarArgs& x, double d=1.0);
/**
* \brief Initialize for integer variables \a x with decay factor \a d
*
* This member function can only be used once and only if the
* AFC storage has been constructed with the default constructor.
*
*/
void init(Home, const IntVarArgs& x, double d=1.0);
/**
* \brief Initialize for Boolean variables \a x with decay factor \a d
*
* This member function can only be used once and only if the
* AFC storage has been constructed with the default constructor.
*
*/
void init(Home, const BoolVarArgs& x, double d=1.0);
};
}
#include <gecode/int/branch/afc.hpp>
namespace Gecode {
/**
* \brief Recording activities for integer and Boolean variables
*
* \ingroup TaskModelIntBranch
*/
class IntActivity : public Activity {
public:
/**
* \brief Construct as not yet initialized
*
* The only member functions that can be used on a constructed but not
* yet initialized activity storage is init or the assignment operator.
*
*/
IntActivity(void);
/// Copy constructor
IntActivity(const IntActivity& a);
/// Assignment operator
IntActivity& operator =(const IntActivity& a);
/**
* \brief Initialize for integer variables \a x with decay factor \a d
*
* If the branch merit function \a bm is different from NULL, the
* activity for each variable is initialized with the merit returned
* by \a bm.
*/
GECODE_INT_EXPORT
IntActivity(Home home, const IntVarArgs& x, double d=1.0,
IntBranchMerit bm=NULL);
/**
* \brief Initialize for Boolean variables \a x with decay factor \a d
*
* If the branch merit function \a bm is different from NULL, the
* activity for each variable is initialized with the merit returned
* by \a bm.
*/
GECODE_INT_EXPORT
IntActivity(Home home, const BoolVarArgs& x, double d=1.0,
BoolBranchMerit bm=NULL);
/**
* \brief Initialize for integer variables \a x with decay factor \a d
*
* If the branch merit function \a bm is different from NULL, the
* activity for each variable is initialized with the merit returned
* by \a bm.
*
* This member function can only be used once and only if the
* activity storage has been constructed with the default constructor.
*
*/
GECODE_INT_EXPORT void
init(Home home, const IntVarArgs& x, double d=1.0,
IntBranchMerit bm=NULL);
/**
* \brief Initialize for Boolean variables \a x with decay factor \a d
*
* If the branch merit function \a bm is different from NULL, the
* activity for each variable is initialized with the merit returned
* by \a bm.
*
* This member function can only be used once and only if the
* activity storage has been constructed with the default constructor.
*
*/
GECODE_INT_EXPORT void
init(Home home, const BoolVarArgs& x, double d=1.0,
BoolBranchMerit bm=NULL);
};
}
#include <gecode/int/branch/activity.hpp>
namespace Gecode {
/// Function type for printing branching alternatives for integer variables
typedef void (*IntVarValPrint)(const Space &home, const BrancherHandle& bh,
unsigned int a,
IntVar x, int i, const int& n,
std::ostream& o);
/// Function type for printing branching alternatives for Boolean variables
typedef void (*BoolVarValPrint)(const Space &home, const BrancherHandle& bh,
unsigned int a,
BoolVar x, int i, const int& n,
std::ostream& o);
}
namespace Gecode {
/**
* \brief Which variable to select for branching
*
* \ingroup TaskModelIntBranch
*/
class IntVarBranch : public VarBranch {
public:
/// Which variable selection
enum Select {
SEL_NONE = 0, ///< First unassigned
SEL_RND, ///< Random (uniform, for tie breaking)
SEL_MERIT_MIN, ///< With least merit
SEL_MERIT_MAX, ///< With highest merit
SEL_DEGREE_MIN, ///< With smallest degree
SEL_DEGREE_MAX, ///< With largest degree
SEL_AFC_MIN, ///< With smallest accumulated failure count
SEL_AFC_MAX, ///< With largest accumulated failure count
SEL_ACTIVITY_MIN, ///< With lowest activity
SEL_ACTIVITY_MAX, ///< With highest activity
SEL_MIN_MIN, ///< With smallest min
SEL_MIN_MAX, ///< With largest min
SEL_MAX_MIN, ///< With smallest max
SEL_MAX_MAX, ///< With largest max
SEL_SIZE_MIN, ///< With smallest domain size
SEL_SIZE_MAX, ///< With largest domain size
SEL_DEGREE_SIZE_MIN, ///< With smallest degree divided by domain size
SEL_DEGREE_SIZE_MAX, ///< With largest degree divided by domain size
SEL_AFC_SIZE_MIN, ///< With smallest accumulated failure count divided by domain size
SEL_AFC_SIZE_MAX, ///< With largest accumulated failure count divided by domain size
SEL_ACTIVITY_SIZE_MIN, ///< With smallest activity divided by domain size
SEL_ACTIVITY_SIZE_MAX, ///< With largest activity divided by domain size
/** \brief With smallest min-regret
*
* The min-regret of a variable is the difference between the
* smallest and second-smallest value still in the domain.
*/
SEL_REGRET_MIN_MIN,
/** \brief With largest min-regret
*
* The min-regret of a variable is the difference between the
* smallest and second-smallest value still in the domain.
*/
SEL_REGRET_MIN_MAX,
/** \brief With smallest max-regret
*
* The max-regret of a variable is the difference between the
* largest and second-largest value still in the domain.
*/
SEL_REGRET_MAX_MIN,
/** \brief With largest max-regret
*
* The max-regret of a variable is the difference between the
* largest and second-largest value still in the domain.
*/
SEL_REGRET_MAX_MAX
};
protected:
/// Which variable to select
Select s;
public:
/// Initialize with strategy SEL_NONE
IntVarBranch(void);
/// Initialize with random number generator \a r
IntVarBranch(Rnd r);
/// Initialize with selection strategy \a s and tie-break limit function \a t
IntVarBranch(Select s, BranchTbl t);
/// Initialize with selection strategy \a s, decay factor \a d, and tie-break limit function \a t
IntVarBranch(Select s, double d, BranchTbl t);
/// Initialize with selection strategy \a s, AFC \a a, and tie-break limit function \a t
IntVarBranch(Select s, AFC a, BranchTbl t);
/// Initialize with selection strategy \a s, activity \a a, and tie-break limit function \a t
IntVarBranch(Select s, Activity a, BranchTbl t);
/// Initialize with selection strategy \a s, branch merit function \a mf, and tie-break limit function \a t
IntVarBranch(Select s, VoidFunction mf, BranchTbl t);
/// Return selection strategy
Select select(void) const;
/// Expand decay factor into AFC or activity
void expand(Home home, const IntVarArgs& x);
/// Expand decay factor into AFC or activity
void expand(Home home, const BoolVarArgs& x);
};
/**
* \defgroup TaskModelIntBranchVar Variable selection for integer and Boolean variables
* \ingroup TaskModelIntBranch
*/
//@{
/// Select first unassigned variable
IntVarBranch INT_VAR_NONE(void);
/// Select random variable (uniform distribution, for tie breaking)
IntVarBranch INT_VAR_RND(Rnd r);
/// Select variable with least merit according to branch merit function \a bm
IntVarBranch INT_VAR_MERIT_MIN(IntBranchMerit bm, BranchTbl tbl=NULL);
/// Select variable with least merit according to branch merit function \a bm
IntVarBranch INT_VAR_MERIT_MIN(BoolBranchMerit bm, BranchTbl tbl=NULL);
/// Select variable with highest merit according to branch merit function \a bm
IntVarBranch INT_VAR_MERIT_MAX(IntBranchMerit bm, BranchTbl tbl=NULL);
/// Select variable with highest merit according to branch merit function \a bm
IntVarBranch INT_VAR_MERIT_MAX(BoolBranchMerit bm, BranchTbl tbl=NULL);
/// Select variable with smallest degree
IntVarBranch INT_VAR_DEGREE_MIN(BranchTbl tbl=NULL);
/// Select variable with largest degree
IntVarBranch INT_VAR_DEGREE_MAX(BranchTbl tbl=NULL);
/// Select variable with smallest accumulated failure count with decay factor \a d
IntVarBranch INT_VAR_AFC_MIN(double d=1.0, BranchTbl tbl=NULL);
/// Select variable with smallest accumulated failure count
IntVarBranch INT_VAR_AFC_MIN(IntAFC a, BranchTbl tbl=NULL);
/// Select variable with largest accumulated failure count with decay factor \a d
IntVarBranch INT_VAR_AFC_MAX(double d=1.0, BranchTbl tbl=NULL);
/// Select variable with largest accumulated failure count
IntVarBranch INT_VAR_AFC_MAX(IntAFC a, BranchTbl tbl=NULL);
/// Select variable with lowest activity with decay factor \a d
IntVarBranch INT_VAR_ACTIVITY_MIN(double d=1.0, BranchTbl tbl=NULL);
/// Select variable with lowest activity
IntVarBranch INT_VAR_ACTIVITY_MIN(IntActivity a, BranchTbl tbl=NULL);
/// Select variable with highest activity with decay factor \a d
IntVarBranch INT_VAR_ACTIVITY_MAX(double d=1.0, BranchTbl tbl=NULL);
/// Select variable with highest activity
IntVarBranch INT_VAR_ACTIVITY_MAX(IntActivity a, BranchTbl tbl=NULL);
/// Select variable with smallest min
IntVarBranch INT_VAR_MIN_MIN(BranchTbl tbl=NULL);
/// Select variable with largest min
IntVarBranch INT_VAR_MIN_MAX(BranchTbl tbl=NULL);
/// Select variable with smallest max
IntVarBranch INT_VAR_MAX_MIN(BranchTbl tbl=NULL);
/// Select variable with largest max
IntVarBranch INT_VAR_MAX_MAX(BranchTbl tbl=NULL);
/// Select variable with smallest domain size
IntVarBranch INT_VAR_SIZE_MIN(BranchTbl tbl=NULL);
/// Select variable with largest domain size
IntVarBranch INT_VAR_SIZE_MAX(BranchTbl tbl=NULL);
/// Select variable with smallest degree divided by domain size
IntVarBranch INT_VAR_DEGREE_SIZE_MIN(BranchTbl tbl=NULL);
/// Select variable with largest degree divided by domain size
IntVarBranch INT_VAR_DEGREE_SIZE_MAX(BranchTbl tbl=NULL);
/// Select variable with smallest accumulated failure count divided by domain size with decay factor \a d
IntVarBranch INT_VAR_AFC_SIZE_MIN(double d=1.0, BranchTbl tbl=NULL);
/// Select variable with smallest accumulated failure count divided by domain size
IntVarBranch INT_VAR_AFC_SIZE_MIN(IntAFC a, BranchTbl tbl=NULL);
/// Select variable with largest accumulated failure count divided by domain size with decay factor \a d
IntVarBranch INT_VAR_AFC_SIZE_MAX(double d=1.0, BranchTbl tbl=NULL);
/// Select variable with largest accumulated failure count divided by domain size
IntVarBranch INT_VAR_AFC_SIZE_MAX(IntAFC a, BranchTbl tbl=NULL);
/// Select variable with smallest activity divided by domain size with decay factor \a d
IntVarBranch INT_VAR_ACTIVITY_SIZE_MIN(double d=1.0, BranchTbl tbl=NULL);
/// Select variable with smallest activity divided by domain size
IntVarBranch INT_VAR_ACTIVITY_SIZE_MIN(IntActivity a, BranchTbl tbl=NULL);
/// Select variable with largest activity divided by domain size with decay factor \a d
IntVarBranch INT_VAR_ACTIVITY_SIZE_MAX(double d=1.0, BranchTbl tbl=NULL);
/// Select variable with largest activity divided by domain size
IntVarBranch INT_VAR_ACTIVITY_SIZE_MAX(IntActivity a, BranchTbl tbl=NULL);
/** \brief Select variable with smallest min-regret
*
* The min-regret of a variable is the difference between the
* smallest and second-smallest value still in the domain.
*/
IntVarBranch INT_VAR_REGRET_MIN_MIN(BranchTbl tbl=NULL);
/** \brief Select variable with largest min-regret
*
* The min-regret of a variable is the difference between the
* smallest and second-smallest value still in the domain.
*/
IntVarBranch INT_VAR_REGRET_MIN_MAX(BranchTbl tbl=NULL);
/** \brief Select variable with smallest max-regret
*
* The max-regret of a variable is the difference between the
* largest and second-largest value still in the domain.
*/
IntVarBranch INT_VAR_REGRET_MAX_MIN(BranchTbl tbl=NULL);
/** \brief Select variable with largest max-regret
*
* The max-regret of a variable is the difference between the
* largest and second-largest value still in the domain.
*/
IntVarBranch INT_VAR_REGRET_MAX_MAX(BranchTbl tbl=NULL);
//@}
}
#include <gecode/int/branch/var.hpp>
namespace Gecode {
/**
* \brief Which values to select for branching first
*
* \ingroup TaskModelIntBranch
*/
class IntValBranch : public ValBranch {
public:
/// Which value selection
enum Select {
SEL_MIN, ///< Select smallest value
SEL_MED, ///< Select greatest value not greater than the median
SEL_MAX, ///< Select largest value
SEL_RND, ///< Select random value
SEL_SPLIT_MIN, ///< Select values not greater than mean of smallest and largest value
SEL_SPLIT_MAX, ///< Select values greater than mean of smallest and largest value
SEL_RANGE_MIN, ///< Select the smallest range of the variable domain if it has several ranges, otherwise select values not greater than mean of smallest and largest value
SEL_RANGE_MAX, ///< Select the largest range of the variable domain if it has several ranges, otherwise select values greater than mean of smallest and largest value
SEL_VAL_COMMIT, ///< Select value according to user-defined functions
SEL_VALUES_MIN, ///< Select all values starting from smallest
SEL_VALUES_MAX, ///< Select all values starting from largest
SEL_NEAR_MIN, ///< Select value nearest to a given value, use smaller one in case of ties
SEL_NEAR_MAX, ///< Select value nearest to a given value, use larger one in case of ties
SEL_NEAR_INC, ///< Select value near to a given value, increment values first
SEL_NEAR_DEC ///< Select value near to a given value, decrement values first
};
protected:
/// Array of values for near strategies
IntSharedArray n;
/// Which value to select
Select s;
public:
/// Initialize with selection strategy \a s
IntValBranch(Select s = SEL_MIN);
/// Initialize with random number generator \a r
IntValBranch(Rnd r);
/// Initialize with value function \a f and commit function \a c
IntValBranch(VoidFunction v, VoidFunction c);
/// Initialize with selection startegy \a s and values \a n
IntValBranch(Select s, IntSharedArray n);
/// Return selection strategy
Select select(void) const;
/// Return shared array of values
IntSharedArray values(void) const;
};
/**
* \defgroup TaskModelIntBranchVal Value selection for integer and Boolean variables
* \ingroup TaskModelIntBranch
*/
//@{
/// Select smallest value
IntValBranch INT_VAL_MIN(void);
/// Select greatest value not greater than the median
IntValBranch INT_VAL_MED(void);
/// Select largest value
IntValBranch INT_VAL_MAX(void);
/// Select random value
IntValBranch INT_VAL_RND(Rnd r);
/// Select values not greater than mean of smallest and largest value
IntValBranch INT_VAL_SPLIT_MIN(void);
/// Select values greater than mean of smallest and largest value
IntValBranch INT_VAL_SPLIT_MAX(void);
/// Select the smallest range of the variable domain if it has several ranges, otherwise select values not greater than mean of smallest and largest value
IntValBranch INT_VAL_RANGE_MIN(void);
/// Select the largest range of the variable domain if it has several ranges, otherwise select values greater than mean of smallest and largest value
IntValBranch INT_VAL_RANGE_MAX(void);
/**
* \brief Select value as defined by the value function \a v and commit function \a c
* Uses a commit function as default that posts the constraints that
* a variable \a x must be equal to a value \a n for the first alternative
* and that \a x must be different from \a n for the second alternative.
*/
IntValBranch INT_VAL(IntBranchVal v, IntBranchCommit c=NULL);
/**
* \brief Select value as defined by the value function \a v and commit function \a c
* Uses a commit function as default that posts the constraints that
* a variable \a x must be equal to a value \a n for the first alternative
* and that \a x must be different from \a n for the second alternative.
*/
IntValBranch INT_VAL(BoolBranchVal v, BoolBranchCommit c=NULL);
/// Try all values starting from smallest
IntValBranch INT_VALUES_MIN(void);
/// Try all values starting from largest
IntValBranch INT_VALUES_MAX(void);
/// Try value nearest to a given value for a variable, in case of ties use the smaller value
IntValBranch INT_VAL_NEAR_MIN(IntSharedArray n);
/// Try value nearest to a given value for a variable, in case of ties use the larger value
IntValBranch INT_VAL_NEAR_MAX(IntSharedArray n);
/// Try value larger than a given value for a variable first
IntValBranch INT_VAL_NEAR_INC(IntSharedArray n);
/// Try value smaller than a given value for a variable first
IntValBranch INT_VAL_NEAR_DEC(IntSharedArray n);
//@}
}
#include <gecode/int/branch/val.hpp>
namespace Gecode {
/**
* \brief Which values to select for assignment
*
* \ingroup TaskModelIntBranch
*/
class IntAssign : public ValBranch {
public:
/// Which value selection
enum Select {
SEL_MIN, ///< Select smallest value
SEL_MED, ///< Select greatest value not greater than the median
SEL_MAX, ///< Select largest value
SEL_RND, ///< Select random value
SEL_VAL_COMMIT ///< Select value according to user-defined functions
};
protected:
/// Which value to select
Select s;
public:
/// Initialize with selection strategy \a s
IntAssign(Select s = SEL_MIN);
/// Initialize with random number generator \a r
IntAssign(Rnd r);
/// Initialize with value function \a f and commit function \a c
IntAssign(VoidFunction v, VoidFunction c);
/// Return selection strategy
Select select(void) const;
};
/**
* \defgroup TaskModelIntBranchAssign Value selection for assigning integer and Boolean variables
* \ingroup TaskModelIntBranch
*/
//@{
/// Select smallest value
IntAssign INT_ASSIGN_MIN(void);
/// Select greatest value not greater than the median
IntAssign INT_ASSIGN_MED(void);
/// Select largest value
IntAssign INT_ASSIGN_MAX(void);
/// Select random value
IntAssign INT_ASSIGN_RND(Rnd r);
/**
* \brief Select value as defined by the value function \a v and commit function \a c
*
* Uses a commit function as default that posts the constraint that
* a variable \a x must be equal to the value \a n.
*/
IntAssign INT_ASSIGN(IntBranchVal v, IntBranchCommit c=NULL);
/**
* \brief Select value as defined by the value function \a v and commit function \a c
*
* Uses a commit function as default that posts the constraint that
* a variable \a x must be equal to the value \a n.
*/
IntAssign INT_ASSIGN(BoolBranchVal v, BoolBranchCommit c=NULL);
//@}
}
#include <gecode/int/branch/assign.hpp>
namespace Gecode {
/**
* \brief Branch over \a x with variable selection \a vars and value selection \a vals
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
branch(Home home, const IntVarArgs& x,
IntVarBranch vars, IntValBranch vals,
IntBranchFilter bf=NULL,
IntVarValPrint vvp=NULL);
/**
* \brief Branch over \a x with tie-breaking variable selection \a vars and value selection \a vals
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
branch(Home home, const IntVarArgs& x,
TieBreak<IntVarBranch> vars, IntValBranch vals,
IntBranchFilter bf=NULL,
IntVarValPrint vvp=NULL);
/**
* \brief Branch over \a x with value selection \a vals
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
branch(Home home, IntVar x, IntValBranch vals,
IntVarValPrint vvp=NULL);
/**
* \brief Branch over \a x with variable selection \a vars and value selection \a vals
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
branch(Home home, const BoolVarArgs& x,
IntVarBranch vars, IntValBranch vals,
BoolBranchFilter bf=NULL,
BoolVarValPrint vvp=NULL);
/**
* \brief Branch over \a x with tie-breaking variable selection \a vars and value selection \a vals
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
branch(Home home, const BoolVarArgs& x,
TieBreak<IntVarBranch> vars, IntValBranch vals,
BoolBranchFilter bf=NULL,
BoolVarValPrint vvp=NULL);
/**
* \brief Branch over \a x with value selection \a vals
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
branch(Home home, BoolVar x, IntValBranch vals,
BoolVarValPrint vvp=NULL);
/**
* \brief Assign all \a x with value selection \a vals
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
assign(Home home, const IntVarArgs& x, IntAssign vals,
IntBranchFilter ibf=NULL,
IntVarValPrint vvp=NULL);
/**
* \brief Assign \a x with value selection \a vals
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
assign(Home home, IntVar x, IntAssign vals,
IntVarValPrint vvp=NULL);
/**
* \brief Assign all \a x with value selection \a vals
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
assign(Home home, const BoolVarArgs& x, IntAssign vals,
BoolBranchFilter bbf=NULL,
BoolVarValPrint vvp=NULL);
/**
* \brief Assign \a x with value selection \a vals
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
assign(Home home, BoolVar x, IntAssign vals,
BoolVarValPrint vvp=NULL);
}
namespace Gecode {
/** Print DFA \a d
* \relates Gecode::DFA
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const DFA& d);
/** Print TupleSet \a ts
* \relates Gecode::TupleSet
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const TupleSet& ts);
}
// LDSB-related declarations.
namespace Gecode {
namespace Int { namespace LDSB {
class SymmetryObject;
}}
/**
* \brief A reference-counted pointer to a SymmetryObject
*
* \ingroup TaskModelIntBranch
*/
class GECODE_INT_EXPORT SymmetryHandle {
public:
/// Symmetry object that this handle refers to.
Int::LDSB::SymmetryObject* ref;
/// Increment counter
void increment(void);
/// Decrement counter
void decrement(void);
public:
/// Default constructor
SymmetryHandle(void);
/// Initialies with a SymmetryObject
SymmetryHandle(Int::LDSB::SymmetryObject* o);
/// Copy constructor
SymmetryHandle(const SymmetryHandle& h);
/// Assignment operator
const SymmetryHandle& operator=(const SymmetryHandle& h);
/// Destructor
~SymmetryHandle(void);
};
class Symmetries;
/// Traits of %Symmetries
template<>
class ArrayTraits<ArgArray<SymmetryHandle> > {
public:
typedef Symmetries StorageType;
typedef SymmetryHandle ValueType;
typedef Symmetries ArgsType;
};
/**
* \defgroup TaskModelIntBranchSymm Symmetry declarations
*
* \ingroup TaskModelIntBranch
*/
//@{
/// Collection of symmetries
class Symmetries : public ArgArray<SymmetryHandle> {};
// If this is instead a typedef, strange things happen with the
// overloading of the "branch" function.
/// Variables in \a x are interchangeable
GECODE_INT_EXPORT SymmetryHandle VariableSymmetry(const IntVarArgs& x);
/// Variables in \a x are interchangeable
GECODE_INT_EXPORT SymmetryHandle VariableSymmetry(const BoolVarArgs& x);
/// Specified variables in \a x are interchangeable
GECODE_INT_EXPORT SymmetryHandle VariableSymmetry(const IntVarArgs& x,
const IntArgs& indices);
/// Values in \a v are interchangeable
GECODE_INT_EXPORT SymmetryHandle ValueSymmetry(const IntArgs& v);
/// Values in \a v are interchangeable
GECODE_INT_EXPORT SymmetryHandle ValueSymmetry(const IntSet& v);
/// All values in the domain of the given variable are interchangeable
GECODE_INT_EXPORT SymmetryHandle ValueSymmetry(IntVar vars);
/**
* \brief Variable sequences in \a x of size \a ss are interchangeable
*
* The size of \a x must be a multiple of \a ss.
*/
GECODE_INT_EXPORT
SymmetryHandle VariableSequenceSymmetry(const IntVarArgs& x, int ss);
/**
* \brief Variable sequences in \a x of size \a ss are interchangeable
*
* The size of \a x must be a multiple of \a ss.
*/
GECODE_INT_EXPORT
SymmetryHandle VariableSequenceSymmetry(const BoolVarArgs& x, int ss);
/**
* \brief Value sequences in \a v of size \a ss are interchangeable
*
* The size of \a v must be a multiple of \a ss.
*/
GECODE_INT_EXPORT
SymmetryHandle ValueSequenceSymmetry(const IntArgs& v, int ss);
/// The values from \a lower to \a upper (inclusive) can be reflected
GECODE_INT_EXPORT SymmetryHandle values_reflect(int lower, int upper);
/// The values in the domain of \x can be reflected
GECODE_INT_EXPORT SymmetryHandle values_reflect(IntVar x);
//@}
/**
* \brief Branch over \a x with variable selection \a vars and value
* selection \a vals with symmetry breaking
*
* Throws LDSBBadValueSelection exception if \a vals is any of
* SEL_SPLIT_MIN, SEL_SPLIT_MAX, SEL_RANGE_MIN, SEL_RANGE_MAX,
* SEL_VALUES_MIN, and SEL_VALUES_MAX, or if \a vals is
* SEL_VAL_COMMIT with a custom commit function.
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
branch(Home home, const IntVarArgs& x,
IntVarBranch vars, IntValBranch vals,
const Symmetries& syms,
IntBranchFilter bf=NULL, IntVarValPrint vvp=NULL);
/**
* \brief Branch over \a x with tie-breaking variable selection \a
* vars and value selection \a vals with symmetry breaking
*
* Throws LDSBBadValueSelection exception if \a vals is any of
* SEL_SPLIT_MIN, SEL_SPLIT_MAX, SEL_RANGE_MIN, SEL_RANGE_MAX,
* SEL_VALUES_MIN, and SEL_VALUES_MAX, or if \a vals is
* SEL_VAL_COMMIT with a custom commit function.
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
branch(Home home, const IntVarArgs& x,
TieBreak<IntVarBranch> vars, IntValBranch vals,
const Symmetries& syms,
IntBranchFilter bf=NULL, IntVarValPrint vvp=NULL);
/**
* \brief Branch over \a x with variable selection \a vars and value
* selection \a vals with symmetry breaking
*
* Throws LDSBBadValueSelection exception if \a vals is any of
* SEL_SPLIT_MIN, SEL_SPLIT_MAX, SEL_RANGE_MIN, SEL_RANGE_MAX,
* SEL_VALUES_MIN, and SEL_VALUES_MAX, or if \a vals is
* SEL_VAL_COMMIT with a custom commit function.
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
branch(Home home, const BoolVarArgs& x,
IntVarBranch vars, IntValBranch vals,
const Symmetries& syms,
BoolBranchFilter bf=NULL, BoolVarValPrint vvp=NULL);
/**
* \brief Branch over \a x with tie-breaking variable selection \a
* vars and value selection \a vals with symmetry breaking
*
* Throws LDSBBadValueSelection exception if \a vals is any of
* SEL_SPLIT_MIN, SEL_SPLIT_MAX, SEL_RANGE_MIN, SEL_RANGE_MAX,
* SEL_VALUES_MIN, and SEL_VALUES_MAX, or if \a vals is
* SEL_VAL_COMMIT with a custom commit function.
*
* \ingroup TaskModelIntBranch
*/
GECODE_INT_EXPORT BrancherHandle
branch(Home home, const BoolVarArgs& x,
TieBreak<IntVarBranch> vars, IntValBranch vals,
const Symmetries& syms,
BoolBranchFilter bf=NULL, BoolVarValPrint vvp=NULL);
}
#endif
// IFDEF: GECODE_HAS_INT_VARS
// STATISTICS: int-post
|